Changeset 834:1dd3167db044 in lemon-0.x for src/hugo

Timestamp:

09/13/04 12:50:30 (20 years ago)

Author:

Hegyi Péter

Branch:

default

Phase:

public

Convert:

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

Message:

There is no runtime debug in path.h

File:

• src/hugo/path.h (modified) (18 diffs)

src/hugo/path.h

@@ -29 +29 @@
 
 #include <hugo/invalid.h>
-#include <hugo/error.h>
-//#include <hugo/debug.h>
 
 namespace hugo {
@@ -75 +73 @@
     /// \warning It is an error if the two edges are not in order!
     DirPath(const DirPath &P, const NodeIt &a, const NodeIt &b) {
-      if(!a.valid() || !b.valid) {
-        // FIXME: this check should be more elaborate...
-        fault("DirPath, subpath ctor: invalid bounding nodes");
-      }
       gr = P.gr;
       edges.insert(edges.end(), P.edges.begin()+a.idx, P.edges.begin()+b.idx);
@@ -88 +82 @@
     /// \warning It is an error if the two edges are not in order!
     DirPath(const DirPath &P, const EdgeIt &a, const EdgeIt &b) {
-      if (!a.valid() || !b.valid) {
-        // FIXME: this check should be more elaborate...
-        fault("DirPath, subpath ctor: invalid bounding nodes");
-      }
       gr = P.gr;
       edges.insert(edges.end(), P.edges.begin()+a.idx, P.edges.begin()+b.idx);
@@ -128 +118 @@
     /// \brief Initializes node iterator to point to the node of a given index.
     NodeIt& nth(NodeIt &i, int n) const {
-      if(n<0 || n>int(length())) 
-        fault("DirPath::nth: index out of range");
       return i=NodeIt(*this, n);
     }
@@ -135 +123 @@
     /// \brief Initializes edge iterator to point to the edge of a given index.
     EdgeIt& nth(EdgeIt &i, int n) const {
-      if(n<0 || n>=int(length())) 
-        fault("DirPath::nth: index out of range");
       return i=EdgeIt(*this, n);
     }
@@ -149 +135 @@
     static
     It& next(It &e) {
-      if( !e.valid() )
-        fault("DirPath::next() on invalid iterator");
       return ++e;
     }
@@ -157 +141 @@
     /// given edge iterator.
     NodeIt head(const EdgeIt& e) const {
-      if( !e.valid() )
-        fault("DirPath::head() on invalid iterator");
       return NodeIt(*this, e.idx+1);
     }
@@ -165 +147 @@
     /// given edge iterator.
     NodeIt tail(const EdgeIt& e) const {
-      if( !e.valid() )
-        fault("DirPath::tail() on invalid iterator");
       return NodeIt(*this, e.idx);
     }
@@ -313 +293 @@
       ///\sa setStartNode
       void pushFront(const GraphEdge& e) {
-        if( !empty() && P.gr->head(e)!=tail() ) {
-          fault("DirPath::Builder::pushFront: nonincident edge");
-        }
         front.push_back(e);
       }
@@ -324 +301 @@
       ///\sa setStartNode
       void pushBack(const GraphEdge& e) {
-        if( !empty() && P.gr->tail(e)!=head() ) {
-          fault("DirPath::Builder::pushBack: nonincident edge");
-        }
         back.push_back(e);
       }
@@ -441 +415 @@
     /// \warning It is an error if the two edges are not in order!
     UndirPath(const UndirPath &P, const NodeIt &a, const NodeIt &b) {
-      if(!a.valid() || !b.valid) {
-        // FIXME: this check should be more elaborate...
-        fault("UndirPath, subpath ctor: invalid bounding nodes");
-      }
       gr = P.gr;
       edges.insert(edges.end(), P.edges.begin()+a.idx, P.edges.begin()+b.idx);
@@ -454 +424 @@
     /// \warning It is an error if the two edges are not in order!
     UndirPath(const UndirPath &P, const EdgeIt &a, const EdgeIt &b) {
-      if(!a.valid() || !b.valid) {
-        // FIXME: this check should be more elaborate...
-        fault("UndirPath, subpath ctor: invalid bounding nodes");
-      }
       gr = P.gr;
       edges.insert(edges.end(), P.edges.begin()+a.idx, P.edges.begin()+b.idx);
@@ -494 +460 @@
     /// \brief Initializes node iterator to point to the node of a given index.
     NodeIt& nth(NodeIt &i, int n) const {
-      if(n<0 || n>int(length()))
-        fault("UndirPath::nth: index out of range");
       return i=NodeIt(*this, n);
     }
@@ -501 +465 @@
     /// \brief Initializes edge iterator to point to the edge of a given index.
     EdgeIt& nth(EdgeIt &i, int n) const {
-      if(n<0 || n>=int(length()))
-        fault("UndirPath::nth: index out of range");
       return i=EdgeIt(*this, n);
     }
@@ -515 +477 @@
     static
     It& next(It &e) {
-      if( !e.valid() )
-        fault("UndirPath::next() on invalid iterator");
       return ++e;
     }
@@ -523 +483 @@
     /// given edge iterator.
     NodeIt head(const EdgeIt& e) const {
-      if( !e.valid() )
-        fault("UndirPath::head() on invalid iterator");
       return NodeIt(*this, e.idx+1);
     }
@@ -531 +489 @@
     /// given edge iterator.
     NodeIt tail(const EdgeIt& e) const {
-      if( !e.valid() )
-        fault("UndirPath::tail() on invalid iterator");
       return NodeIt(*this, e.idx);
     }
@@ -677 +633 @@
       ///\sa setStartNode
       void pushFront(const GraphEdge& e) {
-        if( !empty() && P.gr->head(e)!=tail() ) {
-          fault("UndirPath::Builder::pushFront: nonincident edge");
-        }
         front.push_back(e);
       }