Burkhard-Keller Tree (BK-Tree) JavaScript implements
Simple, zero dependency, type-safe implementation of a BK-Tree data structure.
As an example, a common strategy for de-duplicating images is to compute perceptual hashes for each of the images and compare those hashes with each other. Such hashes are small compared with the images (often 32, 64, 128 bits). If the hashing function is
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.
A JavaScript implementation of a Burkhard-Keller Tree (BK-Tree)
Array#isArray for older browsers
JSON parse & stringify that supports binary via bops & base64
Run a function exactly one time
CLI arguments parser. Native port of python's argparse.
Get the command from a shebang
ECMAScript AST recursive visitor
Resolve the path of a module like `require.resolve()` but from a given path
Callback wrapping utility
deterministic `JSON.stringify()` - a faster version of substack's json-stable-strigify without jsonify
Light ECMAScript (JavaScript) Value Notation - human written, concise, typed, flexible
Allows users to use generators in order to write common functions that can be both sync or async.
Returns true if a string has an extglob.
The Node.js `util.deprecate()` function with browser support
Buffers events from a stream until you are ready to handle them.
deterministic JSON.stringify() with custom sorting to get deterministic hashes from stringified results, with no public domain dependencies
type-check allows you to check the types of JavaScript values at runtime with a Haskell like type syntax.
Normalize slashes in a file path to be posix/unix-like forward slashes. Also condenses repeat slashes to a single slash and removes and trailing slashes, unless disabled.
A small polyfill for Object.setprototypeof
process.nextTick but always with args