Caml1999I022s ;3Ϡ*Belt_Array!t@,!a@A@AH%array@ @@@@&_none_A@A@@@@@&length@@!a@@A#int@@@@-%array_lengthAA @@@'res.doc# e Return the size of the array ## Examples ```rescript // Returns 1 Belt.Array.length(["test"]) ``` @+@@+@@$size@@'!a@@&@@@-%array_lengthAA$@@@B#E= See [`Belt.Array.length`]() @M@@M@@#get@@I!a@@@J@@𰳐J&option@@@@@@iJl & If `i <= 0 <= length(arr)` returns `Some(value)` where `value` is the item at index `i`. If `i` is out of range returns `None`. ## Examples ```rescript Belt.Array.get(["a", "b", "c"], 0) == Some("a") Belt.Array.get(["a", "b", "c"], 3) == None Belt.Array.get(["a", "b", "c"], -1) == None ``` @t@@t@@&getExn@@p!a@@@q@@ @@@j ^ Raise an exception if `i` is out of range. Otherwise return the value at index `i` in `arr`. @@@@@)getUnsafe@@!a@@@@@ @@1%array_unsafe_getBA@@@@ t `getUnsafe(arr, i)` **Unsafe** no bounds checking; this would cause type error if `i` does not stay within range @@@@@,getUndefined@@!a@@߰@@@ళ@"JsA)undefined@@@@1%array_unsafe_getBA@@@@ܠߐ `getUndefined(arr, i)` It does the samething in the runtime as [`getUnsafe`](); it is _type safe_ since the return type still track whether it is in range or not @@@@@#set@@㠰!a@@ذ@@@ٰ@ E$bool@@@@@@@ `set(arr, n, x)` modifies `arr` in place; it replaces the nth element of `arr` with `x`. Returning `false` means not updated due to out of range. @@@@@&setExn@@ !a@@Ѱ@ @@Ұ@ F$unit@@@@@@@, / @ `setExn(arr, i, x)` raise an exception if `i` is out of range. @7@@7@@)setUnsafe@@3!a@@ʰ@4@@˰@ (@@@@@А1%array_unsafe_setCA8@@@@@X@.shuffleInPlace@@T!a@@ǰA@@@@kLn = `shuffleInPlace(arr)` randomly re-orders the items in `arr` @v@@v@@'shuffle@@r!a@@°z@@@@j G Returns a fresh array with items in original array randomly shuffled. @@@@@.reverseInPlace@@!a@@}@@@@ `reverseInPlace(arr)` reverses items in `arr` in place. ## Examples ```rescript let arr = [10, 11, 12, 13, 14] let () = Belt.Array.reverseInPlace(arr) arr == [14, 13, 12, 11, 10] ``` @@@@@'reverse@@!a@@@@@@ŠȐ `reverse(arr)` returns a fresh array with items in arr in reverse order. ## Examples ```rescript Belt.Array.reverse([10, 11, 12, 13, 14]) == [14, 13, 12, 11, 10] ``` @@@@@1makeUninitialized@@@@㠰@"JsA)undefined!a@@@@@%ArrayAA " A@%Array@@@@@@򠠠 / `makeUninitialized(n)` creates an array of length `n` filled with the undefined value. You must specify the type of data that will eventually fill the array. ## Examples ```rescript let arr: array> = Belt.Array.makeUninitialized(5) Belt.Array.getExn(arr, 0) == Js.undefined ``` @@@@@7makeUninitializedUnsafe@@@@!a@@@%ArrayAA " A@%Array@@@@@@ **Unsafe** ## Examples ```rescript let arr = Belt.Array.makeUninitializedUnsafe(5) Js.log(Belt.Array.getExn(arr, 0)) // undefined Belt.Array.setExn(arr, 0, "example") Js.log(Belt.Array.getExn(arr, 0) == "example") ``` @ @@ @@$make@@@@@!a&@@@@@58 n `make(n, e)` return an array of size `n` filled with value `e`. Returns an empty array when `n` is negative. @@@@@@@%range@@3@@@9@@YA@@@@@@@Z;] `range(start, finish)` create an inclusive array. ## Examples ```rescript Belt.Array.range(0, 3) == [0, 1, 2, 3] Belt.Array.range(3, 0) == [] Belt.Array.range(3, 3) == [3] ``` @e@@e@@'rangeBy@@X@@@^@@$stepf@@n@@@@@@@@h  `rangeBy(start, finish, ~step)` returns empty array when step is 0 or negative. It also return an empty array when `start > finish`. ## Examples ```rescript Belt.Array.rangeBy(0, 10, ~step=3) == [0, 3, 6, 9] Belt.Array.rangeBy(0, 12, ~step=3) == [0, 3, 6, 9, 12] Belt.Array.rangeBy(33, 0, ~step=1) == [] Belt.Array.rangeBy(33, 0, ~step=-1) == [] Belt.Array.rangeBy(3, 12, ~step=-1) == [] Belt.Array.rangeBy(3, 3, ~step=0) == [] Belt.Array.rangeBy(3, 3, ~step=1) == [3] ``` @@@@@'makeByU@@@@@U)function$@@@@!a@ࠠ*Has_arity1@@@@A@@@@@@@@@@&makeBy@@@@@@@@!a@ɠ@@@@@ؠې  `makeBy(n, f)` return an empty array when n is negative return an array of size n populated by `f(i)` start from `0` to `n - 1`. ## Examples ```rescript Belt.Array.makeBy(5, (i) => i) == [0, 1, 2, 3, 4] Belt.Array.makeBy(5, (i) => i * i) == [0, 1, 4, 9, 16] ``` @@@@@1makeByAndShuffleU@@@@@Q@@@!a@ࠠ*Has_arity1O@@@A@@@@@@@@@ @0makeByAndShuffle@@@@|@@@@}!a@~@@@@@&) ' Equivalent to `shuffle(makeBy(n, f))` @1@@1@@#zip@@-!aw@@t@J!bv@@uS @x@@y@z@{@T5W `zip(a, b)` create an array of pairs from corresponding elements of a and b. Stop with the shorter array. ## Examples ```rescript Belt.Array.zip([1, 2], [3, 4, 5]) == [(1, 3), (2, 4)] ``` @_@@_@@&zipByU@@[!aj@@f@x!bk@@g@ܠ@@!co@l@mࠠ*Has_arity2@@h@A@@i@@n@@p@q@r@s@@%zipBy@@!a]@@[@!b^@@\@@@ !ca@_@`@@b@c@d@e@  `zipBy(xs, ys, f)` create an array by applying `f` to corresponding elements of `xs` and `ys`. Stops with shorter array. Equivalent to `map(zip(xs, ys), ((a, b)) => f(a, b))` ## Examples ```rescript Belt.Array.zipBy([1, 2, 3], [4, 5], (a, b) => 2 * a + b) == [6, 9] ``` @@@@@%unzip@@ؠ!aW!bU@S@@T٠@@X@@V@Y@Z@񐠠 V `unzip(a)` takes an array of pairs and creates a pair of arrays. The first array contains all the first items of the pairs; the second array contains all the second items. ## Examples ```rescript Belt.Array.unzip([(1, 2), (3, 4)]) == ([1, 3], [2, 4]) Belt.Array.unzip([(1, 2), (3, 4), (5, 6), (7, 8)]) == ([1, 3, 5, 7], [2, 4, 6, 8]) ``` @@@@@&concat@@!aO@@M@ @@N@@P@Q@R@ + `concat(xs, ys)` returns a fresh array containing the concatenation of the arrays `v1` and `v2`, so even if `v1` or `v2` is empty; it can not be shared. ## Examples ```rescript Belt.Array.concat([1, 2, 3], [4, 5]) == [1, 2, 3, 4, 5] Belt.Array.concat([], ["a", "b", "c"]) == ["a", "b", "c"] ``` @@@@@*concatMany@@,!aJ@@H@@I& @@K@L@58 `concatMany(xss)` returns a fresh array as the concatenation of `xss` (an array of arrays) ## Examples ```rescript Belt.Array.concatMany([[1, 2, 3], [4, 5, 6], [7, 8]]) == [1, 2, 3, 4, 5, 6, 7, 8] ``` @@@@@@@%slice@@@?@h  `sliceToEnd(xs, offset)` creates a new array with the elements of `xs` starting at `offset` `offset` can be negative; and is evaluated as `length(xs) - offset(sliceToEnd, xs) - 1` means get the last element as a singleton array `sliceToEnd(xs, 0)` will return a copy of the array ## Examples ```rescript Belt.Array.sliceToEnd([10, 11, 12, 13, 14, 15, 16], 2) == [12, 13, 14, 15, 16] Belt.Array.sliceToEnd([10, 11, 12, 13, 14, 15, 16], -4) == [13, 14, 15, 16] ``` @@@@@$copy@@!a7@@6@@8@9%sliceAA + AA@A@@%slice@@@@@ ^ `copy(a)` returns a copy of `a`; that is; a fresh array containing the same elements as `a`. @@@@@$fill@@!a0@@-&offset@@.#len@@/@@@1@2@3@4@5@ڠݐ  `fill(arr, ~offset, ~len, x)` modifies `arr` in place, storing `x` in elements number `offset` to `offset + len - 1`. `offset` can be negative; and is evaluated as `length(arr - offset)`. `fill(arr, ~offset=-1, ~len=1)` means fill the last element, if the array does not have enough data; `fill` will ignore it ## Examples ```rescript let arr = Belt.Array.makeBy(5, (i) => i) Belt.Array.fill(arr, ~offset=2, ~len=2, 9) arr == [0, 1, 9, 9, 4] Belt.Array.fill(arr, ~offset=7, ~len=2, 8) arr == [0, 1, 9, 9, 4] @@@@@$blit@#src㠰!a#@@!)srcOffset@@"#dst@@$)dstOffset@@%#len@@&@@'@(@)@*@+@,@  `blit(~src=v1, ~srcOffset=o1, ~dst=v2, ~dstOffset=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. `offset` can be negative; `-1` means `len - 1`; if `len + offset` is still negative;it will be set as 0 For each of the examples;presume that `v1 == [10, 11, 12, 13, 14, 15, 16, 17]` and `v2 == [20, 21, 22, 23, 24, 25, 26, 27]`. The result shown is the content of the destination array. ## Examples ```rescript let v1 = [10, 11, 12, 13, 14, 15, 16, 17] let v2 = [20, 21, 22, 23, 24, 25, 26, 27] Belt.Array.blit(~src=v1, ~srcOffset=4, ~dst=v2, ~dstOffset=2, ~len=3) v2 == [20, 21, 14, 15, 16, 25, 26, 27] Belt.Array.blit(~src=v1, ~srcOffset=4, ~dst=v1, ~dstOffset=2, ~len=3) v1 == [10, 11, 14, 15, 16, 15, 16, 17] ``` @%@@%@@*blitUnsafe@#src#!a@@)srcOffset&@@#dst7@@)dstOffset6@@#len>@@0@@@@@@@ @Z;] & Unsafe blit without bounds checking. @e@@e@@(forEachU@@a!a@@ @נ@ V@@@ࠠ*Has_arity1@@ @A@@ @@c@@@@@@'forEach@@!a@@@@ z@@@~@@@ @ @  `forEach(xs, f)` Call `f` on each element of `xs` from the beginning to end. `f` returns `unit` so no new array is created. Use `forEach` when you are primarily concerned with repetitively creating side effects. ## Examples ```rescript Belt.Array.forEach(["a", "b", "c"], x => Js.log("Item: " ++ x)) /* prints: Item: a Item: b Item: c */ let total = ref(0) Belt.Array.forEach([1, 2, 3, 4], x => total := total.contents + x) total.contents == 1 + 2 + 3 + 4 ``` @@@@@$mapU@@!a@@@%@ !b@ࠠ*Has_arity1@@@A@@@@ߠ@@@@@@#map@@ؠ!a@@@@ !b@@@@@@ `map(xs, f)` returns a new array by calling `f` for each element of `xs` from the beginning to end. ## Examples ```rescript Belt.Array.map([1, 2], (x) => x + 1) == [3, 4] ``` @@@@@(flatMapU@@!a@@@u@ "!b@@@ࠠ*Has_arity1t@@@A@@@@4@@@@@1@'flatMap@@-!a@@@@ L!b@@@㰳U @@@@@R3U `flatMap(xs, f)` returns a new array by calling `f` for each element of `xs` from the beginning to end, concatenating the results. ## Examples ```rescript Belt.Array.flatMap([1, 2], x => [x + 10, x + 20]) == [11, 21, 12, 22] ``` @]@@]@@&getByU@@Y!a@@ְ@Ϡ@ v@@@ڠࠠ*Has_arity1@@@A@@@@۰@@@@@@%getBy@@!a@@ϰ@@ @@@Ѱ;@@@@@ A `getBy(xs, p)` returns `Some(value)` for the first value in `xs` that satisifies the predicate function `p`; returns `None` if no element satisifies the function. ## Examples ```rescript Belt.Array.getBy([1, 4, 3, 2], (x) => mod(x, 2) == 0) == Some(4) Belt.Array.getBy([15, 13, 11], (x) => mod(x, 2) == 0) == None ``` @@@@@+getIndexByU@@!a@@İ@@ @@@ɠࠠ*Has_arity1@@@A@@@@ʰo@@@@@@@@*getIndexBy@@֠!a@@@@ @@@@@@@@@@ P `getIndexBy(xs, p)` returns `Some(index)` for the first value in `xs` that satisifies the predicate function `p`; returns `None` if no element satisifies the function. ## Examples ```rescript Belt.Array.getIndexBy([1, 4, 3, 2], (x) => mod(x, 2) == 0) == Some(1) Belt.Array.getIndexBy([15, 13, 11], (x) => mod(x, 2) == 0) == None ``` @@@@@%keepU@@!a@@@w@ @@@ࠠ*Has_arity1q@@@A@@@@@@@@@-@$keep@@)!a@@@@ B@@@9@@@@@H)K G `keep(xs, p)` returns a new array that keep all elements satisfy `p`. @S@@S@@.keepWithIndexU@@O!a@@@Š@ @X@@r@@@@ࠠ*Has_arity2@@@A@@@@r#@@@@@@-keepWithIndex@@}!a@@@@ @@@@@@@@@@@@ `keepWithIndex(xs, p)` returns a new array that keep all elements satisfy `p`. ## Examples ```rescript Belt.Array.keepWithIndex([1, 2, 3], (_x, i) => i == 1) == [2] ``` @@@@@(keepMapU@@!a@@@@ b!b@@@ࠠ*Has_arity1@@@A@@@@ޠ@@@@@@'keepMap@@נ!a@@@@ !b@@@ @@@@@ `keepMap(xs, p)` returns a new array that keep all elements that return a non None applied `p`. ## Examples ```rescript Belt.Array.keepMap([1, 2, 3], x => if mod(x, 2) == 0 { Some(x) } else { None } ) == [2] ``` @@@@@1forEachWithIndexU@@!a{@@w@y@ @@z@@@|@}@~ࠠ*Has_arity2y@@x@A@@y@@ @@@@@5@0forEachWithIndex@@1!ap@@n@@4@@o@(@@q@r@s,@@t@u@v@V7Y  `forEachWithIndex(xs, f)` same as `Belt.Array.forEach`, except that `f` is supplied two arguments: the index starting from 0 and the element from `xs`. ## Examples ```rescript Belt.Array.forEachWithIndex(["a", "b", "c"], (i, x) => Js.log("Item " ++ Belt.Int.toString(i) ++ " is " ++ x)) /* prints: Item 0 is a Item 1 is b Item 2 is cc */ let total = ref(0) Belt.Array.forEachWithIndex([10, 11, 12, 13], (i, x) => total := total.contents + x + i) total.contents == 0 + 10 + 1 + 11 + 2 + 12 + 3 + 13 ``` @a@@a@@-mapWithIndexU@@]!af@@b@Ӡ@d@@e@!bj@g@hࠠ*Has_arity2@@c@A@@d@@i@@k@l@m@@,mapWithIndex@@!a[@@Y@@@@Z@!b^@\@]@@_@`@a@ `mapWithIndex(xs, f)` applies `f` to each element of `xs`. Function `f` takes two arguments: the index starting from 0 and the element from `xs`. ## Examples ```rescript Belt.Array.mapWithIndex([1, 2, 3], (i, x) => i + x) == [0 + 1, 1 + 2, 2 + 3] ``` @@@@@*partitionU@@!aT@@M@/@ @@P@Qࠠ*Has_arity1)@@N@A@@O@@R٠ @@Uޠ%@@S@V@W@X@@)partition@@頰!aH@@D@@ @@E@F@@I @@G@J@K@L@   e `partition(f, a)` split array into tuple of two arrays based on predicate `f`; first of tuple where predicate cause true, second where predicate cause false ## Examples ```rescript Belt.Array.partition([1, 2, 3, 4, 5], (x) => mod(x, 2) == 0) == ([2, 4], [1, 3, 5]) Belt.Array.partition([1, 2, 3, 4, 5], (x) => mod(x, 2) != 0) == ([1, 3, 5], [2, 4]) ``` @ @@ @@'reduceU@@ *!b<@@9@!a@@@ @@=@>ࠠ*Has_arity2@@:@A@@;@@?@A@B@C@ D@&reduce@@ S!b2@@1@!a5@@@ @3@4 @6@7@8@ ` A c  `reduce(xs, init, f)` applies `f` to each element of `xs` from beginning to end. Function `f` has two parameters: the item from the list and an “accumulator”; which starts with a value of `init`. `reduce` returns the final value of the accumulator. ## Examples ```rescript Belt.Array.reduce([2, 3, 4], 1, (a, b) => a + b) == 10 Belt.Array.reduce(["a", "b", "c", "d"], "", (a, b) => a ++ b) == "abcd" ``` @ k@@ k@@.reduceReverseU@@ z!b)@@&@!a-@䠰@ @@*@+ࠠ*Has_arity2@@'@A@@(@@,@.@/@0@ @-reduceReverse@@ !b@@@!a"@@@ @ @! @#@$@%@    `reduceReverse(xs, init, f)` works like `Belt.Array.reduce` except that function `f` is applied to each item of `xs` from the last back to the first. ## Examples ```rescript Belt.Array.reduceReverse(["a", "b", "c", "d"], "", (a, b) => a ++ b) == "dcba" ``` @ @@ @@/reduceReverse2U@@ !a@@@ Ԡ!b@@@!c@>@ @ @@@@ࠠ*Has_arity38@@@A@@@@@@@@@ @.reduceReverse2@@ 젰!a@@@ !b@@@!c @@@@ @@@  @ @ @ @@     `reduceReverse2(xs, ys, init, f)` reduces two arrays xs and ys;taking items starting at `min(length(xs), length(ys))` down to and including zero. ## Examples ```rescript Belt.Array.reduceReverse2([1, 2, 3], [1, 2], 0, (acc, x, y) => acc + x + y) == 6 ``` @ #@@ #@@0reduceWithIndexU@@ !a@@@!b@@ @@ 0@@@@@ࠠ*Has_arity3@@@A@@@@@@@@ Q@/reduceWithIndex@@ M!a@@@!b@@@@ Z@@@@@@@@@ r S u  Applies `f` to each element of `xs` from beginning to end. Function `f` has three parameters: the item from the array and an “accumulator”, which starts with a value of `init` and the index of each element. `reduceWithIndex` returns the final value of the accumulator. ## Examples ```rescript Belt.Array.reduceWithIndex([1, 2, 3, 4], 0, (acc, x, i) => acc + x + i) == 16 ``` @ }@@ }@@)joinWithU@@ y!a@@@P&string@@@@@@@@栰ࠠ*Has_arity1@@@A@@@@簳@@@@@@ @(joinWith@@ !a@@װ@0@@ذ@@8@@@۰<@@@@@@ Π  ѐ & `joinWith(xs, sep, toString)` Concatenates all the elements of `xs` converted to string with `toString`, each separated by `sep`, the string given as the second argument, into a single string. If the array has only one element, then that element will be returned without using the separator. If the array is empty, the empty string will be returned. ## Examples ```rescript Belt.Array.joinWith([0, 1], ", ", Js.Int.toString) == "0, 1" Belt.Array.joinWith([], " ", Js.Int.toString) == "" Belt.Array.joinWith([1], " ", Js.Int.toString) == "1" ``` @ @@ @@%someU@@ ՠ!a@@Ͱ@K@  @@@Ҡࠠ*Has_arity1E@@@A@@@@Ӱ @@@@@ @$some@@ !a@@ư@@  @@@ɰ @@@@@    5 `some(xs, p)` returns true if at least one of the elements in `xs` satifies `p`; where `p` is a predicate: a function taking an element and returning a `bool`. ## Examples ```rescript Belt.Array.some([2, 3, 4], (x) => mod(x, 2) == 1) == true Belt.Array.some([(-1), (-3), (-5)], (x) => x > 0) == false ``` @ '@@ '@@&everyU@@ #!a@@@@  @@@@ࠠ*Has_arity1@@@A@@@@° M@@@@@ O@%every@@ K!a@@@@  d@@@ h@@@@@ j K m  `every(xs, p)` returns `true` if all elements satisfy `p`; where `p` is a predicate: a function taking an element and returning a `bool`. ## Examples ```rescript Belt.Array.every([1, 3, 5], (x) => mod(x, 2) == 1) == true Belt.Array.every([1, (-3), 5], (x) => x > 0) == false ``` @ u@@ u@@'every2U@@ q!a@@@ !b@@@@@ @@@@ࠠ*Has_arity2@@@A@@@@ @@@@@@ @&every2@@ !a@@@ à!b@@@@@  @@@@ @@@@@@ Ҡ  Ր  `every2(xs, ys, p)` returns true if `p(xi, yi)` is true for all pairs of elements up to the shorter length (i.e. `min(length(xs), length(ys))`) ## Examples ```rescript Belt.Array.every2([1, 2, 3], [0, 1], (a, b) => a > b) == true Belt.Array.every2([], [1], (x, y) => x > y) == true Belt.Array.every2([2, 3], [1], (x, y) => x > y) == true Belt.Array.every2([0, 1], [5, 0], (x, y) => x > y) == false ``` @ @@ @@&some2U@@ ٠!a@@@ !b@@@ Z@@ @@@@ࠠ*Has_arity2 V@@@A@@@@ @@@@@@ @%some2@@ !a@@@ +!b@@@@@  4@@@@ 8@@@@@@ :  = Z `some2(xs, ys, p)` returns true if `p(xi, yi)` is true for any pair of elements up to the shorter length (i.e. `min(length(xs), length(ys))`) ## Examples ```rescript Belt.Array.some2([0, 2], [1, 0, 3], (a, b) => a > b) == true Belt.Array.some2([], [1], (x, y) => x > y) == false Belt.Array.some2([2, 3], [1, 4], (x, y) => x > y) == true ``` @ E@@ E@@$cmpU@@ A!az@@v@ K @@w@ @@ P@@{@|@}ࠠ*Has_arity2 @@x@A@@y@@~ ]@@@@@@ u@#cmp@@ q!an@@l@ { @@m@@@ |@@o@p@q @@r@s@t@u@  y  `cmp(xs, ys, f)` compared by length if `length(xs) != length(ys)`; returning `-1` if `length(xs) < length(ys)` or 1 if `length(xs) > length(ys)`. Otherwise compare one by one `f(x, y)`. `f` returns a negative number if `x` is “less than” `y` zero if `x` is “equal to” `y` a positive number if `x` is “greater than” `y`. The comparison returns the first non-zero result of `f`; or zero if `f` returns zero for all `x` and `y`. ## Examples ```rescript Belt.Array.cmp([1, 3, 5], [1, 4, 2], (a, b) => compare(a, b)) == -1 Belt.Array.cmp([1, 3, 5], [1, 2, 3], (a, b) => compare(a, b)) == 1 Belt.Array.cmp([1, 3, 5], [1, 3, 5], (a, b) => compare(a, b)) == 0 ``` @ @@ @@#eqU@@ !ac@@_@  @@`@ @@ @@d@e@fࠠ*Has_arity2 @@a@A@@b@@g @@h@i@j@k@ @"eq@@ Ϡ!aW@@U@ ٠ @@V@@@ @@X@Y@Z @@[@\@]@^@    `eq(xs, ys)` return `false` if length is not the same otherwise compare items one by one using `f(xi, yi)`; and return true if all results are true false otherwise ## Examples ```rescript Belt.Array.eq([1, 2, 3], [(-1), (-2), (-3)], (a, b) => abs(a) == abs(b)) == true ``` @ @@ @@6truncateToLengthUnsafe@@ !aO@@P@ @@Q @@R@S@T&lengthBA !  BE&length@@@@@   # s Unsafe `truncateToLengthUnsafe(xs, n)` sets length of array `xs` to `n`. If `n` is greater than the length of `xs`; the extra elements are set to `Js.Null_undefined.null`. If `n` is less than zero; raises a `RangeError`. ## Examples ```rescript let arr = ["ant", "bee", "cat", "dog", "elk"] Belt.Array.truncateToLengthUnsafe(arr, 3) arr == ["ant", "bee", "cat"] ``` @ +@@ +@@%initU@@ @@E@ @ *@@H!aK@Iࠠ*Has_arity1 @@F@A@@G@@J D@@L@M@N@ S@$init@@ F@@>@@ N@@?!aA@@ _@@B@C@D@ n@$push@@ j!a:@@9@ Y@@;@<@=$pushBA  BE$push@@@@@@  j A `arr->push(item)` pushes an element `item` into an array `arr`. @ @@ @@@Z5,*Belt_Array0Bʢ&56("Js0.?@А!a8@Sn9@@Ak.@k.A@@@ @@ k.B@@г#intk.Fk.I@@ @@@@@@&@@-%array_lengthAAR@@@j  k.[@j  j -@= See [`Belt.Array.length`]() @ @@ @@@@3#get@yy@б@г㠐!t&y'y@А!a 8&&&&&&&&&@Rm8@@A4y5y@@@ @@ ;y@@б@г#intEyFy@@ @@@@г&optionRySy@А!a,'YyZy@@@2@@.`y@@@@ 2@@@0@ 5gy@@@jm]] @pom]]px@ & If `i <= 0 <= length(arr)` returns `Some(value)` where `value` is the item at index `i`. If `i` is out of range returns `None`. ## Examples ```rescript Belt.Array.get(["a", "b", "c"], 0) == Some("a") Belt.Array.get(["a", "b", "c"], 3) == None Belt.Array.get(["a", "b", "c"], -1) == None ``` @ @@ @@@zy@J&getExn@@б@гK!t @А!a8@i3@@A"#@@@ @@ $@@б@гm#int&)@@ @@@@А!a"/0@@@ '@"@@@ @%@@@{ @Ȱ{~@ ^ Raise an exception if `i` is out of range. Otherwise return the value at index `i` in `arr`. @ @@ @@@@:)getUnsafe@HH@б@г!tHH@А!a'8@Yt3@@AHH@@@ @@ H@@б@гŠ#intHH@@ @@!@@А!a"HH@@@ '@$"@@@ @%%H@@1%array_unsafe_getBAo@@@@A22 H@&%A22&G@ t `getUnsafe(arr, i)` **Unsafe** no bounds checking; this would cause type error if `i` does not stay within range @ @@ @@@@@,getUndefined@9Q:Q@б@г!tDQEQ@А!a(8DDDDDDDDD@_z9@@ARQSQ@@@ @@* YQ@@б@г##intcQdQ@@ @@.@@г@"JsA)undefinedtQuQ@А!a0+{Q|Q@@@6@@2Q@@@ @6#@@@4@9Q@@1%array_unsafe_getBA@@@@JQ@JP@ `getUndefined(arr, i)` It does the samething in the runtime as [`getUnsafe`](); it is _type safe_ since the return type still track whether it is in range or not @ @@ @@@@T#set@W | W | @б@гs!tW | W | @А!a8@s9@@AW | W | @@@ @@ W | @@б@г#intW | W | @@ @@@@б@А!a$W | W | @@г$boolW | W | @@ @@.@@@6@1W |  @@@@5" @@@3@8W | @@@S@SV y {@ `set(arr, n, x)` modifies `arr` in place; it replaces the nth element of `arr` with `x`. Returning `false` means not updated due to out of range. @ @@ @@@ W | |#@M&setExn@\  \  @б@гޠ!t!\  "\  @А!a8!!!!!!!!!@l3@@A/\  0\  @@@ @@ 6\  @@б@г#int@\  A\  @@ @@@@б@А!a$L\  M\  @@гߠ$unitU\  V\  @@ @@.@@@6@1^\   @@@@5" @@@3@8e\  @@@hY  @nmY  n[  @ @ `setExn(arr, i, x)` raise an exception if `i` is out of range. @ @@ @@@x\  #@M)setUnsafe@^  ^  @б@гI!t^  ^  !@А!a8@l3@@A^  #^  $@@@ @@ ^  %@@б@гk#int^  '^  *@@ @@@@б@А!a$^  -^  .@@гJ$unit^  3^  7@@ @@.@@@6@1^  , @@@@5" @@@3@8^  @@1%array_unsafe_setCA(@@@@@^  ^  M@@@@@F.shuffleInPlace@c  c  @б@г!tc  c  @А!a8@e,@@Ac  c  @@@ @@ c  @@г$unit c  c  @@ @@@@@@&@@@` O O @` O Ob  @ = `shuffleInPlace(arr)` randomly re-orders the items in `arr` @ @@ @@@(c  @.'shuffle@1f  2f  @б@г!t<f  =f  @А!a8<<<<<<<<<@Mh3@@AJf  Kf  @@@ @@ Qf  @@г!tYf  Zf  @А!a`f  af  @@@#@@gf  @@@@#/@@@me  @sre  se  @ G Returns a fresh array with items in original array randomly shuffled. @ @@ @@@}f  @7.reverseInPlace@u  u  @б@гN!tu  u  @А!a8@Vq3@@Au  u  @@@ @@ u  @@г8$unitu  u  @@ @@@@@@&@@@h   @h  t  @ `reverseInPlace(arr)` reverses items in `arr` in place. ## Examples ```rescript let arr = [10, 11, 12, 13, 14] let () = Belt.Array.reverseInPlace(arr) arr == [14, 13, 12, 11, 10] ``` @ @@ @@@u  @.'reverse@    @б@г!t    @А!a8@Mh3@@A    @@@ @@   @@г!t    @А!a    @@@#@@  @@@@#/@@@w  @w    @ `reverse(arr)` returns a fresh array with items in arr in reverse order. ## Examples ```rescript Belt.Array.reverse([10, 11, 12, 13, 14]) == [14, 13, 12, 11, 10] ``` @ @@ @@@  @71makeUninitialized@' ( $@б@г#int2 &3 )@@ @@8,,,,,,,,,@Pk-@@A@@г%arrayA -B 2@г@"JsA)undefinedO 3P ?@А!a#[ A\ B@@@ @@ *b C@@@) @@0'h D@@@7@4:@@%ArrayAA " A@%Array@@@@@@s  t N@zy  z @ / `makeUninitialized(n)` creates an array of length `n` filled with the undefined value. You must specify the type of data that will eventually fill the array. ## Examples ```rescript let arr: array> = Belt.Array.makeUninitialized(5) Belt.Array.getExn(arr, 0) == Js.undefined ``` @ @@ @@@@O7makeUninitializedUnsafe@;D;[@б@гY#int;];`@@ @@8@h}4@@A@@гe!t;d;e@А!a ;g;h@@@ @@;i@@@#@ &@@%ArrayAA " A@%Array@@@@@@PP;s@ͰUU8:@ **Unsafe** ## Examples ```rescript let arr = Belt.Array.makeUninitializedUnsafe(5) Js.log(Belt.Array.getExn(arr, 0)) // undefined Belt.Array.setExn(arr, 0, "example") Js.log(Belt.Array.getExn(arr, 0) == "example") ``` @ @@ @@@@;$make@@б@г#int@@ @@!8@Ti4@@A@@б@А!a-$ @@гŠ!t @А!a@@@@@&$@@@ @*(@@@/@+, @@@!uu @'&uu'@ n `make(n, e)` return an array of size `n` filled with value `e`. Returns an empty array when `n` is negative. @ @@ @@@1@A%range@:;@б@г#intEF@@ @@.8?????????@Zo-@@A@@б@г#intVW@@ @@1@@г᠐%arraycd@г-#intmn@@ @@4(@@@@@8-x@@@#@<1&@@@7@=4@@@ @@ `range(start, finish)` create an inclusive array. ## Examples ```rescript Belt.Array.range(0, 3) == [0, 1, 2, 3] Belt.Array.range(3, 0) == [] Belt.Array.range(3, 3) == [3] ``` @ @@ @@@@I'rangeBy@@б@гf#int@@ @@>8@bw-@@A@@б@гw#int@@ @@A@@б$stepг#int@@ @@D"@/res.namedArgLoc@@@г[%array@г#int@@ @@GA@@@@@KF@@6+@OJ@@@@@PNC@@@T@QQ @@@@@  `rangeBy(start, finish, ~step)` returns empty array when step is 0 or negative. It also return an empty array when `start > finish`. ## Examples ```rescript Belt.Array.rangeBy(0, 10, ~step=3) == [0, 3, 6, 9] Belt.Array.rangeBy(0, 12, ~step=3) == [0, 3, 6, 9, 12] Belt.Array.rangeBy(33, 0, ~step=1) == [] Belt.Array.rangeBy(33, 0, ~step=-1) == [] Belt.Array.rangeBy(3, 12, ~step=-1) == [] Belt.Array.rangeBy(3, 3, ~step=0) == [] Belt.Array.rangeBy(3, 3, ~step=1) == [3] ``` @ @@ @@@@f'makeByU@ @б@г䠐#int$%@@ @@R8@-@@A@@б@г)function$56"@б@г#intAB@@ @@U@@А!alX&P!@@@ @Y*@з*Has_arity1&@A@@@@ࠠ@@@[@A@@\8-@@3 @@_=g2@@г,!to'p(@А!a+Lv*w+@@@1@@eS},@@@@iW@@@]@jZ@@@ @@@ @@`&makeBy@=A=G@б@г\#int=J=M@@ @@m8@y@@A@@б@б@гo#int=O=R@@ @@p@@А!a}s=W=X@@@ @t!@@г!t=]=^@А!a/=`=a@@@@@v6=b@@@@z:-@@@@@{==I@@@-- @--:<@  `makeBy(n, f)` return an empty array when n is negative return an array of size n populated by `f(i)` start from `0` to `n - 1`. ## Examples ```rescript Belt.Array.makeBy(5, (i) => i) == [0, 1, 2, 3, 4] Belt.Array.makeBy(5, (i) => i * i) == [0, 1, 4, 9, 16] ``` @ @@ @@@==@R1makeByAndShuffleU@dhdy@б@гƠ#int d| d@@ @@~8         @k-@@A@@б@гҠ d d@б@г᠐#int !d "d@@ @@@@А!a$ 0d@@@ @(@з*Has_arity1&@A@@@@ࠠ@@@A@@5,@@0 @@: Fd1@@г !t Nd Od@А!a*I Ud Vd@@@0@@P \d@@@@T@@@Z@W cd{@@@ fdd @@@ @@]0makeByAndShuffle@ p q@б@г ;#int { |@@ @@8 u u u u u u u u u@v@@A@@б@б@г N#int  @@ @@@@А!a  @@@ @!@@гf!t  @А!a/  @@@@@6 @@@@:-@@@@@= @@@  @ ǰ  @ ' Equivalent to `shuffle(makeBy(n, f))` @ @@ @@@ @R#zip@  @б@г!t  @А!a8         @q3@@A  @@@ @@  @@б@г %array  @А!b  @@@ @@& @@г %array  @ВА!a=8 ) *@@А!b%? 0 1@@@J,@F 7 8@@@! @@M >@@@/@Q>@@@O@T E@@@ H @ N M N@ `zip(a, b)` create an array of pairs from corresponding elements of a and b. Stop with the shorter array. ## Examples ```rescript Belt.Array.zip([1, 2], [3, 4, 5]) == [(1, 3), (2, 4)] ``` @ @@ @@@ X@i&zipByU@ a b@б@г )!t l m@А!a8 l l l l l l l l l@3@@A z {@@@ @@  @@б@г %array  @А!b  @@@ @@&  @@б@г cs   @б@А!a<7  @@б@А!b%?  @@А!cJ @@@4 @N  @@@W@R$@з*Has_arity2+@A@@@@ࠠv@@@A@@_1@@5 @@d  6@@г b%array   %@А!c.s ' (@@@4@@z )@@@@~@@@_@n@@@@  @@@ @@@@@%zipBy@ BF BK@б@г Ѡ!t BN BO@А!a8         @$@@A "BQ #BR@@@ @@  )BS@@б@г %array 3BU 4BZ@А!b ?B\ @B]@@@ @@& FB^@@б@б@А!a4/ OBb PBc@@б@А!b7 WBf XBg@@А!cB bBm cBn@@@- @G gBe@@@P@K kB` @@г %array sBs tBx@А!cZ zBz {B{@@@#@@a B|@@@@e@@@F@hU@@@f@k BM @@@ **@  ** ?A@  `zipBy(xs, ys, f)` create an array by applying `f` to corresponding elements of `xs` and `ys`. Stops with shorter array. Equivalent to `map(zip(xs, ys), ((a, b)) => f(a, b))` ## Examples ```rescript Belt.Array.zipBy([1, 2, 3], [4, 5], (a, b) => 2 * a + b) == [6, 9] ``` @ @@ @@@ BB@%unzip@    @б@г 0%array    @ВА!a8         @6@@A    @@А!b    @@@ @    @@@- @@ +  @@Вг !t    @А!a3.    @@@9@@5  @@г }%array    @А!b<E    @@@B@@L   @@@  @R     @@@? @Wf@@@ ~~@  ~~  @ V `unzip(a)` takes an array of pairs and creates a pair of arrays. The first array contains all the first items of the pairs; the second array contains all the second items. ## Examples ```rescript Belt.Array.unzip([(1, 2), (3, 4)]) == ([1, 3], [2, 4]) Belt.Array.unzip([(1, 2), (3, 4), (5, 6), (7, 8)]) == ([1, 3, 5, 7], [2, 4, 6, 8]) ``` @ @@ @@@ * @k&concat@ 3=A 4=G@б@г !t >=J ?=K@А!a18 > > > > > > > > >@3@@A L=M M=N@@@ @@   S=O@@б@г !t ]=Q ^=R@А!a d=T e=U@@@%@@%! k=V@@г 0!t s=[ t=\@А!a50 z=^ {=_@@@;@@*7 =`@@@@.;(@@@9@/> =I@@@    @     :<@ + `concat(xs, ys)` returns a fresh array containing the concatenation of the arrays `v1` and `v2`, so even if `v1` or `v2` is empty; it can not be shared. ## Examples ```rescript Belt.Array.concat([1, 2, 3], [4, 5]) == [1, 2, 3, 4, 5] Belt.Array.concat([], ["a", "b", "c"]) == ["a", "b", "c"] ``` @ @@ @@@ ==@S*concatMany@ &48 &4B@б@г -%array &4D &4I@г v!t &4J &4K@А!aD28         @|=@@A &4M &4N@@@ @@4  &4O@@@' @@9% &4P@@г !t &4T &4U@А!a# &4W &4X@@@)@@>% &4Y@@@@B)?@@@ bb@  bb %13@ `concatMany(xss)` returns a fresh array as the concatenation of `xss` (an array of arrays) ## Examples ```rescript Belt.Array.concatMany([[1, 2, 3], [4, 5, 6], [7, 8]]) == [1, 2, 3, 4, 5, 6, 7, 8] ``` @ @@ @@@ &44@=%slice@ ; $ ; )@б@г Ѡ!t ; , ; -@А!aZE8         @\3@@A "; / #; 0@@@ @@G  ); 1@@б&offsetг #int 5; < 6; ?@@ @@K@m ?; 4 @; :@@@б#lenг #int M; G N; J@@ @@N3@ W; B X; E@@@г !t a; O b; P@А!aMH h; R i; S@@@S@@RO o; T@@.#@VS s; A@@J?@WW w; 3 @@@V@X[ {; + @@@ ~([[@  ([[ :@  `slice(xs, offset, len)` creates a new array with the len elements of `xs` starting at `offset` for `offset` can be negative;and is evaluated as `length(xs) - offset(slice, xs) - 1(1)` means get the last element as a singleton array `slice(xs, ~-len, len)` will return a copy of the array if the array does not have enough data; `slice` extracts through the end of sequence. if `len` is negative; returns the empty array. ## Examples ```rescript Belt.Array.slice([10, 11, 12, 13, 14, 15, 16], ~offset=2, ~len=3) == [12, 13, 14] Belt.Array.slice([10, 11, 12, 13, 14, 15, 16], ~offset=-4, ~len=3) == [13, 14, 15] Belt.Array.slice([10, 11, 12, 13, 14, 15, 16], ~offset=4, ~len=9) == [14, 15, 16] ``` @ @@ @@@ ;   @p*sliceToEnd@ N 1 5 N 1 ?@б@г _!t N 1 B N 1 C@А!al[8         @3@@A N 1 E N 1 F@@@ @@]  N 1 G@@б@г #int N 1 I N 1 L@@ @@a@@г !t N 1 Q N 1 R@А!a,' N 1 T N 1 U@@@2@@e. N 1 V@@@@i2@@@0@j5 N 1 A@@@ =VV @  =VV M . 0@  `sliceToEnd(xs, offset)` creates a new array with the elements of `xs` starting at `offset` `offset` can be negative; and is evaluated as `length(xs) - offset(sliceToEnd, xs) - 1` means get the last element as a singleton array `sliceToEnd(xs, 0)` will return a copy of the array ## Examples ```rescript Belt.Array.sliceToEnd([10, 11, 12, 13, 14, 15, 16], 2) == [12, 13, 14, 15, 16] Belt.Array.sliceToEnd([10, 11, 12, 13, 14, 15, 16], -4) == [13, 14, 15, 16] ``` @ @@ @@@ N 1 1@J $copy@ U  U  @б@г Ǡ!t U   U  @А!az m8         @i3@@AU  U  @@@ @@o U  @@г 䠐!t'U  (U  @А!a.U  /U  @@@#@@t5U  @@@@x#9U  @@%sliceAA + AA@A@@%slice@@@@@AP X XBU  @HGQ ^ ^HT  @ ^ `copy(a)` returns a copy of `a`; that is; a fresh array containing the same elements as `a`. @ @@ @@@@? $fill@\k##]k## @б@г $!tgk## hk## @А!a {8ggggggggg@^y:@@Auk##vk##@@@ @@} |k##@@б&offsetгH#intk##k##@@ @@@k##k##@@@б#lenг`#intk##'k##*@@ @@3@ذk##"k##%@@@б@А!aE@k##-k##.@@гF$unitk##3k##7@@ @@O@@@W@Rk##, @@1&@Vk##! @@MB@Zk##@@@Y@^k## @@@W  @ڰW  j"#@  `fill(arr, ~offset, ~len, x)` modifies `arr` in place, storing `x` in elements number `offset` to `offset + len - 1`. `offset` can be negative; and is evaluated as `length(arr - offset)`. `fill(arr, ~offset=-1, ~len=1)` means fill the last element, if the array does not have enough data; `fill` will ignore it ## Examples ```rescript let arr = Belt.Array.makeBy(5, (i) => i) Belt.Array.fill(arr, ~offset=2, ~len=2, 9) arr == [0, 1, 9, 9, 4] Belt.Array.fill(arr, ~offset=7, ~len=2, 8) arr == [0, 1, 9, 9, 4] @ @@ @@@k##(@s $blit@&&&&@б#srcг !t&&&&@А!a 8@5@@A&& &&@@@ @@ &&@B&&&&@@@б)srcOffsetг⠐#int"&&#&&@@ @@"@Z,&&-&&@@@б#dstг !t:&&;&&@А!a@;A&&B&'@@@F@@BH&'@{M&&N&&@@@б)dstOffsetг#int[&'\&'@@ @@[@e&'f&' @@@б#lenг3#ints&'t&'@@ @@s@}&'~&'@@@г$unit&'"&'&@@ @@@@%@&' @@A6@&' @@fT@&&@@w@&&@@@&&@@@m#9#9@m#9#9&&@  `blit(~src=v1, ~srcOffset=o1, ~dst=v2, ~dstOffset=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. `offset` can be negative; `-1` means `len - 1`; if `len + offset` is still negative;it will be set as 0 For each of the examples;presume that `v1 == [10, 11, 12, 13, 14, 15, 16, 17]` and `v2 == [20, 21, 22, 23, 24, 25, 26, 27]`. The result shown is the content of the destination array. ## Examples ```rescript let v1 = [10, 11, 12, 13, 14, 15, 16, 17] let v2 = [20, 21, 22, 23, 24, 25, 26, 27] Belt.Array.blit(~src=v1, ~srcOffset=4, ~dst=v2, ~dstOffset=2, ~len=3) v2 == [20, 21, 14, 15, 16, 25, 26, 27] Belt.Array.blit(~src=v1, ~srcOffset=4, ~dst=v1, ~dstOffset=2, ~len=3) v1 == [10, 11, 14, 15, 16, 15, 16, 17] ``` @ @@ @@@&&,@ *blitUnsafe@'T'X'T'b@б#srcг!t'T'k'T'l@А!a 8@5@@A'T'n'T'o@@@ @@ 'T'p@'T'f'T'i@@@б)srcOffsetг#int'T'~'T'@@ @@"@)'T's'T'|@@@б#dstгƠ!t 'T' 'T'@А!a@;'T''T'@@@F@@B'T'@J'T''T'@@@б)dstOffsetгꠐ#int*'T'+'T'@@ @@[@b4'T'5'T'@@@б#lenг#intB'T'C'T'@@ @@s@zL'T'M'T'@@@гࠐ$unitV'T'W'T'@@ @@@@%@_'T' @@A6@c'T' @@fT@g'T'@@w@k'T'r@@@o'T'd@@@r'('(@xw'('(x'Q'S@ & Unsafe blit without bounds checking. @ @@ @@@'T'T,@ (forEachU@''''@б@гS!t''''@А!a 8@3@@A''''@@@ @@ ''@@б@гp''''@б@А!a''''@@гO$unit''@@@@(@@@0@+@з*Has_arity1!@A@@@@ࠠy@@@A@@8'@@+ @@='',@@гq$unit''''@@ @@K@@@@N@@@L@Q'' @@@''@@@@@W'forEach@))))@б@гȠ!t )) ))@А!a8         @v$@@A))))@@@ @@  ))@@б@б@А!a)))*))@@г$unit2))3))@@ @@!@@@)@$;)) @@г͠$unitC))D))@@ @@2@@@@5@@@3@8O)) @@@R''@XW''X))@  `forEach(xs, f)` Call `f` on each element of `xs` from the beginning to end. `f` returns `unit` so no new array is created. Use `forEach` when you are primarily concerned with repetitively creating side effects. ## Examples ```rescript Belt.Array.forEach(["a", "b", "c"], x => Js.log("Item: " ++ x)) /* prints: Item: a Item: b Item: c */ let total = ref(0) Belt.Array.forEach([1, 2, 3, 4], x => total := total.contents + x) total.contents == 1 + 2 + 3 + 4 ``` @ @@ @@@b))@M$mapU@k))l))@б@г3!tv))w))@А!a8vvvvvvvvv@l3@@A))))@@@ @@ ))@@б@гP `)*)* @б@А!a)*)*@@А!b%)* @@@. @)@з*Has_arity1@A@@@@ࠠ W@@@A@@6%@@) @@;)**@@гC%array)*)*@А!b*J)*)*@@@0@@ Q)*@@@@U@@@S@X))@@@)) @@@ @@^#map@****@б@г!t****@А!a%8@}$@@A****@@@ @@ **@@б@б@А!a****@@А!b'****@@@' @" **@@г%array(**)**@А!b1/**0**@@@@@86**@@@@"<@@@:@#?=**@@@@** @FE**F**@ `map(xs, f)` returns a new array by calling `f` for each element of `xs` from the beginning to end. ## Examples ```rescript Belt.Array.map([1, 2], (x) => x + 1) == [3, 4] ``` @ @@ @@@P**@T(flatMapU@Y*+Z*+@б@г!!td*+ e*+ @А!aG(8ddddddddd@s3@@Ar*+s*+@@@ @@* y*+@@б@г> N*+*+%@б@А!a*+*+@@г%array*+*+!@А!bI./*+#*+$@@@ @@06$@@@>@49(@з*Has_arity1/@A@@@@ࠠ U@@6@A@@7F5@@9 @@:K*+:@@гA%array*+**+/@А!b0Z*+1*+2@@@6@@@a*+3@@@@De@@@c@Eh*+ @@@** @@@ @@n'flatMap@,",&,",-@б@г!t,",0,",1@А!a_J8@$@@A,",3,",4@@@ @@L ,",5@@б@б@А!a,",8,",9@@г%array,",=,",B@А!baP'#,",D$,",E@@@ @@R.*,",F@@@7@V2.,",7@@г%array6,",K7,",P@А!bA=,",R>,",S@@@%@@XHD,",T@@@@\L@@@J@]OK,",/@@@N+4+4 @TS+4+4T,,!@ `flatMap(xs, f)` returns a new array by calling `f` for each element of `xs` from the beginning to end, concatenating the results. ## Examples ```rescript Belt.Array.flatMap([1, 2], x => [x + 10, x + 20]) == [11, 21, 12, 22] ``` @ @@ @@@^,","@d&getByU@g,V,Zh,V,`@б@г/!tr,V,cs,V,d@А!a~b8rrrrrrrrr@3@@A,V,f,V,g@@@ @@d ,V,h@@б@гL \,V,k,V,x@б@А!a,V,n,V,o@@г9$bool,V,t@@@@h(@@@0@k+@з*Has_arity1!@A@@@@ࠠ U@@m@A@@n8'@@+ @@q=,V,j,@@г&option,V,},V,@А!aQL,V,,V,@@@W@@wS,V,@@@@{W@@@U@|Z,V,b@@@,V,V @@@ @@`%getBy@----@б@г!t----@А!a8@$@@A----@@@ @@ --@@б@б@А!a----@@г$bool----@@ @@!@@@)@$ -- @@гm&option(--)--@А!a83/--0--@@@>@@:6--@@@@>@@@<@A=--@@@@,, @FE,,F--@ A `getBy(xs, p)` returns `Some(value)` for the first value in `xs` that satisifies the predicate function `p`; returns `None` if no element satisifies the function. ## Examples ```rescript Belt.Array.getBy([1, 4, 3, 2], (x) => mod(x, 2) == 0) == Some(4) Belt.Array.getBy([15, 13, 11], (x) => mod(x, 2) == 0) == None ``` @ @@ @@@P--@V+getIndexByU@Y-.Z-. @б@г!!td-.e-.@А!a8ddddddddd@u3@@Ar-.s-.@@@ @@ y-.@@б@г> N-.-.$@б@А!a-.-.@@г+$bool-. @@@@(@@@0@+@з*Has_arity1!@A@@@@ࠠ G@@@A@@8'@@+ @@=-.,@@г&option-.)-./@г#int-.0-.3@@ @@U@@@@@Z-.4@@@&@^!@@@\@a-.@@@-- @@@ @@g*getIndexBy@////@б@г!t////@А!a8@$@@A////@@@ @@ //@@б@б@А!a////@@г$bool////@@ @@!@@@)@$// @@гf&option!//"//@г렐#int+//,//@@ @@<@@@@@A6//@@@#@E!@@@C@H=//@@@@.5.5 @FE.5.5F//@ P `getIndexBy(xs, p)` returns `Some(index)` for the first value in `xs` that satisifies the predicate function `p`; returns `None` if no element satisifies the function. ## Examples ```rescript Belt.Array.getIndexBy([1, 4, 3, 2], (x) => mod(x, 2) == 0) == Some(1) Belt.Array.getIndexBy([15, 13, 11], (x) => mod(x, 2) == 0) == None ``` @ @@ @@@P//@]%keepU@Y//Z//@б@г!!td//e//@А!a8ddddddddd@|3@@Ar//s//@@@ @@ y//@@б@г> N////@б@А!a////@@г+$bool//@@@@(@@@0@+@з*Has_arity1!@A@@@@ࠠ G@@@A@@8'@@+ @@=//,@@гr!t////@А!aQL////@@@W@@S//@@@@W@@@U@Z//@@@// @@@ @@`$keep@080<080@@б@г!t080C080D@А!a8@$@@A080F080G@@@ @@ 080H@@б@б@А!a080K080L@@г$bool 080P 080T@@ @@!@@@)@$080J @@гנ!t080Y080Z@А!a83!080\"080]@@@>@@:(080^@@@@>@@@<@A/080B@@@2// @87//80507@ G `keep(xs, p)` returns a new array that keep all elements satisfy `p`. @ @@ @@@B0808@V.keepWithIndexU@K0`0dL0`0r@б@г!tV0`0uW0`0v@А!a8VVVVVVVVV@u3@@Ad0`0xe0`0y@@@ @@ k0`0z@@б@г0@s0`0}t0`0@б@А!a|0`0}0`0@@б@гG#int0`00`0@@ @@+@@г,$bool0`0!@@@@7%@@@@:(@@@B@=,@з*Has_arity23@A@@@@ࠠK@@@A@@J9@@= @@ O0`0|>@@гv!t0`00`0@А!ac^0`00`0@@@i@@e0`0@@@@i@@@g@l0`0t@@@0`0` @@@ @@r-keepWithIndex@1L1P1L1]@б@г!t1L1`1L1a@А!a/8@$@@A1L1c1L1d@@@ @@ 1L1e@@б@б@А!a1L1i1L1j@@б@гϠ#int1L1l1L1o@@ @@#@@г$bool1L1t1L1x@@ @@"0@@@@%3@@@;@&6(1L1g @@г!t01L1}11L1~@А!aJE71L181L1@@@P@@(L>1L1@@@@,P@@@N@-SE1L1_@@@H00 @NM00N1I1K@ `keepWithIndex(xs, p)` returns a new array that keep all elements satisfy `p`. ## Examples ```rescript Belt.Array.keepWithIndex([1, 2, 3], (_x, i) => i == 1) == [2] ``` @ @@ @@@X1L1L@h(keepMapU@a11b11@б@г)!tl11m11@А!aO08lllllllll@3@@Az11{11@@@ @@2 11@@б@гFV1111@б@А!a1111@@гࠐ&option1111@А!bQ6/1111@@@ @@86$@@@>@<9(@з*Has_arity1/@A@@@@ࠠ]@@>@A@@?F5@@9 @@BK11:@@гI%array1111@А!b0Z1111@@@6@@Ha11@@@@Le@@@c@Mh11@@@11 @@@ @@n'keepMap@2222@б@г!t2222@А!agR8@$@@A2222@@@ @@T  22@@б@б@А!a2222@@гd&option22 22@А!biX'+22,22@@@ @@Z.222@@@7@^2622@@г%array>22?22@А!bAE22F22@@@%@@`HL22@@@@dL@@@J@eOS22@@@V11 @\[11\22@ `keepMap(xs, p)` returns a new array that keep all elements that return a non None applied `p`. ## Examples ```rescript Belt.Array.keepMap([1, 2, 3], x => if mod(x, 2) == 0 { Some(x) } else { None } ) == [2] ``` @ @@ @@@f22@d1forEachWithIndexU@o22p22@б@г7!tz22{22@А!aj8zzzzzzzzz@3@@A2222@@@ @@l 22@@б@гTd2223@б@гc#int2223@@ @@p#@@б@А!a.)2323@@гB$unit23 !@@@@s7%@@@?@v:23)@@@@w>-@з*Has_arity24@A@@@@ࠠp@@y@A@@zK:@@> @@}P22?@@гh$unit2323@@ @@^@@@@a@@@_@d22 @@@22@@@@@j0forEachWithIndex@5#5'5#57@б@г!t5#5:5#5;@А!a8@$@@A5#5=5#5>@@@ @@ 5#5?@@б@б@г㠐#int#5#5B$5#5E@@ @@@@б@А!a&!/5#5H05#5I@@г $unit85#5N95#5R@@ @@0@@@8@3A5#5G @@@@7E5#5A @@гנ$unitM5#5WN5#5[@@ @@E@@@@H@@@F@KY5#59 @@@\33@ba33b5 5"@  `forEachWithIndex(xs, f)` same as `Belt.Array.forEach`, except that `f` is supplied two arguments: the index starting from 0 and the element from `xs`. ## Examples ```rescript Belt.Array.forEachWithIndex(["a", "b", "c"], (i, x) => Js.log("Item " ++ Belt.Int.toString(i) ++ " is " ++ x)) /* prints: Item 0 is a Item 1 is b Item 2 is cc */ let total = ref(0) Belt.Array.forEachWithIndex([10, 11, 12, 13], (i, x) => total := total.contents + x + i) total.contents == 0 + 10 + 1 + 11 + 2 + 12 + 3 + 13 ``` @ @@ @@@l5#5#@`-mapWithIndexU@u5]5av5]5n@б@г=!t5]5q5]5r@А!a8@3@@A5]5t5]5u@@@ @@ 5]5v@@б@гZj5]5y5]5@б@гi#int5]5{5]5~@@ @@#@@б@А!a.)5]55]5@@А!b45]5#@@@= @85]5'@@@@<+@з*Has_arity22@A@@@@ࠠt@@@A@@I8@@< @@N5]5x=@@г`%array5]55]5@А!b.]5]55]5@@@4@@d5]5@@@@h@@@f@k5]5p@@@5]5] @@@ @@q ,mapWithIndex@(66(66@б@г̠!t(66(66@А!a 8@$@@A(66(66@@@ @@ $(66@@б@б@г#int0(661(66@@ @@@@б@А!a&!<(66=(66@@А!b ,G(66H(66@@@6 @1L(66@@@@5P(66 @@г֠%arrayX(66Y(66@А!bD_(66`(66@@@#@@Kf(66@@@@O@@@M@Rm(66@@@p55 @vu55v'66@ `mapWithIndex(xs, f)` applies `f` to each element of `xs`. Function `f` takes two arguments: the index starting from 0 and the element from `xs`. ## Examples ```rescript Belt.Array.mapWithIndex([1, 2, 3], (i, x) => i + x) == [0 + 1, 1 + 2, 2 + 3] ``` @ @@ @@@(66@g!*partitionU@*66*66@б@гQ!t*66*66@А!a!8@3@@A*66*66@@@ @@ *66@@б@гn~*66*66@б@А!a*66*66@@г[$bool*66@@@@(@@@0@+@з*Has_arity1!@A@@@@ࠠw@@@A@@8'@@+ @@=*66,@@Вг!t*67*67@А!aTO*67*67@@@Z@@V*67@@г!t*67*67 @А!akf*67 *67 @@@q@@m *67 @@@  @s*67*67@@@@ @x;@@@v@{*66@@@*66 @@@ @@")partition@(78z8~)78z8@б@г!t378z8478z8@А!a"8333333333@$@@AA78z8B78z8@@@ @@ H78z8@@б@б@А!aQ78z8R78z8@@г$boolZ78z8[78z8@@ @@!@@@)@$c78z8 @@Вг+!tn78z8o78z8@А!a;6u78z8v78z8@@@A@@=|78z8@@гB!t78z878z8@А!aRM78z878z8@@@X@@ T78z8@@@  @ Z78z878z8@@@= @_;@@@]@b78z8@@@+77 @+7768w8y@ e `partition(f, a)` split array into tuple of two arrays based on predicate `f`; first of tuple where predicate cause true, second where predicate cause false ## Examples ```rescript Belt.Array.partition([1, 2, 3, 4, 5], (x) => mod(x, 2) == 0) == ([2, 4], [1, 3, 5]) Belt.Array.partition([1, 2, 3, 4, 5], (x) => mod(x, 2) != 0) == ([1, 3, 5], [2, 4]) ``` @ @@ @@@78z8z@w#'reduceU@988988@б@гF%array988988@А!b+#8@3@@A988988@@@ @@ 988@@б@А!a)#988988@@б@г988988@б@А!a'988988@@б@А!b4/988988@@А!a%5 988@@@>)@9 988@@@-@=@з*Has_arity2&@A@@@@ࠠ@@@A@@J,@@0 @@ O#9881@@А!aDT(988)988@@@I@%Y @@@L@&\0988@@@[@'`4988 @@@7988@@@@@f$&reduce@AH::BH::@б@гʠ%arrayLH::MH::@А!b;$,8LLLLLLLLL@$@@AZH::[H::@@@ @@. aH::@@б@А!a9$2mH::nH::@@б@б@А!awH::xH::@@б@А!b,'H::H::@@А!a-H::H::@@@7"@32H::@@@&@46H:: @@А!a+;H::H::@@@ 0@5@ @@@3@6CH::@@@B@7GH:: @@@:88@:88G::@  `reduce(xs, init, f)` applies `f` to each element of `xs` from beginning to end. Function `f` has two parameters: the item from the list and an “accumulator”; which starts with a value of `init`. `reduce` returns the final value of the accumulator. ## Examples ```rescript Belt.Array.reduce([2, 3, 4], 1, (a, b) => a + b) == 10 Belt.Array.reduce(["a", "b", "c", "d"], "", (a, b) => a ++ b) == "abcd" ``` @ @@ @@@H::@\%.reduceReverseU@J::J::@б@гD%arrayJ::J::@А!bU%<8@{3@@AJ::J::@@@ @@> J::@@б@А!aS%BJ::J::@@б@гJ::J::@б@А!a'J::J::@@б@А!b4/J::J::@@А!a%5J::@@@>)@C9 J::@@@-@D=@з*Has_arity2&@A@@@@ࠠ@@F@A@@GJ,@@0 @@JO!J::1@@А!aDT&J::'J::@@@I@OY @@@L@P\.J::@@@[@Q`2J:: @@@5J::@@@@@f&-reduceReverse@?U<<@U<<@б@гȠ%arrayJU<<KU<<@А!be&V8JJJJJJJJJ@$@@AXU<<YU<<@@@ @@X _U<<@@б@А!ac&\kU<< lU< a ++ b) == "dcba" ``` @ @@ @@@U<<@\'/reduceReverse2U@W<:<>W<: acc + x + y) == 6 ``` @ @@ @@@b=="@)0reduceWithIndexU@d==d==@б@гנ!td==d==@А!a)8@3@@A(d==)d==@@@ @@ /d==@@б@А!b);d==<d==@@б@гDd==Ed=>@б@А!b'Md==Nd==@@б@А!a4/Ud==Vd==@@б@г #int`d==ad=>@@ @@@@@А!b4Djd=>&@@@ 8@H)@@@P@Kqd==-@@@?@O1@з*Has_arity38@A@@@@ࠠ!@@@A@@\>@@B @@ad==C@@А!bVfd=> d=>@@@[@k @@@^@nd==@@@m@rd== @@@d==@@@@@x*/reduceWithIndex@q??q??@б@гm!tq??q??@А!a*8@$@@Aq??q??@@@ @@ q??@@б@А!b*q??q??@@б@б@А!bq??q??@@б@А!a,'q??q??@@б@г#intq??q??@@ @@8@@А!b,<q??q??@@@ 1@A@@@I@D q??@@@8@H q?? @@А!b=M q?? q??@@@ B@R @@@E@U q??@@@T@Y q?? @@@ e>>@  e>> p??@  Applies `f` to each element of `xs` from beginning to end. Function `f` has three parameters: the item from the array and an “accumulator”, which starts with a value of `init` and the index of each element. `reduceWithIndex` returns the final value of the accumulator. ## Examples ```rescript Belt.Array.reduceWithIndex([1, 2, 3, 4], 0, (acc, x, i) => acc + x + i) == 16 ``` @ @@ @@@ (q??@n+)joinWithU@ 1s?? 2s??@б@г!t <s?? =s??@А!a+8 < < < < < < < < <@3@@A Js?? Ks??@@@ @@  Qs??@@б@г &string [s?? \s??@@ @@@@б@г %5 hs?? is?@@б@А!a.) qs?? rs??@@г 7&string zs??@@@@7@@@?@:@з*Has_arity1!@A@@@@ࠠ.@@@A@@G'@@+ @@L s??,@@г Y&string s?@ s?@ @@ @@Z@@@@]@@@J@`M @@@^@c s??@@@ s??@@@@@i,(joinWith@ B8B< B8BD@б@г!t B8BG B8BH@А!a ,8         @$@@A B8BJ B8BK@@@ @@  B8BL@@б@г &string B8BN B8BT@@ @@@@б@б@А!a&! B8BW B8BX@@г &string B8B\ B8Bb@@ @@0@@@8@3!B8BV @@г Ǡ&string! B8Bg! B8Bm@@ @@A@@@@D@@@1@G4 @@@E@J!B8BF@@@!t@ @ @!"!!t@ @ !"B5B7@ & `joinWith(xs, sep, toString)` Concatenates all the elements of `xs` converted to string with `toString`, each separated by `sep`, the string given as the second argument, into a single string. If the array has only one element, then that element will be returned without using the separator. If the array is empty, the empty string will be returned. ## Examples ```rescript Belt.Array.joinWith([0, 1], ", ", Js.Int.toString) == "0, 1" Belt.Array.joinWith([], " ", Js.Int.toString) == "" Belt.Array.joinWith([1], " ", Js.Int.toString) == "1" ``` @ @@ @@@!,B8B8"@_-%someU@!5BoBs!6BoBx@б@г!t!@BoB{!ABoB|@А!a$- 8!@!@!@!@!@!@!@!@!@@~3@@A!NBoB~!OBoB@@@ @@  !UBoB@@б@г!*!]BoB!^BoB@б@А!a!fBoB!gBoB@@г!$bool!oBoB@@@@(@@@0@+@з*Has_arity1!@A@@@@ࠠ#@@@A@@8'@@+ @@=!BoB,@@г!)$bool!BoB!BoB@@ @@K@@@@!N@@@L@"Q!BoBz @@@!BoBo@@@@@W.$some@!CC!CC@б@г r!t!CC!CC@А!a5.%8!!!!!!!!!@v$@@A!CC!CC@@@ @@' !CC@@б@б@А!a!CC!CC@@г!t$bool!CC!CC@@ @@+!@@@)@.$!CC @@г!$bool!CC!CC@@ @@/2@@@@25@@@3@38!CC @@@!BB@""BB"CC@ 5 `some(xs, p)` returns true if at least one of the elements in `xs` satifies `p`; where `p` is a predicate: a function taking an element and returning a `bool`. ## Examples ```rescript Belt.Array.some([2, 3, 4], (x) => mod(x, 2) == 1) == true Belt.Array.some([(-1), (-3), (-5)], (x) => x > 0) == false ``` @ @@ @@@" CC@M/&everyU@"CD"CD@б@г ݠ!t" CD "!CD @А!aP/68" " " " " " " " " @l3@@A".CD "/CD @@@ @@8 "5CD@@б@г! "=CD">CD@б@А!a"FCD"GCD@@г!砐$bool"OCD@@@@<(@@@0@?+@з*Has_arity1!@A@@@@ࠠ@@A@A@@B8'@@+ @@E="iCD,@@г" $bool"qCD#"rCD'@@ @@JK@@@@MN@@@L@NQ"}CD @@@"CC@@@@@W0%every@"EIEM"EIER@б@г!R!t"EIEU"EIEV@А!aa0Q8"""""""""@v$@@A"EIEX"EIEY@@@ @@S "EIEZ@@б@б@А!a"EIE]"EIE^@@г"T$bool"EIEb"EIEf@@ @@W!@@@)@Z$"EIE\ @@г"e$bool"EIEk"EIEo@@ @@[2@@@@^5@@@3@_8"EIET @@@"D(D(@""D(D("EFEH@  `every(xs, p)` returns `true` if all elements satisfy `p`; where `p` is a predicate: a function taking an element and returning a `bool`. ## Examples ```rescript Belt.Array.every([1, 3, 5], (x) => mod(x, 2) == 1) == true Belt.Array.every([1, (-3), 5], (x) => x > 0) == false ``` @ @@ @@@"EIEI@M1'every2U@"EqEu"EqE|@б@г!!t#EqE#EqE@А!a1b8#########@l3@@A#EqE#EqE@@@ @@d #EqE@@б@г"%array#EqE# EqE@А!b1h#+EqE#,EqE@@@ @@j&#2EqE@@б@г"#:EqE#;EqE@б@А!a<7#CEqE#DEqE@@б@А!b%?#KEqE#LEqE@@г"점$bool#TEqE@@@@nM@@@6@qP#\EqE"@@@Y@rT&@з*Has_arity2-@A@@@@ࠠ @@t@A@@ua3@@7 @@xf#rEqE8@@г#$bool#zEqE#{EqE@@ @@}t@@@@w@@@X@zg @@@x@}#EqE~@@@#EqEq@@@@@2&every2@#GKGO#GKGU@б@г"^!t#GKGX#GKGY@А!a28#########@$@@A#GKG[#GKG\@@@ @@ #GKG]@@б@г#>%array#GKG_#GKGd@А!b2#GKGf#GKGg@@@ @@&#GKGh@@б@б@А!a4/#GKGl#GKGm@@б@А!b7#GKGp#GKGq@@г#$bool#GKGv#GKGz@@ @@F@@@/@I#GKGo @@@R@M#GKGj @@г#$bool$GKG$GKG@@ @@[@@@@^@@@?@aN @@@_@d$GKGW@@@$EE@$$EE$GHGJ@  `every2(xs, ys, p)` returns true if `p(xi, yi)` is true for all pairs of elements up to the shorter length (i.e. `min(length(xs), length(ys))`) ## Examples ```rescript Belt.Array.every2([1, 2, 3], [0, 1], (a, b) => a > b) == true Belt.Array.every2([], [1], (x, y) => x > y) == true Belt.Array.every2([2, 3], [1], (x, y) => x > y) == true Belt.Array.every2([0, 1], [5, 0], (x, y) => x > y) == false ``` @ @@ @@@$$GKGK"@y3&some2U@$-GG$.GG@б@г"!t$8GG$9GG@А!a38$8$8$8$8$8$8$8$8$8@3@@A$FGG$GGG@@@ @@ $MGG@@б@г#ՠ%array$WGG$XGG@А!b3$cGG$dGG@@@ @@&$jGG@@б@г$/?$rGG$sGG@б@А!a<7${GG$|GG@@б@А!b%?$GG$GG@@г$$$bool$GG@@@@M@@@6@P$GG"@@@Y@T&@з*Has_arity2-@A@@@@ࠠD@@@A@@a3@@7 @@f$GG8@@г$J$bool$GG$GG@@ @@t@@@@w@@@X@zg @@@x@}$GG@@@$GG@@@@@4%some2@$I I$$I I)@б@г#!t$I I,$I I-@А!a48$$$$$$$$$@$@@A$I I/$I I0@@@ @@ $I I1@@б@г$v%array$I I3$I I8@А!b4%I I:%I I;@@@ @@&% I I<@@б@б@А!a4/%I I@%I IA@@б@А!b7%I ID%I IE@@г$$bool%%I IJ%&I IN@@ @@F@@@/@I%.I IC @@@R@M%2I I> @@г$Ҡ$bool%:I IS%;I IW@@ @@[@@@@^@@@?@aN @@@_@d%II I+@@@%LGG@%R%QGG%RII@ Z `some2(xs, ys, p)` returns true if `p(xi, yi)` is true for any pair of elements up to the shorter length (i.e. `min(length(xs), length(ys))`) ## Examples ```rescript Belt.Array.some2([0, 2], [1, 0, 3], (a, b) => a > b) == true Belt.Array.some2([], [1], (x, y) => x > y) == false Belt.Array.some2([2, 3], [1, 4], (x, y) => x > y) == true ``` @ @@ @@@%\I I "@y5$cmpU@%eIYI]%fIYIa@б@г$-!t%pIYId%qIYIe@А!a58%p%p%p%p%p%p%p%p%p@3@@A%~IYIg%IYIh@@@ @@ %IYIi@@б@г$L!t%IYIk%IYIl@А!a%IYIn%IYIo@@@%@@!%IYIp@@б@г%br%IYIs%IYI@б@А!a72%IYIv%IYIw@@б@А!a?:%IYIz%IYI{@@г%#int%IYI@@@@H@@@P@K%IYIy"@@@T@O&@з*Has_arity2-@A@@@@ࠠw@@@A@@\3@@7 @@a%IYIr8@@г%#int%IYI%IYI@@ @@o@@@@r@@@X@ub @@@s@x%IYIc@@@%IYIY@@@@@~6#cmp@&L3L7&L3L:@б@г$ɠ!t& L3L=& L3L>@А!a68& & & & & & & & & @$@@A&L3L@&L3LA@@@ @@ &!L3LB@@б@г$蠐!t&+L3LD&,L3LE@А!a&2L3LG&3L3LH@@@%@@ !&9L3LI@@б@б@А!a/*&BL3LM&CL3LN@@б@А!a72&JL3LQ&KL3LR@@г&#int&SL3LW&TL3LZ@@ @@A@@@I@D&\L3LP @@@M@H&`L3LK @@г&(#int&hL3L_&iL3Lb@@ @@V@@@@Y@@@?@\I @@@Z@_&wL3L<@@@&zII@&&II&L0L2@  `cmp(xs, ys, f)` compared by length if `length(xs) != length(ys)`; returning `-1` if `length(xs) < length(ys)` or 1 if `length(xs) > length(ys)`. Otherwise compare one by one `f(x, y)`. `f` returns a negative number if `x` is “less than” `y` zero if `x` is “equal to” `y` a positive number if `x` is “greater than” `y`. The comparison returns the first non-zero result of `f`; or zero if `f` returns zero for all `x` and `y`. ## Examples ```rescript Belt.Array.cmp([1, 3, 5], [1, 4, 2], (a, b) => compare(a, b)) == -1 Belt.Array.cmp([1, 3, 5], [1, 2, 3], (a, b) => compare(a, b)) == 1 Belt.Array.cmp([1, 3, 5], [1, 3, 5], (a, b) => compare(a, b)) == 0 ``` @ @@ @@@&L3L3"@t7#eqU@&LdLh&LdLk@б@г%[!t&LdLn&LdLo@А!a=78&&&&&&&&&@3@@A&LdLq&LdLr@@@ @@ &LdLs@@б@г%z!t&LdLu&LdLv@А!a&LdLx&LdLy@@@%@@#!&LdLz@@б@г&&LdL}&LdL@б@А!a72&LdL&LdL@@б@А!a?:&LdL&LdL@@г&$bool&LdL@@@@'H@@@P@*K&LdL"@@@T@+O&@з*Has_arity2-@A@@@@ࠠ@@-@A@@.\3@@7 @@1a' LdL|8@@г&$bool'LdL'LdL@@ @@6o@@@@9r@@@X@:ub @@@s@;x'"LdLm@@@'%LdLd@@@@@~8"eq@'/MM'0MM@б@г%!t':MM';MM@А!aU8>8':':':':':':':':':@$@@A'HMM'IMM@@@ @@@ 'OMM@@б@г&!t'YMM'ZMM@А!a'`MM'aMM@@@%@@E!'gMM@@б@б@А!a/*'pMM'qMM@@б@А!a72'xMM'yMM@@г'$bool'MM'MM@@ @@IA@@@I@LD'MM @@@M@MH'MM @@г'.$bool'MM'MM@@ @@NV@@@@QY@@@?@R\I @@@Z@S_'MM@@@'LL@''LL'MM@  `eq(xs, ys)` return `false` if length is not the same otherwise compare items one by one using `f(xi, yi)`; and return true if all results are true false otherwise ## Examples ```rescript Belt.Array.eq([1, 2, 3], [(-1), (-2), (-3)], (a, b) => abs(a) == abs(b)) == true ``` @ @@ @@@'MM"@t96truncateToLengthUnsafe@'ObOk'ObO@б@г&!t'ObO'ObO@А!ae9V8'''''''''@3@@A'ObO'ObO@@@ @@X 'ObO@@б@г'#int'ObO'ObO@@ @@\@@г'$unit'ObO'ObO@@ @@_&@@@@b)@@@'@c,(ObO @@&lengthBA !  BE&length@@@@@( MM(ObO@((MM(O_Oa@ s Unsafe `truncateToLengthUnsafe(xs, n)` sets length of array `xs` to `n`. If `n` is greater than the length of `xs`; the extra elements are set to `Js.Null_undefined.null`. If `n` is less than zero; raises a `RangeError`. ## Examples ```rescript let arr = ["ant", "bee", "cat", "dog", "elk"] Belt.Array.truncateToLengthUnsafe(arr, 3) arr == ["ant", "bee", "cat"] ``` @ @@ @@@@I:%initU@((OO()OO@б@г'#int(3OO(4OO@@ @@f8(-(-(-(-(-(-(-(-(-@b}5@@A@@б@г' (BOO(COO@б@г(#int(NOO(OOO@@ @@i@@А!a:l$(]OO@@@ @m(@з*Has_arity1&@A@@@@ࠠ @@o@A@@p5,@@0 @@s:(sOO1@@г'8!t({OO(|OO@А!a*I(OO(OO@@@0@@yP(OO@@@@}T@@@Z@~W(OO@@@(OO @@@ @@];$init@(OO(OO@б@г(h#int(OO(OO@@ @@8(((((((((@v@@A@@б@б@г({#int(OO(OO@@ @@@@А!a;(OO(OO@@@ @!@@г'!t(OO(OO@А!a/(OO(OO@@@@@6(OO@@@@:-@@@@@=(OO@@@(OO @@@ @@C<$push@(P?PH(P?PL@б@г'!t)P?PO)P?PP@А!a<8)))))))))@bw$@@A)P?PR)P?PS@@@ @@ )P?PT@@б@А!a)P?PW) P?PX@@г($unit)(P?P]))P?Pa@@ @@@@@'@")1P?PV @@@!@&)5P?PN @@$pushBA  BE$push@@@@@@)>OO)?P?Pj@)E)DOO)EP6P8@ A `arr->push(item)` pushes an element `item` into an array `arr`. @ @@ @@@@C@((@''''\'B&&&&&E&*%ՠ%%f%Q$$$$$Q$<#####a#L#""""T"?!!!y!d      ;&oZW;'K6 aLȠWB̠iTנmX⠠j⠠mXԠcNΠaLŠQ<!    '    -  p j ۠  8 2   ) #;5ᠠ_YWQѠ#s^ʠI4젠b\ @8)))))))))@@@A@@T C/home/runner/work/rescript-compiler/rescript-compiler/linux/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.Belt_internals"-I&others* *