A simple, easy to use implementation of the Okapi BM25 algorithm.
A highly efficient sorting algorithm that reaches your fallen wallet faster than a romanian!
Sorting the keys of an object
Stringify Object as tree structure
A collection of order related linting rules for Stylelint.
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.
PostCSS plugin for sorting and combining CSS media queries with mobile first / **desktop first methodologies
Binary serialization which sorts bytewise for arbirarily complex data structures
Detect the indentation of code
Sniff the encoding from a HTML byte stream
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
HFS Plus string utilities
Simple “Least Recently Used” (LRU) cache
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorti
ESLint plugin for sorting various data such as objects, imports, types, enums, JSX props, etc.
The lightest signal library.
The fCoSE layout for Cytoscape.js by Bilkent with fast compound node placement
Parse a JSON string that has git merge conflicts, resolving if possible
An implementation of the Unicode Line Breaking Algorithm (UAX #14)
Easy autofixable import sorting
A package for various sorting algorithms
Hashing made simple. Get the hash of a buffer/string/stream/file.