#define NUM_VALS 512
-static size_t hash(const void *elem, void *unused)
+static size_t hash(const void *elem, void *unused UNNEEDED)
{
size_t h = *(uint64_t *)elem / 2;
return h;
return *(const uint64_t *)candidate == *(const uint64_t *)ptr;
}
-int main(int argc, char *argv[])
+int main(void)
{
struct htable ht, ht2;
uint64_t val[NUM_VALS], i;
htable_init(&ht, hash, NULL);
for (i = 0; i < NUM_VALS; i++) {
- ok1(ht.max >= i);
- ok1(ht.max <= i * 2);
+ ok1(ht_max(&ht) >= i);
+ ok1(ht_max(&ht) <= i * 2);
htable_add(&ht, hash(&val[i], NULL), &val[i]);
}