test/dim_test.cc
author deba
Fri, 03 Nov 2006 16:29:32 +0000
changeset 2293 1ee6e8788cc7
parent 2207 75a29ac69c19
child 2391 14a343be7a5a
permissions -rw-r--r--
First implementation of the static graph class
It could be improved to get better running times on benchmarks
     1 /* -*- C++ -*-
     2  *
     3  * This file is a part of LEMON, a generic C++ optimization library
     4  *
     5  * Copyright (C) 2003-2006
     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     8  *
     9  * Permission to use, modify and distribute this software is granted
    10  * provided that this copyright notice appears in all copies. For
    11  * precise terms see the accompanying LICENSE file.
    12  *
    13  * This software is provided "AS IS" with no warranty of any kind,
    14  * express or implied, and with no claim as to its suitability for any
    15  * purpose.
    16  *
    17  */
    18 
    19 #include <lemon/dim2.h>
    20 #include <iostream>
    21 #include "test_tools.h"
    22 
    23 using namespace std;
    24 using namespace lemon;
    25 int main()
    26 {
    27 
    28   cout << "Testing classes `dim2::Point' and `dim2::BoundingBox'." << endl;
    29 
    30   typedef dim2::Point<int> Point;
    31 	
    32   Point seged;
    33   check(seged.size()==2, "Wrong vector addition");
    34 
    35   Point a(1,2);
    36   Point b(3,4);
    37 
    38   check(a[0]==1 && a[1]==2, "Wrong vector addition");
    39 
    40   seged = a+b;
    41   check(seged.x==4 && seged.y==6, "Wrong vector addition");
    42 
    43   seged = a-b;
    44   check(seged.x==-2 && seged.y==-2, "a-b");
    45 
    46   check(a.normSquare()==5,"Wrong norm calculation");
    47   check(a*b==11, "a*b");
    48 
    49   int l=2;
    50   seged = a*l;
    51   check(seged.x==2 && seged.y==4, "a*l");
    52 
    53   seged = b/l;
    54   check(seged.x==1 && seged.y==2, "b/l");
    55 
    56   typedef dim2::BoundingBox<int> BB;
    57   BB doboz1;
    58   check(doboz1.empty(), "It should be empty.");
    59 	
    60   doboz1.add(a);
    61   check(!doboz1.empty(), "It should not be empty.");
    62   doboz1.add(b);
    63 
    64   check(doboz1.bottomLeft().x==1 && 
    65         doboz1.bottomLeft().y==2 &&
    66         doboz1.topRight().x==3 && 
    67         doboz1.topRight().y==4,  
    68         "added points to box");
    69 
    70   seged.x=2;seged.y=3;
    71   check(doboz1.inside(seged),"It should be inside.");
    72 
    73   seged.x=1;seged.y=3;
    74   check(doboz1.inside(seged),"It should be inside.");
    75 
    76   seged.x=0;seged.y=3;
    77   check(!doboz1.inside(seged),"It should not be inside.");
    78 
    79   BB doboz2(seged);
    80   check(!doboz2.empty(),
    81         "It should not be empty. Constructed from 1 point.");
    82 
    83   doboz2.add(doboz1);
    84   check(doboz2.inside(seged),
    85         "It should be inside. Incremented a box with another one.");
    86 }