lemon/lgf_reader.h
author Alpar Juttner <alpar@cs.elte.hu>
Mon, 23 Feb 2009 15:46:57 +0000
changeset 379 39aaeea2d471
parent 327 5e12d7734036
child 376 d3524090d5e2
child 422 54464584b157
permissions -rw-r--r--
Include /lemon/config.h globally (#230)
alpar@209
     1
/* -*- mode: C++; indent-tabs-mode: nil; -*-
deba@127
     2
 *
alpar@209
     3
 * This file is a part of LEMON, a generic C++ optimization library.
deba@127
     4
 *
deba@127
     5
 * Copyright (C) 2003-2008
deba@127
     6
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
deba@127
     7
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
deba@127
     8
 *
deba@127
     9
 * Permission to use, modify and distribute this software is granted
deba@127
    10
 * provided that this copyright notice appears in all copies. For
deba@127
    11
 * precise terms see the accompanying LICENSE file.
deba@127
    12
 *
deba@127
    13
 * This software is provided "AS IS" with no warranty of any kind,
deba@127
    14
 * express or implied, and with no claim as to its suitability for any
deba@127
    15
 * purpose.
deba@127
    16
 *
deba@127
    17
 */
deba@127
    18
deba@127
    19
///\ingroup lemon_io
deba@127
    20
///\file
ladanyi@236
    21
///\brief \ref lgf-format "LEMON Graph Format" reader.
deba@127
    22
deba@127
    23
deba@127
    24
#ifndef LEMON_LGF_READER_H
deba@127
    25
#define LEMON_LGF_READER_H
deba@127
    26
deba@127
    27
#include <iostream>
deba@127
    28
#include <fstream>
deba@127
    29
#include <sstream>
deba@127
    30
deba@127
    31
#include <set>
deba@127
    32
#include <map>
deba@127
    33
deba@220
    34
#include <lemon/core.h>
deba@127
    35
deba@127
    36
#include <lemon/lgf_writer.h>
deba@127
    37
deba@127
    38
#include <lemon/concept_check.h>
deba@127
    39
#include <lemon/concepts/maps.h>
deba@127
    40
deba@127
    41
namespace lemon {
deba@127
    42
deba@127
    43
  namespace _reader_bits {
deba@127
    44
deba@127
    45
    template <typename Value>
deba@127
    46
    struct DefaultConverter {
deba@127
    47
      Value operator()(const std::string& str) {
alpar@209
    48
        std::istringstream is(str);
alpar@209
    49
        Value value;
deba@290
    50
        if (!(is >> value)) {
deba@290
    51
          throw FormatError("Cannot read token");
deba@290
    52
        }
alpar@209
    53
alpar@209
    54
        char c;
alpar@209
    55
        if (is >> std::ws >> c) {
deba@290
    56
          throw FormatError("Remaining characters in token");
alpar@209
    57
        }
alpar@209
    58
        return value;
deba@127
    59
      }
deba@127
    60
    };
deba@127
    61
deba@127
    62
    template <>
deba@127
    63
    struct DefaultConverter<std::string> {
deba@127
    64
      std::string operator()(const std::string& str) {
alpar@209
    65
        return str;
deba@127
    66
      }
deba@127
    67
    };
deba@127
    68
alpar@209
    69
    template <typename _Item>
deba@127
    70
    class MapStorageBase {
deba@127
    71
    public:
deba@127
    72
      typedef _Item Item;
deba@127
    73
deba@127
    74
    public:
deba@127
    75
      MapStorageBase() {}
deba@127
    76
      virtual ~MapStorageBase() {}
deba@127
    77
deba@127
    78
      virtual void set(const Item& item, const std::string& value) = 0;
deba@127
    79
deba@127
    80
    };
deba@127
    81
alpar@209
    82
    template <typename _Item, typename _Map,
alpar@209
    83
              typename _Converter = DefaultConverter<typename _Map::Value> >
deba@127
    84
    class MapStorage : public MapStorageBase<_Item> {
deba@127
    85
    public:
deba@127
    86
      typedef _Map Map;
deba@127
    87
      typedef _Converter Converter;
deba@127
    88
      typedef _Item Item;
alpar@209
    89
deba@127
    90
    private:
deba@127
    91
      Map& _map;
deba@127
    92
      Converter _converter;
deba@127
    93
deba@127
    94
    public:
alpar@209
    95
      MapStorage(Map& map, const Converter& converter = Converter())
alpar@209
    96
        : _map(map), _converter(converter) {}
deba@127
    97
      virtual ~MapStorage() {}
deba@127
    98
deba@127
    99
      virtual void set(const Item& item ,const std::string& value) {
alpar@209
   100
        _map.set(item, _converter(value));
deba@127
   101
      }
deba@127
   102
    };
deba@127
   103
alpar@209
   104
    template <typename _Graph, bool _dir, typename _Map,
alpar@209
   105
              typename _Converter = DefaultConverter<typename _Map::Value> >
deba@165
   106
    class GraphArcMapStorage : public MapStorageBase<typename _Graph::Edge> {
deba@165
   107
    public:
deba@165
   108
      typedef _Map Map;
deba@165
   109
      typedef _Converter Converter;
deba@165
   110
      typedef _Graph Graph;
deba@165
   111
      typedef typename Graph::Edge Item;
deba@165
   112
      static const bool dir = _dir;
alpar@209
   113
deba@165
   114
    private:
deba@165
   115
      const Graph& _graph;
deba@165
   116
      Map& _map;
deba@165
   117
      Converter _converter;
deba@165
   118
deba@165
   119
    public:
alpar@209
   120
      GraphArcMapStorage(const Graph& graph, Map& map,
alpar@209
   121
                         const Converter& converter = Converter())
alpar@209
   122
        : _graph(graph), _map(map), _converter(converter) {}
deba@165
   123
      virtual ~GraphArcMapStorage() {}
deba@165
   124
deba@165
   125
      virtual void set(const Item& item ,const std::string& value) {
alpar@209
   126
        _map.set(_graph.direct(item, dir), _converter(value));
deba@165
   127
      }
deba@165
   128
    };
deba@165
   129
deba@127
   130
    class ValueStorageBase {
deba@127
   131
    public:
deba@127
   132
      ValueStorageBase() {}
deba@127
   133
      virtual ~ValueStorageBase() {}
deba@127
   134
deba@127
   135
      virtual void set(const std::string&) = 0;
deba@127
   136
    };
deba@127
   137
deba@127
   138
    template <typename _Value, typename _Converter = DefaultConverter<_Value> >
deba@127
   139
    class ValueStorage : public ValueStorageBase {
deba@127
   140
    public:
deba@127
   141
      typedef _Value Value;
deba@127
   142
      typedef _Converter Converter;
deba@127
   143
deba@127
   144
    private:
deba@127
   145
      Value& _value;
deba@127
   146
      Converter _converter;
deba@127
   147
deba@127
   148
    public:
deba@127
   149
      ValueStorage(Value& value, const Converter& converter = Converter())
kpeter@212
   150
        : _value(value), _converter(converter) {}
deba@127
   151
deba@127
   152
      virtual void set(const std::string& value) {
alpar@209
   153
        _value = _converter(value);
deba@127
   154
      }
deba@127
   155
    };
deba@127
   156
deba@127
   157
    template <typename Value>
deba@127
   158
    struct MapLookUpConverter {
deba@127
   159
      const std::map<std::string, Value>& _map;
deba@127
   160
deba@127
   161
      MapLookUpConverter(const std::map<std::string, Value>& map)
deba@127
   162
        : _map(map) {}
deba@127
   163
deba@127
   164
      Value operator()(const std::string& str) {
deba@127
   165
        typename std::map<std::string, Value>::const_iterator it =
deba@127
   166
          _map.find(str);
deba@127
   167
        if (it == _map.end()) {
deba@127
   168
          std::ostringstream msg;
deba@127
   169
          msg << "Item not found: " << str;
deba@290
   170
          throw FormatError(msg.str());
deba@127
   171
        }
deba@127
   172
        return it->second;
deba@127
   173
      }
deba@127
   174
    };
deba@127
   175
deba@165
   176
    template <typename Graph>
deba@165
   177
    struct GraphArcLookUpConverter {
deba@165
   178
      const Graph& _graph;
deba@165
   179
      const std::map<std::string, typename Graph::Edge>& _map;
alpar@209
   180
alpar@209
   181
      GraphArcLookUpConverter(const Graph& graph,
alpar@209
   182
                              const std::map<std::string,
alpar@209
   183
                                             typename Graph::Edge>& map)
alpar@209
   184
        : _graph(graph), _map(map) {}
alpar@209
   185
deba@165
   186
      typename Graph::Arc operator()(const std::string& str) {
alpar@209
   187
        if (str.empty() || (str[0] != '+' && str[0] != '-')) {
deba@290
   188
          throw FormatError("Item must start with '+' or '-'");
alpar@209
   189
        }
alpar@209
   190
        typename std::map<std::string, typename Graph::Edge>
alpar@209
   191
          ::const_iterator it = _map.find(str.substr(1));
alpar@209
   192
        if (it == _map.end()) {
deba@290
   193
          throw FormatError("Item not found");
alpar@209
   194
        }
alpar@209
   195
        return _graph.direct(it->second, str[0] == '+');
deba@165
   196
      }
deba@165
   197
    };
deba@165
   198
deba@197
   199
    inline bool isWhiteSpace(char c) {
alpar@209
   200
      return c == ' ' || c == '\t' || c == '\v' ||
alpar@209
   201
        c == '\n' || c == '\r' || c == '\f';
deba@127
   202
    }
alpar@209
   203
deba@197
   204
    inline bool isOct(char c) {
alpar@209
   205
      return '0' <= c && c <='7';
deba@127
   206
    }
alpar@209
   207
deba@197
   208
    inline int valueOct(char c) {
deba@127
   209
      LEMON_ASSERT(isOct(c), "The character is not octal.");
deba@127
   210
      return c - '0';
deba@127
   211
    }
deba@127
   212
deba@197
   213
    inline bool isHex(char c) {
alpar@209
   214
      return ('0' <= c && c <= '9') ||
alpar@209
   215
        ('a' <= c && c <= 'z') ||
alpar@209
   216
        ('A' <= c && c <= 'Z');
deba@127
   217
    }
alpar@209
   218
deba@197
   219
    inline int valueHex(char c) {
deba@127
   220
      LEMON_ASSERT(isHex(c), "The character is not hexadecimal.");
deba@127
   221
      if ('0' <= c && c <= '9') return c - '0';
deba@127
   222
      if ('a' <= c && c <= 'z') return c - 'a' + 10;
deba@127
   223
      return c - 'A' + 10;
deba@127
   224
    }
deba@127
   225
deba@197
   226
    inline bool isIdentifierFirstChar(char c) {
deba@127
   227
      return ('a' <= c && c <= 'z') ||
alpar@209
   228
        ('A' <= c && c <= 'Z') || c == '_';
deba@127
   229
    }
deba@127
   230
deba@197
   231
    inline bool isIdentifierChar(char c) {
deba@127
   232
      return isIdentifierFirstChar(c) ||
alpar@209
   233
        ('0' <= c && c <= '9');
deba@127
   234
    }
deba@127
   235
deba@197
   236
    inline char readEscape(std::istream& is) {
deba@127
   237
      char c;
deba@127
   238
      if (!is.get(c))
deba@290
   239
        throw FormatError("Escape format error");
deba@127
   240
deba@127
   241
      switch (c) {
deba@127
   242
      case '\\':
alpar@209
   243
        return '\\';
deba@127
   244
      case '\"':
alpar@209
   245
        return '\"';
deba@127
   246
      case '\'':
alpar@209
   247
        return '\'';
deba@127
   248
      case '\?':
alpar@209
   249
        return '\?';
deba@127
   250
      case 'a':
alpar@209
   251
        return '\a';
deba@127
   252
      case 'b':
alpar@209
   253
        return '\b';
deba@127
   254
      case 'f':
alpar@209
   255
        return '\f';
deba@127
   256
      case 'n':
alpar@209
   257
        return '\n';
deba@127
   258
      case 'r':
alpar@209
   259
        return '\r';
deba@127
   260
      case 't':
alpar@209
   261
        return '\t';
deba@127
   262
      case 'v':
alpar@209
   263
        return '\v';
deba@127
   264
      case 'x':
alpar@209
   265
        {
alpar@209
   266
          int code;
alpar@209
   267
          if (!is.get(c) || !isHex(c))
deba@290
   268
            throw FormatError("Escape format error");
alpar@209
   269
          else if (code = valueHex(c), !is.get(c) || !isHex(c)) is.putback(c);
alpar@209
   270
          else code = code * 16 + valueHex(c);
alpar@209
   271
          return code;
alpar@209
   272
        }
deba@127
   273
      default:
alpar@209
   274
        {
alpar@209
   275
          int code;
alpar@209
   276
          if (!isOct(c))
deba@290
   277
            throw FormatError("Escape format error");
alpar@209
   278
          else if (code = valueOct(c), !is.get(c) || !isOct(c))
alpar@209
   279
            is.putback(c);
alpar@209
   280
          else if (code = code * 8 + valueOct(c), !is.get(c) || !isOct(c))
alpar@209
   281
            is.putback(c);
alpar@209
   282
          else code = code * 8 + valueOct(c);
alpar@209
   283
          return code;
alpar@209
   284
        }
alpar@209
   285
      }
deba@127
   286
    }
alpar@209
   287
deba@197
   288
    inline std::istream& readToken(std::istream& is, std::string& str) {
deba@127
   289
      std::ostringstream os;
deba@127
   290
deba@127
   291
      char c;
deba@127
   292
      is >> std::ws;
alpar@209
   293
alpar@209
   294
      if (!is.get(c))
alpar@209
   295
        return is;
deba@127
   296
deba@127
   297
      if (c == '\"') {
alpar@209
   298
        while (is.get(c) && c != '\"') {
alpar@209
   299
          if (c == '\\')
alpar@209
   300
            c = readEscape(is);
alpar@209
   301
          os << c;
alpar@209
   302
        }
alpar@209
   303
        if (!is)
deba@290
   304
          throw FormatError("Quoted format error");
deba@127
   305
      } else {
alpar@209
   306
        is.putback(c);
alpar@209
   307
        while (is.get(c) && !isWhiteSpace(c)) {
alpar@209
   308
          if (c == '\\')
alpar@209
   309
            c = readEscape(is);
alpar@209
   310
          os << c;
alpar@209
   311
        }
alpar@209
   312
        if (!is) {
alpar@209
   313
          is.clear();
alpar@209
   314
        } else {
alpar@209
   315
          is.putback(c);
alpar@209
   316
        }
deba@127
   317
      }
deba@127
   318
      str = os.str();
deba@127
   319
      return is;
deba@127
   320
    }
deba@162
   321
deba@162
   322
    class Section {
deba@162
   323
    public:
deba@162
   324
      virtual ~Section() {}
deba@162
   325
      virtual void process(std::istream& is, int& line_num) = 0;
deba@162
   326
    };
deba@162
   327
deba@162
   328
    template <typename Functor>
deba@162
   329
    class LineSection : public Section {
deba@162
   330
    private:
deba@162
   331
deba@162
   332
      Functor _functor;
deba@162
   333
deba@162
   334
    public:
alpar@209
   335
deba@162
   336
      LineSection(const Functor& functor) : _functor(functor) {}
deba@162
   337
      virtual ~LineSection() {}
deba@162
   338
deba@162
   339
      virtual void process(std::istream& is, int& line_num) {
alpar@209
   340
        char c;
alpar@209
   341
        std::string line;
alpar@209
   342
        while (is.get(c) && c != '@') {
alpar@209
   343
          if (c == '\n') {
alpar@209
   344
            ++line_num;
alpar@209
   345
          } else if (c == '#') {
alpar@209
   346
            getline(is, line);
alpar@209
   347
            ++line_num;
alpar@209
   348
          } else if (!isWhiteSpace(c)) {
alpar@209
   349
            is.putback(c);
alpar@209
   350
            getline(is, line);
alpar@209
   351
            _functor(line);
alpar@209
   352
            ++line_num;
alpar@209
   353
          }
alpar@209
   354
        }
alpar@209
   355
        if (is) is.putback(c);
alpar@209
   356
        else if (is.eof()) is.clear();
deba@162
   357
      }
deba@162
   358
    };
deba@162
   359
deba@162
   360
    template <typename Functor>
deba@162
   361
    class StreamSection : public Section {
deba@162
   362
    private:
deba@162
   363
deba@162
   364
      Functor _functor;
deba@162
   365
deba@162
   366
    public:
alpar@209
   367
deba@162
   368
      StreamSection(const Functor& functor) : _functor(functor) {}
alpar@209
   369
      virtual ~StreamSection() {}
deba@162
   370
deba@162
   371
      virtual void process(std::istream& is, int& line_num) {
alpar@209
   372
        _functor(is, line_num);
alpar@209
   373
        char c;
alpar@209
   374
        std::string line;
alpar@209
   375
        while (is.get(c) && c != '@') {
alpar@209
   376
          if (c == '\n') {
alpar@209
   377
            ++line_num;
alpar@209
   378
          } else if (!isWhiteSpace(c)) {
alpar@209
   379
            getline(is, line);
alpar@209
   380
            ++line_num;
alpar@209
   381
          }
alpar@209
   382
        }
alpar@209
   383
        if (is) is.putback(c);
alpar@209
   384
        else if (is.eof()) is.clear();
deba@162
   385
      }
deba@162
   386
    };
alpar@209
   387
deba@127
   388
  }
alpar@156
   389
deba@190
   390
  template <typename Digraph>
deba@190
   391
  class DigraphReader;
deba@190
   392
deba@190
   393
  template <typename Digraph>
kpeter@374
   394
  DigraphReader<Digraph> digraphReader(Digraph& digraph, 
kpeter@374
   395
                                       std::istream& is = std::cin);
deba@190
   396
  template <typename Digraph>
kpeter@374
   397
  DigraphReader<Digraph> digraphReader(Digraph& digraph, const std::string& fn);
deba@190
   398
  template <typename Digraph>
kpeter@374
   399
  DigraphReader<Digraph> digraphReader(Digraph& digraph, const char *fn);
deba@190
   400
alpar@156
   401
  /// \ingroup lemon_io
alpar@209
   402
  ///
kpeter@192
   403
  /// \brief \ref lgf-format "LGF" reader for directed graphs
alpar@156
   404
  ///
alpar@156
   405
  /// This utility reads an \ref lgf-format "LGF" file.
alpar@156
   406
  ///
alpar@156
   407
  /// The reading method does a batch processing. The user creates a
alpar@156
   408
  /// reader object, then various reading rules can be added to the
alpar@156
   409
  /// reader, and eventually the reading is executed with the \c run()
alpar@156
   410
  /// member function. A map reading rule can be added to the reader
alpar@156
   411
  /// with the \c nodeMap() or \c arcMap() members. An optional
deba@162
   412
  /// converter parameter can also be added as a standard functor
kpeter@192
   413
  /// converting from \c std::string to the value type of the map. If it
deba@162
   414
  /// is set, it will determine how the tokens in the file should be
kpeter@192
   415
  /// converted to the value type of the map. If the functor is not set,
deba@162
   416
  /// then a default conversion will be used. One map can be read into
deba@162
   417
  /// multiple map objects at the same time. The \c attribute(), \c
deba@162
   418
  /// node() and \c arc() functions are used to add attribute reading
deba@162
   419
  /// rules.
alpar@156
   420
  ///
alpar@156
   421
  ///\code
kpeter@293
   422
  /// DigraphReader<Digraph>(digraph, std::cin).
kpeter@192
   423
  ///   nodeMap("coordinates", coord_map).
kpeter@192
   424
  ///   arcMap("capacity", cap_map).
kpeter@192
   425
  ///   node("source", src).
kpeter@192
   426
  ///   node("target", trg).
kpeter@192
   427
  ///   attribute("caption", caption).
kpeter@192
   428
  ///   run();
alpar@156
   429
  ///\endcode
alpar@156
   430
  ///
alpar@156
   431
  /// By default the reader uses the first section in the file of the
alpar@156
   432
  /// proper type. If a section has an optional name, then it can be
deba@162
   433
  /// selected for reading by giving an optional name parameter to the
deba@189
   434
  /// \c nodes(), \c arcs() or \c attributes() functions.
alpar@156
   435
  ///
alpar@156
   436
  /// The \c useNodes() and \c useArcs() functions are used to tell the reader
alpar@156
   437
  /// that the nodes or arcs should not be constructed (added to the
alpar@156
   438
  /// graph) during the reading, but instead the label map of the items
alpar@156
   439
  /// are given as a parameter of these functions. An
kpeter@192
   440
  /// application of these functions is multipass reading, which is
kpeter@192
   441
  /// important if two \c \@arcs sections must be read from the
kpeter@192
   442
  /// file. In this case the first phase would read the node set and one
alpar@156
   443
  /// of the arc sets, while the second phase would read the second arc
alpar@156
   444
  /// set into an \e ArcSet class (\c SmartArcSet or \c ListArcSet).
alpar@156
   445
  /// The previously read label node map should be passed to the \c
alpar@156
   446
  /// useNodes() functions. Another application of multipass reading when
alpar@210
   447
  /// paths are given as a node map or an arc map.
alpar@210
   448
  /// It is impossible to read this in
alpar@156
   449
  /// a single pass, because the arcs are not constructed when the node
alpar@156
   450
  /// maps are read.
deba@127
   451
  template <typename _Digraph>
deba@127
   452
  class DigraphReader {
deba@127
   453
  public:
deba@127
   454
deba@127
   455
    typedef _Digraph Digraph;
deba@148
   456
    TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);
alpar@209
   457
deba@127
   458
  private:
deba@127
   459
deba@127
   460
deba@127
   461
    std::istream* _is;
deba@127
   462
    bool local_is;
deba@290
   463
    std::string _filename;
deba@127
   464
deba@127
   465
    Digraph& _digraph;
deba@127
   466
deba@127
   467
    std::string _nodes_caption;
deba@127
   468
    std::string _arcs_caption;
deba@127
   469
    std::string _attributes_caption;
deba@127
   470
deba@127
   471
    typedef std::map<std::string, Node> NodeIndex;
deba@127
   472
    NodeIndex _node_index;
deba@127
   473
    typedef std::map<std::string, Arc> ArcIndex;
deba@127
   474
    ArcIndex _arc_index;
alpar@209
   475
alpar@209
   476
    typedef std::vector<std::pair<std::string,
alpar@209
   477
      _reader_bits::MapStorageBase<Node>*> > NodeMaps;
alpar@209
   478
    NodeMaps _node_maps;
deba@127
   479
deba@127
   480
    typedef std::vector<std::pair<std::string,
deba@127
   481
      _reader_bits::MapStorageBase<Arc>*> >ArcMaps;
deba@127
   482
    ArcMaps _arc_maps;
deba@127
   483
alpar@209
   484
    typedef std::multimap<std::string, _reader_bits::ValueStorageBase*>
deba@127
   485
      Attributes;
deba@127
   486
    Attributes _attributes;
deba@127
   487
deba@127
   488
    bool _use_nodes;
deba@127
   489
    bool _use_arcs;
deba@127
   490
deba@188
   491
    bool _skip_nodes;
deba@188
   492
    bool _skip_arcs;
deba@188
   493
deba@127
   494
    int line_num;
deba@127
   495
    std::istringstream line;
deba@127
   496
deba@127
   497
  public:
deba@127
   498
alpar@156
   499
    /// \brief Constructor
alpar@156
   500
    ///
alpar@156
   501
    /// Construct a directed graph reader, which reads from the given
alpar@156
   502
    /// input stream.
kpeter@293
   503
    DigraphReader(Digraph& digraph, std::istream& is = std::cin)
deba@127
   504
      : _is(&is), local_is(false), _digraph(digraph),
alpar@209
   505
        _use_nodes(false), _use_arcs(false),
alpar@209
   506
        _skip_nodes(false), _skip_arcs(false) {}
deba@127
   507
alpar@156
   508
    /// \brief Constructor
alpar@156
   509
    ///
alpar@156
   510
    /// Construct a directed graph reader, which reads from the given
alpar@156
   511
    /// file.
kpeter@293
   512
    DigraphReader(Digraph& digraph, const std::string& fn)
deba@290
   513
      : _is(new std::ifstream(fn.c_str())), local_is(true),
deba@290
   514
        _filename(fn), _digraph(digraph),
kpeter@212
   515
        _use_nodes(false), _use_arcs(false),
deba@290
   516
        _skip_nodes(false), _skip_arcs(false) {
deba@295
   517
      if (!(*_is)) {
deba@295
   518
        delete _is;
deba@295
   519
        throw IoError("Cannot open file", fn);
deba@295
   520
      }
deba@290
   521
    }
alpar@209
   522
alpar@156
   523
    /// \brief Constructor
alpar@156
   524
    ///
alpar@156
   525
    /// Construct a directed graph reader, which reads from the given
alpar@156
   526
    /// file.
kpeter@293
   527
    DigraphReader(Digraph& digraph, const char* fn)
deba@290
   528
      : _is(new std::ifstream(fn)), local_is(true),
deba@290
   529
        _filename(fn), _digraph(digraph),
kpeter@212
   530
        _use_nodes(false), _use_arcs(false),
deba@290
   531
        _skip_nodes(false), _skip_arcs(false) {
deba@295
   532
      if (!(*_is)) {
deba@295
   533
        delete _is;
deba@295
   534
        throw IoError("Cannot open file", fn);
deba@295
   535
      }
deba@290
   536
    }
deba@127
   537
alpar@156
   538
    /// \brief Destructor
deba@127
   539
    ~DigraphReader() {
alpar@209
   540
      for (typename NodeMaps::iterator it = _node_maps.begin();
alpar@209
   541
           it != _node_maps.end(); ++it) {
alpar@209
   542
        delete it->second;
deba@127
   543
      }
deba@127
   544
alpar@209
   545
      for (typename ArcMaps::iterator it = _arc_maps.begin();
alpar@209
   546
           it != _arc_maps.end(); ++it) {
alpar@209
   547
        delete it->second;
deba@127
   548
      }
deba@127
   549
alpar@209
   550
      for (typename Attributes::iterator it = _attributes.begin();
alpar@209
   551
           it != _attributes.end(); ++it) {
alpar@209
   552
        delete it->second;
deba@127
   553
      }
deba@127
   554
deba@127
   555
      if (local_is) {
alpar@209
   556
        delete _is;
deba@127
   557
      }
deba@127
   558
deba@127
   559
    }
deba@127
   560
deba@127
   561
  private:
deba@190
   562
kpeter@374
   563
    template <typename DGR>
kpeter@374
   564
    friend DigraphReader<DGR> digraphReader(DGR& digraph, std::istream& is);
kpeter@374
   565
    template <typename DGR>
kpeter@374
   566
    friend DigraphReader<DGR> digraphReader(DGR& digraph, 
kpeter@374
   567
                                            const std::string& fn);
kpeter@374
   568
    template <typename DGR>
kpeter@374
   569
    friend DigraphReader<DGR> digraphReader(DGR& digraph, const char *fn);
alpar@209
   570
alpar@209
   571
    DigraphReader(DigraphReader& other)
deba@190
   572
      : _is(other._is), local_is(other.local_is), _digraph(other._digraph),
alpar@209
   573
        _use_nodes(other._use_nodes), _use_arcs(other._use_arcs),
alpar@209
   574
        _skip_nodes(other._skip_nodes), _skip_arcs(other._skip_arcs) {
deba@190
   575
deba@190
   576
      other._is = 0;
deba@190
   577
      other.local_is = false;
alpar@209
   578
deba@190
   579
      _node_index.swap(other._node_index);
deba@190
   580
      _arc_index.swap(other._arc_index);
deba@190
   581
deba@190
   582
      _node_maps.swap(other._node_maps);
deba@190
   583
      _arc_maps.swap(other._arc_maps);
deba@190
   584
      _attributes.swap(other._attributes);
deba@190
   585
deba@190
   586
      _nodes_caption = other._nodes_caption;
deba@190
   587
      _arcs_caption = other._arcs_caption;
deba@190
   588
      _attributes_caption = other._attributes_caption;
deba@190
   589
deba@190
   590
    }
deba@190
   591
deba@127
   592
    DigraphReader& operator=(const DigraphReader&);
deba@127
   593
deba@127
   594
  public:
deba@127
   595
alpar@156
   596
    /// \name Reading rules
alpar@156
   597
    /// @{
alpar@209
   598
alpar@156
   599
    /// \brief Node map reading rule
alpar@156
   600
    ///
alpar@156
   601
    /// Add a node map reading rule to the reader.
deba@127
   602
    template <typename Map>
deba@127
   603
    DigraphReader& nodeMap(const std::string& caption, Map& map) {
deba@127
   604
      checkConcept<concepts::WriteMap<Node, typename Map::Value>, Map>();
alpar@209
   605
      _reader_bits::MapStorageBase<Node>* storage =
alpar@209
   606
        new _reader_bits::MapStorage<Node, Map>(map);
deba@127
   607
      _node_maps.push_back(std::make_pair(caption, storage));
deba@127
   608
      return *this;
deba@127
   609
    }
deba@127
   610
alpar@156
   611
    /// \brief Node map reading rule
alpar@156
   612
    ///
alpar@156
   613
    /// Add a node map reading rule with specialized converter to the
alpar@156
   614
    /// reader.
deba@127
   615
    template <typename Map, typename Converter>
alpar@209
   616
    DigraphReader& nodeMap(const std::string& caption, Map& map,
alpar@209
   617
                           const Converter& converter = Converter()) {
deba@127
   618
      checkConcept<concepts::WriteMap<Node, typename Map::Value>, Map>();
alpar@209
   619
      _reader_bits::MapStorageBase<Node>* storage =
alpar@209
   620
        new _reader_bits::MapStorage<Node, Map, Converter>(map, converter);
deba@127
   621
      _node_maps.push_back(std::make_pair(caption, storage));
deba@127
   622
      return *this;
deba@127
   623
    }
deba@127
   624
alpar@156
   625
    /// \brief Arc map reading rule
alpar@156
   626
    ///
alpar@156
   627
    /// Add an arc map reading rule to the reader.
deba@127
   628
    template <typename Map>
deba@127
   629
    DigraphReader& arcMap(const std::string& caption, Map& map) {
deba@127
   630
      checkConcept<concepts::WriteMap<Arc, typename Map::Value>, Map>();
alpar@209
   631
      _reader_bits::MapStorageBase<Arc>* storage =
alpar@209
   632
        new _reader_bits::MapStorage<Arc, Map>(map);
deba@127
   633
      _arc_maps.push_back(std::make_pair(caption, storage));
deba@127
   634
      return *this;
deba@127
   635
    }
deba@127
   636
alpar@156
   637
    /// \brief Arc map reading rule
alpar@156
   638
    ///
alpar@156
   639
    /// Add an arc map reading rule with specialized converter to the
alpar@156
   640
    /// reader.
deba@127
   641
    template <typename Map, typename Converter>
alpar@209
   642
    DigraphReader& arcMap(const std::string& caption, Map& map,
alpar@209
   643
                          const Converter& converter = Converter()) {
deba@127
   644
      checkConcept<concepts::WriteMap<Arc, typename Map::Value>, Map>();
alpar@209
   645
      _reader_bits::MapStorageBase<Arc>* storage =
alpar@209
   646
        new _reader_bits::MapStorage<Arc, Map, Converter>(map, converter);
deba@127
   647
      _arc_maps.push_back(std::make_pair(caption, storage));
deba@127
   648
      return *this;
deba@127
   649
    }
deba@127
   650
alpar@156
   651
    /// \brief Attribute reading rule
alpar@156
   652
    ///
alpar@156
   653
    /// Add an attribute reading rule to the reader.
deba@127
   654
    template <typename Value>
deba@127
   655
    DigraphReader& attribute(const std::string& caption, Value& value) {
alpar@209
   656
      _reader_bits::ValueStorageBase* storage =
alpar@209
   657
        new _reader_bits::ValueStorage<Value>(value);
deba@127
   658
      _attributes.insert(std::make_pair(caption, storage));
deba@127
   659
      return *this;
deba@127
   660
    }
deba@127
   661
alpar@156
   662
    /// \brief Attribute reading rule
alpar@156
   663
    ///
alpar@156
   664
    /// Add an attribute reading rule with specialized converter to the
alpar@156
   665
    /// reader.
deba@127
   666
    template <typename Value, typename Converter>
alpar@209
   667
    DigraphReader& attribute(const std::string& caption, Value& value,
alpar@209
   668
                             const Converter& converter = Converter()) {
alpar@209
   669
      _reader_bits::ValueStorageBase* storage =
alpar@209
   670
        new _reader_bits::ValueStorage<Value, Converter>(value, converter);
deba@127
   671
      _attributes.insert(std::make_pair(caption, storage));
deba@127
   672
      return *this;
deba@127
   673
    }
deba@127
   674
alpar@156
   675
    /// \brief Node reading rule
alpar@156
   676
    ///
alpar@156
   677
    /// Add a node reading rule to reader.
deba@127
   678
    DigraphReader& node(const std::string& caption, Node& node) {
deba@127
   679
      typedef _reader_bits::MapLookUpConverter<Node> Converter;
deba@127
   680
      Converter converter(_node_index);
alpar@209
   681
      _reader_bits::ValueStorageBase* storage =
alpar@209
   682
        new _reader_bits::ValueStorage<Node, Converter>(node, converter);
deba@127
   683
      _attributes.insert(std::make_pair(caption, storage));
deba@127
   684
      return *this;
deba@127
   685
    }
deba@127
   686
alpar@156
   687
    /// \brief Arc reading rule
alpar@156
   688
    ///
alpar@156
   689
    /// Add an arc reading rule to reader.
deba@127
   690
    DigraphReader& arc(const std::string& caption, Arc& arc) {
deba@127
   691
      typedef _reader_bits::MapLookUpConverter<Arc> Converter;
deba@127
   692
      Converter converter(_arc_index);
alpar@209
   693
      _reader_bits::ValueStorageBase* storage =
alpar@209
   694
        new _reader_bits::ValueStorage<Arc, Converter>(arc, converter);
deba@127
   695
      _attributes.insert(std::make_pair(caption, storage));
deba@127
   696
      return *this;
deba@127
   697
    }
deba@127
   698
alpar@156
   699
    /// @}
alpar@156
   700
alpar@156
   701
    /// \name Select section by name
alpar@156
   702
    /// @{
alpar@156
   703
alpar@156
   704
    /// \brief Set \c \@nodes section to be read
alpar@156
   705
    ///
alpar@156
   706
    /// Set \c \@nodes section to be read
deba@127
   707
    DigraphReader& nodes(const std::string& caption) {
deba@127
   708
      _nodes_caption = caption;
deba@127
   709
      return *this;
deba@127
   710
    }
deba@127
   711
alpar@156
   712
    /// \brief Set \c \@arcs section to be read
alpar@156
   713
    ///
alpar@156
   714
    /// Set \c \@arcs section to be read
deba@127
   715
    DigraphReader& arcs(const std::string& caption) {
deba@127
   716
      _arcs_caption = caption;
deba@127
   717
      return *this;
deba@127
   718
    }
deba@127
   719
alpar@156
   720
    /// \brief Set \c \@attributes section to be read
alpar@156
   721
    ///
alpar@156
   722
    /// Set \c \@attributes section to be read
deba@127
   723
    DigraphReader& attributes(const std::string& caption) {
deba@127
   724
      _attributes_caption = caption;
deba@127
   725
      return *this;
deba@127
   726
    }
deba@127
   727
alpar@156
   728
    /// @}
alpar@156
   729
alpar@156
   730
    /// \name Using previously constructed node or arc set
alpar@156
   731
    /// @{
alpar@156
   732
alpar@156
   733
    /// \brief Use previously constructed node set
alpar@156
   734
    ///
alpar@156
   735
    /// Use previously constructed node set, and specify the node
alpar@156
   736
    /// label map.
deba@127
   737
    template <typename Map>
deba@127
   738
    DigraphReader& useNodes(const Map& map) {
deba@127
   739
      checkConcept<concepts::ReadMap<Node, typename Map::Value>, Map>();
alpar@209
   740
      LEMON_ASSERT(!_use_nodes, "Multiple usage of useNodes() member");
deba@127
   741
      _use_nodes = true;
deba@127
   742
      _writer_bits::DefaultConverter<typename Map::Value> converter;
deba@127
   743
      for (NodeIt n(_digraph); n != INVALID; ++n) {
alpar@209
   744
        _node_index.insert(std::make_pair(converter(map[n]), n));
deba@127
   745
      }
deba@127
   746
      return *this;
deba@127
   747
    }
deba@127
   748
alpar@156
   749
    /// \brief Use previously constructed node set
alpar@156
   750
    ///
alpar@156
   751
    /// Use previously constructed node set, and specify the node
alpar@156
   752
    /// label map and a functor which converts the label map values to
kpeter@192
   753
    /// \c std::string.
deba@127
   754
    template <typename Map, typename Converter>
alpar@209
   755
    DigraphReader& useNodes(const Map& map,
alpar@209
   756
                            const Converter& converter = Converter()) {
deba@127
   757
      checkConcept<concepts::ReadMap<Node, typename Map::Value>, Map>();
alpar@209
   758
      LEMON_ASSERT(!_use_nodes, "Multiple usage of useNodes() member");
deba@127
   759
      _use_nodes = true;
deba@127
   760
      for (NodeIt n(_digraph); n != INVALID; ++n) {
alpar@209
   761
        _node_index.insert(std::make_pair(converter(map[n]), n));
deba@127
   762
      }
deba@127
   763
      return *this;
deba@127
   764
    }
deba@127
   765
alpar@156
   766
    /// \brief Use previously constructed arc set
alpar@156
   767
    ///
alpar@156
   768
    /// Use previously constructed arc set, and specify the arc
alpar@156
   769
    /// label map.
deba@127
   770
    template <typename Map>
deba@127
   771
    DigraphReader& useArcs(const Map& map) {
deba@127
   772
      checkConcept<concepts::ReadMap<Arc, typename Map::Value>, Map>();
deba@127
   773
      LEMON_ASSERT(!_use_arcs, "Multiple usage of useArcs() member");
deba@127
   774
      _use_arcs = true;
deba@127
   775
      _writer_bits::DefaultConverter<typename Map::Value> converter;
deba@127
   776
      for (ArcIt a(_digraph); a != INVALID; ++a) {
alpar@209
   777
        _arc_index.insert(std::make_pair(converter(map[a]), a));
deba@127
   778
      }
deba@127
   779
      return *this;
deba@127
   780
    }
deba@127
   781
alpar@156
   782
    /// \brief Use previously constructed arc set
alpar@156
   783
    ///
alpar@156
   784
    /// Use previously constructed arc set, and specify the arc
alpar@156
   785
    /// label map and a functor which converts the label map values to
kpeter@192
   786
    /// \c std::string.
deba@127
   787
    template <typename Map, typename Converter>
alpar@209
   788
    DigraphReader& useArcs(const Map& map,
alpar@209
   789
                           const Converter& converter = Converter()) {
deba@127
   790
      checkConcept<concepts::ReadMap<Arc, typename Map::Value>, Map>();
alpar@209
   791
      LEMON_ASSERT(!_use_arcs, "Multiple usage of useArcs() member");
deba@127
   792
      _use_arcs = true;
deba@127
   793
      for (ArcIt a(_digraph); a != INVALID; ++a) {
alpar@209
   794
        _arc_index.insert(std::make_pair(converter(map[a]), a));
deba@127
   795
      }
deba@127
   796
      return *this;
deba@127
   797
    }
deba@127
   798
deba@188
   799
    /// \brief Skips the reading of node section
deba@188
   800
    ///
deba@188
   801
    /// Omit the reading of the node section. This implies that each node
kpeter@192
   802
    /// map reading rule will be abandoned, and the nodes of the graph
deba@188
   803
    /// will not be constructed, which usually cause that the arc set
kpeter@192
   804
    /// could not be read due to lack of node name resolving.
kpeter@192
   805
    /// Therefore \c skipArcs() function should also be used, or
kpeter@192
   806
    /// \c useNodes() should be used to specify the label of the nodes.
deba@188
   807
    DigraphReader& skipNodes() {
alpar@209
   808
      LEMON_ASSERT(!_skip_nodes, "Skip nodes already set");
deba@188
   809
      _skip_nodes = true;
deba@188
   810
      return *this;
deba@188
   811
    }
deba@188
   812
deba@188
   813
    /// \brief Skips the reading of arc section
deba@188
   814
    ///
deba@188
   815
    /// Omit the reading of the arc section. This implies that each arc
kpeter@192
   816
    /// map reading rule will be abandoned, and the arcs of the graph
deba@188
   817
    /// will not be constructed.
deba@188
   818
    DigraphReader& skipArcs() {
alpar@209
   819
      LEMON_ASSERT(!_skip_arcs, "Skip arcs already set");
deba@188
   820
      _skip_arcs = true;
deba@188
   821
      return *this;
deba@188
   822
    }
deba@188
   823
alpar@156
   824
    /// @}
alpar@156
   825
deba@127
   826
  private:
deba@127
   827
deba@127
   828
    bool readLine() {
deba@127
   829
      std::string str;
deba@127
   830
      while(++line_num, std::getline(*_is, str)) {
alpar@209
   831
        line.clear(); line.str(str);
alpar@209
   832
        char c;
alpar@209
   833
        if (line >> std::ws >> c && c != '#') {
alpar@209
   834
          line.putback(c);
alpar@209
   835
          return true;
alpar@209
   836
        }
deba@127
   837
      }
deba@127
   838
      return false;
deba@127
   839
    }
deba@127
   840
deba@127
   841
    bool readSuccess() {
deba@127
   842
      return static_cast<bool>(*_is);
deba@127
   843
    }
alpar@209
   844
deba@127
   845
    void skipSection() {
deba@127
   846
      char c;
deba@127
   847
      while (readSuccess() && line >> c && c != '@') {
alpar@209
   848
        readLine();
deba@127
   849
      }
deba@127
   850
      line.putback(c);
deba@127
   851
    }
deba@127
   852
deba@127
   853
    void readNodes() {
deba@127
   854
deba@127
   855
      std::vector<int> map_index(_node_maps.size());
deba@127
   856
      int map_num, label_index;
deba@127
   857
deba@186
   858
      char c;
deba@186
   859
      if (!readLine() || !(line >> c) || c == '@') {
alpar@209
   860
        if (readSuccess() && line) line.putback(c);
alpar@209
   861
        if (!_node_maps.empty())
deba@290
   862
          throw FormatError("Cannot find map names");
alpar@209
   863
        return;
deba@186
   864
      }
deba@186
   865
      line.putback(c);
deba@186
   866
deba@127
   867
      {
alpar@209
   868
        std::map<std::string, int> maps;
alpar@209
   869
alpar@209
   870
        std::string map;
alpar@209
   871
        int index = 0;
alpar@209
   872
        while (_reader_bits::readToken(line, map)) {
alpar@209
   873
          if (maps.find(map) != maps.end()) {
alpar@209
   874
            std::ostringstream msg;
alpar@209
   875
            msg << "Multiple occurence of node map: " << map;
deba@290
   876
            throw FormatError(msg.str());
alpar@209
   877
          }
alpar@209
   878
          maps.insert(std::make_pair(map, index));
alpar@209
   879
          ++index;
alpar@209
   880
        }
alpar@209
   881
alpar@209
   882
        for (int i = 0; i < static_cast<int>(_node_maps.size()); ++i) {
alpar@209
   883
          std::map<std::string, int>::iterator jt =
alpar@209
   884
            maps.find(_node_maps[i].first);
alpar@209
   885
          if (jt == maps.end()) {
alpar@209
   886
            std::ostringstream msg;
kpeter@291
   887
            msg << "Map not found: " << _node_maps[i].first;
deba@290
   888
            throw FormatError(msg.str());
alpar@209
   889
          }
alpar@209
   890
          map_index[i] = jt->second;
alpar@209
   891
        }
alpar@209
   892
alpar@209
   893
        {
alpar@209
   894
          std::map<std::string, int>::iterator jt = maps.find("label");
alpar@209
   895
          if (jt != maps.end()) {
alpar@209
   896
            label_index = jt->second;
alpar@209
   897
          } else {
alpar@209
   898
            label_index = -1;
alpar@209
   899
          }
alpar@209
   900
        }
alpar@209
   901
        map_num = maps.size();
deba@127
   902
      }
deba@127
   903
deba@127
   904
      while (readLine() && line >> c && c != '@') {
alpar@209
   905
        line.putback(c);
alpar@209
   906
alpar@209
   907
        std::vector<std::string> tokens(map_num);
alpar@209
   908
        for (int i = 0; i < map_num; ++i) {
alpar@209
   909
          if (!_reader_bits::readToken(line, tokens[i])) {
alpar@209
   910
            std::ostringstream msg;
alpar@209
   911
            msg << "Column not found (" << i + 1 << ")";
deba@290
   912
            throw FormatError(msg.str());
alpar@209
   913
          }
alpar@209
   914
        }
alpar@209
   915
        if (line >> std::ws >> c)
kpeter@291
   916
          throw FormatError("Extra character at the end of line");
alpar@209
   917
alpar@209
   918
        Node n;
alpar@209
   919
        if (!_use_nodes) {
alpar@209
   920
          n = _digraph.addNode();
alpar@209
   921
          if (label_index != -1)
alpar@209
   922
            _node_index.insert(std::make_pair(tokens[label_index], n));
alpar@209
   923
        } else {
alpar@209
   924
          if (label_index == -1)
kpeter@291
   925
            throw FormatError("Label map not found");
alpar@209
   926
          typename std::map<std::string, Node>::iterator it =
alpar@209
   927
            _node_index.find(tokens[label_index]);
alpar@209
   928
          if (it == _node_index.end()) {
alpar@209
   929
            std::ostringstream msg;
alpar@209
   930
            msg << "Node with label not found: " << tokens[label_index];
deba@290
   931
            throw FormatError(msg.str());
alpar@209
   932
          }
alpar@209
   933
          n = it->second;
alpar@209
   934
        }
alpar@209
   935
alpar@209
   936
        for (int i = 0; i < static_cast<int>(_node_maps.size()); ++i) {
alpar@209
   937
          _node_maps[i].second->set(n, tokens[map_index[i]]);
alpar@209
   938
        }
deba@127
   939
deba@127
   940
      }
deba@127
   941
      if (readSuccess()) {
alpar@209
   942
        line.putback(c);
deba@127
   943
      }
deba@127
   944
    }
deba@127
   945
deba@127
   946
    void readArcs() {
deba@127
   947
deba@127
   948
      std::vector<int> map_index(_arc_maps.size());
deba@127
   949
      int map_num, label_index;
deba@127
   950
deba@186
   951
      char c;
deba@186
   952
      if (!readLine() || !(line >> c) || c == '@') {
alpar@209
   953
        if (readSuccess() && line) line.putback(c);
alpar@209
   954
        if (!_arc_maps.empty())
deba@290
   955
          throw FormatError("Cannot find map names");
alpar@209
   956
        return;
deba@186
   957
      }
deba@186
   958
      line.putback(c);
alpar@209
   959
deba@127
   960
      {
alpar@209
   961
        std::map<std::string, int> maps;
alpar@209
   962
alpar@209
   963
        std::string map;
alpar@209
   964
        int index = 0;
alpar@209
   965
        while (_reader_bits::readToken(line, map)) {
alpar@209
   966
          if (maps.find(map) != maps.end()) {
alpar@209
   967
            std::ostringstream msg;
alpar@209
   968
            msg << "Multiple occurence of arc map: " << map;
deba@290
   969
            throw FormatError(msg.str());
alpar@209
   970
          }
alpar@209
   971
          maps.insert(std::make_pair(map, index));
alpar@209
   972
          ++index;
alpar@209
   973
        }
alpar@209
   974
alpar@209
   975
        for (int i = 0; i < static_cast<int>(_arc_maps.size()); ++i) {
alpar@209
   976
          std::map<std::string, int>::iterator jt =
alpar@209
   977
            maps.find(_arc_maps[i].first);
alpar@209
   978
          if (jt == maps.end()) {
alpar@209
   979
            std::ostringstream msg;
kpeter@291
   980
            msg << "Map not found: " << _arc_maps[i].first;
deba@290
   981
            throw FormatError(msg.str());
alpar@209
   982
          }
alpar@209
   983
          map_index[i] = jt->second;
alpar@209
   984
        }
alpar@209
   985
alpar@209
   986
        {
alpar@209
   987
          std::map<std::string, int>::iterator jt = maps.find("label");
alpar@209
   988
          if (jt != maps.end()) {
alpar@209
   989
            label_index = jt->second;
alpar@209
   990
          } else {
alpar@209
   991
            label_index = -1;
alpar@209
   992
          }
alpar@209
   993
        }
alpar@209
   994
        map_num = maps.size();
deba@127
   995
      }
deba@127
   996
deba@127
   997
      while (readLine() && line >> c && c != '@') {
alpar@209
   998
        line.putback(c);
alpar@209
   999
alpar@209
  1000
        std::string source_token;
alpar@209
  1001
        std::string target_token;
alpar@209
  1002
alpar@209
  1003
        if (!_reader_bits::readToken(line, source_token))
deba@290
  1004
          throw FormatError("Source not found");
alpar@209
  1005
alpar@209
  1006
        if (!_reader_bits::readToken(line, target_token))
deba@290
  1007
          throw FormatError("Target not found");
alpar@209
  1008
alpar@209
  1009
        std::vector<std::string> tokens(map_num);
alpar@209
  1010
        for (int i = 0; i < map_num; ++i) {
alpar@209
  1011
          if (!_reader_bits::readToken(line, tokens[i])) {
alpar@209
  1012
            std::ostringstream msg;
alpar@209
  1013
            msg << "Column not found (" << i + 1 << ")";
deba@290
  1014
            throw FormatError(msg.str());
alpar@209
  1015
          }
alpar@209
  1016
        }
alpar@209
  1017
        if (line >> std::ws >> c)
kpeter@291
  1018
          throw FormatError("Extra character at the end of line");
alpar@209
  1019
alpar@209
  1020
        Arc a;
alpar@209
  1021
        if (!_use_arcs) {
deba@127
  1022
deba@127
  1023
          typename NodeIndex::iterator it;
alpar@209
  1024
deba@127
  1025
          it = _node_index.find(source_token);
deba@127
  1026
          if (it == _node_index.end()) {
deba@127
  1027
            std::ostringstream msg;
deba@127
  1028
            msg << "Item not found: " << source_token;
deba@290
  1029
            throw FormatError(msg.str());
deba@127
  1030
          }
deba@127
  1031
          Node source = it->second;
deba@127
  1032
deba@127
  1033
          it = _node_index.find(target_token);
alpar@209
  1034
          if (it == _node_index.end()) {
alpar@209
  1035
            std::ostringstream msg;
deba@127
  1036
            msg << "Item not found: " << target_token;
deba@290
  1037
            throw FormatError(msg.str());
alpar@209
  1038
          }
alpar@209
  1039
          Node target = it->second;
alpar@209
  1040
alpar@209
  1041
          a = _digraph.addArc(source, target);
alpar@209
  1042
          if (label_index != -1)
alpar@209
  1043
            _arc_index.insert(std::make_pair(tokens[label_index], a));
alpar@209
  1044
        } else {
alpar@209
  1045
          if (label_index == -1)
kpeter@291
  1046
            throw FormatError("Label map not found");
alpar@209
  1047
          typename std::map<std::string, Arc>::iterator it =
alpar@209
  1048
            _arc_index.find(tokens[label_index]);
alpar@209
  1049
          if (it == _arc_index.end()) {
alpar@209
  1050
            std::ostringstream msg;
alpar@209
  1051
            msg << "Arc with label not found: " << tokens[label_index];
deba@290
  1052
            throw FormatError(msg.str());
alpar@209
  1053
          }
alpar@209
  1054
          a = it->second;
alpar@209
  1055
        }
alpar@209
  1056
alpar@209
  1057
        for (int i = 0; i < static_cast<int>(_arc_maps.size()); ++i) {
alpar@209
  1058
          _arc_maps[i].second->set(a, tokens[map_index[i]]);
alpar@209
  1059
        }
deba@127
  1060
deba@127
  1061
      }
deba@127
  1062
      if (readSuccess()) {
alpar@209
  1063
        line.putback(c);
deba@127
  1064
      }
deba@127
  1065
    }
deba@127
  1066
deba@127
  1067
    void readAttributes() {
deba@127
  1068
deba@127
  1069
      std::set<std::string> read_attr;
deba@127
  1070
deba@127
  1071
      char c;
deba@127
  1072
      while (readLine() && line >> c && c != '@') {
alpar@209
  1073
        line.putback(c);
alpar@209
  1074
alpar@209
  1075
        std::string attr, token;
alpar@209
  1076
        if (!_reader_bits::readToken(line, attr))
deba@290
  1077
          throw FormatError("Attribute name not found");
alpar@209
  1078
        if (!_reader_bits::readToken(line, token))
deba@290
  1079
          throw FormatError("Attribute value not found");
alpar@209
  1080
        if (line >> c)
kpeter@291
  1081
          throw FormatError("Extra character at the end of line");
alpar@209
  1082
alpar@209
  1083
        {
alpar@209
  1084
          std::set<std::string>::iterator it = read_attr.find(attr);
alpar@209
  1085
          if (it != read_attr.end()) {
alpar@209
  1086
            std::ostringstream msg;
kpeter@291
  1087
            msg << "Multiple occurence of attribute: " << attr;
deba@290
  1088
            throw FormatError(msg.str());
alpar@209
  1089
          }
alpar@209
  1090
          read_attr.insert(attr);
alpar@209
  1091
        }
alpar@209
  1092
alpar@209
  1093
        {
alpar@209
  1094
          typename Attributes::iterator it = _attributes.lower_bound(attr);
alpar@209
  1095
          while (it != _attributes.end() && it->first == attr) {
alpar@209
  1096
            it->second->set(token);
alpar@209
  1097
            ++it;
alpar@209
  1098
          }
alpar@209
  1099
        }
deba@127
  1100
deba@127
  1101
      }
deba@127
  1102
      if (readSuccess()) {
alpar@209
  1103
        line.putback(c);
deba@127
  1104
      }
deba@127
  1105
      for (typename Attributes::iterator it = _attributes.begin();
alpar@209
  1106
           it != _attributes.end(); ++it) {
alpar@209
  1107
        if (read_attr.find(it->first) == read_attr.end()) {
alpar@209
  1108
          std::ostringstream msg;
kpeter@291
  1109
          msg << "Attribute not found: " << it->first;
deba@290
  1110
          throw FormatError(msg.str());
alpar@209
  1111
        }
deba@127
  1112
      }
deba@127
  1113
    }
deba@127
  1114
deba@127
  1115
  public:
alpar@156
  1116
alpar@209
  1117
    /// \name Execution of the reader
alpar@156
  1118
    /// @{
alpar@156
  1119
alpar@156
  1120
    /// \brief Start the batch processing
alpar@156
  1121
    ///
alpar@156
  1122
    /// This function starts the batch processing
deba@127
  1123
    void run() {
deba@127
  1124
      LEMON_ASSERT(_is != 0, "This reader assigned to an other reader");
alpar@209
  1125
deba@188
  1126
      bool nodes_done = _skip_nodes;
deba@188
  1127
      bool arcs_done = _skip_arcs;
deba@127
  1128
      bool attributes_done = false;
deba@127
  1129
alpar@209
  1130
      line_num = 0;
deba@127
  1131
      readLine();
deba@172
  1132
      skipSection();
deba@127
  1133
deba@127
  1134
      while (readSuccess()) {
alpar@209
  1135
        try {
alpar@209
  1136
          char c;
alpar@209
  1137
          std::string section, caption;
alpar@209
  1138
          line >> c;
alpar@209
  1139
          _reader_bits::readToken(line, section);
alpar@209
  1140
          _reader_bits::readToken(line, caption);
alpar@209
  1141
alpar@209
  1142
          if (line >> c)
kpeter@291
  1143
            throw FormatError("Extra character at the end of line");
alpar@209
  1144
alpar@209
  1145
          if (section == "nodes" && !nodes_done) {
alpar@209
  1146
            if (_nodes_caption.empty() || _nodes_caption == caption) {
alpar@209
  1147
              readNodes();
alpar@209
  1148
              nodes_done = true;
alpar@209
  1149
            }
alpar@209
  1150
          } else if ((section == "arcs" || section == "edges") &&
alpar@209
  1151
                     !arcs_done) {
alpar@209
  1152
            if (_arcs_caption.empty() || _arcs_caption == caption) {
alpar@209
  1153
              readArcs();
alpar@209
  1154
              arcs_done = true;
alpar@209
  1155
            }
alpar@209
  1156
          } else if (section == "attributes" && !attributes_done) {
alpar@209
  1157
            if (_attributes_caption.empty() || _attributes_caption == caption) {
alpar@209
  1158
              readAttributes();
alpar@209
  1159
              attributes_done = true;
alpar@209
  1160
            }
alpar@209
  1161
          } else {
alpar@209
  1162
            readLine();
alpar@209
  1163
            skipSection();
alpar@209
  1164
          }
deba@290
  1165
        } catch (FormatError& error) {
alpar@209
  1166
          error.line(line_num);
deba@290
  1167
          error.file(_filename);
alpar@209
  1168
          throw;
alpar@209
  1169
        }
deba@127
  1170
      }
deba@127
  1171
deba@127
  1172
      if (!nodes_done) {
deba@290
  1173
        throw FormatError("Section @nodes not found");
deba@127
  1174
      }
deba@127
  1175
deba@127
  1176
      if (!arcs_done) {
deba@290
  1177
        throw FormatError("Section @arcs not found");
deba@127
  1178
      }
deba@127
  1179
deba@127
  1180
      if (!attributes_done && !_attributes.empty()) {
deba@290
  1181
        throw FormatError("Section @attributes not found");
deba@127
  1182
      }
deba@127
  1183
deba@127
  1184
    }
alpar@156
  1185
alpar@156
  1186
    /// @}
alpar@209
  1187
deba@127
  1188
  };
deba@127
  1189
kpeter@374
  1190
  /// \brief Return a \ref DigraphReader class
kpeter@374
  1191
  ///
kpeter@374
  1192
  /// This function just returns a \ref DigraphReader class.
kpeter@374
  1193
  /// \relates DigraphReader
kpeter@374
  1194
  template <typename Digraph>
kpeter@374
  1195
  DigraphReader<Digraph> digraphReader(Digraph& digraph, std::istream& is) {
kpeter@374
  1196
    DigraphReader<Digraph> tmp(digraph, is);
kpeter@374
  1197
    return tmp;
kpeter@374
  1198
  }
kpeter@374
  1199
kpeter@374
  1200
  /// \brief Return a \ref DigraphReader class
kpeter@374
  1201
  ///
kpeter@374
  1202
  /// This function just returns a \ref DigraphReader class.
kpeter@374
  1203
  /// \relates DigraphReader
kpeter@374
  1204
  template <typename Digraph>
kpeter@374
  1205
  DigraphReader<Digraph> digraphReader(Digraph& digraph,
kpeter@374
  1206
                                       const std::string& fn) {
kpeter@374
  1207
    DigraphReader<Digraph> tmp(digraph, fn);
kpeter@374
  1208
    return tmp;
kpeter@374
  1209
  }
kpeter@374
  1210
kpeter@374
  1211
  /// \brief Return a \ref DigraphReader class
kpeter@374
  1212
  ///
kpeter@374
  1213
  /// This function just returns a \ref DigraphReader class.
kpeter@374
  1214
  /// \relates DigraphReader
kpeter@374
  1215
  template <typename Digraph>
kpeter@374
  1216
  DigraphReader<Digraph> digraphReader(Digraph& digraph, const char* fn) {
kpeter@374
  1217
    DigraphReader<Digraph> tmp(digraph, fn);
kpeter@374
  1218
    return tmp;
kpeter@374
  1219
  }
kpeter@374
  1220
ladanyi@307
  1221
  template <typename Graph>
ladanyi@307
  1222
  class GraphReader;
kpeter@374
  1223
 
ladanyi@307
  1224
  template <typename Graph>
kpeter@374
  1225
  GraphReader<Graph> graphReader(Graph& graph, 
kpeter@374
  1226
                                 std::istream& is = std::cin);
ladanyi@307
  1227
  template <typename Graph>
kpeter@374
  1228
  GraphReader<Graph> graphReader(Graph& graph, const std::string& fn);
ladanyi@307
  1229
  template <typename Graph>
kpeter@374
  1230
  GraphReader<Graph> graphReader(Graph& graph, const char *fn);
deba@165
  1231
deba@165
  1232
  /// \ingroup lemon_io
alpar@209
  1233
  ///
kpeter@192
  1234
  /// \brief \ref lgf-format "LGF" reader for undirected graphs
deba@165
  1235
  ///
deba@165
  1236
  /// This utility reads an \ref lgf-format "LGF" file.
kpeter@192
  1237
  ///
kpeter@192
  1238
  /// It can be used almost the same way as \c DigraphReader.
kpeter@192
  1239
  /// The only difference is that this class can handle edges and
kpeter@192
  1240
  /// edge maps as well as arcs and arc maps.
deba@201
  1241
  ///
deba@201
  1242
  /// The columns in the \c \@edges (or \c \@arcs) section are the
deba@201
  1243
  /// edge maps. However, if there are two maps with the same name
deba@201
  1244
  /// prefixed with \c '+' and \c '-', then these can be read into an
deba@201
  1245
  /// arc map.  Similarly, an attribute can be read into an arc, if
deba@201
  1246
  /// it's value is an edge label prefixed with \c '+' or \c '-'.
deba@165
  1247
  template <typename _Graph>
deba@165
  1248
  class GraphReader {
deba@165
  1249
  public:
deba@165
  1250
deba@165
  1251
    typedef _Graph Graph;
deba@165
  1252
    TEMPLATE_GRAPH_TYPEDEFS(Graph);
alpar@209
  1253
deba@165
  1254
  private:
deba@165
  1255
deba@165
  1256
    std::istream* _is;
deba@165
  1257
    bool local_is;
deba@290
  1258
    std::string _filename;
deba@165
  1259
deba@165
  1260
    Graph& _graph;
deba@165
  1261
deba@165
  1262
    std::string _nodes_caption;
deba@165
  1263
    std::string _edges_caption;
deba@165
  1264
    std::string _attributes_caption;
deba@165
  1265
deba@165
  1266
    typedef std::map<std::string, Node> NodeIndex;
deba@165
  1267
    NodeIndex _node_index;
deba@165
  1268
    typedef std::map<std::string, Edge> EdgeIndex;
deba@165
  1269
    EdgeIndex _edge_index;
alpar@209
  1270
alpar@209
  1271
    typedef std::vector<std::pair<std::string,
alpar@209
  1272
      _reader_bits::MapStorageBase<Node>*> > NodeMaps;
alpar@209
  1273
    NodeMaps _node_maps;
deba@165
  1274
deba@165
  1275
    typedef std::vector<std::pair<std::string,
deba@165
  1276
      _reader_bits::MapStorageBase<Edge>*> > EdgeMaps;
deba@165
  1277
    EdgeMaps _edge_maps;
deba@165
  1278
alpar@209
  1279
    typedef std::multimap<std::string, _reader_bits::ValueStorageBase*>
deba@165
  1280
      Attributes;
deba@165
  1281
    Attributes _attributes;
deba@165
  1282
deba@165
  1283
    bool _use_nodes;
deba@165
  1284
    bool _use_edges;
deba@165
  1285
deba@188
  1286
    bool _skip_nodes;
deba@188
  1287
    bool _skip_edges;
deba@188
  1288
deba@165
  1289
    int line_num;
deba@165
  1290
    std::istringstream line;
deba@165
  1291
deba@165
  1292
  public:
deba@165
  1293
deba@165
  1294
    /// \brief Constructor
deba@165
  1295
    ///
kpeter@192
  1296
    /// Construct an undirected graph reader, which reads from the given
deba@165
  1297
    /// input stream.
kpeter@293
  1298
    GraphReader(Graph& graph, std::istream& is = std::cin)
deba@165
  1299
      : _is(&is), local_is(false), _graph(graph),
alpar@209
  1300
        _use_nodes(false), _use_edges(false),
alpar@209
  1301
        _skip_nodes(false), _skip_edges(false) {}
deba@165
  1302
deba@165
  1303
    /// \brief Constructor
deba@165
  1304
    ///
kpeter@192
  1305
    /// Construct an undirected graph reader, which reads from the given
deba@165
  1306
    /// file.
kpeter@293
  1307
    GraphReader(Graph& graph, const std::string& fn)
deba@290
  1308
      : _is(new std::ifstream(fn.c_str())), local_is(true),
deba@290
  1309
        _filename(fn), _graph(graph),
kpeter@212
  1310
        _use_nodes(false), _use_edges(false),
deba@290
  1311
        _skip_nodes(false), _skip_edges(false) {
deba@295
  1312
      if (!(*_is)) {
deba@295
  1313
        delete _is;
deba@295
  1314
        throw IoError("Cannot open file", fn);
deba@295
  1315
      }
deba@290
  1316
    }
alpar@209
  1317
deba@165
  1318
    /// \brief Constructor
deba@165
  1319
    ///
kpeter@192
  1320
    /// Construct an undirected graph reader, which reads from the given
deba@165
  1321
    /// file.
kpeter@293
  1322
    GraphReader(Graph& graph, const char* fn)
deba@290
  1323
      : _is(new std::ifstream(fn)), local_is(true),
deba@290
  1324
        _filename(fn), _graph(graph),
kpeter@212
  1325
        _use_nodes(false), _use_edges(false),
deba@290
  1326
        _skip_nodes(false), _skip_edges(false) {
deba@295
  1327
      if (!(*_is)) {
deba@295
  1328
        delete _is;
deba@295
  1329
        throw IoError("Cannot open file", fn);
deba@295
  1330
      }
deba@290
  1331
    }
deba@165
  1332
deba@165
  1333
    /// \brief Destructor
deba@165
  1334
    ~GraphReader() {
alpar@209
  1335
      for (typename NodeMaps::iterator it = _node_maps.begin();
alpar@209
  1336
           it != _node_maps.end(); ++it) {
alpar@209
  1337
        delete it->second;
deba@165
  1338
      }
deba@165
  1339
alpar@209
  1340
      for (typename EdgeMaps::iterator it = _edge_maps.begin();
alpar@209
  1341
           it != _edge_maps.end(); ++it) {
alpar@209
  1342
        delete it->second;
deba@165
  1343
      }
deba@165
  1344
alpar@209
  1345
      for (typename Attributes::iterator it = _attributes.begin();
alpar@209
  1346
           it != _attributes.end(); ++it) {
alpar@209
  1347
        delete it->second;
deba@165
  1348
      }
deba@165
  1349
deba@165
  1350
      if (local_is) {
alpar@209
  1351
        delete _is;
deba@165
  1352
      }
deba@165
  1353
deba@165
  1354
    }
deba@165
  1355
deba@165
  1356
  private:
kpeter@374
  1357
    template <typename GR>
kpeter@374
  1358
    friend GraphReader<GR> graphReader(GR& graph, std::istream& is);
kpeter@374
  1359
    template <typename GR>
kpeter@374
  1360
    friend GraphReader<GR> graphReader(GR& graph, const std::string& fn); 
kpeter@374
  1361
    template <typename GR>
kpeter@374
  1362
    friend GraphReader<GR> graphReader(GR& graph, const char *fn);
alpar@209
  1363
alpar@209
  1364
    GraphReader(GraphReader& other)
deba@190
  1365
      : _is(other._is), local_is(other.local_is), _graph(other._graph),
alpar@209
  1366
        _use_nodes(other._use_nodes), _use_edges(other._use_edges),
alpar@209
  1367
        _skip_nodes(other._skip_nodes), _skip_edges(other._skip_edges) {
deba@190
  1368
deba@190
  1369
      other._is = 0;
deba@190
  1370
      other.local_is = false;
alpar@209
  1371
deba@190
  1372
      _node_index.swap(other._node_index);
deba@190
  1373
      _edge_index.swap(other._edge_index);
deba@190
  1374
deba@190
  1375
      _node_maps.swap(other._node_maps);
deba@190
  1376
      _edge_maps.swap(other._edge_maps);
deba@190
  1377
      _attributes.swap(other._attributes);
deba@190
  1378
deba@190
  1379
      _nodes_caption = other._nodes_caption;
deba@190
  1380
      _edges_caption = other._edges_caption;
deba@190
  1381
      _attributes_caption = other._attributes_caption;
deba@190
  1382
deba@190
  1383
    }
deba@190
  1384
deba@165
  1385
    GraphReader& operator=(const GraphReader&);
deba@165
  1386
deba@165
  1387
  public:
deba@165
  1388
deba@165
  1389
    /// \name Reading rules
deba@165
  1390
    /// @{
alpar@209
  1391
deba@165
  1392
    /// \brief Node map reading rule
deba@165
  1393
    ///
deba@165
  1394
    /// Add a node map reading rule to the reader.
deba@165
  1395
    template <typename Map>
deba@165
  1396
    GraphReader& nodeMap(const std::string& caption, Map& map) {
deba@165
  1397
      checkConcept<concepts::WriteMap<Node, typename Map::Value>, Map>();
alpar@209
  1398
      _reader_bits::MapStorageBase<Node>* storage =
alpar@209
  1399
        new _reader_bits::MapStorage<Node, Map>(map);
deba@165
  1400
      _node_maps.push_back(std::make_pair(caption, storage));
deba@165
  1401
      return *this;
deba@165
  1402
    }
deba@165
  1403
deba@165
  1404
    /// \brief Node map reading rule
deba@165
  1405
    ///
deba@165
  1406
    /// Add a node map reading rule with specialized converter to the
deba@165
  1407
    /// reader.
deba@165
  1408
    template <typename Map, typename Converter>
alpar@209
  1409
    GraphReader& nodeMap(const std::string& caption, Map& map,
alpar@209
  1410
                           const Converter& converter = Converter()) {
deba@165
  1411
      checkConcept<concepts::WriteMap<Node, typename Map::Value>, Map>();
alpar@209
  1412
      _reader_bits::MapStorageBase<Node>* storage =
alpar@209
  1413
        new _reader_bits::MapStorage<Node, Map, Converter>(map, converter);
deba@165
  1414
      _node_maps.push_back(std::make_pair(caption, storage));
deba@165
  1415
      return *this;
deba@165
  1416
    }
deba@165
  1417
deba@165
  1418
    /// \brief Edge map reading rule
deba@165
  1419
    ///
deba@165
  1420
    /// Add an edge map reading rule to the reader.
deba@165
  1421
    template <typename Map>
deba@165
  1422
    GraphReader& edgeMap(const std::string& caption, Map& map) {
deba@165
  1423
      checkConcept<concepts::WriteMap<Edge, typename Map::Value>, Map>();
alpar@209
  1424
      _reader_bits::MapStorageBase<Edge>* storage =
alpar@209
  1425
        new _reader_bits::MapStorage<Edge, Map>(map);
deba@165
  1426
      _edge_maps.push_back(std::make_pair(caption, storage));
deba@165
  1427
      return *this;
deba@165
  1428
    }
deba@165
  1429
deba@165
  1430
    /// \brief Edge map reading rule
deba@165
  1431
    ///
deba@165
  1432
    /// Add an edge map reading rule with specialized converter to the
deba@165
  1433
    /// reader.
deba@165
  1434
    template <typename Map, typename Converter>
alpar@209
  1435
    GraphReader& edgeMap(const std::string& caption, Map& map,
alpar@209
  1436
                          const Converter& converter = Converter()) {
deba@165
  1437
      checkConcept<concepts::WriteMap<Edge, typename Map::Value>, Map>();
alpar@209
  1438
      _reader_bits::MapStorageBase<Edge>* storage =
alpar@209
  1439
        new _reader_bits::MapStorage<Edge, Map, Converter>(map, converter);
deba@165
  1440
      _edge_maps.push_back(std::make_pair(caption, storage));
deba@165
  1441
      return *this;
deba@165
  1442
    }
deba@165
  1443
deba@165
  1444
    /// \brief Arc map reading rule
deba@165
  1445
    ///
deba@165
  1446
    /// Add an arc map reading rule to the reader.
deba@165
  1447
    template <typename Map>
deba@165
  1448
    GraphReader& arcMap(const std::string& caption, Map& map) {
deba@165
  1449
      checkConcept<concepts::WriteMap<Arc, typename Map::Value>, Map>();
alpar@209
  1450
      _reader_bits::MapStorageBase<Edge>* forward_storage =
alpar@209
  1451
        new _reader_bits::GraphArcMapStorage<Graph, true, Map>(_graph, map);
deba@165
  1452
      _edge_maps.push_back(std::make_pair('+' + caption, forward_storage));
alpar@209
  1453
      _reader_bits::MapStorageBase<Edge>* backward_storage =
alpar@209
  1454
        new _reader_bits::GraphArcMapStorage<Graph, false, Map>(_graph, map);
deba@165
  1455
      _edge_maps.push_back(std::make_pair('-' + caption, backward_storage));
deba@165
  1456
      return *this;
deba@165
  1457
    }
deba@165
  1458
deba@165
  1459
    /// \brief Arc map reading rule
deba@165
  1460
    ///
deba@165
  1461
    /// Add an arc map reading rule with specialized converter to the
deba@165
  1462
    /// reader.
deba@165
  1463
    template <typename Map, typename Converter>
alpar@209
  1464
    GraphReader& arcMap(const std::string& caption, Map& map,
alpar@209
  1465
                          const Converter& converter = Converter()) {
deba@165
  1466
      checkConcept<concepts::WriteMap<Arc, typename Map::Value>, Map>();
alpar@209
  1467
      _reader_bits::MapStorageBase<Edge>* forward_storage =
alpar@209
  1468
        new _reader_bits::GraphArcMapStorage<Graph, true, Map, Converter>
alpar@209
  1469
        (_graph, map, converter);
deba@165
  1470
      _edge_maps.push_back(std::make_pair('+' + caption, forward_storage));
alpar@209
  1471
      _reader_bits::MapStorageBase<Edge>* backward_storage =
alpar@209
  1472
        new _reader_bits::GraphArcMapStorage<Graph, false, Map, Converter>
alpar@209
  1473
        (_graph, map, converter);
deba@165
  1474
      _edge_maps.push_back(std::make_pair('-' + caption, backward_storage));
deba@165
  1475
      return *this;
deba@165
  1476
    }
deba@165
  1477
deba@165
  1478
    /// \brief Attribute reading rule
deba@165
  1479
    ///
deba@165
  1480
    /// Add an attribute reading rule to the reader.
deba@165
  1481
    template <typename Value>
deba@165
  1482
    GraphReader& attribute(const std::string& caption, Value& value) {
alpar@209
  1483
      _reader_bits::ValueStorageBase* storage =
alpar@209
  1484
        new _reader_bits::ValueStorage<Value>(value);
deba@165
  1485
      _attributes.insert(std::make_pair(caption, storage));
deba@165
  1486
      return *this;
deba@165
  1487
    }
deba@165
  1488
deba@165
  1489
    /// \brief Attribute reading rule
deba@165
  1490
    ///
deba@165
  1491
    /// Add an attribute reading rule with specialized converter to the
deba@165
  1492
    /// reader.
deba@165
  1493
    template <typename Value, typename Converter>
alpar@209
  1494
    GraphReader& attribute(const std::string& caption, Value& value,
alpar@209
  1495
                             const Converter& converter = Converter()) {
alpar@209
  1496
      _reader_bits::ValueStorageBase* storage =
alpar@209
  1497
        new _reader_bits::ValueStorage<Value, Converter>(value, converter);
deba@165
  1498
      _attributes.insert(std::make_pair(caption, storage));
deba@165
  1499
      return *this;
deba@165
  1500
    }
deba@165
  1501
deba@165
  1502
    /// \brief Node reading rule
deba@165
  1503
    ///
deba@165
  1504
    /// Add a node reading rule to reader.
deba@165
  1505
    GraphReader& node(const std::string& caption, Node& node) {
deba@165
  1506
      typedef _reader_bits::MapLookUpConverter<Node> Converter;
deba@165
  1507
      Converter converter(_node_index);
alpar@209
  1508
      _reader_bits::ValueStorageBase* storage =
alpar@209
  1509
        new _reader_bits::ValueStorage<Node, Converter>(node, converter);
deba@165
  1510
      _attributes.insert(std::make_pair(caption, storage));
deba@165
  1511
      return *this;
deba@165
  1512
    }
deba@165
  1513
deba@165
  1514
    /// \brief Edge reading rule
deba@165
  1515
    ///
deba@165
  1516
    /// Add an edge reading rule to reader.
deba@165
  1517
    GraphReader& edge(const std::string& caption, Edge& edge) {
deba@165
  1518
      typedef _reader_bits::MapLookUpConverter<Edge> Converter;
deba@165
  1519
      Converter converter(_edge_index);
alpar@209
  1520
      _reader_bits::ValueStorageBase* storage =
alpar@209
  1521
        new _reader_bits::ValueStorage<Edge, Converter>(edge, converter);
deba@165
  1522
      _attributes.insert(std::make_pair(caption, storage));
deba@165
  1523
      return *this;
deba@165
  1524
    }
deba@165
  1525
deba@165
  1526
    /// \brief Arc reading rule
deba@165
  1527
    ///
deba@165
  1528
    /// Add an arc reading rule to reader.
deba@165
  1529
    GraphReader& arc(const std::string& caption, Arc& arc) {
deba@165
  1530
      typedef _reader_bits::GraphArcLookUpConverter<Graph> Converter;
deba@165
  1531
      Converter converter(_graph, _edge_index);
alpar@209
  1532
      _reader_bits::ValueStorageBase* storage =
alpar@209
  1533
        new _reader_bits::ValueStorage<Arc, Converter>(arc, converter);
deba@165
  1534
      _attributes.insert(std::make_pair(caption, storage));
deba@165
  1535
      return *this;
deba@165
  1536
    }
deba@165
  1537
deba@165
  1538
    /// @}
deba@165
  1539
deba@165
  1540
    /// \name Select section by name
deba@165
  1541
    /// @{
deba@165
  1542
deba@165
  1543
    /// \brief Set \c \@nodes section to be read
deba@165
  1544
    ///
kpeter@192
  1545
    /// Set \c \@nodes section to be read.
deba@165
  1546
    GraphReader& nodes(const std::string& caption) {
deba@165
  1547
      _nodes_caption = caption;
deba@165
  1548
      return *this;
deba@165
  1549
    }
deba@165
  1550
deba@165
  1551
    /// \brief Set \c \@edges section to be read
deba@165
  1552
    ///
kpeter@192
  1553
    /// Set \c \@edges section to be read.
deba@165
  1554
    GraphReader& edges(const std::string& caption) {
deba@165
  1555
      _edges_caption = caption;
deba@165
  1556
      return *this;
deba@165
  1557
    }
deba@165
  1558
deba@165
  1559
    /// \brief Set \c \@attributes section to be read
deba@165
  1560
    ///
kpeter@192
  1561
    /// Set \c \@attributes section to be read.
deba@165
  1562
    GraphReader& attributes(const std::string& caption) {
deba@165
  1563
      _attributes_caption = caption;
deba@165
  1564
      return *this;
deba@165
  1565
    }
deba@165
  1566
deba@165
  1567
    /// @}
deba@165
  1568
deba@165
  1569
    /// \name Using previously constructed node or edge set
deba@165
  1570
    /// @{
deba@165
  1571
deba@165
  1572
    /// \brief Use previously constructed node set
deba@165
  1573
    ///
deba@165
  1574
    /// Use previously constructed node set, and specify the node
deba@165
  1575
    /// label map.
deba@165
  1576
    template <typename Map>
deba@165
  1577
    GraphReader& useNodes(const Map& map) {
deba@165
  1578
      checkConcept<concepts::ReadMap<Node, typename Map::Value>, Map>();
alpar@209
  1579
      LEMON_ASSERT(!_use_nodes, "Multiple usage of useNodes() member");
deba@165
  1580
      _use_nodes = true;
deba@165
  1581
      _writer_bits::DefaultConverter<typename Map::Value> converter;
deba@165
  1582
      for (NodeIt n(_graph); n != INVALID; ++n) {
alpar@209
  1583
        _node_index.insert(std::make_pair(converter(map[n]), n));
deba@165
  1584
      }
deba@165
  1585
      return *this;
deba@165
  1586
    }
deba@165
  1587
deba@165
  1588
    /// \brief Use previously constructed node set
deba@165
  1589
    ///
deba@165
  1590
    /// Use previously constructed node set, and specify the node
deba@165
  1591
    /// label map and a functor which converts the label map values to
kpeter@192
  1592
    /// \c std::string.
deba@165
  1593
    template <typename Map, typename Converter>
alpar@209
  1594
    GraphReader& useNodes(const Map& map,
alpar@209
  1595
                            const Converter& converter = Converter()) {
deba@165
  1596
      checkConcept<concepts::ReadMap<Node, typename Map::Value>, Map>();
alpar@209
  1597
      LEMON_ASSERT(!_use_nodes, "Multiple usage of useNodes() member");
deba@165
  1598
      _use_nodes = true;
deba@165
  1599
      for (NodeIt n(_graph); n != INVALID; ++n) {
alpar@209
  1600
        _node_index.insert(std::make_pair(converter(map[n]), n));
deba@165
  1601
      }
deba@165
  1602
      return *this;
deba@165
  1603
    }
deba@165
  1604
deba@165
  1605
    /// \brief Use previously constructed edge set
deba@165
  1606
    ///
deba@165
  1607
    /// Use previously constructed edge set, and specify the edge
deba@165
  1608
    /// label map.
deba@165
  1609
    template <typename Map>
deba@165
  1610
    GraphReader& useEdges(const Map& map) {
deba@165
  1611
      checkConcept<concepts::ReadMap<Edge, typename Map::Value>, Map>();
deba@165
  1612
      LEMON_ASSERT(!_use_edges, "Multiple usage of useEdges() member");
deba@165
  1613
      _use_edges = true;
deba@165
  1614
      _writer_bits::DefaultConverter<typename Map::Value> converter;
deba@165
  1615
      for (EdgeIt a(_graph); a != INVALID; ++a) {
alpar@209
  1616
        _edge_index.insert(std::make_pair(converter(map[a]), a));
deba@165
  1617
      }
deba@165
  1618
      return *this;
deba@165
  1619
    }
deba@165
  1620
deba@165
  1621
    /// \brief Use previously constructed edge set
deba@165
  1622
    ///
deba@165
  1623
    /// Use previously constructed edge set, and specify the edge
deba@165
  1624
    /// label map and a functor which converts the label map values to
kpeter@192
  1625
    /// \c std::string.
deba@165
  1626
    template <typename Map, typename Converter>
alpar@209
  1627
    GraphReader& useEdges(const Map& map,
alpar@209
  1628
                            const Converter& converter = Converter()) {
deba@165
  1629
      checkConcept<concepts::ReadMap<Edge, typename Map::Value>, Map>();
alpar@209
  1630
      LEMON_ASSERT(!_use_edges, "Multiple usage of useEdges() member");
deba@165
  1631
      _use_edges = true;
deba@165
  1632
      for (EdgeIt a(_graph); a != INVALID; ++a) {
alpar@209
  1633
        _edge_index.insert(std::make_pair(converter(map[a]), a));
deba@165
  1634
      }
deba@165
  1635
      return *this;
deba@165
  1636
    }
deba@165
  1637
kpeter@192
  1638
    /// \brief Skip the reading of node section
deba@188
  1639
    ///
deba@188
  1640
    /// Omit the reading of the node section. This implies that each node
kpeter@192
  1641
    /// map reading rule will be abandoned, and the nodes of the graph
deba@188
  1642
    /// will not be constructed, which usually cause that the edge set
deba@188
  1643
    /// could not be read due to lack of node name
kpeter@192
  1644
    /// could not be read due to lack of node name resolving.
kpeter@192
  1645
    /// Therefore \c skipEdges() function should also be used, or
kpeter@192
  1646
    /// \c useNodes() should be used to specify the label of the nodes.
deba@188
  1647
    GraphReader& skipNodes() {
alpar@209
  1648
      LEMON_ASSERT(!_skip_nodes, "Skip nodes already set");
deba@188
  1649
      _skip_nodes = true;
deba@188
  1650
      return *this;
deba@188
  1651
    }
deba@188
  1652
kpeter@192
  1653
    /// \brief Skip the reading of edge section
deba@188
  1654
    ///
deba@188
  1655
    /// Omit the reading of the edge section. This implies that each edge
kpeter@192
  1656
    /// map reading rule will be abandoned, and the edges of the graph
deba@188
  1657
    /// will not be constructed.
deba@188
  1658
    GraphReader& skipEdges() {
alpar@209
  1659
      LEMON_ASSERT(!_skip_edges, "Skip edges already set");
deba@188
  1660
      _skip_edges = true;
deba@188
  1661
      return *this;
deba@188
  1662
    }
deba@188
  1663
deba@165
  1664
    /// @}
deba@165
  1665
deba@165
  1666
  private:
deba@165
  1667
deba@165
  1668
    bool readLine() {
deba@165
  1669
      std::string str;
deba@165
  1670
      while(++line_num, std::getline(*_is, str)) {
alpar@209
  1671
        line.clear(); line.str(str);
alpar@209
  1672
        char c;
alpar@209
  1673
        if (line >> std::ws >> c && c != '#') {
alpar@209
  1674
          line.putback(c);
alpar@209
  1675
          return true;
alpar@209
  1676
        }
deba@165
  1677
      }
deba@165
  1678
      return false;
deba@165
  1679
    }
deba@165
  1680
deba@165
  1681
    bool readSuccess() {
deba@165
  1682
      return static_cast<bool>(*_is);
deba@165
  1683
    }
alpar@209
  1684
deba@165
  1685
    void skipSection() {
deba@165
  1686
      char c;
deba@165
  1687
      while (readSuccess() && line >> c && c != '@') {
alpar@209
  1688
        readLine();
deba@165
  1689
      }
deba@165
  1690
      line.putback(c);
deba@165
  1691
    }
deba@165
  1692
deba@165
  1693
    void readNodes() {
deba@165
  1694
deba@165
  1695
      std::vector<int> map_index(_node_maps.size());
deba@165
  1696
      int map_num, label_index;
deba@165
  1697
deba@186
  1698
      char c;
deba@186
  1699
      if (!readLine() || !(line >> c) || c == '@') {
alpar@209
  1700
        if (readSuccess() && line) line.putback(c);
alpar@209
  1701
        if (!_node_maps.empty())
deba@290
  1702
          throw FormatError("Cannot find map names");
alpar@209
  1703
        return;
deba@186
  1704
      }
deba@186
  1705
      line.putback(c);
alpar@209
  1706
deba@165
  1707
      {
alpar@209
  1708
        std::map<std::string, int> maps;
alpar@209
  1709
alpar@209
  1710
        std::string map;
alpar@209
  1711
        int index = 0;
alpar@209
  1712
        while (_reader_bits::readToken(line, map)) {
alpar@209
  1713
          if (maps.find(map) != maps.end()) {
alpar@209
  1714
            std::ostringstream msg;
alpar@209
  1715
            msg << "Multiple occurence of node map: " << map;
deba@290
  1716
            throw FormatError(msg.str());
alpar@209
  1717
          }
alpar@209
  1718
          maps.insert(std::make_pair(map, index));
alpar@209
  1719
          ++index;
alpar@209
  1720
        }
alpar@209
  1721
alpar@209
  1722
        for (int i = 0; i < static_cast<int>(_node_maps.size()); ++i) {
alpar@209
  1723
          std::map<std::string, int>::iterator jt =
alpar@209
  1724
            maps.find(_node_maps[i].first);
alpar@209
  1725
          if (jt == maps.end()) {
alpar@209
  1726
            std::ostringstream msg;
kpeter@291
  1727
            msg << "Map not found: " << _node_maps[i].first;
deba@290
  1728
            throw FormatError(msg.str());
alpar@209
  1729
          }
alpar@209
  1730
          map_index[i] = jt->second;
alpar@209
  1731
        }
alpar@209
  1732
alpar@209
  1733
        {
alpar@209
  1734
          std::map<std::string, int>::iterator jt = maps.find("label");
alpar@209
  1735
          if (jt != maps.end()) {
alpar@209
  1736
            label_index = jt->second;
alpar@209
  1737
          } else {
alpar@209
  1738
            label_index = -1;
alpar@209
  1739
          }
alpar@209
  1740
        }
alpar@209
  1741
        map_num = maps.size();
deba@165
  1742
      }
deba@165
  1743
deba@165
  1744
      while (readLine() && line >> c && c != '@') {
alpar@209
  1745
        line.putback(c);
alpar@209
  1746
alpar@209
  1747
        std::vector<std::string> tokens(map_num);
alpar@209
  1748
        for (int i = 0; i < map_num; ++i) {
alpar@209
  1749
          if (!_reader_bits::readToken(line, tokens[i])) {
alpar@209
  1750
            std::ostringstream msg;
alpar@209
  1751
            msg << "Column not found (" << i + 1 << ")";
deba@290
  1752
            throw FormatError(msg.str());
alpar@209
  1753
          }
alpar@209
  1754
        }
alpar@209
  1755
        if (line >> std::ws >> c)
kpeter@291
  1756
          throw FormatError("Extra character at the end of line");
alpar@209
  1757
alpar@209
  1758
        Node n;
alpar@209
  1759
        if (!_use_nodes) {
alpar@209
  1760
          n = _graph.addNode();
alpar@209
  1761
          if (label_index != -1)
alpar@209
  1762
            _node_index.insert(std::make_pair(tokens[label_index], n));
alpar@209
  1763
        } else {
alpar@209
  1764
          if (label_index == -1)
kpeter@291
  1765
            throw FormatError("Label map not found");
alpar@209
  1766
          typename std::map<std::string, Node>::iterator it =
alpar@209
  1767
            _node_index.find(tokens[label_index]);
alpar@209
  1768
          if (it == _node_index.end()) {
alpar@209
  1769
            std::ostringstream msg;
alpar@209
  1770
            msg << "Node with label not found: " << tokens[label_index];
deba@290
  1771
            throw FormatError(msg.str());
alpar@209
  1772
          }
alpar@209
  1773
          n = it->second;
alpar@209
  1774
        }
alpar@209
  1775
alpar@209
  1776
        for (int i = 0; i < static_cast<int>(_node_maps.size()); ++i) {
alpar@209
  1777
          _node_maps[i].second->set(n, tokens[map_index[i]]);
alpar@209
  1778
        }
deba@165
  1779
deba@165
  1780
      }
deba@165
  1781
      if (readSuccess()) {
alpar@209
  1782
        line.putback(c);
deba@165
  1783
      }
deba@165
  1784
    }
deba@165
  1785
deba@165
  1786
    void readEdges() {
deba@165
  1787
deba@165
  1788
      std::vector<int> map_index(_edge_maps.size());
deba@165
  1789
      int map_num, label_index;
deba@165
  1790
deba@186
  1791
      char c;
deba@186
  1792
      if (!readLine() || !(line >> c) || c == '@') {
alpar@209
  1793
        if (readSuccess() && line) line.putback(c);
alpar@209
  1794
        if (!_edge_maps.empty())
deba@290
  1795
          throw FormatError("Cannot find map names");
alpar@209
  1796
        return;
deba@186
  1797
      }
deba@186
  1798
      line.putback(c);
alpar@209
  1799
deba@165
  1800
      {
alpar@209
  1801
        std::map<std::string, int> maps;
alpar@209
  1802
alpar@209
  1803
        std::string map;
alpar@209
  1804
        int index = 0;
alpar@209
  1805
        while (_reader_bits::readToken(line, map)) {
alpar@209
  1806
          if (maps.find(map) != maps.end()) {
alpar@209
  1807
            std::ostringstream msg;
alpar@209
  1808
            msg << "Multiple occurence of edge map: " << map;
deba@290
  1809
            throw FormatError(msg.str());
alpar@209
  1810
          }
alpar@209
  1811
          maps.insert(std::make_pair(map, index));
alpar@209
  1812
          ++index;
alpar@209
  1813
        }
alpar@209
  1814
alpar@209
  1815
        for (int i = 0; i < static_cast<int>(_edge_maps.size()); ++i) {
alpar@209
  1816
          std::map<std::string, int>::iterator jt =
alpar@209
  1817
            maps.find(_edge_maps[i].first);
alpar@209
  1818
          if (jt == maps.end()) {
alpar@209
  1819
            std::ostringstream msg;
kpeter@291
  1820
            msg << "Map not found: " << _edge_maps[i].first;
deba@290
  1821
            throw FormatError(msg.str());
alpar@209
  1822
          }
alpar@209
  1823
          map_index[i] = jt->second;
alpar@209
  1824
        }
alpar@209
  1825
alpar@209
  1826
        {
alpar@209
  1827
          std::map<std::string, int>::iterator jt = maps.find("label");
alpar@209
  1828
          if (jt != maps.end()) {
alpar@209
  1829
            label_index = jt->second;
alpar@209
  1830
          } else {
alpar@209
  1831
            label_index = -1;
alpar@209
  1832
          }
alpar@209
  1833
        }
alpar@209
  1834
        map_num = maps.size();
deba@165
  1835
      }
deba@165
  1836
deba@165
  1837
      while (readLine() && line >> c && c != '@') {
alpar@209
  1838
        line.putback(c);
alpar@209
  1839
alpar@209
  1840
        std::string source_token;
alpar@209
  1841
        std::string target_token;
alpar@209
  1842
alpar@209
  1843
        if (!_reader_bits::readToken(line, source_token))
deba@290
  1844
          throw FormatError("Node u not found");
alpar@209
  1845
alpar@209
  1846
        if (!_reader_bits::readToken(line, target_token))
deba@290
  1847
          throw FormatError("Node v not found");
alpar@209
  1848
alpar@209
  1849
        std::vector<std::string> tokens(map_num);
alpar@209
  1850
        for (int i = 0; i < map_num; ++i) {
alpar@209
  1851
          if (!_reader_bits::readToken(line, tokens[i])) {
alpar@209
  1852
            std::ostringstream msg;
alpar@209
  1853
            msg << "Column not found (" << i + 1 << ")";
deba@290
  1854
            throw FormatError(msg.str());
alpar@209
  1855
          }
alpar@209
  1856
        }
alpar@209
  1857
        if (line >> std::ws >> c)
kpeter@291
  1858
          throw FormatError("Extra character at the end of line");
alpar@209
  1859
alpar@209
  1860
        Edge e;
alpar@209
  1861
        if (!_use_edges) {
deba@165
  1862
deba@165
  1863
          typename NodeIndex::iterator it;
alpar@209
  1864
deba@165
  1865
          it = _node_index.find(source_token);
deba@165
  1866
          if (it == _node_index.end()) {
deba@165
  1867
            std::ostringstream msg;
deba@165
  1868
            msg << "Item not found: " << source_token;
deba@290
  1869
            throw FormatError(msg.str());
deba@165
  1870
          }
deba@165
  1871
          Node source = it->second;
deba@165
  1872
deba@165
  1873
          it = _node_index.find(target_token);
alpar@209
  1874
          if (it == _node_index.end()) {
alpar@209
  1875
            std::ostringstream msg;
deba@165
  1876
            msg << "Item not found: " << target_token;
deba@290
  1877
            throw FormatError(msg.str());
alpar@209
  1878
          }
alpar@209
  1879
          Node target = it->second;
alpar@209
  1880
alpar@209
  1881
          e = _graph.addEdge(source, target);
alpar@209
  1882
          if (label_index != -1)
alpar@209
  1883
            _edge_index.insert(std::make_pair(tokens[label_index], e));
alpar@209
  1884
        } else {
alpar@209
  1885
          if (label_index == -1)
kpeter@291
  1886
            throw FormatError("Label map not found");
alpar@209
  1887
          typename std::map<std::string, Edge>::iterator it =
alpar@209
  1888
            _edge_index.find(tokens[label_index]);
alpar@209
  1889
          if (it == _edge_index.end()) {
alpar@209
  1890
            std::ostringstream msg;
alpar@209
  1891
            msg << "Edge with label not found: " << tokens[label_index];
deba@290
  1892
            throw FormatError(msg.str());
alpar@209
  1893
          }
alpar@209
  1894
          e = it->second;
alpar@209
  1895
        }
alpar@209
  1896
alpar@209
  1897
        for (int i = 0; i < static_cast<int>(_edge_maps.size()); ++i) {
alpar@209
  1898
          _edge_maps[i].second->set(e, tokens[map_index[i]]);
alpar@209
  1899
        }
deba@165
  1900
deba@165
  1901
      }
deba@165
  1902
      if (readSuccess()) {
alpar@209
  1903
        line.putback(c);
deba@165
  1904
      }
deba@165
  1905
    }
deba@165
  1906
deba@165
  1907
    void readAttributes() {
deba@165
  1908
deba@165
  1909
      std::set<std::string> read_attr;
deba@165
  1910
deba@165
  1911
      char c;
deba@165
  1912
      while (readLine() && line >> c && c != '@') {
alpar@209
  1913
        line.putback(c);
alpar@209
  1914
alpar@209
  1915
        std::string attr, token;
alpar@209
  1916
        if (!_reader_bits::readToken(line, attr))
deba@290
  1917
          throw FormatError("Attribute name not found");
alpar@209
  1918
        if (!_reader_bits::readToken(line, token))
deba@290
  1919
          throw FormatError("Attribute value not found");
alpar@209
  1920
        if (line >> c)
kpeter@291
  1921
          throw FormatError("Extra character at the end of line");
alpar@209
  1922
alpar@209
  1923
        {
alpar@209
  1924
          std::set<std::string>::iterator it = read_attr.find(attr);
alpar@209
  1925
          if (it != read_attr.end()) {
alpar@209
  1926
            std::ostringstream msg;
kpeter@291
  1927
            msg << "Multiple occurence of attribute: " << attr;
deba@290
  1928
            throw FormatError(msg.str());
alpar@209
  1929
          }
alpar@209
  1930
          read_attr.insert(attr);
alpar@209
  1931
        }
alpar@209
  1932
alpar@209
  1933
        {
alpar@209
  1934
          typename Attributes::iterator it = _attributes.lower_bound(attr);
alpar@209
  1935
          while (it != _attributes.end() && it->first == attr) {
alpar@209
  1936
            it->second->set(token);
alpar@209
  1937
            ++it;
alpar@209
  1938
          }
alpar@209
  1939
        }
deba@165
  1940
deba@165
  1941
      }
deba@165
  1942
      if (readSuccess()) {
alpar@209
  1943
        line.putback(c);
deba@165
  1944
      }
deba@165
  1945
      for (typename Attributes::iterator it = _attributes.begin();
alpar@209
  1946
           it != _attributes.end(); ++it) {
alpar@209
  1947
        if (read_attr.find(it->first) == read_attr.end()) {
alpar@209
  1948
          std::ostringstream msg;
kpeter@291
  1949
          msg << "Attribute not found: " << it->first;
deba@290
  1950
          throw FormatError(msg.str());
alpar@209
  1951
        }
deba@165
  1952
      }
deba@165
  1953
    }
deba@165
  1954
deba@165
  1955
  public:
deba@165
  1956
alpar@209
  1957
    /// \name Execution of the reader
deba@165
  1958
    /// @{
deba@165
  1959
deba@165
  1960
    /// \brief Start the batch processing
deba@165
  1961
    ///
deba@165
  1962
    /// This function starts the batch processing
deba@165
  1963
    void run() {
alpar@209
  1964
deba@165
  1965
      LEMON_ASSERT(_is != 0, "This reader assigned to an other reader");
alpar@209
  1966
deba@188
  1967
      bool nodes_done = _skip_nodes;
deba@188
  1968
      bool edges_done = _skip_edges;
deba@165
  1969
      bool attributes_done = false;
deba@165
  1970
alpar@209
  1971
      line_num = 0;
deba@165
  1972
      readLine();
deba@172
  1973
      skipSection();
deba@165
  1974
deba@165
  1975
      while (readSuccess()) {
alpar@209
  1976
        try {
alpar@209
  1977
          char c;
alpar@209
  1978
          std::string section, caption;
alpar@209
  1979
          line >> c;
alpar@209
  1980
          _reader_bits::readToken(line, section);
alpar@209
  1981
          _reader_bits::readToken(line, caption);
alpar@209
  1982
alpar@209
  1983
          if (line >> c)
kpeter@291
  1984
            throw FormatError("Extra character at the end of line");
alpar@209
  1985
alpar@209
  1986
          if (section == "nodes" && !nodes_done) {
alpar@209
  1987
            if (_nodes_caption.empty() || _nodes_caption == caption) {
alpar@209
  1988
              readNodes();
alpar@209
  1989
              nodes_done = true;
alpar@209
  1990
            }
alpar@209
  1991
          } else if ((section == "edges" || section == "arcs") &&
alpar@209
  1992
                     !edges_done) {
alpar@209
  1993
            if (_edges_caption.empty() || _edges_caption == caption) {
alpar@209
  1994
              readEdges();
alpar@209
  1995
              edges_done = true;
alpar@209
  1996
            }
alpar@209
  1997
          } else if (section == "attributes" && !attributes_done) {
alpar@209
  1998
            if (_attributes_caption.empty() || _attributes_caption == caption) {
alpar@209
  1999
              readAttributes();
alpar@209
  2000
              attributes_done = true;
alpar@209
  2001
            }
alpar@209
  2002
          } else {
alpar@209
  2003
            readLine();
alpar@209
  2004
            skipSection();
alpar@209
  2005
          }
deba@290
  2006
        } catch (FormatError& error) {
alpar@209
  2007
          error.line(line_num);
deba@290
  2008
          error.file(_filename);
alpar@209
  2009
          throw;
alpar@209
  2010
        }
deba@165
  2011
      }
deba@165
  2012
deba@165
  2013
      if (!nodes_done) {
deba@290
  2014
        throw FormatError("Section @nodes not found");
deba@165
  2015
      }
deba@165
  2016
deba@165
  2017
      if (!edges_done) {
deba@290
  2018
        throw FormatError("Section @edges not found");
deba@165
  2019
      }
deba@165
  2020
deba@165
  2021
      if (!attributes_done && !_attributes.empty()) {
deba@290
  2022
        throw FormatError("Section @attributes not found");
deba@165
  2023
      }
deba@165
  2024
deba@165
  2025
    }
deba@165
  2026
deba@165
  2027
    /// @}
alpar@209
  2028
deba@165
  2029
  };
deba@165
  2030
kpeter@374
  2031
  /// \brief Return a \ref GraphReader class
kpeter@374
  2032
  ///
kpeter@374
  2033
  /// This function just returns a \ref GraphReader class.
kpeter@374
  2034
  /// \relates GraphReader
kpeter@374
  2035
  template <typename Graph>
kpeter@374
  2036
  GraphReader<Graph> graphReader(Graph& graph, std::istream& is) {
kpeter@374
  2037
    GraphReader<Graph> tmp(graph, is);
kpeter@374
  2038
    return tmp;
kpeter@374
  2039
  }
kpeter@374
  2040
kpeter@374
  2041
  /// \brief Return a \ref GraphReader class
kpeter@374
  2042
  ///
kpeter@374
  2043
  /// This function just returns a \ref GraphReader class.
kpeter@374
  2044
  /// \relates GraphReader
kpeter@374
  2045
  template <typename Graph>
kpeter@374
  2046
  GraphReader<Graph> graphReader(Graph& graph, const std::string& fn) {
kpeter@374
  2047
    GraphReader<Graph> tmp(graph, fn);
kpeter@374
  2048
    return tmp;
kpeter@374
  2049
  }
kpeter@374
  2050
kpeter@374
  2051
  /// \brief Return a \ref GraphReader class
kpeter@374
  2052
  ///
kpeter@374
  2053
  /// This function just returns a \ref GraphReader class.
kpeter@374
  2054
  /// \relates GraphReader
kpeter@374
  2055
  template <typename Graph>
kpeter@374
  2056
  GraphReader<Graph> graphReader(Graph& graph, const char* fn) {
kpeter@374
  2057
    GraphReader<Graph> tmp(graph, fn);
kpeter@374
  2058
    return tmp;
kpeter@374
  2059
  }
kpeter@374
  2060
deba@190
  2061
  class SectionReader;
deba@190
  2062
deba@190
  2063
  SectionReader sectionReader(std::istream& is);
deba@190
  2064
  SectionReader sectionReader(const std::string& fn);
deba@190
  2065
  SectionReader sectionReader(const char* fn);
alpar@209
  2066
kpeter@192
  2067
  /// \ingroup lemon_io
kpeter@192
  2068
  ///
deba@189
  2069
  /// \brief Section reader class
deba@189
  2070
  ///
alpar@209
  2071
  /// In the \ref lgf-format "LGF" file extra sections can be placed,
kpeter@192
  2072
  /// which contain any data in arbitrary format. Such sections can be
alpar@209
  2073
  /// read with this class. A reading rule can be added to the class
kpeter@192
  2074
  /// with two different functions. With the \c sectionLines() function a
kpeter@192
  2075
  /// functor can process the section line-by-line, while with the \c
deba@189
  2076
  /// sectionStream() member the section can be read from an input
deba@189
  2077
  /// stream.
deba@189
  2078
  class SectionReader {
deba@189
  2079
  private:
alpar@209
  2080
deba@189
  2081
    std::istream* _is;
deba@189
  2082
    bool local_is;
deba@290
  2083
    std::string _filename;
deba@189
  2084
deba@189
  2085
    typedef std::map<std::string, _reader_bits::Section*> Sections;
deba@189
  2086
    Sections _sections;
deba@189
  2087
deba@189
  2088
    int line_num;
deba@189
  2089
    std::istringstream line;
deba@189
  2090
deba@189
  2091
  public:
deba@189
  2092
deba@189
  2093
    /// \brief Constructor
deba@189
  2094
    ///
deba@189
  2095
    /// Construct a section reader, which reads from the given input
deba@189
  2096
    /// stream.
alpar@209
  2097
    SectionReader(std::istream& is)
deba@189
  2098
      : _is(&is), local_is(false) {}
deba@189
  2099
deba@189
  2100
    /// \brief Constructor
deba@189
  2101
    ///
deba@189
  2102
    /// Construct a section reader, which reads from the given file.
alpar@209
  2103
    SectionReader(const std::string& fn)
deba@290
  2104
      : _is(new std::ifstream(fn.c_str())), local_is(true),
deba@290
  2105
        _filename(fn) {
deba@295
  2106
      if (!(*_is)) {
deba@295
  2107
        delete _is;
deba@295
  2108
        throw IoError("Cannot open file", fn);
deba@295
  2109
      }
deba@290
  2110
    }
alpar@209
  2111
deba@189
  2112
    /// \brief Constructor
deba@189
  2113
    ///
deba@189
  2114
    /// Construct a section reader, which reads from the given file.
alpar@209
  2115
    SectionReader(const char* fn)
deba@290
  2116
      : _is(new std::ifstream(fn)), local_is(true),
deba@290
  2117
        _filename(fn) {
deba@295
  2118
      if (!(*_is)) {
deba@295
  2119
        delete _is;
deba@295
  2120
        throw IoError("Cannot open file", fn);
deba@295
  2121
      }
deba@290
  2122
    }
deba@189
  2123
deba@189
  2124
    /// \brief Destructor
deba@189
  2125
    ~SectionReader() {
alpar@209
  2126
      for (Sections::iterator it = _sections.begin();
alpar@209
  2127
           it != _sections.end(); ++it) {
alpar@209
  2128
        delete it->second;
deba@189
  2129
      }
deba@189
  2130
deba@189
  2131
      if (local_is) {
alpar@209
  2132
        delete _is;
deba@189
  2133
      }
deba@189
  2134
deba@189
  2135
    }
deba@189
  2136
deba@189
  2137
  private:
deba@190
  2138
deba@190
  2139
    friend SectionReader sectionReader(std::istream& is);
deba@190
  2140
    friend SectionReader sectionReader(const std::string& fn);
deba@190
  2141
    friend SectionReader sectionReader(const char* fn);
deba@190
  2142
alpar@209
  2143
    SectionReader(SectionReader& other)
deba@190
  2144
      : _is(other._is), local_is(other.local_is) {
deba@190
  2145
deba@190
  2146
      other._is = 0;
deba@190
  2147
      other.local_is = false;
alpar@209
  2148
deba@190
  2149
      _sections.swap(other._sections);
deba@190
  2150
    }
alpar@209
  2151
deba@189
  2152
    SectionReader& operator=(const SectionReader&);
deba@189
  2153
deba@189
  2154
  public:
deba@189
  2155
deba@189
  2156
    /// \name Section readers
deba@189
  2157
    /// @{
deba@189
  2158
deba@189
  2159
    /// \brief Add a section processor with line oriented reading
deba@189
  2160
    ///
deba@189
  2161
    /// The first parameter is the type descriptor of the section, the
deba@189
  2162
    /// second is a functor, which takes just one \c std::string
deba@189
  2163
    /// parameter. At the reading process, each line of the section
deba@189
  2164
    /// will be given to the functor object. However, the empty lines
deba@189
  2165
    /// and the comment lines are filtered out, and the leading
deba@189
  2166
    /// whitespaces are trimmed from each processed string.
deba@189
  2167
    ///
deba@189
  2168
    /// For example let's see a section, which contain several
deba@189
  2169
    /// integers, which should be inserted into a vector.
deba@189
  2170
    ///\code
deba@189
  2171
    ///  @numbers
deba@189
  2172
    ///  12 45 23
deba@189
  2173
    ///  4
deba@189
  2174
    ///  23 6
deba@189
  2175
    ///\endcode
deba@189
  2176
    ///
kpeter@192
  2177
    /// The functor is implemented as a struct:
deba@189
  2178
    ///\code
deba@189
  2179
    ///  struct NumberSection {
deba@189
  2180
    ///    std::vector<int>& _data;
deba@189
  2181
    ///    NumberSection(std::vector<int>& data) : _data(data) {}
deba@189
  2182
    ///    void operator()(const std::string& line) {
deba@189
  2183
    ///      std::istringstream ls(line);
deba@189
  2184
    ///      int value;
deba@189
  2185
    ///      while (ls >> value) _data.push_back(value);
deba@189
  2186
    ///    }
deba@189
  2187
    ///  };
deba@189
  2188
    ///
deba@189
  2189
    ///  // ...
deba@189
  2190
    ///
alpar@209
  2191
    ///  reader.sectionLines("numbers", NumberSection(vec));
deba@189
  2192
    ///\endcode
deba@189
  2193
    template <typename Functor>
deba@189
  2194
    SectionReader& sectionLines(const std::string& type, Functor functor) {
kpeter@192
  2195
      LEMON_ASSERT(!type.empty(), "Type is empty.");
alpar@209
  2196
      LEMON_ASSERT(_sections.find(type) == _sections.end(),
alpar@209
  2197
                   "Multiple reading of section.");
alpar@209
  2198
      _sections.insert(std::make_pair(type,
deba@189
  2199
        new _reader_bits::LineSection<Functor>(functor)));
deba@189
  2200
      return *this;
deba@189
  2201
    }
deba@189
  2202
deba@189
  2203
deba@189
  2204
    /// \brief Add a section processor with stream oriented reading
deba@189
  2205
    ///
deba@189
  2206
    /// The first parameter is the type of the section, the second is
kpeter@192
  2207
    /// a functor, which takes an \c std::istream& and an \c int&
deba@189
  2208
    /// parameter, the latter regard to the line number of stream. The
deba@189
  2209
    /// functor can read the input while the section go on, and the
deba@189
  2210
    /// line number should be modified accordingly.
deba@189
  2211
    template <typename Functor>
deba@189
  2212
    SectionReader& sectionStream(const std::string& type, Functor functor) {
kpeter@192
  2213
      LEMON_ASSERT(!type.empty(), "Type is empty.");
alpar@209
  2214
      LEMON_ASSERT(_sections.find(type) == _sections.end(),
alpar@209
  2215
                   "Multiple reading of section.");
alpar@209
  2216
      _sections.insert(std::make_pair(type,
alpar@209
  2217
         new _reader_bits::StreamSection<Functor>(functor)));
deba@189
  2218
      return *this;
alpar@209
  2219
    }
alpar@209
  2220
deba@189
  2221
    /// @}
deba@189
  2222
deba@189
  2223
  private:
deba@189
  2224
deba@189
  2225
    bool readLine() {
deba@189
  2226
      std::string str;
deba@189
  2227
      while(++line_num, std::getline(*_is, str)) {
alpar@209
  2228
        line.clear(); line.str(str);
alpar@209
  2229
        char c;
alpar@209
  2230
        if (line >> std::ws >> c && c != '#') {
alpar@209
  2231
          line.putback(c);
alpar@209
  2232
          return true;
alpar@209
  2233
        }
deba@189
  2234
      }
deba@189
  2235
      return false;
deba@189
  2236
    }
deba@189
  2237
deba@189
  2238
    bool readSuccess() {
deba@189
  2239
      return static_cast<bool>(*_is);
deba@189
  2240
    }
alpar@209
  2241
deba@189
  2242
    void skipSection() {
deba@189
  2243
      char c;
deba@189
  2244
      while (readSuccess() && line >> c && c != '@') {
alpar@209
  2245
        readLine();
deba@189
  2246
      }
deba@189
  2247
      line.putback(c);
deba@189
  2248
    }
deba@189
  2249
deba@189
  2250
  public:
deba@189
  2251
deba@189
  2252
alpar@209
  2253
    /// \name Execution of the reader
deba@189
  2254
    /// @{
deba@189
  2255
deba@189
  2256
    /// \brief Start the batch processing
deba@189
  2257
    ///
kpeter@192
  2258
    /// This function starts the batch processing.
deba@189
  2259
    void run() {
alpar@209
  2260
deba@189
  2261
      LEMON_ASSERT(_is != 0, "This reader assigned to an other reader");
alpar@209
  2262
deba@189
  2263
      std::set<std::string> extra_sections;
deba@189
  2264
alpar@209
  2265
      line_num = 0;
deba@189
  2266
      readLine();
deba@189
  2267
      skipSection();
deba@189
  2268
deba@189
  2269
      while (readSuccess()) {
alpar@209
  2270
        try {
alpar@209
  2271
          char c;
alpar@209
  2272
          std::string section, caption;
alpar@209
  2273
          line >> c;
alpar@209
  2274
          _reader_bits::readToken(line, section);
alpar@209
  2275
          _reader_bits::readToken(line, caption);
alpar@209
  2276
alpar@209
  2277
          if (line >> c)
kpeter@291
  2278
            throw FormatError("Extra character at the end of line");
alpar@209
  2279
alpar@209
  2280
          if (extra_sections.find(section) != extra_sections.end()) {
alpar@209
  2281
            std::ostringstream msg;
kpeter@291
  2282
            msg << "Multiple occurence of section: " << section;
deba@290
  2283
            throw FormatError(msg.str());
alpar@209
  2284
          }
alpar@209
  2285
          Sections::iterator it = _sections.find(section);
alpar@209
  2286
          if (it != _sections.end()) {
alpar@209
  2287
            extra_sections.insert(section);
alpar@209
  2288
            it->second->process(*_is, line_num);
alpar@209
  2289
          }
alpar@209
  2290
          readLine();
alpar@209
  2291
          skipSection();
deba@290
  2292
        } catch (FormatError& error) {
alpar@209
  2293
          error.line(line_num);
deba@290
  2294
          error.file(_filename);
alpar@209
  2295
          throw;
alpar@209
  2296
        }
deba@189
  2297
      }
deba@189
  2298
      for (Sections::iterator it = _sections.begin();
alpar@209
  2299
           it != _sections.end(); ++it) {
alpar@209
  2300
        if (extra_sections.find(it->first) == extra_sections.end()) {
alpar@209
  2301
          std::ostringstream os;
alpar@209
  2302
          os << "Cannot find section: " << it->first;
deba@290
  2303
          throw FormatError(os.str());
alpar@209
  2304
        }
deba@189
  2305
      }
deba@189
  2306
    }
deba@189
  2307
deba@189
  2308
    /// @}
alpar@209
  2309
deba@189
  2310
  };
deba@189
  2311
kpeter@192
  2312
  /// \brief Return a \ref SectionReader class
alpar@209
  2313
  ///
kpeter@192
  2314
  /// This function just returns a \ref SectionReader class.
deba@189
  2315
  /// \relates SectionReader
deba@189
  2316
  inline SectionReader sectionReader(std::istream& is) {
deba@189
  2317
    SectionReader tmp(is);
deba@189
  2318
    return tmp;
deba@189
  2319
  }
deba@189
  2320
kpeter@192
  2321
  /// \brief Return a \ref SectionReader class
alpar@209
  2322
  ///
kpeter@192
  2323
  /// This function just returns a \ref SectionReader class.
deba@189
  2324
  /// \relates SectionReader
deba@189
  2325
  inline SectionReader sectionReader(const std::string& fn) {
deba@189
  2326
    SectionReader tmp(fn);
deba@189
  2327
    return tmp;
deba@189
  2328
  }
deba@189
  2329
kpeter@192
  2330
  /// \brief Return a \ref SectionReader class
alpar@209
  2331
  ///
kpeter@192
  2332
  /// This function just returns a \ref SectionReader class.
deba@189
  2333
  /// \relates SectionReader
deba@189
  2334
  inline SectionReader sectionReader(const char* fn) {
deba@189
  2335
    SectionReader tmp(fn);
deba@189
  2336
    return tmp;
deba@189
  2337
  }
deba@189
  2338
deba@173
  2339
  /// \ingroup lemon_io
deba@173
  2340
  ///
alpar@209
  2341
  /// \brief Reader for the contents of the \ref lgf-format "LGF" file
deba@173
  2342
  ///
deba@173
  2343
  /// This class can be used to read the sections, the map names and
ladanyi@236
  2344
  /// the attributes from a file. Usually, the LEMON programs know
deba@173
  2345
  /// that, which type of graph, which maps and which attributes
deba@173
  2346
  /// should be read from a file, but in general tools (like glemon)
alpar@179
  2347
  /// the contents of an LGF file should be guessed somehow. This class
deba@173
  2348
  /// reads the graph and stores the appropriate information for
deba@173
  2349
  /// reading the graph.
deba@173
  2350
  ///
alpar@209
  2351
  ///\code
alpar@209
  2352
  /// LgfContents contents("graph.lgf");
alpar@179
  2353
  /// contents.run();
deba@173
  2354
  ///
kpeter@192
  2355
  /// // Does it contain any node section and arc section?
alpar@179
  2356
  /// if (contents.nodeSectionNum() == 0 || contents.arcSectionNum()) {
kpeter@192
  2357
  ///   std::cerr << "Failure, cannot find graph." << std::endl;
deba@173
  2358
  ///   return -1;
deba@173
  2359
  /// }
alpar@209
  2360
  /// std::cout << "The name of the default node section: "
alpar@179
  2361
  ///           << contents.nodeSection(0) << std::endl;
alpar@209
  2362
  /// std::cout << "The number of the arc maps: "
alpar@179
  2363
  ///           << contents.arcMaps(0).size() << std::endl;
alpar@209
  2364
  /// std::cout << "The name of second arc map: "
alpar@179
  2365
  ///           << contents.arcMaps(0)[1] << std::endl;
deba@173
  2366
  ///\endcode
alpar@209
  2367
  class LgfContents {
deba@173
  2368
  private:
deba@173
  2369
deba@173
  2370
    std::istream* _is;
deba@173
  2371
    bool local_is;
deba@173
  2372
deba@173
  2373
    std::vector<std::string> _node_sections;
deba@173
  2374
    std::vector<std::string> _edge_sections;
deba@173
  2375
    std::vector<std::string> _attribute_sections;
deba@173
  2376
    std::vector<std::string> _extra_sections;
deba@173
  2377
deba@173
  2378
    std::vector<bool> _arc_sections;
deba@173
  2379
deba@173
  2380
    std::vector<std::vector<std::string> > _node_maps;
deba@173
  2381
    std::vector<std::vector<std::string> > _edge_maps;
deba@173
  2382
deba@173
  2383
    std::vector<std::vector<std::string> > _attributes;
deba@173
  2384
deba@173
  2385
deba@173
  2386
    int line_num;
deba@173
  2387
    std::istringstream line;
alpar@209
  2388
deba@173
  2389
  public:
deba@173
  2390
deba@173
  2391
    /// \brief Constructor
deba@173
  2392
    ///
alpar@179
  2393
    /// Construct an \e LGF contents reader, which reads from the given
deba@173
  2394
    /// input stream.
alpar@209
  2395
    LgfContents(std::istream& is)
deba@173
  2396
      : _is(&is), local_is(false) {}
deba@173
  2397
deba@173
  2398
    /// \brief Constructor
deba@173
  2399
    ///
alpar@179
  2400
    /// Construct an \e LGF contents reader, which reads from the given
deba@173
  2401
    /// file.
alpar@209
  2402
    LgfContents(const std::string& fn)
deba@290
  2403
      : _is(new std::ifstream(fn.c_str())), local_is(true) {
deba@295
  2404
      if (!(*_is)) {
deba@295
  2405
        delete _is;
deba@295
  2406
        throw IoError("Cannot open file", fn);
deba@295
  2407
      }
deba@290
  2408
    }
deba@173
  2409
deba@173
  2410
    /// \brief Constructor
deba@173
  2411
    ///
alpar@179
  2412
    /// Construct an \e LGF contents reader, which reads from the given
deba@173
  2413
    /// file.
alpar@179
  2414
    LgfContents(const char* fn)
deba@290
  2415
      : _is(new std::ifstream(fn)), local_is(true) {
deba@295
  2416
      if (!(*_is)) {
deba@295
  2417
        delete _is;
deba@295
  2418
        throw IoError("Cannot open file", fn);
deba@295
  2419
      }
deba@290
  2420
    }
alpar@209
  2421
deba@173
  2422
    /// \brief Destructor
alpar@179
  2423
    ~LgfContents() {
deba@173
  2424
      if (local_is) delete _is;
deba@173
  2425
    }
deba@173
  2426
deba@190
  2427
  private:
alpar@209
  2428
deba@190
  2429
    LgfContents(const LgfContents&);
deba@190
  2430
    LgfContents& operator=(const LgfContents&);
deba@190
  2431
deba@190
  2432
  public:
deba@190
  2433
deba@173
  2434
deba@173
  2435
    /// \name Node sections
deba@173
  2436
    /// @{
deba@173
  2437
deba@173
  2438
    /// \brief Gives back the number of node sections in the file.
deba@173
  2439
    ///
deba@173
  2440
    /// Gives back the number of node sections in the file.
deba@173
  2441
    int nodeSectionNum() const {
deba@173
  2442
      return _node_sections.size();
deba@173
  2443
    }
deba@173
  2444
alpar@209
  2445
    /// \brief Returns the node section name at the given position.
deba@173
  2446
    ///
alpar@209
  2447
    /// Returns the node section name at the given position.
deba@173
  2448
    const std::string& nodeSection(int i) const {
deba@173
  2449
      return _node_sections[i];
deba@173
  2450
    }
deba@173
  2451
deba@173
  2452
    /// \brief Gives back the node maps for the given section.
deba@173
  2453
    ///
deba@173
  2454
    /// Gives back the node maps for the given section.
alpar@182
  2455
    const std::vector<std::string>& nodeMapNames(int i) const {
deba@173
  2456
      return _node_maps[i];
deba@173
  2457
    }
deba@173
  2458
deba@173
  2459
    /// @}
deba@173
  2460
alpar@209
  2461
    /// \name Arc/Edge sections
deba@173
  2462
    /// @{
deba@173
  2463
alpar@181
  2464
    /// \brief Gives back the number of arc/edge sections in the file.
deba@173
  2465
    ///
alpar@181
  2466
    /// Gives back the number of arc/edge sections in the file.
alpar@181
  2467
    /// \note It is synonym of \c edgeSectionNum().
deba@173
  2468
    int arcSectionNum() const {
deba@173
  2469
      return _edge_sections.size();
deba@173
  2470
    }
deba@173
  2471
alpar@209
  2472
    /// \brief Returns the arc/edge section name at the given position.
deba@173
  2473
    ///
alpar@209
  2474
    /// Returns the arc/edge section name at the given position.
alpar@181
  2475
    /// \note It is synonym of \c edgeSection().
deba@173
  2476
    const std::string& arcSection(int i) const {
deba@173
  2477
      return _edge_sections[i];
deba@173
  2478
    }
deba@173
  2479
alpar@181
  2480
    /// \brief Gives back the arc/edge maps for the given section.
deba@173
  2481
    ///
alpar@181
  2482
    /// Gives back the arc/edge maps for the given section.
alpar@182
  2483
    /// \note It is synonym of \c edgeMapNames().
alpar@182
  2484
    const std::vector<std::string>& arcMapNames(int i) const {
deba@173
  2485
      return _edge_maps[i];
deba@173
  2486
    }
deba@173
  2487
deba@173
  2488
    /// @}
deba@173
  2489
alpar@181
  2490
    /// \name Synonyms
deba@173
  2491
    /// @{
deba@173
  2492
alpar@181
  2493
    /// \brief Gives back the number of arc/edge sections in the file.
deba@173
  2494
    ///
alpar@181
  2495
    /// Gives back the number of arc/edge sections in the file.
alpar@181
  2496
    /// \note It is synonym of \c arcSectionNum().
deba@173
  2497
    int edgeSectionNum() const {
deba@173
  2498
      return _edge_sections.size();
deba@173
  2499
    }
deba@173
  2500
alpar@209
  2501
    /// \brief Returns the section name at the given position.
deba@173
  2502
    ///
alpar@209
  2503
    /// Returns the section name at the given position.
alpar@181
  2504
    /// \note It is synonym of \c arcSection().
deba@173
  2505
    const std::string& edgeSection(int i) const {
deba@173
  2506
      return _edge_sections[i];
deba@173
  2507
    }
deba@173
  2508
deba@173
  2509
    /// \brief Gives back the edge maps for the given section.
deba@173
  2510
    ///
deba@173
  2511
    /// Gives back the edge maps for the given section.
alpar@182
  2512
    /// \note It is synonym of \c arcMapNames().
alpar@182
  2513
    const std::vector<std::string>& edgeMapNames(int i) const {
deba@173
  2514
      return _edge_maps[i];
deba@173
  2515
    }
deba@173
  2516
deba@173
  2517
    /// @}
deba@173
  2518
alpar@209
  2519
    /// \name Attribute sections
deba@173
  2520
    /// @{
deba@173
  2521
deba@173
  2522
    /// \brief Gives back the number of attribute sections in the file.
deba@173
  2523
    ///
deba@173
  2524
    /// Gives back the number of attribute sections in the file.
deba@173
  2525
    int attributeSectionNum() const {
deba@173
  2526
      return _attribute_sections.size();
deba@173
  2527
    }
deba@173
  2528
alpar@209
  2529
    /// \brief Returns the attribute section name at the given position.
deba@173
  2530
    ///
alpar@209
  2531
    /// Returns the attribute section name at the given position.
alpar@182
  2532
    const std::string& attributeSectionNames(int i) const {
deba@173
  2533
      return _attribute_sections[i];
deba@173
  2534
    }
deba@173
  2535
deba@173
  2536
    /// \brief Gives back the attributes for the given section.
deba@173
  2537
    ///
deba@173
  2538
    /// Gives back the attributes for the given section.
deba@173
  2539
    const std::vector<std::string>& attributes(int i) const {
deba@173
  2540
      return _attributes[i];
deba@173
  2541
    }
deba@173
  2542
deba@173
  2543
    /// @}
deba@173
  2544
alpar@209
  2545
    /// \name Extra sections
deba@173
  2546
    /// @{
deba@173
  2547
deba@173
  2548
    /// \brief Gives back the number of extra sections in the file.
deba@173
  2549
    ///
deba@173
  2550
    /// Gives back the number of extra sections in the file.
deba@173
  2551
    int extraSectionNum() const {
deba@173
  2552
      return _extra_sections.size();
deba@173
  2553
    }
deba@173
  2554
alpar@209
  2555
    /// \brief Returns the extra section type at the given position.
deba@173
  2556
    ///
alpar@209
  2557
    /// Returns the section type at the given position.
deba@173
  2558
    const std::string& extraSection(int i) const {
deba@173
  2559
      return _extra_sections[i];
deba@173
  2560
    }
deba@173
  2561
deba@173
  2562
    /// @}
deba@173
  2563
deba@173
  2564
  private:
deba@173
  2565
deba@173
  2566
    bool readLine() {
deba@173
  2567
      std::string str;
deba@173
  2568
      while(++line_num, std::getline(*_is, str)) {
alpar@209
  2569
        line.clear(); line.str(str);
alpar@209
  2570
        char c;
alpar@209
  2571
        if (line >> std::ws >> c && c != '#') {
alpar@209
  2572
          line.putback(c);
alpar@209
  2573
          return true;
alpar@209
  2574
        }
deba@173
  2575
      }
deba@173
  2576
      return false;
deba@173
  2577
    }
deba@173
  2578
deba@173
  2579
    bool readSuccess() {
deba@173
  2580
      return static_cast<bool>(*_is);
deba@173
  2581
    }
deba@173
  2582
deba@173
  2583
    void skipSection() {
deba@173
  2584
      char c;
deba@173
  2585
      while (readSuccess() && line >> c && c != '@') {
alpar@209
  2586
        readLine();
deba@173
  2587
      }
deba@173
  2588
      line.putback(c);
deba@173
  2589
    }
deba@173
  2590
deba@173
  2591
    void readMaps(std::vector<std::string>& maps) {
deba@186
  2592
      char c;
deba@186
  2593
      if (!readLine() || !(line >> c) || c == '@') {
alpar@209
  2594
        if (readSuccess() && line) line.putback(c);
alpar@209
  2595
        return;
deba@186
  2596
      }
deba@186
  2597
      line.putback(c);
deba@173
  2598
      std::string map;
deba@173
  2599
      while (_reader_bits::readToken(line, map)) {
alpar@209
  2600
        maps.push_back(map);
deba@173
  2601
      }
deba@173
  2602
    }
deba@173
  2603
deba@173
  2604
    void readAttributes(std::vector<std::string>& attrs) {
deba@173
  2605
      readLine();
deba@173
  2606
      char c;
deba@173
  2607
      while (readSuccess() && line >> c && c != '@') {
alpar@209
  2608
        line.putback(c);
alpar@209
  2609
        std::string attr;
alpar@209
  2610
        _reader_bits::readToken(line, attr);
alpar@209
  2611
        attrs.push_back(attr);
alpar@209
  2612
        readLine();
deba@173
  2613
      }
deba@173
  2614
      line.putback(c);
deba@173
  2615
    }
deba@173
  2616
deba@173
  2617
  public:
deba@173
  2618
alpar@209
  2619
    /// \name Execution of the contents reader
deba@173
  2620
    /// @{
deba@173
  2621
kpeter@192
  2622
    /// \brief Starts the reading
deba@173
  2623
    ///
kpeter@192
  2624
    /// This function starts the reading.
deba@173
  2625
    void run() {
deba@173
  2626
deba@173
  2627
      readLine();
deba@173
  2628
      skipSection();
deba@173
  2629
deba@173
  2630
      while (readSuccess()) {
deba@173
  2631
alpar@209
  2632
        char c;
alpar@209
  2633
        line >> c;
alpar@209
  2634
alpar@209
  2635
        std::string section, caption;
alpar@209
  2636
        _reader_bits::readToken(line, section);
alpar@209
  2637
        _reader_bits::readToken(line, caption);
alpar@209
  2638
alpar@209
  2639
        if (section == "nodes") {
alpar@209
  2640
          _node_sections.push_back(caption);
alpar@209
  2641
          _node_maps.push_back(std::vector<std::string>());
alpar@209
  2642
          readMaps(_node_maps.back());
alpar@209
  2643
          readLine(); skipSection();
alpar@209
  2644
        } else if (section == "arcs" || section == "edges") {
alpar@209
  2645
          _edge_sections.push_back(caption);
alpar@209
  2646
          _arc_sections.push_back(section == "arcs");
alpar@209
  2647
          _edge_maps.push_back(std::vector<std::string>());
alpar@209
  2648
          readMaps(_edge_maps.back());
alpar@209
  2649
          readLine(); skipSection();
alpar@209
  2650
        } else if (section == "attributes") {
alpar@209
  2651
          _attribute_sections.push_back(caption);
alpar@209
  2652
          _attributes.push_back(std::vector<std::string>());
alpar@209
  2653
          readAttributes(_attributes.back());
alpar@209
  2654
        } else {
alpar@209
  2655
          _extra_sections.push_back(section);
alpar@209
  2656
          readLine(); skipSection();
alpar@209
  2657
        }
deba@173
  2658
      }
deba@173
  2659
    }
deba@173
  2660
deba@173
  2661
    /// @}
alpar@209
  2662
deba@173
  2663
  };
deba@127
  2664
}
deba@127
  2665
deba@127
  2666
#endif