Changeset 1208:f486d30e4e7b in lemon-0.x for src/lemon/graph_reader.h

Timestamp:

03/09/05 15:15:22 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1627

Message:

Easy input-output function for common graphs.
Modified Exception handling in graph_reader.

File:

• src/lemon/graph_reader.h (modified) (22 diffs)

src/lemon/graph_reader.h

@@ -36 +36 @@
   // Exceptions
 
-  class IOException {
-  public:
-    virtual ~IOException() {}
-    virtual string what() const = 0;
-  };
-
-  class DataFormatException : public IOException {
-    std::string message;
-  public:
-    DataFormatException(const std::string& _message) 
-      : message(_message) {}
-    std::string what() const {
-      return "DataFormatException: " + message; 
-    }
-  };
-
-  template <typename _Exception>
-  class StreamException : public _Exception {
-  public:
-    typedef _Exception Exception;
-    StreamException(int _line, Exception _exception) 
-      : Exception(_exception), line_num(_line) {}
-    virtual int line() const {
-      return line_num;
-    }
-
-    virtual ~StreamException() {}
-
-    virtual std::string what() const {
-      ostringstream os;
-      os << Exception::what() << " in line " << line();
-      return os.str();
-    }
-  private:
-    int line_num;
-  };  
-
 
   /// \brief Standard ReaderTraits for the GraphReader class.
@@ -92 +55 @@
       void read(std::istream& is, Value& value) {
         if (!(is >> value)) 
-          throw DataFormatException("Default Reader format exception");
+          throw DataFormatError("Default reader format exception");
       }
     };
@@ -123 +86 @@
       is >> ws;
       if (!is.get(c) || c != '\"') 
-        throw DataFormatException("Quoted string format");
+        throw DataFormatError("Quoted string format error");
       while (is.get(c) && c != '\"') {
         if (escaped && c == '\\') {
@@ -131 +94 @@
         }
       }
-      if (!is) throw DataFormatException("Quoted string format");
+      if (!is) throw DataFormatError("Quoted string format error");
     }
 
@@ -165 +128 @@
           int code;
           if (!is.get(c) || !isHex(c)) 
-            throw DataFormatException("Escape format exception");
+            throw DataFormatError("Escape format error");
           else if (code = valueHex(c), !is.get(c) || !isHex(c)) is.putback(c);
           else code = code * 16 + valueHex(c);
@@ -174 +137 @@
           int code;
           if (!isOct(c)) 
-            throw DataFormatException("Escape format exception");
+            throw DataFormatError("Escape format error");
           else if (code = valueOct(c), !is.get(c) || !isOct(c)) 
             is.putback(c);
@@ -226 +189 @@
     /// \brief Construct a new GraphReader.
     ///
-    /// Construct a new GraphReader. It reads from the given map,
-    /// it constructs the given map and it use the given reader as the
-    /// default skipper.
+    /// Construct a new GraphReader. It reads into the given graph
+    /// and it use the given reader as the default skipper.
     GraphReader(std::istream& _is, Graph& _graph, 
                 const DefaultReader& _reader = DefaultReader()) 
