-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathskiplist-test.c
More file actions
165 lines (122 loc) · 3.77 KB
/
skiplist-test.c
File metadata and controls
165 lines (122 loc) · 3.77 KB
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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
#include <assert.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include "prng.h"
#include "skiplist.h"
#define RECORD_SIZE 190
static uint64_t __randnum(void *c) {
return (uint64_t)ranval(c);
}
static void *__alloc(void *cc, size_t n) {
return malloc(n);
}
static void __dealloc(void *cc, void *c) {
free(c);
}
static bool __u32_leq(void *a, void *b) {
return *(uint32_t*)a <= *(uint32_t*)b;
}
static bool __u32_eq(void *a, void *b) {
return *(uint32_t*)a == *(uint32_t*)b;
}
static void __u32_cpy(void *a, void *b) {
*(uint32_t*)a = *(uint32_t*)b;
}
static void __print_u32(void *cc, void *v) {
uint32_t *n = cc;
(*n)++;
fprintf(stdout, "%4u", *(uint32_t*)v);
if( *n >= 16 ) {
fprintf(stdout, "\n");
*n = 0;
}
}
static void __print_node_u32(void *cc, uint8_t l, int tp, void *v) {
uint32_t *cnt = cc;
if( tp < 0 ) {
*cnt = 0;
fprintf( stdout
, "%2d:-|"
, l );
}
if( tp == 0 && v) {
fprintf(stdout, "%s%u", (*cnt)?",":"", *(uint32_t*)v);
(*cnt)++;
}
if( tp > 0 ) {
fprintf(stdout, "|+\n");
}
}
void test_skiplist_1(void) {
ranctx rctx;
raninit(&rctx, 0xDEADBEEF);
char mem[skiplist_size];
struct skiplist *sl = skiplist_create( sizeof(mem)
, mem
, 8
, sizeof(uint32_t)
, __u32_leq
, __u32_cpy
, 0
, __alloc
, __dealloc
, &rctx
, __randnum
);
const size_t N = 32;
size_t i = 0, r = 0;
for(; i < N; i++ ) {
r = (i+1)%16;
uint32_t tmp = (ranval(&rctx) % (N));
skiplist_insert(sl, &tmp);
fprintf(stdout, "%4u%s", tmp, !r ? "\n" : "" );
}
fprintf(stdout, "\n");
uint32_t n = 0;
skiplist_enum(sl, &n, __print_u32);
fprintf(stdout, "\n");
uint32_t cnt = 0;
skiplist_enum_debug(sl, &cnt, __print_node_u32);
uint32_t rm[] = {0,0,25,26,14,8,2,9,9,13,13,23,10,12,18};
for(i = 0; i < sizeof(rm)/sizeof(rm[0]); i++) {
fprintf(stdout, "\nremove %u\n", rm[i]);
skiplist_remove(sl, &rm[i], __u32_eq);
cnt = 0;
skiplist_enum_debug(sl, &cnt, __print_node_u32);
fprintf(stdout, "\ncheck bottom is ok\n");
uint32_t n = 0;
skiplist_enum(sl, &n, __print_u32);
fprintf(stdout, "\n");
}
skiplist_destroy(sl);
}
void test_skiplist_2(void) {
ranctx rctx;
raninit(&rctx, 0xDEADBEEF);
char mem[skiplist_size];
struct skiplist *sl = skiplist_create( sizeof(mem)
, mem
, 4
, sizeof(uint32_t)
, __u32_leq
, __u32_cpy
, 0
, __alloc
, __dealloc
, &rctx
, __randnum
);
const size_t N = 16;
size_t i = 0;
for(; i < N; i++ ) {
uint32_t tmp = (ranval(&rctx) % (N));
skiplist_insert(sl, &tmp);
}
uint32_t cnt = 0;
skiplist_enum_debug(sl, &cnt, __print_node_u32);
skiplist_destroy(sl);
}