Stdlib.Random(3)
π Stdlib.Random(3) π
okay so this is the OCaml library manual page for Stdlib.Random, and bestie we are absolutely getting into it. β¨
β¨ NAME β¨
Stdlib.Random β and the description is literally no description π. Minimalist. Iconic. No notes.
π¦ Module π¦
Module Stdlib.Random
π Documentation π
Module Random : (module Stdlib__Random)
πΈ Basic functions πΈ
val init : int -> unitβ Initialize the domain-local generator, using the argument as a seed. The same seed will always yield the same sequence of numbers. Lowkey deterministic queen πval full_init : int array -> unitβ Same asRandom.initbut takes more data as seed.val self_init : unit -> unitβ Initialize the domain-local generator with a random seed chosen in a system-dependent way. If a cryptographically secure pseudorandom number generator is available on the host machine, it is used to provide a highly random initial seed. Otherwise, a less random seed is computed from system parameters (current time, process IDs, domain-local state).val bits : unit -> intβ Return 30 random bits in a nonnegative integer.val int : int -> intβRandom.int boundreturns a random integer between 0 (inclusive) andbound(exclusive).boundmust be greater than 0 and less than2^30.
Raises Invalid_argument if bound <= 0 or bound >= 2^30.
val full_int : int -> intβRandom.full_int boundreturns a random integer between 0 (inclusive) andbound(exclusive).boundmay be any positive integer.
If bound is less than 2^31, then Random.full_int bound yields identical output across systems with varying int sizes.
If bound is less than 2^30, then Random.full_int bound is equal to Random.int bound.
If bound is at least 2^30 (on 64-bit systems, or non-standard environments such as JavaScript), then Random.full_int returns a value whereas Random.int raises Invalid_argument.
Since 4.13
Raises Invalid_argument if bound <= 0.
val int_in_range : min:int -> max:int -> intβRandom.int_in_range ~min ~maxreturns a random integer betweenmin(inclusive) andmax(inclusive). Bothminandmaxare allowed to be negative;minmust be less than or equal tomax.
If both bounds fit in 32-bit signed integers (that is, if -2^31 <= min and max < 2^31), then int_in_range yields identical output across systems with varying int sizes.
Since 5.2
Raises Invalid_argument if min > max.
val int32 : Int32.t -> Int32.tβRandom.int32 boundreturns a random integer between 0 (inclusive) andbound(exclusive).boundmust be greater than 0.
Raises Invalid_argument if bound <= 0.
val int32_in_range : min:int32 -> max:int32 -> int32βRandom.int32_in_range ~min ~maxreturns a random integer betweenmin(inclusive) andmax(inclusive). Bothminandmaxare allowed to be negative;minmust be less than or equal tomax.
Since 5.2
Raises Invalid_argument if min > max.
val nativeint : Nativeint.t -> Nativeint.tβRandom.nativeint boundreturns a random integer between 0 (inclusive) andbound(exclusive).boundmust be greater than 0.
Raises Invalid_argument if bound <= 0.
val nativeint_in_range : min:nativeint -> max:nativeint -> nativeintβRandom.nativeint_in_range ~min ~maxreturns a random integer betweenmin(inclusive) andmax(inclusive). Bothminandmaxare allowed to be negative;minmust be less than or equal tomax.
Since 5.2
Raises Invalid_argument if min > max.
val int64 : Int64.t -> Int64.tβRandom.int64 boundreturns a random integer between 0 (inclusive) andbound(exclusive).boundmust be greater than 0.
Raises Invalid_argument if bound <= 0.
val int64_in_range : min:int64 -> max:int64 -> int64βRandom.int64_in_range ~min ~maxreturns a random integer betweenmin(inclusive) andmax(inclusive). Bothminandmaxare allowed to be negative;minmust be less than or equal tomax.
Since 5.2
Raises Invalid_argument if min > max.
val float : float -> floatβRandom.float boundreturns a random floating-point number between 0 andbound(inclusive). Ifboundis negative, the result is negative or zero. Ifboundis 0, the result is 0.val bool : unit -> boolβRandom.bool ()returnstrueorfalsewith probability 0.5 each.val bits32 : unit -> Int32.tβRandom.bits32 ()returns 32 random bits as an integer betweenInt32.min_intandInt32.max_int.
Since 4.14
val bits64 : unit -> Int64.tβRandom.bits64 ()returns 64 random bits as an integer betweenInt64.min_intandInt64.max_int.
Since 4.14
val nativebits : unit -> Nativeint.tβRandom.nativebits ()returns 32 or 64 random bits (depending on the bit width of the platform) as an integer betweenNativeint.min_intandNativeint.max_int.
Since 4.14
π§ Advanced functions π§
The functions from module Random.State manipulate the current state of the random generator explicitly. This allows using one or several deterministic PRNGs, even in a multi-threaded program, without interference from other parts of the program.
module State : sig end
val get_state : unit -> State.tβget_state()returns a fresh copy of the current state of the domain-local generator (which is used by the basic functions).
The current state is unchanged, which means that random numbers generated from multiple calls to get_state () will be identical.
See Random.State.make_self_init and Random.split instead to obtain a fresh state that is not shared.
val set_state : State.t -> unitβset_state supdates the current state of the domain-local generator (which is used by the basic functions) by copying the statesinto it.val split : unit -> State.tβ Draw a fresh PRNG state from the current state of the domain-local generator used by the default functions. (The state of the domain-local generator is modified.) SeeRandom.State.split.
Since 5.0
Source/version: OCamldoc Β· date: 2026-06-22 Β· page: Stdlib.Random(3). Bye bestie, go generate something cute π β¨
π¦ where this page comes from
- arch rolling: ocaml 5.5.0-1 Β· LGPL2.1 AND custom: QPL-1.0
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms