Search results
28 packages found
An array is a collection of values, stored contiguously.
An array is a collection of values, stored contiguously {web}.
A sorted array is a collection of values, arranged in an order.
A sorted array is a collection of values, arranged in an order {web}.
Lists all possible infixes.
Lists all possible infixes.
Returns evenly spaced values within given interval.
- extra
- array
- bsearch
- bsearchAny
- bsearchClosest
- bsearchRight
- chunk
- compare
- concat$
- copy$
- copy
- copyWithin
- count
- countAllOn
- View more
Counts occurrences of values.
- extra
- array
- bsearch
- bsearchAny
- bsearchClosest
- bsearchRight
- chunk
- compare
- concat$
- copy$
- copy
- copyWithin
- count
- countAllOn
- View more
Flattens nested array to given depth.
- extra
- array
- bsearch
- bsearchAny
- bsearchClosest
- bsearchRight
- chunk
- compare
- concat$
- copy$
- copy
- copyWithin
- count
- countAllOn
- View more
Counts occurrences of values.
- extra
- array
- bsearch
- bsearchAny
- bsearchClosest
- bsearchRight
- chunk
- compare
- concat$
- copy$
- copy
- copyWithin
- count
- countAllOn
- View more
Returns evenly spaced values within given interval.
- extra
- array
- bsearch
- bsearchAny
- bsearchClosest
- bsearchRight
- chunk
- compare
- concat$
- copy$
- copy
- copyWithin
- count
- countAllOn
- View more
Flattens nested array to given depth.
- extra
- array
- bsearch
- bsearchAny
- bsearchClosest
- bsearchRight
- chunk
- compare
- concat$
- copy$
- copy
- copyWithin
- count
- countAllOn
- View more
Binary searches leftmost value in sorted array.
Binary searches closest value in sorted array.
Binary searches rightmost value in sorted array.
Binary searches rightmost value in sorted array.
Binary searches closest value in sorted array.
Binary searches leftmost value in sorted array.
Builds array from a seed value (dual to foldr).
Builds array from a seed value (dual to foldr).