Changeset 69:24c2c2989e0f in lemon-0.x for src/work/list_graph.hh

Timestamp:

02/09/04 14:11:10 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

.

File:

• src/work/list_graph.hh (modified) (2 diffs)

src/work/list_graph.hh

@@ -27 +27 @@
     class InEdgeIt;
     class SymEdgeIt;
-    template <typename ValueType> class NodeMap;
-    template <typename ValueType> class EdgeMap;
+    template <typename T> class NodeMap;
+    template <typename T> class EdgeMap;
     
   private:
     
-    template <typename ValueType> friend class NodeMap;
-    template <typename ValueType> friend class EdgeMap;
-
-    template <typename ValueType>
+    template <typename T> friend class NodeMap;
+    template <typename T> friend class EdgeMap;
+
+    template <typename T>
     class NodeMap {
       const ListGraph& G; 
-      std::vector<ValueType> container;
-    public:
-      NodeMap(const ListGraph& _G) : G(_G), container(_G.node_id) { }
-      NodeMap(const ListGraph& _G, ValueType a) : 
-        G(_G), container(_G.node_id, a) { }
-      void set(NodeIt nit, ValueType a) { container[G.id(nit)]=a; }
-      ValueType get(NodeIt nit) const { return container[G.id(nit)]; }
-    };
-
-    template <typename ValueType>
+      std::vector<T> container;
+    public:
+      typedef T ValueType;
+      typedef NodeIt KeyType;
+      NodeMap(const ListGraph& _G) : G(_G), container(G.node_id) { }
+      NodeMap(const ListGraph& _G, T a) : 
+        G(_G), container(G.node_id, a) { }
+      void set(NodeIt nit, T a) { container[G.id(nit)]=a; }
+      T get(NodeIt nit) const { return container[G.id(nit)]; }
+      void resize() { container.resize(G.node_id); }
+      void resize(T a) { container.resize(G.node_id, a); }
+    };
+
+    template <typename T>
     class EdgeMap {
       const ListGraph& G; 
-      std::vector<ValueType> container;
-    public:
-      EdgeMap(const ListGraph& _G) : G(_G), container(_G.edge_id) { }
-      EdgeMap(const ListGraph& _G, ValueType a) : 
-        G(_G), container(_G.edge_id, a) { }
-      void set(EdgeIt eit, ValueType a) { container[G.id(eit)]=a; }
-      ValueType get(EdgeIt eit) const { return container[G.id(eit)]; }
+      std::vector<T> container;
+    public:
+      typedef T ValueType;
+      typedef EdgeIt KeyType;
+      EdgeMap(const ListGraph& _G) : G(_G), container(G.edge_id) { }
+      EdgeMap(const ListGraph& _G, T a) : 
+        G(_G), container(G.edge_id, a) { }
+      void set(EdgeIt eit, T a) { container[G.id(eit)]=a; }
+      T get(EdgeIt eit) const { return container[G.id(eit)]; }
+      void resize() { container.resize(G.edge_id); }
+      void resize(T a) { container.resize(G.edge_id, a); }
     };
 
@@ -302 +310 @@
     void erase(EdgeIt e) { _delete_edge(e.edge); }
 
+    void clear() { 
+      while (first<EachNodeIt>().valid()) erase(first<EachNodeIt>());
+    }
+
     void setTail(EdgeIt e, NodeIt tail) {
       _set_tail(e.edge, tail.node);