class RANDOM General cluster: elks description: "Pseudo-random number sequence, linear congruential method This class is adapted from work in %"Discrete-Event System Simulation%" by Jerry Banks & John S. Carson, II Prentice-Hall International Series in Industrial and Systems Engineering 1984 Example 7.12 p 266 which is from IMSL Scientific Subroutine Package [1978], written in Fortran for IBM 360/370 computers. " create: make, set_seed Ancestors COUNTABLE_SEQUENCE* [G] DOUBLE_MATH ITERATION_CURSOR* [G] Queries After: BOOLEAN arc_cosine (v: REAL_64): REAL_64 arc_sine (v: REAL_64): REAL_64 arc_tangent (v: REAL_64): REAL_64 ceiling (v: REAL_64): REAL_64 changeable_comparison_criterion: BOOLEAN cosine (v: REAL_64): REAL_64 dabs (v: REAL_64): REAL_64 Default_seed: INTEGER_32 double_i_th (i: INTEGER_32): REAL_64 double_item: REAL_64 Euler: REAL_64 exhausted: BOOLEAN exp (x: REAL_64): REAL_64 Extendible: BOOLEAN floor (v: REAL_64): REAL_64 for_all (test: FUNCTION [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 item_for_iteration: INTEGER_32 linear_representation: LINEAR [INTEGER_32] log (v: REAL_64): REAL_64 log10 (v: REAL_64): REAL_64 log_2 (v: REAL_64): REAL_64 Modulus: INTEGER_32 Multiplier: INTEGER_32 new_cursor: RANDOM next_random (n: INTEGER_32): INTEGER_32 object_comparison: BOOLEAN occurrences (v: [like item] INTEGER_32): INTEGER_32 off: BOOLEAN Pi: REAL_64 Pi_2: REAL_64 Pi_4: REAL_64 Prunable: BOOLEAN Readable: BOOLEAN real_i_th (i: INTEGER_32): REAL_32 real_item: REAL_32 Replaceable: BOOLEAN seed: INTEGER_32 sine (v: REAL_64): REAL_64 sqrt (v: REAL_64): REAL_64 Sqrt2: REAL_64 tangent (v: REAL_64): REAL_64 there_exists (test: FUNCTION [INTEGER_32, BOOLEAN]): BOOLEAN Writable: BOOLEAN Commands compare_objects compare_references do_all (action: PROCEDURE [INTEGER_32]) do_if (action: PROCEDURE [INTEGER_32]; test: FUNCTION [INTEGER_32, BOOLEAN]) extend (v: INTEGER_32) fill (other: CONTAINER [INTEGER_32]) finish forth make prune (v: INTEGER_32) prune_all (v: INTEGER_32) put (v: INTEGER_32) remove replace (v: INTEGER_32) search (v: [like item] INTEGER_32) set_seed (s: INTEGER_32) start wipe_out Constraints non negative seed non negative increment positive multiplier modulus constraint
Generated by ISE EiffelStudio