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