Changeset 1844:eaa5f5b855f7 in lemon-0.x for test/radix_sort_test.cc

Timestamp:

12/03/05 19:15:43 (18 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Changed implementation and bug fix

File:

• test/radix_sort_test.cc (modified) (2 diffs)

test/radix_sort_test.cc

@@ -16 +16 @@
 
 void checkRadixSort() {
-  int n = 10000;
-  vector<int> data1(n), data2(n);
-  for (int i = 0; i < n; ++i) {
-    data1[i] = data2[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0))) - 500;
-  }
-  radixSort(data1.begin(), data1.end());
-  sort(data2.begin(), data2.end());
-  for (int i = 0; i < n; ++i) {
-    check(data1[i] == data2[i], "Test failed");
+  {
+    int n = 10000;
+    vector<int> data1(n), data2(n);
+    for (int i = 0; i < n; ++i) {
+      data1[i] = data2[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0))) - 500;
+    }
+    radixSort(data1.begin(), data1.end());
+    sort(data2.begin(), data2.end());
+    for (int i = 0; i < n; ++i) {
+      check(data1[i] == data2[i], "Test failed");
+    }
+  } {
+    int n = 10000;
+    vector<unsigned char> data1(n), data2(n);
+    for (int i = 0; i < n; ++i) {
+      data1[i] = data2[i] = (int)(200 * (rand() / (RAND_MAX + 1.0)));
+    }
+    radixSort(data1.begin(), data1.end());
+    sort(data2.begin(), data2.end());
+    for (int i = 0; i < n; ++i) {
+      check(data1[i] == data2[i], "Test failed");
+    }
   }
 }
@@ -30 +43 @@
 
 void checkCounterSort() {
-  int n = 10000;
-  vector<int> data1(n), data2(n);
-  for (int i = 0; i < n; ++i) {
-    data1[i] = data2[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0))) - 500;
-  }
-  counterSort(data1.begin(), data1.end());
-  sort(data2.begin(), data2.end());
-  for (int i = 0; i < n; ++i) {
-    check(data1[i] == data2[i], "Test failed");
+  {
+    int n = 10000;
+    vector<int> data1(n), data2(n);
+    for (int i = 0; i < n; ++i) {
+      data1[i] = data2[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0))) - 500;
+    }
+    counterSort(data1.begin(), data1.end());
+    sort(data2.begin(), data2.end());
+    for (int i = 0; i < n; ++i) {
+      check(data1[i] == data2[i], "Test failed");
+    } 
+  } {
+    int n = 10000;
+    vector<unsigned char> data1(n), data2(n);
+    for (int i = 0; i < n; ++i) {
+      data1[i] = data2[i] = (int)(200 * (rand() / (RAND_MAX + 1.0)));
+    }
+    counterSort(data1.begin(), data1.end());
+    sort(data2.begin(), data2.end());
+    for (int i = 0; i < n; ++i) {
+      check(data1[i] == data2[i], "Test failed");
+    } 
   }
 }