Search results
70 packages found
A library of historical permutation algorithms from 1950s-present implemented in JavaScript.
- historical
- permutations
- combinatorics
- Gysin
- Tompkins
- Paige
- Lehmer
- Walker
- Hall
- Coveyou
- Sullivan
- Wells
- Peck
- Heap
- View more
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.
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).
Inserts a value to an ordered array.
Inserts a value to an ordered array.
Inserts a value to an ordered array.