Skip to main content

class SortedSetLeaf<T>

undocumented

Extends: SortedSetNode<T>

Type parameters​

NameDescription
Tundocumented

Properties​

_NonEmptyType​

undocumented

Definition​

_NonEmptyType: SortedSetNode<T>;

Overrides​

SortedSetNode._NonEmptyType

context​

undocumented

Definition​

readonly context: SortedSetContext<T>;

Overrides​

SortedSetNode.context

entries​

undocumented

Definition​

entries: readonly T[];

size​

undocumented

Definition​

get size(): number;

Overrides​

SortedSetNode.size

Methods​

add​

undocumented

Definition​

add(value: T): SortedSet.NonEmpty<T>;

Parameters​

NameTypeDescription
valueT

Overrides​

SortedSetNode.add

addAll​

undocumented

Definition​

addAll(values: StreamSource<T>): SortedSet.NonEmpty<T>;

Parameters​

NameTypeDescription
valuesStreamSource<T>

Overrides​

SortedSetNode.addAll

addInternal​

undocumented

Definition​

addInternal(value: T): SortedSetNode<T>;

Parameters​

NameTypeDescription
valueT

Overrides​

SortedSetNode.addInternal

asNormal​

undocumented

Definition​

asNormal(): this;

Overrides​

SortedSetNode.asNormal

copy​

undocumented

Definition​

copy(entries: readonly T[]): SortedSetLeaf<T>;

Parameters​

NameTypeDescription
entriesreadonly T[]

deleteMax​

undocumented

Definition​

deleteMax(): [T, SortedSetLeaf<T>];

deleteMin​

undocumented

Definition​

deleteMin(): [T, SortedSetLeaf<T>];

difference​

undocumented

Definition​

difference(other: StreamSource<T>): SortedSet<T>;

Parameters​

NameTypeDescription
otherStreamSource<T>

Overrides​

SortedSetNode.difference

drop​

undocumented

Definition​

drop(amount: number): SortedSet<T>;

Parameters​

NameTypeDescription
amountnumber

Overrides​

SortedSetNode.drop

dropInternal​

undocumented

Definition​

dropInternal(amount: number): SortedSetLeaf<T>;

Parameters​

NameTypeDescription
amountnumber

filter​

undocumented

Definition​

filter(pred: (value: T, index: number, halt: () => void) => boolean, options?: {
    negate?: boolean | undefined;
  }): any;

Parameters​

NameTypeDescription
pred(value: T, index: number, halt: () => void) => boolean
options{
    negate?: boolean | undefined;
  }

Overrides​

SortedSetNode.filter

findIndex​

undocumented

Definition​

findIndex(value: T): number;

Parameters​

NameTypeDescription
valueT

Overrides​

SortedSetNode.findIndex

forEach​

undocumented

Definition​

forEach(f: (value: T, index: number, halt: () => void) => void, options?: {
    state?: TraverseState;
  }): void;

Parameters​

NameTypeDescription
f(value: T, index: number, halt: () => void) => void
options{
    state?: TraverseState;
  }

Overrides​

SortedSetNode.forEach

getAtIndex​

undocumented

Definition​

getAtIndex<O>(index: number, otherwise?: OptLazy<O>): T | O;

Type parameters​

NameDescription
O

Parameters​

NameTypeDescription
indexnumber
otherwiseOptLazy<O>

getInsertIndexOf​

undocumented

Definition​

getInsertIndexOf(value: T): number;

Parameters​

NameTypeDescription
valueT

Overrides​

SortedSetNode.getInsertIndexOf

getSliceRange​

undocumented

Definition​

getSliceRange(range: Range<T>): {
    startIndex: number;
    endIndex: number;
  };

Parameters​

NameTypeDescription
rangeRange<T>

Overrides​

SortedSetNode.getSliceRange

has​

undocumented

Definition​

has<U>(value: RelatedTo<T, U>): boolean;

Type parameters​

NameDescription
U

Parameters​

NameTypeDescription
valueRelatedTo<T, U>

Overrides​

SortedSetNode.has

intersect​

undocumented

Definition​

intersect(other: StreamSource<T>): SortedSet<T>;

Parameters​

NameTypeDescription
otherStreamSource<T>

Overrides​

SortedSetNode.intersect

max​

undocumented

Definition​

max(): T;

Overrides​

SortedSetNode.max

min​

undocumented

Definition​

min(): T;

Overrides​

SortedSetNode.min

mutateGetFromLeft​

undocumented

Definition​

mutateGetFromLeft(left: SortedSetLeaf<T>, toMe: T): [T, SortedSetLeaf<T>];

Parameters​

NameTypeDescription
leftSortedSetLeaf<T>
toMeT

mutateGetFromRight​

undocumented

Definition​

