Shift | npm.io

es6 Set prototype extended to include: .pop & .shift methods

0.0.5 • Published 5 years ago

Returns evenly spaced values within given interval.

extra array bsearch bsearchAny bsearchClosest bsearchRight chunk compare concat$copy$

2.3.18 • Published 4 years ago

Returns evenly spaced values within given interval.

extra array bsearch bsearchAny bsearchClosest bsearchRight chunk compare concat$copy$

2.3.18 • Published 4 years ago

Counts occurrences of values.

extra array bsearch bsearchAny bsearchClosest bsearchRight chunk compare concat$copy$

2.4.37 • Published 4 years ago

Counts occurrences of values.

extra array bsearch bsearchAny bsearchClosest bsearchRight chunk compare concat$copy$

2.4.37 • Published 4 years ago

Removes first entry.

extra shift update shift$

2.2.15 • Published 3 years ago

Removes first entry.

2.2.15 • Published 3 years ago

Flattens nested array to given depth.

extra array bsearch bsearchAny bsearchClosest bsearchRight chunk compare concat$copy$

2.3.10 • Published 4 years ago

Flattens nested array to given depth.

extra array bsearch bsearchAny bsearchClosest bsearchRight chunk compare concat$copy$

2.3.10 • Published 4 years ago

An object is a collection of properties, with associated values.

extra object cartesianProduct chunk compare concat count countAs difference drop

2.2.5 • Published 3 years ago

Train a fast (FIFO) queue with a rollback mechanism. Behind the scenes it uses 2 arrays to simulate and perform fast shifting and popping operations without using the Array#shift() method..

queue rollback rollup get indexOf pop shift slice push concat

4.4.1 • Published 6 years ago

Removes first entry.

2.2.15 • Published 3 years ago

utility for adjusting color values

color shift change css

2.0.0 • Published 4 years ago

Immutable versions of normally mutable array methods

immutable array methods push pop delete unshift shift splice reverse

4.1.0 • Published 3 years ago

Binary searches closest value in sorted array.

extra array is head tail init last get set swap

2.1.75 • Published 4 years ago

Binary searches rightmost value in sorted array.

extra array is head tail init last get set swap

2.1.75 • Published 4 years ago

Binary searches leftmost value in sorted array.

extra array is head tail init last get set swap

2.1.75 • Published 4 years ago

Binary searches rightmost value in sorted array.

extra array is head tail init last get set swap

2.1.75 • Published 4 years ago

Binary searches closest value in sorted array.

extra array is head tail init last get set swap

2.1.75 • Published 4 years ago

Binary searches leftmost value in sorted array.

extra array is head tail init last get set swap

2.1.75 • Published 4 years ago