1.1 --- a/src/work/deba/graph_reader.h Thu Dec 09 17:02:53 2004 +0000
1.2 +++ b/src/work/deba/graph_reader.h Tue Dec 14 19:26:50 2004 +0000
1.3 @@ -16,7 +16,7 @@
1.4
1.5 ///\ingroup gio
1.6 ///\file
1.7 -///\brief Map utilities.
1.8 +///\brief Graph reader.
1.9
1.10 #include <iostream>
1.11 #include <sstream>
1.12 @@ -30,6 +30,34 @@
1.13
1.14
1.15 namespace lemon {
1.16 +
1.17 + // Exceptions
1.18 +
1.19 + class IOException {
1.20 + public:
1.21 + virtual string what() const = 0;
1.22 + };
1.23 +
1.24 + class DataFormatException : public IOException {
1.25 + std::string message;
1.26 + public:
1.27 + DataFormatException(const std::string& _message)
1.28 + : message(_message) {}
1.29 + std::string what() const {
1.30 + return "DataFormatException: " + message;
1.31 + }
1.32 + };
1.33 +
1.34 + class StreamException : public IOException {
1.35 + public:
1.36 + virtual int line() = 0;
1.37 + private:
1.38 + IOException* exception;
1.39 + int line_num;
1.40 + };
1.41 +
1.42 +
1.43 + // Readers and ReaderTraits
1.44
1.45 struct DefaultReaderTraits {
1.46
1.47 @@ -37,36 +65,109 @@
1.48 struct Reader {
1.49 typedef _Value Value;
1.50 void read(std::istream& is, Value& value) {
1.51 - is >> value;
1.52 + if (!(is >> value))
1.53 + throw DataFormatException("Default Reader format exception");
1.54 }
1.55 };
1.56
1.57 - template <typename _Value>
1.58 - struct Skipper {
1.59 - typedef _Value Value;
1.60 - void read(std::istream& is) {
1.61 - Value tmp;
1.62 - is >> tmp;
1.63 - }
1.64 - };
1.65 + typedef Reader<std::string> DefaultReader;
1.66
1.67 - struct DefaultSkipper {
1.68 - void read(std::istream& is) {
1.69 - std::string tmp;
1.70 - is >> tmp;
1.71 - }
1.72 - };
1.73 };
1.74
1.75 - class IOException {
1.76 - virtual string message() = 0;
1.77 + class QuotedStringReader {
1.78 + public:
1.79 + typedef std::string Value;
1.80 +
1.81 + QuotedStringReader(bool _escaped = true) : escaped(_escaped) {}
1.82 +
1.83 + void read(std::istream& is, std::string& value) {
1.84 + char c;
1.85 + value.clear();
1.86 + is >> ws;
1.87 + if (!is.get(c) || c != '\"') throw DataFormatException("Quoted string format exception");
1.88 + while (is.get(c) && c != '\"') {
1.89 + if (escaped && c == '\\') {
1.90 + value += readEscape(is);
1.91 + } else {
1.92 + value += c;
1.93 + }
1.94 + }
1.95 + if (!is) throw DataFormatException("Quoted string format exception");
1.96 + }
1.97 +
1.98 + private:
1.99 +
1.100 + static char readEscape(std::istream& is) {
1.101 + char c;
1.102 + switch (is.get(c), c) {
1.103 + case '\\':
1.104 + return '\\';
1.105 + case '\"':
1.106 + return '\"';
1.107 + case '\'':
1.108 + return '\'';
1.109 + case '\?':
1.110 + return '\?';
1.111 + case 'a':
1.112 + return '\a';
1.113 + case 'b':
1.114 + return '\b';
1.115 + case 'f':
1.116 + return '\f';
1.117 + case 'n':
1.118 + return '\n';
1.119 + case 'r':
1.120 + return '\r';
1.121 + case 't':
1.122 + return '\t';
1.123 + case 'v':
1.124 + return '\v';
1.125 + case 'x':
1.126 + {
1.127 + int code;
1.128 + if (!is.get(c) || !isHex(c)) throw DataFormatException("Escape format exception");
1.129 + else if (code = valueHex(c), !is.get(c) || !isHex(c)) is.putback(c);
1.130 + else code = code * 16 + valueHex(c);
1.131 + return code;
1.132 + }
1.133 + default:
1.134 + {
1.135 + int code;
1.136 + if (!isOct(c)) throw DataFormatException("Escape format exception");
1.137 + else if (code = valueOct(c), !is.get(c) || !isOct(c)) is.putback(c);
1.138 + else if (code = code * 8 + valueOct(c), !is.get(c) || !isOct(c)) is.putback(c);
1.139 + else code = code * 8 + valueOct(c);
1.140 + return code;
1.141 + }
1.142 + }
1.143 + }
1.144 +
1.145 + static bool isOct(char c) {
1.146 + return '0' <= c && c <='7';
1.147 + }
1.148 +
1.149 + static int valueOct(char c) {
1.150 + return c - '0';
1.151 + }
1.152 +
1.153 + static bool isHex(char c) {
1.154 + return ('0' <= c && c <= '9') || ('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z');
1.155 + }
1.156 +
1.157 + static int valueHex(char c) {
1.158 + if ('0' <= c && c <= '9') return c - '0';
1.159 + if ('a' <= c && c <= 'z') return c - 'a' + 10;
1.160 + return c - 'A' + 10;
1.161 + }
1.162 +
1.163 + bool escaped;
1.164 };
1.165
1.166 - class FileReaderException {
1.167 - virtual int getLine() = 0;
1.168 - };
1.169
1.170 -
1.171 +
1.172 +
1.173 +
1.174 + // Graph reader
1.175
1.176 template <typename _Graph, typename _ReaderTraits = DefaultReaderTraits>
1.177 class GraphReader {
1.178 @@ -78,83 +179,162 @@
1.179 typedef typename Graph::Edge Edge;
1.180
1.181 typedef _ReaderTraits ReaderTraits;
1.182 -
1.183 + typedef typename ReaderTraits::DefaultReader DefaultReader;
1.184
1.185 - GraphReader(std::istream& _is, Graph& _graph) : is(_is), graph(_graph) {}
1.186 + GraphReader(istream& _is, Graph& _graph, const DefaultReader& _reader = DefaultReader())
1.187 + : is(_is), graph(_graph), nodeSkipper(_reader), edgeSkipper(_reader) {}
1.188 +
1.189 +
1.190 + ~GraphReader() {
1.191 +
1.192 + for (typename NodeReaders::iterator it = node_readers.begin(); it != node_readers.end(); ++it) {
1.193 + delete it->second;
1.194 + }
1.195 +
1.196 + for (typename EdgeReaders::iterator it = edge_readers.begin(); it != edge_readers.end(); ++it) {
1.197 + delete it->second;
1.198 + }
1.199 +
1.200 + }
1.201
1.202 template <typename Map>
1.203 - GraphReader& readNodeMap(std::string name, Map& map,
1.204 - const typename ReaderTraits::template Reader<typename Map::Value>& reader =
1.205 - typename ReaderTraits::template Reader<typename Map::Value>()) {
1.206 - return readNodeMap<Map, typename ReaderTraits::template Reader<typename Map::Value> >(name, map, reader);
1.207 + GraphReader& readNodeMap(std::string name, Map& map) {
1.208 + return readNodeMap<typename ReaderTraits::template Reader<typename Map::Value>, Map>(name, map);
1.209 }
1.210
1.211 - template <typename Map, typename Reader>
1.212 + template <typename Reader, typename Map>
1.213 GraphReader& readNodeMap(std::string name, Map& map, const Reader& reader = Reader()) {
1.214 + if (node_readers.find(name) != node_readers.end()) {
1.215 + Exception e;
1.216 + e << "Multiple read rule for node map: " << name;
1.217 + throw e;
1.218 + }
1.219 node_readers.insert(make_pair(name, new MapReader<Node, Map, Reader>(map, reader)));
1.220 return *this;
1.221 }
1.222
1.223 - template <typename Map>
1.224 - GraphReader& readEdgeMap(std::string name, Map& map,
1.225 - const typename ReaderTraits::template Reader<typename Map::Value>& reader =
1.226 - typename ReaderTraits::template Reader<typename Map::Value>()) {
1.227 - return readEdgeMap<Map, typename ReaderTraits::template Reader<typename Map::Value> >(name, map, reader);
1.228 + template <typename Reader>
1.229 + GraphReader& skipNodeMap(std::string name, const Reader& reader = Reader()) {
1.230 + if (node_readers.find(name) != node_readers.end()) {
1.231 + Exception e;
1.232 + e << "Multiple read rule for node map: " << name;
1.233 + throw e;
1.234 + }
1.235 + node_readers.insert(make_pair(name, new SkipReader<Node, Reader>(reader)));
1.236 + return *this;
1.237 }
1.238
1.239 - template <typename Map, typename Reader>
1.240 + template <typename Map>
1.241 + GraphReader& readEdgeMap(std::string name, Map& map) {
1.242 + return readEdgeMap<typename ReaderTraits::template Reader<typename Map::Value>, Map>(name, map);
1.243 + }
1.244 +
1.245 +
1.246 + template <typename Reader, typename Map>
1.247 GraphReader& readEdgeMap(std::string name, Map& map, const Reader& reader = Reader()) {
1.248 + if (edge_readers.find(name) != edge_readers.end()) {
1.249 + Exception e;
1.250 + e << "Multiple read rule for edge map: " << name;
1.251 + throw e;
1.252 + }
1.253 edge_readers.insert(make_pair(name, new MapReader<Edge, Map, Reader>(map, reader)));
1.254 return *this;
1.255 }
1.256
1.257 + template <typename Reader>
1.258 + GraphReader& skipEdgeMap(std::string name, const Reader& reader = Reader()) {
1.259 + if (edge_readers.find(name) != edge_readers.end()) {
1.260 + Exception e;
1.261 + e << "Multiple read rule for edge map: " << name;
1.262 + throw e;
1.263 + }
1.264 + edge_readers.insert(make_pair(name, new SkipReader<Edge, Reader>(reader)));
1.265 + return *this;
1.266 + }
1.267 +
1.268 void read() {
1.269 int line_num = 0;
1.270 - readNodeSet(line_num);
1.271 - readEdgeSet(line_num);
1.272 - {
1.273 - std::string line = readNotEmptyLine(is, line_num);
1.274 - }
1.275 + InverterBase<Node>* nodeInverter = 0;
1.276 + InverterBase<Edge>* edgeInverter = 0;
1.277 + // \todo delete the inverters
1.278 + // try {
1.279 + {
1.280 + std::string line = readNotEmptyLine(is, line_num);
1.281 + }
1.282 + readNodeSet(line_num, nodeInverter);
1.283 + readEdgeSet(line_num, edgeInverter, nodeInverter);
1.284 + // } catch (...){
1.285 + if (nodeInverter != 0) delete nodeInverter;
1.286 + if (edgeInverter != 0) delete edgeInverter;
1.287 + // }
1.288 }
1.289
1.290 private:
1.291
1.292 - void readNodeSet(int& line_num) {
1.293 + template <typename Item> class InverterBase;
1.294 + // template <typename Item> class InverterBase;
1.295 +
1.296 + void readNodeSet(int& line_num, InverterBase<Node>* & nodeInverter) {
1.297 int n = 0;
1.298 - {
1.299 - std::string line = readNotEmptyLine(is, line_num);
1.300 - }
1.301 - std::vector<MapReaderBase<Node>*> index;
1.302 + std::vector<ReaderBase<Node>*> index;
1.303 {
1.304 std::string line = readNotEmptyLine(is, line_num);
1.305 std::string id;
1.306 std::istringstream ls(line);
1.307 while (ls >> id) {
1.308 - typename map<std::string, MapReaderBase<Node>* >::iterator it = node_readers.find(id);
1.309 + if (id[0] == '#') break;
1.310 + typename NodeReaders::iterator it = node_readers.find(id);
1.311 if (it != node_readers.end()) {
1.312 index.push_back(it->second);
1.313 } else {
1.314 - index.push_back(0);
1.315 + index.push_back(&nodeSkipper);
1.316 }
1.317 ++n;
1.318 }
1.319 }
1.320 +
1.321 + nodeInverter = index[0]->getInverter();
1.322 std::string line;
1.323 while (line = readNotEmptyLine(is, line_num), line[0] != '@') {
1.324 Node node = graph.addNode();
1.325 std::istringstream ls(line);
1.326 - for (int i = 0; i < n; ++i) {
1.327 - if (index[i] != 0) {
1.328 - index[i]->read(ls, node);
1.329 - } else {
1.330 - default_skipper.read(ls);
1.331 - }
1.332 + nodeInverter->read(ls, node);
1.333 + for (int i = 1; i < n; ++i) {
1.334 + index[i]->read(ls, node);
1.335 }
1.336 }
1.337 }
1.338
1.339 - void readEdgeSet(int& line_num) {
1.340 -
1.341 + void readEdgeSet(int& line_num, InverterBase<Edge>* & edgeInverter, InverterBase<Node>* & nodeInverter) {
1.342 + int n = 0;
1.343 + std::vector<ReaderBase<Edge>*> index;
1.344 + {
1.345 + std::string line = readNotEmptyLine(is, line_num);
1.346 + std::string id;
1.347 + std::istringstream ls(line);
1.348 + while (ls >> id) {
1.349 + if (id[0] == '#') break;
1.350 + typename EdgeReaders::iterator it = edge_readers.find(id);
1.351 + if (it != edge_readers.end()) {
1.352 + index.push_back(it->second);
1.353 + } else {
1.354 + index.push_back(&edgeSkipper);
1.355 + }
1.356 + ++n;
1.357 + }
1.358 + }
1.359 + edgeInverter = index[0]->getInverter();
1.360 + std::string line;
1.361 + while (line = readNotEmptyLine(is, line_num), line[0] != '@') {
1.362 + std::istringstream ls(line);
1.363 + Node source = nodeInverter->read(ls);
1.364 + Node target = nodeInverter->read(ls);
1.365 + Edge edge = graph.addEdge(source, target);
1.366 + edgeInverter->read(ls, edge);
1.367 + for (int i = 1; i < n; ++i) {
1.368 + index[i]->read(ls, edge);
1.369 + }
1.370 + }
1.371 }
1.372
1.373 std::string readNotEmptyLine(std::istream& is, int& line_num) {
1.374 @@ -168,23 +348,107 @@
1.375 throw Exception();
1.376 }
1.377
1.378 - istream& is;
1.379 - Graph& graph;
1.380 + template <typename _Item>
1.381 + class InverterBase {
1.382 + public:
1.383 + typedef _Item Item;
1.384 + virtual void read(istream&, const Item&) = 0;
1.385 + virtual Item read(istream&) = 0;
1.386 + };
1.387
1.388 - typename ReaderTraits::DefaultSkipper default_skipper;
1.389 + template <typename _Item, typename _Map, typename _Reader>
1.390 + class MapReaderInverter : public InverterBase<_Item> {
1.391 + public:
1.392 + typedef _Item Item;
1.393 + typedef _Reader Reader;
1.394 + typedef typename Reader::Value Value;
1.395 + typedef _Map Map;
1.396 + typedef std::map<Value, Item> Inverse;
1.397 +
1.398 + Map& map;
1.399 + Reader reader;
1.400 + Inverse inverse;
1.401 +
1.402 + MapReaderInverter(Map& _map, const Reader& _reader)
1.403 + : map(_map), reader(_reader) {}
1.404 +
1.405 + virtual void read(istream& is, const Item& item) {
1.406 + Value value;
1.407 + reader.read(is, value);
1.408 + map.set(item, value);
1.409 + typename Inverse::iterator it = inverse.find(value);
1.410 + if (it == inverse.end()) {
1.411 + inverse.insert(make_pair(value, item));
1.412 + } else {
1.413 + throw DataFormatException("Multiple ID occurence");
1.414 + }
1.415 + }
1.416 +
1.417 + virtual Item read(istream& is) {
1.418 + Value value;
1.419 + reader.read(is, value);
1.420 + typename Inverse::const_iterator it = inverse.find(value);
1.421 + if (it != inverse.end()) {
1.422 + return it->second;
1.423 + } else {
1.424 + throw DataFormatException("Invalid ID");
1.425 + }
1.426 + }
1.427 + };
1.428 +
1.429 + template <typename _Item, typename _Reader>
1.430 + class SkipReaderInverter : public InverterBase<_Item> {
1.431 + public:
1.432 + typedef _Item Item;
1.433 + typedef _Reader Reader;
1.434 + typedef typename Reader::Value Value;
1.435 + typedef std::map<Value, Item> Inverse;
1.436 +
1.437 + Reader reader;
1.438 +
1.439 + SkipReaderInverter(const Reader& _reader)
1.440 + : reader(_reader) {}
1.441 +
1.442 + virtual void read(istream& is, const Item& item) {
1.443 + Value value;
1.444 + reader.read(is, value);
1.445 + typename Inverse::iterator it = inverse.find(value);
1.446 + if (it == inverse.end()) {
1.447 + inverse.insert(make_pair(value, item));
1.448 + } else {
1.449 + throw DataFormatException("Multiple ID occurence");
1.450 + }
1.451 + }
1.452 +
1.453 + virtual Item read(istream& is) {
1.454 + Value value;
1.455 + reader.read(is, value);
1.456 + typename Inverse::const_iterator it = inverse.find(value);
1.457 + if (it != inverse.end()) {
1.458 + return it->second;
1.459 + } else {
1.460 + throw DataFormatException("Invalid ID");
1.461 + }
1.462 + }
1.463 + private:
1.464 + Inverse inverse;
1.465 + };
1.466 +
1.467
1.468 template <typename _Item>
1.469 - class MapReaderBase {
1.470 + class ReaderBase {
1.471 public:
1.472 typedef _Item Item;
1.473 virtual void read(istream& is, const Item& item) = 0;
1.474 + virtual InverterBase<_Item>* getInverter() = 0;
1.475 };
1.476 -
1.477 +
1.478 template <typename _Item, typename _Map, typename _Reader>
1.479 - class MapReader : public MapReaderBase<_Item> {
1.480 + class MapReader : public ReaderBase<_Item> {
1.481 public:
1.482 typedef _Map Map;
1.483 typedef _Reader Reader;
1.484 + typedef typename Reader::Value Value;
1.485 typedef _Item Item;
1.486
1.487 Map& map;
1.488 @@ -195,18 +459,50 @@
1.489
1.490
1.491 virtual void read(istream& is, const Item& item) {
1.492 - typename Reader::Value value;
1.493 + Value value;
1.494 reader.read(is, value);
1.495 map.set(item, value);
1.496 }
1.497 +
1.498 + virtual InverterBase<_Item>* getInverter() {
1.499 + return new MapReaderInverter<Item, Map, Reader>(map, reader);
1.500 + }
1.501 };
1.502
1.503 - typedef std::map<std::string, MapReaderBase<Node>* > NodeReaders;
1.504 +
1.505 + template <typename _Item, typename _Reader>
1.506 + class SkipReader : public ReaderBase<_Item> {
1.507 + public:
1.508 + typedef _Reader Reader;
1.509 + typedef typename Reader::Value Value;
1.510 + typedef _Item Item;
1.511 +
1.512 + Reader reader;
1.513 + SkipReader(const Reader& _reader) : reader(_reader) {}
1.514 +
1.515 + virtual void read(istream& is, const Item& item) {
1.516 + Value value;
1.517 + reader.read(is, value);
1.518 + }
1.519 +
1.520 + virtual InverterBase<Item>* getInverter() {
1.521 + return new SkipReaderInverter<Item, Reader>(reader);
1.522 + }
1.523 + };
1.524 +
1.525 +
1.526 + typedef std::map<std::string, ReaderBase<Node>* > NodeReaders;
1.527 NodeReaders node_readers;
1.528
1.529 - typedef std::map<std::string, MapReaderBase<Edge>* > EdgeReaders;
1.530 + typedef std::map<std::string, ReaderBase<Edge>* > EdgeReaders;
1.531 EdgeReaders edge_readers;
1.532
1.533 + std::istream& is;
1.534 + Graph& graph;
1.535 +
1.536 + SkipReader<Node, DefaultReader> nodeSkipper;
1.537 + SkipReader<Edge, DefaultReader> edgeSkipper;
1.538 +
1.539 };
1.540
1.541 }