Caml1999I022%F 8V(Belt_Map#Int@A@+Belt_MapIntA@&_none_A@A@&String@A@.Belt_MapStringA@ @$Dict@A@,Belt_MapDictA@@!t@,#key%value(identity@C@A@GGG@@,@@@@A"id@,#key"id@B@A@'Belt_IdA*comparable@@@@I@@A$make@"id&!k"id@@󰳐L!v@@@@k@'isEmpty@@@@@𰳐E$bool@@@@@@#has@@)!k頰!v砰"id@@@!@@@@@@$cmpU@@H!k۠!vݠ"id@@ٰ@\ @@ܰ@@"JsA"Fn@&arity2@ @"A#int@@@@@@@ᰳ@@@@@@@#cmp@@!kϠ!vѠ"id@@Ͱ@ @@а@@@2@@@@԰6@@@@@@ @#eqU@@!k !vĠ"id@@@Ǡ @@ð@@kAj@&arity2@@ @@@@@@Ȱ@@@@@@D@"eq@@렰!k!v"id@@@ @@@@@@@@@@@@@@@s@,findFirstByU@@!k!v"id@@@@A@&arity2@@@@@@@@J&option@+'@@@@@@@+findFirstBy@@Q!k!v"id@@@@@M@@@@. @@@@@@@(forEachU@@}!k!v"id@@@@-A,@&arity2@@F$unit@@@@@@@@@@@@@'forEach@@!k!v"id@@@@@*@@@@.@@@@@/@'reduceU@@֠!k~!v"id|@@}@#acc@@A@&arity3@@#@ @@@@@@@@@_@&reduce@@!ks!vt"idq@@r@#accx@@@@ @u@v@w @y@z@{@@&everyU@@-!kh!vi"idf@@g@@A@&arity2@@1@@j@k@l@@m6@@n@o@p@@%every@@]!k^!v_"id\@@]@@@Y@@`@a@b]@@c@d@e@@%someU@@!kS!vT"idQ@@R@@4A3@&arity2@@@@U@V@W@@X@@Y@Z@[@ @$some@@!kI!vJ"idG@@H@@@@@K@L@M@@N@O@P@4@$size@@۠!kC!vB"idA@@D{@@E@F@Q@'toArray@@!k=!v<"id:@@;H%array@@>@@?@@@u@&toList@@!k6!v5"id3@@4I$list@@7@@8@9@@)fromArray@@6!k/!v.@*@@+"idc"id-@@,^ @@0@1@2@@+keysToArray@@k!k'!v%"id$@@&s@@(@)@@-valuesToArray@@!k!v!"id@@ @@"@#@@&minKey@@!k@@t @@@@@/minKeyUndefined@@!k@@@"JsA)undefined@@@@4@&maxKey@@۠!k  @@ @@@@L@/maxKeyUndefined@@󠰐!k @@@"JsA)undefined@@ @ @h@'minimum@@!k!v@@ߠ@@@@@@,minUndefined@@.!k!v&@@@"JsA)undefined@@@@@@'maximum@@Q!k!vI@@򰳐!@@@@@@,maxUndefined@@p!k!v젰h@@밳@"JsA)undefined@@@@@@#get@@!k堰!v栰"id@@@h@@@@@ @,getUndefined@@!kޠ!vߠ"id@@ݰ@@"JsA)undefined@@@@@0@.getWithDefault@@נ!kנ!vؠ"id@@ְ@@@@@@M@&getExn@@!kѠ!vҠ"id@@а@ @@@h@&remove@@!kˠ!vʠ"id@@Ȱ@# @@@@@@*removeMany@@0!kĠ!và"id@@@:@@I@@@@@@#set@@V!k!v"id@@@@l@@@@@@@'updateU@@y!k!v"id@@@@@+A*@&arity1@Z@@_!@@@@@+'#@@@@@@ @&update@@!k!v"id@@@@@@@@@@Ӡ"@@@@@@9@)mergeMany@@࠰!k!v"id@@@꠰@@@@@@@@c@&mergeU@@ !k!v"id@@@"v2@@@@A@&arity3@'@(@@@@@"v3@@@@@@@LB :@@@@@@@ %merge@@Y!k!vw"id@@u@m"v2y@@v@@@> @@x@E@@zJ"v3@@{@|@}@~9 1@@@@@@@ %keepU@@!kq!vp"ido@@j@@OAN@&arity2@@@@k@l@m@@nĠ%!@@r@s@t@*@ $keep@@Ѡ!kf!ve"idd@@`@@@@@a@b@c@@g@h@i@S@ *partitionU@@!k[!vZ"idY@@S@@A@&arity2@@@@T@U@V@@W"($ @@\)/+'@@X@]@^@_@@ )partition@@6!kN!vM"idL@@G@@@2@@H@I@JU@@O\&"@@K@P@Q@R@@%split@@i!kA!v@"id?@@<@@@B!@@>@CR$@@=@D@E@F@@$mapU@@!k8!v3"id6@@2@@MAL@&arity1@"v27@4@@5# @@9@:@;@&@#map@@͠!k.!v*"id,@@)@@"v2-@+@@/@0@1@M@+mapWithKeyU@@!k%!v"id#@@@@A@&arity2@@"v2$@ @!@@"% @@&@'@(@@*mapWithKey@@&!k!v"id@@@@@"v2@@B@@@@@@'getData@@O!k!v"id@@@,Belt_MapDictA!t@@@@@%getId@@s!k !v"id @@  @@ @ @@*packIdData@"id!k"id@@$data@,Belt_MapDictA!t!v@@  @@@@@ @6checkInvariantInternal@@@@,@@@@ -@@n[(Belt_Map0 V4~f/pL"Js09"!]cAȠ.Bs_stdlib_mini0<2Vتz Pervasives.compare a1 b1 | c -> c end) let myMap = Belt.Map.make ~id:(module PairComparator) let myMap2 = Belt.Map.set myMap (1, 2) "myValue" ]} The API documentation below will assume a predeclared comparator module for integers, IntCmp @3others/belt_Map.mliOg"$@@@@8@@@@Q*floatarray@,@@@A@@@2@@@@P5extension_constructor@A#int@,@@@A@@@8@AB$char@O&string@ D%float@ E$bool@,@@а^%false@@@G@а_$true@@@L@@A@@@L@AF$unit@,@@а`"()@@@U@@A@@@U@A#G#exn@,@@AA@@@X@@&H%array@,@M@A@A@@@_@@-I$list@,@N@Aаa"[]@@@k@аb"::@@@O@@w@@A@Y@@x@@FJ&option@,@P@Aаc$None@@@@аd$Some@@@@@A@@@@XN&lazy_t@,@Q@A@A@@@@^K)nativeint@aL%int32@cM%int64@e]:Undefined_recursive_moduleCE@h@@Jr@@@@V@@A=ocaml.warn_on_literal_pattern@@\.Assert_failureC@@X@@A@Y0Division_by_zeroC%@@@A@X+End_of_fileC,@@@AƠ@W)Sys_errorC3@/@@AΠ%$@[.Sys_blocked_ioC;@@@Aՠ,+@V)Not_foundCB@@@Aܠ32@U'FailureCI@E@@A䠠;:@T0Invalid_argumentCQ@M@@A젠CB@Z.Stack_overflowCY@@@A󠠠JI@S-Out_of_memoryC`@@@AQP@R-Match_failureCg@fbc@c@@A^ ]@C%bytes@ې@.Bs_stdlib_miniA@@Aа#Int@ m m@Х@+Belt_MapIntAmm@A @@)ocaml.doc) Specalized when key type is [int], more efficient than the generic type, its compare behavior is fixed using the built-in comparison @&j'''l@@@@@)m@'@а&String@3qdk4qdq@Х@.Belt_MapStringA=qdt>qd@A 8=========@=;,*@@A@@+S specalized when key type is [string], more efficient than the generic type, its compare behavior is fixed using the built-in comparison @PoQp c@@@@@Sqdd@@а$Dict@]y f m^y f q@Х@,Belt_MapDictAgy f thy f @A 8ggggggggg@+=.)@@A@@U} This module seprate identity from data, it is a bit more verboe but slightly more efficient due to the fact that there is no need to pack identity and data back after each operation {b Advanced usage only} @zs{x c e@@@@@}y f f@@A(!t@|  |  @А#key8@*<-(,@Š@Ơ@@C@A@@@|  @ [('key, 'identity) t] ['key] is the field type ['value] is the element type ['identity] the identity of the collection @}  D . 0@@@@@@@@A|  |  @@BА%value,|  |  @@BА(identity7|  |  @@B@,? @C@A@GGG@@0.@@@A@0.@8@@@@A1L@A("id@G 3 DG 3 F@А#key8@Wg,@Ϡ@@B@A@/@0@@1Π@@G 3 3G 3 g@ , The identity needed for making an empty map@H h hH h @@@@@@@@AG 3 9G 3 =@@BА"id5G 3 ?G 3 B@@B@,= @B@A@'Belt_IdA*comparableI !@@$@@30@@@Aг;G 3 U9@А#keyXAG 3 JBG 3 N@@А"id_HG 3 PIG 3 S@@@&bKG 3 II@@KH@8IIIIIIIII@c@@ALK@$make@Vb  Wb @б"idг"idcb db @А!kfO8kkkkkkkkk@P@@Aqb rb  @@А"iddP}b  ~b @@@# @@Sb "@@г!tb %b &@А!k*%b b @@А!vhX1b b @@А"id/8b  b #@@@#C7@@\Ab #@@Y4 @bEb '@@@b  *@ǐ [make ~id] creates a new map by taking in the comparator @example {[ let m = Belt.Map.make ~id:(module IntCmp) ]} @c''g@@@@@@9@Y'isEmpty@jj@б@гR!tjj@@@i8@s-@@Ajj@@@@j @@@k  @@ @@o@@гŠ$booljj@@ @@u @@@@x#!@@@j @ [isEmpty m] checks whether a map m is empty @example {[ isEmpty (fromArray [|1,"1"|] ~id:(module IntCmp)) = false ]} @koQS@@@@@@@6#has@qUYqU\@б@г!t)qUl*qUm@А!ky8111111111@Uk2@@A7qU_8qUa@@А!vzCqUcDqUe@@А"id{OqUgPqUj@@@/% @@#XqU^/@@б@А!k/*_qUq`qUs@@г2$boolhqUxiqU|@@ @@9@@@A@<@@@"@? @@@vqUU@^ [has m k] checks whether m has the key k @example {[ has (fromArray [|1,"1"|] ~id:(module IntCmp)) 1 = true ]} @r}}v@@@@@@@R$cmpU@xx @б@г!ty y!@А!kE8@q2@@Ayy@@А!vGyy@@А"idCyy@@@/% @@#y/@@б@гJ!tz%7z%8@А!k94z%*z%,@@А!v2;z%.z%0@@А"id-Bz%2z%5@@@M@5@@Kz%)@@б@г@"JsA"Fn@&arity2{<A{<P@б@А!v\e  {<C@@б@А!vcl{<G{<I@@г#int{<M@@@@2z@@@t@5} @@@w@6$@@1@@84@г#int/|[`0|[c@@ @@<@@@@?8{<@ @@@R@@L @@@}@Aw@@@Ax@@@@@#cmp@K}dhL}dk@б@гΠ!tV~mW~m@А!kkH8^^^^^^^^^@$@@Ad~mre~mt@@А!vmIp~mvq~mx@@А"idiJ|~mz}~m}@@@/% @@N#~mq/@@б@г!t@А!k94@@А!v2;@@А"id-B@@@M@5@@WK@@б@б@А!vKT@@б@А!vS\@@г#int@@ @@]k@@@e@`n@@@h@aq @@г#int@@ @@b~@@@@e @@@@@f: @@@k@ge@@@}dd@ [cmp m0 m1 vcmp] Total ordering of map given total ordering of value function. It will compare size first and each element following the order one by one. @gi@@@@@@!@#eqU@kokr@б@г!ttt@А!kn8@2@@Atyt{@@А!vo)t}*t@@А"idp5t6t@@@/% @@t#>tx/@@б@г!tHI@А!k94OP@@А!v2;VW@@А"id-B]^@@@M@5@@}Kf@@б@г@vAu@&arity2tst@б@А!vXa |@@б@А!v_h@@гV$bool@@@@v@@@p@y @@@s@|$@@-@@@гk$bool@@ @@@@@@ @@@N@H @@@y@s@@@kk@@@@@"eq@@б@г@!t@А!k8@$@@A@@А!v@@А"id@@@/% @@#/@@б@гy!t@А!k94 @@А!v2;@@А"id-B@@@M@5@@K@@б@б@А!vKT()@@б@А!vS\0 1@@г$bool9:@@ @@k@@@e@n@@@h@q @@г$boolLM#@@ @@~@@@@U @@@@@: @@@k@e@@@^@Fn [eq m1 m2 veq] tests whether the maps [m1] and [m2] are equal, that is, contain equal keys and associate them with equal data. [veq] is the equality predicate used to compare the data associated with the keys. @k$$l @@@@@@!@,findFirstByU@v w @б@г!t , -@А!k8@2@@A  !@@А!v # %@@А"id ' *@@@/% @@# /@@б@г@A@&arity2 2 B@б@А!k>9  4@@б@А!v7@ 8 :@@г$bool >@@@@N@@@H@Q @@@Y@T$@@-@@X@г{&option W ]@ВА!kmh N P@@А!vfo S U@@@zm@v@@@@@{ M@@@+@  1!@@@f@`$@@@  '@@@(@@+findFirstBy@^b^m@б@г!t'^~(^@А!k8/////////@$@@A5^q6^s@@А!vA^uB^w@@А"idM^yN^|@@@/% @@#V^p/@@б@б@А!k1,_^`^@@б@А!v+4g^h^@@г:$boolp^q^@@ @@C@@@=@F@@@N@I @@г&option^^@ВА!k_Z^^@@А!vXa^^@@@l_@h@@@@@m^@@@*@q^!@@@X@uR$@@@^^'@ [findFirstBy m p] uses funcion [f] to find the first key value pair to match predicate [p]. @example {[ let s0 = fromArray ~id:(module IntCmp) [|4,"4";1,"1";2,"2,"3""|];; findFirstBy s0 (fun k v -> k = 4 ) = option (4, "4");; ]} @@@@@@@6@(forEachU@@б@гE!t@А!k 8@2@@A@@А!v"@@А"id@@@/% @@#/@@б@г@ A @&arity2   @б@А!k>9 @@б@А!v7@@@гޠ$unit"@@@@N@@@H@Q @@@Y@T$@@-@@X<@г$unit78@@ @@d@@@@g@ @@@N@kH @@@F@@@@@p'forEach@PQ@б@гӠ!t[\@А!k<#8ccccccccc@$@@Aij@@А!v>$uv @@А"id:% @@@/% @@)#/@@б@б@А!k1,@@б@А!v+4@@г`$unit"&@@ @@/C@@@=@2F@@@N@3I @@гs$unit+/@@ @@4V@@@@7Y @@@@@8]: @@@@֐  [forEach m f] applies [f] to all bindings in map [m]. [f] receives the 'k as first argument, and the associated value as second argument. The bindings are passed to [f] in increasing order with respect to the ordering over the type of the keys. @example {[ let s0 = fromArray ~id:(module IntCmp) [|4,"4";1,"1";2,"2,"3""|];; let acc = ref [] ;; forEach s0 (fun k v -> acc := (k,v) :: !acc);; !acc = [4,"4"; 3,"3"; 2,"2"; 1,"1"] ]} @00@@@@@@@p'reduceU@ @б@гa!t01@А!k\?8@2@@A#%@@А!v^@ ' )@@А"idZA + .@@@/% @@E# "/@@б@А#accXK/ $5 %9@@б@г@5A4@&arity33 2> 3V@б@А#accF  ;B@@б@А!kRM BF CH@@б@А!vLU JL KN@@А#acc1[ PR@@@V5@L_ !@@@g@Mb$@@@;@Ne(@@1@@Pi i@А#accBl aa be@@@ G@Tq f=@@@K@UuF@@@[@VxU @@@ o@@@@@}&reduce@ yfj zfp@б@г!t f f@А!kw_8         @$@@A fs fu@@А!vy` fw fy@@А"idua f{ f~@@@/% @@e# fr/@@б@А#accsk/ f f@@б@б@А#acc9 f f@@б@А!kFA f f@@б@А!v@I f f@@А#acc%O f f@@@K*@lT @@@\@mW@@@0@nZ! @@А#acc4^ f f@@@ 9@oc f@@@=@pg8@@@M@qjG @@@ ff@ e [reduce m a f] computes [(f kN dN ... (f k1 d1 a)...)], where [k1 ... kN] are the keys of all bindings in [m] (in increasing order), and [d1 ... dN] are the associated data. @example {[ let s0 = fromArray ~id:(module IntCmp) [|4,"4";1,"1";2,"2,"3""|];; reduce s0 [] (fun acc k v -> (k,v) acc ) = [4,"4";3,"3";2,"2";1,"1"];; ]} @  @@@@@@@}&everyU@   &@б@г!t 6 7@А!kz8 ' ' ' ' ' ' ' ' '@2@@A -) .+@@А!v{ 9- :/@@А"id| E1 F4@@@/% @@# N(/@@б@г@^A]@&arity2\ [< \L@б@А!k>9  d>@@б@А!v7@ kB lD@@г >$bool tH@@@@N@@@H@Q @@@Y@T$@@-@@X @г S$bool X \@@ @@d@@@@g ; @@@N@kH @@@ @@@@@p%every@ ]a ]f@б@г %!t ]v ]w@А!k8         @$@@A ]i ]k@@А!v ]m ]o@@А"id ]q ]t@@@/% @@# ]h/@@б@б@А!k1, ]| ]~@@б@А!v+4 ] ]@@г $bool ] ]@@ @@C@@@=@F@@@N@I @@г Ӡ$bool ] ]@@ @@V@@@@Y ]{ @@@@@]: @@@ ]]@  ( d [every m p] checks if all the bindings of the map satisfy the predicate [p]. Order unspecified @ % &@@@@@@@p%someU@ 0 1 @б@г !t ; <@А!k8 C C C C C C C C C@2@@A I J@@А!v U V@@А"id a b@@@/% @@# j /@@б@г@zAy@&arity2x w! x1@б@А!k>9  #@@б@А!v7@ ' )@@г Z$bool -@@@@N@@@H@Q @@@Y@T$@@-@@X @г o$bool = A@@ @@d@@@@g   @@@N@kH @@@ @@@@@p$some@ BF BJ@б@г A!t BZ B[@А!k8         @$@@A BM BO@@А!v BQ BS@@А"id BU BX@@@/% @@# BL/@@б@б@А!k1, B` Bb@@б@А!v+4 Bf Bh@@г ܠ$bool Bl Bp@@ @@C@@@=@F@@@N@I @@г $bool %Bv &Bz@@ @@V@@@@Y .B_ @@@@@]: @@@ 4BB@  D g [some m p] checks if at least one binding of the map satisfy the predicate [p]. Order unspecified @ A{{ B@@@@@@@p $size@ L M@б@г Ϡ!t W X@А!k 8 _ _ _ _ _ _ _ _ _@2@@A e f@@А!v   q r@@А"id  } ~@@@/% @@# /@@г a#int   @@ @@1@@@@4@@@  @  j [size s] @example {[ size (fromArray [2,"2"; 2,"1"; 3,"3"] ~id:(module IntCmp)) = 2 ;; ]} @    wy@@@@@@@G 'toArray@ { {@б@г 4!t { {@А!k   8         @f2@@A { {@@А!v"   { {@@А"id   { {@@@/% @@# {/@@г %array { {@ВА!k:5 { {@@А!v3< { {@@@G:@C@@@@@H {@@@/@L) @@@ {{#@  & [toArray s] @example {[ toArray (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) = [1,"1";2,"2";3,"3"] ]} @ # $.0@@@@@@2@_ &toList@ .26 /2<@б@г !t 92L :2M@А!k9 #8 A A A A A A A A A@~2@@A G2? H2A@@А!v; $ S2C T2E@@А"id7 % _2G `2J@@@/% @@)# h2>/@@г $list p2[ q2_@ВА!k:5 z2R {2T@@А!v3< 2W 2Y@@@G:@/C@@@@@1H 2Q@@@/@5L) @@@ 22#@ { - In increasing order {b See} {!toArray} @ `` @@@@@@2@_ )fromArray@  @б@г f%array  @ВА!kZ <8         @5@@A  @@А!v\ =  @@@ @>@@@+@@@ )@@б"idг "id  @А!k2-  @@А"idX D9  @@@D @@GA@@г !t@А!kUP@@А!vNW@@А"id*^#$@@@i\2@@Og,@@M/ @Uk0"@@@Y@VoU%@@@6(@ F [fromArray kvs ~id] @example {[ toArray (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) = [1,"1";2,"2";3,"3"] ]} @CDac@@@@@@7@ +keysToArray@NeiOet@б@г Ѡ!tYeZe@А!kr ]8aaaaaaaaa@2@@Agewhey@@А!vt ^se{te}@@А"idp _ee@@@/% @@c#ev/@@г@%arrayee@А!k72ee@@@=@@j9 @@@@n<@@@ee@  [keysToArray s] @example {[ keysToArray (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) = [|1;2;3|];; ]} @@@@@@@"@O-valuesToArray@"/@б@г >!t?@@А!ku8@n2@@A24@@А!vv68@@А"idw:=@@@/% @@{#1/@@г%arrayHM@А!v)2DF@@@/@@9 @@@@<@@@@  [valuesToArray s] @example {[ valuesToArray (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) = [|"1";"2";"3"|];; ]} @NN@@@@@@"@O&minKey@()@б@г !t34@А!k8;;;;;;;;;@n2@@AAB@@@@ HI@@@@OP@@@% @@X%@@г&option`a @А!k-(gh@@@3@@/ @@@@2@@@s@[ ; [minKey s] @return the minimum key, None if not exist @  HJ@@@@@@"@E/minKeyUndefined@LPL_@б@г!tLlLm@А!k8@d2@@ALbLd@@@@ LfLg@@@@LiLj@@@% @@La%@@г@"JsA)undefinedLtL@А!k1,LqLs@@@7@@3 @@@#@6@@@LL@ꐠ2 {b See} {!minKey}@@@@@@@"@I&maxKey@@б@гu!t@А!k8@h2@@A  @@@@ @@@@@@@% @@"%@@г&option*+@А!k-(12@@@3@@/ @@@@2@@@=@%M ; [maxKey s] @return the maximum key, None if not exist @JK @@@@@@"@E/maxKeyUndefined@U  V  @б@гؠ!t`  "a  #@А!k8hhhhhhhhh@d2@@An  o  @@@@ u  v  @@@@|  }  @@@% @@  %@@г@"JsA)undefined  *  6@А!k1,  '  )@@@7@@3 @@@#@6@@@  @3 {b See} {!maxKey} @ 7 7 7 O@@@@@@"@I'minimum@  Q U  Q \@б@г?!t  Q k  Q l@А!k8@h2@@A  Q _  Q a@@А!v  Q c  Q e@@@@  Q h  Q i@@@*  @@  Q ^*@@г&option  Q z  Q @ВА!k50  Q q  Q s@@А!v.7   Q v   Q x@@@B5@>@@@@@C  Q p@@@/@G) @@@  Q Q#@, G [minimum s] @return the minimum key value pair, None if not exist @)   *   @@@@@@2@Z,minUndefined@4  5  @б@г!t?  @  @А!k8GGGGGGGGG@y2@@AM  N  @@А!v Y  Z  @@@@`  a  @@@*  @@i  *@@г@"JsA)undefinedu  v !@ВА!k94    @@А!v2;    @@@F9@B@@@#@@G  @@@3@K- @@@  #@4 {b See} {!minimum} @! ! ! !"@@@@@@2@^'maximum@!$!(!$!/@б@г3!t!$!=!$!>@А!k 8@}2@@A!$!2!$!4@@А!v! !$!6!$!8@@@@ !$!:!$!;@@@*  @@!$!1*@@г}&option!$!L!$!R@ВА!k50!$!C!$!E@@А!v.7!$!H!$!J@@@B5@>@@@@@C !$!B@@@/@G) @@@!$!$#@ G [maximum s] @return the maximum key value pair, None if not exist @!S!S!!@@@@@@2@Z,maxUndefined@(!!)!!@б@г!t3!!4!!@А!k6"8;;;;;;;;;@y2@@AA!!B!!@@А!v8#M!!N!!@@@@$T!!U!!@@@*  @@(]!!*@@г@"JsA)undefinedi!!j!!@ВА!k94s!!t!!@@А!v2;z!!{!!@@@F9@.B@@@#@@0G!!@@@3@4K- @@@!!#@t4 {b See} {!maximum} @!!!!@@@@@@2@^#get@!!!!@б@г'!t!" !"@А!kO98@}2@@A!"!"@@А!vQ:!"!"@@А"idM;!"!" @@@/% @@?#!!/@@б@А!k/*!"!"@@г~&option!"!"!@А!v1:!"!"@@@7@@FA @@@I@JD@@@*@KG$@@@!!@ [get s k] @example {[ get (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) 2 = Some "2";; get (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) 2 = None;; ]} @""""#""@@@@@@%@Z,getUndefined@%""%"#@б@г!t'%"#(%"#@А!khR8/////////@y2@@A5%"#6%"#@@А!vjSA%"# B%"# @@А"idfTM%"# N%"#@@@/% @@X#V%"#/@@б@А!k/*]%"#^%"#@@г@"JsA)undefinedj%"#!k%"#-@А!v5>q%"#r%"# @@@;@@_E @@@M@cH@@@.@dK(@@@%""@h 8 {b See} {!get} @return [undefined] when not found @&#.#.)#i#k@@@@@@%@^.getWithDefault@+#m#q+#m#@б@г!t,##,##@А!k}k8@}2@@A,##,##@@А!vl,##,##@@А"id{m,##,##@@@/% @@q#,##/@@б@А!k/*,##,##@@б@А!v)2,##,##@@А!v/8,##,##@@@44@w= @@@E@x@@@@&@yC  @@@+#m#m @ _ [getWithDefault s k default] {b See} {!get} @return [default] when [k] is not found @-##3$ $ @@@@@@@V&getExn@ 5$$ 5$$@б@г!t5$$)5$$*@А!k8@u2@@A%5$$&5$$@@А!v15$$ 25$$"@@А"id=5$$$>5$$'@@@/% @@#F5$$/@@б@А!k/*M5$$.N5$$0@@А!v'0S5$$4T5$$6@@@:,@5 @@@@8@@@]5$$ @Em F [getExn s k] {b See} {!getExn} {b raise} when [k] not exist @j6$7$7k;$$@@@@@@@K&remove@u?$$v?$$@б@г!t?$$?$$@А!k8@j2@@A?$$?$$@@А!v?$$?$$@@А"id?$$?$$@@@/% @@#?$$/@@б@А!k/*?$$?$$@@г7!t?$%?$% @А!k?:?$$?$$@@А!v8A?$$?$%@@А"id3H?$%?$%@@@SF;@@Q?$$@@@Z @U+!@@@;@X5$@@@?$$'@  [remove m x] when [x] is not in [m], [m] is returned reference unchanged. @example {[ let s0 = (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp));; let s1 = remove s0 1;; let s2 = remove s1 1;; s1 == s2 ;; keysToArray s1 = [|2;3|];; ]} @@% % K&'&)@@@@@@6@k*removeMany@M&+&/M&+&9@б@г!t M&+&I M&+&J@А!k8@2@@AM&+&<M&+&>@@А!v#M&+&@$M&+&B@@А"id/M&+&D0M&+&G@@@/% @@#8M&+&;/@@б@г%arrayBM&+&QCM&+&V@А!k94IM&+&NJM&+&P@@@?@@; @@гϠ!tWM&+&hXM&+&i@А!kNI^M&+&[_M&+&]@@А!vGPeM&+&_fM&+&a@@А"idBWlM&+&cmM&+&f@@@bUJ@@`uM&+&Z@@@- @d0!@@@J@gD$@@@~M&+&+'@f [removeMany s xs] Removing each of [xs] to [s], note unlike {!remove}, the reference of return value might be changed even if none in [xs] exists [s] @N&j&jS''@@@@@@6@z#set@U''U''@б@г!tV''0V''1@А!k8@2@@AV''#V''%@@А!vV'''V'')@@А"idV''+V''.@@@/% @@#V''"/@@б@А!k/*V''5V''7@@б@А!v)2V'';V''=@@г`!tV''PV''Q@А!kGBV''CV''E@@А!v@IV''GV''I@@А"id;PV''KV''N@@@[NC@@YV''B@@@T @]+!@@@e@`6$@@@F@c@'@@@U''*@" W [set m x y ] returns a map containing the same bindings as [m], with a new binding of [x] to [y]. If [x] was already bound in [m], its previous binding disappears. @example {[ let s0 = (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp));; let s1 = set s0 2 "3";; valuesToArray s1 = ["1";"3";"3"];; ]} @W'R'R b((@@@@@@9@v'updateU@*d((+d((@б@г!t5d((6d((@А!k8=========@2@@ACd((Dd((@@А!vOd((Pd((@@А"id[d((\d((@@@/% @@#dd((/@@б@А!k/*kd((ld((@@б@г@|A{@&arity1zyd((zd((@б@г&optiond((d((@А!vBKd((@@@G@@Q @@г)&optiond(( @А!vU^d((d((@@@[@@e,@@@@h0@@9@@ l@г+!td()d()@А!k~yd((d((@@А!vwd((d((@@А"idrd()d()@@@z@@d((@@@, @d(("@@@@n%@@@~@x(@@@d((+@@@,@@&update@e)) e))@б@гk!te))"e))#@А!kE8@$@@Ae))e))@@А!vG  e))e))@@А"idC!e))e)) @@@/% @@%#"e))/@@б@А!k/*)e))'*e)))@@б@б@гƠ&option6e))17e))7@А!v5>=e)).>e))0@@@;@@,E @@г۠&optionKe))>Le))D@А!vJSRe));Se))=@@@P@@1Z @@@@5]@@г۠!tce))Wde))X@А!kpkje))Jke))L@@А!virqe))Nre))P@@А"iddyxe))Rye))U@@@wl@@9e))I@@@+ @?e))-"@@@@@`%@@@p@Aj(@@@e))+@v n [update m x f] returns a map containing the same bindings as [m], except for the binding of [x]. Depending on the value of [y] where [y] is [f (get x m)], the binding of [x] is added, removed or updated. If [y] is [None], the binding is removed if it exists; otherwise, if [y] is [Some z] then [x] is associated to [z] in the resulting map. @f)Y)Ym**@@@@@@:@ )mergeMany@o**o**@б@г)!tp**p**@А!kh H8@2@@Ap**p**@@А!vj Ip**p**@@А"idf Jp**p**@@@/% @@N#p**/@@б@г%arrayp**p*+@ВА!k<7p**p**@@А!v5>p**p**@@@I<@TE@@@@@VJp**@@г!tp*+p*+@А!k^Yp*+ p*+ @@А!vW`p*+ p*+@@А"idRg$p*+%p*+@@@reZ@@]p-p*+@@@. @ct*!@@@Z@dwT$@@@6o**'@F [mergeMany s xs] Adding each of [xs] to [s], note unlike {!add}, the reference of return value might be changed even if all values in [xs] exist [s] @Cq++Dv++@@@@@@6@!&mergeU@Nx++Ox++@б@гѠ!tYy++Zy++@А!k!k8aaaaaaaaa@2@@Agy++hy++@@А!v!lsy++ty++@@А"id!my++y++@@@/% @@q#y++/@@б@г !tz++z++@А!k94z++z++@@А"v2!w@z++z++@@А"id2Gz++z++@@@#R:@@{Pz++#@@б@г@A@&arity3{+,{+,+@б@А!kkf {+,@@б@гe&option{+, {+,@А!vnw{+,{+,@@@t@@~ @@б@г|&option{+,{+,@А"v2S{+,{+,@@@Y@@ @@г&option{+,%?@А"v3! {+,! {+,$@@@ @@P@@@ @#S@@@:@=V@@@@Z@@c@@+@г!t&|,6,H'|,6,I@А!kȰ-|,6,:.|,6,<@@А"v3-ϰ4|,6,>5|,6,A@@А"idְ;|,6,C<|,6,F@@@;@@߰D|,6,9@@@, @H{++"@@@@%@@@@(@@@Qx+++@@@,@@"%merge@[},J,N\},J,S@б@гޠ!tf~,U,gg~,U,h@А!k"8nnnnnnnnn@)$@@At~,U,Yu~,U,[@@А!v"~,U,]~,U,_@@А"id"~,U,a~,U,d@@@/% @@#~,U,X/@@б@г!t,l,~,l,@А!k94,l,p,l,r@@А"v2"@,l,t,l,w@@А"id2G,l,y,l,|@@@#R:@@P,l,o#@@б@б@А!k^Y,,,,@@б@гf&option,,,,@А!vbk,,,,@@@h@@r @@б@г}&option,,,,@А"v2G,,,,@@@M@@ @@г&option,,,,@А"v3",,,,@@@ @@@@@!@$@@@;@>@@@@S@@г!t%,,&,,@А!k,,,-,,@@А"v3*3,,4,,@@А"idȰ:,,;,,@@@Ӡ8@@ѰC,,@@@+ @հG,,"@@@@ٰ%@@@@ܰ(@@@P},J,J+@8` [merge m1 m2 f] computes a map whose keys is a subset of keys of [m1] and of [m2]. The presence of each such binding, and the corresponding value, is determined with the function [f]. @],,^--@@@@@@:@#%keepU@h--i--@б@г렐!ts--t--@А!k#8{{{{{{{{{@)2@@A----@@А!v#----@@А"id#----@@@/% @@#--/@@б@г@A@&arity2----@б@А!k>9 --@@б@А!v7@----@@г$bool--@@@@N@@@H@Q @@@Y@T$@@-@@X@гU!t----@А!kje----@@А!vcl----@@А"id^s----@@@~qf@@|--@@@, @ --"@@@g@a%@@@--(@@@)@@$$keep@----@б@г!t-.-.@А!k4$8"""""""""@$@@A(--)--@@А!v6$4--5--@@А"id2$@-.A-.@@@/% @@#I--/@@б@б@А!k1,R. .S. .@@б@А!v+4Z. .[. .@@г-$boolc. .d. . @@ @@!C@@@=@$F@@@N@%I @@г!tv.%.7w.%.8@А!k\W}.%.*~.%.,@@А!vU^.%...%.0@@А"idPe.%.2.%.5@@@pcX@@)n.%.)@@@+ @/r. ."@@@Y@0vS%@@@--(@ Y [keep m p] returns the map with all the bindings in [m] that satisfy predicate [p]. @.9.9.u.@@@@@@7@%*partitionU@....@б@г9!t....@А!ke%78@2@@A....@@А!vg%8....@@А"idc%9....@@@/% @@=#../@@б@г@A@&arity2....@б@А!k>9 ..@@б@А!v7@ ....@@гࠐ$bool..@@@@CN@@@H@FQ @@@Y@GT$@@-@@IX0@Вг!t.../..@А!kmh5..6..@@А!vfo<..=..@@А"idavC..D..@@@ti@@PL..@@г͠!tU./V./@А!k\..]..@@А!vc..d..@@А"idj..k./@@@@@Ys..@@@2 @_-#@@@[@`|..'@@@@a*@@@..-@@@.@@&)partition@// //@б@г!t//'//(@А!k&h8@$@@A////@@А!v&i//// @@А"id&j//"//%@@@/% @@n#///@@б@б@А!k1,/,/1/,/3@@б@А!v+4/,/7/,/9@@г$bool/,/=/,/A@@ @@tC@@@=@wF@@@N@xI @@Вгn!t/F/X/F/Y@А!k_Z/F/K/F/M@@А!vXa/F/O/F/Q@@А"idSh /F/S /F/V@@@sf[@@|q/F/J@@г!t/F/j/F/k@А!k$/F/]%/F/_@@А!v+/F/a,/F/c@@А"idz2/F/e3/F/h@@@@@;/F/\@@@2 @-#@@@Z@D/,/0'@@@@*@@@J//-@2Z [partition m p] returns a pair of maps [(m1, m2)], where [m1] contains all the bindings of [s] that satisfy the predicate [p], and [m2] is the map with all the bindings of [s] that do not satisfy [p]. @W/l/lX0E0G@@@@@@<@'%split@b0I0Mc0I0R@б@г堐!tm0T0fn0T0g@А!k'8uuuuuuuuu@2@@A{0T0Y|0T0[@@А!v'0T0]0T0_@@А"id'0T0a0T0d@@@/% @@#0T0X/@@б@А!k/*0T0k0T0m@@ВВг*!t0q00q0@А!kE@0q0w0q0y@@А!v>G0q0{0q0}@@А"id9N0q00q0@@@YLA@@W0q0v@@гQ!t0q00q0@А!klg0q00q0@@А!ven0q00q0@@А"id`u0q00q0@@@sh@@~0q0@@@2 @-#@@г&option0q00q0@А!v 0q0 0q0@@@@@ @@@ @0q0u@@@@y@@@@@@@!0I0I@ 1 O [split x m] returns a tuple [(l r), data], where [l] is the map with all the bindings of [m] whose 'k is strictly less than [x]; [r] is the map with all the bindings of [m] whose 'k is strictly greater than [x]; [data] is [None] if [m] contains no binding for [x], or [Some v] if [m] binds [v] to [x]. @.00/11@@@@@@+@($mapU@911:12@б@г!tD12E12@А!k(8LLLLLLLLL@2@@AR12S12@@А!v(^12 _12 @@А"id(j12k12@@@/% @@#s12/@@б@г@A@&arity11212"@б@А!v09 12@@А"v2(C12@@@> @G@@ @@K@г!t12=12>@А!k]X12/121@@А"v2!_123126@@А"idQf12812;@@@q/Y@@o12.@@@, @s12"@@@Z@wT%@@@11(@@@)@@|)#map@2?2C2?2F@б@гV!t2?2V2?2W@А!k)8@$@@A2?2I2?2K@@А!v)2?2M2?2O@@А"id)2?2Q2?2T@@@/% @@# 2?2H/@@б@б@А!v#,2?2\2?2^@@А"v2)7!2?2b"2?2e@@@3 @<@@г!t-2?2z.2?2{@А!kOJ42?2l52?2n@@А"v2Q;2?2p<2?2s@@А"idCXB2?2uC2?2x@@@c-K@@aK2?2k@@@+ @eO2?2["@@@L@iF%@@@U2?2?(@=e % [map m f] returns a map with same domain as [m], where the associated value [a] of all bindings of [m] has been replaced by the result of the application of [f] to [a]. The bindings are passed to [f] in increasing order with respect to the ordering over the type of the keys. @b2|2|c3h3@@@@@@7@|*+mapWithKeyU@m33n33@б@г!tx33y33@А!k**8@2@@A3333@@А!v,* 3333@@А"id(* 3333@@@/% @@#33/@@б@г@A@&arity23333@б@А!k>9 33@@б@А!v7@3333@@А"v2.*K33@@@F @O@@@W@R"@@+@@V@гX!t3333@А!khc3333@@А"v2$j3333@@А"id\q3333@@@|2d@@z33@@@, @%~ 33"@@@e@&_%@@@ 33(@@@)@@+*mapWithKey@ 33 34@б@г!t 34 34@А!kL+/8 % % % % % % % % %@$@@A +34  ,34 @@А!vN+0 734  834@@А"idJ+1 C34 D34@@@/% @@5# L34/@@б@б@А!k1, U34 V34@@б@А!v+4 ]34" ^34$@@А"v2P+;? h34( i34+@@@; @<D@@@L@=G@@г!t w34? x34@@А!kZU ~341 343@@А"v2"\ 345 348@@А"idNc 34: 34=@@@n0V@@Al 340@@@+ @Gp 34"@@@W@HtQ%@@@ 33(@ f [mapWithKey m f] The same as {!map} except that [f] is supplied with one more argument: the key @ 4A4A 44@@@@@@7@,'getData@ 44 44@б@г:!t 44 44@А!k },Q8         @2@@A 44 44@@А!v ,R 44 44@@А"id {,S 44 44@@@/% @@W# 44/@@г@,Belt_MapDictA!t 44 44@А!k;6!44!44@@А!v4=! 44! 44@@А"id/D!44!44@@@"OB7@@ sM!44@@@4 @ yQ.!@@@!!44$@ !1 [getData s0] {b Advanced usage only} @return the raw data (detached from comparator), but its type is still manifested, so that user can pass identity directly without boxing @!.44!/55@@@@@@3@d-%getId@!955!:55@б@г!t!D55!E55@А!k - 8!L!L!L!L!L!L!L!L!L@2@@A!R55!S55@@А!v - !^55!_55@@А"id - !j55!k55@@@/% @@ #!s55/@@г"id!{55!|55@А!k72!55!55@@А"id$9!55!55@@@D+@@ A!55@@@( @ E"@@@!55@ ! K [getId s0] {b Advanced usage only} @return the identity of [s0] @!55!6/61@@@@@@+@X.*packIdData@!6367!636A@б"idгޠ"id!636P!636R@А!k . 8!!!!!!!!!@y4@@A!636G!636I@@А"id . !636K!636N@@@# @@ !636F"@@б$dataг@,Belt_MapDictA!t!636i!636w@А!k2-!636\!636^@@А!v . 9"636`"636b@@А"id7@"636d" 636g@@@'K?@@ I"636[#@@г !t"636"636@А!k]X" 636|"!636~@@А!v+_"'636"(636@@А"id]f".636"/636@@@q9e@@ o"7636{@@Y0 @ s";636V"@@f@ w"?636C&@@@"B6363)@!*"R X [packIdData ~id ~data] {b Advanced usage only} @return the packed collection @"O66"P66@@@@@@8@"d"c"/*@"`66"a66@@@@8"_"_"_"_"_"_"_"_"_@$@@A/6checkInvariantInternal@"l66"m67 @б@г !t"w67"x67@@@ "~67"67@@@@ "@@@ & @@ @@ ,@@г"R$unit"67"67@@ @@ 9@@@@ <!@@@"66 @!" ) {b raise} when invariant is not held @"77"7F7H@@@@@@@O"""/*@"7I7I"7I7P@@@@8"""""""""@`[$@@A@!!@!![@!p!4@!G A  A }  ͠_K("k͠7# xrSMՠ;5ZFߠdPàXDx'ƠaM렠q]m } 1     ? 9  } 렠  Ҡ ՠ"w㠠hbޠ-'@8#:#:#:#:#:#:#:#:#:@|@@A@ E*********************************************************************#BA@@#CA@I@ E #HBJJ#IBJ@ E OCaml #NC#OC@ E #TD#UD'@ E Xavier Leroy, projet Cristal, INRIA Rocquencourt #ZE((#[E(q@ E #`Frr#aFr@ E Copyright 1996 Institut National de Recherche en Informatique et #fG#gG@ E en Automatique. All rights reserved. This file is distributed #lH#mHO@ E under the terms of the GNU Library General Public License, with #rIPP#sIP@ E the special exception on linking described in file ../LICENSE. #xJ#yJ@ E #~K#K-@ E Adapted by authors of BuckleScript without using functors #L..#L.w@ E*********************************************************************#Mxx#Mx@ ]* A {i immutable} sorted map module which allows customize {i compare} behavior. The implementation uses balanced binary trees, and therefore searching and insertion take time logarithmic in the size of the map. For more info on this module's usage of identity, `make` and others, please see the top level documentation of Belt, {b A special encoding for collection safety}. Example usage: @example {[ module PairComparator = Belt.Id.MakeComparable(struct type t = int * int let cmp (a0, a1) (b0, b1) = match Pervasives.compare a0 b0 with | 0 -> Pervasives.compare a1 b1 | c -> c end) let myMap = Belt.Map.make ~id:(module PairComparator) let myMap2 = Belt.Map.set myMap (1, 2) "myValue" ]} The API documentation below will assume a predeclared comparator module for integers, IntCmp # * Specalized when key type is [int], more efficient than the generic type, its compare behavior is fixed using the built-in comparison "m * specalized when key type is [string], more efficient than the generic type, its compare behavior is fixed using the built-in comparison "F * This module seprate identity from data, it is a bit more verboe but slightly more efficient due to the fact that there is no need to pack identity and data back after each operation {b Advanced usage only} " * [('key, 'identity) t] ['key] is the field type ['value] is the element type ['identity] the identity of the collection !렠 -* The identity needed for making an empty map!  How we retain soundness: The only way to create a value of type [_ t] from scratch is through [empty] which requires [_ Belt_Id.t] The only way to create [_ Belt_Id.t] is using [Belt_Id.Make] which will create a fresh type [id] per module Generic operations over tree without [cmp] are still exported (for efficient reasons) so that [data] does not need be boxed and unboxed. The soundness is guaranteed in two aspects: When create a value of [_ t] it needs both [_ Belt_Id.t] and [_ t0]. [_ Belt_Id.t] is an abstract type. Note [add0] requires [_ Belt_Id.cmp] which is also an abstract type which can only come from [_ Belt_Id.t] When destructing a value of [_ t], the ['id] parameter is threaded. #K  #\  @ a should not export [Belt_Id.compare]. should only export [Belt_Id.t] or [Belt_Id.cmp] instead #^  #_  @ * [make ~id] creates a new map by taking in the comparator @example {[ let m = Belt.Map.make ~id:(module IntCmp) ]}  ꠠ * [isEmpty m] checks whether a map m is empty @example {[ isEmpty (fromArray [|1,"1"|] ~id:(module IntCmp)) = false ]}  * [has m k] checks whether m has the key k @example {[ has (fromArray [|1,"1"|] ~id:(module IntCmp)) 1 = true ]}  1 * [cmp m0 m1 vcmp] Total ordering of map given total ordering of value function. It will compare size first and each element following the order one by one.  * [eq m1 m2 veq] tests whether the maps [m1] and [m2] are equal, that is, contain equal keys and associate them with equal data. [veq] is the equality predicate used to compare the data associated with the keys. O * [findFirstBy m p] uses funcion [f] to find the first key value pair to match predicate [p]. @example {[ let s0 = fromArray ~id:(module IntCmp) [|4,"4";1,"1";2,"2,"3""|];; findFirstBy s0 (fun k v -> k = 4 ) = option (4, "4");; ]}  * [forEach m f] applies [f] to all bindings in map [m]. [f] receives the 'k as first argument, and the associated value as second argument. The bindings are passed to [f] in increasing order with respect to the ordering over the type of the keys. @example {[ let s0 = fromArray ~id:(module IntCmp) [|4,"4";1,"1";2,"2,"3""|];; let acc = ref [] ;; forEach s0 (fun k v -> acc := (k,v) :: !acc);; !acc = [4,"4"; 3,"3"; 2,"2"; 1,"1"] ]}  f* [reduce m a f] computes [(f kN dN ... (f k1 d1 a)...)], where [k1 ... kN] are the keys of all bindings in [m] (in increasing order), and [d1 ... dN] are the associated data. @example {[ let s0 = fromArray ~id:(module IntCmp) [|4,"4";1,"1";2,"2,"3""|];; reduce s0 [] (fun acc k v -> (k,v) acc ) = [4,"4";3,"3";2,"2";1,"1"];; ]}  e* [every m p] checks if all the bindings of the map satisfy the predicate [p]. Order unspecified  h* [some m p] checks if at least one binding of the map satisfy the predicate [p]. Order unspecified  k* [size s] @example {[ size (fromArray [2,"2"; 2,"1"; 3,"3"] ~id:(module IntCmp)) = 2 ;; ]} & * [toArray s] @example {[ toArray (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) = [1,"1";2,"2";3,"3"] ]}  .* In increasing order {b See} {!toArray} 2 * [fromArray kvs ~id] @example {[ toArray (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) = [1,"1";2,"2";3,"3"] ]}  * [keysToArray s] @example {[ keysToArray (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) = [|1;2;3|];; ]} ( * [valuesToArray s] @example {[ valuesToArray (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) = [|"1";"2";"3"|];; ]}  <* [minKey s] @return the minimum key, None if not exist ^3* {b See} {!minKey} <* [maxKey s] @return the maximum key, None if not exist 4* {b See} {!maxKey} 6 H* [minimum s] @return the minimum key value pair, None if not exist 5* {b See} {!minimum} H H* [maximum s] @return the maximum key value pair, None if not exist Ӡ5* {b See} {!maximum} Z * [get s k] @example {[ get (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) 2 = Some "2";; get (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) 2 = None;; ]} 堠 9* {b See} {!get} @return [undefined] when not found l `* [getWithDefault s k default] {b See} {!get} @return [default] when [k] is not found  G* [getExn s k] {b See} {!getExn} {b raise} when [k] not exist  J**************************************************************************$=$$$=$$@ * [remove m x] when [x] is not in [m], [m] is returned reference unchanged. @example {[ let s0 = (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp));; let s1 = remove s0 1;; let s2 = remove s1 1;; s1 == s2 ;; keysToArray s1 = [|2;3|];; ]}  * [removeMany s xs] Removing each of [xs] to [s], note unlike {!remove}, the reference of return value might be changed even if none in [xs] exists [s]  X* [set m x y ] returns a map containing the same bindings as [m], with a new binding of [x] to [y]. If [x] was already bound in [m], its previous binding disappears. @example {[ let s0 = (fromArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp));; let s1 = set s0 2 "3";; valuesToArray s1 = ["1";"3";"3"];; ]}   o* [update m x f] returns a map containing the same bindings as [m], except for the binding of [x]. Depending on the value of [y] where [y] is [f (get x m)], the binding of [x] is added, removed or updated. If [y] is [None], the binding is removed if it exists; otherwise, if [y] is [Some z] then [x] is associated to [z] in the resulting map.  v * [mergeMany s xs] Adding each of [xs] to [s], note unlike {!add}, the reference of return value might be changed even if all values in [xs] exist [s]  Ѡ * [merge m1 m2 f] computes a map whose keys is a subset of keys of [m1] and of [m2]. The presence of each such binding, and the corresponding value, is determined with the function [f].  Z* [keep m p] returns the map with all the bindings in [m] that satisfy predicate [p]. o * [partition m p] returns a pair of maps [(m1, m2)], where [m1] contains all the bindings of [s] that satisfy the predicate [p], and [m2] is the map with all the bindings of [s] that do not satisfy [p]. Ơ P* [split x m] returns a tuple [(l r), data], where [l] is the map with all the bindings of [m] whose 'k is strictly less than [x]; [r] is the map with all the bindings of [m] whose 'k is strictly greater than [x]; [data] is [None] if [m] contains no binding for [x], or [Some v] if [m] binds [v] to [x].  &* [map m f] returns a map with same domain as [m], where the associated value [a] of all bindings of [m] has been replaced by the result of the application of [f] to [a]. The bindings are passed to [f] in increasing order with respect to the ordering over the type of the keys.  g* [mapWithKey m f] The same as {!map} except that [f] is supplied with one more argument: the key z * [getData s0] {b Advanced usage only} @return the raw data (detached from comparator), but its type is still manifested, so that user can pass identity directly without boxing  L* [getId s0] {b Advanced usage only} @return the identity of [s0]  Y* [packIdData ~id ~data] {b Advanced usage only} @return the packed collection ࠠ#*/*Ҡ ** {b raise} when invariant is not held #*/*y@\1../darwin/bsc.exe'-bs-cmi'-bs-cmj--no-keep-locs.-no-alias-deps5-bs-no-version-header8-bs-no-check-div-by-zero)-nostdlib4-bs-cross-module-opt--make-runtime--nopervasives'-unsafe"-w#+50+-warn-error!A%-open.Bs_stdlib_mini"-I)./runtime"-I&others$M$N )/Users/hongbozhang/git/ocamlscript/jscomp ;/Users/hongbozhang/git/ocamlscript/jscomp/../jscomp/runtime >/Users/hongbozhang/git/ocamlscript/jscomp/../jscomp/stdlib-406 :/Users/hongbozhang/git/ocamlscript/jscomp/../jscomp/others  @0 v1n/AEF8$W$W$W$W$W$W$W$W$W@$V@@@"405`2Ɨp٠$v0 V4~f/pL#01dT[/+nsi#X@#2@#k0<2Vتz