Renamed stc64_random() => crandom(), stc64_srandom(seed) => csrandom(seed). Kept old names for backward comp.

1 files changed, 12 insertions, 12 deletions

diff --git a/benchmarks/plotbench/clist_benchmark.cpp b/benchmarks/plotbench/clist_benchmark.cpp
index eaa18201..c82c9506 100644
--- a/benchmarks/plotbench/clist_benchmark.cpp
+++ b/benchmarks/plotbench/clist_benchmark.cpp
@@ -27,9 +27,9 @@ Sample test_std_forward_list() {
     {

         s.test[INSERT].t1 = clock();

         container con;

-        stc64_srandom(seed);

-        c_forrange (N/2) con.push_front(stc64_random() & mask1);

-        c_forrange (N/2) con.push_front(stc64_random() & mask1);

+        csrandom(seed);

+        c_forrange (N/2) con.push_front(crandom() & mask1);

+        c_forrange (N/2) con.push_front(crandom() & mask1);

         s.test[INSERT].t2 = clock();

         s.test[INSERT].sum = 0;

         s.test[ERASE].t1 = clock();

@@ -38,13 +38,13 @@ Sample test_std_forward_list() {
         s.test[ERASE].sum = 0;

      }{

         container con;

-        stc64_srandom(seed);

-        c_forrange (N) con.push_front(stc64_random() & mask2);

+        csrandom(seed);

+        c_forrange (N) con.push_front(crandom() & mask2);

         s.test[FIND].t1 = clock();

         size_t sum = 0;

         container::iterator it;

         // Iteration - not inherent find - skipping

-        //c_forrange (S) if ((it = std::find(con.begin(), con.end(), stc64_random() & mask2)) != con.end()) sum += *it;

+        //c_forrange (S) if ((it = std::find(con.begin(), con.end(), crandom() & mask2)) != con.end()) sum += *it;

         s.test[FIND].t2 = clock();

         s.test[FIND].sum = sum;

         s.test[ITER].t1 = clock();

@@ -69,9 +69,9 @@ Sample test_stc_forward_list() {
     {

         s.test[INSERT].t1 = clock();

         container con = clist_x_init();

-        stc64_srandom(seed);

-        c_forrange (N/2) clist_x_push_front(&con, stc64_random() & mask1);

-        c_forrange (N/2) clist_x_push_back(&con, stc64_random() & mask1);

+        csrandom(seed);

+        c_forrange (N/2) clist_x_push_front(&con, crandom() & mask1);

+        c_forrange (N/2) clist_x_push_back(&con, crandom() & mask1);

         s.test[INSERT].t2 = clock();

         s.test[INSERT].sum = 0;

         s.test[ERASE].t1 = clock();

@@ -80,13 +80,13 @@ Sample test_stc_forward_list() {
         s.test[ERASE].sum = 0;

         clist_x_drop(&con);

      }{

-        stc64_srandom(seed);

+        csrandom(seed);

         container con = clist_x_init();

-        c_forrange (N) clist_x_push_front(&con, stc64_random() & mask2);

+        c_forrange (N) clist_x_push_front(&con, crandom() & mask2);

         s.test[FIND].t1 = clock();

         size_t sum = 0;

         //clist_x_iter it, end = clist_x_end(&con);

-        //c_forrange (S) if ((it = clist_x_find(&con, stc64_random() & mask2)).ref != end.ref) sum += *it.ref;

+        //c_forrange (S) if ((it = clist_x_find(&con, crandom() & mask2)).ref != end.ref) sum += *it.ref;

         s.test[FIND].t2 = clock();

         s.test[FIND].sum = sum;

         s.test[ITER].t1 = clock();