Algorithms and data structures for your JavaScript and TypeScript projects 🧑💻
Detect the indentation of code
Simple “Least Recently Used” (LRU) cache
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
Helper function to build binary assignment operator visitors
Collection of cross-platform routines to operate effectively sorted arrays. For that ArraySorted provides customizable quicksort algorithm and a dozen functions to optimally find/add/remove single/multiple elements into a sorted array, add/remove sorted a
The lightest signal library.
Fast static spatial index for rectangles
Finds project root
A library for approximate string matching.
A pure JavaScript implementation of the AES block cipher and all common modes of operation.
An implementation of the Unicode Line Breaking Algorithm (UAX #14)
Pure-JS ADLER-32
Parse a JSON string that has git merge conflicts, resolving if possible
The fCoSE layout for Cytoscape.js by Bilkent with fast compound node placement
Array / Arraylike utilities
Unicode Trie data structure for fast character metadata lookup, ported from ICU
Better binary searching
The linux x64 distribution of the Sentry CLI binary.
Hashing made simple. Get the hash of a buffer/string/stream/file.
Configurable BM25 Text Search Engine with simple semantic search support
A JS library for finding optimal label position inside a polygon
A highly efficient, isomorphic, full-featured, multilingual text search engine library, providing full-text search, fuzzy matching, phonetic scoring, document indexing and more, with micro JSON state hydration/dehydration in-browser and server-side.