Method nextLowerKey

packages/db/src/utils/btree.ts:282–285

Returns the next key smaller than the specified key, or undefined if there is none. * Also, nextLowerKey(undefined) returns the highest key.

(key: K | undefined)

   *  Also, nextLowerKey(undefined) returns the highest key.
   */
  nextLowerKey(key: K | undefined): K | undefined {
    const p = this.nextLowerPair(key, ReusedArray as [K, V])
    return p && p[0]
  }

  /** Adds all pairs from a list of key-value pairs.
   * @param pairs Pairs to add to this tree. If there are duplicate keys,