COIN-OR::LEMON - Graph Library

source: lemon-0.x/lemon/graph_writer.h @ 2229:4dbb6dd2dd4b

Last change on this file since 2229:4dbb6dd2dd4b was 2200:2f2ac1b1ca1e, checked in by Balazs Dezso, 18 years ago

An easy avoiding of a bug

The functional interfaces are removed.
Better solution could be a reference counted core of the io interfaces

Now it is huge work so just write that:

GraphReader?<ListGraph?>(std::cin, graph).

Instead of:

graphReader(std::cin, graph).

File size: 19.2 KB
RevLine 
[1137]1/* -*- C++ -*-
2 *
[1956]3 * This file is a part of LEMON, a generic C++ optimization library
4 *
5 * Copyright (C) 2003-2006
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
[1359]7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
[1137]8 *
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
12 *
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
15 * purpose.
16 *
17 */
18
[2083]19///\ingroup lemon_io
[1137]20///\file
[1287]21///\brief Lemon Graph Format writer.
[1534]22///
[1137]23
[1214]24#ifndef LEMON_GRAPH_WRITER_H
25#define LEMON_GRAPH_WRITER_H
[1137]26
27#include <iostream>
28
29#include <lemon/error.h>
[1409]30#include <lemon/lemon_writer.h>
[1137]31
32namespace lemon {
33
[2083]34  /// \addtogroup lemon_io
[1333]35  /// @{
36
[1137]37  /// \brief The graph writer class.
38  ///
[2200]39  /// The \c GraphWriter class provides the graph output.  Before you
40  /// read this documentation it might be useful to read the general
41  /// description of \ref graph-io-page "Graph Input-Output".
[1540]42  ///
[2200]43  /// To write a graph you should first give writing commands to the
44  /// writer. You can declare write commands as \c NodeMap or \c
45  /// EdgeMap writing and labeled Node and Edge writing.
[1333]46  ///
[1946]47  ///\code
[1333]48  /// GraphWriter<ListGraph> writer(std::cout, graph);
[1946]49  ///\endcode
[1333]50  ///
[2200]51  /// The \c writeNodeMap() function declares a \c NodeMap writing
52  /// command in the \c GraphWriter. You should give as parameter the
53  /// name of the map and the map object. The NodeMap writing command
54  /// with name "label" should write a unique map because it is
55  /// regarded as label map (such a map is essential if the graph has
56  /// edges).
[1333]57  ///
[1946]58  ///\code
[1901]59  /// IdMap<ListGraph, Node> nodeLabelMap;
60  /// writer.writeNodeMap("label", nodeLabelMap);
[1333]61  ///
[1421]62  /// writer.writeNodeMap("coords", coords);
[1394]63  /// writer.writeNodeMap("color", colorMap);
[1946]64  ///\endcode
[1333]65  ///
[1394]66  /// With the \c writeEdgeMap() member function you can give an edge map
[1333]67  /// writing command similar to the NodeMaps.
68  ///
[1946]69  ///\code
[1333]70  /// DescriptorMap<ListGraph, Edge, ListGraph::EdgeMap<int> >
71  ///   edgeDescMap(graph);
[1394]72  /// writer.writeEdgeMap("descriptor", edgeDescMap);
[1333]73  ///
[1394]74  /// writer.writeEdgeMap("weight", weightMap);
75  /// writer.writeEdgeMap("label", labelMap);
[1946]76  ///\endcode
[1333]77  ///
[1394]78  /// With \c writeNode() and \c writeEdge() functions you can
[1526]79  /// point out Nodes and Edges in the graph. For example, you can
80  /// write out the source and target of a maximum flow instance.
[1333]81  ///
[1946]82  ///\code
[1394]83  /// writer.writeNode("source", sourceNode);
84  /// writer.writeNode("target", targetNode);
[1333]85  ///
[1394]86  /// writer.writeEdge("observed", edge);
[1946]87  ///\endcode
[1333]88  ///
89  /// After you give all write commands you must call the \c run() member
[1526]90  /// function, which executes all the writing commands.
[1333]91  ///
[1946]92  ///\code
[1333]93  /// writer.run();
[1946]94  ///\endcode
[1333]95  ///
[1287]96  /// \see DefaultWriterTraits
97  /// \see QuotedStringWriter
[1333]98  /// \see IdMap
99  /// \see DescriptorMap
[1421]100  /// \see \ref GraphReader
[1138]101  /// \see \ref graph-io-page
[1333]102  /// \author Balazs Dezso
[1137]103  template <typename _Graph, typename _WriterTraits = DefaultWriterTraits>
104  class GraphWriter {
105  public:
106   
107    typedef _Graph Graph;
108    typedef typename Graph::Node Node;
109    typedef typename Graph::Edge Edge;
110
111    typedef _WriterTraits WriterTraits;
[1409]112
[1137]113    /// \brief Construct a new GraphWriter.
114    ///
[1526]115    /// This function constructs a new GraphWriter to write the given graph
[1409]116    /// to the given stream.
[1208]117    GraphWriter(std::ostream& _os, const Graph& _graph)
[1409]118      : writer(new LemonWriter(_os)), own_writer(true),
[1421]119        nodeset_writer(*writer, _graph, std::string()),
120        edgeset_writer(*writer, _graph, nodeset_writer, std::string()),
[1409]121        node_writer(*writer, nodeset_writer, std::string()),
122        edge_writer(*writer, edgeset_writer, std::string()),
123        attribute_writer(*writer, std::string()) {}
[1137]124
[1409]125    /// \brief Construct a new GraphWriter.
126    ///
[1526]127    /// This function constructs a new GraphWriter to write the given graph
[1409]128    /// to the given file.
129    GraphWriter(const std::string& _filename, const Graph& _graph)
130      : writer(new LemonWriter(_filename)), own_writer(true),
[1421]131        nodeset_writer(*writer, _graph, std::string()),
132        edgeset_writer(*writer, _graph, nodeset_writer, std::string()),
[1409]133        node_writer(*writer, nodeset_writer, std::string()),
134        edge_writer(*writer, edgeset_writer, std::string()),
135        attribute_writer(*writer, std::string()) {}
136
137    /// \brief Construct a new GraphWriter.
138    ///
[1526]139    /// This function constructs a new GraphWriter to write the given graph
140    /// to the given LemonReader.
[1409]141    GraphWriter(LemonWriter& _writer, const Graph& _graph)
142      : writer(_writer), own_writer(false),
[1421]143        nodeset_writer(*writer, _graph, std::string()),
144        edgeset_writer(*writer, _graph, nodeset_writer, std::string()),
[1409]145        node_writer(*writer, nodeset_writer, std::string()),
146        edge_writer(*writer, edgeset_writer, std::string()),
147        attribute_writer(*writer, std::string()) {}
[1137]148
149    /// \brief Destruct the graph writer.
150    ///
[1526]151    /// This function destructs the graph writer.
[1137]152    ~GraphWriter() {
[1409]153      if (own_writer)
154        delete writer;
[1137]155    }
156
[1526]157    /// \brief Issue a new node map writing command for the writer.
[1137]158    ///
[1526]159   /// This function issues a new <i> node map writing command</i> to the writer.
[1137]160    template <typename Map>
[1394]161    GraphWriter& writeNodeMap(std::string name, const Map& map) {
[1421]162      nodeset_writer.writeNodeMap(name, map);
[1409]163      return *this;
[1137]164    }
165
[1540]166
[1526]167    /// \brief Issue a new node map writing command for the writer.
[1137]168    ///
[1526]169   /// This function issues a new <i> node map writing command</i> to the writer.
[1137]170    template <typename Writer, typename Map>
[1394]171    GraphWriter& writeNodeMap(std::string name, const Map& map,
[1421]172                              const Writer& writer = Writer()) {
173      nodeset_writer.writeNodeMap(name, map, writer);
[1137]174      return *this;
175    }
176
177
[1526]178    /// \brief Issue a new edge map writing command for the writer.
[1137]179    ///
[1526]180   /// This function issues a new <i> edge map writing command</i> to the writer.
[1137]181    template <typename Map>
[1394]182    GraphWriter& writeEdgeMap(std::string name, const Map& map) {
[1421]183      edgeset_writer.writeEdgeMap(name, map);
[1409]184      return *this;
[1137]185    }
186
187
[1526]188    /// \brief Issue a new edge map writing command for the writer.
[1137]189    ///
[1526]190   /// This function issues a new <i> edge map writing command</i> to the writer.
[1137]191    template <typename Writer, typename Map>
[1409]192    GraphWriter& writeEdgeMap(std::string name, const Map& map,
[1421]193                              const Writer& writer = Writer()) {
194      edgeset_writer.writeEdgeMap(name, map, writer);
[1137]195      return *this;
196    }
197
[1526]198    /// \brief Issue a new labeled node writing command to the writer.
[1137]199    ///
[1526]200    /// This function issues a new <i> labeled node writing command</i>
201    /// to the writer.
[1394]202    GraphWriter& writeNode(std::string name, const Node& node) {
[1409]203      node_writer.writeNode(name, node);
[1137]204      return *this;
205    }
206
[1526]207    /// \brief Issue a new labeled edge writing command to the writer.
[1137]208    ///
[1526]209    /// This function issues a new <i> labeled edge writing command</i>
210    /// to the writer.
[1394]211    GraphWriter& writeEdge(std::string name, const Edge& edge) {
[1409]212      edge_writer.writeEdge(name, edge);
213    }
214
[1526]215    /// \brief Issue a new attribute writing command.
[1409]216    ///
[1526]217    /// This function issues a new <i> attribute writing command</i>
218    /// to the writer.
[1409]219    template <typename Value>
220    GraphWriter& writeAttribute(std::string name, const Value& value) {
221      attribute_writer.writeAttribute(name, value);
222      return *this;
223    }
224   
[1526]225    /// \brief Issue a new attribute writing command.
[1409]226    ///
[1526]227    /// This function issues a new <i> attribute writing command</i>
228    /// to the writer.
[1409]229    template <typename Writer, typename Value>
230    GraphWriter& writeAttribute(std::string name, const Value& value,
231                               const Writer& writer) {
232      attribute_writer.writeAttribute<Writer>(name, value, writer);
[1137]233      return *this;
234    }
235
[1409]236    /// \brief Conversion operator to LemonWriter.
237    ///
[1526]238    /// Conversion operator to LemonWriter. It makes possible
[1409]239    /// to access the encapsulated \e LemonWriter, this way
240    /// you can attach to this writer new instances of
[1540]241    /// \e LemonWriter::SectionWriter. For more details see
242    /// the \ref rwbackground "Background of Reading and Writing".
[1409]243    operator LemonWriter&() {
244      return *writer;
[1396]245    }
246
[1526]247    /// \brief Executes the writing commands.
[1137]248    ///
[1526]249    /// Executes the writing commands.
[1409]250    void run() {
251      writer->run();
[1137]252    }
253
[1901]254    /// \brief Write the label of the given node.
[1429]255    ///
[1901]256    /// It writes the label of the given node. If there was written an "label"
[1526]257    /// named node map then it will write the map value belonging to the node.
[1901]258    void writeLabel(std::ostream& os, const Node& item) const {
259      nodeset_writer.writeLabel(os, item);
[1429]260    }
261
[1901]262    /// \brief Write the label of the given edge.
[1429]263    ///
[1901]264    /// It writes the label of the given edge. If there was written an "label"
[1526]265    /// named edge map then it will write the map value belonging to the edge.
[1901]266    void writeLabel(std::ostream& os, const Edge& item) const {
267      edgeset_writer.writeLabel(os, item);
[1429]268    }
269
[1137]270  private:
271
[1409]272    LemonWriter* writer;
273    bool own_writer;
[1137]274
[1409]275    NodeSetWriter<Graph, WriterTraits> nodeset_writer;
276    EdgeSetWriter<Graph, WriterTraits> edgeset_writer;
277
278    NodeWriter<Graph> node_writer;
279    EdgeWriter<Graph> edge_writer;
280   
281    AttributeWriter<WriterTraits> attribute_writer;
[1137]282  };
283
[1409]284
[1421]285  /// \brief The undirected graph writer class.
286  ///
[1909]287  /// The \c UGraphWriter class provides the ugraph output. To write
[1526]288  /// a graph you should first give writing commands to the writer. You can
[1909]289  /// declare write command as \c NodeMap, \c EdgeMap or \c UEdgeMap
290  /// writing and labeled Node, Edge or UEdge writing.
[1421]291  ///
[1946]292  ///\code
[1909]293  /// UGraphWriter<ListUGraph> writer(std::cout, graph);
[1946]294  ///\endcode
[1421]295  ///
296  /// The \c writeNodeMap() function declares a \c NodeMap writing
[1909]297  /// command in the \c UGraphWriter. You should give as parameter
[1421]298  /// the name of the map and the map object. The NodeMap writing
[1901]299  /// command with name "label" should write a unique map because it
300  /// is regarded as label map.
[1421]301  ///
[1946]302  ///\code
[1909]303  /// IdMap<ListUGraph, Node> nodeLabelMap;
[1901]304  /// writer.writeNodeMap("label", nodeLabelMap);
[1421]305  ///
306  /// writer.writeNodeMap("coords", coords);
307  /// writer.writeNodeMap("color", colorMap);
[1946]308  ///\endcode
[1421]309  ///
[1909]310  /// With the \c writeUEdgeMap() member function you can give an
[1421]311  /// undirected edge map writing command similar to the NodeMaps.
312  ///
[1946]313  ///\code
[1421]314  /// DescriptorMap<ListGraph, Edge, ListGraph::EdgeMap<int> >
315  ///   edgeDescMap(graph);
[1909]316  /// writer.writeUEdgeMap("descriptor", edgeDescMap);
[1421]317  ///
[1909]318  /// writer.writeUEdgeMap("weight", weightMap);
319  /// writer.writeUEdgeMap("label", labelMap);
[1946]320  ///\endcode
[1421]321  ///
322  /// The EdgeMap handling is just a syntactical sugar. It writes
323  /// two undirected edge map with '+' and '-' prefix in the name.
324  ///
[1946]325  ///\code
[1421]326  /// writer.writeEdgeMap("capacity", capacityMap);
[1946]327  ///\endcode
[1421]328  ///
329  ///
[1909]330  /// With \c writeNode() and \c writeUEdge() functions you can
[1526]331  /// designate nodes and undirected edges in the graph. For example, you can
[1421]332  /// write out the source and target of the graph.
333  ///
[1946]334  ///\code
[1421]335  /// writer.writeNode("source", sourceNode);
336  /// writer.writeNode("target", targetNode);
337  ///
[1909]338  /// writer.writeUEdge("observed", uEdge);
[1946]339  ///\endcode
[1421]340  ///
341  /// After you give all write commands you must call the \c run() member
[1526]342  /// function, which executes all the writing commands.
[1421]343  ///
[1946]344  ///\code
[1421]345  /// writer.run();
[1946]346  ///\endcode
[1421]347  ///
348  /// \see DefaultWriterTraits
349  /// \see QuotedStringWriter
350  /// \see IdMap
351  /// \see DescriptorMap
352  /// \see \ref GraphWriter
353  /// \see \ref graph-io-page
354  /// \author Balazs Dezso
355  template <typename _Graph, typename _WriterTraits = DefaultWriterTraits>
[1909]356  class UGraphWriter {
[1421]357  public:
358   
359    typedef _Graph Graph;
360    typedef typename Graph::Node Node;
361    typedef typename Graph::Edge Edge;
[1909]362    typedef typename Graph::UEdge UEdge;
[1421]363
364    typedef _WriterTraits WriterTraits;
365
[1909]366    /// \brief Construct a new UGraphWriter.
[1421]367    ///
[1909]368    /// Construct a new UGraphWriter. It writes the given graph
[1421]369    /// to the given stream.
[1909]370    UGraphWriter(std::ostream& _os, const Graph& _graph)
[1421]371      : writer(new LemonWriter(_os)), own_writer(true),
372        nodeset_writer(*writer, _graph, std::string()),
[1909]373        u_edgeset_writer(*writer, _graph, nodeset_writer, std::string()),
[1421]374        node_writer(*writer, nodeset_writer, std::string()),
[1909]375        u_edge_writer(*writer, u_edgeset_writer, std::string()),
[1421]376        attribute_writer(*writer, std::string()) {}
377
[1909]378    /// \brief Construct a new UGraphWriter.
[1421]379    ///
[1909]380    /// Construct a new UGraphWriter. It writes the given graph
[1421]381    /// to the given file.
[1909]382    UGraphWriter(const std::string& _filename, const Graph& _graph)
[1421]383      : writer(new LemonWriter(_filename)), own_writer(true),
384        nodeset_writer(*writer, _graph, std::string()),
[1909]385        u_edgeset_writer(*writer, _graph, nodeset_writer, std::string()),
[1421]386        node_writer(*writer, nodeset_writer, std::string()),
[1909]387        u_edge_writer(*writer, u_edgeset_writer, std::string()),
[1421]388        attribute_writer(*writer, std::string()) {}
389
[1909]390    /// \brief Construct a new UGraphWriter.
[1421]391    ///
[1909]392    /// Construct a new UGraphWriter. It writes the given graph
[1421]393    /// to given LemonReader.
[1909]394    UGraphWriter(LemonWriter& _writer, const Graph& _graph)
[1421]395      : writer(_writer), own_writer(false),
396        nodeset_writer(*writer, _graph, std::string()),
[1909]397        u_edgeset_writer(*writer, _graph, nodeset_writer, std::string()),
[1421]398        node_writer(*writer, nodeset_writer, std::string()),
[1909]399        u_edge_writer(*writer, u_edgeset_writer, std::string()),
[1421]400        attribute_writer(*writer, std::string()) {}
401
402    /// \brief Destruct the graph writer.
403    ///
404    /// Destruct the graph writer.
[1909]405    ~UGraphWriter() {
[1421]406      if (own_writer)
407        delete writer;
408    }
409
[1526]410    /// \brief Issue a new node map writing command to the writer.
[1421]411    ///
[2200]412    /// This function issues a new <i> node map writing command</i> to
413    /// the writer.
[1421]414    template <typename Map>
[1909]415    UGraphWriter& writeNodeMap(std::string name, const Map& map) {
[1421]416      nodeset_writer.writeNodeMap(name, map);
417      return *this;
418    }
419
[1526]420    /// \brief Issue a new node map writing command to the writer.
[1421]421    ///
[2200]422    /// This function issues a new <i> node map writing command</i> to
423    /// the writer.
[1421]424    template <typename Writer, typename Map>
[1909]425    UGraphWriter& writeNodeMap(std::string name, const Map& map,
[1421]426                              const Writer& writer = Writer()) {
427      nodeset_writer.writeNodeMap(name, map, writer);
428      return *this;
429    }
430
[1526]431    /// \brief Issue a new edge map writing command to the writer.
[1421]432    ///
[2200]433    /// This function issues a new <i> edge map writing command</i> to
434    /// the writer.
[1421]435    template <typename Map>
[1909]436    UGraphWriter& writeEdgeMap(std::string name, const Map& map) {
437      u_edgeset_writer.writeEdgeMap(name, map);
[1421]438      return *this;
439    }
440
[1526]441    /// \brief Issue a new edge map writing command to the writer.
[1421]442    ///
[2200]443    /// This function issues a new <i> edge map writing command</i> to
444    /// the writer.
[1421]445    template <typename Writer, typename Map>
[1909]446    UGraphWriter& writeEdgeMap(std::string name, const Map& map,
[1421]447                                   const Writer& writer = Writer()) {
[1909]448      u_edgeset_writer.writeEdgeMap(name, map, writer);
[1421]449      return *this;
450    }
451
[1526]452    /// \brief Issue a new undirected edge map writing command to the writer.
[1421]453    ///
[1526]454    /// This function issues a new <i> undirected edge map writing
455    /// command</i> to the writer.
[1421]456    template <typename Map>
[1909]457    UGraphWriter& writeUEdgeMap(std::string name, const Map& map) {
458      u_edgeset_writer.writeUEdgeMap(name, map);
[1421]459      return *this;
460    }
461
[1526]462    /// \brief Issue a new undirected edge map writing command to the writer.
[1421]463    ///
[1526]464    /// This function issues a new <i> undirected edge map writing
465    /// command</i> to the writer.
[1540]466   template <typename Writer, typename Map>
[1909]467    UGraphWriter& writeUEdgeMap(std::string name, const Map& map,
[1421]468                                        const Writer& writer = Writer()) {
[1909]469      u_edgeset_writer.writeUEdgeMap(name, map, writer);
[1421]470      return *this;
471    }
472
[1526]473    /// \brief Issue a new labeled node writer to the writer.
[1421]474    ///
[1526]475    /// This function issues a new <i> labeled node writing
476    /// command</i> to the writer.
[1909]477    UGraphWriter& writeNode(std::string name, const Node& node) {
[1421]478      node_writer.writeNode(name, node);
479      return *this;
480    }
481
[1526]482    /// \brief Issue a new labeled edge writer to the writer.
[1421]483    ///
[1526]484    /// This function issues a new <i> labeled edge writing
485    /// command</i> to the writer.
[1909]486    UGraphWriter& writeEdge(std::string name, const Edge& edge) {
487      u_edge_writer.writeEdge(name, edge);
[1429]488    }
489
[1526]490    /// \brief Issue a new labeled undirected edge writing command to
491    /// the writer.
[1429]492    ///
[1526]493    /// Issue a new <i>labeled undirected edge writing command</i> to
494    /// the writer.
[1909]495    UGraphWriter& writeUEdge(std::string name, const UEdge& edge) {
496      u_edge_writer.writeUEdge(name, edge);
[1421]497    }
498
[1526]499    /// \brief Issue a new attribute writing command.
[1421]500    ///
[1526]501    /// This function issues a new <i> attribute writing
502    /// command</i> to the writer.
[1421]503    template <typename Value>
[1909]504    UGraphWriter& writeAttribute(std::string name, const Value& value) {
[1421]505      attribute_writer.writeAttribute(name, value);
506      return *this;
507    }
508   
[1526]509    /// \brief Issue a new attribute writing command.
[1421]510    ///
[1526]511    /// This function issues a new <i> attribute writing
512    /// command</i> to the writer.
[1421]513    template <typename Writer, typename Value>
[1909]514    UGraphWriter& writeAttribute(std::string name, const Value& value,
[1421]515                               const Writer& writer) {
516      attribute_writer.writeAttribute<Writer>(name, value, writer);
517      return *this;
518    }
519
520    /// \brief Conversion operator to LemonWriter.
521    ///
[1526]522    /// Conversion operator to LemonWriter. It makes possible
[1421]523    /// to access the encapsulated \e LemonWriter, this way
524    /// you can attach to this writer new instances of
525    /// \e LemonWriter::SectionWriter.
526    operator LemonWriter&() {
527      return *writer;
528    }
529
[1526]530    /// \brief Executes the writing commands.
[1421]531    ///
[1526]532    /// Executes the writing commands.
[1421]533    void run() {
534      writer->run();
535    }
536
[1901]537    /// \brief Write the label of the given node.
[1429]538    ///
[1901]539    /// It writes the label of the given node. If there was written an "label"
[1526]540    /// named node map then it will write the map value belonging to the node.
[1901]541    void writeLabel(std::ostream& os, const Node& item) const {
542      nodeset_writer.writeLabel(os, item);
[1429]543    }
544
[1901]545    /// \brief Write the label of the given edge.
[1429]546    ///
[1901]547    /// It writes the label of the given edge. If there was written an "label"
[1526]548    /// named edge map then it will write the map value belonging to the edge.
[1901]549    void writeLabel(std::ostream& os, const Edge& item) const {
[1909]550      u_edgeset_writer.writeLabel(os, item);
[1429]551    }
552
[1901]553    /// \brief Write the label of the given undirected edge.
[1429]554    ///
[2200]555    /// It writes the label of the given undirected edge. If there was
556    /// written an "label" named edge map then it will write the map
557    /// value belonging to the edge.
[1909]558    void writeLabel(std::ostream& os, const UEdge& item) const {
559      u_edgeset_writer.writeLabel(os, item);
[1429]560    }
561
562
[1421]563  private:
564
565    LemonWriter* writer;
566    bool own_writer;
567
568    NodeSetWriter<Graph, WriterTraits> nodeset_writer;
[1909]569    UEdgeSetWriter<Graph, WriterTraits> u_edgeset_writer;
[1421]570
571    NodeWriter<Graph> node_writer;
[1909]572    UEdgeWriter<Graph> u_edge_writer;
[1421]573   
574    AttributeWriter<WriterTraits> attribute_writer;
575  };
576
[1333]577  /// @}
[1137]578
579}
[1214]580
581#endif
Note: See TracBrowser for help on using the repository browser.