MCPcopy Create free account
hub / github.com/TanStack/db / getPairOrNextHigher

Method getPairOrNextHigher

packages/db/src/utils/btree.ts:515–530  ·  view source on GitHub ↗
(
    key: K,
    compare: (a: K, b: K) => number,
    inclusive: boolean,
    reusedArray: [K, V],
  )

Source from the content-addressed store, hash-verified

513 }
514
515 getPairOrNextHigher(
516 key: K,
517 compare: (a: K, b: K) => number,
518 inclusive: boolean,
519 reusedArray: [K, V],
520 ): [K, V] | undefined {
521 const i = this.indexOf(key, -1, compare)
522 const indexOrLower = i < 0 ? ~i : inclusive ? i : i + 1
523 const keys = this.keys
524 if (indexOrLower < keys.length) {
525 reusedArray[0] = keys[indexOrLower]!
526 reusedArray[1] = this.values[indexOrLower]!
527 return reusedArray
528 }
529 return undefined
530 }
531
532 // ///////////////////////////////////////////////////////////////////////////
533 // Leaf Node: set & node splitting //////////////////////////////////////////

Callers 2

nextHigherPairMethod · 0.45
getPairOrNextHigherMethod · 0.45

Calls 1

indexOfMethod · 0.95

Tested by

no test coverage detected