RhodeCode

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

      Attributes;

    Attributes _attributes;

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

    Sections _sections;

    bool _use_nodes;

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

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

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

    /// \brief Copy constructor

    ///

    /// The copy constructor transfers all data from the other reader,

    /// therefore the copied reader will not be usable more. 

    DigraphReader(DigraphReader& other) 

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

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

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

      _nodes_caption = other._nodes_caption;

      _arcs_caption = other._arcs_caption;

      _attributes_caption = other._attributes_caption;

      _sections.swap(other._sections);

    }

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

      }

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

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

	delete it->second;

      }

      if (local_is) {

	delete _is;

      }

    }

  private:

    DigraphReader& operator=(const DigraphReader&);

	if (!_reader_bits::readToken(line, attr))

	  throw DataFormatError("Attribute name not found");

	if (!_reader_bits::readToken(line, token))

	  throw DataFormatError("Attribute value not found");

	if (line >> c)

	  throw DataFormatError("Extra character on the end of line");	  

	{

	  std::set<std::string>::iterator it = read_attr.find(attr);

	  if (it != read_attr.end()) {

	    std::ostringstream msg;

	    msg << "Multiple occurence of attribute " << attr;

	    throw DataFormatError(msg.str().c_str());

	  }

	  read_attr.insert(attr);

	}

	{

	  typename Attributes::iterator it = _attributes.lower_bound(attr);

	  while (it != _attributes.end() && it->first == attr) {

	    it->second->set(token);

	    ++it;

	  }

	}

      }

      if (readSuccess()) {

	line.putback(c);

      }

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

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

	if (read_attr.find(it->first) == read_attr.end()) {

	  std::ostringstream msg;

	  msg << "Attribute not found in file: " << it->first;

	  throw DataFormatError(msg.str().c_str());

	}	

      }

    }

  public:

    /// \name Execution of the reader    

    /// @{

    /// \brief Start the batch processing

    ///

    /// This function starts the batch processing

    void run() {

      LEMON_ASSERT(_is != 0, "This reader assigned to an other reader");

      bool nodes_done = false;

      bool arcs_done = false;

      bool attributes_done = false;

      std::set<std::string> extra_sections;

      line_num = 0;      

      readLine();

      while (readSuccess()) {

	skipSection();

	try {

	  char c;

	  std::string section, caption;

	  line >> c;

	  _reader_bits::readToken(line, section);

	  _reader_bits::readToken(line, caption);

	  if (line >> c) 

	    throw DataFormatError("Extra character on the end of line");

	  if (section == "nodes" && !nodes_done) {

	    if (_nodes_caption.empty() || _nodes_caption == caption) {

	      readNodes();

	      nodes_done = true;

	    }

	  } else if ((section == "arcs" || section == "edges") && 

		     !arcs_done) {

	    if (_arcs_caption.empty() || _arcs_caption == caption) {

	      readArcs();

	      arcs_done = true;

	    }

	  } else if (section == "attributes" && !attributes_done) {

	    if (_attributes_caption.empty() || _attributes_caption == caption) {

	      readAttributes();

	      attributes_done = true;

	    }

	  } else {

	    if (extra_sections.find(section) != extra_sections.end()) {

	      std::ostringstream msg;

	      msg << "Multiple occurence of section " << section;

	      throw DataFormatError(msg.str().c_str());

	    }

	    Sections::iterator it = _sections.find(section);

	    if (it != _sections.end()) {

	      extra_sections.insert(section);

	      it->second->process(*_is, line_num);

	      readLine();

	    } else {

	      readLine();

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

  }

  /// \relates DigraphReader

  template <typename Digraph>

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

				       Digraph& digraph) {

  }

  /// \relates DigraphReader

  template <typename Digraph>

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

  }

}

#endif

	if (it == _map.end()) {

	  throw DataFormatError("Item not found");

	}

	return it->second;

      }

    };

    bool isWhiteSpace(char c) {

      return c == ' ' || c == '\t' || c == '\v' || 

        c == '\n' || c == '\r' || c == '\f'; 

    }

    bool isEscaped(char c) {

      return c == '\\' || c == '\"' || c == '\'' || 

	c == '\a' || c == '\b';

    }

    static void writeEscape(std::ostream& os, char c) {

      switch (c) {

      case '\\':

	os << "\\\\";

	return;

      case '\"':

	os << "\\\"";

	return;

      case '\a':

	os << "\\a";

	return;

      case '\b':

	os << "\\b";

	return;

      case '\f':

	os << "\\f";

	return;

      case '\r':

	os << "\\r";

	return;

      case '\n':

	os << "\\n";

	return;

      case '\t':

	os << "\\t";

	return;

      case '\v':

	os << "\\v";

	return;

      default:

	if (c < 0x20) {

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

	} 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

  ///

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

  template <typename _Digraph>

  class DigraphWriter {

  public:

    typedef _Digraph Digraph;

    TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);

  private:

    std::ostream* _os;

    bool local_os;

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

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

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

      : _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 char* fn, Digraph& digraph) 

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

	_skip_nodes(false), _skip_arcs(false) {}

    /// \brief Copy constructor

    ///

    /// The copy constructor transfers all data from the other writer,

    /// therefore the copied writer will not be usable more. 

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

      _arcs_caption = other._arcs_caption;

      _attributes_caption = other._attributes_caption;

    }

    /// \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:

    DigraphWriter& operator=(const DigraphWriter&);

  public:

    /// \name Writing rules

    /// @{

    /// \brief Node map reading rule

    ///

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

      }

    }

    void writeAttributes() {

      if (_attributes.empty()) return;

      *_os << "@attributes";

      if (!_attributes_caption.empty()) {

	_writer_bits::writeToken(*_os << ' ', _attributes_caption);

      }

      *_os << std::endl;

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

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

	_writer_bits::writeToken(*_os, it->first) << ' ';

	_writer_bits::writeToken(*_os, it->second->get());

	*_os << std::endl;

      }

    }

  public:

    /// \name Execution of the writer    

    /// @{

    /// \brief Start the batch processing

    ///

    /// This function starts the batch processing

    void run() {

      if (!_skip_nodes) {

	writeNodes();

      }

      if (!_skip_arcs) {      

	writeArcs();

      }

      writeAttributes();

    }

    /// \brief Gives back the stream of the writer

    ///

    /// Gives back the stream of the writer

    std::ostream& ostream() {

      return *_os;

    }

    /// @}

  };

  /// \relates DigraphWriter

  template <typename Digraph>

  }

  /// \relates DigraphWriter

  template <typename Digraph>

  DigraphWriter<Digraph> digraphWriter(const std::string& fn, 

				       Digraph& digraph) {

  }

  /// \relates DigraphWriter

  template <typename Digraph>

  DigraphWriter<Digraph> digraphWriter(const char* fn, Digraph& digraph) {

  }

}

#endif