import { SortedSetLeaf } from "https://deno.land/x/rimbu@1.0.4/sorted/set-custom/implementation/immutable.ts";
Constructors
new
SortedSetLeaf(context: SortedSetContext<T>, entries: readonly T[])Methods
addInternal(value: T): SortedSetNode<T>
copy(entries: readonly T[]): SortedSetLeaf<T>
deleteMax(): [T, SortedSetLeaf<T>]
deleteMin(): [T, SortedSetLeaf<T>]
dropInternal(amount: number): SortedSetLeaf<T>
forEach(f: () => void, state?: TraverseState): void
getAtIndex<O>(index: number, otherwise?: OptLazy<O>): T | O
getInsertIndexOf(value: T): number
mutateGetFromLeft(left: SortedSetLeaf<T>, toMe: T): [T, SortedSetLeaf<T>]
mutateGetFromRight(right: SortedSetLeaf<T>, toMe: T): [T, SortedSetLeaf<T>]
mutateGiveToLeft(left: SortedSetLeaf<T>, toLeft: T): [T, SortedSetLeaf<T>]
mutateGiveToRight(right: SortedSetLeaf<T>, toRight: T): [T, SortedSetLeaf<T>]
mutateJoinLeft(left: SortedSetLeaf<T>, entry: T): void
mutateJoinRight(right: SortedSetLeaf<T>, entry: T): void
mutateSplitRight(index?: number): [T, SortedSetLeaf<T>]
removeInternal(value: T): SortedSetNode<T>
streamSliceIndex(range: IndexRange, reversed?): Stream<T>
takeInternal(amount: number): SortedSetLeaf<T>
toArray(): ArrayNonEmpty<T>