RhodeCode

	while (is.get(c) && c != '@') {

	  if (c == '\n') {

	    ++line_num;

	  } else if (c == '#') {

	    getline(is, line);

	    ++line_num;

	  } else if (!isWhiteSpace(c)) {

	    is.putback(c);

	    getline(is, line);

	    _functor(line);

	    ++line_num;

	  }

	}

	if (is) is.putback(c);

	else if (is.eof()) is.clear();

      }

    };

    template <typename Functor>

    class StreamSection : public Section {

    private:

      Functor _functor;

    public:

      StreamSection(const Functor& functor) : _functor(functor) {}

      virtual ~StreamSection() {} 

      virtual void process(std::istream& is, int& line_num) {

	_functor(is, line_num);

	char c;

	std::string line;

	while (is.get(c) && c != '@') {

	  if (c == '\n') {

	    ++line_num;

	  } else if (!isWhiteSpace(c)) {

	    getline(is, line);

	    ++line_num;

	  }

	}

	if (is) is.putback(c);

	else if (is.eof()) is.clear();	

      }

    };

  }

  /// \ingroup lemon_io

  ///  

  /// \brief LGF reader for directed graphs

  ///

  /// This utility reads an \ref lgf-format "LGF" file.

  ///

  /// The reading method does a batch processing. The user creates a

  /// reader object, then various reading rules can be added to the

  /// reader, and eventually the reading is executed with the \c run()

  /// member function. A map reading rule can be added to the reader

  /// with the \c nodeMap() or \c arcMap() members. An optional

  /// converter parameter can also be added as a standard functor

  /// converting from std::string to the value type of the map. If it

  /// is set, it will determine how the tokens in the file should be

  /// is converted to the map's value type. If the functor is not set,

  /// then a default conversion will be used. One map can be read into

  /// multiple map objects at the same time. The \c attribute(), \c

  /// node() and \c arc() functions are used to add attribute reading

  /// rules.

  ///

  ///\code

  ///     DigraphReader<Digraph>(std::cin, digraph).

  ///       nodeMap("coordinates", coord_map).

  ///       arcMap("capacity", cap_map).

  ///       node("source", src).

  ///       node("target", trg).

  ///       attribute("caption", caption).

  ///       run();

  ///\endcode

  ///

  /// By default the reader uses the first section in the file of the

  /// proper type. If a section has an optional name, then it can be

  /// selected for reading by giving an optional name parameter to the

  /// \c nodes(), \c arcs() or \c attributes() functions.

  ///

  /// The \c useNodes() and \c useArcs() functions are used to tell the reader

  /// that the nodes or arcs should not be constructed (added to the

  /// graph) during the reading, but instead the label map of the items

  /// are given as a parameter of these functions. An

  /// application of these function is multipass reading, which is

  /// important if two \e \@arcs sections must be read from the

  /// file. In this example the first phase would read the node set and one

  /// of the arc sets, while the second phase would read the second arc

  /// set into an \e ArcSet class (\c SmartArcSet or \c ListArcSet).

  /// The previously read label node map should be passed to the \c

  /// useNodes() functions. Another application of multipass reading when

  /// paths are given as a node map or an arc map. It is impossible read this in

  /// a single pass, because the arcs are not constructed when the node

    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(std::istream& is, Digraph& digraph) 

      : _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(const std::string& fn, Digraph& digraph) 

      : _is(new std::ifstream(fn.c_str())), local_is(true), _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(const char* fn, Digraph& digraph) 

      : _is(new std::ifstream(fn)), local_is(true), _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:

    DigraphReader& operator=(const DigraphReader&);

  public:

    /// \name Reading rules

    /// @{

    /// \brief Node map reading rule

    ///

    /// Add a node map reading rule to the reader.

    template <typename Map>

    DigraphReader& nodeMap(const std::string& caption, Map& map) {

      checkConcept<concepts::WriteMap<Node, typename Map::Value>, Map>();

      _reader_bits::MapStorageBase<Node>* storage = 

	new _reader_bits::MapStorage<Node, Map>(map);

      _node_maps.push_back(std::make_pair(caption, storage));

      return *this;

    }

    /// \brief Node map reading rule

    ///

    /// Add a node map reading rule with specialized converter to the

    /// reader.

    template <typename Map, typename Converter>

    DigraphReader& nodeMap(const std::string& caption, Map& map, 

			   const Converter& converter = Converter()) {

      checkConcept<concepts::WriteMap<Node, typename Map::Value>, Map>();

      _reader_bits::MapStorageBase<Node>* storage = 

	new _reader_bits::MapStorage<Node, Map, Converter>(map, converter);

      _node_maps.push_back(std::make_pair(caption, storage));

      return *this;

    }

    /// \brief Arc map reading rule

    ///

    /// Add an arc map reading rule to the reader.

    template <typename Map>

    DigraphReader& arcMap(const std::string& caption, Map& map) {

      checkConcept<concepts::WriteMap<Arc, typename Map::Value>, Map>();

      _reader_bits::MapStorageBase<Arc>* storage = 

	new _reader_bits::MapStorage<Arc, Map>(map);

      _arc_maps.push_back(std::make_pair(caption, storage));

      return *this;

    }

    /// \brief Arc map reading rule

    ///

    /// Add an arc map reading rule with specialized converter to the

	    skipSection();

	  }

	} catch (DataFormatError& error) {

	  error.line(line_num);

	  throw;

	}	

      }

      if (!nodes_done) {

	throw DataFormatError("Section @nodes not found");

      }

      if (!arcs_done) {

	throw DataFormatError("Section @arcs not found");

      }

      if (!attributes_done && !_attributes.empty()) {

	throw DataFormatError("Section @attributes not found");

      }

    }

    /// @}

  };

  /// \relates DigraphReader

  template <typename Digraph>

  DigraphReader<Digraph> digraphReader(std::istream& is, Digraph& digraph) {

    DigraphReader<Digraph> tmp(is, digraph);

    return tmp;

  }

  /// \relates DigraphReader

  template <typename Digraph>

  DigraphReader<Digraph> digraphReader(const std::string& fn, 

				       Digraph& digraph) {

    DigraphReader<Digraph> tmp(fn, digraph);

    return tmp;

  }

  /// \relates DigraphReader

  template <typename Digraph>

  DigraphReader<Digraph> digraphReader(const char* fn, Digraph& digraph) {

    DigraphReader<Digraph> tmp(fn, digraph);

    return tmp;

  }

  /// \ingroup lemon_io

  ///  

  /// \brief LGF reader for undirected graphs

  ///

  /// This utility reads an \ref lgf-format "LGF" file.

  template <typename _Graph>

  class GraphReader {

  public:

    typedef _Graph Graph;

    TEMPLATE_GRAPH_TYPEDEFS(Graph);

  private:

    std::istream* _is;

    bool local_is;

    Graph& _graph;

    std::string _nodes_caption;

    std::string _edges_caption;

    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 a undirected graph reader, which reads from the given

    /// input stream.

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

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

	_use_nodes(false), _use_edges(false),

	_skip_nodes(false), _skip_edges(false) {}

    /// \brief Constructor

    ///

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

    /// file.

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

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

    	_use_nodes(false), _use_edges(false),

	_skip_nodes(false), _skip_edges(false) {}

    /// \brief Constructor

    ///

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

    /// file.

    GraphReader(const char* fn, Graph& graph) 

      : _is(new std::ifstream(fn)), local_is(true), _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:

    GraphReader& operator=(const GraphReader&);

  public:

    /// \name Reading rules

    /// @{

    /// \brief Node map reading rule

    ///

    /// Add a node map reading rule to the reader.

    template <typename Map>

    GraphReader& nodeMap(const std::string& caption, Map& map) {

      checkConcept<concepts::WriteMap<Node, typename Map::Value>, Map>();

      _reader_bits::MapStorageBase<Node>* storage = 

	new _reader_bits::MapStorage<Node, Map>(map);

      _node_maps.push_back(std::make_pair(caption, storage));

      return *this;

    }

    /// \brief Node map reading rule

    ///

    /// Add a node map reading rule with specialized converter to the

    /// reader.

    template <typename Map, typename Converter>

    GraphReader& nodeMap(const std::string& caption, Map& map, 

			   const Converter& converter = Converter()) {

      checkConcept<concepts::WriteMap<Node, typename Map::Value>, Map>();

      _reader_bits::MapStorageBase<Node>* storage = 

	new _reader_bits::MapStorage<Node, Map, Converter>(map, converter);

      _node_maps.push_back(std::make_pair(caption, storage));

      return *this;

    }

    /// \brief Edge map reading rule

    ///

    /// Add an edge map reading rule to the reader.

    template <typename Map>

    GraphReader& edgeMap(const std::string& caption, Map& map) {

      checkConcept<concepts::WriteMap<Edge, typename Map::Value>, Map>();

      _reader_bits::MapStorageBase<Edge>* storage = 

	new _reader_bits::MapStorage<Edge, Map>(map);

      _edge_maps.push_back(std::make_pair(caption, storage));

      return *this;

    }

    /// \brief Edge map reading rule

    ///

    /// Add an edge map reading rule with specialized converter to the

	    skipSection();

	  }

	} catch (DataFormatError& error) {

	  error.line(line_num);

	  throw;

	}	

      }

      if (!nodes_done) {

	throw DataFormatError("Section @nodes not found");

      }

      if (!edges_done) {

	throw DataFormatError("Section @edges not found");

      }

      if (!attributes_done && !_attributes.empty()) {

	throw DataFormatError("Section @attributes not found");

      }

    }

    /// @}

  };

  /// \relates GraphReader

  template <typename Graph>

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

    GraphReader<Graph> tmp(is, graph);

    return tmp;

  }

  /// \relates GraphReader

  template <typename Graph>

  GraphReader<Graph> graphReader(const std::string& fn, 

				       Graph& graph) {

    GraphReader<Graph> tmp(fn, graph);

    return tmp;

  }

  /// \relates GraphReader

  template <typename Graph>

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

    GraphReader<Graph> tmp(fn, graph);

    return tmp;

  }

  /// \brief Section reader class

  ///

  /// In the \e 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 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;

    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) {}

    /// \brief Constructor

    ///

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

    SectionReader(const char* fn) 

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

    /// \brief Destructor

    ~SectionReader() {

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

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

	delete it->second;

      }

      if (local_is) {

	delete _is;

      }

    }

  private:

    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.

    ///\code

    ///  @numbers

    ///  12 45 23

    ///  4

    ///  23 6

    ///\endcode

    ///

    /// The functor is implemented as an struct:

    ///\code

    ///  struct NumberSection {

    ///    std::vector<int>& _data;

    ///    NumberSection(std::vector<int>& data) : _data(data) {}

    ///    void operator()(const std::string& line) {

    ///      std::istringstream ls(line);

    ///      int value;

    ///      while (ls >> value) _data.push_back(value);

    ///    }

    ///  };

    ///

    ///  // ...

    ///

    ///  reader.sectionLines("numbers", NumberSection(vec));  

    ///\endcode

    template <typename Functor>

    SectionReader& sectionLines(const std::string& type, Functor functor) {

      LEMON_ASSERT(!type.empty(), "Type is not empty.");

      LEMON_ASSERT(_sections.find(type) == _sections.end(), 

		   "Multiple reading of section.");

      _sections.insert(std::make_pair(type, 

  ///           << 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;

    }

    /// \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 section name at the given position. 

    ///

    /// Returns the 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().

    int arcSectionNum() const {

      return _edge_sections.size();

    }

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

    ///

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

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

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

      return _edge_sections[i];

    }

    /// \brief Gives back the arc/edge maps for the given section.

    ///

	os << "\\n";

	return;

      case '\t':

	os << "\\t";

	return;

      case '\v':

	os << "\\v";

	return;

      default:

	if (c < 0x20) {

	  std::ios::fmtflags flags = os.flags();

	  os << '\\' << std::oct << static_cast<int>(c);

	  os.flags(flags);

	} else {

	  os << c;

	}

	return;

      }     

    }

    bool requireEscape(const std::string& str) {

      if (str.empty() || str[0] == '@') return true;

      std::istringstream is(str);

      char c;

      while (is.get(c)) {

	if (isWhiteSpace(c) || isEscaped(c)) {

	  return true;

	}

      }

      return false;

    }

    std::ostream& writeToken(std::ostream& os, const std::string& str) {

      if (requireEscape(str)) {

	os << '\"';

	for (std::string::const_iterator it = str.begin(); 

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

	  writeEscape(os, *it);

	}	

	os << '\"';

      } else {

	os << str;

      }

      return os;

    }

  }

  /// \ingroup lemon_io

  ///  

  /// \brief LGF writer for directed graphs

  ///

  /// This utility writes an \ref lgf-format "LGF" file.

  ///

  /// The writing method does a batch processing. The user creates a

  /// writer object, then various writing rules can be added to the

  /// writer, and eventually the writing is executed with the \c run()

  /// member function. A map writing rule can be added to the writer

  /// with the \c nodeMap() or \c arcMap() members. An optional

  /// converter parameter can also be added as a standard functor

  /// converting from the value type of the map to std::string. If it

  /// is set, it will determine how the map's value type is written to

  /// the output stream. If the functor is not set, then a default

  /// conversion will be used. The \c attribute(), \c node() and \c

  /// arc() functions are used to add attribute writing rules.

  ///

  ///\code

  ///     DigraphWriter<Digraph>(std::cout, digraph).

  ///       nodeMap("coordinates", coord_map).

  ///       nodeMap("size", size).

  ///       nodeMap("title", title).

  ///       arcMap("capacity", cap_map).

  ///       node("source", src).

  ///       node("target", trg).

  ///       attribute("caption", caption).

  ///       run();

  ///\endcode

  ///

  ///

  /// By default, the writer does not write additional captions to the

  /// sections, but they can be give as an optional parameter of

  /// the \c nodes(), \c arcs() or \c

  /// attributes() functions.

  ///

  /// The \c skipNodes() and \c skipArcs() functions forbid the

  /// writing of the sections. If two arc sections should be written

  /// to the output, it can be done in two passes, the first pass

  /// writes the node section and the first arc section, then the

  /// second pass skips the node section and writes just the arc

  /// section to the stream. The output stream can be retrieved with

  /// the \c ostream() function, hence the second pass can append its

  /// output to the output of the first pass.

  template <typename _Digraph>

  class DigraphWriter {

  public:

    typedef _Digraph Digraph;

    TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);

  private:

    std::ostream* _os;

    bool local_os;

    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.

      : _os(&is), 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.

      : _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.

      : _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: