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 <stdio.h>
#include <time.h>
#include <stc/calgo.h>
#include <stc/crandom.h>
#define i_val double
#define i_tag fx
#include <stc/clist.h>
int main() {
const int n = 3000000;
c_auto (clist_fx, list)
{
stc64_t rng = stc64_new(1234567);
stc64_uniformf_t dist = stc64_uniformf_new(100.0f, n);
int m = 0;
c_forrange (n)
clist_fx_push_back(&list, stc64_uniformf(&rng, &dist)), ++m;
double sum = 0.0;
printf("sumarize %d:\n", m);
c_foreach (i, clist_fx, list)
sum += *i.ref;
printf("sum %f\n\n", sum);
c_forfilter (i, clist_fx, list, c_flt_take(i, 10))
printf("%8d: %10f\n", c_flt_last(i), *i.ref);
puts("sort");
clist_fx_sort(&list); // mergesort O(n*log n)
puts("sorted");
double last = 0;
c_foreach (i, clist_fx, list) {
if (*i.ref < last) {printf("ERROR"); exit(-1);}
last = *i.ref;
}
c_forfilter (i, clist_fx, list, c_flt_take(i, 10))
printf("%8d: %10f\n", c_flt_last(i), *i.ref);
puts("");
clist_fx_clear(&list);
c_forlist (i, int, {10, 20, 30, 40, 30, 50})
clist_fx_push_back(&list, *i.ref);
const double* v = clist_fx_get(&list, 30);
printf("found: %f\n", *v);
c_foreach (i, clist_fx, list)
printf(" %g", *i.ref);
puts("");
clist_fx_remove(&list, 30);
clist_fx_insert_at(&list, clist_fx_begin(&list), 5); // same as push_front()
clist_fx_push_back(&list, 500);
clist_fx_push_front(&list, 1964);
printf("Full: ");
c_foreach (i, clist_fx, list)
printf(" %g", *i.ref);
printf("\nSubs: ");
clist_fx_iter it = clist_fx_begin(&list);
c_foreach (i, clist_fx, clist_fx_advance(it, 4), clist_fx_end(&list))
printf(" %g", *i.ref);
puts("");
}
}
|
