adjust usage of random to changes in Fuzion base API

Author: simonvonhackewitz

benchmarks/priority_queue_benchmark.fz

@@ -45,7 +45,7 @@ priority_queue_benchmark =>
             for t := time.duration.zero, t + dur
                 i in 1..size
             do
-              rand := random.next_i32
+              rand := random.env.next_i32
               dur := time.stopwatch (()->q.enqueue rand)
               hist_enq.add dur
             else
@@ -95,14 +95,14 @@ priority_queue_benchmark =>
         q := container.Binary_Heap_Queue m i32 .empty_min_first (queue_size + 30).as_i64
 
         # fill queue
-        for i in 1..queue_size do q.enqueue random.next_i32
+        for i in 1..queue_size do q.enqueue random.env.next_i32
 
         hist_enq := time.histogram.new "Enqueue in queue of size $queue_size" nil 10 10
         hist_deq := time.histogram.new "Dequeue in queue of size $queue_size" nil 10 10
 
         for i in 1..sample_size
         do
-          rand := random.next_i32
+          rand := random.env.next_i32
           dur_enq :=time.stopwatch (()->q.enqueue rand)
           hist_enq.add dur_enq
           dur_deq :=time.stopwatch (()->_ := q.dequeue)
@@ -168,7 +168,7 @@ priority_queue_benchmark =>
     say "\nRandom:\n"
     simple_random 904644503766293287 ()->
       for len in test_lengths do
-        test (array i32 .new len _->random.next_i32) "random"
+        test (array i32 .new len _->random.env.next_i32) "random"
         say ""
 
     say "\nReverse ordered:\n"
@@ -215,7 +215,7 @@ priority_queue_benchmark =>
     say "Random:\n"
     simple_random 904644503766293287 ()->
       for len in test_lengths do
-        test (array i32 .new len _->random.next_i32) "random"
+        test (array i32 .new len _->random.env.next_i32) "random"
 
 
 

tests/priority_queue/priority_queue_test.fz

@@ -158,7 +158,7 @@ priority_queue_test =>
     _ := q6
     simple_random 42 ()->
       for i in 0..9
-          r := random.next_i32 199 - 99
+          r := random.env.next_i32 199 - 99
       do
         say "enqueue $r"
         q6.enqueue r
@@ -180,7 +180,7 @@ priority_queue_test =>
     m : mutate is
     m ! ()->
 
-      elements := array random_test_size _->random.next_i32
+      elements := array random_test_size _->random.env.next_i32
 
       pq_make := container.Binary_Heap_Queue m i32 .min_first_from elements
       pq_add  := container.Binary_Heap_Queue m i32 .empty_min_first
@@ -229,11 +229,11 @@ priority_queue_test =>
 
         for sort list i32 := nil, new_sort
             i in 1..test_size
-            enq := true, (random.next_i32 100) < enq_rate
+            enq := true, (random.env.next_i32 100) < enq_rate
         do
           new_sort :=
             if enq
-              e := random.next_i32 test_size
+              e := random.env.next_i32 test_size
               yak "🡩"
               q.enqueue e
               (sort ++ [e]).sort.as_list