1 #include <util/rbtree.h>
10 typedef RBTree<Data, unsigned int, unsigned int> RBType;
16 bool operator < (Node &d)
21 bool operator < (int d)
26 bool operator > (int d)
35 RBType::Node rbtree_node;
43 static const unsigned int rbtree_size = 1000000;
45 Data data[rbtree_size];
52 for (unsigned int i = 0; i < rbtree_size; i++) {
57 val = random() & 0x7fffffff;
58 } while (rbtree.find(val));
60 d->rbtree_node.value = val;
64 for (unsigned int i = 0; i < rbtree_size; i++) {
65 unsigned int val = data[i].rbtree_node.value;
66 Data *d = rbtree.find(val);
68 assert(d->rbtree_node.value == val);