website·Indexed 32 days ago
https://rimbu.orgA library providing immutable collections and functional programming utilities for TypeScript. Features include immutable List, Set, Map, BiMap, MultiMap, and Table, as well as Stream and AsyncStream implementations, Graph structures (EdgeGraph and ArrowGraph), and a Task API for managing asynchronous operations with support for timeouts and retries.
ArrowGraphHashed namespace provides a type-invariant immutable directed (arrow) graph. It uses hashed collections internally to maintain connections. The primary interface for this collection is ArrowGraphHashed<N>.HashMap namespace provides a type-invariant immutable Map of key type K and value type V. In this Map, each key is unique and maps to exactly one value. It serves as the primary entry point for creating HashMap instances and managing their configuration via contexts.BiMap<K,V> is an immutable bi-directional map where keys and values have a one-to-one mapping. It is type-invariant and extends FastIterable<T>. It is primarily implemented by BiMap.NonEmpty<K,V>.const b1 = BiMap.empty<number, string>();
const b2 = BiMap.of([1, 'a'], [2, 'b']);@rimbu/core package. Graphs are categorized by whether they are directed or undirected, and whether their edges carry values.| Edge property | Non-valued | Valued |
|---|---|---|
| Directed | ArrowGraph<N> | ArrowValuedGraph<N, V> |
| Undirected | EdgeGraph<N> | EdgeValuedGraph<N, V> |
The @rimbu/multiset package provides various immutable MultiSet implementations where each value can occur multiple times. Available implementations include:
MultiSet<T>: The base type-invariant immutable MultiSet.HashMultiSet<T>: A type-invariant immutable MultiSet implementation based on hashing.SortedMultiSet<T>: A type-invariant immutable MultiSet that maintains elements in a sorted order.VariantMultiSet<T>: A type-variant immutable MultiSet implementation.OrderedHashMap namespace provides a type-invariant immutable Ordered HashMap of key type K and value type V. In this collection, each key has exactly one value, and duplicate keys are not permitted.ArrowGraphSorted<N> interface.SortedSet.Builder<T> is a mutable builder used to efficiently construct new immutable SortedSet instances. It allows for modifications before finalizing the set into an immutable version.The EdgeValuedGraph namespace provides a type-invariant immutable valued edge (undirected) graph implementation. It includes several key interfaces for graph construction and management:
EdgeValuedGraph.Builder<N,V>: A mutable builder used to efficiently create new immutable graph instances.EdgeValuedGraph.Context<UN>: A factory instance used to create related immutable instances and builders.EdgeValuedGraph.NonEmpty<N,V>: A specialized version of the graph that is guaranteed to be non-empty.EdgeValuedGraph.Types: A utility interface providing higher-kinded types for the collection.@rimbu/sorted/map-custom package provides creators, builders, contexts, and internal implementations for SortedMap. It is designed for scenarios requiring fine-grained control over sorted map internals, such as custom comparators and tree parameters. For standard ordered map usage, the primary @rimbu/sorted and @rimbu/sorted/map APIs are recommended instead.@rimbu/channel package provides various channel implementations inspired by Go. It enables the exchange of synchronous messages within an asynchronous context, allowing processes to communicate and synchronize their execution.