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
|
#include <stc/csmap.h>
#include <stc/cstr.h>
#include <stc/crandom.h>
#include <stdio.h>
using_csmap(i, int, size_t);
using_csset_str();
#include <time.h>
int main(int argc, char **argv)
{
csmap_i map = csmap_i_init();
time_t seed = time(NULL);
size_t n = 1000000;
uint64_t mask = (1ull << 20) - 1;
csmap_i_iter_t it;
stc64_srandom(seed);
c_forrange (i, n) {
uint64_t val = stc64_random() & mask;
csmap_i_emplace(&map, val, i);
if (!csmap_i_contains(&map, val)) {
printf("Not found: %zu, %zu: ", i, val);
}
}
printf("size %zu\n\n", csmap_i_size(map));
stc64_srandom(seed);
c_forrange (n - 20)
csmap_i_erase(&map, stc64_random() & mask);
size_t val = 500000;
csmap_i_emplace(&map, val, 5);
int k = 0;
c_foreach (i, csmap_i, map)
printf("%2d %d: %zu\n", ++k, i.ref->first, i.ref->second);
csmap_i_find_it(&map, val, &it);
printf("\nmin/max: %d -- %d: found: %d. size: %zu\n", csmap_i_front(&map)->first,
csmap_i_back(&map)->first,
it.ref->first,
csmap_i_size(map));
c_foreach (i, csmap_i, it, csmap_i_end(&map))
printf("-- %d: %zu\n", i.ref->first, i.ref->second);
csmap_i_del(&map);
puts("");
c_init (csset_str, shouts, {"Hello", "Try this", "Awesome", "Works well", "Greetings"});
c_foreach (i, csset_str, shouts)
printf("shout: %s\n", i.ref->str);
csset_str_del(&shouts);
}
|
