Changeset 16:dd19ef4d7ba4 in lemon-0.x for src/work

Timestamp:

01/16/04 12:21:47 (21 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

* empty log message *

File:

• src/work/marci_list_graph.hh (modified) (4 diffs)

src/work/marci_list_graph.hh

@@ -138 +138 @@
     node_iterator b_node(const sym_edge_iterator& e) { return e.b_node(); }
 
-    node_iterator invalid_node() { return node_iterator(); }
-    edge_iterator invalid_edge() { return edge_iterator(); }
-    out_edge_iterator invalid_out_edge() { return out_edge_iterator(); }
-    in_edge_iterator invalid_in_edge() { return in_edge_iterator(); }
-    sym_edge_iterator invalid_sym_edge() { return sym_edge_iterator(); }
+    //node_iterator invalid_node() { return node_iterator(); }
+    //edge_iterator invalid_edge() { return edge_iterator(); }
+    //out_edge_iterator invalid_out_edge() { return out_edge_iterator(); }
+    //in_edge_iterator invalid_in_edge() { return in_edge_iterator(); }
+    //sym_edge_iterator invalid_sym_edge() { return sym_edge_iterator(); }
 
     /* same methods in other style */
@@ -167 +167 @@
     void get_b_node(node_iterator& n, const in_edge_iterator& e) { n=e.b_node(); }
     void get_b_node(node_iterator& n, const sym_edge_iterator& e) { n=e.b_node(); }
-    void get_invalid(node_iterator& n) { n=node_iterator(); }
-    void get_invalid(edge_iterator& e) { e=edge_iterator(); }
-    void get_invalid(out_edge_iterator& e) { e=out_edge_iterator(); }
-    void get_invalid(in_edge_iterator& e) { e=in_edge_iterator(); }
-    void get_invalid(sym_edge_iterator& e) { e=sym_edge_iterator(); }
+    //void get_invalid(node_iterator& n) { n=node_iterator(); }
+    //void get_invalid(edge_iterator& e) { e=edge_iterator(); }
+    //void get_invalid(out_edge_iterator& e) { e=out_edge_iterator(); }
+    //void get_invalid(in_edge_iterator& e) { e=in_edge_iterator(); }
+    //void get_invalid(sym_edge_iterator& e) { e=sym_edge_iterator(); }
 
 
@@ -211 +211 @@
       node_iterator(node_item* _node) : node(_node) { }
       bool is_valid() { return (node!=0); }
+      void make_invalid() { node=0; }
       friend bool operator==(const node_iterator& u, const node_iterator& v) { 
         return v.node==u.node; 
@@ -240 +241 @@
       edge_iterator(edge_item* _edge) : edge(_edge) { }
       bool is_valid() { return (edge!=0); }
+      void make_invalid() { edge=0; }
       friend bool operator==(const edge_iterator& u, const edge_iterator& v) { 
         return v.edge==u.edge;