RhodeCode

    std::string _attributes_caption;

    typedef std::map<std::string, Node> NodeIndex;

    NodeIndex _node_index;

    typedef std::map<std::string, Arc> ArcIndex;

    ArcIndex _arc_index;

    typedef std::vector<std::pair<std::string,

      _reader_bits::MapStorageBase<Node>*> > NodeMaps;

    NodeMaps _node_maps;

    typedef std::vector<std::pair<std::string,

      _reader_bits::MapStorageBase<Arc>*> >ArcMaps;

    ArcMaps _arc_maps;

    typedef std::multimap<std::string, _reader_bits::ValueStorageBase*>

      Attributes;

    Attributes _attributes;

    bool _use_nodes;

    bool _use_arcs;

    bool _skip_nodes;

    bool _skip_arcs;

    int line_num;

    std::istringstream line;

  public:

    /// \brief Constructor

    ///

    /// Construct a directed graph reader, which reads from the given

    /// input stream.

    DigraphReader(Digraph& digraph, std::istream& is = std::cin)

      : _is(&is), local_is(false), _digraph(digraph),

        _use_nodes(false), _use_arcs(false),

        _skip_nodes(false), _skip_arcs(false) {}

    /// \brief Constructor

    ///

    /// Construct a directed graph reader, which reads from the given

    /// file.

    DigraphReader(Digraph& digraph, const std::string& fn)

      : _is(new std::ifstream(fn.c_str())), local_is(true),

        _filename(fn), _digraph(digraph),

        _use_nodes(false), _use_arcs(false),

        _skip_nodes(false), _skip_arcs(false) {

    }

    /// \brief Constructor

    ///

    /// Construct a directed graph reader, which reads from the given

    /// file.

    DigraphReader(Digraph& digraph, const char* fn)

      : _is(new std::ifstream(fn)), local_is(true),

        _filename(fn), _digraph(digraph),

        _use_nodes(false), _use_arcs(false),

        _skip_nodes(false), _skip_arcs(false) {

    }

    /// \brief Destructor

    ~DigraphReader() {

      for (typename NodeMaps::iterator it = _node_maps.begin();

           it != _node_maps.end(); ++it) {

        delete it->second;

      }

      for (typename ArcMaps::iterator it = _arc_maps.begin();

           it != _arc_maps.end(); ++it) {

        delete it->second;

      }

      for (typename Attributes::iterator it = _attributes.begin();

           it != _attributes.end(); ++it) {

        delete it->second;

      }

      if (local_is) {

        delete _is;

      }

    }

  private:

    friend DigraphReader<Digraph> digraphReader<>(Digraph& digraph,

                                                  std::istream& is);

    friend DigraphReader<Digraph> digraphReader<>(Digraph& digraph,

                                                  const std::string& fn);

    friend DigraphReader<Digraph> digraphReader<>(Digraph& digraph,

                                                  const char *fn);

    DigraphReader(DigraphReader& other)

      : _is(other._is), local_is(other.local_is), _digraph(other._digraph),

        _use_nodes(other._use_nodes), _use_arcs(other._use_arcs),

        _skip_nodes(other._skip_nodes), _skip_arcs(other._skip_arcs) {

      other._is = 0;

      other.local_is = false;

      _node_index.swap(other._node_index);

      _arc_index.swap(other._arc_index);

      _node_maps.swap(other._node_maps);

      _arc_maps.swap(other._arc_maps);

      _attributes.swap(other._attributes);

    std::string _attributes_caption;

    typedef std::map<std::string, Node> NodeIndex;

    NodeIndex _node_index;

    typedef std::map<std::string, Edge> EdgeIndex;

    EdgeIndex _edge_index;

    typedef std::vector<std::pair<std::string,

      _reader_bits::MapStorageBase<Node>*> > NodeMaps;

    NodeMaps _node_maps;

    typedef std::vector<std::pair<std::string,

      _reader_bits::MapStorageBase<Edge>*> > EdgeMaps;

    EdgeMaps _edge_maps;

    typedef std::multimap<std::string, _reader_bits::ValueStorageBase*>

      Attributes;

    Attributes _attributes;

    bool _use_nodes;

    bool _use_edges;

    bool _skip_nodes;

    bool _skip_edges;

    int line_num;

    std::istringstream line;

  public:

    /// \brief Constructor

    ///

    /// Construct an undirected graph reader, which reads from the given

    /// input stream.

    GraphReader(Graph& graph, std::istream& is = std::cin)

      : _is(&is), local_is(false), _graph(graph),

        _use_nodes(false), _use_edges(false),

        _skip_nodes(false), _skip_edges(false) {}

    /// \brief Constructor

    ///

    /// Construct an undirected graph reader, which reads from the given

    /// file.

    GraphReader(Graph& graph, const std::string& fn)

      : _is(new std::ifstream(fn.c_str())), local_is(true),

        _filename(fn), _graph(graph),

        _use_nodes(false), _use_edges(false),

        _skip_nodes(false), _skip_edges(false) {

    }

    /// \brief Constructor

    ///

    /// Construct an undirected graph reader, which reads from the given

    /// file.

    GraphReader(Graph& graph, const char* fn)

      : _is(new std::ifstream(fn)), local_is(true),

        _filename(fn), _graph(graph),

        _use_nodes(false), _use_edges(false),

        _skip_nodes(false), _skip_edges(false) {

    }

    /// \brief Destructor

    ~GraphReader() {

      for (typename NodeMaps::iterator it = _node_maps.begin();

           it != _node_maps.end(); ++it) {

        delete it->second;

      }

      for (typename EdgeMaps::iterator it = _edge_maps.begin();

           it != _edge_maps.end(); ++it) {

        delete it->second;

      }

      for (typename Attributes::iterator it = _attributes.begin();

           it != _attributes.end(); ++it) {

        delete it->second;

      }

      if (local_is) {

        delete _is;

      }

    }

  private:

    friend GraphReader<Graph> graphReader<>(Graph& graph, std::istream& is);

    friend GraphReader<Graph> graphReader<>(Graph& graph,

                                            const std::string& fn);

    friend GraphReader<Graph> graphReader<>(Graph& graph, const char *fn);

    GraphReader(GraphReader& other)

      : _is(other._is), local_is(other.local_is), _graph(other._graph),

        _use_nodes(other._use_nodes), _use_edges(other._use_edges),

        _skip_nodes(other._skip_nodes), _skip_edges(other._skip_edges) {

      other._is = 0;

      other.local_is = false;

      _node_index.swap(other._node_index);

      _edge_index.swap(other._edge_index);

      _node_maps.swap(other._node_maps);

      _edge_maps.swap(other._edge_maps);

      _attributes.swap(other._attributes);

      _nodes_caption = other._nodes_caption;

      _edges_caption = other._edges_caption;

    return tmp;

  }

  class SectionReader;

  SectionReader sectionReader(std::istream& is);

  SectionReader sectionReader(const std::string& fn);

  SectionReader sectionReader(const char* fn);

  /// \ingroup lemon_io

  ///

  /// \brief Section reader class

  ///

  /// In the \ref lgf-format "LGF" file extra sections can be placed,

  /// which contain any data in arbitrary format. Such sections can be

  /// read with this class. A reading rule can be added to the class

  /// with two different functions. With the \c sectionLines() function a

  /// functor can process the section line-by-line, while with the \c

  /// sectionStream() member the section can be read from an input

  /// stream.

  class SectionReader {

  private:

    std::istream* _is;

    bool local_is;

    std::string _filename;

    typedef std::map<std::string, _reader_bits::Section*> Sections;

    Sections _sections;

    int line_num;

    std::istringstream line;

  public:

    /// \brief Constructor

    ///

    /// Construct a section reader, which reads from the given input

    /// stream.

    SectionReader(std::istream& is)

      : _is(&is), local_is(false) {}

    /// \brief Constructor

    ///

    /// Construct a section reader, which reads from the given file.

    SectionReader(const std::string& fn)

      : _is(new std::ifstream(fn.c_str())), local_is(true),

        _filename(fn) {

    }

    /// \brief Constructor

    ///

    /// Construct a section reader, which reads from the given file.

    SectionReader(const char* fn)

      : _is(new std::ifstream(fn)), local_is(true),

        _filename(fn) {

    }

    /// \brief Destructor

    ~SectionReader() {

      for (Sections::iterator it = _sections.begin();

           it != _sections.end(); ++it) {

        delete it->second;

      }

      if (local_is) {

        delete _is;

      }

    }

  private:

    friend SectionReader sectionReader(std::istream& is);

    friend SectionReader sectionReader(const std::string& fn);

    friend SectionReader sectionReader(const char* fn);

    SectionReader(SectionReader& other)

      : _is(other._is), local_is(other.local_is) {

      other._is = 0;

      other.local_is = false;

      _sections.swap(other._sections);

    }

    SectionReader& operator=(const SectionReader&);

  public:

    /// \name Section readers

    /// @{

    /// \brief Add a section processor with line oriented reading

    ///

    /// The first parameter is the type descriptor of the section, the

    /// second is a functor, which takes just one \c std::string

    /// parameter. At the reading process, each line of the section

    /// will be given to the functor object. However, the empty lines

    /// and the comment lines are filtered out, and the leading

    /// whitespaces are trimmed from each processed string.

    ///

    /// For example let's see a section, which contain several

    /// integers, which should be inserted into a vector.

  /// if (contents.nodeSectionNum() == 0 || contents.arcSectionNum()) {

  ///   std::cerr << "Failure, cannot find graph." << std::endl;

  ///   return -1;

  /// }

  /// std::cout << "The name of the default node section: "

  ///           << contents.nodeSection(0) << std::endl;

  /// std::cout << "The number of the arc maps: "

  ///           << contents.arcMaps(0).size() << std::endl;

  /// std::cout << "The name of second arc map: "

  ///           << contents.arcMaps(0)[1] << std::endl;

  ///\endcode

  class LgfContents {

  private:

    std::istream* _is;

    bool local_is;

    std::vector<std::string> _node_sections;

    std::vector<std::string> _edge_sections;

    std::vector<std::string> _attribute_sections;

    std::vector<std::string> _extra_sections;

    std::vector<bool> _arc_sections;

    std::vector<std::vector<std::string> > _node_maps;

    std::vector<std::vector<std::string> > _edge_maps;

    std::vector<std::vector<std::string> > _attributes;

    int line_num;

    std::istringstream line;

  public:

    /// \brief Constructor

    ///

    /// Construct an \e LGF contents reader, which reads from the given

    /// input stream.

    LgfContents(std::istream& is)

      : _is(&is), local_is(false) {}

    /// \brief Constructor

    ///

    /// Construct an \e LGF contents reader, which reads from the given

    /// file.

    LgfContents(const std::string& fn)

      : _is(new std::ifstream(fn.c_str())), local_is(true) {

    }

    /// \brief Constructor

    ///

    /// Construct an \e LGF contents reader, which reads from the given

    /// file.

    LgfContents(const char* fn)

      : _is(new std::ifstream(fn)), local_is(true) {

    }

    /// \brief Destructor

    ~LgfContents() {

      if (local_is) delete _is;

    }

  private:

    LgfContents(const LgfContents&);

    LgfContents& operator=(const LgfContents&);

  public:

    /// \name Node sections

    /// @{

    /// \brief Gives back the number of node sections in the file.

    ///

    /// Gives back the number of node sections in the file.

    int nodeSectionNum() const {

      return _node_sections.size();

    }

    /// \brief Returns the node section name at the given position.

    ///

    /// Returns the node section name at the given position.

    const std::string& nodeSection(int i) const {

      return _node_sections[i];

    }

    /// \brief Gives back the node maps for the given section.

    ///

    /// Gives back the node maps for the given section.

    const std::vector<std::string>& nodeMapNames(int i) const {

      return _node_maps[i];

    }

    /// @}

    /// \name Arc/Edge sections

    /// @{

    /// \brief Gives back the number of arc/edge sections in the file.

    ///

    /// Gives back the number of arc/edge sections in the file.

    /// \note It is synonym of \c edgeSectionNum().

    std::ostream* _os;

    bool local_os;

    const Digraph& _digraph;

    std::string _nodes_caption;

    std::string _arcs_caption;

    std::string _attributes_caption;

    typedef std::map<Node, std::string> NodeIndex;

    NodeIndex _node_index;

    typedef std::map<Arc, std::string> ArcIndex;

    ArcIndex _arc_index;

    typedef std::vector<std::pair<std::string,

      _writer_bits::MapStorageBase<Node>* > > NodeMaps;

    NodeMaps _node_maps;

    typedef std::vector<std::pair<std::string,

      _writer_bits::MapStorageBase<Arc>* > >ArcMaps;

    ArcMaps _arc_maps;

    typedef std::vector<std::pair<std::string,

      _writer_bits::ValueStorageBase*> > Attributes;

    Attributes _attributes;

    bool _skip_nodes;

    bool _skip_arcs;

  public:

    /// \brief Constructor

    ///

    /// Construct a directed graph writer, which writes to the given

    /// output stream.

    DigraphWriter(const Digraph& digraph, std::ostream& os = std::cout)

      : _os(&os), local_os(false), _digraph(digraph),

        _skip_nodes(false), _skip_arcs(false) {}

    /// \brief Constructor

    ///

    /// Construct a directed graph writer, which writes to the given

    /// output file.

    DigraphWriter(const Digraph& digraph, const std::string& fn)

      : _os(new std::ofstream(fn.c_str())), local_os(true), _digraph(digraph),

        _skip_nodes(false), _skip_arcs(false) {

    }

    /// \brief Constructor

    ///

    /// Construct a directed graph writer, which writes to the given

    /// output file.

    DigraphWriter(const Digraph& digraph, const char* fn)

      : _os(new std::ofstream(fn)), local_os(true), _digraph(digraph),

        _skip_nodes(false), _skip_arcs(false) {

    }

    /// \brief Destructor

    ~DigraphWriter() {

      for (typename NodeMaps::iterator it = _node_maps.begin();

           it != _node_maps.end(); ++it) {

        delete it->second;

      }

      for (typename ArcMaps::iterator it = _arc_maps.begin();

           it != _arc_maps.end(); ++it) {

        delete it->second;

      }

      for (typename Attributes::iterator it = _attributes.begin();

           it != _attributes.end(); ++it) {

        delete it->second;

      }

      if (local_os) {

        delete _os;

      }

    }

  private:

    friend DigraphWriter<Digraph> digraphWriter<>(const Digraph& digraph,

                                                  std::ostream& os);

    friend DigraphWriter<Digraph> digraphWriter<>(const Digraph& digraph,

                                                  const std::string& fn);

    friend DigraphWriter<Digraph> digraphWriter<>(const Digraph& digraph,

                                                  const char *fn);

    DigraphWriter(DigraphWriter& other)

      : _os(other._os), local_os(other.local_os), _digraph(other._digraph),

        _skip_nodes(other._skip_nodes), _skip_arcs(other._skip_arcs) {

      other._os = 0;

      other.local_os = false;

      _node_index.swap(other._node_index);

      _arc_index.swap(other._arc_index);

      _node_maps.swap(other._node_maps);

      _arc_maps.swap(other._arc_maps);

      _attributes.swap(other._attributes);

      _nodes_caption = other._nodes_caption;

    std::ostream* _os;

    bool local_os;

    const Graph& _graph;

    std::string _nodes_caption;

    std::string _edges_caption;

    std::string _attributes_caption;

    typedef std::map<Node, std::string> NodeIndex;

    NodeIndex _node_index;

    typedef std::map<Edge, std::string> EdgeIndex;

    EdgeIndex _edge_index;

    typedef std::vector<std::pair<std::string,

      _writer_bits::MapStorageBase<Node>* > > NodeMaps;

    NodeMaps _node_maps;

    typedef std::vector<std::pair<std::string,

      _writer_bits::MapStorageBase<Edge>* > >EdgeMaps;

    EdgeMaps _edge_maps;

    typedef std::vector<std::pair<std::string,

      _writer_bits::ValueStorageBase*> > Attributes;

    Attributes _attributes;

    bool _skip_nodes;

    bool _skip_edges;

  public:

    /// \brief Constructor

    ///

    /// Construct a directed graph writer, which writes to the given

    /// output stream.

    GraphWriter(const Graph& graph, std::ostream& os = std::cout)

      : _os(&os), local_os(false), _graph(graph),

        _skip_nodes(false), _skip_edges(false) {}

    /// \brief Constructor

    ///

    /// Construct a directed graph writer, which writes to the given

    /// output file.

    GraphWriter(const Graph& graph, const std::string& fn)

      : _os(new std::ofstream(fn.c_str())), local_os(true), _graph(graph),

        _skip_nodes(false), _skip_edges(false) {

    }

    /// \brief Constructor

    ///

    /// Construct a directed graph writer, which writes to the given

    /// output file.

    GraphWriter(const Graph& graph, const char* fn)

      : _os(new std::ofstream(fn)), local_os(true), _graph(graph),

        _skip_nodes(false), _skip_edges(false) {

    }

    /// \brief Destructor

    ~GraphWriter() {

      for (typename NodeMaps::iterator it = _node_maps.begin();

           it != _node_maps.end(); ++it) {

        delete it->second;

      }

      for (typename EdgeMaps::iterator it = _edge_maps.begin();

           it != _edge_maps.end(); ++it) {

        delete it->second;

      }

      for (typename Attributes::iterator it = _attributes.begin();

           it != _attributes.end(); ++it) {

        delete it->second;

      }

      if (local_os) {

        delete _os;

      }

    }

  private:

    friend GraphWriter<Graph> graphWriter<>(const Graph& graph,

                                            std::ostream& os);

    friend GraphWriter<Graph> graphWriter<>(const Graph& graph,

                                            const std::string& fn);

    friend GraphWriter<Graph> graphWriter<>(const Graph& graph,

                                            const char *fn);

    GraphWriter(GraphWriter& other)

      : _os(other._os), local_os(other.local_os), _graph(other._graph),

        _skip_nodes(other._skip_nodes), _skip_edges(other._skip_edges) {

      other._os = 0;

      other.local_os = false;

      _node_index.swap(other._node_index);

      _edge_index.swap(other._edge_index);

      _node_maps.swap(other._node_maps);

      _edge_maps.swap(other._edge_maps);

      _attributes.swap(other._attributes);

      _nodes_caption = other._nodes_caption;

  template <typename Graph>

  GraphWriter<Graph> graphWriter(const Graph& graph, const char* fn) {

    GraphWriter<Graph> tmp(graph, fn);

    return tmp;

  }

  class SectionWriter;

  SectionWriter sectionWriter(std::istream& is);

  SectionWriter sectionWriter(const std::string& fn);

  SectionWriter sectionWriter(const char* fn);

  /// \ingroup lemon_io

  ///

  /// \brief Section writer class

  ///

  /// In the \ref lgf-format "LGF" file extra sections can be placed,

  /// which contain any data in arbitrary format. Such sections can be

  /// written with this class. A writing rule can be added to the

  /// class with two different functions. With the \c sectionLines()

  /// function a generator can write the section line-by-line, while

  /// with the \c sectionStream() member the section can be written to

  /// an output stream.

  class SectionWriter {

  private:

    std::ostream* _os;

    bool local_os;

    typedef std::vector<std::pair<std::string, _writer_bits::Section*> >

    Sections;

    Sections _sections;

  public:

    /// \brief Constructor

    ///

    /// Construct a section writer, which writes to the given output

    /// stream.

    SectionWriter(std::ostream& os)

      : _os(&os), local_os(false) {}

    /// \brief Constructor

    ///

    /// Construct a section writer, which writes into the given file.

    SectionWriter(const std::string& fn)

      : _os(new std::ofstream(fn.c_str())), local_os(true) {

    }

    /// \brief Constructor

    ///

    /// Construct a section writer, which writes into the given file.

    SectionWriter(const char* fn)

      : _os(new std::ofstream(fn)), local_os(true) {

    }

    /// \brief Destructor

    ~SectionWriter() {

      for (Sections::iterator it = _sections.begin();

           it != _sections.end(); ++it) {

        delete it->second;

      }

      if (local_os) {

        delete _os;

      }

    }

  private:

    friend SectionWriter sectionWriter(std::ostream& os);

    friend SectionWriter sectionWriter(const std::string& fn);

    friend SectionWriter sectionWriter(const char* fn);

    SectionWriter(SectionWriter& other)

      : _os(other._os), local_os(other.local_os) {

      other._os = 0;

      other.local_os = false;

      _sections.swap(other._sections);

    }

    SectionWriter& operator=(const SectionWriter&);

  public:

    /// \name Section writers

    /// @{

    /// \brief Add a section writer with line oriented writing

    ///

    /// The first parameter is the type descriptor of the section, the

    /// second is a generator with std::string values. At the writing

    /// process, the returned \c std::string will be written into the

    /// output file until it is an empty string.

    ///

    /// For example, an integer vector is written into a section.

    ///\code

    ///  @numbers

    ///  12 45 23 78