1 files changed, 0 insertions, 68 deletions
diff --git a/misc/examples/birthday.c b/misc/examples/birthday.c
deleted file mode 100644
index c301128a..00000000
--- a/misc/examples/birthday.c
+++ /dev/null
@@ -1,68 +0,0 @@
-#include <math.h>
-#include <stdio.h>
-#include <time.h>
-#include <stc/crand.h>
-
-#define i_tag ic
-#define i_key uint64_t
-#define i_val int
-#include <stc/cmap.h>
-
-static uint64_t seed = 12345;
-
-static void test_repeats(void)
-{
-    enum {BITS = 46, BITS_TEST = BITS/2 + 2};
-    const static uint64_t N = 1ull << BITS_TEST;
-    const static uint64_t mask = (1ull << BITS) - 1;
-
-    printf("birthday paradox: value range: 2^%d, testing repeats of 2^%d values\n", BITS, BITS_TEST);
-    crand_t rng = crand_init(seed);
-
-    cmap_ic m = cmap_ic_with_capacity(N);
-    c_forrange (i, N) {
-        uint64_t k = crand_u64(&rng) & mask;
-        int v = cmap_ic_insert(&m, k, 0).ref->second += 1;
-        if (v > 1) printf("repeated value %" PRIu64 " (%d) at 2^%d\n",
-                          k, v, (int)log2((double)i));
-    }
-    cmap_ic_drop(&m);
-}
-
-#define i_key uint32_t
-#define i_val uint64_t
-#define i_tag x
-#include <stc/cmap.h>
-
-void test_distribution(void)
-{
-    enum {BITS = 26};
-    printf("distribution test: 2^%d values\n", BITS);
-    crand_t rng = crand_init(seed);
-    const size_t N = 1ull << BITS ;
-
-    cmap_x map = {0};
-    c_forrange (N) {
-        uint64_t k = crand_u64(&rng);
-        cmap_x_insert(&map, k & 0xf, 0).ref->second += 1;
-    }
-
-    uint64_t sum = 0;
-    c_foreach (i, cmap_x, map) sum += i.ref->second;
-    sum /= (uint64_t)map.size;
-
-    c_foreach (i, cmap_x, map) {
-        printf("%4" PRIu32 ": %" PRIu64 " - %" PRIu64 ": %11.8f\n",
-                i.ref->first, i.ref->second, sum,
-                (1.0 - (double)i.ref->second / (double)sum));
-    }
-
-    cmap_x_drop(&map);
-}
-
-int main()
-{
-    seed = (uint64_t)time(NULL);
-    test_distribution();
-    test_repeats();
-}