Changeset 2386:81b47fc5c444 in lemon-0.x for test/max_matching_test.cc

Timestamp:

03/02/07 19:04:28 (14 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Hard Warning checking

• based on the remark of the ZIB user
• we do not use -Winline

File:

• test/max_matching_test.cc (modified) (5 diffs)

test/max_matching_test.cc

@@ -75 +75 @@
     if ( mate[v]!=INVALID ) ++s;
   }
-  int size=(int)s/2;  //size will be used as the size of a maxmatching
+  int size=int(s/2);  //size will be used as the size of a maxmatching
 
   for(NodeIt v(g); v!=INVALID; ++v) {
@@ -93 +93 @@
     if ( mate[v]!=INVALID ) ++s;
   }
-  check ( (int)s/2 == size, "The size does not equal!" );
+  check ( int(s/2) == size, "The size does not equal!" );
 
   Graph::NodeMap<MaxMatching<Graph>::pos_enum> pos1(g);
@@ -104 +104 @@
     if ( mate[v]!=INVALID ) ++s;
   }
-  check ( (int)s/2 == size, "The size does not equal!" ); 
+  check ( int(s/2) == size, "The size does not equal!" ); 
   
   Graph::NodeMap<MaxMatching<Graph>::pos_enum> pos2(g);
@@ -116 +116 @@
     if ( mate[v]!=INVALID ) ++s;
   }
-  check ( (int)s/2 == size, "The size does not equal!" ); 
+  check ( int(s/2) == size, "The size does not equal!" ); 
   
   Graph::NodeMap<MaxMatching<Graph>::pos_enum> pos(g);
@@ -177 +177 @@
     if ( pos[v]==max_matching.A ) ++barrier;
   }
-  int expected_size=(int)( countNodes(g)-num_comp+barrier)/2;
+  int expected_size=int( countNodes(g)-num_comp+barrier)/2;
   check ( size==expected_size, "The size of the matching is wrong." );