class RANDOM General cluster: base description: "Pseudo-random number sequence, linear congruential method" create: set_seed, make Ancestors COUNTABLE_SEQUENCE* [G] DOUBLE_MATH Queries After: BOOLEAN changeable_comparison_criterion: BOOLEAN Default_seed: INTEGER_32 double_i_th (i: INTEGER_32): REAL_64 double_item: REAL_64 exhausted: BOOLEAN Extendible: BOOLEAN for_all (test: FUNCTION [ANY, TUPLE [INTEGER_32], BOOLEAN]): BOOLEAN Full: BOOLEAN has (n: INTEGER_32): BOOLEAN i_th (i: INTEGER_32): INTEGER_32 Increment: INTEGER_32 index: INTEGER_32 index_of (v: [like item] INTEGER_32; i: INTEGER_32): INTEGER_32 Is_empty: BOOLEAN is_inserted (v: INTEGER_32): BOOLEAN item: INTEGER_32 Modulus: INTEGER_32 Multiplier: INTEGER_32 next_random (n: INTEGER_32): INTEGER_32 object_comparison: BOOLEAN occurrences (v: [like item] INTEGER_32): INTEGER_32 off: BOOLEAN Prunable: BOOLEAN Readable: BOOLEAN real_i_th (i: INTEGER_32): REAL_32 real_item: REAL_32 seed: INTEGER_32 there_exists (test: FUNCTION [ANY, TUPLE [INTEGER_32], BOOLEAN]): BOOLEAN Writable: BOOLEAN Commands compare_objects compare_references do_all (action: PROCEDURE [ANY, TUPLE [INTEGER_32]]) do_if (action: PROCEDURE [ANY, TUPLE [INTEGER_32]]; test: FUNCTION [ANY, TUPLE [INTEGER_32], BOOLEAN]) forth make search (v: [like item] INTEGER_32) set_seed (s: INTEGER_32) start Constraints non negative seed non negative increment positive multiplier modulus constraint