compute-issorted
Returns a boolean indicating if an input array is sorted.
Returns a boolean indicating if an input array is sorted.
Array with sorted insertion and optimized search methods.
A weight balanced tree
A sorted immutable list, sorted by a user-supplied comparator
Object.assign with sorted keys
A library with everything you need to set your (searchable data) tables right.
A compact module to randomly sort an Array
Deep sort an object, no matter what the contents are.
Sort array of objects based on priority provided
merges 2 or more sorted arrays efficiently using a priority queue
Intersect sorted lists using merge intersection with galloping lookahead
A simple priority queue built on Redis.
Binary sorted array. Implements array initialization, insertion, finding index of element, item removal, clearing the array.
A JavaScript implementation of Redis Sorted Sets.
Drag and drop tree for ReactJS
Data structures for performance-sensitive modern JavaScript applications.
Simple Promise based multi-channel priority queue using Redis sorted set.
A set that keeps its elements in order
for manipulating streams as sorted sets
ES3-compatible ordered hashmap that supports arbitrary keys.