The iterable toolbox
Standard iterator utilities.
Fun with Iterables
The iterable toolbox
TypeScript definitions for multimap
Standard math.
Multidimensional arrays.
A streaming data transport format that aims to support built-in features such as Promises, Dates, RegExps, Maps, Sets and more.
Basic operations on iterables
Higher order iterator library for JavaScript/TypeScript.
Core types for paging async iterable iterators
Transforming XML to JSON using Node.js binding to native pugixml parser library
parseArgs tokens compatibility and more high-performance parser
Random numbers.
Return an iterator's length.
Callbag operator that applies a transformation on data passing through it
Applies a callback to each value outputted by an iterable.
This project provides a collection of helper functions for working with asyncronous iterators in TypeScript.
IDEA's utility functions
ASync CLasses + ASync ITerators
No description provided.
htmlparser2 tree adapter for parse5.
A collection of utilities for iterations.
Provide helpers that polyfill all methods defined in [iterator helpers proposal](https://github.com/tc39/proposal-iterator-helpers), both for `Iterator` and `AsyncIterator`, and even more.
A Rust library for iterating over tree structures
tree_iterators_rs is a library built to provide you with the iterators to easily work with tree data structures in Rust.
This gem implements a rooted, ordered tree, with a focus on easy iteration over nodes and access to basic tree properties. Moved to ---> "rooted".
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.
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 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".
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.
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.
No description provided.
No description provided.
No description provided.