Added some examples and updated docs. Removed cvec_X_erase() and cdeq_X_erase() - may be used wrong. Use cvec_X_erase_n() instead.

Fixed type-bug in cpque.h (same was in cqueue.h).

4 files changed, 167 insertions, 1 deletions

diff --git a/examples/runall.sh b/examples/runall.sh
index cec626a6..12c72684 100644
--- a/examples/runall.sh
+++ b/examples/runall.sh
@@ -8,7 +8,7 @@ cc='gcc -std=c99 -pedantic'
 libs=''
 run=0
 if [ -z "$OS" ]; then
-    libs='-lm'
+    libs='-lm -pthread'
 fi
 if [ "$1" == '-h' -o "$1" == '--help' ]; then
   echo usage: runall.sh [-run] [compiler + options]
diff --git a/examples/sptr_pthread.c b/examples/sptr_pthread.c
new file mode 100644
index 00000000..8957a118
--- /dev/null
+++ b/examples/sptr_pthread.c
@@ -0,0 +1,61 @@
+// example based on https://en.cppreference.com/w/cpp/memory/shared_ptr

+#if defined __GNUC__ || defined __linux__

+

+#include <stdio.h>

+#include <unistd.h>

+#include <pthread.h>

+#include <time.h>

+

+struct Base

+{

+    int value;

+} typedef Base;

+

+void Base_del(Base* b) { printf("Base::~Base()\n"); }

+

+#define i_val Base

+#define i_cmp c_no_compare

+#define i_del Base_del

+#define i_tag base

+#include <stc/csptr.h>

+

+void* thr(csptr_base* lp)

+{

+    static pthread_mutex_t mtx = PTHREAD_MUTEX_INITIALIZER;

+    sleep(1);

+    c_autoscope (pthread_mutex_lock(&mtx), pthread_mutex_unlock(&mtx))

+    {

+        printf("local pointer in a thread:\n"

+                "  p.get() = %p, p.use_count() = %zu\n", lp->get, *lp->use_count);

+    }

+    /* atomically decrease ref. */

+    csptr_base_del(lp);

+    return NULL;

+}

+

+int main()

+{

+    csptr_base p = csptr_base_make((Base){42});

+

+    printf("Created a Base\n"

+           "  p.get() = %p, p.use_count() = %zu\n", p.get, *p.use_count);

+    enum {N = 3};

+    pthread_t t[N];

+    csptr_base c[N];

+    c_forrange (i, N) {

+        c[i] = csptr_base_clone(p);

+        pthread_create(&t[i], NULL, (void*(*)(void*))thr, &c[i]);

+    }

+

+    printf("Shared ownership between %d threads and released\n"

+           "ownership from main:\n"

+           "  p.get() = %p, p.use_count() = %zu\n", N, p.get, *p.use_count);

+    csptr_base_reset(&p);

+

+    c_forrange (i, N) pthread_join(t[i], NULL);

+    printf("All threads completed, the last one deleted Base\n");

+}

+

+#else

+int main() {}

+#endif
\ No newline at end of file
diff --git a/examples/unordered_map.c b/examples/unordered_map.c
new file mode 100644
index 00000000..7af6fa0a
--- /dev/null
+++ b/examples/unordered_map.c
@@ -0,0 +1,64 @@
+// https://iq.opengenus.org/containers-cpp-stl/

+

+#define i_key int

+#define i_val int

+#include <stc/csmap.h>

+#include <stdio.h>

+

+int main() 

+{ 

+  

+    // empty map containers

+    c_auto (csmap_int, gquiz1, gquiz2)

+    { 

+        // insert elements in random order 

+        csmap_int_insert(&gquiz1, 2, 30); 

+        csmap_int_insert(&gquiz1, 4, 20); 

+        csmap_int_insert(&gquiz1, 7, 10); 

+        csmap_int_insert(&gquiz1, 5, 50); 

+        csmap_int_insert(&gquiz1, 3, 60); 

+        csmap_int_insert(&gquiz1, 1, 40); 

+        csmap_int_insert(&gquiz1, 6, 50); 

+      

+        // printing map gquiz1 

+        printf("\nThe map gquiz1 is :\n\tKEY\tELEMENT\n"); 

+        c_foreach (itr, csmap_int, gquiz1)

+            printf("\t%d\t%d\n", itr.ref->first, itr.ref->second);

+        printf("\n");

+      

+        // assigning the elements from gquiz1 to gquiz2 

+        c_foreach (i, csmap_int, gquiz1) 

+            csmap_int_insert(&gquiz2, i.ref->first, i.ref->second);

+      

+        // print all elements of the map gquiz2 

+        printf("\nThe map gquiz2 is :\n\tKEY\tELEMENT\n"); 

+        c_foreach (itr, csmap_int, gquiz2)

+            printf("\t%d\t%d\n", itr.ref->first, itr.ref->second);

+        printf("\n");

+      

+        // remove all elements up to element with key=3 in gquiz2 

+        printf("\ngquiz2 after removal of elements less than key=3 :\n");

+        printf("\tKEY\tELEMENT\n");

+        csmap_int_erase_range(&gquiz2, csmap_int_begin(&gquiz2), 

+                                       csmap_int_find(&gquiz2, 3)); 

+        c_foreach (itr, csmap_int, gquiz2)

+            printf("\t%d\t%d\n", itr.ref->first, itr.ref->second);

+        printf("\n");

+      

+        // remove all elements with key = 4 

+        int num = csmap_int_erase(&gquiz2, 4); 

+        printf("\ngquiz2.erase(4) : %d removed\n", num); 

+        printf("\tKEY\tELEMENT\n");

+        c_foreach (itr, csmap_int, gquiz2)

+            printf("\t%d\t%d\n", itr.ref->first, itr.ref->second);

+        printf("\n");

+

+        // lower bound and upper bound for map gquiz1 key = 5 

+        printf("gquiz1.lower_bound(5) : "); 

+        printf("\tKEY = %d\t", csmap_int_lower_bound(&gquiz1, 5).ref->first);

+        printf("\tELEMENT = %d\n", csmap_int_lower_bound(&gquiz1, 5).ref->second);

+        printf("gquiz1.upper_bound(5) : "); 

+        printf("\tKEY = %d\t", csmap_int_lower_bound(&gquiz1, 5+1).ref->first);

+        printf("\tELEMENT = %d\n", csmap_int_lower_bound(&gquiz1, 5+1).ref->second);

+    }

+} 

diff --git a/examples/unordered_set.c b/examples/unordered_set.c
new file mode 100644
index 00000000..f4e37cf8
--- /dev/null
+++ b/examples/unordered_set.c
@@ -0,0 +1,41 @@
+// https://iq.opengenus.org/containers-cpp-stl/

+// C program to demonstrate various function of stc cset

+#define i_key_str

+#include <stc/cset.h>

+

+int main()

+{

+    // declaring set for storing string data-type

+    c_auto (cset_str, stringSet)

+    {

+        // inserting various string, same string will be stored

+        // once in set

+        cset_str_emplace(&stringSet, "code");

+        cset_str_emplace(&stringSet, "in");

+        cset_str_emplace(&stringSet, "C");

+        cset_str_emplace(&stringSet, "is");

+        cset_str_emplace(&stringSet, "fast");

+

+        const char* key = "slow";

+

+        //     find returns end iterator if key is not found,

+        //  else it returns iterator to that key

+

+        if (cset_str_find(&stringSet, key).ref == cset_str_end(&stringSet).ref)

+            printf("\"%s\" not found\n", key);

+        else

+            printf("Found \"%s\"\n", key);

+

+        key = "C";

+        if (!cset_str_contains(&stringSet, key))

+            printf("\"%s\" not found\n", key);

+        else

+            printf("Found \"%s\"\n", key);

+

+        // now iterating over whole set and printing its

+        // content

+        printf("All elements :\n");

+        c_foreach (itr, cset_str, stringSet)

+            printf("%s\n", itr.ref->str);

+    }

+}