Lazy Range function for JS. Exposes forEach forEachAsync and toArray.
A lazy range and list library for JavaScript.
Simple Lazy Ranges for Node/Javascript
Immutable Data Collections
Define a lazily evaluated property on an object
Takes a string, such as "1,2,3-10,5-8" and turns it into an array of numbers
Fill in a range of numbers or letters, optionally passing an increment or `step` to use, or create a regex-compatible range with `options.toRegex`
Range header field string parser
Lazy assertions without performance penalty
Pass two numbers, get a regex-compatible source string for matching ranges. Validated against more than 2.78 million test assertions.
TypeScript definitions for range-parser
Utility for normalizing a numeric range, with a wrapping function useful for polar coordinates
Cache requires to be lazy-loaded when needed.
Lazy range iterator for JavaScript, with a lazy version of map and other functional tools
Lazy value.
No description provided.
Import a module lazily
Range data type parser and serializer for PostgreSQL
Common get-version-range-type shared between changeset packages
Lazy lists for node
Find the greatest satisfied semver range from an array of ranges.
React Component to lazy load images using a HOC to track window scroll position.
for adding, subtracting, and indexing discontinuous ranges of numbers
This library creates a new Response, given a source Response and a Range header value.
Parse Excel spreadsheets with a simple API. Read cell values, formulas, styles, comments, data validations, named ranges, and merged cells from xlsx and xlsm files. Supports streaming from strings and IO objects with lazy row loading for large files.
Rangeable is a language-neutral, generic, integer-coordinate closed-interval set container. It pairs hashable elements with their merged disjoint integer ranges and answers three queries: by-element ranges, by-position active set, and by-range transition events. The Ruby reference implementation follows the Rangeable RFC normatively, including idempotent containment fast-path, lazy boundary-event indexing, and first-insert deterministic ordering.
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.
No description provided.
No description provided.