Avoid use of rand()

1 files changed, 3 insertions, 14 deletions

diff --git a/test/tree_test.c b/test/tree_test.c
index eb0eddc..4b044a1 100644
--- a/test/tree_test.c
+++ b/test/tree_test.c
@@ -14,9 +14,10 @@
   OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */
 
-#include "zix/tree.h"
+#include "test_data.h"
 
 #include "zix/common.h"
+#include "zix/tree.h"
 
 #include <inttypes.h>
 #include <stdbool.h>
@@ -46,7 +47,7 @@ ith_elem(unsigned test_num, size_t n_elems, size_t i)
     return n_elems - i; // Decreasing (worse case)
   case 2:
   default:
-    return rand() % 100; // Random
+    return lcg64(seed + i) % 100; // Random
   }
 }
 
@@ -63,8 +64,6 @@ stress(unsigned test_num, size_t n_elems)
   ZixTreeIter* ti = NULL;
   ZixTree*     t  = zix_tree_new(true, int_cmp, NULL, NULL);
 
-  srand(seed);
-
   // Insert n_elems elements
   for (size_t i = 0; i < n_elems; ++i) {
     r          = ith_elem(test_num, n_elems, i);
@@ -91,8 +90,6 @@ stress(unsigned test_num, size_t n_elems)
     return test_fail();
   }
 
-  srand(seed);
-
   // Search for all elements
   for (size_t i = 0; i < n_elems; ++i) {
     r = ith_elem(test_num, n_elems, i);
@@ -109,8 +106,6 @@ stress(unsigned test_num, size_t n_elems)
     }
   }
 
-  srand(seed);
-
   // Iterate over all elements
   size_t   i    = 0;
   intptr_t last = -1;
@@ -134,8 +129,6 @@ stress(unsigned test_num, size_t n_elems)
     return test_fail();
   }
 
-  srand(seed);
-
   // Iterate over all elements backwards
   i    = 0;
   last = INTPTR_MAX;
@@ -152,8 +145,6 @@ stress(unsigned test_num, size_t n_elems)
     last = iter_data;
   }
 
-  srand(seed);
-
   // Delete all elements
   for (size_t e = 0; e < n_elems; e++) {
     r = ith_elem(test_num, n_elems, e);
@@ -174,8 +165,6 @@ stress(unsigned test_num, size_t n_elems)
     return test_fail();
   }
 
-  srand(seed);
-
   // Insert n_elems elements again (to test non-empty destruction)
   for (size_t e = 0; e < n_elems; ++e) {
     r          = ith_elem(test_num, n_elems, e);