Revamped iterator test and added examples

examples/iterators/deque.c

@@ -0,0 +1,60 @@
+/**
+ * deque.c
+ *
+ * Creation Date: 11/04/2019
+ *
+ * Authors:
+ * Leonardo Vencovsky (https://github.com/LeoVen)
+ *
+ */
+#include <stdio.h>
+#include <stdlib.h>
+#include "deque.h"
+
+DEQUE_GENERATE(d, deque, static, int)
+
+int main(int argc, char const *argv[])
+{
+    size_t i;
+    int r;
+
+    // Initialize deque and add some elements
+    deque *d = d_new(10);
+    for (int i = 0; i < 10; i++)
+    {
+        i % 2 == 0 ? d_push_back(d, i) : d_push_front(d, i);
+    }
+
+    // Initialize iterator
+    deque_iter iter;
+    d_iter_new(&iter, d);
+
+    // Make the iterator go back and forward
+    for (int j = 0; j < 4; j++)
+    {
+        while (d_iter_next(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n");
+        while (d_iter_prev(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n\n");
+    }
+
+    for (d_iter_tostart(&iter); !d_iter_end(&iter); /**/)
+    {
+        d_iter_next(&iter, &r, &i);
+        printf("D[%2d] = %2d\n", i, r);
+    }
+
+    printf("\n");
+
+    for (d_iter_toend(&iter); !d_iter_start(&iter); /**/)
+    {
+        d_iter_prev(&iter, &r, &i);
+        printf("D[%2d] = %2d\n", i, r);
+    }
+
+    d_free(d);
+
+    return 0;
+}

examples/iterators/hashmap.c

@@ -0,0 +1,76 @@
+/**
+ * hashmap.c
+ *
+ * Creation Date: 11/04/2019
+ *
+ * Authors:
+ * Leonardo Vencovsky (https://github.com/LeoVen)
+ *
+ */
+#include <stdio.h>
+#include <stdlib.h>
+#include "hashmap.h"
+
+HASHMAP_GENERATE(hm, hmap, static, int, double)
+
+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 k;
+    double v, varr[10] = {0.0, 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9};
+
+    // Initialize hashmap and add some element
+    hmap *hm = hm_new(50, 0.9, intcmp, inthash);
+    for (int i = 0; i < 10; i++)
+        hm_insert(hm, i, varr[i]);
+
+    // Initialize iterator
+    hmap_iter iter;
+    hm_iter_new(&iter, hm);
+
+    // Make the iterator go back and forward
+    for (int j = 0; j < 4; j++)
+    {
+        while (hm_iter_next(&iter, &k, &v, &i))
+            printf("S[%2d] = { %2d : %2.2lf }\n", i, k, v);
+        printf("\n");
+        while (hm_iter_prev(&iter, &k, &v, &i))
+            printf("S[%2d] = { %2d : %2.2lf }\n", i, k, v);
+        printf("\n\n");
+    }
+
+    for (hm_iter_tostart(&iter); !hm_iter_end(&iter); /**/)
+    {
+        hm_iter_next(&iter, &k, &v, &i);
+        printf("M[%2d] = { %2d : %2.2lf }\n", i, k, v);
+    }
+
+    printf("\n");
+
+    for (hm_iter_toend(&iter); !hm_iter_start(&iter); /**/)
+    {
+        hm_iter_prev(&iter, &k, &v, &i);
+        printf("M[%2d] = { %2d : %2.2lf }\n", i, k, v);
+    }
+
+    hm_free(hm);
+
+    return 0;
+}

examples/iterators/hashset.c

@@ -0,0 +1,75 @@
+/**
+ * hashset.c
+ *
+ * Creation Date: 11/04/2019
+ *
+ * Authors:
+ * Leonardo Vencovsky (https://github.com/LeoVen)
+ *
+ */
+#include <stdio.h>
+#include <stdlib.h>
+#include "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;
+
+    // Initialize 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;
+}

examples/iterators/heap.c

@@ -0,0 +1,63 @@
+/**
+ * heap.c
+ *
+ * Creation Date: 11/04/2019
+ *
+ * Authors:
+ * Leonardo Vencovsky (https://github.com/LeoVen)
+ *
+ */
+#include <stdio.h>
+#include <stdlib.h>
+#include "heap.h"
+
+int intcmp(int a, int b)
+{
+    return a - b;
+}
+
+HEAP_GENERATE(h, heap, static, int)
+
+int main(int argc, char const *argv[])
+{
+    size_t i;
+    int r;
+
+    // Initialize heap and add some elements
+    heap *h = h_new(10, MinHeap, intcmp);
+    for (int i = 9; i >= 0; i--)
+        h_insert(h, i);
+
+    // Initialize iterator
+    heap_iter iter;
+    h_iter_new(&iter, h);
+
+    // Make the iterator go back and forward
+    for (int j = 0; j < 4; j++)
+    {
+        while (h_iter_next(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n");
+        while (h_iter_prev(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n\n");
+    }
+
+    for (h_iter_tostart(&iter); !h_iter_end(&iter); /**/)
+    {
+        h_iter_next(&iter, &r, &i);
+        printf("H[%2d] = %2d\n", i, r);
+    }
+
+    printf("\n");
+
+    for (h_iter_toend(&iter); !h_iter_start(&iter); /**/)
+    {
+        h_iter_prev(&iter, &r, &i);
+        printf("H[%2d] = %2d\n", i, r);
+    }
+
+    h_free(h);
+
+    return 0;
+}

examples/iterators/linkedlist.c

@@ -0,0 +1,58 @@
+/**
+ * linkedlist.c
+ *
+ * Creation Date: 11/04/2019
+ *
+ * Authors:
+ * Leonardo Vencovsky (https://github.com/LeoVen)
+ *
+ */
+#include <stdio.h>
+#include <stdlib.h>
+#include "linkedlist.h"
+
+LINKEDLIST_GENERATE(ll, linked, static, int)
+
+int main(int argc, char const *argv[])
+{
+    size_t i;
+    int r;
+
+    // Initialize linked list and add some elements
+    linked *ll = ll_new();
+    for (int i = 0; i < 10; i++)
+        ll_push_back(ll, i);
+
+    // Initialize iterator
+    linked_iter iter;
+    ll_iter_new(&iter, ll);
+
+    // Make the iterator go back and forward
+    for (int j = 0; j < 4; j++)
+    {
+        while (ll_iter_next(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n");
+        while (ll_iter_prev(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n\n");
+    }
+
+    for (ll_iter_tostart(&iter); !ll_iter_end(&iter); /**/)
+    {
+        ll_iter_next(&iter, &r, &i);
+        printf("LL[%2d] = %2d\n", i, r);
+    }
+
+    printf("\n");
+
+    for (ll_iter_toend(&iter); !ll_iter_start(&iter); /**/)
+    {
+        ll_iter_prev(&iter, &r, &i);
+        printf("LL[%2d] = %2d\n", i, r);
+    }
+
+    ll_free(ll);
+
+    return 0;
+}

examples/iterators/list.c

@@ -0,0 +1,58 @@
+/**
+ * list.c
+ *
+ * Creation Date: 11/04/2019
+ *
+ * Authors:
+ * Leonardo Vencovsky (https://github.com/LeoVen)
+ *
+ */
+#include <stdio.h>
+#include <stdlib.h>
+#include "list.h"
+
+LIST_GENERATE(l, list, static, int)
+
+int main(int argc, char const *argv[])
+{
+    size_t i;
+    int r;
+
+    // Initialize list and add some elements
+    list *l = l_new(10);
+    for (int i = 0; i < 10; i++)
+        l_push_back(l, i);
+
+    // Initialize iterator
+    list_iter iter;
+    l_iter_new(&iter, l);
+
+    // Make the iterator go back and forward
+    for (int j = 0; j < 4; j++)
+    {
+        while (l_iter_next(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n");
+        while (l_iter_prev(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n\n");
+    }
+
+    for (l_iter_tostart(&iter); !l_iter_end(&iter); /**/)
+    {
+        l_iter_next(&iter, &r, &i);
+        printf("L[%2d] = %2d\n", i, r);
+    }
+
+    printf("\n");
+
+    for (l_iter_toend(&iter); !l_iter_start(&iter); /**/)
+    {
+        l_iter_prev(&iter, &r, &i);
+        printf("L[%2d] = %2d\n", i, r);
+    }
+
+    l_free(l);
+
+    return 0;
+}

examples/iterators/queue.c

@@ -0,0 +1,58 @@
+/**
+ * queue.c
+ *
+ * Creation Date: 11/04/2019
+ *
+ * Authors:
+ * Leonardo Vencovsky (https://github.com/LeoVen)
+ *
+ */
+#include <stdio.h>
+#include <stdlib.h>
+#include "queue.h"
+
+QUEUE_GENERATE(q, queue, static, int)
+
+int main(int argc, char const *argv[])
+{
+    size_t i;
+    int r;
+
+    // Initialize queue and add some elements
+    queue *q = q_new(10);
+    for (int i = 0; i < 10; i++)
+        q_enqueue(q, i);
+
+    // Initialize iterator
+    queue_iter iter;
+    q_iter_new(&iter, q);
+
+    // Make the iterator go back and forward
+    for (int j = 0; j < 4; j++)
+    {
+        while (q_iter_next(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n");
+        while (q_iter_prev(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n\n");
+    }
+
+    for (q_iter_tostart(&iter); !q_iter_end(&iter); /**/)
+    {
+        q_iter_next(&iter, &r, &i);
+        printf("Q[%2d] = %2d\n", i, r);
+    }
+
+    printf("\n");
+
+    for (q_iter_toend(&iter); !q_iter_start(&iter); /**/)
+    {
+        q_iter_prev(&iter, &r, &i);
+        printf("Q[%2d] = %2d\n", i, r);
+    }
+
+    q_free(q);
+
+    return 0;
+}

examples/iterators/stack.c

@@ -0,0 +1,58 @@
+/**
+ * stack.c
+ *
+ * Creation Date: 11/04/2019
+ *
+ * Authors:
+ * Leonardo Vencovsky (https://github.com/LeoVen)
+ *
+ */
+#include <stdio.h>
+#include <stdlib.h>
+#include "stack.h"
+
+STACK_GENERATE(s, stack, static, int)
+
+int main(int argc, char const *argv[])
+{
+    size_t i;
+    int r;
+
+    // Initialize stack and add some elements
+    stack *s = s_new(10);
+    for (int i = 0; i < 10; i++)
+        s_push(s, i);
+
+    // Initialize iterator
+    stack_iter iter;
+    s_iter_new(&iter, s);
+
+    // Make the iterator go back and forward
+    for (int j = 0; j < 4; j++)
+    {
+        while (s_iter_next(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n");
+        while (s_iter_prev(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n\n");
+    }
+
+    for (s_iter_tostart(&iter); !s_iter_end(&iter); /**/)
+    {
+        s_iter_next(&iter, &r, &i);
+        printf("S[%2d] = %2d\n", i, r);
+    }
+
+    printf("\n");
+
+    for (s_iter_toend(&iter); !s_iter_start(&iter); /**/)
+    {
+        s_iter_prev(&iter, &r, &i);
+        printf("S[%2d] = %2d\n", i, r);
+    }
+
+    s_free(s);
+
+    return 0;
+}

examples/iterators/treemap.c

@@ -0,0 +1,64 @@
+/**
+ * treemap.c
+ *
+ * Creation Date: 11/04/2019
+ *
+ * Authors:
+ * Leonardo Vencovsky (https://github.com/LeoVen)
+ *
+ */
+#include <stdio.h>
+#include <stdlib.h>
+#include "treemap.h"
+
+int intcmp(int a, int b)
+{
+    return a - b;
+}
+
+TREEMAP_GENERATE(tm, tmap, static, int, double)
+
+int main(int argc, char const *argv[])
+{
+    size_t i;
+    int k;
+    double v, varr[10] = {0.0, 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9};
+
+    // Initialize treemap and add some element
+    tmap *tm = tm_new(intcmp);
+    for (int i = 0; i < 10; i++)
+        tm_insert(tm, i, varr[i]);
+
+    // Initialize iterator
+    tmap_iter iter;
+    tm_iter_new(&iter, tm);
+
+    // Make the iterator go back and forward
+    for (int j = 0; j < 4; j++)
+    {
+        while (tm_iter_next(&iter, &k, &v, &i))
+            printf("S[%2d] = { %2d : %2.2lf }\n", i, k, v);
+        printf("\n");
+        while (tm_iter_prev(&iter, &k, &v, &i))
+            printf("S[%2d] = { %2d : %2.2lf }\n", i, k, v);
+        printf("\n\n");
+    }
+
+    for (tm_iter_tostart(&iter); !tm_iter_end(&iter); /**/)
+    {
+        tm_iter_next(&iter, &k, &v, &i);
+        printf("M[%2d] = { %2d : %2.2lf }\n", i, k, v);
+    }
+
+    printf("\n");
+
+    for (tm_iter_toend(&iter); !tm_iter_start(&iter); /**/)
+    {
+        tm_iter_prev(&iter, &k, &v, &i);
+        printf("M[%2d] = { %2d : %2.2lf }\n", i, k, v);
+    }
+
+    tm_free(tm);
+
+    return 0;
+}

examples/iterators/treeset.c

@@ -0,0 +1,63 @@
+/**
+ * treeset.c
+ *
+ * Creation Date: 11/04/2019
+ *
+ * Authors:
+ * Leonardo Vencovsky (https://github.com/LeoVen)
+ *
+ */
+#include <stdio.h>
+#include <stdlib.h>
+#include "treeset.h"
+
+int intcmp(int a, int b)
+{
+    return a - b;
+}
+
+TREESET_GENERATE(ts, tset, static, int)
+
+int main(int argc, char const *argv[])
+{
+    size_t i;
+    int r;
+
+    // Initialize treeset and add some elements
+    tset *ts = ts_new(intcmp);
+    for (int i = 0; i < 10; i++)
+        ts_insert(ts, i);
+
+    // Initialize iterator
+    tset_iter iter;
+    ts_iter_new(&iter, ts);
+
+    // Make the iterator go back and forward
+    for (int j = 0; j < 4; j++)
+    {
+        while (ts_iter_next(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n");
+        while (ts_iter_prev(&iter, &r, &i))
+            printf("C[%2d] = %2d\n", i, r);
+        printf("\n\n");
+    }
+
+    for (ts_iter_tostart(&iter); !ts_iter_end(&iter); /**/)
+    {
+        ts_iter_next(&iter, &r, &i);
+        printf("S[%2d] = %2d\n", i, r);
+    }
+
+    printf("\n");
+
+    for (ts_iter_toend(&iter); !ts_iter_start(&iter); /**/)
+    {
+        ts_iter_prev(&iter, &r, &i);
+        printf("S[%2d] = %2d\n", i, r);
+    }
+
+    ts_free(ts);
+
+    return 0;
+}