Automatic generation produced by ISE Eiffel
class RANDOM General cluster: base.support 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 double_i_th (i: INTEGER): DOUBLE double_item: DOUBLE exhausted: BOOLEAN Extendible: BOOLEAN for_all (test: FUNCTION [ANY, TUPLE [INTEGER], BOOLEAN]): BOOLEAN Full: BOOLEAN has (n: INTEGER): BOOLEAN i_th (i: INTEGER): INTEGER Increment: INTEGER index: INTEGER index_of (v: [like item] INTEGER; i: INTEGER): INTEGER Is_empty: BOOLEAN is_inserted (v: INTEGER): BOOLEAN item: INTEGER Modulus: INTEGER Multiplier: INTEGER next_random (n: INTEGER): INTEGER object_comparison: BOOLEAN occurrences (v: INTEGER): INTEGER off: BOOLEAN Prunable: BOOLEAN Readable: BOOLEAN real_i_th (i: INTEGER): REAL real_item: REAL seed: INTEGER there_exists (test: FUNCTION [ANY, TUPLE [INTEGER], BOOLEAN]): BOOLEAN Writable: BOOLEAN Commands compare_objects compare_references do_all (action: PROCEDURE [ANY, TUPLE [INTEGER]]) do_if (action: PROCEDURE [ANY, TUPLE [INTEGER]]; test: FUNCTION [ANY, TUPLE [INTEGER], BOOLEAN]) forth make search (v: [like item] INTEGER) set_seed (s: INTEGER) start Constraints non negative seed non negative increment positive multiplier modulus constraint -- Generated by ISE Eiffel --
For more details: www.eiffel.com