Added hashset

tests/foreach.c

@@ -7,6 +7,18 @@ int cmp(int a, int b)
     return a - b;
 }
 
+size_t inthash(int t)
+{
+    size_t a = t;
+    a += ~(a << 15);
+    a ^= (a >> 10);
+    a += (a << 3);
+    a ^= (a >> 6);
+    a += ~(a << 11);
+    a ^= (a >> 16);
+    return a;
+}
+
 COLLECTION_GENERATE(LIST, PUBLIC, l, list, /**/, /**/, int)
 COLLECTION_GENERATE(STACK, PUBLIC, s, stack, /**/, /**/, int)
 COLLECTION_GENERATE(QUEUE, PUBLIC, q, queue, /**/, /**/, int)
@@ -15,6 +27,7 @@ COLLECTION_GENERATE(LINKEDLIST, PUBLIC, ll, linked, /**/, /**/, int)
 COLLECTION_GENERATE(HEAP, PUBLIC, h, heap, /**/, /**/, int)
 COLLECTION_GENERATE(TREESET, PUBLIC, ts, tset, /**/, /**/, int)
 COLLECTION_GENERATE(TREEMAP, PUBLIC, tm, tmap, /**/, int, int)
+COLLECTION_GENERATE(HASHSET, PUBLIC, hs, hset, /**/, /**/, int)
 
 int main(int argc, char const *argv[])
 {
@@ -26,6 +39,7 @@ int main(int argc, char const *argv[])
     heap *h = h_new(1000, MaxHeap, cmp);
     tset *ts = ts_new(cmp);
     tmap *tm = tm_new(cmp);
+    hset *hs = hs_new(1000, 0.9, cmp, inthash);
 
     for (int i = 1; i < 10001; i++)
     {
@@ -47,9 +61,10 @@ int main(int argc, char const *argv[])
         h_insert(h, i);
         ts_insert(ts, i);
         tm_insert(tm, i, i);
+        hs_insert(hs, i);
     }
 
-    int sum0 = 0, sum1 = 0, sum2 = 0, sum3 = 0, sum4 = 0, sum5 = 0, sum6 = 0, sum7 = 0, sum8 = 0;
+    int sum0 = 0, sum1 = 0, sum2 = 0, sum3 = 0, sum4 = 0, sum5 = 0, sum6 = 0, sum7 = 0, sum8 = 0, sum9 = 0;
 
     FOR_EACH(l, list, int, l, {
         sum0 += value;
@@ -84,6 +99,10 @@ int main(int argc, char const *argv[])
         sum8 += value;
     })
 
+    FOR_EACH(hs, hset, int, hs, {
+        sum9 += value;
+    })
+
     if (sum0 == 50005000)
         printf("%10s PASSED\n", "LIST");
     if (sum1 == 50005000)
@@ -100,10 +119,12 @@ int main(int argc, char const *argv[])
         printf("%10s PASSED\n", "TREESET");
     if (sum7 == 50005000 && sum8 == 50005000)
         printf("%10s PASSED\n", "TREEMAP");
+    if (sum9 == 50005000)
+        printf("%10s PASSED\n", "HASHSET");
 
     printf("\n\n");
 
-    sum0 = 0, sum1 = 0, sum2 = 0, sum3 = 0, sum4 = 0, sum5 = 0, sum6 = 0, sum7 = 0, sum8 = 0;
+    sum0 = 0, sum1 = 0, sum2 = 0, sum3 = 0, sum4 = 0, sum5 = 0, sum6 = 0, sum7 = 0, sum8 = 0, sum9 = 0;
 
     FOR_EACH_REV(l, list, int, l, {
         sum0 += value;
@@ -138,6 +159,10 @@ int main(int argc, char const *argv[])
         sum8 += value;
     })
 
+    FOR_EACH_REV(hs, hset, int, hs, {
+        sum9 += value;
+    })
+
     if (sum0 == 50005000)
         printf("%10s PASSED\n", "LIST");
     if (sum1 == 50005000)
@@ -154,6 +179,8 @@ int main(int argc, char const *argv[])
         printf("%10s PASSED\n", "TREESET");
     if (sum7 == 50005000 && sum8 == 50005000)
         printf("%10s PASSED\n", "TREEMAP");
+    if (sum9 == 50005000)
+        printf("%10s PASSED\n", "HASHSET");
 
     l_free(l);
     ll_free(ll);

tests/iterators/hashset.c

@@ -0,0 +1,70 @@
+// Checks if the hash set iterator can go back and forward in the hash set without
+// hitting invalid states or a null pointer. Check is done visually.
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdint.h>
+#include <stdbool.h>
+#include "../../src/hashset.h"
+
+HASHSET_GENERATE(hs, hash_set, static, , int)
+
+size_t inthash(int t)
+{
+    size_t a = t;
+    a += ~(a << 15);
+    a ^= (a >> 10);
+    a += (a << 3);
+    a ^= (a >> 6);
+    a += ~(a << 11);
+    a ^= (a >> 16);
+    return a;
+}
+
+int intcmp(int a, int b)
+{
+    return a - b;
+}
+
+int main(int argc, char const *argv[])
+{
+    size_t i;
+    int r;
+
+    // Initliazie hash set and add some elements
+    hash_set *hs = hs_new(10, 0.9, intcmp, inthash);
+    for (int i = 0; i < 10; i++)
+        hs_insert(hs, i);
+
+    // Initialize iterator
+    hash_set_iter iter;
+    hs_iter_new(&iter, hs);
+
+    // Make the iterator go back and forward
+    for (int j = 0; j < 4; j++)
+    {
+        while (hs_iter_next(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n");
+        while (hs_iter_prev(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n\n");
+    }
+
+    for (hs_iter_tostart(&iter); !hs_iter_end(&iter); /**/)
+    {
+        hs_iter_next(&iter, &r, &i);
+        printf("S[%2d] = %2d\n", i, r);
+    }
+
+    printf("\n");
+
+    for (hs_iter_toend(&iter); !hs_iter_start(&iter); /**/)
+    {
+        hs_iter_prev(&iter, &r, &i);
+        printf("S[%2d] = %2d\n", i, r);
+    }
+
+    hs_free(hs);
+
+    return 0;
+}