RhodeCode

      virtual void set(const Item& item ,const std::string& value) {

        _map.set(item, _converter(value));

      }

    };

              typename _Converter = DefaultConverter<typename _Map::Value> >

    public:

      typedef _Map Map;

      typedef _Converter Converter;

      static const bool dir = _dir;

    private:

      Map& _map;

      Converter _converter;

    public:

                         const Converter& converter = Converter())

        : _graph(graph), _map(map), _converter(converter) {}

      virtual ~GraphArcMapStorage() {}

      virtual void set(const Item& item ,const std::string& value) {

        _map.set(_graph.direct(item, dir), _converter(value));

          throw FormatError(msg.str());

        }

        return it->second;

      }

    };

    struct GraphArcLookUpConverter {

                              const std::map<std::string,

        : _graph(graph), _map(map) {}

        if (str.empty() || (str[0] != '+' && str[0] != '-')) {

          throw FormatError("Item must start with '+' or '-'");

        }

          ::const_iterator it = _map.find(str.substr(1));

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

          throw FormatError("Item not found");

        }

        return _graph.direct(it->second, str[0] == '+');

      }

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

      }

    };

  }

  class DigraphReader;

  /// \ingroup lemon_io

  ///

  /// \brief \ref lgf-format "LGF" reader for directed graphs

  ///

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

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

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

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

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

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

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

  ///   run();

  /// 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 to read this in

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

  /// maps are read.

  class DigraphReader {

  public:

  private:

    std::istream* _is;

    bool local_is;

    std::string _filename;

    std::string _nodes_caption;

    std::string _arcs_caption;

    std::string _attributes_caption;

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

  public:

    /// \brief Constructor

    ///

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

    /// input stream.

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

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

      if (!(*_is)) {

        delete _is;

    }

    /// \brief Constructor

    ///

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

    /// file.

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

        _filename(fn), _digraph(digraph),

        _use_nodes(false), _use_arcs(false),

        _skip_nodes(false), _skip_arcs(false) {

      if (!(*_is)) {

        delete _is;

      }

    }

  private:

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

    }

    /// @}

  };

  /// \brief Return a \ref DigraphReader class

  ///

  /// This function just returns a \ref DigraphReader class.

  /// \relates DigraphReader

    return tmp;

  }

  /// \brief Return a \ref DigraphReader class

  ///

  /// This function just returns a \ref DigraphReader class.

  /// \relates DigraphReader

    return tmp;

  }

  class GraphReader;

  /// \ingroup lemon_io

  ///

  /// \brief \ref lgf-format "LGF" reader for undirected graphs

  ///

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

  public:

    typedef GR Graph;

  private:

    std::istream* _is;

    bool local_is;

    std::string _filename;

    std::string _nodes_caption;

    std::string _edges_caption;

    std::string _attributes_caption;

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

  public:

    /// \brief Constructor

    ///

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

    /// input stream.

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

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

      if (!(*_is)) {

        delete _is;

    }

    /// \brief Constructor

    ///

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

    /// file.

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

        _filename(fn), _graph(graph),

        _use_nodes(false), _use_edges(false),

        _skip_nodes(false), _skip_edges(false) {

      if (!(*_is)) {

        delete _is;

        delete _is;

      }

    }

  private:

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

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

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

      _reader_bits::MapStorageBase<Edge>* forward_storage =

        new _reader_bits::GraphArcMapStorage<Graph, true, Map>(_graph, map);

      _edge_maps.push_back(std::make_pair('+' + caption, forward_storage));

      _reader_bits::MapStorageBase<Edge>* backward_storage =

      _edge_maps.push_back(std::make_pair('-' + caption, backward_storage));

      return *this;

    }

    /// \brief Arc map reading rule

    ///

    /// reader.

    template <typename Map, typename Converter>

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

                          const Converter& converter = Converter()) {

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

      _reader_bits::MapStorageBase<Edge>* forward_storage =

        (_graph, map, converter);

      _edge_maps.push_back(std::make_pair('+' + caption, forward_storage));

      _reader_bits::MapStorageBase<Edge>* backward_storage =

        (_graph, map, converter);

      _edge_maps.push_back(std::make_pair('-' + caption, backward_storage));

      return *this;

    }

    /// \brief Attribute reading rule

    }

    /// \brief Arc reading rule

    ///

    /// Add an arc reading rule to reader.

    GraphReader& arc(const std::string& caption, Arc& arc) {

      Converter converter(_graph, _edge_index);

      _reader_bits::ValueStorageBase* storage =

        new _reader_bits::ValueStorage<Arc, Converter>(arc, converter);

      _attributes.insert(std::make_pair(caption, storage));

      return *this;

    }

    }

    /// @}

  };

  /// \brief Return a \ref GraphReader class

  ///

  /// This function just returns a \ref GraphReader class.

  /// \relates GraphReader

    return tmp;

  }

  /// \brief Return a \ref GraphReader class

  ///

  /// This function just returns a \ref GraphReader class.

  /// \relates GraphReader

    return tmp;

  }

  class SectionReader;

  SectionReader sectionReader(std::istream& is);

    }

    /// @}

  };

  /// \brief Return a \ref SectionReader class

  ///

  /// This function just returns a \ref SectionReader class.

  /// \relates SectionReader

    return tmp;

  }

  /// \brief Return a \ref SectionReader class

  ///

  /// This function just returns a \ref SectionReader class.

  /// \relates SectionReader

  inline SectionReader sectionReader(const char* fn) {

    SectionReader tmp(fn);

    return tmp;

  }

  /// \ingroup lemon_io

        _functor(os);

      }

    };

  }

  class DigraphWriter;

  /// \ingroup lemon_io

  ///

  /// \brief \ref lgf-format "LGF" writer for directed graphs

  ///

  /// is set, it will determine how the value type of the map 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

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

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

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

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

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

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

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

  class DigraphWriter {

  public:

  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;

  public:

    /// \brief Constructor

    ///

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

    /// output stream.

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

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

        _skip_nodes(false), _skip_arcs(false) {

      if (!(*_os)) {

        delete _os;

        throw IoError("Cannot write file", fn);

      }

    }

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

      if (!(*_os)) {

        delete _os;

        throw IoError("Cannot write file", fn);

      }

        delete _os;

      }

    }

  private:

    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;

      std::vector<Node> nodes;

      for (NodeIt n(_digraph); n != INVALID; ++n) {

        nodes.push_back(n);

      }

      if (label == 0) {

        std::sort(nodes.begin(), nodes.end(), id_less);

      } else {

        label->sort(nodes);

      }

      for (int i = 0; i < static_cast<int>(nodes.size()); ++i) {

      std::vector<Arc> arcs;

      for (ArcIt n(_digraph); n != INVALID; ++n) {

        arcs.push_back(n);

      }

      if (label == 0) {

        std::sort(arcs.begin(), arcs.end(), id_less);

      } else {

        label->sort(arcs);

      }

      for (int i = 0; i < static_cast<int>(arcs.size()); ++i) {

      return *_os;

    }

    /// @}

  };

  /// \brief Return a \ref DigraphWriter class

  ///

  /// \relates DigraphWriter

    return tmp;

  }

  /// \brief Return a \ref DigraphWriter class

  ///

  /// This function just returns a \ref DigraphWriter class.

  /// \relates DigraphWriter

    return tmp;

  }

  /// \brief Return a \ref DigraphWriter class

  ///

  /// This function just returns a \ref DigraphWriter class.

  /// \relates DigraphWriter

    return tmp;

  }

  class GraphWriter;

  /// \ingroup lemon_io

  ///

  /// \brief \ref lgf-format "LGF" writer for directed graphs

  ///

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

  /// of the arc) and the label of corresponding edge.

  template <typename GR>

  class GraphWriter {

  public:

    typedef GR Graph;

  private:

    std::ostream* _os;

    bool local_os;

    std::string _nodes_caption;

    std::string _edges_caption;

    std::string _attributes_caption;

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

  public:

    /// \brief Constructor

    ///

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

    /// output stream.

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

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

        _skip_nodes(false), _skip_edges(false) {

      if (!(*_os)) {

        delete _os;

        throw IoError("Cannot write file", fn);

      }

    }

    /// \brief Constructor

    ///

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

    /// output file.

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

        _skip_nodes(false), _skip_edges(false) {

      if (!(*_os)) {

        delete _os;

        throw IoError("Cannot write file", fn);

      }

        delete _os;

      }

    }

  private:

    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;

    ///

    /// Add an arc map writing rule to the writer.

    template <typename Map>

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

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

      _writer_bits::MapStorageBase<Edge>* forward_storage =

      _edge_maps.push_back(std::make_pair('+' + caption, forward_storage));

      _writer_bits::MapStorageBase<Edge>* backward_storage =

      _edge_maps.push_back(std::make_pair('-' + caption, backward_storage));

      return *this;

    }

    /// \brief Arc map writing rule

    ///

    /// writer.

    template <typename Map, typename Converter>

    GraphWriter& arcMap(const std::string& caption, const Map& map,

                          const Converter& converter = Converter()) {

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

      _writer_bits::MapStorageBase<Edge>* forward_storage =

        (_graph, map, converter);

      _edge_maps.push_back(std::make_pair('+' + caption, forward_storage));

      _writer_bits::MapStorageBase<Edge>* backward_storage =

        (_graph, map, converter);

      _edge_maps.push_back(std::make_pair('-' + caption, backward_storage));

      return *this;

    }

    /// \brief Attribute writing rule

    }

    /// \brief Arc writing rule

    ///

    /// Add an arc writing rule to writer.

    GraphWriter& arc(const std::string& caption, const Arc& arc) {

      Converter converter(_graph, _edge_index);

      _writer_bits::ValueStorageBase* storage =

        new _writer_bits::ValueStorage<Arc, Converter>(arc, converter);

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

      return *this;

    }

      std::vector<Node> nodes;

      for (NodeIt n(_graph); n != INVALID; ++n) {

        nodes.push_back(n);

      }

      if (label == 0) {

        std::sort(nodes.begin(), nodes.end(), id_less);

      } else {

        label->sort(nodes);

      }

      for (int i = 0; i < static_cast<int>(nodes.size()); ++i) {

      std::vector<Edge> edges;

      for (EdgeIt n(_graph); n != INVALID; ++n) {

        edges.push_back(n);

      }

      if (label == 0) {

        std::sort(edges.begin(), edges.end(), id_less);

      } else {

        label->sort(edges);

      }

      for (int i = 0; i < static_cast<int>(edges.size()); ++i) {

      return *_os;

    }

    /// @}

  };

  /// \brief Return a \ref GraphWriter class

  ///