1.1 --- a/test/radix_sort_test.cc	Tue Dec 02 10:17:30 2008 +0000
     1.2 +++ b/test/radix_sort_test.cc	Tue Dec 02 23:15:43 2008 +0100
     1.3 @@ -99,7 +99,7 @@
     1.4  }
     1.5  
     1.6  
     1.7 -void checkCounterSort() {
     1.8 +void checkStableRadixSort() {
     1.9    {
    1.10      std::vector<int> data1;
    1.11      generateIntSequence(n, data1);
    1.12 @@ -107,17 +107,17 @@
    1.13      std::vector<int> data2(data1);
    1.14      std::sort(data1.begin(), data1.end());
    1.15  
    1.16 -    counterSort(data2.begin(), data2.end());
    1.17 +    stableRadixSort(data2.begin(), data2.end());
    1.18      for (int i = 0; i < n; ++i) {
    1.19        check(data1[i] == data2[i], "Test failed");
    1.20      }
    1.21  
    1.22 -    counterSort(data2.begin(), data2.end(), Negate());
    1.23 +    stableRadixSort(data2.begin(), data2.end(), Negate());
    1.24      for (int i = 0; i < n; ++i) {
    1.25        check(data1[i] == data2[n - 1 - i], "Test failed");
    1.26      }
    1.27  
    1.28 -    counterSort(data2.begin(), data2.end(), negate);
    1.29 +    stableRadixSort(data2.begin(), data2.end(), negate);
    1.30      for (int i = 0; i < n; ++i) {
    1.31        check(data1[i] == data2[n - 1 - i], "Test failed");
    1.32      }
    1.33 @@ -141,7 +141,7 @@
    1.34  int main() {
    1.35  
    1.36    checkRadixSort();
    1.37 -  checkCounterSort();
    1.38 +  checkStableRadixSort();
    1.39  
    1.40    return 0;
    1.41  }