From 3b313daec1614d8a3288b8e20a06dc912a59bda8 Mon Sep 17 00:00:00 2001
From: Sebastiano Tronto <sebastiano@tronto.net>
Date: Sat, 13 Jul 2024 08:03:20 +0200
Subject: Added a set implementation for h48 table generation

---
 test/104_h48set/h48set_tests.c | 69 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 69 insertions(+)
 create mode 100644 test/104_h48set/h48set_tests.c

(limited to 'test/104_h48set/h48set_tests.c')

diff --git a/test/104_h48set/h48set_tests.c b/test/104_h48set/h48set_tests.c
new file mode 100644
index 0000000..97811da
--- /dev/null
+++ b/test/104_h48set/h48set_tests.c
@@ -0,0 +1,69 @@
+#include "../test.h"
+
+char str[STRLENMAX];
+
+typedef struct {
+	int64_t n;
+	int64_t capacity;
+	int64_t mod;
+	int64_t *table;
+} h48set_t;
+
+void h48set_create(h48set_t *, int64_t, int64_t);
+void h48set_clear(h48set_t *);
+void h48set_destroy(h48set_t *);
+int64_t h48set_lookup(h48set_t *, int64_t);
+void h48set_insert(h48set_t *, int64_t);
+bool h48set_contains(h48set_t *, int64_t);
+
+int compare(const void *x, const void *y) {
+	int64_t a = *(int64_t *)x;
+	int64_t b = *(int64_t *)y;
+
+	if (a > b) return 1;
+	if (a == b) return 0;
+	return -1;
+}
+
+int64_t readl(void) {
+	fgets(str, STRLENMAX, stdin);
+	return atoll(str);
+}
+
+void run(void) {
+	bool f;
+	h48set_t set;
+	int64_t n, i, j, capacity, mod, *a, u;
+
+	capacity = readl();
+	mod = readl();
+	n = readl();
+
+	a = malloc(n * sizeof(int64_t));
+	for (i = 0; i < n; i++)
+		a[i] = readl();
+
+	/* Count unique elements */
+	u = 0;
+	for (i = 0; i < n; i++) {
+		for (j = 0, f = true; j < i; j++)
+			f = f && a[i] != a[j];
+		u += f;
+	}
+
+	h48set_create(&set, capacity, mod);
+	for (i = 0; i < n; i++)
+		h48set_insert(&set, a[i]);
+
+	for (i = 0, j = 0; i < set.capacity; i++)
+		if (set.table[i] != -1)
+			a[j++] = set.table[i];
+	qsort(a, j, sizeof(int64_t), compare);
+
+	printf("%" PRId64 "\n", set.n);
+	for (i = 0; i < j; i++)
+		printf("%" PRId64 "\n", a[i]);
+
+	h48set_destroy(&set);
+	free(a);
+}
-- 
cgit v1.3