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