Changeset 226:616bc397c83a in lemon-0.x for src/work/klao/path_test.cc

Timestamp:

03/21/04 18:09:16 (20 years ago)

Author:

Mihaly Barasz

Branch:

default

Phase:

public

Convert:

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

Message:

Reszutas konstruktorok

File:

• src/work/klao/path_test.cc (modified) (1 diff)

src/work/klao/path_test.cc

@@ -110 +110 @@
   }
 
+  {
+    cout << "Reszut letrehozasa: [2. el, 4. el)..." << endl;
+    LPath P2(P, P.nth<EdgeIt>(1), P.nth<EdgeIt>(3));
+
+    cout << "P2.length() == " << P2.length() << endl;
+    check(P2.length() == 2);
+    
+    cout << "P2.from()==v1 ? " << (P2.from()==v1) << endl;
+    check(P2.from() == v1);
+    cout << "P2.to()==v3 ? " << (P2.to()==v3) << endl;
+    check(P2.to() == v3);
+  }
+  {
+    cout << "Reszut letrehozasa: [1. el, 6. el)..." << endl;
+    LPath P2(P, P.nth<EdgeIt>(0), P.nth<EdgeIt>(5));
+
+    cout << "P2.length() == " << P2.length() << endl;
+    check(P2.length() == 5);
+    
+    cout << "P2.from()==s ? " << (P2.from()==s) << endl;
+    check(P2.from() == s);
+    cout << "P2.to()==t ? " << (P2.to()==t) << endl;
+    check(P2.to() == t);
+  }
+
+  {
+    cout << "Ket pont altal megadott reszut letrehozasa: [2. pont, 4. pont]..."
+         << endl;
+    LPath P2(P, P.nth<NodeIt>(1), P.nth<NodeIt>(3));
+
+    cout << "P2.length() == " << P2.length() << endl;
+    check(P2.length() == 2);
+    
+    cout << "P2.from()==v1 ? " << (P2.from()==v1) << endl;
+    check(P2.from() == v1);
+    cout << "P2.to()==v3 ? " << (P2.to()==v3) << endl;
+    check(P2.to() == v3);
+  }
+  {
+    cout << "Egy pontu reszut letrehozasa: [4. pont, 4. pont]..."
+         << endl;
+    LPath P2(P, P.nth<NodeIt>(3), P.nth<NodeIt>(3));
+
+    cout << "P2.length() == " << P2.length() << endl;
+    check(P2.length() == 0);
+    
+    cout << "P2.from()==v3 ? " << (P2.from()==v3) << endl;
+    check(P2.from() == v3);
+    cout << "P2.to()==v3 ? " << (P2.to()==v3) << endl;
+    check(P2.to() == v3);
+  }
+  {
+    cout << "Forditott ut letrehozasa: [6. pont, 1. pont]..."
+         << endl;
+    LPath P2(P, P.nth<NodeIt>(5), P.nth<NodeIt>(0));
+
+    cout << "P2.length() == " << P2.length() << endl;
+    check(P2.length() == 5);
+    
+    cout << "P2.from()==t ? " << (P2.from()==t) << endl;
+    check(P2.from() == t);
+    cout << "P2.to()==s ? " << (P2.to()==s) << endl;
+    check(P2.to() == s);
+  }