Newer
Older
#include <cstdio>
#include <set>
#include <utility>
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
bimap<int, int>
test_bimap1()
{
bimap<int, int> bm;
bm.insert(1,10);
bm.insert(1,12);
bm.insert(1,13);
bm.insert(2,20);
bm.insert(2,12);
bm.insert(2,23);
bm.insert(3,13);
bm.insert(3,23);
bm.l_insert(4);
return bm;
}
int
main(int argc, char* argv[])
{
(void)argc;
(void)argv;
auto bm = test_bimap1();
printf("All relations");
for (auto &rel : bm.l_relations){
printf(" %d : %d\n", rel.first, rel.second);
}
printf("\n");
for (auto &l : bm.left_elements){
printf("Key %d, %lu vals\n", l, bm.l_count(l));
const auto [lb, ub] = bm.l_equal_range(l);
for (auto it = lb; it != ub; it++){
printf(" %d : %d\n", it->first, it->second);
}
}
printf("\n");
for (auto &r : bm.right_elements){
printf("Key %d, %lu vals\n", r, bm.r_count(r));
const auto [lb, ub] = bm.r_equal_range(r);
for (auto it = lb; it != ub; it++){
printf(" %d : %d\n", it->first, it->second);
}
}
return 0;
}