mutateGetFromRight(right: SortedSetLeaf<T>, toMe: T): [T, SortedSetLeaf<T>];

Parameters​

NameTypeDescription
rightSortedSetLeaf<T>
toMeT

mutateGiveToLeft​

undocumented

Definition​

mutateGiveToLeft(left: SortedSetLeaf<T>, toLeft: T): [T, SortedSetLeaf<T>];

Parameters​

NameTypeDescription
leftSortedSetLeaf<T>
toLeftT

mutateGiveToRight​

undocumented

Definition​

mutateGiveToRight(right: SortedSetLeaf<T>, toRight: T): [T, SortedSetLeaf<T>];

Parameters​

NameTypeDescription
rightSortedSetLeaf<T>
toRightT

mutateJoinLeft​

undocumented

Definition​

mutateJoinLeft(left: SortedSetLeaf<T>, entry: T): void;

Parameters​

NameTypeDescription
leftSortedSetLeaf<T>
entryT

mutateJoinRight​

undocumented

Definition​

mutateJoinRight(right: SortedSetLeaf<T>, entry: T): void;

Parameters​

NameTypeDescription
rightSortedSetLeaf<T>
entryT

mutateSplitRight​

undocumented

Definition​

mutateSplitRight(index?: number): [T, SortedSetLeaf<T>];

Parameters​

NameTypeDescription
indexnumber

normalize​

undocumented

Definition​

normalize(): SortedSet<T>;

Overrides​

SortedSetNode.normalize

remove​

undocumented

Definition​

remove<U>(value: RelatedTo<T, U>): SortedSet<T>;

Type parameters​

NameDescription
U

Parameters​

NameTypeDescription
valueRelatedTo<T, U>

Overrides​

SortedSetNode.remove

removeAll​

undocumented

Definition​

removeAll<U>(values: StreamSource<RelatedTo<T, U>>): SortedSet<T>;

Type parameters​

NameDescription
U

Parameters​

NameTypeDescription
valuesStreamSource<RelatedTo<T, U>>

Overrides​

SortedSetNode.removeAll

removeInternal​

undocumented

Definition​

removeInternal(value: T): SortedSetNode<T>;

Parameters​

NameTypeDescription
valueT

Overrides​

SortedSetNode.removeInternal

slice​

undocumented

Definition​

slice(range: Range<T>): SortedSet<T>;

Parameters​

NameTypeDescription
rangeRange<T>

Overrides​

SortedSetNode.slice

sliceIndex​

undocumented

Definition​

sliceIndex(range: IndexRange): SortedSet<T>;

Parameters​

NameTypeDescription
rangeIndexRange

Overrides​

SortedSetNode.sliceIndex

stream​

undocumented

Definition​

stream(options?: {
    reversed?: boolean;
  }): Stream.NonEmpty<T>;

Parameters​

NameTypeDescription
options{
    reversed?: boolean;
  }

Overrides​

SortedSetNode.stream

streamRange​

undocumented

Definition​

streamRange(range: Range<T>, options?: {
    reversed?: boolean;
  }): Stream<T>;

Parameters​

NameTypeDescription
rangeRange<T>
options{
    reversed?: boolean;
  }

Overrides​

SortedSetNode.streamRange

streamSliceIndex​

undocumented

Definition​

streamSliceIndex(range: IndexRange, options?: {
    reversed?: boolean;
  }): Stream<T>;

Parameters​

NameTypeDescription
rangeIndexRange
options{
    reversed?: boolean;
  }

Overrides​

SortedSetNode.streamSliceIndex

symDifference​

undocumented

Definition​

symDifference(other: StreamSource<T>): SortedSet<T>;

Parameters​

NameTypeDescription
otherStreamSource<T>

Overrides​

SortedSetNode.symDifference

take​

undocumented

Definition​

take(amount: number): SortedSet<T> | any;

Parameters​

NameTypeDescription
amountnumber

Overrides​

SortedSetNode.take

takeInternal​

undocumented

Definition​

takeInternal(amount: number): SortedSetLeaf<T>;

Parameters​

NameTypeDescription
amountnumber

toArray​

undocumented

Definition​

toArray(): ArrayNonEmpty<T>;

Overrides​

SortedSetNode.toArray

toBuilder​

undocumented

Definition​

toBuilder(): SortedSet.Builder<T>;

Overrides​

SortedSetNode.toBuilder

toJSON​

undocumented

Definition​

toJSON(): ToJSON<T[]>;

Overrides​

SortedSetNode.toJSON

toString​

undocumented

Definition​

toString(): string;

Overrides​

SortedSetNode.toString

union​

undocumented

Definition​

union(other: StreamSource<T>): SortedSet<T> | any;

Parameters​

NameTypeDescription
otherStreamSource<T>

Overrides​

SortedSetNode.union