pkbktarr: add _find_first_index and _iterate

1 files changed, 75 insertions, 0 deletions

diff --git a/test/pkbktarr.c b/test/pkbktarr.c
index 1750359..55cf3df 100644
--- a/test/pkbktarr.c
+++ b/test/pkbktarr.c
@@ -23,10 +23,23 @@ exit(int code)
 	}
 }
 
+bool find_int_val(void *user_data, void *arr_item) {
+	int lhs = *((int*)user_data);
+	int rhs = *((int*)arr_item);
+	return lhs == rhs;
+}
+
+static int global_counter = 0;
+void iter(void *arr_item) {
+	(void)arr_item;
+	global_counter += 1;
+}
+
 void test_spinup(struct pk_membucket **bkt_buckets, struct pk_membucket **bkt_data)
 {
 	*bkt_buckets = pk_bucket_create("buckets", 1 << 16, false);
 	*bkt_data = pk_bucket_create("data", 1 << 16, false);
+	global_counter = 0;
 }
 
 void test_teardown(struct pk_membucket **bkt_buckets, struct pk_membucket **bkt_data)
@@ -170,6 +183,68 @@ int main(int argc, char *argv[])
 	}
 	test_teardown(&bkt_buckets, &bkt_data);
 
+	// test find
+	test_spinup(&bkt_buckets, &bkt_data);
+	{
+		assert(bkt_buckets != nullptr);
+		assert(bkt_data != nullptr);
+		struct pk_bkt_arr arr = {0};
+		struct pk_bkt_arr_handle limits;
+		limits.b = PK_BKT_ARR_HANDLE_B_MAX;
+		limits.i = PK_BKT_ARR_HANDLE_I_MAX;
+		pk_bkt_arr_init(&arr, sizeof(int), alignof(int), limits, bkt_buckets, bkt_data);
+
+		struct pk_bkt_arr_handle h = pk_bkt_arr_new_handle(&arr);
+		if (h.b != 0) exit(1);
+		if (h.i != 0) exit(1);
+		if (arr.head_l.b != 0) exit(1);
+		if (arr.head_l.i != 1) exit(1);
+		if (arr.head_r.b != 0) exit(1);
+		if (arr.head_r.i != 1) exit(1);
+		if (bkt_buckets->allocs != 2) exit(1);
+		if (bkt_data->allocs != 1) exit(1);
+
+		int val = 69;
+		((int**)arr.bucketed_data)[h.b][h.i] = val;
+		struct pk_bkt_arr_handle found_h = pk_bkt_arr_find_first_handle(&arr, &val, find_int_val);
+		if (pk_bkt_arr_handle_compare(h, found_h) != 0) exit(1);
+
+		pk_bkt_arr_teardown(&arr);
+		if (bkt_buckets->allocs != 0) exit(1);
+		if (bkt_data->allocs != 0) exit(1);
+	}
+	test_teardown(&bkt_buckets, &bkt_data);
+
+	// test iterate
+	test_spinup(&bkt_buckets, &bkt_data);
+	{
+		assert(bkt_buckets != nullptr);
+		assert(bkt_data != nullptr);
+		struct pk_bkt_arr arr = {0};
+		struct pk_bkt_arr_handle limits;
+		limits.b = PK_BKT_ARR_HANDLE_B_MAX;
+		limits.i = PK_BKT_ARR_HANDLE_I_MAX;
+		pk_bkt_arr_init(&arr, sizeof(int), alignof(int), limits, bkt_buckets, bkt_data);
+
+		struct pk_bkt_arr_handle h = pk_bkt_arr_new_handle(&arr);
+		if (h.b != 0) exit(1);
+		if (h.i != 0) exit(1);
+		if (arr.head_l.b != 0) exit(1);
+		if (arr.head_l.i != 1) exit(1);
+		if (arr.head_r.b != 0) exit(1);
+		if (arr.head_r.i != 1) exit(1);
+		if (bkt_buckets->allocs != 2) exit(1);
+		if (bkt_data->allocs != 1) exit(1);
+
+		pk_bkt_arr_iterate(&arr, iter);
+		if (global_counter != 1) exit(1);
+
+		pk_bkt_arr_teardown(&arr);
+		if (bkt_buckets->allocs != 0) exit(1);
+		if (bkt_data->allocs != 0) exit(1);
+	}
+	test_teardown(&bkt_buckets, &bkt_data);
+
 	// test release & re-use slot
 	test_spinup(&bkt_buckets, &bkt_data);
 	{