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
|
#include <iostream>
#include <cstdlib>
#include <rak/functional.h>
#include <rak/priority_queue_default.h>
rak::priority_queue_default queue;//(priority_compare(), priority_equal(), priority_erase());
rak::priority_item items[100];
int last = 0;
class test {
public:
test() {}
void f() { std::cout << "Called: " << std::endl; }
};
void
print_item(rak::priority_item* p) {
std::cout << (p - items)
<< ' ' << p->time().usec() << std::endl;
if (p->time().usec() < last) {
std::cout << "order bork." << std::endl;
exit(-1);
}
last = p->time().usec();
p->clear_time();
if (std::rand() % 5) {
int i = rand() % 100;
std::cout << "erase " << i << ' ' << items[i].time().usec() << std::endl;
priority_queue_erase(&queue, items + i);
}
}
int
main() {
try {
test t;
for (rak::priority_item* first = items, *last = items + 100; first != last; ++first) {
first->set_slot(rak::mem_fn(&t, &test::f));
priority_queue_insert(&queue, first, (std::rand() % 50) + 1);
}
// std::vector<rak::priority_item*> due;
// std::copy(rak::queue_popper(queue, rak::bind2nd(std::mem_fun(&rak::priority_item::compare), 20)),
// rak::queue_popper(queue, rak::bind2nd(std::mem_fun(&rak::priority_item::compare), rak::timer())),
// std::back_inserter(due));
// std::for_each(due.begin(), due.end(), std::ptr_fun(&print_item));
while (!queue.empty()) {
rak::priority_item* i = queue.top();
queue.pop();
print_item(i);
}
} catch (std::logic_error& e) {
std::cout << "Exception: " << e.what() << std::endl;
}
return 0;
}
|
