diff options
| author | Tyge Løvset <[email protected]> | 2021-01-19 15:59:01 +0100 |
|---|---|---|
| committer | Tyge Løvset <[email protected]> | 2021-01-19 15:59:01 +0100 |
| commit | b16aa1db5d453f19a1851b411e7ec67a653782ff (patch) | |
| tree | f33839c7ba2e73aac3dab63ae356e76e27546acd /examples | |
| parent | 19c810bfe2e4dbb9026a1519880a0fb1fa466bad (diff) | |
| download | STC-modified-b16aa1db5d453f19a1851b411e7ec67a653782ff.tar.gz STC-modified-b16aa1db5d453f19a1851b411e7ec67a653782ff.zip | |
Renamed cbitset to cbits. Added more docs.
Diffstat (limited to 'examples')
| -rw-r--r-- | examples/bits.c | 54 | ||||
| -rw-r--r-- | examples/prime.c | 22 |
2 files changed, 38 insertions, 38 deletions
diff --git a/examples/bits.c b/examples/bits.c index a720ae64..0cbe0f46 100644 --- a/examples/bits.c +++ b/examples/bits.c @@ -1,57 +1,57 @@ #include <stdio.h>
-#include <stc/cbitset.h>
+#include <stc/cbits.h>
int main() {
- cbitset_t set = cbitset_with_size(23, true);
- printf("count %zu, %zu\n", cbitset_count(set), set.size);
+ cbits_t set = cbits_with_size(23, true);
+ printf("count %zu, %zu\n", cbits_count(set), set.size);
- cbitset_reset(&set, 9);
- cbitset_resize(&set, 43, false);
+ cbits_reset(&set, 9);
+ cbits_resize(&set, 43, false);
c_withbuffer (str, char, set.size + 1)
- printf(" str: %s\n", cbitset_to_str(set, str, 0, -1));
+ printf(" str: %s\n", cbits_to_str(set, str, 0, -1));
printf("%4zu: ", set.size);
c_forrange (i, int, set.size)
- printf("%d", cbitset_test(set, i));
+ printf("%d", cbits_test(set, i));
puts("");
- cbitset_set(&set, 28);
- cbitset_resize(&set, 77, true);
- cbitset_resize(&set, 93, false);
- cbitset_resize(&set, 102, true);
- cbitset_set_value(&set, 99, false);
+ cbits_set(&set, 28);
+ cbits_resize(&set, 77, true);
+ cbits_resize(&set, 93, false);
+ cbits_resize(&set, 102, true);
+ cbits_set_value(&set, 99, false);
printf("%4zu: ", set.size);
c_forrange (i, int, set.size)
- printf("%d", cbitset_test(set, i));
+ printf("%d", cbits_test(set, i));
puts("\nIterator:");
printf("%4zu: ", set.size);
- c_foreach (i, cbitset, set)
- printf("%d", cbitset_itval(i));
+ c_foreach (i, cbits, set)
+ printf("%d", cbits_itval(i));
puts("");
- cbitset_t s2 = cbitset_clone(set);
- cbitset_flip_all(&s2);
- cbitset_set(&s2, 16);
- cbitset_set(&s2, 17);
- cbitset_set(&s2, 18);
+ cbits_t s2 = cbits_clone(set);
+ cbits_flip_all(&s2);
+ cbits_set(&s2, 16);
+ cbits_set(&s2, 17);
+ cbits_set(&s2, 18);
printf(" new: ");
c_forrange (i, int, s2.size)
- printf("%d", cbitset_test(s2, i));
+ printf("%d", cbits_test(s2, i));
puts("");
printf(" xor: ");
- cbitset_xor_with(&set, s2);
+ cbits_xor_with(&set, s2);
c_forrange (i, int, set.size)
- printf("%d", cbitset_test(set, i));
+ printf("%d", cbits_test(set, i));
puts("");
- cbitset_set_all(&set, false);
+ cbits_set_all(&set, false);
printf("%4zu: ", set.size);
c_forrange (i, int, set.size)
- printf("%d", cbitset_test(set, i));
+ printf("%d", cbits_test(set, i));
puts("");
- cbitset_del(&s2);
- cbitset_del(&set);
+ cbits_del(&s2);
+ cbits_del(&set);
}
\ No newline at end of file diff --git a/examples/prime.c b/examples/prime.c index 95e1fd46..f5e9d4a5 100644 --- a/examples/prime.c +++ b/examples/prime.c @@ -1,17 +1,17 @@ #include <stdio.h>
-#include <stc/cbitset.h>
+#include <stc/cbits.h>
-static inline cbitset_t sieveOfEratosthenes(size_t n)
+static inline cbits_t sieveOfEratosthenes(size_t n)
{
- cbitset_t pbits = cbitset_with_size(n + 1, true);
- cbitset_reset(&pbits, 0);
- cbitset_reset(&pbits, 1);
+ cbits_t pbits = cbits_with_size(n + 1, true);
+ cbits_reset(&pbits, 0);
+ cbits_reset(&pbits, 1);
c_forrange (i, size_t, 2, n+1) {
// If pbits[i] is not changed, then it is a prime
- if (cbitset_test(pbits, i) && i*i <= n) {
+ if (cbits_test(pbits, i) && i*i <= n) {
c_forrange (j, size_t, i*i, n+1, i) {
- cbitset_reset(&pbits, j);
+ cbits_reset(&pbits, j);
}
}
}
@@ -24,16 +24,16 @@ int main(void) int n = 100000000;
printf("computing prime numbers up to %u\n", n);
- cbitset_t primes = sieveOfEratosthenes(n);
+ cbits_t primes = sieveOfEratosthenes(n);
puts("done");
- size_t np = cbitset_count(primes);
+ size_t np = cbits_count(primes);
printf("number of primes: %zu\n", np);
printf("2 ");
c_forrange (i, int, 3, 1001, 2) {
- if (cbitset_test(primes, i)) printf("%d ", i);
+ if (cbits_test(primes, i)) printf("%d ", i);
}
puts("");
- cbitset_del(&primes);
+ cbits_del(&primes);
}
\ No newline at end of file |
