Search results
70 packages found
Generate the sequence of swaps to produce all permutations of a set
Iterators for faster operations such as combinations and permutations
Lists all possible permutations.
Lists all possible permutations.
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.
Builds array from a seed value (dual to foldr).
Binary searches rightmost value in sorted array.
Binary searches closest value in sorted array.
Binary searches leftmost value in sorted array.
Inserts a value to an ordered array.
Inserts a value to an ordered array.
Builds array from a seed value (dual to foldr).