# HG changeset patch # User alpar # Date 1112275827 0 # Node ID 81e89e2b90d11f5e090cd9469374971aaa8f0dac # Parent 164ca6938d092ec15d9439071805adccd799621e length() returns int istead of size_t diff -r 164ca6938d09 -r 81e89e2b90d1 src/lemon/concept/path.h --- a/src/lemon/concept/path.h Thu Mar 31 13:29:05 2005 +0000 +++ b/src/lemon/concept/path.h Thu Mar 31 13:30:27 2005 +0000 @@ -57,7 +57,7 @@ Path(const Graph &_G) {} /// Length of the path. - size_t length() const {return 0;} + int length() const {return 0;} /// Returns whether the path is empty. bool empty() const { return true;} diff -r 164ca6938d09 -r 81e89e2b90d1 src/lemon/path.h --- a/src/lemon/path.h Thu Mar 31 13:29:05 2005 +0000 +++ b/src/lemon/path.h Thu Mar 31 13:30:27 2005 +0000 @@ -102,7 +102,7 @@ } /// Length of the path. - size_t length() const { return edges.size(); } + int length() const { return edges.size(); } /// Returns whether the path is empty. bool empty() const { return edges.empty(); } @@ -197,9 +197,7 @@ bool operator<(const EdgeIt& e) const { return idx= p->length() ) idx=-1; } + void validate() { if(idx >= p->length() ) idx=-1; } }; /** @@ -247,7 +245,7 @@ bool operator<(const NodeIt& e) const { return idx p->length() ) idx=-1; } + void validate() { if(idx > p->length() ) idx=-1; } }; friend class Builder;