Main sorting functions plus some extras
Maintain and search through a sorted array using some low level functions
A skip list implementation inspired by the Sorted Set in Redis.
Stringify Object as tree structure
Utilities for GraphQL documents.
Returns a copy of an object with its keys sorted
Alternative JSON.stringify function with sorted keys, so the output is stable.
Get the union of two sorted streams
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()
Sort an Object or package.json based on the well-known package.json keys
A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.
prelude.ls is a functionally oriented utility library. It is powerful and flexible. Almost all of its functions are curried. It is written in, and is the recommended base library for, LiveScript.
Stringify an object sorting scalars before objects, and defaulting to 2-space indent
Inspired by chai sorted and jest-extended. This packages extends jest.expect with 2 custom matchers, `toBeSorted` and `toBeSortedBy`
Tiny JavaScript tokenizer.
Test if two floats are almost equal
Check if an Array is sorted
Prettier formatter for package.json files
Takes a json-file and return a copy of the same file, but sorted
Push items to an array at their correct sort-position
Fast JavaScript array sorting by implementing Python's Timsort algorithm
An html attribute sorter
High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)
TypeScript definitions for sorted-array-functions
Fast adaptive sorting for when most of your data is already in order. dmsort can be 2-5 times faster than Rust's default sort when more than 80% of the elements are already in order.
Adaptive hybrid sort for integer-like keys: parallel counting on dense ranges with pattern-aware fallback paths.
Rust implementation of the modified MergeSort used in Python and Java
A RBTree is a sorted associative collection that is implemented with a Red-Black Tree. It maps keys to values like a Hash, but maintains its elements in ascending key order. The interface is the almost identical to that of Hash.
A RBTree is a sorted associative collection that is implemented with a Red-Black Tree. It maps keys to values like a Hash, but maintains its elements in ascending key order. The interface is the almost identical to that of Hash. This is a fork of the original gem that fixes various bugs on Ruby 2.3+.
RBTree is a sorted associative collection that is implemented with Red-Black Tree. The elements of RBTree are ordered and its interface is the almost same as Hash, so simply you can consider RBTree sorted Hash.