blob: 01e4bb41acf7ad526dde9e5d3f1fa726ddc84f70 (
plain)
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
|
#include <ccan/htable/htable.h>
#include <ccan/htable/htable.c>
#include <ccan/tap/tap.h>
#include <stdbool.h>
#include <string.h>
#define NUM_VALS 512
/* We use the number divided by two as the hash (for lots of
collisions). */
static size_t hash(const void *elem, void *unused)
{
size_t h = *(uint64_t *)elem / 2;
return h;
}
int main(int argc, char *argv[])
{
struct htable *ht;
uint64_t val[NUM_VALS];
unsigned int i;
plan_tests((NUM_VALS) * 2);
for (i = 0; i < NUM_VALS; i++)
val[i] = i;
ht = htable_new(hash, NULL);
for (i = 0; i < NUM_VALS; i++) {
ok1(ht->max >= i);
ok1(ht->max <= i * 2);
htable_add(ht, hash(&val[i], NULL), &val[i]);
}
htable_free(ht);
return exit_status();
}
|
