Logarithms of any base using the change of base principle
No description provided.
Fast Splay tree for Node and browser
Trie Data Structure to support cspell.
Delete files and directories
Streaming Boyer-Moore-Horspool searching for node.js
Fast base encoding / decoding of any given alphabet
WHATWG URL implementation for JavaScript
Basic object cache with `get`, `set`, `del`, and `has` methods for node.js/javascript projects.
Tiny queue data structure
Pure-JS printf
Converts RDF/JS Terms, Quads and Datasets to N-Triple strings
Operating system utilities for Bare
Arbitrary base-n conversions w/ presets for base8/16/32/36/58/62/64/83/85, support for bigints and encoding/decoding of byte arrays
Hex string formatters for 4/8/16/24/32/48/64bit words, hexdump formatting of binary data
Get XDG Base Directory paths
A logger package for use in the Firebase JS SDK
Edit a string with the users preferred text editor using $VISUAL or $ENVIRONMENT
Round a double-precision floating-point number to the nearest multiple of 10^n.
Replace extraneous newlines with a single newline, or pass a specified number of newlines to use.
Schemas describing various structures used by nyc and istanbuljs
Fast and easy-to-use dynamic C FFI (foreign function interface) for Node.js
Trim newlines from the start and/or end of a string
Copy values from x into y.
A binary heap-based priority queue supporting min-heap, max-heap, and custom comparator modes. Features O(log n) push/pop, priority changes, merge operations, and FIFO tie-breaking.
Simple gem for regular progress logging in a long-running loop, log every N actions, or based on a time interval
The Lorax is a full diff and patch library for XML/HTML documents, based on Nokogiri. It can tell you whether two XML/HTML documents are identical, or if they're not, tell you what's different. In trivial cases, it can even apply the patch. It's based loosely on Gregory Cobena's master's thesis paper, which generates deltas in less than O(n * log n) time, accepting some tradeoffs in the size of the delta set. You can find his paper at http://gregory.cobena.free.fr/www/Publications/thesis.html. "I am the Lorax, I speak for the trees."
A high-performance pure Ruby Red-Black Tree implementation. Features: O(1) key lookup via hybrid hash index, O(log n) insert/delete, lazy Enumerator-based range queries (lt/gt/between), nearest/prev/succ search, memory-efficient node pooling, and MultiRBTree for duplicate keys with first/last value access.
Contentful API wrapper library exposing an ActiveRecord-like interface
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.