1.1 --- a/src/hugo/skeletons/path.h	Wed Sep 08 12:06:45 2004 +0000
     1.2 +++ b/src/hugo/skeletons/path.h	Wed Sep 08 12:12:16 2004 +0000
     1.3 @@ -106,9 +106,9 @@
     1.4  	EdgeIt& operator++() {}
     1.5  
     1.6  	/// Comparison operator
     1.7 -	bool operator==(const EdgeIt& e) const {}
     1.8 +	bool operator==(const EdgeIt& e) const {return true;}
     1.9  	/// Comparison operator
    1.10 -	bool operator!=(const EdgeIt& e) const {}
    1.11 +	bool operator!=(const EdgeIt& e) const {return true;}
    1.12  // 	/// Comparison operator
    1.13  //      /// \todo It is not clear what is the "natural" ordering.
    1.14  // 	bool operator<(const EdgeIt& e) const {}

     2.1 --- a/src/test/path_test.cc	Wed Sep 08 12:06:45 2004 +0000
     2.2 +++ b/src/test/path_test.cc	Wed Sep 08 12:12:16 2004 +0000
     2.3 @@ -142,6 +142,7 @@
     2.4        check(P.to() == v3);
     2.5  #endif
     2.6  
     2.7 +#ifndef SKELETON
     2.8        cout << "Vegigiteralunk az eleken." << endl;
     2.9        typedef DPath::NodeIt NodeIt;
    2.10        typedef DPath::EdgeIt EdgeIt;
    2.11 @@ -150,7 +151,7 @@
    2.12        for(P.first(e); e!=INVALID; ++e, ++i) {
    2.13  	cout << i << ". el: " <</* e << */endl;
    2.14        }
    2.15 -
    2.16 +#endif
    2.17  
    2.18        // Na ja, ez igy nem igazi, mindket esetet le kene tesztelni,
    2.19        // de legalabb valami: