Added <container>_<tag>_init variables; Fixed prime.c and list.c examples.

1 files changed, 8 insertions, 8 deletions

diff --git a/examples/prime.c b/examples/prime.c
index 803c772a..04f37e9a 100644
--- a/examples/prime.c
+++ b/examples/prime.c
@@ -3,20 +3,20 @@
 #include <stdlib.h>

 #include <stdio.h>

 #include <string.h>

-#include <stc/cbitvec.h>

+#include <stc/cbitset.h>

 

 static inline void sieveOfEratosthenes(size_t n)

 {

-    CBitVec prime = cbitvec_make(n + 1, true);

+    CBitset prime = cbitset_make(n + 1, true);

     printf("computing primes up to %zu\n", n);

-    cbitvec_unset(&prime, 0);

-    cbitvec_unset(&prime, 1);

+    cbitset_reset(&prime, 0);

+    cbitset_reset(&prime, 1);

 

     for (size_t i = 2; i <= n; ++i) {

         // If prime[i] is not changed, then it is a prime

-        if (cbitvec_value(&prime, i) && i*i <= n) {

+        if (cbitset_test(prime, i) && i*i <= n) {

             for (size_t j = i*i; j <= n; j += i) {

-                cbitvec_unset(&prime, j);

+                cbitset_reset(&prime, j);

             }

         }

     }

@@ -24,10 +24,10 @@ static inline void sieveOfEratosthenes(size_t n)
     // Print all prime numbers

     size_t count = 0;

     for (size_t i = 1; i <= n; ++i)

-       if (cbitvec_value(&prime, i)) ++count; // printf("%zu\n", i);

+       if (cbitset_test(prime, i)) ++count; // printf("%zu\n", i);

 

     printf("number of primes: %zu\n", count);

-    cbitvec_destroy(&prime);

+    cbitset_destroy(&prime);

 } 

 

 int main(void)