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

Timestamp:

03/02/07 19:04:28 (17 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/radix_sort_test.cc (modified) (7 diffs)

test/radix_sort_test.cc

@@ -33 +33 @@
 using namespace lemon;
 
+typedef unsigned char uchar;
+
 void checkRadixSort() {
   {
@@ -49 +51 @@
     vector<unsigned char> data1(n), data2(n);
     for (int i = 0; i < n; ++i) {
-      data1[i] = data2[i] = rnd[(unsigned char)200];
+      data1[i] = data2[i] = rnd[uchar(200)];
     }
     radixSort(data1.begin(), data1.end());
@@ -76 +78 @@
     vector<unsigned char> data1(n), data2(n);
     for (int i = 0; i < n; ++i) {
-      data1[i] = data2[i] = rnd[(unsigned char)200];
+      data1[i] = data2[i] = rnd[uchar(200)];
     }
     counterSort(data1.begin(), data1.end());
@@ -97 +99 @@
 
   const int n = 100;
-  const int e = (int)(n * log((double)n));
+  const int e = int(n * log(double(n)));
 
   Graph graph;
@@ -118 +120 @@
   Graph::EdgeMap<bool> was(graph, false);
 
-  for (int i = 0; i < (int)edges.size(); ++i) {
+  for (int i = 0; i < int(edges.size()); ++i) {
     check(!was[edges[i]], "Test failed");
     was[edges[i]] = true;
   }
 
-  for (int i = 1; i < (int)edges.size(); ++i) {
+  for (int i = 1; i < int(edges.size()); ++i) {
     check(graph.id(graph.source(edges[i - 1])) <= 
           graph.id(graph.source(edges[i])), "Test failed");
@@ -136 +138 @@
 
   const int n = 100;
-  const int e = (int)(n * log((double)n));
+  const int e = int(n * log(double(n)));
 
   Graph graph;
@@ -161 +163 @@
   Graph::EdgeMap<bool> was(graph, false);
 
-  for (int i = 0; i < (int)edges.size(); ++i) {
+  for (int i = 0; i < int(edges.size()); ++i) {
     check(!was[edges[i]], "Test failed");
     was[edges[i]] = true;
   }
 
-  for (int i = 1; i < (int)edges.size(); ++i) {
+  for (int i = 1; i < int(edges.size()); ++i) {
     check(graph.id(graph.target(edges[i - 1])) < 
           graph.id(graph.target(edges[i])) ||