RhodeCode

    template <typename Map, typename Converter>

    DigraphReader& useNodes(const Map& map,

                            const Converter& converter = Converter()) {

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

      LEMON_ASSERT(!_use_nodes, "Multiple usage of useNodes() member");

      _use_nodes = true;

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

        _node_index.insert(std::make_pair(converter(map[n]), n));

      }

      return *this;

    }

    /// \brief Use previously constructed arc set

    ///

    /// Use previously constructed arc set, and specify the arc

    /// label map.

    template <typename Map>

    DigraphReader& useArcs(const Map& map) {

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

      LEMON_ASSERT(!_use_arcs, "Multiple usage of useArcs() member");

      _use_arcs = true;

      _writer_bits::DefaultConverter<typename Map::Value> converter;

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

        _arc_index.insert(std::make_pair(converter(map[a]), a));

      }

      return *this;

    }

    /// \brief Use previously constructed arc set

    ///

    /// Use previously constructed arc set, and specify the arc

    /// label map and a functor which converts the label map values to

    /// \c std::string.

    template <typename Map, typename Converter>

    DigraphReader& useArcs(const Map& map,

                           const Converter& converter = Converter()) {

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

      LEMON_ASSERT(!_use_arcs, "Multiple usage of useArcs() member");

      _use_arcs = true;

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

        _arc_index.insert(std::make_pair(converter(map[a]), a));

      }

      return *this;

    }

    /// \brief Skips the reading of node section

    ///

    /// Omit the reading of the node section. This implies that each node

    /// map reading rule will be abandoned, and the nodes of the graph

    /// will not be constructed, which usually cause that the arc set

    /// could not be read due to lack of node name resolving.

    /// Therefore \c skipArcs() function should also be used, or

    /// \c useNodes() should be used to specify the label of the nodes.

    DigraphReader& skipNodes() {

      LEMON_ASSERT(!_skip_nodes, "Skip nodes already set");

      _skip_nodes = true;

      return *this;

    }

    /// \brief Skips the reading of arc section

    ///

    /// Omit the reading of the arc section. This implies that each arc

    /// map reading rule will be abandoned, and the arcs of the graph

    /// will not be constructed.

    DigraphReader& skipArcs() {

      LEMON_ASSERT(!_skip_arcs, "Skip arcs already set");

      _skip_arcs = true;

      return *this;

    }

    /// @}

  private:

    bool readLine() {

      std::string str;

      while(++line_num, std::getline(*_is, str)) {

        line.clear(); line.str(str);

        char c;

        if (line >> std::ws >> c && c != '#') {

          line.putback(c);

          return true;

        }

      }

      return false;

    }

    bool readSuccess() {

      return static_cast<bool>(*_is);

    }

    void skipSection() {

      char c;

      while (readSuccess() && line >> c && c != '@') {

        readLine();

      }

      line.putback(c);

    }

    void readNodes() {

      std::vector<int> map_index(_node_maps.size());

      int map_num, label_index;

      char c;

      if (!readLine() || !(line >> c) || c == '@') {

        if (readSuccess() && line) line.putback(c);

        if (!_node_maps.empty())

          throw FormatError("Cannot find map names");

        return;

      }

      line.putback(c);

      {

        std::map<std::string, int> maps;

        std::string map;

        int index = 0;

        while (_reader_bits::readToken(line, map)) {

          if (maps.find(map) != maps.end()) {

            std::ostringstream msg;

            msg << "Multiple occurence of node map: " << map;

            throw FormatError(msg.str());

          }

          maps.insert(std::make_pair(map, index));

          ++index;

        }

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

          std::map<std::string, int>::iterator jt =

            maps.find(_node_maps[i].first);

          if (jt == maps.end()) {

            std::ostringstream msg;

            msg << "Map not found: " << _node_maps[i].first;

            throw FormatError(msg.str());

          }

          map_index[i] = jt->second;

        }

        {

          std::map<std::string, int>::iterator jt = maps.find("label");

          if (jt != maps.end()) {

            label_index = jt->second;

          } else {

            label_index = -1;

          }

        }

        map_num = maps.size();

      }

      while (readLine() && line >> c && c != '@') {

        line.putback(c);

        std::vector<std::string> tokens(map_num);

        for (int i = 0; i < map_num; ++i) {

          if (!_reader_bits::readToken(line, tokens[i])) {

            std::ostringstream msg;

            msg << "Column not found (" << i + 1 << ")";

            throw FormatError(msg.str());

          }

        }

        if (line >> std::ws >> c)

          throw FormatError("Extra character at the end of line");

        Node n;

        if (!_use_nodes) {

          n = _digraph.addNode();

          if (label_index != -1)

            _node_index.insert(std::make_pair(tokens[label_index], n));

        } else {

          if (label_index == -1)

            throw FormatError("Label map not found");

          typename std::map<std::string, Node>::iterator it =

            _node_index.find(tokens[label_index]);

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

            std::ostringstream msg;

            msg << "Node with label not found: " << tokens[label_index];

            throw FormatError(msg.str());

          }

          n = it->second;

        }

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

          _node_maps[i].second->set(n, tokens[map_index[i]]);

        }

      }

      if (readSuccess()) {

        line.putback(c);

      }

    }

    void readArcs() {

    GraphReader& useNodes(const Map& map,

                            const Converter& converter = Converter()) {

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

      LEMON_ASSERT(!_use_nodes, "Multiple usage of useNodes() member");

      _use_nodes = true;

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

        _node_index.insert(std::make_pair(converter(map[n]), n));

      }

      return *this;

    }

    /// \brief Use previously constructed edge set

    ///

    /// Use previously constructed edge set, and specify the edge

    /// label map.

    template <typename Map>

    GraphReader& useEdges(const Map& map) {

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

      LEMON_ASSERT(!_use_edges, "Multiple usage of useEdges() member");

      _use_edges = true;

      _writer_bits::DefaultConverter<typename Map::Value> converter;

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

        _edge_index.insert(std::make_pair(converter(map[a]), a));

      }

      return *this;

    }

    /// \brief Use previously constructed edge set

    ///

    /// Use previously constructed edge set, and specify the edge

    /// label map and a functor which converts the label map values to

    /// \c std::string.

    template <typename Map, typename Converter>

    GraphReader& useEdges(const Map& map,

                            const Converter& converter = Converter()) {

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

      LEMON_ASSERT(!_use_edges, "Multiple usage of useEdges() member");

      _use_edges = true;

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

        _edge_index.insert(std::make_pair(converter(map[a]), a));

      }

      return *this;

    }

    /// \brief Skip the reading of node section

    ///

    /// Omit the reading of the node section. This implies that each node

    /// map reading rule will be abandoned, and the nodes of the graph

    /// will not be constructed, which usually cause that the edge set

    /// could not be read due to lack of node name

    /// could not be read due to lack of node name resolving.

    /// Therefore \c skipEdges() function should also be used, or

    /// \c useNodes() should be used to specify the label of the nodes.

    GraphReader& skipNodes() {

      LEMON_ASSERT(!_skip_nodes, "Skip nodes already set");

      _skip_nodes = true;

      return *this;

    }

    /// \brief Skip the reading of edge section

    ///

    /// Omit the reading of the edge section. This implies that each edge

    /// map reading rule will be abandoned, and the edges of the graph

    /// will not be constructed.

    GraphReader& skipEdges() {

      LEMON_ASSERT(!_skip_edges, "Skip edges already set");

      _skip_edges = true;

      return *this;

    }

    /// @}

  private:

    bool readLine() {

      std::string str;

      while(++line_num, std::getline(*_is, str)) {

        line.clear(); line.str(str);

        char c;

        if (line >> std::ws >> c && c != '#') {

          line.putback(c);

          return true;

        }

      }

      return false;

    }

    bool readSuccess() {

      return static_cast<bool>(*_is);

    }

    void skipSection() {

      char c;

      while (readSuccess() && line >> c && c != '@') {

        readLine();

      }

      line.putback(c);

    }

    void readNodes() {

      std::vector<int> map_index(_node_maps.size());

      int map_num, label_index;

      char c;

      if (!readLine() || !(line >> c) || c == '@') {

        if (readSuccess() && line) line.putback(c);

        if (!_node_maps.empty())

          throw FormatError("Cannot find map names");

        return;

      }

      line.putback(c);

      {

        std::map<std::string, int> maps;

        std::string map;

        int index = 0;

        while (_reader_bits::readToken(line, map)) {

          if (maps.find(map) != maps.end()) {

            std::ostringstream msg;

            msg << "Multiple occurence of node map: " << map;

            throw FormatError(msg.str());

          }

          maps.insert(std::make_pair(map, index));

          ++index;

        }

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

          std::map<std::string, int>::iterator jt =

            maps.find(_node_maps[i].first);

          if (jt == maps.end()) {

            std::ostringstream msg;

            msg << "Map not found: " << _node_maps[i].first;

            throw FormatError(msg.str());

          }

          map_index[i] = jt->second;

        }

        {

          std::map<std::string, int>::iterator jt = maps.find("label");

          if (jt != maps.end()) {

            label_index = jt->second;

          } else {

            label_index = -1;

          }

        }

        map_num = maps.size();

      }

      while (readLine() && line >> c && c != '@') {

        line.putback(c);

        std::vector<std::string> tokens(map_num);

        for (int i = 0; i < map_num; ++i) {

          if (!_reader_bits::readToken(line, tokens[i])) {

            std::ostringstream msg;

            msg << "Column not found (" << i + 1 << ")";

            throw FormatError(msg.str());

          }

        }

        if (line >> std::ws >> c)

          throw FormatError("Extra character at the end of line");

        Node n;

        if (!_use_nodes) {

          n = _graph.addNode();

          if (label_index != -1)

            _node_index.insert(std::make_pair(tokens[label_index], n));

        } else {

          if (label_index == -1)

            throw FormatError("Label map not found");

          typename std::map<std::string, Node>::iterator it =

            _node_index.find(tokens[label_index]);

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

            std::ostringstream msg;

            msg << "Node with label not found: " << tokens[label_index];

            throw FormatError(msg.str());

          }

          n = it->second;

        }

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

          _node_maps[i].second->set(n, tokens[map_index[i]]);

        }

      }

      if (readSuccess()) {

        line.putback(c);

      }

    }

    void readEdges() {

    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 a 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 empty.");

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

                   "Multiple reading of section.");

      _sections.insert(std::make_pair(type,

        new _reader_bits::LineSection<Functor>(functor)));

      return *this;

    }

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

    ///

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

    /// a functor, which takes an \c std::istream& and an \c int&

    /// parameter, the latter regard to the line number of stream. The

    /// functor can read the input while the section go on, and the

    /// line number should be modified accordingly.

    template <typename Functor>

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

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

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

                   "Multiple reading of section.");

      _sections.insert(std::make_pair(type,

         new _reader_bits::StreamSection<Functor>(functor)));

      return *this;

    }

    /// @}

  private:

    bool readLine() {

      std::string str;

      while(++line_num, std::getline(*_is, str)) {

        line.clear(); line.str(str);

        char c;

        if (line >> std::ws >> c && c != '#') {

          line.putback(c);

          return true;

        }

      }

      return false;

    }

    bool readSuccess() {

      return static_cast<bool>(*_is);

    }

    void skipSection() {

      char c;

      while (readSuccess() && line >> c && c != '@') {

        readLine();

      }

      line.putback(c);

    }

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

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

      line_num = 0;

      readLine();

      skipSection();

      while (readSuccess()) {

        try {

          char c;

          std::string section, caption;

          line >> c;

          _reader_bits::readToken(line, section);

          _reader_bits::readToken(line, caption);

          if (line >> c)

            throw FormatError("Extra character at the end of line");

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

            std::ostringstream msg;

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

            throw FormatError(msg.str());

          }

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

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

            extra_sections.insert(section);

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

          }

          readLine();

          skipSection();

        } catch (FormatError& error) {

          error.line(line_num);

          error.file(_filename);

          throw;

        }

      }

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

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

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

          std::ostringstream os;

          os << "Cannot find section: " << it->first;

          throw FormatError(os.str());

        }

      }

    }

    /// @}

  };

  /// \brief Return a \ref SectionReader class

  ///

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

  /// \relates SectionReader

  inline SectionReader sectionReader(std::istream& is) {

    SectionReader tmp(is);

    return tmp;

  }

  /// \brief Return a \ref SectionReader class

  ///

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

  /// \relates SectionReader

  inline SectionReader sectionReader(const std::string& fn) {

    SectionReader tmp(fn);

    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

  ///

  /// \brief Reader for the contents of the \ref lgf-format "LGF" file

  ///

  /// This class can be used to read the sections, the map names and

  /// the attributes from a file. Usually, the LEMON programs know

    /// \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 arcSectionNum().

    int edgeSectionNum() 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 arcSection().

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

      return _edge_sections[i];

    }

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

    ///

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

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

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

      return _edge_maps[i];

    }

    /// @}

    /// \name Attribute sections

    /// @{

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

    ///

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

    int attributeSectionNum() const {

      return _attribute_sections.size();

    }

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

    ///

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

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

      return _attribute_sections[i];

    }

    /// \brief Gives back the attributes for the given section.

    ///

    /// Gives back the attributes for the given section.

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

      return _attributes[i];

    }

    /// @}

    /// \name Extra sections

    /// @{

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

    ///

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

    int extraSectionNum() const {

      return _extra_sections.size();

    }

    /// \brief Returns the extra section type at the given position.

    ///

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

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

      return _extra_sections[i];

    }

    /// @}

  private:

    bool readLine() {

      std::string str;

      while(++line_num, std::getline(*_is, str)) {

        line.clear(); line.str(str);

        char c;

        if (line >> std::ws >> c && c != '#') {

          line.putback(c);

          return true;

        }

      }

      return false;

    }

    bool readSuccess() {

      return static_cast<bool>(*_is);

    }

    void skipSection() {

      char c;

      while (readSuccess() && line >> c && c != '@') {

        readLine();

      }

      line.putback(c);

    }

    void readMaps(std::vector<std::string>& maps) {

      char c;

      if (!readLine() || !(line >> c) || c == '@') {

        if (readSuccess() && line) line.putback(c);

        return;

      }

      line.putback(c);

      std::string map;

      while (_reader_bits::readToken(line, map)) {

        maps.push_back(map);

      }

    }

    void readAttributes(std::vector<std::string>& attrs) {

      readLine();

      char c;

      while (readSuccess() && line >> c && c != '@') {

        line.putback(c);

        std::string attr;

        _reader_bits::readToken(line, attr);

        attrs.push_back(attr);

        readLine();

      }

      line.putback(c);

    }

  public:

    /// \name Execution of the contents reader

    /// @{

    /// \brief Starts the reading

    ///

    /// This function starts the reading.

    void run() {

      readLine();

      skipSection();

      while (readSuccess()) {

        char c;

        line >> c;

        std::string section, caption;

        _reader_bits::readToken(line, section);

        _reader_bits::readToken(line, caption);

        if (section == "nodes") {

          _node_sections.push_back(caption);

          _node_maps.push_back(std::vector<std::string>());

          readMaps(_node_maps.back());

          readLine(); skipSection();

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

          _edge_sections.push_back(caption);

          _arc_sections.push_back(section == "arcs");

          _edge_maps.push_back(std::vector<std::string>());

          readMaps(_edge_maps.back());

          readLine(); skipSection();

        } else if (section == "attributes") {

          _attribute_sections.push_back(caption);

          _attributes.push_back(std::vector<std::string>());

          readAttributes(_attributes.back());

        } else {

          _extra_sections.push_back(section);

          readLine(); skipSection();

        }

      }

    }

    /// @}

  };

}

#endif