Options
All
  • Public
  • Public/Protected
  • All
Menu

Class BTreePage<K, V, U>

Type parameters

  • K

  • V

  • U

Hierarchy

Index

Constructors

Properties

Methods

Constructors

constructor

  • new BTreePage<K, V, U>(): BTreePage<K, V, U>

  • Type parameters

    • K

    • V

    • U

    Returns BTreePage<K, V, U>

Properties

Readonly Abstract arity

arity: number

Readonly Abstract fold

fold: undefined | U

Readonly Abstract size

size: number

Methods

Abstract balanced

  • Parameters

    Returns BTreePage<K, V, U>

Abstract drop

  • Parameters

    Returns BTreePage<K, V, U>

Abstract entries

  • Returns Cursor<[K, V]>

Abstract firstEntry

  • firstEntry(): undefined | [K, V]

  • Returns undefined | [K, V]

Abstract forEach

  • forEach<T, S>(callback: (key: K, value: V) => void | T, thisArg: S): undefined | T

  • Type parameters

    • T

    • S

    Parameters

    • callback: (key: K, value: V) => void | T
        • (key: K, value: V): void | T

        • Parameters

          • key: K
          • value: V

          Returns void | T

    • thisArg: S

    Returns undefined | T

Abstract forEachKey

  • forEachKey<T, S>(callback: (key: K) => void | T, thisArg: S): undefined | T

  • Type parameters

    • T

    • S

    Parameters

    • callback: (key: K) => void | T
        • (key: K): void | T

        • Parameters

          • key: K

          Returns void | T

    • thisArg: S

    Returns undefined | T

Abstract forEachValue

  • forEachValue<T, S>(callback: (value: V) => void | T, thisArg: S): undefined | T

  • Type parameters

    • T

    • S

    Parameters

    • callback: (value: V) => void | T
        • (value: V): void | T

        • Parameters

          • value: V

          Returns void | T

    • thisArg: S

    Returns undefined | T

Abstract get

  • Parameters

    Returns undefined | V

Abstract getEntry

  • getEntry(index: number): undefined | [K, V]

  • Parameters

    • index: number

    Returns undefined | [K, V]

Abstract has

  • Parameters

    Returns boolean

Abstract isEmpty

  • isEmpty(): boolean

  • Returns boolean

keys

  • Returns Cursor<K>

Abstract lastEntry

  • lastEntry(): undefined | [K, V]

  • Returns undefined | [K, V]

Abstract maxKey

  • maxKey(): K

  • Returns K

Abstract minKey

  • minKey(): K

  • Returns K

Abstract nextEntry

  • nextEntry(key: K, tree: BTreeContext<K, V>): undefined | [K, V]

  • Parameters

    Returns undefined | [K, V]

Abstract previousEntry

  • previousEntry(key: K, tree: BTreeContext<K, V>): undefined | [K, V]

  • Parameters

    Returns undefined | [K, V]

Abstract reduced

  • reduced(identity: U, accumulator: (result: U, element: V) => U, combiner: (result: U, result2: U) => U): BTreePage<K, V, U>

  • Parameters

    • identity: U
    • accumulator: (result: U, element: V) => U
        • (result: U, element: V): U

        • Parameters

          • result: U
          • element: V

          Returns U

    • combiner: (result: U, result2: U) => U
        • (result: U, result2: U): U

        • Parameters

          • result: U
          • result2: U

          Returns U

    Returns BTreePage<K, V, U>

Abstract removed

  • Parameters

    Returns BTreePage<K, V, U>

Abstract reverseEntries

  • reverseEntries(): Cursor<[K, V]>

  • Returns Cursor<[K, V]>

reverseKeys

  • Returns Cursor<K>

reverseValues

  • Returns Cursor<V>

Abstract split

  • Parameters

    • index: number

    Returns BTreePage<K, V, U>

Abstract splitLeft

  • splitLeft(index: number): BTreePage<K, V, U>

  • Parameters

    • index: number

    Returns BTreePage<K, V, U>

Abstract splitRight

  • splitRight(index: number): BTreePage<K, V, U>

  • Parameters

    • index: number

    Returns BTreePage<K, V, U>

Abstract take

  • Parameters

    Returns BTreePage<K, V, U>

Abstract updated

  • Parameters

    Returns BTreePage<K, V, U>

values

  • Returns Cursor<V>

Static empty

  • Type parameters

    • K

    • V

    • U

    Returns BTreeLeaf<K, V, U>

Generated using TypeDoc