1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
|
//=======================================================================
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#include <boost/config.hpp>
#include <vector>
#include <iostream>
#include <stdlib.h>
#include <boost/pending/bucket_sorter.hpp>
int main()
{
using namespace std;
using boost::bucket_sorter;
const std::size_t N = 10;
vector< std::size_t > bucket(N);
for (std::size_t i = 0; i < N; i++)
{
bucket[i] = rand() % N;
cout.width(6);
cout << "Number " << i << " is in bucket " << bucket[i] << endl;
}
typedef boost::identity_property_map ID;
typedef bucket_sorter< std::size_t, int, vector< std::size_t >::iterator,
ID >
BS;
BS my_bucket_sorter(N, N, bucket.begin());
for (std::size_t ii = 0; ii < N; ii++)
my_bucket_sorter.push(ii);
std::size_t j;
for (j = 0; j < N; j++)
{
cout << "The bucket " << j;
if (!my_bucket_sorter[j].empty())
{
cout << " has number ";
do
{
int v = my_bucket_sorter[j].top();
my_bucket_sorter[j].pop();
cout << v << " ";
} while (!my_bucket_sorter[j].empty());
cout << endl;
}
else
{
cout << " has no number associated with it." << endl;
}
}
for (std::size_t k = 0; k < N; k++)
my_bucket_sorter.push(k);
my_bucket_sorter.remove(5);
my_bucket_sorter.remove(7);
cout << "After removing numbers 5 and 7, check correctness again." << endl;
for (j = 0; j < N; j++)
{
cout << "The bucket " << j;
if (!my_bucket_sorter[j].empty())
{
cout << " has number ";
do
{
int v = my_bucket_sorter[j].top();
my_bucket_sorter[j].pop();
cout << v << " ";
} while (!my_bucket_sorter[j].empty());
cout << endl;
}
else
{
cout << " has no number associated with it." << endl;
}
}
std::size_t iii;
for (iii = 0; iii < N; iii++)
{
std::size_t current = rand() % N;
if (!my_bucket_sorter[current].empty())
{
int v = my_bucket_sorter[current].top();
my_bucket_sorter[current].pop();
bucket[v] = rand() % N;
my_bucket_sorter.push(v);
}
}
for (iii = 0; iii < N; iii++)
{
std::size_t current = rand() % N;
if (!my_bucket_sorter[current].empty())
{
int v = my_bucket_sorter[current].top();
bucket[v] = rand() % N;
my_bucket_sorter.update(v);
}
}
return 0;
}
|
