RedBlackTree is a self-balancing binary search tree for ordered key-value mappings.
Type Definition
Constructors
empty
Creates an emptyRedBlackTree.
make
Creates aRedBlackTree with the given ordering.
Learn more about Mintlify
Enter your email to receive updates about new features and product releases.
API reference for the RedBlackTree ordered map type
RedBlackTree is a self-balancing binary search tree for ordered key-value mappings.
interface RedBlackTree<K, V> extends Iterable<[K, V]>
RedBlackTree.
const empty: <K, V>(ord: Order<K>) => RedBlackTree<K, V>
RedBlackTree with the given ordering.
const make: <K>(ord: Order<K>) => <Entries extends ReadonlyArray<readonly [K, any]>>(...entries: Entries) => RedBlackTree<K, Entries[number][1]>
const insert: <K, V>(key: K, value: V) => (self: RedBlackTree<K, V>) => RedBlackTree<K, V>
const getOption: <K>(key: K) => <V>(self: RedBlackTree<K, V>) => Option<V>
const removeFirst: <K, V>(self: RedBlackTree<K, V>) => RedBlackTree<K, V>
import { RedBlackTree, Order } from "effect"
const tree = RedBlackTree.make(Order.number)([1, "a"], [2, "b"]).pipe(
RedBlackTree.insert(3, "c")
)
console.log(RedBlackTree.getOption(tree, 2)) // Some("b")