module BatRandom: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 -> unitval full_init : int array -> unitRandom.init but takes more data as seed.val self_init : unit -> unitval bits : unit -> intval int : int -> intRandom.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.tRandom.int32 bound returns a random integer between 0 (inclusive)
and bound (exclusive). bound must be greater than 0.val nativeint : Nativeint.t -> Nativeint.tRandom.nativeint bound returns a random integer between 0 (inclusive)
and bound (exclusive). bound must be greater than 0.val int64 : Int64.t -> Int64.tRandom.int64 bound returns a random integer between 0 (inclusive)
and bound (exclusive). bound must be greater than 0.val float : float -> floatRandom.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 -> boolRandom.bool () returns true or false with probability 0.5 each.val char : unit -> charval full_range_int : unit -> intfull_range_int () returns the maximum entropy possible in a
single int: 31 bits on 32-bit platforms and 63 bits on 64-bit
platforms. Intentionally gives different results on different
platforms, so is not portable.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.tval choice : 'a BatEnum.t -> 'achoice e returns a randomly-chosen element of e.
This function only works on finite enumerations with
less than 230 elements.
val multi_choice : int -> 'a BatEnum.t -> 'a BatEnum.tmulti_choice n e returns an enumeration of n
randomly-chosen elements of e.val shuffle : 'a BatEnum.t -> 'a arrayshuffle 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.tval set_state : State.t -> unitmodule Incubator:sig..end