summaryrefslogtreecommitdiffhomepage
path: root/include
diff options
context:
space:
mode:
authorTyge Løvset <[email protected]>2023-03-30 17:59:08 +0200
committerTyge Løvset <[email protected]>2023-03-30 17:59:08 +0200
commita0a290645828c88597efce80f6b0f5a958cefa89 (patch)
tree53dc78071653b515a06a60baf4488a1b6d080b32 /include
parent32df5677c9906661e91aad294e45a258e2eaab18 (diff)
downloadSTC-modified-a0a290645828c88597efce80f6b0f5a958cefa89.tar.gz
STC-modified-a0a290645828c88597efce80f6b0f5a958cefa89.zip
Added crand.h - Alternative API to crandom.h, which will be deprecated.
Diffstat (limited to 'include')
-rw-r--r--include/stc/clist.h4
-rw-r--r--include/stc/cqueue.h10
2 files changed, 7 insertions, 7 deletions
diff --git a/include/stc/clist.h b/include/stc/clist.h
index eb72b888..fa26fd65 100644
--- a/include/stc/clist.h
+++ b/include/stc/clist.h
@@ -26,7 +26,7 @@
it also support both push_back() and push_front(), unlike std::forward_list:
#include <stdio.h>
- #include <stc/crandom.h>
+ #include <stc/crand.h>
#define i_key int64_t
#define i_tag ix
@@ -38,7 +38,7 @@
{
int n;
for (int i = 0; i < 1000000; ++i) // one million
- clist_ix_push_back(&list, crandom() >> 32);
+ clist_ix_push_back(&list, crand() >> 32);
n = 0;
c_foreach (i, clist_ix, list)
if (++n % 10000 == 0) printf("%8d: %10zu\n", n, *i.ref);
diff --git a/include/stc/cqueue.h b/include/stc/cqueue.h
index 67909f8e..1934305a 100644
--- a/include/stc/cqueue.h
+++ b/include/stc/cqueue.h
@@ -22,7 +22,7 @@
*/
// STC queue
/*
-#include <stc/crandom.h>
+#include <stc/crand.h>
#include <stdio.h>
#define i_key int
@@ -30,19 +30,19 @@
int main() {
int n = 10000000;
- stc64_t rng = stc64_new(1234);
- stc64_uniform_t dist = stc64_uniform_new(0, n);
+ crand_t rng = crand_init(1234);
+ crand_unif_t dist = crand_unif_init(0, n);
c_auto (cqueue_int, Q)
{
// Push ten million random numbers onto the queue.
for (int i=0; i<n; ++i)
- cqueue_int_push(&Q, stc64_uniform(&rng, &dist));
+ cqueue_int_push(&Q, crand_unif(&rng, &dist));
// Push or pop on the queue ten million times
printf("before: size, capacity: %d, %d\n", n, cqueue_int_size(&Q), cqueue_int_capacity(&Q));
for (int i=n; i>0; --i) {
- int r = stc64_uniform(&rng, &dist);
+ int r = crand_unif(&rng, &dist);
if (r & 1)
++n, cqueue_int_push(&Q, r);
else