Options
All
  • Public
  • Public/Protected
  • All
Menu

Class BTreeNode<K, V, U>

Type parameters

  • K

  • V

  • U

Hierarchy

Index

Constructors

constructor

  • new BTreeNode<K, V, U>(pages: readonly BTreePage<K, V, U>[], knots: readonly K[], fold: undefined | U, size: number): BTreeNode<K, V, U>
  • Type parameters

    • K

    • V

    • U

    Parameters

    • pages: readonly BTreePage<K, V, U>[]
    • knots: readonly K[]
    • fold: undefined | U
    • size: number

    Returns BTreeNode<K, V, U>

Properties

Readonly fold

fold: undefined | U

Readonly knots

knots: readonly K[]

Readonly pages

pages: readonly BTreePage<K, V, U>[]

Readonly size

size: number

Accessors

arity

  • get arity(): number
  • Returns number

Methods

balanced

drop

  • Parameters

    Returns BTreePage<K, V, U>

entries

  • Returns Cursor<[K, V]>

firstEntry

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

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

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

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

get

  • Parameters

    Returns undefined | V

getEntry

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

    • x: number

    Returns undefined | [K, V]

has

  • Parameters

    Returns boolean

isEmpty

  • isEmpty(): boolean
  • Returns boolean

keys

  • Returns Cursor<K>

lastEntry

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

lookup

  • Parameters

    Returns number

maxKey

  • maxKey(): K
  • Returns K

minKey

  • minKey(): K
  • Returns K

nextEntry

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

    Returns undefined | [K, V]

previousEntry

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

    Returns undefined | [K, V]

reduced

  • reduced(identity: U, accumulator: (result: U, element: V) => U, combiner: (result: U, result2: U) => U): BTreeNode<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 BTreeNode<K, V, U>

removed

removedPage

  • Parameters

    Returns BTreeNode<K, V, U>

replacedPage

  • Parameters

    Returns BTreePage<K, V, U>

reverseEntries

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

reverseKeys

  • Returns Cursor<K>

reverseValues

  • Returns Cursor<V>

split

  • Parameters

    • x: number

    Returns BTreeNode<K, V, U>

splitLeft

  • Parameters

    • x: number

    Returns BTreeNode<K, V, U>

splitRight

  • Parameters

    • x: number

    Returns BTreeNode<K, V, U>

take

  • Parameters

    Returns BTreePage<K, V, U>

updated

  • Parameters

    Returns BTreeNode<K, V, U>

updatedPage

  • Parameters

    Returns BTreeNode<K, V, U>

updatedPageMerge

  • Parameters

    Returns BTreeNode<K, V, U>

updatedPageSplit

  • Parameters

    Returns BTreeNode<K, V, U>

values

  • Returns Cursor<V>

Static empty

  • Type parameters

    • K

    • V

    • U

    Returns BTreeLeaf<K, V, U>

Generated using TypeDoc