Changeset 2242:16523135943d in lemon-0.x for test/radix_sort_test.cc
- Timestamp:
- 10/14/06 17:26:05 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2991
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
test/radix_sort_test.cc
r1956 r2242 38 38 vector<int> data1(n), data2(n); 39 39 for (int i = 0; i < n; ++i) { 40 data1[i] = data2[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0)))- 500;40 data1[i] = data2[i] = rnd[1000] - 500; 41 41 } 42 42 radixSort(data1.begin(), data1.end()); … … 49 49 vector<unsigned char> data1(n), data2(n); 50 50 for (int i = 0; i < n; ++i) { 51 data1[i] = data2[i] = (int)(200 * (rand() / (RAND_MAX + 1.0)));51 data1[i] = data2[i] = rnd[(unsigned char)200]; 52 52 } 53 53 radixSort(data1.begin(), data1.end()); … … 65 65 vector<int> data1(n), data2(n); 66 66 for (int i = 0; i < n; ++i) { 67 data1[i] = data2[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0)))- 500;67 data1[i] = data2[i] = rnd[1000] - 500; 68 68 } 69 69 counterSort(data1.begin(), data1.end()); … … 76 76 vector<unsigned char> data1(n), data2(n); 77 77 for (int i = 0; i < n; ++i) { 78 data1[i] = data2[i] = (int)(200 * (rand() / (RAND_MAX + 1.0)));78 data1[i] = data2[i] = rnd[(unsigned char)200]; 79 79 } 80 80 counterSort(data1.begin(), data1.end()); … … 107 107 vector<Edge> edges; 108 108 for (int i = 0; i < e; ++i) { 109 int s = (int)(n * (double)rand() / (RAND_MAX + 1.0));110 int t = (int)(n * (double)rand() / (RAND_MAX + 1.0));109 int s = rnd[n]; 110 int t = rnd[n]; 111 111 edges.push_back(graph.addEdge(nodes[s], nodes[t])); 112 112 } … … 146 146 vector<Edge> edges; 147 147 for (int i = 0; i < e; ++i) { 148 int s = (int)(n * (double)rand() / (RAND_MAX + 1.0));149 int t = (int)(n * (double)rand() / (RAND_MAX + 1.0));148 int s = rnd[n]; 149 int t = rnd[n]; 150 150 edges.push_back(graph.addEdge(nodes[s], nodes[t])); 151 151 }
Note: See TracChangeset
for help on using the changeset viewer.