@@ -266 +228 @@
                              const Reader& reader = Reader()) {
       if (node_map_readers.find(name) != node_map_readers.end()) {
-        throw Exception() << "Multiple read rule for node map: " << name;
+        ErrorMessage msg;
+        msg << "Multiple read rule for node map: " << name;
+        throw IOLogicError(msg.message());
       }
       node_map_readers.insert(
@@ -280 +244 @@
                              const Reader& reader = Reader()) {
       if (node_map_readers.find(name) != node_map_readers.end()) {
-        throw Exception() << "Multiple read rule for node map: " << name;
+        ErrorMessage msg;
+        msg << "Multiple read rule for node map: " << name;
+        throw IOLogicError(msg.message());
       }
       node_map_readers.insert(
@@ -304 +270 @@
                              const Reader& reader = Reader()) {
       if (edge_map_readers.find(name) != edge_map_readers.end()) {
-        throw Exception() << "Multiple read rule for edge map: " << name;
+        ErrorMessage msg;
+        msg << "Multiple read rule for edge map: " << name;
+        throw IOLogicError(msg.message());
       }
       edge_map_readers.insert(
@@ -318 +286 @@
                              const Reader& reader = Reader()) {
       if (edge_map_readers.find(name) != edge_map_readers.end()) {
-        throw Exception() << "Multiple read rule for edge map: " << name;
+        ErrorMessage msg;
+        msg << "Multiple read rule for edge map: " << name;
+        throw IOLogicError(msg.message());
       }
       edge_map_readers.insert(
@@ -330 +300 @@
     GraphReader& addNode(std::string name, Node& node) {
       if (node_readers.find(name) != node_readers.end()) {
-        throw Exception() << "Multiple read rule for node";
+        ErrorMessage msg;
+        msg << "Multiple read rule for node: " << name;
+        throw IOLogicError(msg.message());
       }
       node_readers.insert(make_pair(name, &node));
@@ -341 +313 @@
     GraphReader& addEdge(std::string name, Edge& edge) {
       if (edge_readers.find(name) != edge_readers.end()) {
-        throw Exception() << "Multiple read rule for edge";
+        ErrorMessage msg;
+        msg << "Multiple read rule for edge: " << name;
+        throw IOLogicError(msg.message());
       }
       edge_readers.insert(make_pair(name, &edge));
@@ -369 +343 @@
         }
         if (line.find("@end") != 0) {
-          throw DataFormatException("Invalid control sequence: " + line);
-        }
-      } catch (DataFormatException e) {
-        throw StreamException<DataFormatException>(line_num, e);
+          throw DataFormatError("Invalid control sequence error");
+        }
+      } catch (DataFormatError e) {
+        e.line(line_num);
+        throw e;
       }
     }
@@ -400 +375 @@
 
       if (index.size() == 0) {
-        throw DataFormatException("No node map found");
+        throw DataFormatError("Cannot find node id map");
       }
 
@@ -437 +412 @@
 
       if (index.size() == 0) {
-        throw DataFormatException("No edge map found");
+        throw DataFormatError("Cannot find edge id map");
       }
 
@@ -493 +468 @@
         }
       }
-      throw DataFormatException("End of stream");
+      throw DataFormatError("End of stream error");
     }
     
@@ -533 +508 @@
           inverse.insert(make_pair(value, item));
         } else {
-          throw DataFormatException("Multiple ID occurence");
+          throw DataFormatError("Multiple ID occurence");
         }
       }
@@ -544 +519 @@
           return it->second;
         } else {
-          throw DataFormatException("Invalid ID");
+          throw DataFormatError("Invalid ID error");
         }
       }      
@@ -571 +546 @@
           inverse.insert(make_pair(value, item));
         } else {
-          throw DataFormatException("Multiple ID occurence");
+          throw DataFormatError("Multiple ID occurence error");
         }
       }
@@ -582 +557 @@
           return it->second;
         } else {
-          throw DataFormatException("Invalid ID");
+          throw DataFormatError("Invalid ID error");
         }
       }      
@@ -673 +648 @@
   };
 
+  /// Ready to use reader function.  
+  template<typename Graph, typename CapacityMap, typename CostMap>
+  void readGraph(std::istream& is, Graph &g, CapacityMap& capacity, 
+                  typename Graph::Node &s, typename Graph::Node &t, 
+                  CostMap& cost) {
+    GraphReader<Graph> reader(is, g);
+    reader.addEdgeMap("capacity", capacity);
+    reader.addEdgeMap("cost", cost);
+    reader.addNode("source", s);
+    reader.addNode("target", t);
+    reader.run();
+  }
+
+  template<typename Graph, typename CapacityMap>
+  void readGraph(std::istream& is, Graph &g, CapacityMap& capacity, 
+                  typename Graph::Node &s, typename Graph::Node &t) {
+    GraphReader<Graph> reader(is, g);
+    reader.addEdgeMap("capacity", capacity);
+    reader.addNode("source", s);
+    reader.addNode("target", t);
+    reader.run();
+  }
+
+  template<typename Graph, typename CapacityMap>
+  void readGraph(std::istream& is, Graph &g, CapacityMap& capacity, 
+                  typename Graph::Node &s) {
+    GraphReader<Graph> reader(is, g);
+    reader.addEdgeMap("capacity", capacity);
+    reader.addNode("source", s);
+    reader.run();
+  }
+
+  template<typename Graph, typename CapacityMap>
+  void readGraph(std::istream& is, Graph &g, CapacityMap& capacity) {
+    GraphReader<Graph> reader(is, g);
+    reader.addEdgeMap("capacity", capacity);
+    reader.run();
+  }
+
+  template<typename Graph>
+  void readGraph(std::istream& is, Graph &g) {
+    GraphReader<Graph> reader(is, g);
+    reader.run();
+  }
+
 }