Caml1999I037B.Stdlib__Random$init@#intA@@@$unitF@@@@@@*random.mlibRRbRh@@@@@)full_init@%arrayJ@@@@@@@@@@@@ff@@3A@@)self_init@,@@@0@@@@@@.iVV/iVr@@FB@@$bits@?@@@I@@@@@@Ap  Bp  @@YC@@#int@X@@@\@@@@@@Tt ; ;Ut ; O@@lD@@(full_int@k@@@o@@@@@@g| 6 6h| 6 O@@E@@,int_in_range#min@@@#max@@@@@@@@@@@P  P @@F@@%int32@&Stdlib%Int32!t@@@ %Int32!t@@@@@@__@@G@@.int32_in_range#min%int32N@@@#max @@@@@@@@@@@ff @@H@@)nativeint@;)Nativeint!t@@@B)Nativeint!t@@@@@@p##p#M@@I@@2nativeint_in_range#min)nativeintM@@@#max @@@@@@@@@@@w  w O@@J@@%int64@s%Int64!t@@@z%Int64!t@@@@@@mmm@@(K@@.int64_in_range#min%int64O@@@#max @@@@@@@@@@@/EE0Ey@@GL@@%float@%floatD@@@@@@@@@DE@@\M@@$bool@U@@@$boolE@@@@@@YzzZz@@qN@@&bits32@j@@@%Int32!t@@@@@@op@@O@@&bits64@@@@%Int64!t@@@@@@@@P@@*nativebits@@@@)Nativeint!t@@@@@@   D@@Q@@Ӡ%State@!t;@@@A@@@@@GIGO@@@@R@A@$make@@@@[@@@\@@@]@@^@sus@@S@@.make_self_init@@@@_@@@`@@a@@@T@@$copy@!@@@b$@@@c@@d@@@U@@$bits@2@@@e@@@f@@g@@@V@@#int@D@@@h@@@@i@@@j@@k@@l@@@(W@@(full_int@\@@@m@,@@@n0@@@o@@p@@q@()0@@@X@@,int_in_range@t@@@r#minF@@@s#maxN@@@tR@@@u@@v@@w@@x@J13K1d@@bY@@%int32@@@@y@%Int32!t@@@z%Int32!t@@@{@@|@@}@hegie@@Z@@.int32_in_range@@@@~#min@@@#max@@@@@@@@@@@@@@@[@@)nativeint@@@@@ )Nativeint!t@@@)Nativeint!t@@@@@@@@@@\@@2nativeint_in_range@@@@#min@@@#max@@@@@@@@@@@@@D@@]@@%int64@@@@@K%Int64!t@@@R%Int64!t@@@@@@@@EGEj@@^@@.int64_in_range@4@@@#min@@@#max@@@@@@@@@@@@@ km k@@"_@@%float@V@@@@@@@@@@@@@@@"#@@:`@@$bool@n@@@@@@@@@45@@La@@&bits32@@@@%Int32!t@@@@@@IJ@@ab@@&bits64@@@@%Int64!t@@@@@@^_@@vc@@*nativebits@@@@)Nativeint!t@@@@@@st;@@d@@%split@@@@@@@@@@@@e@@0to_binary_string@@@@&stringQ@@@@@@!:!<!:!^@@f@@0of_binary_string@@@@@@@@@@""""@@g@@@@44%T%W@h@@@)get_state@@@@ !t@@@@@@%Y%Y%Y%x@@i@@)set_state@!t@@@@@@@@@&&&&"@@j@@%split@@@@)!t@@@@@@&&&&@@k@@@t\.Stdlib__Random0 "8i*ے1Stdlib__Nativeint0Q:38Yh$ce𬠠-Stdlib__Int640l-J ~m-۠-Stdlib__Int320 u&&Stdlib0Lku]8_٠8CamlinternalFormatBasics0%FU(Q/Tu@@@Caml1999T037gPHpC.Stdlib__Random*ocaml.text&_none_@@A  Pseudo-random number generators (PRNG). With multiple domains, each domain has its own generator that evolves independently of the generators of other domains. When a domain is created, its generator is initialized by splitting the state of the generator associated with the parent domain. In contrast, all threads within a domain share the same domain-local generator. Independent generators can be created with the {!Random.split} function and used with the functions from the {!Random.State} module. @before 5.0 Random value generation used a different algorithm. This affects all the functions in this module which return random values. *random.mliQ^24@@@@@@3@@@@@@#intA;@@#intA@@@@@;@A@$charB;@@$charA@@@@@A@A@&stringQ;@@&stringA@@@@@G@@@%bytesC;@@%bytesA@@@@@M@@@%floatD;@@%floatA@@@@@S@@@$boolE;@@%falsec@@]@$trued@@c@@@A@@@@@d@A@$unitF;@@"()e@@n@@@A@@@@@o@A@ #exnG;@@@A@@@@@s@@@#effH;@@O@A@A@@@@@@|@@@,continuationI;@@Q@@P@B,continuationA@nY@@@@@@@@@%arrayJ;@@R@A%arrayA@@@@@@@@@ $listK;@@S@A"[]f@@@"::g@@@T@@@ @@A@Y@@@@@@@@&optionL;@@V@A$Noneh@@@$Somei@@@@@A@Y@@@@@@@@)nativeintM;@@)nativeintA@@@@@@@@%int32N;@@%int32A@@@@@@@@%int64O;@@%int64A@@@@@@@@&lazy_tP;@@X@A&lazy_tA@Y@@@@@@@@ 5extension_constructorR;@@5extension_constructorA@@@@@@@@*floatarrayS;@@*floatarrayA@@@@@@@@&iarrayT;@@Y@A&iarrayA@Y@@@@@@@@ *atomic_locU;@@Z@A*atomic_locA@@@@@@ @@@ .Assert_failure`#@@@@@J@@@@@@@@[@@A!=ocaml.warn_on_literal_pattern%@&@0Division_by_zero]#@@@A+ . .@+End_of_file\#$@@@A366@'FailureY#,@'@@A<??@0Invalid_argumentX#5@0@@AE$H#H@-Match_failureV#>@@=@9@;@@a@@AV5Y4Y@)Not_foundZ#O@@@A^=a<a@-Out_of_memoryW#W@@@AfEiDi@.Stack_overflow^#_@@@AnMqLq@.Sys_blocked_io_#g@@@AvUyTy@)Sys_error[#o@j@@A^]@:Undefined_recursive_modulea#x@@w@s@u@@h@@Aon@:Continuation_already_takenb#@@@Awv@&Stdlib@A5 {1 Basic functions} `66`6P@@@@@@$initbRVbRZ@б@г#intbR]bR`@@ @@@@@гg$unitbRdbRh@@ @@@Ű@@@@@Ȱ@@@bRR @)ocaml.doc Initialize the domain-local generator, using the argument as a seed. The same seed will always yield the same sequence of numbers. ciid@@@@@@@@@@@񐠠@@@@@@)full_initff@б@г{%arrayf f@гܠ#int f f @@ @@@3        @ iD@A@@@ @@@ @@г$unitff@@ @@@@@@@@@@@(f @Z 5 Same as {!Random.init} but takes more data as seed. 5g6gT@@@@@@@NA@@@jI@@@@@@6)self_initLiVZMiVc@б@г$unitWiVfXiVj@@ @@@3YXXYYYYY@On8@A@@г $unitfiVngiVr@@ @@@@@@@@@@@qiVV @ r 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). ~jssn  @@@@@@@B@@@@@@@@@1$bitsp  p  @б@гD$unitp  p  @@ @@@3@J_8@A@@г#intp  p  @@ @@@@@@@@@@@p   @쐠 1 Return 30 random bits in a nonnegative integer. q  r 7 9@@@@@@@C@@@ې@@@@@@1#intt ; ?t ; B@б@г#intt ; Et ; H@@ @@@3@J_8@A@@гˠ#intt ; Lt ; O@@ @@@@@@@@@@@t ; ; @5 [Random.int bound] returns a random integer between 0 (inclusive) and [bound] (exclusive). [bound] must be greater than 0 and less than 2{^30}. @raise Invalid_argument if [bound] <= 0 or [bound] >= 2{^30}. u P Pz 2 4@@@@@@@)D@@@E$@@@@@@1(full_int'| 6 :(| 6 B@б@г#int2| 6 E3| 6 H@@ @@@343344444@J_8@A@@г#intA| 6 LB| 6 O@@ @@@@@@@@@@@L| 6 6 @~  [Random.full_int bound] returns a random integer between 0 (inclusive) and [bound] (exclusive). [bound] may 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 {!Stdlib.Invalid_argument}. @raise Invalid_argument if [bound] <= 0. @since 4.13 Y} P PZN  @@@@@@@rE@@@m@@@@@@1,int_in_rangepP  qP @б#minгP#int}P  ~P  @@ @@@3~~@La:@A@@б#maxгc#intP P @@ @@@@@гp#intP P @@ @@@ @@@@#P  @@5*@@'P  @@@P  @ߐ  [Random.int_in_range ~min ~max] returns a random integer between [min] (inclusive) and [max] (inclusive). Both [min] and [max] are allowed to be negative; [min] must be less than or equal to [max]. 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. @raise Invalid_argument if [min > max]. @since 5.2 Q  ]@@@@@@@F@@ @ΐ@@@@@@G%int32B__@б@гJ%Int32!t_ _@ __@@@@@@3@iA@A @@гb%Int32!t__@ __@@@@@@ @@@@@& @@@_ @: [Random.int32 bound] returns a random integer between 0 (inclusive) and [bound] (exclusive). [bound] must be greater than 0. @raise Invalid_argument if [bound] <= 0. `d@@@@@@@.G@@@J)@@@@@@:.int32_in_rangeC,f-f@б#minгp%int329f:f@@ @@@3;::;;;;;@Us:@A@@б#maxг%int32LfMf@@ @@@@@г%int32YfZf @@ @@@ @@@@#bf @@5*@@'ff @@@if@  [Random.int32_in_range ~min ~max] returns a random integer between [min] (inclusive) and [max] (inclusive). Both [min] and [max] are allowed to be negative; [min] must be less than or equal to [max]. @raise Invalid_argument if [min > max]. @since 5.2 vg  wn!@@@@@@@H@@ @@@@@@@G)nativeintnp#'p#0@б@г)Nativeint!tp#3p#<@ p#=p#>@@@@@@3@iA@A @@г)Nativeint!tp#Bp#K@ p#Lp#M@@@@@@ @@@@@ & @@@p## @ [Random.nativeint bound] returns a random integer between 0 (inclusive) and [bound] (exclusive). [bound] must be greater than 0. @raise Invalid_argument if [bound] <= 0. qNNu @@@@@@@I@@@吠@@@@@@:2nativeint_in_rangeow w !@б#minг2)nativeintw (w 1@@ @@@!3@Us:@A@@б#maxгE)nativeintw 9 w B@@ @@@"@@гR)nativeintw Fw O@@ @@@# @@@@$#w 5 @@5*@@%'"w $ @@@%w  @W  [Random.nativeint_in_range ~min ~max] returns a random integer between [min] (inclusive) and [max] (inclusive). Both [min] and [max] are allowed to be negative; [min] must be less than or equal to [max]. @raise Invalid_argument if [min > max]. @since 5.2 2xPP3Zk@@@@@@@KJ@@ @gF@@@@@@G%int64ImqJmv@б@г%Int64!tXmyYm~@ \m]m@@@@@@ l3_^^_____@iA@A @@г%Int64!tpmqm@ tmum@@@@@@ m @@@@@ n& @@@mm @ [Random.int64 bound] returns a random integer between 0 (inclusive) and [bound] (exclusive). [bound] must be greater than 0. @raise Invalid_argument if [bound] <= 0. AC@@@@@@@K@@@@@@@@@:.int64_in_rangeEIEW@б#minг⠐%int64E^Ec@@ @@@ o3@Us:@A@@б#maxг%int64EkEp@@ @@@ p@@г%int64EtEy@@ @@@ q @@@@ r#Eg @@5*@@ s'EZ @@@EE@  [Random.int64_in_range ~min ~max] returns a random integer between [min] (inclusive) and [max] (inclusive). Both [min] and [max] are allowed to be negative; [min] must be less than or equal to [max]. @raise Invalid_argument if [min > max]. @since 5.2 zz@@@@@@@L@@ @#@@@@@@G%float@б@гˠ%float@@ @@@ t3@`w8@A@@гڠ%float @@ @@@ u@@@@@ v@@@* @\ [Random.float bound] returns a random floating-point number between 0 and [bound] (inclusive). If [bound] is negative, the result is negative or zero. If [bound] is 0, the result is 0. 78bx@@@@@@@PM@@@lK@@@@@@1$boolNz~Oz@б@г$unitYzZz@@ @@@ w3[ZZ[[[[[@J_8@A@@г$boolhziz@@ @@@ x@@@@@ y@@@szz @ G [Random.bool ()] returns [true] or [false] with probability 0.5 each. @@@@@@@N@@@@@@@@@1&bits32@б@гF$unit@@ @@@ z3@J_8@A@@г%Int32!t@ @@@@@@ { @@@@@ |! @@@ @ | [Random.bits32 ()] returns 32 random bits as an integer between {!Int32.min_int} and {!Int32.max_int}. @since 4.14 l~@@@@@@@O@@@搠@@@@@@:&bits64@б@г$unit@@ @@@ }3@Sh8@A@@гq%Int64!t@   @@@@@@ ~ @@@@@ ! @@@ @I | [Random.bits64 ()] returns 64 random bits as an integer between {!Int64.min_int} and {!Int64.max_int}. @since 4.14 $% @@@@@@@=P@@@Y8@@@@@@:*nativebits; $< .@б@гꠐ$unitF 1G 5@@ @@@ 3HGGHHHHH@Sh8@A@@г)Nativeint!tY 9Z B@ ] C^ D@@@@@@  @@@@@ ! @@@i   @ [Random.nativebits ()] returns 32 or 64 random bits (depending on the bit width of the platform) as an integer between {!Nativeint.min_int} and {!Nativeint.max_int}. @since 4.14 vEEw @@@@@@@Q@@@@@@@@@:8 {1 Advanced functions}    (@@@@@@3@La1@A  The functions from module {!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. **02@@@@@@%StateA4;4@@h@@БA+!tBGNGO@@;@@@A@@@@@GI@: The type of PRNG states. PRPq@@@@@@@@@R@@@A@琠@@@@@@@3@L@A!@$makesys}@б@гs%arrayss@гԠ#intss@@ @@@ 3@qJD@A@@@ @@@  @@гS!tss@@ @@@ @@@@@ @@@ su @R ; Create a new state and initialize it with the given seed. -.@@@@@@@FS@@@bA@@@@@@6.make_self_initDE@б@г$unitOP@@ @@@ 3QPPQQQQQ@On8@A@@г!t^_@@ @@@ @@@@@ @@@i @ Create a new state and initialize it with a random seed chosen in a system-dependent way. The seed is obtained as described in {!Random.self_init}. vwZ@@@@@@@T@@@@@@@@@1$copy@б@г֠!t@@ @@@ 3@J_8@A@@г堐!t@@ @@@ @@@@@ @@@ @䐠 # Return a copy of the given state. @@@@@@@U@@@Ӑ@@@@@@1$bits@б@г!t@@ @@@ 3@J_8@A@@гà#int@@ @@@ @@@@@ @@@ @@ V@@ @@#int  @б@гO!t  @@ @@@ 3        @1F@A@@б@г#int " #@@ @@@ @@г #int /  0@@ @@@ @@@@@ !@@@'@@ $* @@@ =@@ UW@@@@*(full_int H I@б@г!t S! T"@@ @@@ 3 U T T U U U U U@CX@A@@б@г 7#int d& e)@@ @@@ @@г D#int q- r0@@ @@@ @@@@@ !@@@'@@ $* @@@ @@ X@@@@*,int_in_range 17 1C@б@гӠ!t 1F 1G@@ @@@ 3        @CX@A@@б#minг {#int 1O 1R@@ @@@ @@б#maxг #int 1Z 1]@@ @@@ $@@г #int 1a 1d@@ @@@ 1@@@@ 4 1V @@3(@@ 8 1K @@@?@@ <B@@@ 13@@ Y@@@@B%int32 ek ep@б@г-!t es et@@ @@@ 3        @[p@A@@б@гn%Int32!t ex e}@  e~ e@@@@@@  @@г%Int32!t e e@  e e@@@@@@ 0 @@@@@ 3$ @@@9@@ 6< @@@ -eg@@ EZ@@@@<.int32_in_range 8 9@б@г!t C D@@ @@@ 3 E D D E E E E E@Uj@A@@б#minг %int32 V W@@ @@@ @@б#maxг %int32 g h@@ @@@ $@@г %int32 t u@@ @@@ 1@@@@ 4 } @@3(@@ 8  @@@?@@ <B@@@ @@ [@@@@B)nativeint  @б@г۠!t  @@ @@@ 3        @[p@A@@б@г )Nativeint!t  @   @@@@@@  @@г 2)Nativeint!t  @   @@@@@@ 0 @@@@@ 3$ @@@9@@ 6< @@@ @@ \@@@@<2nativeint_in_range  @б@г/!t  @@ @@@ 3        @Uj@A@@б#minг A)nativeint  &@@ @@@ @@б#maxг R)nativeint . 7@@ @@@ $@@г _)nativeint "; #D@@ @@@ 1@@@@ 4 +* @@3(@@ 8 / @@@?@@ <B@@@ 5@@ M]@@@@B%int64 @EK AEP@б@г!t KES LET@@ @@@ 3 M L L M M M M M@[p@A@@б@г %Int64!t `EX aE]@  dE^ eE_@@@@@@  @@г %Int64!t vEc wEh@  zEi {Ej@@@@@@ 0 @@@@@ 3$ @@@9@@ 6< @@@ EG@@ ^@@@@<.int64_in_range kq k@б@гݠ!t k k@@ @@@ 3        @Uj@A@@б#minг 㠐%int64 k k@@ @@@ @@б#maxг %int64 k k@@ @@@ $@@г %int64 k k@@ @@@ 1@@@@ 4 k @@3(@@ 8 k @@@?@@ <B@@@ km@@ _@@@@B%float  @б@г7!t  @@ @@@ 3        @[p@A@@б@г Š%float  @@ @@@ @@г Ҡ%float  @@ @@@ @@@@@ !@@@'@@ $* @@@ %@@ =`@@@@*$bool 0 1@б@гy!t ; <@@ @@@ 3 = < < = = = = =@CX@A@@г $bool J K@@ @@@ @@@@@ @@@ U @@ ma@@ @@&bits32 ` a@б@г!t k l@@ @@@ 3 m l l m m m m m@1F@A@@г %Int32!t ~ @   @@@@@@  @@@@@ ! @@@  @@ b@@@@!&bits64  @б@г⠐!t    @@ @@@ 3        @:O@A@@г !%Int64!t  @   @@@@@@  @@@@@ ! @@@  @@ c@@@@!*nativebits  (@б@г!t + ,@@ @@@ 3        @:O@A@@г Z)Nativeint!t 0 9@  : ;@@@@@@  @@@@@ ! @@@  @ 2 These functions are the same as the basic functions, except that they use (and update) the given PRNG state instead of the default one.  <> @@@@@@@ &d@@@ B !@@@@@@:%split $ %@б@гm!t / 0@@ @@@ 3 1 0 0 1 1 1 1 1@Sh8@A@@г|!t > ?@@ @@@ @@@@@ @@@ I @ { F Draw a fresh PRNG state from the given PRNG state. (The given PRNG state is modified.) The new PRNG is statistically independent from the given PRNG. Data can be drawn from both PRNGs, in any order, without risk of correlation. Both PRNGs can be split later, arbitrarily many times. @since 5.0  V W!%!8@@@@@@@ oe@@@  j@@@@@@10to_binary_string m!:!@ n!:!P@б@г!t x!:!S y!:!T@@ @@@ 3 z y y z z z z z@J_8@A@@г N&string !:!X !:!^@@ @@@ @@@@@ @@@ !:!< @ Đ ^ Serializes the PRNG state into an immutable sequence of bytes. See {!of_binary_string} for deserialization. The [string] type is intended here for serialization only, the encoding is not human-readable and may not be printable. Note that the serialization format may differ across OCaml versions. @since 5.1  !_!a ""@@@@@@@ f@@@  @@@@@@10of_binary_string "" ""@б@г &string "" ""@@ @@@ 3        @J_8@A@@г!t "" ""@@ @@@ @@@@@ @@@ "" @ a Deserializes a byte sequence obtained by calling {!to_binary_string}. The resulting PRNG state will produce the same random numbers as the state that was passed as input to {!to_binary_string}. @raise Failure if the input is not in the expected format. Note that the serialization format may differ across OCaml versions. Unlike the functions provided by the {!Marshal} module, this function either produces a valid state or fails cleanly with a [Failure] exception. It can be safely used on user-provided, untrusted inputs. @since 5.1  "" %O%S@@@@@@@g@@@  @@@@@@1@;5A@@@vO@/@@@0@)@@4@-@@2@+@@@V@O@@@qJ@@3      @^sL@A/'4C(%T%W@@@*44@@)get_state4%Y%]5%Y%f@б@г 㠐$unit?%Y%i@%Y%m@@ @@@ 3A@@AAAAA@@A@d.@@@Y@R@@@z/@(@@~-@&@@|C@<@@@p@P)@ @@@@K@A65@@г!t%State%Y%q%Y%v@ %Y%w%Y%x@@@@@@ =F @@@L@@ >IO @@@%Y%Y @  [get_state()] returns a fresh copy of the current state of the domain-local generator (which is used by the basic functions). %y%y%&@@@@@@@i@@@ @@@@@@h)set_state&&&&@б@г!t%State&&&&@ &&&&@@@@@@ ?3@A@A @@г{$unit&&&&"@@ @@@ @@@@@@ A@@@&& @  [set_state s] updates the current state of the domain-local generator (which is used by the basic functions) by copying the state [s] into it. &#&#&&@@@@@@@j@@@ $@@@@@@1%split&&&&@б@г$unit&&&&@@ @@@ B3@Jh8@A@@гo!t%State$&&%&&@ (&&)&&@@@@@@ C @@@@@ D! @@@4&& @ f 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.) See {!Random.State.split}. @since 5.0 A &&B ''@@@@@@@Zk@@@ vU@@@@@@:@  @ d .@  @  @  Y@ 9 @  @  Z@ : @  @  C@ # @  @ k D@ $@@]@= @@R@N@@I@@{K@@3zyyzzzzz@h}M@A@ H************************************************************************A@@A@L@ H BMMBM@ H OCaml CC@ H DD3@ H Damien Doligez, projet Para, INRIA Rocquencourt E44E4@ H Xavier Leroy, projet Cambium, College de France and Inria FF@ H GG@ H Copyright 1996 Institut National de Recherche en Informatique et HHg@ H en Automatique. IhhIh@ H JJ@ H All rights reserved. This file is distributed under the terms of KKN@ H the GNU Lesser General Public License version 2.1, with the LOOLO@ H special exception on linking described in the file LICENSE. MM@ H NN5@ H************************************************************************O66O6@ * Pseudo-random number generators (PRNG). With multiple domains, each domain has its own generator that evolves independently of the generators of other domains. When a domain is created, its generator is initialized by splitting the state of the generator associated with the parent domain. In contrast, all threads within a domain share the same domain-local generator. Independent generators can be created with the {!Random.split} function and used with the functions from the {!Random.State} module. @before 5.0 Random value generation used a different algorithm. This affects all the functions in this module which return random values. ݠ6* {1 Basic functions} ? * Initialize the domain-local generator, using the argument as a seed. The same seed will always yield the same sequence of numbers.  6* Same as {!Random.init} but takes more data as seed.  s* 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).  k 2* Return 30 random bits in a nonnegative integer.  % * [Random.int bound] returns a random integer between 0 (inclusive) and [bound] (exclusive). [bound] must be greater than 0 and less than 2{^30}. @raise Invalid_argument if [bound] <= 0 or [bound] >= 2{^30}.  ߠ * [Random.full_int bound] returns a random integer between 0 (inclusive) and [bound] (exclusive). [bound] may 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 {!Stdlib.Invalid_argument}. @raise Invalid_argument if [bound] <= 0. @since 4.13  * [Random.int_in_range ~min ~max] returns a random integer between [min] (inclusive) and [max] (inclusive). Both [min] and [max] are allowed to be negative; [min] must be less than or equal to [max]. 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. @raise Invalid_argument if [min > max]. @since 5.2  ; * [Random.int32 bound] returns a random integer between 0 (inclusive) and [bound] (exclusive). [bound] must be greater than 0. @raise Invalid_argument if [bound] <= 0.  㠠 * [Random.int32_in_range ~min ~max] returns a random integer between [min] (inclusive) and [max] (inclusive). Both [min] and [max] are allowed to be negative; [min] must be less than or equal to [max]. @raise Invalid_argument if [min > max]. @since 5.2  * [Random.nativeint bound] returns a random integer between 0 (inclusive) and [bound] (exclusive). [bound] must be greater than 0. @raise Invalid_argument if [bound] <= 0.  - * [Random.nativeint_in_range ~min ~max] returns a random integer between [min] (inclusive) and [max] (inclusive). Both [min] and [max] are allowed to be negative; [min] must be less than or equal to [max]. @raise Invalid_argument if [min > max]. @since 5.2  Ϡ * [Random.int64 bound] returns a random integer between 0 (inclusive) and [bound] (exclusive). [bound] must be greater than 0. @raise Invalid_argument if [bound] <= 0.  w * [Random.int64_in_range ~min ~max] returns a random integer between [min] (inclusive) and [max] (inclusive). Both [min] and [max] are allowed to be negative; [min] must be less than or equal to [max]. @raise Invalid_argument if [min > max]. @since 5.2   * [Random.float bound] returns a random floating-point number between 0 and [bound] (inclusive). If [bound] is negative, the result is negative or zero. If [bound] is 0, the result is 0.  Ӡ H* [Random.bool ()] returns [true] or [false] with probability 0.5 each.  }* [Random.bits32 ()] returns 32 random bits as an integer between {!Int32.min_int} and {!Int32.max_int}. @since 4.14  > }* [Random.bits64 ()] returns 64 random bits as an integer between {!Int64.min_int} and {!Int64.max_int}. @since 4.14  * [Random.nativebits ()] returns 32 or 64 random bits (depending on the bit width of the platform) as an integer between {!Nativeint.min_int} and {!Nativeint.max_int}. @since 4.14 9* {1 Advanced functions}  * The functions from module {!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. u;* The type of PRNG states. K <* Create a new state and initialize it with the given seed.  * Create a new state and initialize it with a random seed chosen in a system-dependent way. The seed is obtained as described in {!Random.self_init}.  $* Return a copy of the given state. i * These functions are the same as the basic functions, except that they use (and update) the given PRNG state instead of the default one.  G* Draw a fresh PRNG state from the given PRNG state. (The given PRNG state is modified.) The new PRNG is statistically independent from the given PRNG. Data can be drawn from both PRNGs, in any order, without risk of correlation. Both PRNGs can be split later, arbitrarily many times. @since 5.0 ؠ _* Serializes the PRNG state into an immutable sequence of bytes. See {!of_binary_string} for deserialization. The [string] type is intended here for serialization only, the encoding is not human-readable and may not be printable. Note that the serialization format may differ across OCaml versions. @since 5.1  b* Deserializes a byte sequence obtained by calling {!to_binary_string}. The resulting PRNG state will produce the same random numbers as the state that was passed as input to {!to_binary_string}. @raise Failure if the input is not in the expected format. Note that the serialization format may differ across OCaml versions. Unlike the functions provided by the {!Marshal} module, this function either produces a valid state or fails cleanly with a [Failure] exception. It can be safely used on user-provided, untrusted inputs. @since 5.1 L * [get_state()] returns a fresh copy of the current state of the domain-local generator (which is used by the basic functions).  * [set_state s] updates the current state of the domain-local generator (which is used by the basic functions) by copying the state [s] into it. K * 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.) See {!Random.State.split}. @since 5.0 @?)../ocamlc0-strict-sequence(-absname"-w5+a-4-9-41-42-44-45-48"-g+-warn-error"+A*-bin-annot)-nostdlib*-principal"-o2stdlib__Random.cmi"-cJK Z/home/teraram/ci/builds/workspace/parallel-build/flambda/true/label/ocaml-manycores/stdlib @@0BU}lwb٭3ONNOOOOO@M@@8CamlinternalFormatBasics0%FU(Q/Tu&Stdlib0Lku]8_٠-Stdlib__Int320 u&-Stdlib__Int640l-J ~m-۠1Stdlib__Nativeint0Q:38Yh$ce𬠠0 "8i*ے@0 "8i*ےAl @@@@C@@  U  @@E@?@հ@1][ R  2 l } Z@  P a @iA{ Ґ @wo@+e@ݐ Ԑ @ϐ%@ D~@ ې @@  @ @@0@@v,a@ ; u@@  @אǐE@ǰ ِ +@&@@P@@