Changeset 513:60afd11e6cb3 in lemon-0.x for src/work/athos

Timestamp:

05/03/04 16:42:40 (20 years ago)

Author:

athos

Branch:

default

Phase:

public

Convert:

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

Message:

xy_test added: it was not entirely useless, I found a mistake in xy.h

Location:

src/work/athos

Files:

• minlengthpaths.h (modified) (1 diff)
• minlengthpaths_test.cc (copied) (copied from src/work/athos/suurballe.cc)
• xy/xy.cc (modified) (1 diff)
• xy/xy_test.cc (copied) (copied from src/work/athos/xy/xy.cc) (1 diff)

src/work/athos/minlengthpaths.h

@@ -23 +23 @@
   ///
   /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements
-  /// an algorithm which finds k edge-disjoint paths
+  /// an algorithm for finding k edge-disjoint paths
   /// from a given source node to a given target node in an
   /// edge-weighted directed graph having minimal total weigth (length).

src/work/athos/xy/xy.cc

@@ -1 +1 @@
 #include <xy.h>
 #include <iostream>
+#include <vector>
 using namespace std;
 using namespace hugo;
+
+
 int main()
 {

src/work/athos/xy/xy_test.cc

@@ -3 +3 @@
 using namespace std;
 using namespace hugo;
+
+bool passed = true;
+
+void check(bool rc) {
+  passed = passed && rc;
+  if(!rc) {
+    cout << "Test failed!" << endl;
+  }
+}
+
+
+
 int main()
 {
 
-        cout << "Kérek szépen egy egész számot!" << endl;
-        int s;
-        cin >> s;
 
-        cout << "Kerek sok sikvektort." << endl;
 
-        xy<int> osszeg;
-        xy<int> kul;
-        xy<int> z;
+        typedef xy<int> XY;
+        
+        XY seged;
+        XY a(1,2);
+        XY b(3,4);
 
-        vector< xy<int> > v;
- 
-        while(cin >> z) {
-                v.push_back(z);
-                osszeg += z;
-                kul -= z;
-                cout << "Az összeg aktualisan: " << osszeg << endl;
-                cout << "A különbség aktualisan: " << kul << endl;
-        }
+        seged = a+b;
+        check(seged.x==4 && seged.y==6);
 
-        cout << "A kovetkezo szamokat szoroztam ossze:" << endl;
-        for(unsigned int i=0; i<v.size(); ++i) {
-          cout << v[i] << ", A normanégyzete: " << v[i].normSquare() <<endl;
-          cout << v[i] << " " << s << " szorosa " << v[i]*s <<endl;
-          cout << v[i] << " " << s << " edrésze " << v[i]/s <<endl;
-        }
-        if (v.size()>1){
-          cout << "Az elsö kettö szorzata: " << v[0]*v[1] << endl;
-        }
-        
-        cout << "Eleg nehez volt." << endl;
+        seged = a-b;
+        check(seged.x==-1 && seged.y==-1);
+
+        check(a.normSquare()==5);
+        check(a*b==11);
+
+        int l=2;
+        seged = a*l;
+        check(seged.x==2 && seged.y==4);
+
+        seged = b/l;
+        check(seged.x==1 && seged.y==2);
+
+        typedef BoundingBox<int> BB;
+        BB doboz1;
+        doboz1 += a;
+        doboz1 += b;
+
+        cout << (passed ? "All tests passed." : "Some of the tests failed!!!")
+             << endl;
+
+        return passed ? 0 : 1;
+
 }