Caml1999I025O3Stdlib__arrayLabels!t0!a@@A@A%arrayH @@@@@@/arrayLabels.mliP77P7K@@@@@A@&length@!a@@@@#intA@@@@@-%array_lengthAA @@@ U!U@@@#get@2!a@@@@@ @@@ @@@@/%array_safe_getBA@@@@>X?X>@@@#set@P!a@@@@@>@@@@ $unitF@@@@@@@@@/%array_safe_setCAD@@@@@eafa@@@$make@Z@@@@!a@@@@@@@@.caml_make_vectBAc@@@@ii @@@&create@x@@@@!a@@@@@@@@.caml_make_vectBA@@@@v K Kw  @0ocaml.deprecatedw  w  @7Use Array.make instead.@w  w  @@@@@w  @@@$init@@@@!f@@@@!a@@@٠@@@@@@@@z  z  $@@@+make_matrix$dimx@@@$dimy@@@@!a@ @@@@@@ @@ @@ @@ @D  D  @@@-create_matrix$dimx@@@ $dimy@@@@!a@$( @@@@@@@@@@@@@&Q'RP@0ocaml.deprecated-RPU.RPe@>Use Array.make_matrix instead.@8RPf9RP@@@@@;RPR@@@&append@L!a@@@@@W @@@\@@@@@@@@YVZV@@@&concat@$listIq!a@@@@@@@{ @@@@@@xZyyyZy@@@#sub@!a@#@@@ #posz@@@!#len@@@"@@@$@@%@@&@@'@]]@@@$copy@!a@)@@@( @@@*@@+@fhhfh@@@$fill@ʠ!a@/@@@,#pos@@@-#len@@@.@@@@0@@1@@2@@3@@4@jj,@@@$blit#src!a@7@@@5'src_pos@@@6#dst @@@8'dst_pos@@@9#len@@@:@@@;@@<@@=@@>@@?@@@@qsks@@@'to_list@-!a@B@@@Aˠ @@@C@@D@3~664~6W@@@'of_list@ڠ!a@F@@@EN @@@G@@H@KL@@@$iter!f@!a@K@@@I@@J@k@@@L@@@M@@N@@O@lmA@@@#map!f@!a@Q!b@S@@P@@@@R@@@T@@U@@V@@@@%iteri!f@@@@W@!a@[M@@@X@@Y@@Z@@@@\X@@@]@@^@@_@@@@$mapi!f@@@@`@!a@c!b@e@@a@@b@۠@@@d@@@f@@g@@h@@@@)fold_left!f@!a@m@!b@k @@i@@j$init@@@@l@@n@@o@@p@uuu@@@*fold_right!f@!b@s@!a@u@@q@@r@"@@@t$init@@v@@w@@x@#;;$;{@@@%iter2!f@!a@|@!b@~@@@y@@z@@{@I@@@}@P@@@@@@@@@@@@@Q**R*j@@@$map2!f@!a@@!b@!c@@@@@@w@@@@~@@@@@@@@@@@@@V@@@&exists!f@!a@$boolE@@@@@@@@@ @@@@@@@@@@@'for_all!f@!a@#@@@@@@à@@@.@@@@@@@@@@@#mem@!a@#setޠ @@@I@@@@@@@@    @@@$memq@!a@#set @@@d@@@@@@@@!!!!+@@@,create_float@@@@%floatD@@@@@@@@4caml_make_float_vectAA@@@!!!!@@@*make_float@ @@@-@@@@@@@@@."l"l/""@0ocaml.deprecated5""6""@?Use Array.create_float instead.@@""A""@@@@@C""@@@$sort#cmp@!a@@A@@@@@@@@d@@@@@@@@@@@e#0#0f#0#d@@@+stable_sort#cmp@!a@@d@@@@@@@@@@@+@@@@@@@@'''('@@@)fast_sort#cmp@!a@@@@@@@@@@@@@N@@@@@@@@))))@@@&to_seq@!a@@@@&Stdlib#Seq!t@@@@@@*_*_*_*@@@'to_seqi@۠!a@@@@#Seq!t@@@͠@@@@@@@@ ** **@@@&of_seq@8#Seq!t!a@@@@  @@@@@@+Q+Q+Q+r@@@*unsafe_get@!a@@@@@@@@ @@@@ِ1%array_unsafe_getBA@@@@%,,&,,^@@@*unsafe_set@7!a@@@@@%@@@@ @@@@@@@@@1%array_unsafe_setCA)@@@@@J,_,_K,_,@@@Ӡ*Floatarray@&create@E@@@*floatarrayQ@@@@@6caml_floatarray_createAAI@@@h,,i,-@@@&length@@@@a@@@@@2%floatarray_lengthAA_@@@~----?@@@#get@*@@@@y@@@@@@@@@@4%floatarray_safe_getBA{@@@@ -@-B -@-@@@#set@G@@@@@@@@@@@\@@@@@@@@@4%floatarray_safe_setCA@@@@@!--!--@@@*unsafe_get@k@@@@@@@@@@@@@@6%floatarray_unsafe_getBA@@@@"--"-.@@@*unsafe_set@@@@@@@@@@@@@@@@@@@@@6%floatarray_unsafe_setCAߠ@@@@@#. ."$.[.{@@@@@,,%.|.@@@@M>3Stdlib__arrayLabels0r2GΦ;+Stdlib__seq05Q[.ZIz[hA6&Stdlib0EQ: TnȠ8CamlinternalFormatBasics0i;5d[͔@@@Caml1999T025fd[A43Stdlib__arrayLabelsA(!tPA/arrayLabels.mliP7?P7@@А!a@ 4@@@@@@*floatarrayQ0@@@A@@@@&_none_@@A@@@@5extension_constructorP#intA0@@@A@@@@ @A$charB&stringO%floatD$boolE0@@У%false^@@@У$true_@@@@A@@@@@A$unitF0@@У"()`@@&@@A@@@@&@A##exnG0@@AA@@@@)@@&%arrayH0@@M@A@A@@@@0@@-$listI0@@N@AУ"[]a@@<@У"::b@@@O@@H@@A@Y@@@I@@F&optionJ0@@P@AУ$Nonec@@U@У$Somed@@[@@A@Y@@@\@@Y&lazy_tN0@@Q@A@A@Y@@@c@@`)nativeintKf%int32Lh%int64Mj:Undefined_recursive_module]G@j@@@Jt@@@@@@V@@A|=ocaml.warn_on_literal_pattern@@.Assert_failure\@@@X@@A@0Division_by_zeroY%@@@A@+End_of_fileX,@@@A@)Sys_errorW3@/@@A%$@.Sys_blocked_io[;@@@A,+@)Not_foundVB@@@A32@'FailureUI@E@@A;:@0Invalid_argumentTQ@M@@ACB@.Stack_overflowZY@@@AƠJI@-Out_of_memoryS`@@@A͠QP@-Match_failureRg@fbc@@c@@Aڠ^]@%bytesC2CamlinternalFormat8CamlinternalFormatBasics0CamlinternalLazy/CamlinternalMod.CamlinternalOO(Std_exit&Stdlib+Stdlib__arg-Stdlib__array0Stdlib__bigarray,Stdlib__bool.Stdlib__buffer-Stdlib__bytes3Stdlib__bytesLabels0Stdlib__callback,Stdlib__char/Stdlib__complex.Stdlib__digest1Stdlib__ephemeron0Stdlib__filename-Stdlib__float.Stdlib__format+Stdlib__fun*Stdlib__gc.Stdlib__genlex/Stdlib__hashtbl+Stdlib__int-Stdlib__int32-Stdlib__int64,Stdlib__lazy.Stdlib__lexing,Stdlib__list2Stdlib__listLabels+Stdlib__map/Stdlib__marshal2Stdlib__moreLabels1Stdlib__nativeint+Stdlib__obj*Stdlib__oo.Stdlib__option/Stdlib__parsing2Stdlib__pervasives0Stdlib__printexc.Stdlib__printf-Stdlib__queue.Stdlib__random.Stdlib__result-Stdlib__scanf+Stdlib__seq+Stdlib__set1Stdlib__spacetime-Stdlib__stack1Stdlib__stdLabels.Stdlib__stream.Stdlib__string4Stdlib__stringLabels+Stdlib__sys-Stdlib__uchar,Stdlib__unit,Stdlib__weakm0@@ @A@AҠ@B@@@B@B@ @@@P77P7K@)ocaml.docn " An alias for the type of arrays. @QLLQLs@@@@@y@@v@AP7<P7>@@B@0@A@AYC@@@@@@@ @@@Aг %arrayP7F&@А!aP7CP7E@@@.@@0-@4@@A10@*ocaml.text3 Array operations. @SuuSu@@@@@4         @ 0@A&lengthQ U!U@б@г%array+U,U@А!a@1B@& 7U8U@@@ @@@('@@гϠ#intEUFU@@ @@@,4@@@@@/7@@-%array_lengthAA @@@UUVU@ < Return the length (number of elements) of the given array. @bVcV@@@@@@@@P#getRnXoX@б@гࠐ%arrayyXzX@А!a@>B@24yxxyyyyyy@oj8@AXX@@@ @@@4 @@б@г!#intX!X$@@ @@@8@@А!a!X(X*@@@ &@@;!@@@@@<$"@@/%array_safe_getBA[@@@@XX>@ܐ ? [Array.get a n] returns the element number [n] of array [a]. The first element has number 0. The last element has number [Array.length a - 1]. You can also write [a.(n)] instead of [Array.get a n]. Raise [Invalid_argument "index out of bounds"] if [n] is outside the range 0 to [(Array.length a - 1)]. @Y??_E@@@@@S@@@=#setSaa@б@г;%arrayaa@А!a@OB@?4@\w8@Aaa@@@ @@@A @@б@г|#intaa@@ @@@E@@б@А!a#aa@@гz$unitaa@@ @@@H-@@@5@@K0@@@@@L3! @@@1@@M64@@/%array_safe_setCAȠ@@@@@aa@J  [Array.set a n x] modifies array [a] in place, replacing element number [n] with [x]. You can also write [a.(n) <- x] instead of [Array.set a n x]. Raise [Invalid_argument "index out of bounds"] if [n] is outside the range 0 to [Array.length a - 1]. @+b,g@@@@@@@@P$makeT7i8i@б@г̠#intBiCi@@ @@@P4<;;<<<<<<@i3@A@@б@А!a@\B@S UiVi@@гŠ%array^i_i@А!aeifi@@@@@@U$ @@@@@Y'@@@-@@Z*0@@.caml_make_vectBA$@@@@yizi @ 6 [Array.make n x] returns a fresh array of length [n], initialized with [x]. All the elements of this new array are initially physically equal to [x] (in the sense of the [==] predicate). Consequently, if [x] is mutable, it is shared among all elements of the array, and modifying [x] through one of the array entries will modify all other entries at the same time. Raise [Invalid_argument] if [n < 0] or [n > Sys.max_array_length]. If the value of [x] is a floating-point number, then the maximum size is only [Sys.max_array_length / 2].@jt  I@@@@@@@@C&createUv K Tv K Z@б@г'#intv K ]v K `@@ @@@]4@\q2@A@@б@А!a@iB@` v K dv K f@@г %arrayv K mv K r@А!av K jv K l@@@@@@b$ @@@@@f'@@@-@@g*0@@.caml_make_vectBA@@@@v K Kw  @0ocaml.deprecatedw  w  @7Use Array.make instead.@w  w  @@@@@w  @ ; @deprecated [Array.create] is an alias for {!Array.make}. @x  x  @@@@@@(@%$@#W&$initVz  z  @б@г#int z   z  @@ @@@j4@pF@A@@б!fб@г#int!z  "z  @@ @@@m@@А!a@zB@p0z  1z  @@@ @@q#@@г%array Sys.max_array_length]. If the return type of [f] is [float], then the maximum size is only [Sys.max_array_length / 2].@_{ % %`B  @@@@@@@%@Q+make_matrixWjD  kD  @б$dimxг#intwD  xD  @@ @@@{4qppqqqqqq@l-@A@@б$dimyг#intD  D  @@ @@@~@@б@А!a@B@D  D  @@г %arrayD  D  @г%arrayD  D  @А!a8D  D  @@@%@@@? @@@@@@D @@@.@@G)@@E:@@JD  #@@\Q@@ND  '@@@D  *@  [Array.make_matrix dimx dimy e] returns a two-dimensional array (an array of arrays) with first dimension [dimx] and second dimension [dimy]. All the elements of this new matrix are initially physically equal to [e]. The element ([x,y]) of a matrix [m] is accessed with the notation [m.(x).(y)]. Raise [Invalid_argument] if [dimx] or [dimy] is negative or greater than {!Sys.max_array_length}. If the value of [e] is a floating-point number, then the maximum size is only [Sys.max_array_length / 2]. @E  O @@@@@p@@8@a-create_matrixXQQ @б$dimxг|#intQ(Q+@@ @@@4@|-@A@@б$dimyг#intQ4Q7@@ @@@@@б@А!a@B@Q;Q=@@г%arrayQJ QO@г%array)QD*QI@А!a80QA1QC@@@%@@@? @@@@@@D @@@.@@G)@@E:@@JBQ/#@@\Q@@NFQ#'@@@IQJRP@0ocaml.deprecatedPRPUQRPe@>Use Array.make_matrix instead.@[RPf\RP@@@@@^RPR@ L @deprecated [Array.create_matrix] is an alias for {!Array.make_matrix}. @jSkT@@@@@@@$#@"v%&appendYuVvV@б@г砐%arrayVV@А!a@B@4@F@AVV@@@ @@@ @@б@г%arrayVV@А!aVV@@@$@@@  @@г%arrayVV@А!a3.VV@@@9@@@5 @@@@@8@@@6@@;9@@@V@ i [Array.append v1 v2] returns a fresh array containing the concatenation of the arrays [v1] and [v2]. @W  XGw@@@@@k@@$@M&concatZZy}Zy@б@гK$listZyZy@г\%arrayZyZy@А!a@B@4@v;@AZyZy@@@ @@@ @@@&@@@ #@@г}%arrayZyZy@А!a!ZyZy@@@'@@@# @@@@@&$@@@)Zyy@T = Same as {!Array.append}, but concatenates a list of arrays. @5[6[@@@@@@@!@8#sub[@]A]@б@г%arrayK]L]@А!a@B@4KJJKKKKKK@W|1@AY]Z]@@@ @@@ @@б#posг#intk]l]@@ @@@@@б#lenг#int|] }] @@ @@@+@@г%array]]@А!a>9]]@@@D@@@@ @@&@@C]@@;0@@G]@@@F@@KI@@@]@ϐ H [Array.sub a start len] returns a fresh array of length [len], containing the elements number [start] to [start + len - 1] of array [a]. Raise [Invalid_argument "Array.sub"] if [start] and [len] do not designate a valid subarray of [a]; that is, if [start < 0], or [len < 0], or [start + len > Array.length a]. @^d#f@@@@@F@@)@]$copy\fhlfhp@б@г-%arrayfhvfh{@А!a@B@4@|1@Afhsfhu@@@ @@@ @@гI%arrayfhfh@А!afhfh@@@"@@@ @@@@@!@@@fhh@ f [Array.copy a] returns a copy of [a], that is, a fresh array containing the same elements as [a]. @gh@@@@@@@!@3$fill] j j@б@г~%arrayjj@А!a@B@4@Rm1@A%j&j@@@ @@@ @@б#posг#int7j8j@@ @@@@@б#lenгҠ#intHjIj@@ @@@+@@б@А!a61Tj"Uj$@@гР$unit]j(^j,@@ @@@@@@@H@@C@@)@@Fij @@>3@@Jmj @@@I@@NL@@@sj@ [Array.fill a ofs len x] modifies the array [a] in place, storing [x] in elements number [ofs] to [ofs + len - 1]. Raise [Invalid_argument "Array.fill"] if [ofs] and [len] do not designate a valid subarray of [a]. @k--o@@@@@@@$@`$blit^qq@б#srcг%arrayr )r .@А!a@$B@4@3@Ar &r (@@@ @@@  @@б'src_posгA#intr :r =@@ @@@ @@б#dstг/%arrayr Hr M@А!a1,r Er G@@@7@@@3 @@б'dst_posгk#intr Yr \@@ @@@D@@б#lenг|#intr dr g@@ @@@U@@гr$unitskosks@@ @@@b@@@@er ` @@3(@@i r Q @@P>@@ mr A@@eZ@@!qr 2@@p@@"ur "@@@q@F  [Array.blit v1 o1 v2 o2 len] copies [len] elements from array [v1], starting at element number [o1], to array [v2], starting at element number [o2]. It works correctly even if [v1] and [v2] are the same array, and the source and destination chunks overlap. Raise [Invalid_argument "Array.blit"] if [o1] and [len] do not designate a valid subarray of [v1], or if [o2] and [len] do not designate a valid subarray of [v2]. @'ttt(| 4@@@@@@@*@'to_list_2~6:3~6A@б@г%array=~6G>~6L@А!a@2B@%4=<<======@1@AK~6DL~6F@@@ @@@' @@г$listY~6SZ~6W@А!a`~6Pa~6R@@@"@@@, @@@@@0!@@@l~66@ @ [Array.to_list a] returns the list of all the elements of [a]. @xXXyX@@@@@@@!@3'of_list`@б@г$list@А!a@@B@34@Rm1@A@@@ @@@5 @@г%array@А!a@@@"@@@: @@@@@>!@@@@萠 L [Array.of_list l] returns a fresh array containing the elements of [l]. @@@@@@_@@!@3$itera@б!fб@А!a@QB@A4@Lg+@A"$@@гc$unit(,@@ @@@B@@@@@E@@б@гi%array 4 9@А!a)$ 1 3@@@/@@@G+ @@г$unit = A@@ @@@K8@@@@@N;@@J,@@O> # @@@ &@Q [Array.iter f a] applies function [f] in turn to all the elements of [a]. It is equivalent to [f a.(0); f a.(1); ...; f a.(Array.length a - 1); ()]. @ 2BB 3@@@@@@@@Q#mapb = >@б!fб@А!a@bB@R4 B A A B B B B B B@j+@A P Q@@А!b@dB@S  [ \@@@ @@T@@б@гР%array i j@А!a'" p q@@@-@@@V) @@г堐%array ~ @А!b/7   @@@5@@@[> @@@@@_A@@P4@@`D @@@ @ [Array.map f a] applies function [f] to all the elements of [a], and builds an array with the results returned by [f]: [[| f a.(0); f a.(1); ...; f a.(Array.length a - 1) |]]. @  @@@@@ 7@@%@W%iteric  @б!fб@г E#int  @@ @@@e4         @t/@A@@б@А!a@yB@h   @@г J$unit  @@ @@@i@@@@@l@@@%@@m"( @@б@г S%array  @А!a*2  @@@0@@@o9 @@г t$unit  @@ @@@sF@@@@@vI@@\,@@wL  @@@ @; Same as {!Array.iter}, but the function is applied to the index of the element as first argument, and the element itself as second argument. @    r@@@@@ @@@_$mapid ' (@б!fб@г #int 6 7@@ @@@z4 0 / / 0 0 0 0 0 0@|/@A@@б@А!a@B@}  I J@@А!b@B@~ T U@@@ @@@@@#@@ &@@б@г ̠%array e f@А!a(0 l m@@@.@@@7 @@г ᠐%array z {@А!b2E  @@@8@@@L @@@@@O@@b4@@R @@@ @ Same as {!Array.map}, but the function is applied to the index of the element as first argument, and the element itself as second argument. @  Cs@@@@@ 3@@%@e)fold_lefte uy u@б!fб@А!a@B@4         @~+@A u u@@б@А!b@B@ u u@@А!a u u@@@@@ @@@"@@@@б$initА!a*% u u@@б@г P%array u u@А!b-7 u u@@@3@@@> @@А!aGB u u@@@ L@@G@@*O@@J u@@Z3@@N u @@@ uu@ 5  [Array.fold_left f x a] computes [f (... (f (f x a.(0)) a.(1)) ...) a.(n-1)], where [n] is the length of the array [a]. @   9@@@@@ @@@a*fold_rightf !;? ";I@б!fб@А!b@B@4 & % % & & & & & &@z+@A 4;O 5;Q@@б@А!a@B@ A;U B;W@@А!a  G;[ H;]@@@@@ @@@"@@@@б@г %array X;e Y;j@А!b2- _;b `;d@@@8@@@4 @@б$initА!a2< n;s o;u@@А!a8B t;y u;{@@==@@G y;n@@@@@K@@Z3@@N ;L @@@ ;;@ [Array.fold_right f a x] computes [f a.(0) (f a.(1) ( ... (f a.(n-1) x) ...))], where [n] is the length of the array [a]. @ || @@@@@ %@@@a = {1 Iterators on two arrays} @  '@@@@@ 54         @q"@A%iter2g *. *3@б!fб@А!a@B@ *9 *;@@б@А!b@B@' *? *A@@г E$unit *E *I@@ @@@6@@@@@9@@@'@@<" @@б@г N%array *Q *V@А!a7L *N *P@@@=@@@S @@б@г e%array *] *b@А!bAc *Z *\@@@G@@@j @@г $unit *f *j@@ @@@w@@@@@z@@@.@@}1 @@rF@@ "*6@@@ %**@ P [Array.iter2 f a b] applies function [f] to all the elements of [a] and [b]. Raise [Invalid_argument] if the arrays are not the same size. @since 4.05.0 @ 1kk 2@@@@@ @@ @$map2h < =@б!fб@А!a@B@4 A @ @ A A A A A A@+@A O# P%@@б@А!b@B@ \) ]+@@А!c@B@ g/ h1@@@ @@@@@'@@" @@б@г ߠ%array x9 y>@А!a72 6 8@@@=@@@9 @@б@г %array E J@А!b?I B D@@@E@@@P @@г %array Q V@А!cI^ N P@@@O@@@e @@@@@h@@@6@@k9@@zN@@n  @@@ @ 鐠 ' [Array.map2 f a b] applies function [f] to all the elements of [a] and [b], and builds an array with the results returned by [f]: [[| f a.(0) b.(0); ...; f a.(Array.length a - 1) b.(Array.length b - 1)|]]. Raise [Invalid_argument] if the arrays are not the same size. @since 4.05.0 @ WW p@@@@@ `@@(@ Ȑ4 {1 Array scanning} @  @@@@@ p4         @"@A&existsi  @б!fб@А!a@B@  @@г $bool  @@ @@@)@@@@@,@@б@г y%array  @А!a'<  @@@-@@@C @@г $bool ' (@@ @@@P@@@@@S@@H,@@V 3 @@@ 6@ a [Array.exists p [|a1; ...; an|]] checks if at least one element of the array satisfies the predicate [p]. That is, it returns [(p a1) || (p a2) || ... || (p an)]. @since 4.03.0 @ B C@@@@@ @@@i'for_allj M N@б!fб@А!a@ B@4 R Q Q R R R R R R@}+@A ` a@@г ꠐ$bool i j@@ @@@@@@@@@@б@г ⠐%array { |@А!a)$  @@@/@@@+ @@г $bool  @@ @@@8@@@@@;@@J,@@>  @@@ @ ʐ [Array.for_all p [|a1; ...; an|]] checks if all elements of the array satisfy the predicate [p]. That is, it returns [(p a1) && (p a2) && ... && (p an)]. @since 4.03.0 @   l @@@@@ A@@@Q#memk      @б@А!a@B@ 4         @f{'@A      @@б#setг 9%array      @А!a      @@@!@@@  @@г h$bool      @@ @@@*@@&@@-    @@@6@@1/ @@@   @ ! Y [mem x a] is true if and only if [x] is equal to an element of [a]. @since 4.03.0 @   !@@@@@ @@@C$memql !! !!@б@А!a@$B@4  @Xi'@A!!!!@@б#setг %array)!!*!!#@А!a0!!1!!@@@!@@@ @@г $bool>!!'?!!+@@ @@@*@@&@@!-G!! @@@6@@"1/ @@@M!!@ x  Same as {!Array.mem}, but uses physical equality instead of structural equality to compare list elements. @since 4.03.0 @Y!,!,Z!!@@@@@ @@@C,create_floatmd!!e!!@б@г #into!!p!!@@ @@@%4ihhiiiiii@\m+@A@@г 堐%array~!!!!@г %float!!!!@@ @@@(@@@@@@, @@@$@@0!'@@4caml_make_float_vectAA H@@@!!!!@ Ȑ p [Array.create_float n] returns a fresh float array of length [n], with uninitialized data. @since 4.03 @!!"X"j@@@@@?@@@9*make_floatn"l"p"l"z@б@гJ#int"l"|"l"@@ @@@14@Rg1@A@@г6%array"l""l"@г\%float"l""l"@@ @@@4@@@@@@8 @@@$@@<!'@@@"l"l""@0ocaml.deprecated""""@?Use Array.create_float instead.@""""@@@@@""@ ) K @deprecated [Array.make_float] is an alias for {!Array.create_float}. @ "" "#@@@@@@@$#@"H% - {1 Sorting} @####-@@@@@4@Xm7@A$sorto&#0#4'#0#8@б#cmpб@А!a@NB@=7#0#@8#0#B@@б@А!a "?#0#F@#0#H@@гҠ#intH#0#LI#0#O@@ @@@>1@@@@@A4@@@"@@B7 @@б@гĠ%array]#0#W^#0#\@А!a2Gd#0#Te#0#V@@@8@@@DN @@г堐$unitr#0#`s#0#d@@ @@@H[@@@@@K^@@S,@@La~#0#; @@@#0#0@  Sort an array in increasing order according to a comparison function. The comparison function must return 0 if its arguments compare as equal, a positive integer if the first is greater, and a negative integer if the first is smaller (see below for a complete specification). For example, {!Stdlib.compare} is a suitable comparison function, provided there are no floating-point NaN values in the data. After calling [Array.sort], the array is sorted in place in increasing order. [Array.sort] is guaranteed to run in constant heap space and (at most) logarithmic stack space. The current implementation uses Heap Sort. It runs in constant stack space. Specification of the comparison function: Let [a] be the array and [cmp] the comparison function. The following must be true for all x, y, z in a : - [cmp x y] > 0 if and only if [cmp y x] < 0 - if [cmp x y] >= 0 and [cmp y z] >= 0 then [cmp x z] >= 0 When [Array.sort] returns, [a] contains the same elements as before, reordered in such a way that for all i and j valid indices of [a] : - [cmp a.(i) a.(j)] >= 0 if and only if i >= j @#e#e''@@@@@#@@@t+stable_sortp''''@б#cmpб@А!a@`B@O4@+@A'('(@@б@А!a '( '( @@гF#int'('(@@ @@@P@@@!@@S@@@$@@T @@б@г8%array'('(@А!a4/'('(@@@:@@@V6 @@гY$unit'(#'('@@ @@@ZC@@@@@]F@@U,@@^I'' @@@''@ ~ Same as {!Array.sort}, but the sorting algorithm is stable (i.e. elements that compare equal are kept in their original order) and not guaranteed to run in constant heap space. The current implementation uses Merge Sort. It uses [n/2] words of heap space, where [n] is the length of the array. It is usually faster than the current implementation of {!Array.sort}. @(((())@@@@@@@@\)fast_sortq )) ))@б#cmpб@А!a@rB@a4@u+@A)) ))@@б@А!a '))())@@г#int0))1))@@ @@@b@@@!@@e@@@$@@f @@б@г%arrayE))F))@А!a4/L))M))@@@:@@@h6 @@г͠$unitZ))[))@@ @@@lC@@@@@oF@@U,@@pIf)) @@@i))@ Z Same as {!Array.sort} or {!Array.stable_sort}, whichever is faster on typical input. @u))v*D*F@@@@@ @@@\s/ {1 Iterators} @*I*I*I*]@@@@@4|{{||||||@l"@A&to_seq~*_*c*_*i@б@г%array*_*o*_*t@А!a@B@s *_*l*_*n@@@ @@@u'@@г#Seq!t*_*{*_*@А!a8*_*x*_*z@@@#@@@? @@@@@B"@@@*_*_@ ; Iterate on the array, in increasing order @since 4.07 @ ** **@@@@@n@@!@T'to_seqi ** **@б@гU%array ** **@А!a@B@4@sn1@A ** **@@@ @@@ @@гD#Seq!t  ** **@Вг#int ** **@@ @@@&@@А!a0+% **& **@@@7@@2@@@)@@@71 **$@@@6@@;9'@@@7 ***@b \ Iterate on the array, in increasing order, yielding indices along elements @since 4.07 @C **D+=+O@@@@@@@8@M&of_seqN+Q+UO+Q+[@б@г#Seq!t\+Q+a]+Q+f@А!a@ B@4\[[\\\\\\@o4@Aj+Q+^k+Q+`@@@ @@@ @@гߠ%arrayx+Q+my+Q+r@А!a+Q+j+Q+l@@@"@@@ @@@@@!@@@+Q+Q@ 4 Create an array from the generator @since 4.07 @+s+s++@@@@@-@@!@3"/*@++++@@@@@=4@Ca"@A< {1 Undocumented functions} @++++@@@@@N*unsafe_get,,&,,0@б@г4%array,,6,,;@А!a@B@ /,,3,,5@@@ @@@ 6@@б@гs#int,,?,,B@@ @@@E@@А!aI,,F,,H@@@ $@@N@@@@@Q"@@1%array_unsafe_getBA@@@@,,,,^@@@@@]*unsafe_set,_,h,_,r@б@г%array,_,x,_,}@А!a@(B@4@|h+@A',_,u(,_,w@@@ @@@ @@б@г#int7,_,8,_,@@ @@@@@б@А!a#C,_,D,_,@@г$unitL,_,M,_,@@ @@@!-@@@5@@$0@@@@@%3! @@@1@@&64@@1%array_unsafe_setCA @@@@@c,_,_d,_,@@@@@C*FloatarrayBo,,p,,@@Б&create|,,},,@б@г#int,,,,@@ @@@)4@i3@A@@г)*floatarray,,,,@@ @@@,@@@@@/@@6caml_floatarray_createAAQ@@@,,,-@@@@@&length----@б@гO*floatarray----!@@ @@@04@6K$@A@@гU#int--%--(@@ @@@3@@@@@6@@2%floatarray_lengthAA@@@----?@@@@@#get -@-K -@-N@б@г*floatarray -@-Q -@-[@@ @@@74@6K$@A@@б@г#int -@-_ -@-b@@ @@@:@@г%float -@-f -@-k@@ @@@=@@@@@@!@@@'@@A$* @@4%floatarray_safe_getBA͠@@@@" -@-B# -@-@@@@@0#set.!--/!--@б@г̠*floatarray9!--:!--@@ @@@B4322333333@I^%@A@@б@гԠ#intJ!--K!--@@ @@@E@@б@гܠ%floatY!--Z!--@@ @@@H @@г٠$unitf!--g!--@@ @@@K-@@@@@N0@@@%@@O3( @@@9@@P6<@@4%floatarray_safe_setCA'@@@@@}!--~!--@@@@@C*unsafe_get"--"--@б@г'*floatarray"--"--@@ @@@Q4@\q&@A@@б@г/#int"--"--@@ @@@T@@г5%float"--"-.@@ @@@W@@@@@Z!@@@'@@[$* @@6%floatarray_unsafe_getBAp@@@@"--"-.@@@@@0*unsafe_set#. .+#. .5@б@гo*floatarray#. .8#. .B@@ @@@\4@I^%@A@@б@гw#int#. .F#. .I@@ @@@_@@б@г%float#. .M#. .R@@ @@@b @@г|$unit #. .V #. .Z@@ @@@e-@@@@@h0@@@%@@i3( @@@9@@j6<@@6%floatarray_unsafe_setCAʠ@@@@@ #. ."!$.[.{@@@@@C@@{T@H@@p@c@@4%$$%%%%%%@Pe@A4(''((((((@@A5,,6%.|.@@@8,,@@@@TA@"@@},@@y@K@~@k@@t)@ @  a@ N @  ?@ , @  @  :@ ' @  T@ A @  ^@ K@G@4@:@'@~@k)@@@X@@v@@M@:@@~-@@Y@T@@@4@"@@A@ H************************************************************************A@@A@L@ H BMMBM@ H OCaml CC@ H DD3@ H Xavier Leroy, projet Cristal, INRIA Rocquencourt E44E4@ H FF@ H Copyright 1996 Institut National de Recherche en Informatique et GG@ H en Automatique. HHg@ H IhhIh@ H All rights reserved. This file is distributed under the terms of JJ@ H the GNU Lesser General Public License version 2.1, with the KKN@ H special exception on linking described in the file LICENSE. LOOLO@ H MM@ H************************************************************************NN5@ #* An alias for the type of arrays. 4* Array operations. Ԡ =* Return the length (number of elements) of the given array.  @* [Array.get a n] returns the element number [n] of array [a]. The first element has number 0. The last element has number [Array.length a - 1]. You can also write [a.(n)] instead of [Array.get a n]. Raise [Invalid_argument "index out of bounds"] if [n] is outside the range 0 to [(Array.length a - 1)]. 1  * [Array.set a n x] modifies array [a] in place, replacing element number [n] with [x]. You can also write [a.(n) <- x] instead of [Array.set a n x]. Raise [Invalid_argument "index out of bounds"] if [n] is outside the range 0 to [Array.length a - 1]. Ơ 7* [Array.make n x] returns a fresh array of length [n], initialized with [x]. All the elements of this new array are initially physically equal to [x] (in the sense of the [==] predicate). Consequently, if [x] is mutable, it is shared among all elements of the array, and modifying [x] through one of the array entries will modify all other entries at the same time. Raise [Invalid_argument] if [n < 0] or [n > Sys.max_array_length]. If the value of [x] is a floating-point number, then the maximum size is only [Sys.max_array_length / 2].n <* @deprecated [Array.create] is an alias for {!Array.make}.  * [Array.init n f] returns a fresh array of length [n], with element number [i] initialized to the result of [f i]. In other terms, [Array.init n f] tabulates the results of [f] applied to the integers [0] to [n-1]. Raise [Invalid_argument] if [n < 0] or [n > Sys.max_array_length]. If the return type of [f] is [float], then the maximum size is only [Sys.max_array_length / 2]. * [Array.make_matrix dimx dimy e] returns a two-dimensional array (an array of arrays) with first dimension [dimx] and second dimension [dimy]. All the elements of this new matrix are initially physically equal to [e]. The element ([x,y]) of a matrix [m] is accessed with the notation [m.(x).(y)]. Raise [Invalid_argument] if [dimx] or [dimy] is negative or greater than {!Sys.max_array_length}. If the value of [e] is a floating-point number, then the maximum size is only [Sys.max_array_length / 2]. # M* @deprecated [Array.create_matrix] is an alias for {!Array.make_matrix}.  j* [Array.append v1 v2] returns a fresh array containing the concatenation of the arrays [v1] and [v2]. . >* Same as {!Array.append}, but concatenates a list of arrays. Ѡ I* [Array.sub a start len] returns a fresh array of length [len], containing the elements number [start] to [start + len - 1] of array [a]. Raise [Invalid_argument "Array.sub"] if [start] and [len] do not designate a valid subarray of [a]; that is, if [start < 0], or [len < 0], or [start + len > Array.length a]. Y g* [Array.copy a] returns a copy of [a], that is, a fresh array containing the same elements as [a].  * [Array.fill a ofs len x] modifies the array [a] in place, storing [x] in elements number [ofs] to [ofs + len - 1]. Raise [Invalid_argument "Array.fill"] if [ofs] and [len] do not designate a valid subarray of [a].  * [Array.blit v1 o1 v2 o2 len] copies [len] elements from array [v1], starting at element number [o1], to array [v2], starting at element number [o2]. It works correctly even if [v1] and [v2] are the same array, and the source and destination chunks overlap. Raise [Invalid_argument "Array.blit"] if [o1] and [len] do not designate a valid subarray of [v1], or if [o2] and [len] do not designate a valid subarray of [v2].  렠 A* [Array.to_list a] returns the list of all the elements of [a].  M* [Array.of_list l] returns a fresh array containing the elements of [l].  O * [Array.iter f a] applies function [f] in turn to all the elements of [a]. It is equivalent to [f a.(0); f a.(1); ...; f a.(Array.length a - 1); ()].  頠 * [Array.map f a] applies function [f] to all the elements of [a], and builds an array with the results returned by [f]: [[| f a.(0); f a.(1); ...; f a.(Array.length a - 1) |]].  } * Same as {!Array.iter}, but the function is applied to the index of the element as first argument, and the element itself as second argument.   * Same as {!Array.map}, but the function is applied to the index of the element as first argument, and the element itself as second argument.  * [Array.fold_left f x a] computes [f (... (f (f x a.(0)) a.(1)) ...) a.(n-1)], where [n] is the length of the array [a].   * [Array.fold_right f a x] computes [f a.(0) (f a.(1) ( ... (f a.(n-1) x) ...))], where [n] is the length of the array [a].  >* {1 Iterators on two arrays}  * [Array.iter2 f a b] applies function [f] to all the elements of [a] and [b]. Raise [Invalid_argument] if the arrays are not the same size. @since 4.05.0  (* [Array.map2 f a b] applies function [f] to all the elements of [a] and [b], and builds an array with the results returned by [f]: [[| f a.(0) b.(0); ...; f a.(Array.length a - 1) b.(Array.length b - 1)|]]. Raise [Invalid_argument] if the arrays are not the same size. @since 4.05.0 i5* {1 Array scanning} \ * [Array.exists p [|a1; ...; an|]] checks if at least one element of the array satisfies the predicate [p]. That is, it returns [(p a1) || (p a2) || ... || (p an)]. @since 4.03.0  * [Array.for_all p [|a1; ...; an|]] checks if all elements of the array satisfy the predicate [p]. That is, it returns [(p a1) && (p a2) && ... && (p an)]. @since 4.03.0  Z* [mem x a] is true if and only if [x] is equal to an element of [a]. @since 4.03.0 = * Same as {!Array.mem}, but uses physical equality instead of structural equality to compare list elements. @since 4.03.0 頠 q* [Array.create_float n] returns a fresh float array of length [n], with uninitialized data. @since 4.03  L* @deprecated [Array.make_float] is an alias for {!Array.create_float}. >.* {1 Sorting} 1 * Sort an array in increasing order according to a comparison function. The comparison function must return 0 if its arguments compare as equal, a positive integer if the first is greater, and a negative integer if the first is smaller (see below for a complete specification). For example, {!Stdlib.compare} is a suitable comparison function, provided there are no floating-point NaN values in the data. After calling [Array.sort], the array is sorted in place in increasing order. [Array.sort] is guaranteed to run in constant heap space and (at most) logarithmic stack space. The current implementation uses Heap Sort. It runs in constant stack space. Specification of the comparison function: Let [a] be the array and [cmp] the comparison function. The following must be true for all x, y, z in a : - [cmp x y] > 0 if and only if [cmp y x] < 0 - if [cmp x y] >= 0 and [cmp y z] >= 0 then [cmp x z] >= 0 When [Array.sort] returns, [a] contains the same elements as before, reordered in such a way that for all i and j valid indices of [a] : - [cmp a.(i) a.(j)] >= 0 if and only if i >= j  * Same as {!Array.sort}, but the sorting algorithm is stable (i.e. elements that compare equal are kept in their original order) and not guaranteed to run in constant heap space. The current implementation uses Merge Sort. It uses [n/2] words of heap space, where [n] is the length of the array. It is usually faster than the current implementation of {!Array.sort}. P [* Same as {!Array.sort} or {!Array.stable_sort}, whichever is faster on typical input. ߠ0* {1 Iterators} Ҡ <* Iterate on the array, in increasing order @since 4.07  ]* Iterate on the array, in increasing order, yielding indices along elements @since 4.07  5* Create an array from the generator @since 4.07 ɠ#*/*=* {1 Undocumented functions}  = The following is for system use only. Do not call directly. i++j+,@@@)../ocamlc0-strict-sequence(-absname"-w5+a-4-9-41-42-44-45-48"-g+-warn-error!A*-bin-annot)-nostdlib,-safe-string/-strict-formats"-o7stdlib__arrayLabels.cmi"-cz{(./stdlib @0";yZV[W4vuuvvvvvv@s@@8CamlinternalFormatBasics0i;5d[͔&Stdlib0EQ: TnȠ0r2GΦ;+Stdlib__seq05Q[.ZIz[hA6@0r2GΦ;A