Options
All
  • Public
  • Public/Protected
  • All
Menu

Class BTreeNodeCursor<K, V, U>

Type parameters

  • K

  • V

  • U

Hierarchy

  • NodeCursor<[K, V], BTreePage<K, V, U>>
    • BTreeNodeCursor

Implements

Index

Constructors

constructor

  • new BTreeNodeCursor(pages: BTreePage<K, V, U>[], index?: undefined | number, pageIndex?: undefined | number, subCursor?: Cursor<[K, V]>): BTreeNodeCursor

Methods

delete

  • delete(): void

hasNext

  • hasNext(): boolean

hasPrevious

  • hasPrevious(): boolean

head

  • head(): [K, V]

isEmpty

  • isEmpty(): boolean

next

  • next(): object

nextIndex

  • nextIndex(): number

Protected pageCursor

  • pageCursor(page: BTreePage<K, V, U>): Cursor<[K, V]>

Protected pageSize

  • pageSize(page: BTreePage<K, V, U>): number

previous

  • previous(): object

previousIndex

  • previousIndex(): number

Protected reversePageCursor

  • reversePageCursor(page: BTreePage<K, V, U>): Cursor<[K, V]>

set

  • set(newValue: [K, V]): void

skip

  • skip(count: number): void

step

  • step(): void

Static array

  • array<T>(array: ReadonlyArray<T>, index?: number, limit?: number): Cursor<T>

Static empty

Static unary

  • unary<T>(value: T): Cursor<T>