module BatRandom:Pseudo-random number generators (PRNG).sig
..end
This module extends Stdlib's
Random
module, go there for documentation on the rest of the functions
and types.
Author(s): Damien Doligez (base library), David Teller, Pierre Chambart
val init : int -> unit
val full_init : int array -> unit
Random.init
but takes more data as seed.val self_init : unit -> unit
val bits : unit -> int
val int : int -> int
Random.int bound
returns a random integer between 0 (inclusive)
and bound
(exclusive). bound
must be greater than 0 and less
than 230.val int32 : Int32.t -> Int32.t
Random.int32 bound
returns a random integer between 0 (inclusive)
and bound
(exclusive). bound
must be greater than 0.val nativeint : Nativeint.t -> Nativeint.t
Random.nativeint bound
returns a random integer between 0 (inclusive)
and bound
(exclusive). bound
must be greater than 0.val int64 : Int64.t -> Int64.t
Random.int64 bound
returns a random integer between 0 (inclusive)
and bound
(exclusive). bound
must be greater than 0.val float : float -> float
Random.float bound
returns a random floating-point number
between 0 (inclusive) and bound
(exclusive). If bound
is
negative, the result is negative or zero. If bound
is 0,
the result is 0.val bool : unit -> bool
Random.bool ()
returns true
or false
with probability 0.5 each.val char : unit -> char
These enumerations may be cloned without loss of performance,
to obtain reproducible enumerations of pseudo-random numbers.
val enum_bits : unit -> int BatEnum.t
val enum_int : int -> int BatEnum.t
val enum_bool : unit -> bool BatEnum.t
val enum_float : float -> float BatEnum.t
val enum_int32 : Int32.t -> Int32.t BatEnum.t
val enum_int64 : Int64.t -> Int64.t BatEnum.t
val enum_nativeint : Nativeint.t -> Nativeint.t BatEnum.t
val enum_char : unit -> char BatEnum.t
val choice : 'a BatEnum.t -> 'a
choice e
returns a randomly-chosen element of e
.
This function only works on finite enumerations with
less than 230 elements.
val shuffle : 'a BatEnum.t -> 'a array
shuffle e
returns a new array, containing the
same set of elements as e
, but in a random order.
Shuffling is implemented using the Fisher-Yates
algorithm and works in O(n), where n is the number
of elements of e
.
This function only works on finite enumerations with
less than 230 elements.
module State:sig
..end
val get_state : unit -> State.t
val set_state : State.t -> unit