Binary sorted array. Implements array initialization, insertion, finding index of element, item removal, clearing the array.
Maintain and search through a sorted array using some low level functions
Push items to an array at their correct sort-position
Fast JavaScript array sorting by implementing Python's Timsort algorithm
Binary serialization which sorts bytewise for arbirarily complex data structures
High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)
Conversion of JavaScript primitives to and from Buffer with binary order matching natural primitive order
The smallest and simplest JavaScript priority queue
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
Check if an Array is sorted
Better binary searching
A skip list implementation inspired by the Sorted Set in Redis.
A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.
Binary Search Trees
Truncate a semver version: `1.2.3` → `1.2.0`
Node addon for string extraction for msgpackr
Get the union of two sorted streams
Framework-independent loaders for 3D graphics formats
Base64 encoding/decoding in pure JS
TypeScript definitions for sorted-array-functions
JavaScript date/time utilities for Vega.
Chai JS Plugin for testing if an array has sorted values (strings, numbers, booleans). Very helpful when writing tests for features that implement Array.prototype.sort()
Stringify an object sorting scalars before objects, and defaulting to 2-space indent
Better binary searching
Sorted array using binary search
Pure ruby implementation of binary search for Ruby arrays and similiar data structures. Supports ascending and descending sort order, searching for exact and nearest matches, and has a versatile API. Uses linear search for small arrays to make use of the internal cache of moden CPUs.
No description provided.
No description provided.