Changeset 336:8ff3b3e05478 in lemon-0.x for src

Timestamp:

04/16/04 14:13:07 (21 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

 

Location:

src/work/deba

Files:

• edge_map_base.h (modified) (2 diffs)
• node_map_base.h (modified) (2 diffs)

src/work/deba/edge_map_base.h

@@ -6 +6 @@
 public:
         typedef G Graph;
+
         typedef K KeyType;
         
+        EdgeMapBase() : graph(0) {}
+        EdgeMapBase(Graph& g) : graph(&g) {
+                graph->edge_maps.add(*this);
+        }
 
-        MapBase() : graph(0) {}
-        MapBase(Graph& g) : graph(&g) {graph.edge_maps.add(*this);}
-
-        virtual ~MapBase() {graph.edge_maps.erase(*this);}      
-
+        virtual ~EdgeMapBase() {
+                if (graph) {
+                        graph.edge_maps.erase(*this);
+                }
+        }
+        
 protected:
         
@@ -20 +26 @@
         int graph_index;
         
+        void init() {
+                for (Graph::EdgeIt it(g); g.valid(it); g.next(it)) {
+                        add(it);
+                }
+        }
+        
+        void destroy() {
+                for (Graph::EdgeIt it(g); g.valid(it); g.next(it)) {
+                        erase(it);
+                }
+        }
         
         virtual void add(const KeyType&) = 0;

src/work/deba/node_map_base.h

@@ -9 +9 @@
         typedef K KeyType;
         
+        NodeMapBase() : graph(0) {}
+        NodeMapBase(Graph& g) : graph(&g) {
+                graph->node_maps.add(*this);
+        }
 
-        MapBase() : graph(0) {}
-        MapBase(Graph& g) : graph(&g) {graph.node_maps.add(*this);}
-
-        virtual ~MapBase() {graph.node_maps.erase(*this);}      
-
+        virtual ~NodeMapBase() {
+                if (graph) {
+                        graph.node_maps.erase(*this);
+                }
+        }
+        
 protected:
         
@@ -21 +26 @@
         int graph_index;
         
+        void init() {
+                for (Graph::NodeIt it(g); g.valid(it); g.next(it)) {
+                        add(it);
+                }
+        }
+        
+        void destroy() {
+                for (Graph::NodeIt it(g); g.valid(it); g.next(it)) {
+                        erase(it);
+                }
+        }
         
         virtual void add(const KeyType&) = 0;