Iterator for walking trees
An ESnext spec-compliant iterator helpers shim/polyfill/replacement that works as far down as ES3.
Firefox 17-26 iterators throw a StopIteration object to indicate "done". This normalizes it.
Get an iterator for any JS language value. Works robustly across all environments, all versions.
Higher order iterator library for JavaScript/TypeScript.
Iterator abstraction based on ES6 specification
Run multiple promise-returning & async functions with limited concurrency using native ES9
Iterate any JS iterator. Works robustly in all environments, all versions.
Convert an argument into a valid iterator. Based on the `.makeIterator()` implementation in mout https://github.com/mout/mout.
Iterate over promises serially
Creates an async iterator for a variety of inputs in the browser and node. Supports fetch, node-fetch, and cross-fetch
Turn an abstract-leveldown iterator into a readable stream
[](http://www.typescriptlang.org/) [](https://www.npmjs.com/package/@n1ru4l/push-pull-async
Framework-independent loaders for 3D graphics formats
A finite state machine iterator for JavaScript
Simple iterator for flat and multi section lists
Asynchronous flow control with a functional taste to it
Get the default iterator or async iterator for an iterable or async iterable
Symbol.
async.mapLimit's functionality available as a standalone npm module
iterator for mini-html-parser
Async iterator utilities for Metorial. Provides programmable async iterators for creating controlled data streams and managing async iteration flow.
Iterator library for JavaScript and TypeScript
A polymorphic iterate operator for arrays and other iterables
This gem implements a rooted, ordered tree, with a focus on easy iteration over nodes and access to basic tree properties. Moved to ---> "rooted".
RubyTree is a Ruby implementation of the generic tree data structure. It provides simple APIs to store named nodes, and to access, modify, and traverse the tree. The data model is node-centric, where nodes in the tree are the primary structural elements. It supports all common tree-traversal methods (pre-order, post-order, and breadth first). RubyTree mixes in the Enumerable and Comparable modules and behaves like a standard Ruby collection (iteration, comparison, etc.). RubyTree also includes a binary tree implementation, which provides in-order node traversal besides the other methods. RubyTree can import from and export to JSON, and supports Ruby’s object marshaling.
This module implements ordered n-ary branching tree structures. It includes support for breadth- and depth- first iteration, and serialization to and from a bracketed tree string.
Interactively manage chains or trees of dependent git branches. Merge or rebase to iteratively incorporate new changes from upstream or intermediate modifications. View your current place within the tree.
This gem implements a rooted, ordered tree, with a focus on easy iteration over nodes and access to basic tree properties. Formerly known as "rooted_tree".
lithos is a self-contained embedded key-value store written from scratch as a native extension — no external database dependency. It uses a log-structured merge (LSM) tree: a write-ahead log makes every write durable, an in-memory sorted memtable flushes to immutable SSTables (with bloom filters), and compaction merges them. Keys and values are arbitrary binary strings; keys are kept in sorted order so you get ordered iteration and range scans, plus crash recovery via WAL replay. Windows MSVC (mswin) Ruby only.
No description provided.
No description provided.
No description provided.
No description provided.