Search results
98 packages found
Using only idiomatic RxJS code, one would use `filter` instead for the use case of `splice`. However, if you are writing high performance code and this `input$` Observable above (or more likely, Subject) would be subscribed hunderths or thousands of times
Array splice to mutate DOM nodes
Removes or replaces existing values.
Removes or replaces existing values.
Removes or replaces existing values.
Removes or replaces existing values.
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 closest value in sorted array.
Binary searches leftmost value in sorted array.
Binary searches rightmost value in sorted array.
Binary searches closest value in sorted array.
Builds array from a seed value (dual to foldr).
Binary searches rightmost value in sorted array.
Binary searches leftmost value in sorted array.
Inserts a value to an ordered array.