@rocicorp/zero 1.12.0-canary.12 → 1.12.0-canary.13

package/out/replicache/src/persist/collect-idb-databases.js.map

@@ -1 +1 @@
-{"version":3,"file":"collect-idb-databases.js","names":[],"sources":["../../../../../replicache/src/persist/collect-idb-databases.ts"],"sourcesContent":["import type {LogContext, LogLevel, LogSink} from '@rocicorp/logger';\nimport {assert} from '../../../shared/src/asserts.ts';\nimport type {MaybePromise} from '../../../shared/src/types.ts';\nimport {initBgIntervalProcess} from '../bg-interval.ts';\nimport {InvalidRefCountError} from '../dag/invalid-ref-count-error.ts';\nimport {StoreImpl} from '../dag/store-impl.ts';\nimport type {Store} from '../dag/store.ts';\nimport {\n  addDeletedClients,\n  getDeletedClients,\n  mergeDeletedClients,\n  normalizeDeletedClients,\n  type DeletedClients,\n  type WritableDeletedClients,\n} from '../deleted-clients.ts';\nimport * as FormatVersion from '../format-version-enum.ts';\nimport {getKVStoreProvider} from '../get-kv-store-provider.ts';\nimport {assertHash, newRandomHash} from '../hash.ts';\nimport {\n  fallbackStoreProvider,\n  isFallbackStore,\n} from '../kv/mem-fallback-store.ts';\nimport type {CreateStore, DropStore, StoreProvider} from '../kv/store.ts';\nimport {createLogContext} from '../log-options.ts';\nimport type {StorageFailureError} from '../storage-failure.ts';\nimport {withRead, withWrite} from '../with-transactions.ts';\nimport {\n  clientGroupHasPendingMutations,\n  getClientGroups,\n} from './client-groups.ts';\nimport type {OnClientsDeleted} from './clients.ts';\nimport {getClients} from './clients.ts';\nimport {getIDBDatabasesDBName} from './idb-databases-store-db-name.ts';\nimport type {IndexedDBDatabase} from './idb-databases-store.ts';\nimport {IDBDatabasesStore} from './idb-databases-store.ts';\n\n/**\n * How frequently to try to collect\n */\nexport const COLLECT_IDB_INTERVAL = 12 * 60 * 60 * 1000; // 12 hours\n\n/**\n * We delay the initial collection to prevent doing it at startup.\n */\nexport const INITIAL_COLLECT_IDB_DELAY = 5 * 60 * 1000; // 5 minutes\n\nexport function initCollectIDBDatabases(\n  idbDatabasesStore: IDBDatabasesStore,\n  kvStoreProvider: StoreProvider,\n  collectInterval: number,\n  initialCollectDelay: number,\n  maxAge: number,\n  enableMutationRecovery: boolean,\n  onClientsDeleted: OnClientsDeleted,\n  lc: LogContext,\n  signal: AbortSignal,\n  newDagStore: NewDagStore = defaultNewDagStore,\n  onStorageFailure?: ((failure: StorageFailureError) => void) | undefined,\n): void {\n  let initial = true;\n  initBgIntervalProcess(\n    'CollectIDBDatabases',\n    async () => {\n      await collectIDBDatabases(\n        idbDatabasesStore,\n        Date.now(),\n        maxAge,\n        kvStoreProvider,\n        enableMutationRecovery,\n        onClientsDeleted,\n        newDagStore,\n      );\n    },\n    () => {\n      if (initial) {\n        initial = false;\n        return initialCollectDelay;\n      }\n      return collectInterval;\n    },\n    lc,\n    signal,\n    onStorageFailure,\n  );\n}\n\n/**\n * Collects IDB databases that are no longer needed.\n */\nexport async function collectIDBDatabases(\n  idbDatabasesStore: IDBDatabasesStore,\n  now: number,\n  maxAge: number,\n  kvStoreProvider: StoreProvider,\n  enableMutationRecovery: boolean,\n  onClientsDeleted: OnClientsDeleted,\n  newDagStore: NewDagStore = defaultNewDagStore,\n): Promise<void> {\n  const databases = await idbDatabasesStore.getDatabases();\n\n  const dbs = Object.values(databases);\n  const collectResults = await Promise.all(\n    dbs.map(\n      async db =>\n        [\n          db.name,\n          await gatherDatabaseInfoForCollect(\n            db,\n            now,\n            maxAge,\n            enableMutationRecovery,\n            kvStoreProvider.create,\n            newDagStore,\n          ),\n        ] as const,\n    ),\n  );\n\n  const dbNamesToRemove: string[] = [];\n  const dbNamesToKeep: string[] = [];\n  const deletedClientsToRemove: WritableDeletedClients = [];\n  for (const [dbName, [canCollect, deletedClients]] of collectResults) {\n    if (canCollect) {\n      dbNamesToRemove.push(dbName);\n      deletedClientsToRemove.push(...deletedClients);\n    } else {\n      dbNamesToKeep.push(dbName);\n    }\n  }\n\n  const {errors} = await dropDatabases(\n    idbDatabasesStore,\n    dbNamesToRemove,\n    kvStoreProvider.drop,\n  );\n  if (errors.length) {\n    throw errors[0];\n  }\n\n  if (deletedClientsToRemove.length > 0) {\n    // Add the deleted clients to all the dbs that survived the collection.\n    let newDeletedClients: DeletedClients = deletedClientsToRemove;\n    for (const name of dbNamesToKeep) {\n      let dbDeletedClients: DeletedClients;\n      try {\n        dbDeletedClients = await withWrite(\n          newDagStore(name, kvStoreProvider.create),\n          dagWrite => addDeletedClients(dagWrite, deletedClientsToRemove),\n        );\n      } catch (e) {\n        if (!(e instanceof InvalidRefCountError)) {\n          throw e;\n        }\n        // This database is corrupt. Its own instance will find out and\n        // recover the next time it writes to it; here, just skip it and keep\n        // collecting into the others, instead of letting one corrupt\n        // database break every collection run forever.\n        continue;\n      }\n      newDeletedClients = mergeDeletedClients(\n        newDeletedClients,\n        dbDeletedClients,\n      );\n    }\n    // normalize and dedupe\n    const normalizedDeletedClients = normalizeDeletedClients(newDeletedClients);\n\n    // Call the callback with the normalized deleted clients\n    await onClientsDeleted(normalizedDeletedClients);\n  }\n}\n\nexport async function dropDatabaseInternal(\n  name: string,\n  idbDatabasesStore: IDBDatabasesStore,\n  kvDropStore: DropStore,\n) {\n  await kvDropStore(name);\n  await idbDatabasesStore.deleteDatabases([name]);\n}\n\nasync function dropDatabases(\n  idbDatabasesStore: IDBDatabasesStore,\n  namesToRemove: string[],\n  kvDropStore: DropStore,\n): Promise<{dropped: string[]; errors: unknown[]}> {\n  // Try to remove the databases in parallel. Don't let a single reject fail the\n  // other ones. We will check for failures afterwards.\n  const dropStoreResults = await Promise.allSettled(\n    namesToRemove.map(async name => {\n      await dropDatabaseInternal(name, idbDatabasesStore, kvDropStore);\n      return name;\n    }),\n  );\n\n  const dropped: string[] = [];\n  const errors: unknown[] = [];\n  for (const result of dropStoreResults) {\n    if (result.status === 'fulfilled') {\n      dropped.push(result.value);\n    } else {\n      errors.push(result.reason);\n    }\n  }\n\n  return {dropped, errors};\n}\n\n/**\n * Creates the dag store used to inspect and update a database during\n * collection. Callers can override it to install store hooks, for example so\n * a corrupt ref count found while writing deleted clients is recovered from.\n */\nexport type NewDagStore = (name: string, kvCreateStore: CreateStore) => Store;\n\nfunction defaultNewDagStore(name: string, kvCreateStore: CreateStore): Store {\n  const perKvStore = kvCreateStore(name);\n  return new StoreImpl(perKvStore, newRandomHash, assertHash);\n}\n\n/**\n * If any client has a recent heartbeat or there are pending mutations we\n * return `[false]`. Otherwise we return `[true, deletedClients]`.\n */\nfunction gatherDatabaseInfoForCollect(\n  db: IndexedDBDatabase,\n  now: number,\n  maxAge: number,\n  enableMutationRecovery: boolean,\n  kvCreateStore: CreateStore,\n  newDagStore: NewDagStore,\n): MaybePromise<\n  [canCollect: false] | [canCollect: true, deletedClients: DeletedClients]\n> {\n  if (db.replicacheFormatVersion > FormatVersion.Latest) {\n    return [false];\n  }\n\n  // If increase the format version we need to decide how to deal with this\n  // logic.\n  assert(\n    db.replicacheFormatVersion === FormatVersion.DD31 ||\n      db.replicacheFormatVersion === FormatVersion.V6 ||\n      db.replicacheFormatVersion === FormatVersion.V7,\n    () =>\n      `Expected replicacheFormatVersion to be DD31, V6, or V7, got ${db.replicacheFormatVersion}`,\n  );\n  return canDatabaseBeCollectedAndGetDeletedClientIDs(\n    enableMutationRecovery,\n    newDagStore(db.name, kvCreateStore),\n    now,\n    maxAge,\n  );\n}\n\n/**\n * Options for `dropDatabase` and `dropAllDatabases`.\n */\nexport type DropDatabaseOptions = {\n  /**\n   * Allows providing a custom implementation of the underlying storage layer.\n   * Default is `'idb'`.\n   */\n  kvStore?: 'idb' | 'mem' | StoreProvider | undefined;\n  /**\n   * Determines how much logging to do. When this is set to `'debug'`,\n   * Replicache will also log `'info'` and `'error'` messages. When set to\n   * `'info'` we log `'info'` and `'error'` but not `'debug'`. When set to\n   * `'error'` we only log `'error'` messages.\n   * Default is `'info'`.\n   */\n  logLevel?: LogLevel | undefined;\n  /**\n   * Enables custom handling of logs.\n   *\n   * By default logs are logged to the console.  If you would like logs to be\n   * sent elsewhere (e.g. to a cloud logging service like DataDog) you can\n   * provide an array of {@link LogSink}s.  Logs at or above\n   * {@link DropDatabaseOptions.logLevel} are sent to each of these {@link LogSink}s.\n   * If you would still like logs to go to the console, include\n   * `consoleLogSink` in the array.\n   *\n   * ```ts\n   * logSinks: [consoleLogSink, myCloudLogSink],\n   * ```\n   * Default is `[consoleLogSink]`.\n   */\n  logSinks?: LogSink[] | undefined;\n};\n\n/**\n * Drops the specified database, from memory as well as from the configured\n * store (see `onStorageFailure`). Rejects if the configured store cannot be\n * opened or dropped.\n * @param dbName The name of the database to drop.\n * @param opts Options for dropping the database.\n */\nexport async function dropDatabase(dbName: string, opts?: DropDatabaseOptions) {\n  const logContext = createLogContext(opts?.logLevel, opts?.logSinks, {\n    dropDatabase: undefined,\n  });\n  for (const {provider, drops} of dropTargets(logContext, opts)) {\n    if (!drops(dbName)) {\n      continue;\n    }\n    const store = new IDBDatabasesStore(provider.create);\n    try {\n      await dropDatabaseInternal(dbName, store, provider.drop);\n    } finally {\n      await closeIgnoringErrors(store);\n    }\n  }\n}\n\n/**\n * Deletes all IndexedDB data associated with Replicache, and the in-memory\n * databases instances ran on after a storage failure (see\n * `onStorageFailure`).\n *\n * Returns an object with the names of the successfully dropped databases\n * and any errors encountered while dropping. Rejects if the configured store\n * cannot be opened.\n */\nexport function dropAllDatabases(opts?: DropDatabaseOptions): Promise<{\n  dropped: string[];\n  errors: unknown[];\n}> {\n  return dropMatchingDatabases(() => true, opts);\n}\n\n/**\n * Like {@link dropAllDatabases}, for the databases whose registry record\n * matches `predicate`.\n */\nexport async function dropMatchingDatabases(\n  predicate: (db: IndexedDBDatabase) => boolean,\n  opts?: DropDatabaseOptions,\n): Promise<{\n  dropped: string[];\n  errors: unknown[];\n}> {\n  const logContext = createLogContext(opts?.logLevel, opts?.logSinks, {\n    dropDatabases: undefined,\n  });\n  const dropped = new Set<string>();\n  const errors: unknown[] = [];\n  for (const {provider, drops} of dropTargets(logContext, opts)) {\n    const store = new IDBDatabasesStore(provider.create);\n    try {\n      const databases = await store.getDatabases();\n      const dbNames = Object.values(databases)\n        .filter(db => predicate(db) && drops(db.name))\n        .map(db => db.name);\n      const result = await dropDatabases(store, dbNames, provider.drop);\n      result.dropped.forEach(name => dropped.add(name));\n      errors.push(...result.errors);\n    } finally {\n      await closeIgnoringErrors(store);\n    }\n  }\n  return {dropped: [...dropped], errors};\n}\n\ntype DropTarget = {\n  provider: StoreProvider;\n  /** Whether a database of this name is dropped from `provider`. */\n  drops: (name: string) => boolean;\n};\n\n/**\n * The memory stores instances fell back to first, then the configured store.\n * An instance whose store failed to open runs on memory stores of the same\n * names (see `onStorageFailure`), and memory stores outlive the instance for\n * the life of the process, so a drop clears them whatever the configured\n * store is. Only those: the memory stores of `kvStore: 'mem'` instances are\n * left alone unless `'mem'` is the store being dropped from. The configured\n * store is still dropped, and its failure is reported: it may hold data on\n * disk.\n */\nfunction dropTargets(\n  lc: LogContext,\n  opts: DropDatabaseOptions | undefined,\n): DropTarget[] {\n  const all = () => true;\n  if (opts?.kvStore === 'mem') {\n    return [{provider: getKVStoreProvider(lc, 'mem'), drops: all}];\n  }\n  const targets: DropTarget[] = [];\n  if (isFallbackStore(getIDBDatabasesDBName())) {\n    targets.push({provider: fallbackStoreProvider, drops: isFallbackStore});\n  }\n  targets.push({provider: getKVStoreProvider(lc, opts?.kvStore), drops: all});\n  return targets;\n}\n\n/**\n * A store that failed to open may also fail to close; the drop's own result\n * is what the caller needs.\n */\nfunction closeIgnoringErrors(store: IDBDatabasesStore): Promise<void> {\n  return store.close().catch(() => undefined);\n}\n\n/**\n * Deletes all IndexedDB data associated with Replicache.\n *\n * Returns an object with the names of the successfully dropped databases\n * and any errors encountered while dropping.\n *\n * @deprecated Use `dropAllDatabases` instead.\n */\nexport function deleteAllReplicacheData(opts?: DropDatabaseOptions) {\n  return dropAllDatabases(opts);\n}\n\n/**\n * If there are pending mutations in any of the clients in this db we return\n * `[false]`. If any client has a recent heartbeat we also return `[false]`.\n * Otherwise we return `[true, deletedClients]`.\n */\nfunction canDatabaseBeCollectedAndGetDeletedClientIDs(\n  enableMutationRecovery: boolean,\n  perdag: Store,\n  now: number,\n  maxAge: number,\n): Promise<\n  [canCollect: false] | [canCollect: true, deletedClients: DeletedClients]\n> {\n  return withRead(perdag, async read => {\n    // If mutation recovery is disabled we do not care if there are pending\n    // mutations when we decide if we can collect the database.\n    if (enableMutationRecovery) {\n      const clientGroups = await getClientGroups(read);\n      for (const clientGroup of clientGroups.values()) {\n        if (clientGroupHasPendingMutations(clientGroup)) {\n          return [false];\n        }\n      }\n    }\n\n    const clients = await getClients(read);\n\n    // Don't collect if any client has a recent heartbeat (is still active).\n    // This is defense in depth - normally lastOpenedTimestampMS is kept fresh\n    // by the heartbeat, but this check protects against edge cases.\n    for (const [, client] of clients) {\n      if (now - client.heartbeatTimestampMs < maxAge) {\n        return [false];\n      }\n    }\n\n    const existingDeletedClients = await getDeletedClients(read);\n    const deletedClients: WritableDeletedClients = [...existingDeletedClients];\n\n    // Add all current clients to the deleted clients list\n    for (const [clientID, client] of clients) {\n      deletedClients.push({\n        clientID,\n        clientGroupID: client.clientGroupID,\n      });\n    }\n\n    // The normalization (deduping and sorting) will be done when storing\n    return [true, deletedClients];\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AAuCA,IAAa,uBAAuB;;;;AAKpC,IAAa,4BAA4B;AAEzC,SAAgB,wBACd,mBACA,iBACA,iBACA,qBACA,QACA,wBACA,kBACA,IACA,QACA,cAA2B,oBAC3B,kBACM;CACN,IAAI,UAAU;CACd,sBACE,uBACA,YAAY;EACV,MAAM,oBACJ,mBACA,KAAK,IAAI,GACT,QACA,iBACA,wBACA,kBACA,WACF;CACF,SACM;EACJ,IAAI,SAAS;GACX,UAAU;GACV,OAAO;EACT;EACA,OAAO;CACT,GACA,IACA,QACA,gBACF;AACF;;;;AAKA,eAAsB,oBACpB,mBACA,KACA,QACA,iBACA,wBACA,kBACA,cAA2B,oBACZ;CACf,MAAM,YAAY,MAAM,kBAAkB,aAAa;CAEvD,MAAM,MAAM,OAAO,OAAO,SAAS;CACnC,MAAM,iBAAiB,MAAM,QAAQ,IACnC,IAAI,IACF,OAAM,OACJ,CACE,GAAG,MACH,MAAM,6BACJ,IACA,KACA,QACA,wBACA,gBAAgB,QAChB,WACF,CACF,CACJ,CACF;CAEA,MAAM,kBAA4B,CAAC;CACnC,MAAM,gBAA0B,CAAC;CACjC,MAAM,yBAAiD,CAAC;CACxD,KAAK,MAAM,CAAC,QAAQ,CAAC,YAAY,oBAAoB,gBACnD,IAAI,YAAY;EACd,gBAAgB,KAAK,MAAM;EAC3B,uBAAuB,KAAK,GAAG,cAAc;CAC/C,OACE,cAAc,KAAK,MAAM;CAI7B,MAAM,EAAC,WAAU,MAAM,cACrB,mBACA,iBACA,gBAAgB,IAClB;CACA,IAAI,OAAO,QACT,MAAM,OAAO;CAGf,IAAI,uBAAuB,SAAS,GAAG;EAErC,IAAI,oBAAoC;EACxC,KAAK,MAAM,QAAQ,eAAe;GAChC,IAAI;GACJ,IAAI;IACF,mBAAmB,MAAM,UACvB,YAAY,MAAM,gBAAgB,MAAM,IACxC,aAAY,kBAAkB,UAAU,sBAAsB,CAChE;GACF,SAAS,GAAG;IACV,IAAI,EAAE,aAAa,uBACjB,MAAM;IAMR;GACF;GACA,oBAAoB,oBAClB,mBACA,gBACF;EACF;EAKA,MAAM,iBAH2B,wBAAwB,iBAGlC,CAAwB;CACjD;AACF;AAEA,eAAsB,qBACpB,MACA,mBACA,aACA;CACA,MAAM,YAAY,IAAI;CACtB,MAAM,kBAAkB,gBAAgB,CAAC,IAAI,CAAC;AAChD;AAEA,eAAe,cACb,mBACA,eACA,aACiD;CAGjD,MAAM,mBAAmB,MAAM,QAAQ,WACrC,cAAc,IAAI,OAAM,SAAQ;EAC9B,MAAM,qBAAqB,MAAM,mBAAmB,WAAW;EAC/D,OAAO;CACT,CAAC,CACH;CAEA,MAAM,UAAoB,CAAC;CAC3B,MAAM,SAAoB,CAAC;CAC3B,KAAK,MAAM,UAAU,kBACnB,IAAI,OAAO,WAAW,aACpB,QAAQ,KAAK,OAAO,KAAK;MAEzB,OAAO,KAAK,OAAO,MAAM;CAI7B,OAAO;EAAC;EAAS;CAAM;AACzB;AASA,SAAS,mBAAmB,MAAc,eAAmC;CAC3E,MAAM,aAAa,cAAc,IAAI;CACrC,OAAO,IAAI,UAAU,YAAY,eAAe,UAAU;AAC5D;;;;;AAMA,SAAS,6BACP,IACA,KACA,QACA,wBACA,eACA,aAGA;CACA,IAAI,GAAG,0BAA0B,GAC/B,OAAO,CAAC,KAAK;CAKf,OACE,GAAG,4BAA4B,KAC7B,GAAG,4BAA4B,KAC/B,GAAG,4BAA4B,SAE/B,+DAA+D,GAAG,yBACtE;CACA,OAAO,6CACL,wBACA,YAAY,GAAG,MAAM,aAAa,GAClC,KACA,MACF;AACF;;;;;;;;AA4CA,eAAsB,aAAa,QAAgB,MAA4B;CAC7E,MAAM,aAAa,iBAAiB,MAAM,UAAU,MAAM,UAAU,EAClE,cAAc,KAAA,EAChB,CAAC;CACD,KAAK,MAAM,EAAC,UAAU,WAAU,YAAY,YAAY,IAAI,GAAG;EAC7D,IAAI,CAAC,MAAM,MAAM,GACf;EAEF,MAAM,QAAQ,IAAI,kBAAkB,SAAS,MAAM;EACnD,IAAI;GACF,MAAM,qBAAqB,QAAQ,OAAO,SAAS,IAAI;EACzD,UAAU;GACR,MAAM,oBAAoB,KAAK;EACjC;CACF;AACF;;;;;;;;;;AAWA,SAAgB,iBAAiB,MAG9B;CACD,OAAO,4BAA4B,MAAM,IAAI;AAC/C;;;;;AAMA,eAAsB,sBACpB,WACA,MAIC;CACD,MAAM,aAAa,iBAAiB,MAAM,UAAU,MAAM,UAAU,EAClE,eAAe,KAAA,EACjB,CAAC;CACD,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,SAAoB,CAAC;CAC3B,KAAK,MAAM,EAAC,UAAU,WAAU,YAAY,YAAY,IAAI,GAAG;EAC7D,MAAM,QAAQ,IAAI,kBAAkB,SAAS,MAAM;EACnD,IAAI;GACF,MAAM,YAAY,MAAM,MAAM,aAAa;GAI3C,MAAM,SAAS,MAAM,cAAc,OAHnB,OAAO,OAAO,SAAS,CAAC,CACrC,QAAO,OAAM,UAAU,EAAE,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,CAC7C,KAAI,OAAM,GAAG,IAC0B,GAAS,SAAS,IAAI;GAChE,OAAO,QAAQ,SAAQ,SAAQ,QAAQ,IAAI,IAAI,CAAC;GAChD,OAAO,KAAK,GAAG,OAAO,MAAM;EAC9B,UAAU;GACR,MAAM,oBAAoB,KAAK;EACjC;CACF;CACA,OAAO;EAAC,SAAS,CAAC,GAAG,OAAO;EAAG;CAAM;AACvC;;;;;;;;;;;AAkBA,SAAS,YACP,IACA,MACc;CACd,MAAM,YAAY;CAClB,IAAI,MAAM,YAAY,OACpB,OAAO,CAAC;EAAC,UAAU,mBAAmB,IAAI,KAAK;EAAG,OAAO;CAAG,CAAC;CAE/D,MAAM,UAAwB,CAAC;CAC/B,IAAI,gBAAgB,sBAAsB,CAAC,GACzC,QAAQ,KAAK;EAAC,UAAU;EAAuB,OAAO;CAAe,CAAC;CAExE,QAAQ,KAAK;EAAC,UAAU,mBAAmB,IAAI,MAAM,OAAO;EAAG,OAAO;CAAG,CAAC;CAC1E,OAAO;AACT;;;;;AAMA,SAAS,oBAAoB,OAAyC;CACpE,OAAO,MAAM,MAAM,CAAC,CAAC,YAAY,KAAA,CAAS;AAC5C;;;;;;AAmBA,SAAS,6CACP,wBACA,QACA,KACA,QAGA;CACA,OAAO,SAAS,QAAQ,OAAM,SAAQ;EAGpC,IAAI,wBAAwB;GAC1B,MAAM,eAAe,MAAM,gBAAgB,IAAI;GAC/C,KAAK,MAAM,eAAe,aAAa,OAAO,GAC5C,IAAI,+BAA+B,WAAW,GAC5C,OAAO,CAAC,KAAK;EAGnB;EAEA,MAAM,UAAU,MAAM,WAAW,IAAI;EAKrC,KAAK,MAAM,GAAG,WAAW,SACvB,IAAI,MAAM,OAAO,uBAAuB,QACtC,OAAO,CAAC,KAAK;EAKjB,MAAM,iBAAyC,CAAC,GAAG,MADd,kBAAkB,IAAI,CACc;EAGzE,KAAK,MAAM,CAAC,UAAU,WAAW,SAC/B,eAAe,KAAK;GAClB;GACA,eAAe,OAAO;EACxB,CAAC;EAIH,OAAO,CAAC,MAAM,cAAc;CAC9B,CAAC;AACH"}
+{"version":3,"file":"collect-idb-databases.js","names":[],"sources":["../../../../../replicache/src/persist/collect-idb-databases.ts"],"sourcesContent":["import type {LogContext, LogLevel, LogSink} from '@rocicorp/logger';\nimport {assert} from '../../../shared/src/asserts.ts';\nimport {initBgIntervalProcess} from '../bg-interval.ts';\nimport {InvalidRefCountError} from '../dag/invalid-ref-count-error.ts';\nimport {StoreImpl} from '../dag/store-impl.ts';\nimport type {Store} from '../dag/store.ts';\nimport {\n  addDeletedClients,\n  getDeletedClients,\n  mergeDeletedClients,\n  normalizeDeletedClients,\n  type DeletedClients,\n  type WritableDeletedClients,\n} from '../deleted-clients.ts';\nimport * as FormatVersion from '../format-version-enum.ts';\nimport {getKVStoreProvider} from '../get-kv-store-provider.ts';\nimport {assertHash, newRandomHash} from '../hash.ts';\nimport {\n  fallbackStoreProvider,\n  isFallbackStore,\n} from '../kv/mem-fallback-store.ts';\nimport type {CreateStore, DropStore, StoreProvider} from '../kv/store.ts';\nimport {createLogContext} from '../log-options.ts';\nimport type {StorageFailureError} from '../storage-failure.ts';\nimport {withRead, withWrite} from '../with-transactions.ts';\nimport {\n  clientGroupHasPendingMutations,\n  getClientGroups,\n} from './client-groups.ts';\nimport type {OnClientsDeleted} from './clients.ts';\nimport {getClients} from './clients.ts';\nimport {getIDBDatabasesDBName} from './idb-databases-store-db-name.ts';\nimport type {IndexedDBDatabase} from './idb-databases-store.ts';\nimport {IDBDatabasesStore} from './idb-databases-store.ts';\n\n/**\n * How frequently to try to collect\n */\nexport const COLLECT_IDB_INTERVAL = 12 * 60 * 60 * 1000; // 12 hours\n\n/**\n * We delay the initial collection to prevent doing it at startup.\n */\nexport const INITIAL_COLLECT_IDB_DELAY = 5 * 60 * 1000; // 5 minutes\n\nexport function initCollectIDBDatabases(\n  idbDatabasesStore: IDBDatabasesStore,\n  kvStoreProvider: StoreProvider,\n  collectInterval: number,\n  initialCollectDelay: number,\n  maxAge: number,\n  enableMutationRecovery: boolean,\n  onClientsDeleted: OnClientsDeleted,\n  lc: LogContext,\n  signal: AbortSignal,\n  newDagStore: NewDagStore = defaultNewDagStore,\n  onStorageFailure?: ((failure: StorageFailureError) => void) | undefined,\n): void {\n  let initial = true;\n  initBgIntervalProcess(\n    'CollectIDBDatabases',\n    async () => {\n      await collectIDBDatabases(\n        idbDatabasesStore,\n        Date.now(),\n        maxAge,\n        kvStoreProvider,\n        enableMutationRecovery,\n        onClientsDeleted,\n        newDagStore,\n      );\n    },\n    () => {\n      if (initial) {\n        initial = false;\n        return initialCollectDelay;\n      }\n      return collectInterval;\n    },\n    lc,\n    signal,\n    onStorageFailure,\n  );\n}\n\n/**\n * Collects IDB databases that are no longer needed.\n */\nexport async function collectIDBDatabases(\n  idbDatabasesStore: IDBDatabasesStore,\n  now: number,\n  maxAge: number,\n  kvStoreProvider: StoreProvider,\n  enableMutationRecovery: boolean,\n  onClientsDeleted: OnClientsDeleted,\n  newDagStore: NewDagStore = defaultNewDagStore,\n): Promise<void> {\n  const databases = await idbDatabasesStore.getDatabases();\n\n  const dbs = Object.values(databases);\n  const collectResults = await Promise.all(\n    dbs.map(\n      async db =>\n        [\n          db.name,\n          await gatherDatabaseInfoForCollect(\n            db,\n            now,\n            maxAge,\n            enableMutationRecovery,\n            kvStoreProvider.create,\n            newDagStore,\n          ),\n        ] as const,\n    ),\n  );\n\n  const dbNamesToRemove: string[] = [];\n  const dbNamesToKeep: string[] = [];\n  const deletedClientsToRemove: WritableDeletedClients = [];\n  for (const [dbName, [canCollect, deletedClients]] of collectResults) {\n    if (canCollect) {\n      dbNamesToRemove.push(dbName);\n      deletedClientsToRemove.push(...deletedClients);\n    } else {\n      dbNamesToKeep.push(dbName);\n    }\n  }\n\n  const {errors} = await dropDatabases(\n    idbDatabasesStore,\n    dbNamesToRemove,\n    kvStoreProvider.drop,\n  );\n  if (errors.length) {\n    throw errors[0];\n  }\n\n  if (deletedClientsToRemove.length > 0) {\n    // Add the deleted clients to all the dbs that survived the collection.\n    let newDeletedClients: DeletedClients = deletedClientsToRemove;\n    for (const name of dbNamesToKeep) {\n      const perdag = newDagStore(name, kvStoreProvider.create);\n      let dbDeletedClients: DeletedClients;\n      try {\n        dbDeletedClients = await withWrite(perdag, dagWrite =>\n          addDeletedClients(dagWrite, deletedClientsToRemove),\n        );\n      } catch (e) {\n        if (!(e instanceof InvalidRefCountError)) {\n          throw e;\n        }\n        // This database is corrupt. Its own instance will find out and\n        // recover the next time it writes to it; here, just skip it and keep\n        // collecting into the others, instead of letting one corrupt\n        // database break every collection run forever.\n        continue;\n      } finally {\n        await closeIgnoringErrors(perdag);\n      }\n      newDeletedClients = mergeDeletedClients(\n        newDeletedClients,\n        dbDeletedClients,\n      );\n    }\n    // normalize and dedupe\n    const normalizedDeletedClients = normalizeDeletedClients(newDeletedClients);\n\n    // Call the callback with the normalized deleted clients\n    await onClientsDeleted(normalizedDeletedClients);\n  }\n}\n\nexport async function dropDatabaseInternal(\n  name: string,\n  idbDatabasesStore: IDBDatabasesStore,\n  kvDropStore: DropStore,\n) {\n  await kvDropStore(name);\n  await idbDatabasesStore.deleteDatabases([name]);\n}\n\nasync function dropDatabases(\n  idbDatabasesStore: IDBDatabasesStore,\n  namesToRemove: string[],\n  kvDropStore: DropStore,\n): Promise<{dropped: string[]; errors: unknown[]}> {\n  // Try to remove the databases in parallel. Don't let a single reject fail the\n  // other ones. We will check for failures afterwards.\n  const dropStoreResults = await Promise.allSettled(\n    namesToRemove.map(async name => {\n      await dropDatabaseInternal(name, idbDatabasesStore, kvDropStore);\n      return name;\n    }),\n  );\n\n  const dropped: string[] = [];\n  const errors: unknown[] = [];\n  for (const result of dropStoreResults) {\n    if (result.status === 'fulfilled') {\n      dropped.push(result.value);\n    } else {\n      errors.push(result.reason);\n    }\n  }\n\n  return {dropped, errors};\n}\n\n/**\n * Creates the dag store used to inspect and update a database during\n * collection. Callers can override it to install store hooks, for example so\n * a corrupt ref count found while writing deleted clients is recovered from.\n * Collection closes every store it creates once it is done with it.\n */\nexport type NewDagStore = (name: string, kvCreateStore: CreateStore) => Store;\n\nfunction defaultNewDagStore(name: string, kvCreateStore: CreateStore): Store {\n  const perKvStore = kvCreateStore(name);\n  return new StoreImpl(perKvStore, newRandomHash, assertHash);\n}\n\n/**\n * If any client has a recent heartbeat or there are pending mutations we\n * return `[false]`. Otherwise we return `[true, deletedClients]`.\n */\nasync function gatherDatabaseInfoForCollect(\n  db: IndexedDBDatabase,\n  now: number,\n  maxAge: number,\n  enableMutationRecovery: boolean,\n  kvCreateStore: CreateStore,\n  newDagStore: NewDagStore,\n): Promise<\n  [canCollect: false] | [canCollect: true, deletedClients: DeletedClients]\n> {\n  if (db.replicacheFormatVersion > FormatVersion.Latest) {\n    return [false];\n  }\n\n  // If increase the format version we need to decide how to deal with this\n  // logic.\n  assert(\n    db.replicacheFormatVersion === FormatVersion.DD31 ||\n      db.replicacheFormatVersion === FormatVersion.V6 ||\n      db.replicacheFormatVersion === FormatVersion.V7,\n    () =>\n      `Expected replicacheFormatVersion to be DD31, V6, or V7, got ${db.replicacheFormatVersion}`,\n  );\n  // Closed before the database is dropped, so the drop does not find it open.\n  const perdag = newDagStore(db.name, kvCreateStore);\n  try {\n    return await canDatabaseBeCollectedAndGetDeletedClientIDs(\n      enableMutationRecovery,\n      perdag,\n      now,\n      maxAge,\n    );\n  } finally {\n    await closeIgnoringErrors(perdag);\n  }\n}\n\n/**\n * Options for `dropDatabase` and `dropAllDatabases`.\n */\nexport type DropDatabaseOptions = {\n  /**\n   * Allows providing a custom implementation of the underlying storage layer.\n   * Default is `'idb'`.\n   */\n  kvStore?: 'idb' | 'mem' | StoreProvider | undefined;\n  /**\n   * Determines how much logging to do. When this is set to `'debug'`,\n   * Replicache will also log `'info'` and `'error'` messages. When set to\n   * `'info'` we log `'info'` and `'error'` but not `'debug'`. When set to\n   * `'error'` we only log `'error'` messages.\n   * Default is `'info'`.\n   */\n  logLevel?: LogLevel | undefined;\n  /**\n   * Enables custom handling of logs.\n   *\n   * By default logs are logged to the console.  If you would like logs to be\n   * sent elsewhere (e.g. to a cloud logging service like DataDog) you can\n   * provide an array of {@link LogSink}s.  Logs at or above\n   * {@link DropDatabaseOptions.logLevel} are sent to each of these {@link LogSink}s.\n   * If you would still like logs to go to the console, include\n   * `consoleLogSink` in the array.\n   *\n   * ```ts\n   * logSinks: [consoleLogSink, myCloudLogSink],\n   * ```\n   * Default is `[consoleLogSink]`.\n   */\n  logSinks?: LogSink[] | undefined;\n};\n\n/**\n * Drops the specified database, from memory as well as from the configured\n * store (see `onStorageFailure`). Rejects if the configured store cannot be\n * opened or dropped.\n * @param dbName The name of the database to drop.\n * @param opts Options for dropping the database.\n */\nexport async function dropDatabase(dbName: string, opts?: DropDatabaseOptions) {\n  const logContext = createLogContext(opts?.logLevel, opts?.logSinks, {\n    dropDatabase: undefined,\n  });\n  for (const {provider, drops} of dropTargets(logContext, opts)) {\n    if (!drops(dbName)) {\n      continue;\n    }\n    const store = new IDBDatabasesStore(provider.create);\n    try {\n      await dropDatabaseInternal(dbName, store, provider.drop);\n    } finally {\n      await closeIgnoringErrors(store);\n    }\n  }\n}\n\n/**\n * Deletes all IndexedDB data associated with Replicache, and the in-memory\n * databases instances ran on after a storage failure (see\n * `onStorageFailure`).\n *\n * Returns an object with the names of the successfully dropped databases\n * and any errors encountered while dropping. Rejects if the configured store\n * cannot be opened.\n */\nexport function dropAllDatabases(opts?: DropDatabaseOptions): Promise<{\n  dropped: string[];\n  errors: unknown[];\n}> {\n  return dropMatchingDatabases(() => true, opts);\n}\n\n/**\n * Like {@link dropAllDatabases}, for the databases whose registry record\n * matches `predicate`.\n */\nexport async function dropMatchingDatabases(\n  predicate: (db: IndexedDBDatabase) => boolean,\n  opts?: DropDatabaseOptions,\n): Promise<{\n  dropped: string[];\n  errors: unknown[];\n}> {\n  const logContext = createLogContext(opts?.logLevel, opts?.logSinks, {\n    dropDatabases: undefined,\n  });\n  const dropped = new Set<string>();\n  const errors: unknown[] = [];\n  for (const {provider, drops} of dropTargets(logContext, opts)) {\n    const store = new IDBDatabasesStore(provider.create);\n    try {\n      const databases = await store.getDatabases();\n      const dbNames = Object.values(databases)\n        .filter(db => predicate(db) && drops(db.name))\n        .map(db => db.name);\n      const result = await dropDatabases(store, dbNames, provider.drop);\n      result.dropped.forEach(name => dropped.add(name));\n      errors.push(...result.errors);\n    } finally {\n      await closeIgnoringErrors(store);\n    }\n  }\n  return {dropped: [...dropped], errors};\n}\n\ntype DropTarget = {\n  provider: StoreProvider;\n  /** Whether a database of this name is dropped from `provider`. */\n  drops: (name: string) => boolean;\n};\n\n/**\n * The memory stores instances fell back to first, then the configured store.\n * An instance whose store failed to open runs on memory stores of the same\n * names (see `onStorageFailure`), and memory stores outlive the instance for\n * the life of the process, so a drop clears them whatever the configured\n * store is. Only those: the memory stores of `kvStore: 'mem'` instances are\n * left alone unless `'mem'` is the store being dropped from. The configured\n * store is still dropped, and its failure is reported: it may hold data on\n * disk.\n */\nfunction dropTargets(\n  lc: LogContext,\n  opts: DropDatabaseOptions | undefined,\n): DropTarget[] {\n  const all = () => true;\n  if (opts?.kvStore === 'mem') {\n    return [{provider: getKVStoreProvider(lc, 'mem'), drops: all}];\n  }\n  const targets: DropTarget[] = [];\n  if (isFallbackStore(getIDBDatabasesDBName())) {\n    targets.push({provider: fallbackStoreProvider, drops: isFallbackStore});\n  }\n  targets.push({provider: getKVStoreProvider(lc, opts?.kvStore), drops: all});\n  return targets;\n}\n\n/**\n * A store that failed to open may also fail to close; the drop's or the\n * collection's own result is what the caller needs.\n */\nfunction closeIgnoringErrors(store: {close(): Promise<void>}): Promise<void> {\n  return store.close().catch(() => undefined);\n}\n\n/**\n * Deletes all IndexedDB data associated with Replicache.\n *\n * Returns an object with the names of the successfully dropped databases\n * and any errors encountered while dropping.\n *\n * @deprecated Use `dropAllDatabases` instead.\n */\nexport function deleteAllReplicacheData(opts?: DropDatabaseOptions) {\n  return dropAllDatabases(opts);\n}\n\n/**\n * If there are pending mutations in any of the clients in this db we return\n * `[false]`. If any client has a recent heartbeat we also return `[false]`.\n * Otherwise we return `[true, deletedClients]`.\n */\nfunction canDatabaseBeCollectedAndGetDeletedClientIDs(\n  enableMutationRecovery: boolean,\n  perdag: Store,\n  now: number,\n  maxAge: number,\n): Promise<\n  [canCollect: false] | [canCollect: true, deletedClients: DeletedClients]\n> {\n  return withRead(perdag, async read => {\n    // If mutation recovery is disabled we do not care if there are pending\n    // mutations when we decide if we can collect the database.\n    if (enableMutationRecovery) {\n      const clientGroups = await getClientGroups(read);\n      for (const clientGroup of clientGroups.values()) {\n        if (clientGroupHasPendingMutations(clientGroup)) {\n          return [false];\n        }\n      }\n    }\n\n    const clients = await getClients(read);\n\n    // Don't collect if any client has a recent heartbeat (is still active).\n    // This is defense in depth - normally lastOpenedTimestampMS is kept fresh\n    // by the heartbeat, but this check protects against edge cases.\n    for (const [, client] of clients) {\n      if (now - client.heartbeatTimestampMs < maxAge) {\n        return [false];\n      }\n    }\n\n    const existingDeletedClients = await getDeletedClients(read);\n    const deletedClients: WritableDeletedClients = [...existingDeletedClients];\n\n    // Add all current clients to the deleted clients list\n    for (const [clientID, client] of clients) {\n      deletedClients.push({\n        clientID,\n        clientGroupID: client.clientGroupID,\n      });\n    }\n\n    // The normalization (deduping and sorting) will be done when storing\n    return [true, deletedClients];\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AAsCA,IAAa,uBAAuB;;;;AAKpC,IAAa,4BAA4B;AAEzC,SAAgB,wBACd,mBACA,iBACA,iBACA,qBACA,QACA,wBACA,kBACA,IACA,QACA,cAA2B,oBAC3B,kBACM;CACN,IAAI,UAAU;CACd,sBACE,uBACA,YAAY;EACV,MAAM,oBACJ,mBACA,KAAK,IAAI,GACT,QACA,iBACA,wBACA,kBACA,WACF;CACF,SACM;EACJ,IAAI,SAAS;GACX,UAAU;GACV,OAAO;EACT;EACA,OAAO;CACT,GACA,IACA,QACA,gBACF;AACF;;;;AAKA,eAAsB,oBACpB,mBACA,KACA,QACA,iBACA,wBACA,kBACA,cAA2B,oBACZ;CACf,MAAM,YAAY,MAAM,kBAAkB,aAAa;CAEvD,MAAM,MAAM,OAAO,OAAO,SAAS;CACnC,MAAM,iBAAiB,MAAM,QAAQ,IACnC,IAAI,IACF,OAAM,OACJ,CACE,GAAG,MACH,MAAM,6BACJ,IACA,KACA,QACA,wBACA,gBAAgB,QAChB,WACF,CACF,CACJ,CACF;CAEA,MAAM,kBAA4B,CAAC;CACnC,MAAM,gBAA0B,CAAC;CACjC,MAAM,yBAAiD,CAAC;CACxD,KAAK,MAAM,CAAC,QAAQ,CAAC,YAAY,oBAAoB,gBACnD,IAAI,YAAY;EACd,gBAAgB,KAAK,MAAM;EAC3B,uBAAuB,KAAK,GAAG,cAAc;CAC/C,OACE,cAAc,KAAK,MAAM;CAI7B,MAAM,EAAC,WAAU,MAAM,cACrB,mBACA,iBACA,gBAAgB,IAClB;CACA,IAAI,OAAO,QACT,MAAM,OAAO;CAGf,IAAI,uBAAuB,SAAS,GAAG;EAErC,IAAI,oBAAoC;EACxC,KAAK,MAAM,QAAQ,eAAe;GAChC,MAAM,SAAS,YAAY,MAAM,gBAAgB,MAAM;GACvD,IAAI;GACJ,IAAI;IACF,mBAAmB,MAAM,UAAU,SAAQ,aACzC,kBAAkB,UAAU,sBAAsB,CACpD;GACF,SAAS,GAAG;IACV,IAAI,EAAE,aAAa,uBACjB,MAAM;IAMR;GACF,UAAU;IACR,MAAM,oBAAoB,MAAM;GAClC;GACA,oBAAoB,oBAClB,mBACA,gBACF;EACF;EAKA,MAAM,iBAH2B,wBAAwB,iBAGlC,CAAwB;CACjD;AACF;AAEA,eAAsB,qBACpB,MACA,mBACA,aACA;CACA,MAAM,YAAY,IAAI;CACtB,MAAM,kBAAkB,gBAAgB,CAAC,IAAI,CAAC;AAChD;AAEA,eAAe,cACb,mBACA,eACA,aACiD;CAGjD,MAAM,mBAAmB,MAAM,QAAQ,WACrC,cAAc,IAAI,OAAM,SAAQ;EAC9B,MAAM,qBAAqB,MAAM,mBAAmB,WAAW;EAC/D,OAAO;CACT,CAAC,CACH;CAEA,MAAM,UAAoB,CAAC;CAC3B,MAAM,SAAoB,CAAC;CAC3B,KAAK,MAAM,UAAU,kBACnB,IAAI,OAAO,WAAW,aACpB,QAAQ,KAAK,OAAO,KAAK;MAEzB,OAAO,KAAK,OAAO,MAAM;CAI7B,OAAO;EAAC;EAAS;CAAM;AACzB;AAUA,SAAS,mBAAmB,MAAc,eAAmC;CAC3E,MAAM,aAAa,cAAc,IAAI;CACrC,OAAO,IAAI,UAAU,YAAY,eAAe,UAAU;AAC5D;;;;;AAMA,eAAe,6BACb,IACA,KACA,QACA,wBACA,eACA,aAGA;CACA,IAAI,GAAG,0BAA0B,GAC/B,OAAO,CAAC,KAAK;CAKf,OACE,GAAG,4BAA4B,KAC7B,GAAG,4BAA4B,KAC/B,GAAG,4BAA4B,SAE/B,+DAA+D,GAAG,yBACtE;CAEA,MAAM,SAAS,YAAY,GAAG,MAAM,aAAa;CACjD,IAAI;EACF,OAAO,MAAM,6CACX,wBACA,QACA,KACA,MACF;CACF,UAAU;EACR,MAAM,oBAAoB,MAAM;CAClC;AACF;;;;;;;;AA4CA,eAAsB,aAAa,QAAgB,MAA4B;CAC7E,MAAM,aAAa,iBAAiB,MAAM,UAAU,MAAM,UAAU,EAClE,cAAc,KAAA,EAChB,CAAC;CACD,KAAK,MAAM,EAAC,UAAU,WAAU,YAAY,YAAY,IAAI,GAAG;EAC7D,IAAI,CAAC,MAAM,MAAM,GACf;EAEF,MAAM,QAAQ,IAAI,kBAAkB,SAAS,MAAM;EACnD,IAAI;GACF,MAAM,qBAAqB,QAAQ,OAAO,SAAS,IAAI;EACzD,UAAU;GACR,MAAM,oBAAoB,KAAK;EACjC;CACF;AACF;;;;;;;;;;AAWA,SAAgB,iBAAiB,MAG9B;CACD,OAAO,4BAA4B,MAAM,IAAI;AAC/C;;;;;AAMA,eAAsB,sBACpB,WACA,MAIC;CACD,MAAM,aAAa,iBAAiB,MAAM,UAAU,MAAM,UAAU,EAClE,eAAe,KAAA,EACjB,CAAC;CACD,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,SAAoB,CAAC;CAC3B,KAAK,MAAM,EAAC,UAAU,WAAU,YAAY,YAAY,IAAI,GAAG;EAC7D,MAAM,QAAQ,IAAI,kBAAkB,SAAS,MAAM;EACnD,IAAI;GACF,MAAM,YAAY,MAAM,MAAM,aAAa;GAI3C,MAAM,SAAS,MAAM,cAAc,OAHnB,OAAO,OAAO,SAAS,CAAC,CACrC,QAAO,OAAM,UAAU,EAAE,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,CAC7C,KAAI,OAAM,GAAG,IAC0B,GAAS,SAAS,IAAI;GAChE,OAAO,QAAQ,SAAQ,SAAQ,QAAQ,IAAI,IAAI,CAAC;GAChD,OAAO,KAAK,GAAG,OAAO,MAAM;EAC9B,UAAU;GACR,MAAM,oBAAoB,KAAK;EACjC;CACF;CACA,OAAO;EAAC,SAAS,CAAC,GAAG,OAAO;EAAG;CAAM;AACvC;;;;;;;;;;;AAkBA,SAAS,YACP,IACA,MACc;CACd,MAAM,YAAY;CAClB,IAAI,MAAM,YAAY,OACpB,OAAO,CAAC;EAAC,UAAU,mBAAmB,IAAI,KAAK;EAAG,OAAO;CAAG,CAAC;CAE/D,MAAM,UAAwB,CAAC;CAC/B,IAAI,gBAAgB,sBAAsB,CAAC,GACzC,QAAQ,KAAK;EAAC,UAAU;EAAuB,OAAO;CAAe,CAAC;CAExE,QAAQ,KAAK;EAAC,UAAU,mBAAmB,IAAI,MAAM,OAAO;EAAG,OAAO;CAAG,CAAC;CAC1E,OAAO;AACT;;;;;AAMA,SAAS,oBAAoB,OAAgD;CAC3E,OAAO,MAAM,MAAM,CAAC,CAAC,YAAY,KAAA,CAAS;AAC5C;;;;;;AAmBA,SAAS,6CACP,wBACA,QACA,KACA,QAGA;CACA,OAAO,SAAS,QAAQ,OAAM,SAAQ;EAGpC,IAAI,wBAAwB;GAC1B,MAAM,eAAe,MAAM,gBAAgB,IAAI;GAC/C,KAAK,MAAM,eAAe,aAAa,OAAO,GAC5C,IAAI,+BAA+B,WAAW,GAC5C,OAAO,CAAC,KAAK;EAGnB;EAEA,MAAM,UAAU,MAAM,WAAW,IAAI;EAKrC,KAAK,MAAM,GAAG,WAAW,SACvB,IAAI,MAAM,OAAO,uBAAuB,QACtC,OAAO,CAAC,KAAK;EAKjB,MAAM,iBAAyC,CAAC,GAAG,MADd,kBAAkB,IAAI,CACc;EAGzE,KAAK,MAAM,CAAC,UAAU,WAAW,SAC/B,eAAe,KAAK;GAClB;GACA,eAAe,OAAO;EACxB,CAAC;EAIH,OAAO,CAAC,MAAM,cAAc;CAC9B,CAAC;AACH"}

package/out/replicache/src/scan-iterator.js

@@ -1,5 +1,5 @@
-import { asyncIterableToArray } from "./async-iterable-to-array.js";
 import { throwIfClosed } from "./transaction-closed-error.js";
+import { asyncIterableToArray } from "./async-iterable-to-array.js";
 import { isScanIndexOptions, normalizeScanOptionIndexedStartKey } from "./scan-options.js";
 import "./transactions.js";
 import "compare-utf8";

package/out/replicache/src/sync/request-id.js

@@ -1,10 +1,10 @@
-import { getNonCryptoRandomValues } from "../../../shared/src/random-values.js";
+import { getRandomValues } from "../../../shared/src/random-values.js";
 //#region ../replicache/src/sync/request-id.ts
 var sessionID = "";
 function getSessionID() {
 	if (sessionID === "") {
 		const buf = /* @__PURE__ */ new Uint8Array(4);
-		getNonCryptoRandomValues(buf);
+		getRandomValues(buf);
 		sessionID = Array.from(buf, (x) => x.toString(16)).join("");
 	}
 	return sessionID;

package/out/replicache/src/sync/request-id.js.map

@@ -1 +1 @@
-{"version":3,"file":"request-id.js","names":[],"sources":["../../../../../replicache/src/sync/request-id.ts"],"sourcesContent":["import {getNonCryptoRandomValues} from '../../../shared/src/random-values.ts';\nimport type {ClientID} from './ids.ts';\n\nlet sessionID = '';\nfunction getSessionID() {\n  if (sessionID === '') {\n    const buf = new Uint8Array(4);\n    getNonCryptoRandomValues(buf);\n    sessionID = Array.from(buf, x => x.toString(16)).join('');\n  }\n  return sessionID;\n}\n\nconst REQUEST_COUNTERS: Map<string, number> = new Map();\n\n/**\n * Returns a new requestID of the form <client ID>-<session ID>-<request\n * count>. The request count enables one to find the request following or\n * preceding a given request. The sessionid scopes the request count, ensuring\n * the requestID is probabilistically unique across restarts (which is good\n * enough).\n */\nexport function newRequestID(clientID: ClientID): string {\n  const counter = REQUEST_COUNTERS.get(clientID) ?? 0;\n  REQUEST_COUNTERS.set(clientID, counter + 1);\n  return `${clientID}-${getSessionID()}-${counter}`;\n}\n"],"mappings":";;AAGA,IAAI,YAAY;AAChB,SAAS,eAAe;CACtB,IAAI,cAAc,IAAI;EACpB,MAAM,sBAAM,IAAI,WAAW,CAAC;EAC5B,yBAAyB,GAAG;EAC5B,YAAY,MAAM,KAAK,MAAK,MAAK,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;CAC1D;CACA,OAAO;AACT;AAEA,IAAM,mCAAwC,IAAI,IAAI;;;;;;;;AAStD,SAAgB,aAAa,UAA4B;CACvD,MAAM,UAAU,iBAAiB,IAAI,QAAQ,KAAK;CAClD,iBAAiB,IAAI,UAAU,UAAU,CAAC;CAC1C,OAAO,GAAG,SAAS,GAAG,aAAa,EAAE,GAAG;AAC1C"}
+{"version":3,"file":"request-id.js","names":[],"sources":["../../../../../replicache/src/sync/request-id.ts"],"sourcesContent":["import {getRandomValues} from '../../../shared/src/random-values.ts';\nimport type {ClientID} from './ids.ts';\n\nlet sessionID = '';\nfunction getSessionID() {\n  if (sessionID === '') {\n    const buf = new Uint8Array(4);\n    getRandomValues(buf);\n    sessionID = Array.from(buf, x => x.toString(16)).join('');\n  }\n  return sessionID;\n}\n\nconst REQUEST_COUNTERS: Map<string, number> = new Map();\n\n/**\n * Returns a new requestID of the form <client ID>-<session ID>-<request\n * count>. The request count enables one to find the request following or\n * preceding a given request. The sessionid scopes the request count, ensuring\n * the requestID is probabilistically unique across restarts (which is good\n * enough).\n */\nexport function newRequestID(clientID: ClientID): string {\n  const counter = REQUEST_COUNTERS.get(clientID) ?? 0;\n  REQUEST_COUNTERS.set(clientID, counter + 1);\n  return `${clientID}-${getSessionID()}-${counter}`;\n}\n"],"mappings":";;AAGA,IAAI,YAAY;AAChB,SAAS,eAAe;CACtB,IAAI,cAAc,IAAI;EACpB,MAAM,sBAAM,IAAI,WAAW,CAAC;EAC5B,gBAAgB,GAAG;EACnB,YAAY,MAAM,KAAK,MAAK,MAAK,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;CAC1D;CACA,OAAO;AACT;AAEA,IAAM,mCAAwC,IAAI,IAAI;;;;;;;;AAStD,SAAgB,aAAa,UAA4B;CACvD,MAAM,UAAU,iBAAiB,IAAI,QAAQ,KAAK;CAClD,iBAAiB,IAAI,UAAU,UAAU,CAAC;CAC1C,OAAO,GAAG,SAAS,GAAG,aAAa,EAAE,GAAG;AAC1C"}

package/out/shared/src/bigint-json.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bigint-json.d.ts","sourceRoot":"","sources":["../../../../shared/src/bigint-json.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,CAAC,MAAM,aAAa,CAAC;AAYjC,MAAM,MAAM,SAAS,GACjB,IAAI,GACJ,MAAM,GACN,MAAM,GACN,MAAM,GACN,OAAO,GACP,SAAS,SAAS,EAAE,GACpB,UAAU,CAAC;AAEf,MAAM,MAAM,UAAU,GAAG;IAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS,CAAA;CAAC,CAAC;AAE1E,eAAO,MAAM,eAAe,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAY5C,CAAC;AAEH,eAAO,MAAM,gBAAgB,6CAAwC,CAAC;AAUtE;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAsB3D;AAED;;;GAGG;AACH,wBAAgB,KAAK,CACnB,GAAG,EAAE,MAAM,EACX,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,KAAK,OAAO,GAC3C,SAAS,CAIX;AAOD;;;;;;;GAOG;AACH,wBAAgB,SAAS,CACvB,GAAG,EAAE,OAAO,EACZ,QAAQ,CAAC,EACL,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,GACnB,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,KAAK,OAAO,CAAC,GAC1C,IAAI,EACR,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,UAGzB;AAED,eAAO,MAAM,UAAU;;;CAGb,CAAC"}
+{"version":3,"file":"bigint-json.d.ts","sourceRoot":"","sources":["../../../../shared/src/bigint-json.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,CAAC,MAAM,aAAa,CAAC;AAYjC,MAAM,MAAM,SAAS,GACjB,IAAI,GACJ,MAAM,GACN,MAAM,GACN,MAAM,GACN,OAAO,GACP,SAAS,SAAS,EAAE,GACpB,UAAU,CAAC;AAEf,MAAM,MAAM,UAAU,GAAG;IAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS,CAAA;CAAC,CAAC;AAE1E,eAAO,MAAM,eAAe,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAY5C,CAAC;AAEH,eAAO,MAAM,gBAAgB,6CAAwC,CAAC;AAUtE;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAsB3D;AAED;;;GAGG;AACH,wBAAgB,KAAK,CACnB,GAAG,EAAE,MAAM,EACX,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,KAAK,OAAO,GAC3C,SAAS,CAIX;AAcD;;;;;;;GAOG;AACH,wBAAgB,SAAS,CACvB,GAAG,EAAE,OAAO,EACZ,QAAQ,CAAC,EACL,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,GACnB,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,KAAK,OAAO,CAAC,GAC1C,IAAI,EACR,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,UAGzB;AAED,eAAO,MAAM,UAAU;;;CAGb,CAAC"}

package/out/shared/src/bigint-json.js

@@ -51,6 +51,7 @@ function parse$1(str, reviver) {
 }
 function customSerializer(_, v, type) {
 	if (type === "bigint") return v.toString();
+	if (type === "number" && Number.isInteger(v) && !Number.isSafeInteger(v)) return v.toExponential();
 }
 /**
 * Stringifies objects to JSON, supporting objects containing bigint values.

package/out/shared/src/bigint-json.js.map

@@ -1 +1 @@
-{"version":3,"file":"bigint-json.js","names":["v","v.readonly","parse","customParse","stringify","customStringify"],"sources":["../../../../shared/src/bigint-json.ts"],"sourcesContent":["/**\n * Background for using `json-custom-numbers`:\n *\n * https://neon.tech/blog/parsing-json-from-postgres-in-js\n */\nimport {\n  parse as customParse,\n  stringify as customStringify,\n} from 'json-custom-numbers';\nimport * as v from './valita.ts';\n\nfunction numberParser(_: unknown, v: string) {\n  const n = +v;\n  if (n >= Number.MIN_SAFE_INTEGER && n <= Number.MAX_SAFE_INTEGER) return n;\n  if (v.includes('.') || v.includes('e') || v.includes('E')) {\n    return n;\n  }\n  return BigInt(v);\n}\n\n// Variant of postgres.JSONValue adapted to include bigints\nexport type JSONValue =\n  | null\n  | string\n  | number\n  | bigint\n  | boolean\n  | readonly JSONValue[]\n  | JSONObject;\n\nexport type JSONObject = {readonly [prop: string]: JSONValue | undefined};\n\nexport const jsonValueSchema: v.Type<JSONValue> = v.lazy(() => {\n  const jsonObjectSchema = v.readonly(v.record(jsonValueSchema));\n\n  return v.union(\n    v.null(),\n    v.string(),\n    v.number(),\n    v.bigint(),\n    v.boolean(),\n    v.readonly(v.array(jsonValueSchema)),\n    jsonObjectSchema,\n  );\n});\n\nexport const jsonObjectSchema = v.readonly(v.record(jsonValueSchema));\n\n// Integers of up to 15 digits are safe, so only a run of 16 or more digits can\n// be an integer that needs the (much slower) custom number parsing.\nconst UNSAFE_INTEGER_DIGITS = 16;\n\nfunction isDigit(c: number): boolean {\n  return c >= 48 && c <= 57;\n}\n\n/**\n * Whether `str` has a run of 16 or more digits. Every such run covers one of\n * every 16 consecutive indices, so only every 16th char needs to be checked and\n * a digit there is expanded to its full run. This is several times faster than\n * `/\\d{16}/`, which restarts at every digit of a shorter run.\n *\n * A run inside a JSON string also matches; that merely takes the slow path.\n */\nexport function hasUnsafeIntegerDigits(str: string): boolean {\n  const n = str.length;\n  for (let i = UNSAFE_INTEGER_DIGITS - 1; i < n; i += UNSAFE_INTEGER_DIGITS) {\n    if (!isDigit(str.charCodeAt(i))) {\n      continue;\n    }\n    let start = i;\n    while (start > 0 && isDigit(str.charCodeAt(start - 1))) {\n      start--;\n    }\n    let end = i + 1;\n    while (end < n && isDigit(str.charCodeAt(end))) {\n      end++;\n    }\n    if (end - start >= UNSAFE_INTEGER_DIGITS) {\n      return true;\n    }\n    // The next run starts after `end`, and covers one of every 16 indices from\n    // there on.\n    i = end - 1;\n  }\n  return false;\n}\n\n/**\n * Parses JSON strings that may contain arbitrarily large integers. Integers\n * larger than {@link Number.MAX_SAFE_INTEGER} are deserialized as a `bigint`.\n */\nexport function parse(\n  str: string,\n  reviver?: (k: string, v: unknown) => unknown,\n): JSONValue {\n  return hasUnsafeIntegerDigits(str)\n    ? customParse(str, reviver, numberParser)\n    : JSON.parse(str, reviver);\n}\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nfunction customSerializer(_: string, v: any, type: string) {\n  if (type === 'bigint') return v.toString();\n}\n\n/**\n * Stringifies objects to JSON, supporting objects containing bigint values.\n * Note that the resulting JSON string may not be deserializable by\n * all environments, but it is supported by Postgres. The string should be\n * deserialized with the corresponding {@link parse} method that will represent\n * large numbers as bigints. From there it is up to the application to suitably\n * handle bigints passed to downstream logic.\n */\nexport function stringify(\n  obj: unknown,\n  replacer?:\n    | (string | number)[]\n    | ((key: string, value: unknown) => unknown)\n    | null,\n  indent?: string | number,\n) {\n  return customStringify(obj, replacer, indent, customSerializer);\n}\n\nexport const BigIntJSON = {\n  parse,\n  stringify,\n} as const;\n"],"mappings":";;;;;;;;AAWA,SAAS,aAAa,GAAY,GAAW;CAC3C,MAAM,IAAI,CAAC;CACX,IAAI,KAAK,OAAO,oBAAoB,KAAK,OAAO,kBAAkB,OAAO;CACzE,IAAI,EAAE,SAAS,GAAG,KAAK,EAAE,SAAS,GAAG,KAAK,EAAE,SAAS,GAAG,GACtD,OAAO;CAET,OAAO,OAAO,CAAC;AACjB;AAcA,IAAa,kBAAqCA,eAAE,WAAW;CAC7D,MAAM,mBAAmBC,SAAWD,eAAE,OAAO,eAAe,CAAC;CAE7D,OAAOA,eAAE,MACPA,eAAE,KAAK,GACPA,eAAE,OAAO,GACTA,eAAE,OAAO,GACTA,eAAE,OAAO,GACTA,eAAE,QAAQ,GACVC,SAAWD,eAAE,MAAM,eAAe,CAAC,GACnC,gBACF;AACF,CAAC;AAED,IAAa,mBAAmBC,SAAWD,eAAE,OAAO,eAAe,CAAC;AAIpE,IAAM,wBAAwB;AAE9B,SAAS,QAAQ,GAAoB;CACnC,OAAO,KAAK,MAAM,KAAK;AACzB;;;;;;;;;AAUA,SAAgB,uBAAuB,KAAsB;CAC3D,MAAM,IAAI,IAAI;CACd,KAAK,IAAI,IAAI,IAA2B,IAAI,GAAG,KAAK,uBAAuB;EACzE,IAAI,CAAC,QAAQ,IAAI,WAAW,CAAC,CAAC,GAC5B;EAEF,IAAI,QAAQ;EACZ,OAAO,QAAQ,KAAK,QAAQ,IAAI,WAAW,QAAQ,CAAC,CAAC,GACnD;EAEF,IAAI,MAAM,IAAI;EACd,OAAO,MAAM,KAAK,QAAQ,IAAI,WAAW,GAAG,CAAC,GAC3C;EAEF,IAAI,MAAM,SAAS,uBACjB,OAAO;EAIT,IAAI,MAAM;CACZ;CACA,OAAO;AACT;;;;;AAMA,SAAgBE,QACd,KACA,SACW;CACX,OAAO,uBAAuB,GAAG,IAC7BC,MAAY,KAAK,SAAS,YAAY,IACtC,KAAK,MAAM,KAAK,OAAO;AAC7B;AAGA,SAAS,iBAAiB,GAAW,GAAQ,MAAc;CACzD,IAAI,SAAS,UAAU,OAAO,EAAE,SAAS;AAC3C;;;;;;;;;AAUA,SAAgBC,YACd,KACA,UAIA,QACA;CACA,OAAOC,UAAgB,KAAK,UAAU,QAAQ,gBAAgB;AAChE;AAEA,IAAa,aAAa;CACxB,OAAA;CACA,WAAA;AACF"}
+{"version":3,"file":"bigint-json.js","names":["v","v.readonly","parse","customParse","stringify","customStringify"],"sources":["../../../../shared/src/bigint-json.ts"],"sourcesContent":["/**\n * Background for using `json-custom-numbers`:\n *\n * https://neon.tech/blog/parsing-json-from-postgres-in-js\n */\nimport {\n  parse as customParse,\n  stringify as customStringify,\n} from 'json-custom-numbers';\nimport * as v from './valita.ts';\n\nfunction numberParser(_: unknown, v: string) {\n  const n = +v;\n  if (n >= Number.MIN_SAFE_INTEGER && n <= Number.MAX_SAFE_INTEGER) return n;\n  if (v.includes('.') || v.includes('e') || v.includes('E')) {\n    return n;\n  }\n  return BigInt(v);\n}\n\n// Variant of postgres.JSONValue adapted to include bigints\nexport type JSONValue =\n  | null\n  | string\n  | number\n  | bigint\n  | boolean\n  | readonly JSONValue[]\n  | JSONObject;\n\nexport type JSONObject = {readonly [prop: string]: JSONValue | undefined};\n\nexport const jsonValueSchema: v.Type<JSONValue> = v.lazy(() => {\n  const jsonObjectSchema = v.readonly(v.record(jsonValueSchema));\n\n  return v.union(\n    v.null(),\n    v.string(),\n    v.number(),\n    v.bigint(),\n    v.boolean(),\n    v.readonly(v.array(jsonValueSchema)),\n    jsonObjectSchema,\n  );\n});\n\nexport const jsonObjectSchema = v.readonly(v.record(jsonValueSchema));\n\n// Integers of up to 15 digits are safe, so only a run of 16 or more digits can\n// be an integer that needs the (much slower) custom number parsing.\nconst UNSAFE_INTEGER_DIGITS = 16;\n\nfunction isDigit(c: number): boolean {\n  return c >= 48 && c <= 57;\n}\n\n/**\n * Whether `str` has a run of 16 or more digits. Every such run covers one of\n * every 16 consecutive indices, so only every 16th char needs to be checked and\n * a digit there is expanded to its full run. This is several times faster than\n * `/\\d{16}/`, which restarts at every digit of a shorter run.\n *\n * A run inside a JSON string also matches; that merely takes the slow path.\n */\nexport function hasUnsafeIntegerDigits(str: string): boolean {\n  const n = str.length;\n  for (let i = UNSAFE_INTEGER_DIGITS - 1; i < n; i += UNSAFE_INTEGER_DIGITS) {\n    if (!isDigit(str.charCodeAt(i))) {\n      continue;\n    }\n    let start = i;\n    while (start > 0 && isDigit(str.charCodeAt(start - 1))) {\n      start--;\n    }\n    let end = i + 1;\n    while (end < n && isDigit(str.charCodeAt(end))) {\n      end++;\n    }\n    if (end - start >= UNSAFE_INTEGER_DIGITS) {\n      return true;\n    }\n    // The next run starts after `end`, and covers one of every 16 indices from\n    // there on.\n    i = end - 1;\n  }\n  return false;\n}\n\n/**\n * Parses JSON strings that may contain arbitrarily large integers. Integers\n * larger than {@link Number.MAX_SAFE_INTEGER} are deserialized as a `bigint`.\n */\nexport function parse(\n  str: string,\n  reviver?: (k: string, v: unknown) => unknown,\n): JSONValue {\n  return hasUnsafeIntegerDigits(str)\n    ? customParse(str, reviver, numberParser)\n    : JSON.parse(str, reviver);\n}\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nfunction customSerializer(_: string, v: any, type: string) {\n  if (type === 'bigint') return v.toString();\n  // An integer beyond the safe range is a rounded double if it is a number, so\n  // it is written in a form that parse() keeps as a number. As digits it would\n  // come back as a bigint, and not even the same value, since a double prints\n  // only the digits that identify it: 2^62 is 4611686018427388000.\n  if (type === 'number' && Number.isInteger(v) && !Number.isSafeInteger(v)) {\n    return v.toExponential();\n  }\n}\n\n/**\n * Stringifies objects to JSON, supporting objects containing bigint values.\n * Note that the resulting JSON string may not be deserializable by\n * all environments, but it is supported by Postgres. The string should be\n * deserialized with the corresponding {@link parse} method that will represent\n * large numbers as bigints. From there it is up to the application to suitably\n * handle bigints passed to downstream logic.\n */\nexport function stringify(\n  obj: unknown,\n  replacer?:\n    | (string | number)[]\n    | ((key: string, value: unknown) => unknown)\n    | null,\n  indent?: string | number,\n) {\n  return customStringify(obj, replacer, indent, customSerializer);\n}\n\nexport const BigIntJSON = {\n  parse,\n  stringify,\n} as const;\n"],"mappings":";;;;;;;;AAWA,SAAS,aAAa,GAAY,GAAW;CAC3C,MAAM,IAAI,CAAC;CACX,IAAI,KAAK,OAAO,oBAAoB,KAAK,OAAO,kBAAkB,OAAO;CACzE,IAAI,EAAE,SAAS,GAAG,KAAK,EAAE,SAAS,GAAG,KAAK,EAAE,SAAS,GAAG,GACtD,OAAO;CAET,OAAO,OAAO,CAAC;AACjB;AAcA,IAAa,kBAAqCA,eAAE,WAAW;CAC7D,MAAM,mBAAmBC,SAAWD,eAAE,OAAO,eAAe,CAAC;CAE7D,OAAOA,eAAE,MACPA,eAAE,KAAK,GACPA,eAAE,OAAO,GACTA,eAAE,OAAO,GACTA,eAAE,OAAO,GACTA,eAAE,QAAQ,GACVC,SAAWD,eAAE,MAAM,eAAe,CAAC,GACnC,gBACF;AACF,CAAC;AAED,IAAa,mBAAmBC,SAAWD,eAAE,OAAO,eAAe,CAAC;AAIpE,IAAM,wBAAwB;AAE9B,SAAS,QAAQ,GAAoB;CACnC,OAAO,KAAK,MAAM,KAAK;AACzB;;;;;;;;;AAUA,SAAgB,uBAAuB,KAAsB;CAC3D,MAAM,IAAI,IAAI;CACd,KAAK,IAAI,IAAI,IAA2B,IAAI,GAAG,KAAK,uBAAuB;EACzE,IAAI,CAAC,QAAQ,IAAI,WAAW,CAAC,CAAC,GAC5B;EAEF,IAAI,QAAQ;EACZ,OAAO,QAAQ,KAAK,QAAQ,IAAI,WAAW,QAAQ,CAAC,CAAC,GACnD;EAEF,IAAI,MAAM,IAAI;EACd,OAAO,MAAM,KAAK,QAAQ,IAAI,WAAW,GAAG,CAAC,GAC3C;EAEF,IAAI,MAAM,SAAS,uBACjB,OAAO;EAIT,IAAI,MAAM;CACZ;CACA,OAAO;AACT;;;;;AAMA,SAAgBE,QACd,KACA,SACW;CACX,OAAO,uBAAuB,GAAG,IAC7BC,MAAY,KAAK,SAAS,YAAY,IACtC,KAAK,MAAM,KAAK,OAAO;AAC7B;AAGA,SAAS,iBAAiB,GAAW,GAAQ,MAAc;CACzD,IAAI,SAAS,UAAU,OAAO,EAAE,SAAS;CAKzC,IAAI,SAAS,YAAY,OAAO,UAAU,CAAC,KAAK,CAAC,OAAO,cAAc,CAAC,GACrE,OAAO,EAAE,cAAc;AAE3B;;;;;;;;;AAUA,SAAgBC,YACd,KACA,UAIA,QACA;CACA,OAAOC,UAAgB,KAAK,UAAU,QAAQ,gBAAgB;AAChE;AAEA,IAAa,aAAa;CACxB,OAAA;CACA,WAAA;AACF"}

package/out/shared/src/btree-set.d.ts

@@ -30,6 +30,27 @@ export declare class BTreeSet<K> {
     valuesReversed(): IterableIterator<K>;
     valuesFromReversed(highestKey?: K, inclusive?: boolean): IterableIterator<K>;
     [Symbol.iterator](): IterableIterator<K>;
+    /**
+     * Returns every key, in order, as a fresh array the caller owns (sorting it
+     * in place is safe).
+     *
+     * This is the inverse of `fromSorted`: it collects the leaves' `keys` arrays
+     * and joins them with `concat`, instead of yielding one key at a time. Every
+     * key the iterator yields pays for a `next()` call that walks a node queue
+     * and allocates a result object, and on an interpreter that is not something
+     * a JS loop can win back -- the work has to happen in native code.
+     *
+     * Measured on an Android emulator (Hermes, release), 90,000 rows per call:
+     * 5.76ms through the iterator, 1.73ms for a per-element JS copy loop into a
+     * pre-sized array, 0.56ms for this. So a JS loop buys 3.3x and native copying
+     * 10x; at 30,000 rows, where the join is a single round, it is 20x. V8 JITs
+     * such a loop to near-memcpy, so the choice barely registers there and is
+     * worth 3x on a phone.
+     *
+     * Complexity: O(size). Nothing collected is mutated, so shared/cloned nodes
+     * are safe, and the arrays are copied rather than handed out.
+     */
+    toArray(): K[];
     /**
      * Builds a BTreeSet from a pre-sorted iterable in O(N) by constructing
      * the tree bottom-up. The caller must ensure entries are sorted by

package/out/shared/src/btree-set.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"btree-set.d.ts","sourceRoot":"","sources":["../../../../shared/src/btree-set.ts"],"names":[],"mappings":"AAIA,KAAK,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;AAE5C,qBAAa,QAAQ,CAAC,CAAC;;IAErB,IAAI,EAAE,MAAM,CAAK;IAEjB,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;IAEnC,YAAY,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAOnE;IAED,+CAA+C;IAC/C,KAAK,SAGJ;IAED,KAAK,gBAMJ;IAED,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAEzB;IAED,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAOhB;IAED;;;;;;OAMG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAEnB;IAED;;;;;OAKG;IACH,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAEtB;IAuBD,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAE1B;IAED,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAE5B;IAED,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,SAAS,GAAE,OAAc,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAExE;IAED,cAAc,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAQpC;IAED,kBAAkB,CAChB,UAAU,CAAC,EAAE,CAAC,EACd,SAAS,GAAE,OAAc,GACxB,gBAAgB,CAAC,CAAC,CAAC,CAQrB;IAOD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAEvC;IAED;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,CAAC,EACjB,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,EACzB,aAAa,EAAE,QAAQ,CAAC,CAAC,CAAC,GACzB,QAAQ,CAAC,CAAC,CAAC,CA4Cb;CACF"}
+{"version":3,"file":"btree-set.d.ts","sourceRoot":"","sources":["../../../../shared/src/btree-set.ts"],"names":[],"mappings":"AAoBA,KAAK,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;AAE5C,qBAAa,QAAQ,CAAC,CAAC;;IAErB,IAAI,EAAE,MAAM,CAAK;IAEjB,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;IAEnC,YAAY,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAOnE;IAED,+CAA+C;IAC/C,KAAK,SAGJ;IAED,KAAK,gBAMJ;IAED,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAEzB;IAED,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAOhB;IAED;;;;;;OAMG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAEnB;IAED;;;;;OAKG;IACH,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAEtB;IAuBD,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAE1B;IAED,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAE5B;IAED,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,SAAS,GAAE,OAAc,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAExE;IAED,cAAc,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAQpC;IAED,kBAAkB,CAChB,UAAU,CAAC,EAAE,CAAC,EACd,SAAS,GAAE,OAAc,GACxB,gBAAgB,CAAC,CAAC,CAAC,CAQrB;IAOD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAEvC;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACH,OAAO,IAAI,CAAC,EAAE,CAuBb;IAED;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,CAAC,EACjB,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,EACzB,aAAa,EAAE,QAAQ,CAAC,CAAC,CAAC,GACzB,QAAQ,CAAC,CAAC,CAAC,CA4Cb;CACF"}

package/out/shared/src/btree-set.js

@@ -1,6 +1,15 @@
 import { assert } from "./asserts.js";
 //#region ../shared/src/btree-set.ts
 var MAX_NODE_SIZE = 32;
+/**
+* How many arrays `toArray` hands `concat` at once. Engines cap how many
+* arguments a call may spread, so the join is chunked rather than passing one
+* argument per leaf.
+*/
+var CONCAT_CHUNK = 1024;
+function concatAll(arrays) {
+	return [].concat(...arrays);
+}
 var BTreeSet = class BTreeSet {
 	#root = emptyLeaf;
 	size = 0;
@@ -87,6 +96,39 @@ var BTreeSet = class BTreeSet {
 		return this.keys();
 	}
 	/**
+	* Returns every key, in order, as a fresh array the caller owns (sorting it
+	* in place is safe).
+	*
+	* This is the inverse of `fromSorted`: it collects the leaves' `keys` arrays
+	* and joins them with `concat`, instead of yielding one key at a time. Every
+	* key the iterator yields pays for a `next()` call that walks a node queue
+	* and allocates a result object, and on an interpreter that is not something
+	* a JS loop can win back -- the work has to happen in native code.
+	*
+	* Measured on an Android emulator (Hermes, release), 90,000 rows per call:
+	* 5.76ms through the iterator, 1.73ms for a per-element JS copy loop into a
+	* pre-sized array, 0.56ms for this. So a JS loop buys 3.3x and native copying
+	* 10x; at 30,000 rows, where the join is a single round, it is 20x. V8 JITs
+	* such a loop to near-memcpy, so the choice barely registers there and is
+	* worth 3x on a phone.
+	*
+	* Complexity: O(size). Nothing collected is mutated, so shared/cloned nodes
+	* are safe, and the arrays are copied rather than handed out.
+	*/
+	toArray() {
+		const root = this.#root;
+		if (!root.isInternal()) return root.keys.slice();
+		const leaves = [];
+		root.collectLeafKeys(leaves);
+		let level = leaves;
+		while (level.length > 1) {
+			const next = [];
+			for (let i = 0; i < level.length; i += CONCAT_CHUNK) next.push(concatAll(level.slice(i, i + CONCAT_CHUNK)));
+			level = next;
+		}
+		return level[0] ?? [];
+	}
+	/**
 	* Builds a BTreeSet from a pre-sorted iterable in O(N) by constructing
 	* the tree bottom-up. The caller must ensure entries are sorted by
 	* `comparator`; violating this produces an invalid tree.
@@ -268,6 +310,14 @@ var BNode = class BNode {
 	clone() {
 		return new BNode(this.keys.slice(0));
 	}
+	/**
+	* Appends this node's `keys` arrays, in order, to `out`. Read-only: the
+	* arrays are not copied here and must not be mutated by the caller, which is
+	* why `toArray` only ever passes them to `concat`.
+	*/
+	collectLeafKeys(out) {
+		out.push(this.keys);
+	}
 	get(key, tree) {
 		const i = indexOf(key, this.keys, -1, tree.comparator);
 		return i < 0 ? void 0 : this.keys[i];
@@ -352,6 +402,10 @@ var BNodeInternal = class BNodeInternal extends BNode {
 	minKey() {
 		return this.children[0].minKey();
 	}
+	collectLeafKeys(out) {
+		const { children } = this;
+		for (let i = 0; i < children.length; i++) children[i].collectLeafKeys(out);
+	}
 	get(key, tree) {
 		const i = indexOf(key, this.keys, 0, tree.comparator);
 		const { children } = this;

package/out/shared/src/btree-set.js.map

@@ -1 +1 @@
-{"version":3,"file":"btree-set.js","names":[],"sources":["../../../../shared/src/btree-set.ts"],"sourcesContent":["import {assert} from './asserts.ts';\n\nconst MAX_NODE_SIZE = 32;\n\ntype Comparator<K> = (a: K, b: K) => number;\n\nexport class BTreeSet<K> {\n  #root: BNode<K> = emptyLeaf as BNode<K>;\n  size: number = 0;\n\n  readonly comparator: Comparator<K>;\n\n  constructor(comparator: Comparator<K>, entries?: IterableIterator<K>) {\n    this.comparator = comparator;\n    if (entries) {\n      for (const key of entries) {\n        this.add(key);\n      }\n    }\n  }\n\n  /** Releases the tree so that its size is 0. */\n  clear() {\n    this.#root = emptyLeaf as BNode<K>;\n    this.size = 0;\n  }\n\n  clone() {\n    this.#root.isShared = true;\n    const ret = new BTreeSet<K>(this.comparator);\n    ret.#root = this.#root;\n    ret.size = this.size;\n    return ret;\n  }\n\n  get(key: K): K | undefined {\n    return this.#root.get(key, this);\n  }\n\n  add(key: K): this {\n    if (this.#root.isShared) this.#root = this.#root.clone();\n    const result = this.#root.set(key, this);\n    if (result === null) return this;\n    // Root node has split, so create a new root node.\n    this.#root = new BNodeInternal<K>([this.#root, result]);\n    return this;\n  }\n\n  /**\n   * Returns true if the key exists in the B+ tree, false if not.\n   * Use get() for best performance; use has() if you need to\n   * distinguish between \"undefined value\" and \"key not present\".\n   * @param key Key to detect\n   * @description Computational complexity: O(log size)\n   */\n  has(key: K): boolean {\n    return this.#root.has(key, this);\n  }\n\n  /**\n   * Removes a single key-value pair from the B+ tree.\n   * @param key Key to find\n   * @returns true if a pair was found and removed, false otherwise.\n   * @description Computational complexity: O(log size)\n   */\n  delete(key: K): boolean {\n    return this.#delete(key);\n  }\n\n  #delete(key: K): boolean {\n    let root = this.#root;\n    if (root.isShared) {\n      this.#root = root = root.clone();\n    }\n    try {\n      return root.delete(key, this);\n    } finally {\n      let isShared;\n      while (root.keys.length <= 1 && root.isInternal()) {\n        isShared ||= root.isShared;\n        this.#root = root =\n          root.keys.length === 0 ? emptyLeaf : root.children[0];\n      }\n      // If any ancestor of the new root was shared, the new root must also be shared\n      if (isShared) {\n        root.isShared = true;\n      }\n    }\n  }\n\n  keys(): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, undefined, true);\n  }\n\n  values(): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, undefined, true);\n  }\n\n  valuesFrom(lowestKey?: K, inclusive: boolean = true): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, lowestKey, inclusive);\n  }\n\n  valuesReversed(): IterableIterator<K> {\n    return valuesFromReversed(\n      this.#maxKey(),\n      this.#root,\n      this.comparator,\n      undefined,\n      true,\n    );\n  }\n\n  valuesFromReversed(\n    highestKey?: K,\n    inclusive: boolean = true,\n  ): IterableIterator<K> {\n    return valuesFromReversed(\n      this.#maxKey(),\n      this.#root,\n      this.comparator,\n      highestKey,\n      inclusive,\n    );\n  }\n\n  /** Gets the highest key in the tree. Complexity: O(1) */\n  #maxKey(): K | undefined {\n    return this.#root.maxKey();\n  }\n\n  [Symbol.iterator](): IterableIterator<K> {\n    return this.keys();\n  }\n\n  /**\n   * Builds a BTreeSet from a pre-sorted iterable in O(N) by constructing\n   * the tree bottom-up. The caller must ensure entries are sorted by\n   * `comparator`; violating this produces an invalid tree.\n   */\n  static fromSorted<K>(\n    comparator: Comparator<K>,\n    sortedEntries: Iterable<K>,\n  ): BTreeSet<K> {\n    const tree = new BTreeSet<K>(comparator);\n\n    // Stream through entries, flushing a leaf node each time we fill MAX_NODE_SIZE keys.\n    const leaves: BNode<K>[] = [];\n    let currentKeys: K[] = [];\n    let size = 0;\n\n    for (const key of sortedEntries) {\n      currentKeys.push(key);\n      if (currentKeys.length === MAX_NODE_SIZE) {\n        leaves.push(new BNode<K>(currentKeys));\n        currentKeys = [];\n      }\n      size++;\n    }\n\n    if (currentKeys.length > 0) {\n      leaves.push(new BNode<K>(currentKeys));\n    }\n\n    if (leaves.length === 0) return tree;\n\n    tree.size = size;\n\n    if (leaves.length === 1) {\n      tree.#root = leaves[0];\n      return tree;\n    }\n\n    // Build internal nodes bottom-up until a single root remains.\n    let currentLevel: BNode<K>[] = leaves;\n    while (currentLevel.length > 1) {\n      const nextLevel: BNodeInternal<K>[] = [];\n      for (let i = 0; i < currentLevel.length; i += MAX_NODE_SIZE) {\n        nextLevel.push(\n          new BNodeInternal<K>(currentLevel.slice(i, i + MAX_NODE_SIZE)),\n        );\n      }\n      currentLevel = nextLevel;\n    }\n\n    tree.#root = currentLevel[0];\n    return tree;\n  }\n}\n\nclass BTreeForwardIterator<K> implements IterableIterator<K> {\n  readonly #nodeQueue: BNode<K>[][];\n  readonly #nodeIndex: number[];\n  #leaf: BNode<K>;\n  #i: number;\n\n  constructor(\n    nodeQueue: BNode<K>[][],\n    nodeIndex: number[],\n    leaf: BNode<K>,\n    startI: number,\n  ) {\n    this.#nodeQueue = nodeQueue;\n    this.#nodeIndex = nodeIndex;\n    this.#leaf = leaf;\n    this.#i = startI;\n  }\n\n  next(): IteratorResult<K> {\n    for (;;) {\n      if (++this.#i < this.#leaf.keys.length) {\n        return {done: false, value: this.#leaf.keys[this.#i]};\n      }\n\n      let level = -1;\n      for (;;) {\n        if (++level >= this.#nodeQueue.length) {\n          return {done: true, value: undefined as unknown as K};\n        }\n        if (++this.#nodeIndex[level] < this.#nodeQueue[level].length) {\n          break;\n        }\n      }\n      for (; level > 0; level--) {\n        this.#nodeQueue[level - 1] = (\n          this.#nodeQueue[level][this.#nodeIndex[level]] as BNodeInternal<K>\n        ).children;\n        this.#nodeIndex[level - 1] = 0;\n      }\n      this.#leaf = this.#nodeQueue[0][this.#nodeIndex[0]];\n      this.#i = -1;\n    }\n  }\n\n  [Symbol.iterator]() {\n    return this;\n  }\n}\n\nclass BTreeReverseIterator<K> implements IterableIterator<K> {\n  readonly #nodeQueue: BNode<K>[][];\n  readonly #nodeIndex: number[];\n  #leaf: BNode<K>;\n  #i: number;\n\n  constructor(\n    nodeQueue: BNode<K>[][],\n    nodeIndex: number[],\n    leaf: BNode<K>,\n    startI: number,\n  ) {\n    this.#nodeQueue = nodeQueue;\n    this.#nodeIndex = nodeIndex;\n    this.#leaf = leaf;\n    this.#i = startI;\n  }\n\n  next(): IteratorResult<K> {\n    for (;;) {\n      if (--this.#i >= 0) {\n        return {done: false, value: this.#leaf.keys[this.#i]};\n      }\n\n      let level;\n      // Advance to the next leaf node\n      for (level = -1; ;) {\n        if (++level >= this.#nodeQueue.length) {\n          return {done: true, value: undefined as unknown as K};\n        }\n        if (--this.#nodeIndex[level] >= 0) {\n          break;\n        }\n      }\n      for (; level > 0; level--) {\n        this.#nodeQueue[level - 1] = (\n          this.#nodeQueue[level][this.#nodeIndex[level]] as BNodeInternal<K>\n        ).children;\n        this.#nodeIndex[level - 1] = this.#nodeQueue[level - 1].length - 1;\n      }\n      this.#leaf = this.#nodeQueue[0][this.#nodeIndex[0]];\n      this.#i = this.#leaf.keys.length;\n    }\n  }\n\n  [Symbol.iterator]() {\n    return this;\n  }\n}\n\nfunction valuesFrom<K>(\n  root: BNode<K>,\n  comparator: Comparator<K>,\n  lowestKey: K | undefined,\n  inclusive: boolean,\n): IterableIterator<K> {\n  const info = findPath(lowestKey, root, comparator);\n  if (info === undefined) {\n    return iterator<K>(() => ({done: true, value: undefined}));\n  }\n\n  let [nodeQueue, nodeIndex, leaf] = info;\n  let i =\n    lowestKey === undefined\n      ? -1\n      : indexOf(lowestKey, leaf.keys, 0, comparator) - 1;\n\n  if (\n    !inclusive &&\n    lowestKey !== undefined &&\n    // +1 because we did -1 above.\n    i + 1 < leaf.keys.length &&\n    comparator(leaf.keys[i + 1], lowestKey) === 0\n  ) {\n    i++;\n  }\n\n  return new BTreeForwardIterator(nodeQueue, nodeIndex, leaf, i);\n}\n\nfunction valuesFromReversed<K>(\n  maxKey: K | undefined,\n  root: BNode<K>,\n  comparator: Comparator<K>,\n  highestKey: K | undefined,\n  inclusive: boolean,\n): IterableIterator<K> {\n  if (highestKey === undefined) {\n    highestKey = maxKey;\n    if (highestKey === undefined) {\n      return iterator<K>(() => ({done: true, value: undefined}));\n    } // collection is empty\n  }\n  let [nodeQueue, nodeIndex, leaf] =\n    findPath(highestKey, root, comparator) ||\n    findPath(maxKey, root, comparator)!;\n  assert(\n    !nodeQueue[0] || leaf === nodeQueue[0][nodeIndex[0]],\n    'BTreeSet: leaf node mismatch in iteration',\n  );\n  let i = indexOf(highestKey, leaf.keys, 0, comparator);\n  if (\n    inclusive &&\n    i < leaf.keys.length &&\n    comparator(leaf.keys[i], highestKey) <= 0\n  ) {\n    i++;\n  }\n\n  return new BTreeReverseIterator(nodeQueue, nodeIndex, leaf, i);\n}\n\nfunction findPath<K>(\n  key: K | undefined,\n  root: BNode<K>,\n  comparator: Comparator<K>,\n): [nodeQueue: BNode<K>[][], nodeIndex: number[], leaf: BNode<K>] | undefined {\n  let nextNode = root;\n  const nodeQueue: BNode<K>[][] = [];\n  const nodeIndex: number[] = [];\n\n  if (nextNode.isInternal()) {\n    for (let d = 0; nextNode.isInternal(); d++) {\n      nodeQueue[d] = nextNode.children;\n      nodeIndex[d] =\n        key === undefined ? 0 : indexOf(key, nextNode.keys, 0, comparator);\n      if (nodeIndex[d] >= nodeQueue[d].length) return; // first key > maxKey()\n      nextNode = nodeQueue[d][nodeIndex[d]];\n    }\n    nodeQueue.reverse();\n    nodeIndex.reverse();\n  }\n  return [nodeQueue, nodeIndex, nextNode];\n}\n\nfunction iterator<T>(next: () => IteratorResult<T>): IterableIterator<T> {\n  return {\n    next,\n    [Symbol.iterator]() {\n      return this;\n    },\n  };\n}\n\n/** Leaf node / base class. **************************************************/\nclass BNode<K> {\n  // If this is an internal node, _keys[i] is the highest key in children[i].\n  keys: K[];\n  // True if this node might be within multiple `BTree`s (or have multiple parents).\n  // If so, it must be cloned before being mutated to avoid changing an unrelated tree.\n  // This is transitive: if it's true, children are also shared even if `isShared!=true`\n  // in those children. (Certain operations will propagate isShared=true to children.)\n  isShared: true | undefined;\n\n  constructor(keys: K[]) {\n    this.keys = keys;\n    this.isShared = undefined;\n  }\n\n  isInternal(): this is BNodeInternal<K> {\n    return false;\n  }\n\n  maxKey() {\n    // oxlint-disable-next-line typescript/no-non-null-assertion\n    return this.keys.at(-1)!;\n  }\n\n  minKey(): K | undefined {\n    return this.keys[0];\n  }\n\n  clone(): BNode<K> {\n    return new BNode<K>(this.keys.slice(0));\n  }\n\n  get(key: K, tree: BTreeSet<K>): K | undefined {\n    const i = indexOf(key, this.keys, -1, tree.comparator);\n    return i < 0 ? undefined : this.keys[i];\n  }\n\n  has(key: K, tree: BTreeSet<K>): boolean {\n    const i = indexOf(key, this.keys, -1, tree.comparator);\n    return i >= 0 && i < this.keys.length;\n  }\n\n  set(key: K, tree: BTreeSet<K>): null | BNode<K> {\n    let i = indexOf(key, this.keys, -1, tree.comparator);\n    if (i < 0) {\n      // key does not exist yet\n      i = ~i;\n      tree.size++;\n\n      if (this.keys.length < MAX_NODE_SIZE) {\n        this.keys.splice(i, 0, key);\n        return null;\n      }\n      // This leaf node is full and must split\n      const newRightSibling = this.splitOffRightSide();\n      // oxlint-disable-next-line @typescript-eslint/no-this-alias\n      let target: BNode<K> = this;\n      if (i > this.keys.length) {\n        i -= this.keys.length;\n        target = newRightSibling;\n      }\n      // target.#insertInLeaf(i, key);\n      target.keys.splice(i, 0, key);\n\n      return newRightSibling;\n    }\n\n    // usually this is a no-op, but some users may wish to edit the key\n    this.keys[i] = key;\n    return null;\n  }\n\n  takeFromRight(rhs: BNode<K>) {\n    this.keys.push(rhs.keys.shift()!);\n  }\n\n  takeFromLeft(lhs: BNode<K>) {\n    this.keys.unshift(lhs.keys.pop()!);\n  }\n\n  splitOffRightSide(): BNode<K> {\n    const half = this.keys.length >> 1;\n    const keys = this.keys.splice(half);\n    return new BNode<K>(keys);\n  }\n\n  delete(key: K, tree: BTreeSet<K>): boolean {\n    const cmp = tree.comparator;\n    const iLow = indexOf(key, this.keys, -1, cmp);\n    const iHigh = iLow + 1;\n\n    if (iLow < 0) {\n      return false;\n    }\n\n    const {keys} = this;\n    for (let i = iLow; i < iHigh; i++) {\n      const key = keys[i];\n\n      if (key !== keys[i] || this.isShared === true) {\n        throw new Error('BTree illegally changed or cloned in delete');\n      }\n\n      this.keys.splice(i, 1);\n      tree.size--;\n      return true;\n    }\n\n    return false;\n  }\n\n  mergeSibling(rhs: BNode<K>, _: number) {\n    this.keys.push(...rhs.keys);\n  }\n}\n\n/** Internal node (non-leaf node) ********************************************/\nclass BNodeInternal<K> extends BNode<K> {\n  // Note: conventionally B+ trees have one fewer key than the number of\n  // children, but I find it easier to keep the array lengths equal: each\n  // keys[i] caches the value of children[i].maxKey().\n  children: BNode<K>[];\n\n  /**\n   * This does not mark `children` as shared, so it is the responsibility of the caller\n   * to ensure children are either marked shared, or aren't included in another tree.\n   */\n  constructor(children: BNode<K>[], keys?: K[]) {\n    if (!keys) {\n      keys = [];\n      for (let i = 0; i < children.length; i++) {\n        keys[i] = children[i].maxKey();\n      }\n    }\n    super(keys);\n    this.children = children;\n  }\n\n  isInternal(): this is BNodeInternal<K> {\n    return true;\n  }\n\n  clone(): BNode<K> {\n    const children = this.children.slice(0);\n    for (let i = 0; i < children.length; i++) {\n      children[i].isShared = true;\n    }\n    return new BNodeInternal<K>(children, this.keys.slice(0));\n  }\n\n  minKey() {\n    return this.children[0].minKey();\n  }\n\n  get(key: K, tree: BTreeSet<K>): K | undefined {\n    const i = indexOf(key, this.keys, 0, tree.comparator);\n    const {children} = this;\n    return i < children.length ? children[i].get(key, tree) : undefined;\n  }\n\n  has(key: K, tree: BTreeSet<K>): boolean {\n    const i = indexOf(key, this.keys, 0, tree.comparator);\n    const {children} = this;\n    return i < children.length ? children[i].has(key, tree) : false;\n  }\n\n  set(key: K, tree: BTreeSet<K>): null | BNode<K> {\n    const c = this.children;\n    const cmp = tree.comparator;\n    let i = Math.min(indexOf(key, this.keys, 0, cmp), c.length - 1);\n    let child = c[i];\n\n    if (child.isShared) {\n      c[i] = child = child.clone();\n    }\n    if (child.keys.length >= MAX_NODE_SIZE) {\n      // child is full; inserting anything else will cause a split.\n      // Shifting an item to the left or right sibling may avoid a split.\n      // We can do a shift if the adjacent node is not full and if the\n      // current key can still be placed in the same node after the shift.\n      let other: BNode<K>;\n      if (\n        i > 0 &&\n        (other = c[i - 1]).keys.length < MAX_NODE_SIZE &&\n        cmp(child.keys[0], key) < 0\n      ) {\n        if (other.isShared) {\n          c[i - 1] = other = other.clone();\n        }\n        other.takeFromRight(child);\n        this.keys[i - 1] = other.maxKey();\n      } else if (\n        (other = c[i + 1]) !== undefined &&\n        other.keys.length < MAX_NODE_SIZE &&\n        cmp(child.maxKey(), key) < 0\n      ) {\n        if (other.isShared) c[i + 1] = other = other.clone();\n        other.takeFromLeft(child);\n        this.keys[i] = c[i].maxKey();\n      }\n    }\n\n    const result = child.set(key, tree);\n    this.keys[i] = child.maxKey();\n    if (result === null) return null;\n\n    // The child has split and `result` is a new right child... does it fit?\n    if (this.keys.length < MAX_NODE_SIZE) {\n      // yes\n      this.insert(i + 1, result);\n      return null;\n    }\n    // no, we must split also\n    const newRightSibling = this.splitOffRightSide();\n    // oxlint-disable-next-line @typescript-eslint/no-this-alias\n    let target: BNodeInternal<K> = this;\n    if (cmp(result.maxKey(), this.maxKey()) > 0) {\n      target = newRightSibling;\n      i -= this.keys.length;\n    }\n    target.insert(i + 1, result);\n    return newRightSibling;\n  }\n\n  /**\n   * Inserts `child` at index `i`.\n   * This does not mark `child` as shared, so it is the responsibility of the caller\n   * to ensure that either child is marked shared, or it is not included in another tree.\n   */\n  insert(i: number, child: BNode<K>) {\n    this.children.splice(i, 0, child);\n    this.keys.splice(i, 0, child.maxKey());\n  }\n\n  /**\n   * Split this node.\n   * Modifies this to remove the second half of the items, returning a separate node containing them.\n   */\n  splitOffRightSide() {\n    const half = this.children.length >> 1;\n    return new BNodeInternal<K>(\n      this.children.splice(half),\n      this.keys.splice(half),\n    );\n  }\n\n  takeFromRight(rhs: BNode<K>) {\n    this.keys.push(rhs.keys.shift()!);\n    this.children.push((rhs as BNodeInternal<K>).children.shift()!);\n  }\n\n  takeFromLeft(lhs: BNode<K>) {\n    this.keys.unshift(lhs.keys.pop()!);\n    this.children.unshift((lhs as BNodeInternal<K>).children.pop()!);\n  }\n\n  delete(key: K, tree: BTreeSet<K>): boolean {\n    const cmp = tree.comparator;\n    const {keys} = this;\n    const {children} = this;\n    let iLow = indexOf(key, this.keys, 0, cmp);\n    let i = iLow;\n    const iHigh = Math.min(iLow, keys.length - 1);\n    if (i <= iHigh) {\n      try {\n        if (children[i].isShared) {\n          children[i] = children[i].clone();\n        }\n        const result = children[i].delete(key, tree);\n        // Note: if children[i] is empty then keys[i]=undefined.\n        //       This is an invalid state, but it is fixed below.\n        keys[i] = children[i].maxKey();\n        return result;\n      } finally {\n        // Deletions may have occurred, so look for opportunities to merge nodes.\n        const half = MAX_NODE_SIZE >> 1;\n        if (iLow > 0) iLow--;\n        for (i = iHigh; i >= iLow; i--) {\n          if (children[i].keys.length <= half) {\n            if (children[i].keys.length !== 0) {\n              this.tryMerge(i, MAX_NODE_SIZE);\n            } else {\n              // child is empty! delete it!\n              keys.splice(i, 1);\n              children.splice(i, 1);\n            }\n          }\n        }\n      }\n    }\n    return false;\n  }\n\n  /** Merges child i with child i+1 if their combined size is not too large */\n  tryMerge(i: number, maxSize: number): boolean {\n    const {children} = this;\n    if (i >= 0 && i + 1 < children.length) {\n      if (children[i].keys.length + children[i + 1].keys.length <= maxSize) {\n        if (\n          children[i].isShared\n        ) // cloned already UNLESS i is outside scan range\n        {\n          children[i] = children[i].clone();\n        }\n        children[i].mergeSibling(children[i + 1], maxSize);\n        children.splice(i + 1, 1);\n        this.keys.splice(i + 1, 1);\n        this.keys[i] = children[i].maxKey();\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Move children from `rhs` into this.\n   * `rhs` must be part of this tree, and be removed from it after this call\n   * (otherwise isShared for its children could be incorrect).\n   */\n  mergeSibling(rhs: BNode<K>, maxNodeSize: number) {\n    // assert !this.isShared;\n    const oldLength = this.keys.length;\n    this.keys.push(...rhs.keys);\n    const rhsChildren = (rhs as unknown as BNodeInternal<K>).children;\n    this.children.push(...rhsChildren);\n\n    if (rhs.isShared && !this.isShared) {\n      // All children of a shared node are implicitly shared, and since their new\n      // parent is not shared, they must now be explicitly marked as shared.\n      for (let i = 0; i < rhsChildren.length; i++) {\n        rhsChildren[i].isShared = true;\n      }\n    }\n\n    // If our children are themselves almost empty due to a mass-delete,\n    // they may need to be merged too (but only the oldLength-1 and its\n    // right sibling should need this).\n    this.tryMerge(oldLength - 1, maxNodeSize);\n  }\n}\n\n// If key not found, returns i^failXor where i is the insertion index.\n// Callers that don't care whether there was a match will set failXor=0.\nfunction indexOf<K>(\n  key: K,\n  keys: K[],\n  failXor: number,\n  comparator: Comparator<K>,\n): number {\n  let lo = 0;\n  let hi = keys.length;\n  let mid = hi >> 1;\n  while (lo < hi) {\n    const c = comparator(keys[mid], key);\n    if (c < 0) {\n      lo = mid + 1;\n    } else if (c > 0) {\n      // key < keys[mid]\n      hi = mid;\n    } else if (c === 0) {\n      return mid;\n    } else {\n      // c is NaN or otherwise invalid\n      if (key === key) {\n        // at least the search key is not NaN\n        return keys.length;\n      }\n      throw new Error('NaN was used as a key');\n    }\n    mid = (lo + hi) >> 1;\n  }\n  return mid ^ failXor;\n}\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nconst emptyLeaf = new BNode<any>([]);\nemptyLeaf.isShared = true;\n"],"mappings":";;AAEA,IAAM,gBAAgB;AAItB,IAAa,WAAb,MAAa,SAAY;CACvB,QAAkB;CAClB,OAAe;CAEf;CAEA,YAAY,YAA2B,SAA+B;EACpE,KAAK,aAAa;EAClB,IAAI,SACF,KAAK,MAAM,OAAO,SAChB,KAAK,IAAI,GAAG;CAGlB;;CAGA,QAAQ;EACN,KAAK,QAAQ;EACb,KAAK,OAAO;CACd;CAEA,QAAQ;EACN,KAAK,MAAM,WAAW;EACtB,MAAM,MAAM,IAAI,SAAY,KAAK,UAAU;EAC3C,IAAI,QAAQ,KAAK;EACjB,IAAI,OAAO,KAAK;EAChB,OAAO;CACT;CAEA,IAAI,KAAuB;EACzB,OAAO,KAAK,MAAM,IAAI,KAAK,IAAI;CACjC;CAEA,IAAI,KAAc;EAChB,IAAI,KAAK,MAAM,UAAU,KAAK,QAAQ,KAAK,MAAM,MAAM;EACvD,MAAM,SAAS,KAAK,MAAM,IAAI,KAAK,IAAI;EACvC,IAAI,WAAW,MAAM,OAAO;EAE5B,KAAK,QAAQ,IAAI,cAAiB,CAAC,KAAK,OAAO,MAAM,CAAC;EACtD,OAAO;CACT;;;;;;;;CASA,IAAI,KAAiB;EACnB,OAAO,KAAK,MAAM,IAAI,KAAK,IAAI;CACjC;;;;;;;CAQA,OAAO,KAAiB;EACtB,OAAO,KAAK,QAAQ,GAAG;CACzB;CAEA,QAAQ,KAAiB;EACvB,IAAI,OAAO,KAAK;EAChB,IAAI,KAAK,UACP,KAAK,QAAQ,OAAO,KAAK,MAAM;EAEjC,IAAI;GACF,OAAO,KAAK,OAAO,KAAK,IAAI;EAC9B,UAAU;GACR,IAAI;GACJ,OAAO,KAAK,KAAK,UAAU,KAAK,KAAK,WAAW,GAAG;IACjD,aAAa,KAAK;IAClB,KAAK,QAAQ,OACX,KAAK,KAAK,WAAW,IAAI,YAAY,KAAK,SAAS;GACvD;GAEA,IAAI,UACF,KAAK,WAAW;EAEpB;CACF;CAEA,OAA4B;EAC1B,OAAO,WAAW,KAAK,OAAO,KAAK,YAAY,KAAA,GAAW,IAAI;CAChE;CAEA,SAA8B;EAC5B,OAAO,WAAW,KAAK,OAAO,KAAK,YAAY,KAAA,GAAW,IAAI;CAChE;CAEA,WAAW,WAAe,YAAqB,MAA2B;EACxE,OAAO,WAAW,KAAK,OAAO,KAAK,YAAY,WAAW,SAAS;CACrE;CAEA,iBAAsC;EACpC,OAAO,mBACL,KAAK,QAAQ,GACb,KAAK,OACL,KAAK,YACL,KAAA,GACA,IACF;CACF;CAEA,mBACE,YACA,YAAqB,MACA;EACrB,OAAO,mBACL,KAAK,QAAQ,GACb,KAAK,OACL,KAAK,YACL,YACA,SACF;CACF;;CAGA,UAAyB;EACvB,OAAO,KAAK,MAAM,OAAO;CAC3B;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO,KAAK,KAAK;CACnB;;;;;;CAOA,OAAO,WACL,YACA,eACa;EACb,MAAM,OAAO,IAAI,SAAY,UAAU;EAGvC,MAAM,SAAqB,CAAC;EAC5B,IAAI,cAAmB,CAAC;EACxB,IAAI,OAAO;EAEX,KAAK,MAAM,OAAO,eAAe;GAC/B,YAAY,KAAK,GAAG;GACpB,IAAI,YAAY,WAAW,eAAe;IACxC,OAAO,KAAK,IAAI,MAAS,WAAW,CAAC;IACrC,cAAc,CAAC;GACjB;GACA;EACF;EAEA,IAAI,YAAY,SAAS,GACvB,OAAO,KAAK,IAAI,MAAS,WAAW,CAAC;EAGvC,IAAI,OAAO,WAAW,GAAG,OAAO;EAEhC,KAAK,OAAO;EAEZ,IAAI,OAAO,WAAW,GAAG;GACvB,KAAK,QAAQ,OAAO;GACpB,OAAO;EACT;EAGA,IAAI,eAA2B;EAC/B,OAAO,aAAa,SAAS,GAAG;GAC9B,MAAM,YAAgC,CAAC;GACvC,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK,eAC5C,UAAU,KACR,IAAI,cAAiB,aAAa,MAAM,GAAG,IAAI,aAAa,CAAC,CAC/D;GAEF,eAAe;EACjB;EAEA,KAAK,QAAQ,aAAa;EAC1B,OAAO;CACT;AACF;AAEA,IAAM,uBAAN,MAA6D;CAC3D;CACA;CACA;CACA;CAEA,YACE,WACA,WACA,MACA,QACA;EACA,KAAK,aAAa;EAClB,KAAK,aAAa;EAClB,KAAK,QAAQ;EACb,KAAK,KAAK;CACZ;CAEA,OAA0B;EACxB,SAAS;GACP,IAAI,EAAE,KAAK,KAAK,KAAK,MAAM,KAAK,QAC9B,OAAO;IAAC,MAAM;IAAO,OAAO,KAAK,MAAM,KAAK,KAAK;GAAG;GAGtD,IAAI,QAAQ;GACZ,SAAS;IACP,IAAI,EAAE,SAAS,KAAK,WAAW,QAC7B,OAAO;KAAC,MAAM;KAAM,OAAO,KAAA;IAAyB;IAEtD,IAAI,EAAE,KAAK,WAAW,SAAS,KAAK,WAAW,MAAM,CAAC,QACpD;GAEJ;GACA,OAAO,QAAQ,GAAG,SAAS;IACzB,KAAK,WAAW,QAAQ,KACtB,KAAK,WAAW,MAAM,CAAC,KAAK,WAAW,OAAO,CAC9C;IACF,KAAK,WAAW,QAAQ,KAAK;GAC/B;GACA,KAAK,QAAQ,KAAK,WAAW,EAAE,CAAC,KAAK,WAAW;GAChD,KAAK,KAAK;EACZ;CACF;CAEA,CAAC,OAAO,YAAY;EAClB,OAAO;CACT;AACF;AAEA,IAAM,uBAAN,MAA6D;CAC3D;CACA;CACA;CACA;CAEA,YACE,WACA,WACA,MACA,QACA;EACA,KAAK,aAAa;EAClB,KAAK,aAAa;EAClB,KAAK,QAAQ;EACb,KAAK,KAAK;CACZ;CAEA,OAA0B;EACxB,SAAS;GACP,IAAI,EAAE,KAAK,MAAM,GACf,OAAO;IAAC,MAAM;IAAO,OAAO,KAAK,MAAM,KAAK,KAAK;GAAG;GAGtD,IAAI,QAES;GAAb,SAAoB;IAClB,IAAI,EAAE,SAAS,KAAK,WAAW,QAC7B,OAAO;KAAC,MAAM;KAAM,OAAO,KAAA;IAAyB;IAEtD,IAAI,EAAE,KAAK,WAAW,UAAU,GAC9B;GAEJ;GACA,OAAO,QAAQ,GAAG,SAAS;IACzB,KAAK,WAAW,QAAQ,KACtB,KAAK,WAAW,MAAM,CAAC,KAAK,WAAW,OAAO,CAC9C;IACF,KAAK,WAAW,QAAQ,KAAK,KAAK,WAAW,QAAQ,EAAE,CAAC,SAAS;GACnE;GACA,KAAK,QAAQ,KAAK,WAAW,EAAE,CAAC,KAAK,WAAW;GAChD,KAAK,KAAK,KAAK,MAAM,KAAK;EAC5B;CACF;CAEA,CAAC,OAAO,YAAY;EAClB,OAAO;CACT;AACF;AAEA,SAAS,WACP,MACA,YACA,WACA,WACqB;CACrB,MAAM,OAAO,SAAS,WAAW,MAAM,UAAU;CACjD,IAAI,SAAS,KAAA,GACX,OAAO,gBAAmB;EAAC,MAAM;EAAM,OAAO,KAAA;CAAS,EAAE;CAG3D,IAAI,CAAC,WAAW,WAAW,QAAQ;CACnC,IAAI,IACF,cAAc,KAAA,IACV,KACA,QAAQ,WAAW,KAAK,MAAM,GAAG,UAAU,IAAI;CAErD,IACE,CAAC,aACD,cAAc,KAAA,KAEd,IAAI,IAAI,KAAK,KAAK,UAClB,WAAW,KAAK,KAAK,IAAI,IAAI,SAAS,MAAM,GAE5C;CAGF,OAAO,IAAI,qBAAqB,WAAW,WAAW,MAAM,CAAC;AAC/D;AAEA,SAAS,mBACP,QACA,MACA,YACA,YACA,WACqB;CACrB,IAAI,eAAe,KAAA,GAAW;EAC5B,aAAa;EACb,IAAI,eAAe,KAAA,GACjB,OAAO,gBAAmB;GAAC,MAAM;GAAM,OAAO,KAAA;EAAS,EAAE;CAE7D;CACA,IAAI,CAAC,WAAW,WAAW,QACzB,SAAS,YAAY,MAAM,UAAU,KACrC,SAAS,QAAQ,MAAM,UAAU;CACnC,OACE,CAAC,UAAU,MAAM,SAAS,UAAU,EAAE,CAAC,UAAU,KACjD,2CACF;CACA,IAAI,IAAI,QAAQ,YAAY,KAAK,MAAM,GAAG,UAAU;CACpD,IACE,aACA,IAAI,KAAK,KAAK,UACd,WAAW,KAAK,KAAK,IAAI,UAAU,KAAK,GAExC;CAGF,OAAO,IAAI,qBAAqB,WAAW,WAAW,MAAM,CAAC;AAC/D;AAEA,SAAS,SACP,KACA,MACA,YAC4E;CAC5E,IAAI,WAAW;CACf,MAAM,YAA0B,CAAC;CACjC,MAAM,YAAsB,CAAC;CAE7B,IAAI,SAAS,WAAW,GAAG;EACzB,KAAK,IAAI,IAAI,GAAG,SAAS,WAAW,GAAG,KAAK;GAC1C,UAAU,KAAK,SAAS;GACxB,UAAU,KACR,QAAQ,KAAA,IAAY,IAAI,QAAQ,KAAK,SAAS,MAAM,GAAG,UAAU;GACnE,IAAI,UAAU,MAAM,UAAU,EAAE,CAAC,QAAQ;GACzC,WAAW,UAAU,EAAE,CAAC,UAAU;EACpC;EACA,UAAU,QAAQ;EAClB,UAAU,QAAQ;CACpB;CACA,OAAO;EAAC;EAAW;EAAW;CAAQ;AACxC;AAEA,SAAS,SAAY,MAAoD;CACvE,OAAO;EACL;EACA,CAAC,OAAO,YAAY;GAClB,OAAO;EACT;CACF;AACF;;AAGA,IAAM,QAAN,MAAM,MAAS;CAEb;CAKA;CAEA,YAAY,MAAW;EACrB,KAAK,OAAO;EACZ,KAAK,WAAW,KAAA;CAClB;CAEA,aAAuC;EACrC,OAAO;CACT;CAEA,SAAS;EAEP,OAAO,KAAK,KAAK,GAAG,EAAE;CACxB;CAEA,SAAwB;EACtB,OAAO,KAAK,KAAK;CACnB;CAEA,QAAkB;EAChB,OAAO,IAAI,MAAS,KAAK,KAAK,MAAM,CAAC,CAAC;CACxC;CAEA,IAAI,KAAQ,MAAkC;EAC5C,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACrD,OAAO,IAAI,IAAI,KAAA,IAAY,KAAK,KAAK;CACvC;CAEA,IAAI,KAAQ,MAA4B;EACtC,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACrD,OAAO,KAAK,KAAK,IAAI,KAAK,KAAK;CACjC;CAEA,IAAI,KAAQ,MAAoC;EAC9C,IAAI,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACnD,IAAI,IAAI,GAAG;GAET,IAAI,CAAC;GACL,KAAK;GAEL,IAAI,KAAK,KAAK,SAAS,eAAe;IACpC,KAAK,KAAK,OAAO,GAAG,GAAG,GAAG;IAC1B,OAAO;GACT;GAEA,MAAM,kBAAkB,KAAK,kBAAkB;GAE/C,IAAI,SAAmB;GACvB,IAAI,IAAI,KAAK,KAAK,QAAQ;IACxB,KAAK,KAAK,KAAK;IACf,SAAS;GACX;GAEA,OAAO,KAAK,OAAO,GAAG,GAAG,GAAG;GAE5B,OAAO;EACT;EAGA,KAAK,KAAK,KAAK;EACf,OAAO;CACT;CAEA,cAAc,KAAe;EAC3B,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,CAAE;CAClC;CAEA,aAAa,KAAe;EAC1B,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,CAAE;CACnC;CAEA,oBAA8B;EAC5B,MAAM,OAAO,KAAK,KAAK,UAAU;EACjC,MAAM,OAAO,KAAK,KAAK,OAAO,IAAI;EAClC,OAAO,IAAI,MAAS,IAAI;CAC1B;CAEA,OAAO,KAAQ,MAA4B;EACzC,MAAM,MAAM,KAAK;EACjB,MAAM,OAAO,QAAQ,KAAK,KAAK,MAAM,IAAI,GAAG;EAC5C,MAAM,QAAQ,OAAO;EAErB,IAAI,OAAO,GACT,OAAO;EAGT,MAAM,EAAC,SAAQ;EACf,KAAK,IAAI,IAAI,MAAM,IAAI,OAAO,KAAK;GAGjC,IAFY,KAAK,OAEL,KAAK,MAAM,KAAK,aAAa,MACvC,MAAM,IAAI,MAAM,6CAA6C;GAG/D,KAAK,KAAK,OAAO,GAAG,CAAC;GACrB,KAAK;GACL,OAAO;EACT;EAEA,OAAO;CACT;CAEA,aAAa,KAAe,GAAW;EACrC,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI;CAC5B;AACF;;AAGA,IAAM,gBAAN,MAAM,sBAAyB,MAAS;CAItC;;;;;CAMA,YAAY,UAAsB,MAAY;EAC5C,IAAI,CAAC,MAAM;GACT,OAAO,CAAC;GACR,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,KAAK,KAAK,SAAS,EAAE,CAAC,OAAO;EAEjC;EACA,MAAM,IAAI;EACV,KAAK,WAAW;CAClB;CAEA,aAAuC;EACrC,OAAO;CACT;CAEA,QAAkB;EAChB,MAAM,WAAW,KAAK,SAAS,MAAM,CAAC;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,SAAS,EAAE,CAAC,WAAW;EAEzB,OAAO,IAAI,cAAiB,UAAU,KAAK,KAAK,MAAM,CAAC,CAAC;CAC1D;CAEA,SAAS;EACP,OAAO,KAAK,SAAS,EAAE,CAAC,OAAO;CACjC;CAEA,IAAI,KAAQ,MAAkC;EAC5C,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,UAAU;EACpD,MAAM,EAAC,aAAY;EACnB,OAAO,IAAI,SAAS,SAAS,SAAS,EAAE,CAAC,IAAI,KAAK,IAAI,IAAI,KAAA;CAC5D;CAEA,IAAI,KAAQ,MAA4B;EACtC,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,UAAU;EACpD,MAAM,EAAC,aAAY;EACnB,OAAO,IAAI,SAAS,SAAS,SAAS,EAAE,CAAC,IAAI,KAAK,IAAI,IAAI;CAC5D;CAEA,IAAI,KAAQ,MAAoC;EAC9C,MAAM,IAAI,KAAK;EACf,MAAM,MAAM,KAAK;EACjB,IAAI,IAAI,KAAK,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,GAAG,GAAG,EAAE,SAAS,CAAC;EAC9D,IAAI,QAAQ,EAAE;EAEd,IAAI,MAAM,UACR,EAAE,KAAK,QAAQ,MAAM,MAAM;EAE7B,IAAI,MAAM,KAAK,UAAU,eAAe;GAKtC,IAAI;GACJ,IACE,IAAI,MACH,QAAQ,EAAE,IAAI,GAAA,CAAI,KAAK,SAAS,iBACjC,IAAI,MAAM,KAAK,IAAI,GAAG,IAAI,GAC1B;IACA,IAAI,MAAM,UACR,EAAE,IAAI,KAAK,QAAQ,MAAM,MAAM;IAEjC,MAAM,cAAc,KAAK;IACzB,KAAK,KAAK,IAAI,KAAK,MAAM,OAAO;GAClC,OAAO,KACJ,QAAQ,EAAE,IAAI,QAAQ,KAAA,KACvB,MAAM,KAAK,SAAS,iBACpB,IAAI,MAAM,OAAO,GAAG,GAAG,IAAI,GAC3B;IACA,IAAI,MAAM,UAAU,EAAE,IAAI,KAAK,QAAQ,MAAM,MAAM;IACnD,MAAM,aAAa,KAAK;IACxB,KAAK,KAAK,KAAK,EAAE,EAAE,CAAC,OAAO;GAC7B;EACF;EAEA,MAAM,SAAS,MAAM,IAAI,KAAK,IAAI;EAClC,KAAK,KAAK,KAAK,MAAM,OAAO;EAC5B,IAAI,WAAW,MAAM,OAAO;EAG5B,IAAI,KAAK,KAAK,SAAS,eAAe;GAEpC,KAAK,OAAO,IAAI,GAAG,MAAM;GACzB,OAAO;EACT;EAEA,MAAM,kBAAkB,KAAK,kBAAkB;EAE/C,IAAI,SAA2B;EAC/B,IAAI,IAAI,OAAO,OAAO,GAAG,KAAK,OAAO,CAAC,IAAI,GAAG;GAC3C,SAAS;GACT,KAAK,KAAK,KAAK;EACjB;EACA,OAAO,OAAO,IAAI,GAAG,MAAM;EAC3B,OAAO;CACT;;;;;;CAOA,OAAO,GAAW,OAAiB;EACjC,KAAK,SAAS,OAAO,GAAG,GAAG,KAAK;EAChC,KAAK,KAAK,OAAO,GAAG,GAAG,MAAM,OAAO,CAAC;CACvC;;;;;CAMA,oBAAoB;EAClB,MAAM,OAAO,KAAK,SAAS,UAAU;EACrC,OAAO,IAAI,cACT,KAAK,SAAS,OAAO,IAAI,GACzB,KAAK,KAAK,OAAO,IAAI,CACvB;CACF;CAEA,cAAc,KAAe;EAC3B,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,CAAE;EAChC,KAAK,SAAS,KAAM,IAAyB,SAAS,MAAM,CAAE;CAChE;CAEA,aAAa,KAAe;EAC1B,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,CAAE;EACjC,KAAK,SAAS,QAAS,IAAyB,SAAS,IAAI,CAAE;CACjE;CAEA,OAAO,KAAQ,MAA4B;EACzC,MAAM,MAAM,KAAK;EACjB,MAAM,EAAC,SAAQ;EACf,MAAM,EAAC,aAAY;EACnB,IAAI,OAAO,QAAQ,KAAK,KAAK,MAAM,GAAG,GAAG;EACzC,IAAI,IAAI;EACR,MAAM,QAAQ,KAAK,IAAI,MAAM,KAAK,SAAS,CAAC;EAC5C,IAAI,KAAK,OACP,IAAI;GACF,IAAI,SAAS,EAAE,CAAC,UACd,SAAS,KAAK,SAAS,EAAE,CAAC,MAAM;GAElC,MAAM,SAAS,SAAS,EAAE,CAAC,OAAO,KAAK,IAAI;GAG3C,KAAK,KAAK,SAAS,EAAE,CAAC,OAAO;GAC7B,OAAO;EACT,UAAU;GAER,MAAM,OAAO;GACb,IAAI,OAAO,GAAG;GACd,KAAK,IAAI,OAAO,KAAK,MAAM,KACzB,IAAI,SAAS,EAAE,CAAC,KAAK,UAAU,MAAM;IACnC,IAAI,SAAS,EAAE,CAAC,KAAK,WAAW,GAC9B,KAAK,SAAS,GAAG,aAAa;SACzB;KAEL,KAAK,OAAO,GAAG,CAAC;KAChB,SAAS,OAAO,GAAG,CAAC;IACtB;GACF;EAEJ;EAEF,OAAO;CACT;;CAGA,SAAS,GAAW,SAA0B;EAC5C,MAAM,EAAC,aAAY;EACnB,IAAI,KAAK,KAAK,IAAI,IAAI,SAAS,QACzB;OAAA,SAAS,EAAE,CAAC,KAAK,SAAS,SAAS,IAAI,EAAE,CAAC,KAAK,UAAU,SAAS;IACpE,IACE,SAAS,EAAE,CAAC,UAGZ,SAAS,KAAK,SAAS,EAAE,CAAC,MAAM;IAElC,SAAS,EAAE,CAAC,aAAa,SAAS,IAAI,IAAI,OAAO;IACjD,SAAS,OAAO,IAAI,GAAG,CAAC;IACxB,KAAK,KAAK,OAAO,IAAI,GAAG,CAAC;IACzB,KAAK,KAAK,KAAK,SAAS,EAAE,CAAC,OAAO;IAClC,OAAO;GACT;;EAEF,OAAO;CACT;;;;;;CAOA,aAAa,KAAe,aAAqB;EAE/C,MAAM,YAAY,KAAK,KAAK;EAC5B,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI;EAC1B,MAAM,cAAe,IAAoC;EACzD,KAAK,SAAS,KAAK,GAAG,WAAW;EAEjC,IAAI,IAAI,YAAY,CAAC,KAAK,UAGxB,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,YAAY,EAAE,CAAC,WAAW;EAO9B,KAAK,SAAS,YAAY,GAAG,WAAW;CAC1C;AACF;AAIA,SAAS,QACP,KACA,MACA,SACA,YACQ;CACR,IAAI,KAAK;CACT,IAAI,KAAK,KAAK;CACd,IAAI,MAAM,MAAM;CAChB,OAAO,KAAK,IAAI;EACd,MAAM,IAAI,WAAW,KAAK,MAAM,GAAG;EACnC,IAAI,IAAI,GACN,KAAK,MAAM;OACN,IAAI,IAAI,GAEb,KAAK;OACA,IAAI,MAAM,GACf,OAAO;OACF;GAEL,IAAI,QAAQ,KAEV,OAAO,KAAK;GAEd,MAAM,IAAI,MAAM,uBAAuB;EACzC;EACA,MAAO,KAAK,MAAO;CACrB;CACA,OAAO,MAAM;AACf;AAGA,IAAM,YAAY,IAAI,MAAW,CAAC,CAAC;AACnC,UAAU,WAAW"}
+{"version":3,"file":"btree-set.js","names":[],"sources":["../../../../shared/src/btree-set.ts"],"sourcesContent":["import {assert} from './asserts.ts';\n\nconst MAX_NODE_SIZE = 32;\n\n/**\n * How many arrays `toArray` hands `concat` at once. Engines cap how many\n * arguments a call may spread, so the join is chunked rather than passing one\n * argument per leaf.\n */\nconst CONCAT_CHUNK = 1024;\n\nfunction concatAll<K>(arrays: K[][]): K[] {\n  // `concat` on purpose, not `[...a, ...b]`: this is the one place where the\n  // difference is the point. `concat` copies the arrays in native code, which\n  // on Hermes is 10x faster than getting the same keys out through the tree's\n  // iterator, and 3x faster than a per-element JS loop (see `toArray`).\n  // oxlint-disable-next-line e18e/prefer-spread-syntax\n  return ([] as K[]).concat(...arrays);\n}\n\ntype Comparator<K> = (a: K, b: K) => number;\n\nexport class BTreeSet<K> {\n  #root: BNode<K> = emptyLeaf as BNode<K>;\n  size: number = 0;\n\n  readonly comparator: Comparator<K>;\n\n  constructor(comparator: Comparator<K>, entries?: IterableIterator<K>) {\n    this.comparator = comparator;\n    if (entries) {\n      for (const key of entries) {\n        this.add(key);\n      }\n    }\n  }\n\n  /** Releases the tree so that its size is 0. */\n  clear() {\n    this.#root = emptyLeaf as BNode<K>;\n    this.size = 0;\n  }\n\n  clone() {\n    this.#root.isShared = true;\n    const ret = new BTreeSet<K>(this.comparator);\n    ret.#root = this.#root;\n    ret.size = this.size;\n    return ret;\n  }\n\n  get(key: K): K | undefined {\n    return this.#root.get(key, this);\n  }\n\n  add(key: K): this {\n    if (this.#root.isShared) this.#root = this.#root.clone();\n    const result = this.#root.set(key, this);\n    if (result === null) return this;\n    // Root node has split, so create a new root node.\n    this.#root = new BNodeInternal<K>([this.#root, result]);\n    return this;\n  }\n\n  /**\n   * Returns true if the key exists in the B+ tree, false if not.\n   * Use get() for best performance; use has() if you need to\n   * distinguish between \"undefined value\" and \"key not present\".\n   * @param key Key to detect\n   * @description Computational complexity: O(log size)\n   */\n  has(key: K): boolean {\n    return this.#root.has(key, this);\n  }\n\n  /**\n   * Removes a single key-value pair from the B+ tree.\n   * @param key Key to find\n   * @returns true if a pair was found and removed, false otherwise.\n   * @description Computational complexity: O(log size)\n   */\n  delete(key: K): boolean {\n    return this.#delete(key);\n  }\n\n  #delete(key: K): boolean {\n    let root = this.#root;\n    if (root.isShared) {\n      this.#root = root = root.clone();\n    }\n    try {\n      return root.delete(key, this);\n    } finally {\n      let isShared;\n      while (root.keys.length <= 1 && root.isInternal()) {\n        isShared ||= root.isShared;\n        this.#root = root =\n          root.keys.length === 0 ? emptyLeaf : root.children[0];\n      }\n      // If any ancestor of the new root was shared, the new root must also be shared\n      if (isShared) {\n        root.isShared = true;\n      }\n    }\n  }\n\n  keys(): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, undefined, true);\n  }\n\n  values(): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, undefined, true);\n  }\n\n  valuesFrom(lowestKey?: K, inclusive: boolean = true): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, lowestKey, inclusive);\n  }\n\n  valuesReversed(): IterableIterator<K> {\n    return valuesFromReversed(\n      this.#maxKey(),\n      this.#root,\n      this.comparator,\n      undefined,\n      true,\n    );\n  }\n\n  valuesFromReversed(\n    highestKey?: K,\n    inclusive: boolean = true,\n  ): IterableIterator<K> {\n    return valuesFromReversed(\n      this.#maxKey(),\n      this.#root,\n      this.comparator,\n      highestKey,\n      inclusive,\n    );\n  }\n\n  /** Gets the highest key in the tree. Complexity: O(1) */\n  #maxKey(): K | undefined {\n    return this.#root.maxKey();\n  }\n\n  [Symbol.iterator](): IterableIterator<K> {\n    return this.keys();\n  }\n\n  /**\n   * Returns every key, in order, as a fresh array the caller owns (sorting it\n   * in place is safe).\n   *\n   * This is the inverse of `fromSorted`: it collects the leaves' `keys` arrays\n   * and joins them with `concat`, instead of yielding one key at a time. Every\n   * key the iterator yields pays for a `next()` call that walks a node queue\n   * and allocates a result object, and on an interpreter that is not something\n   * a JS loop can win back -- the work has to happen in native code.\n   *\n   * Measured on an Android emulator (Hermes, release), 90,000 rows per call:\n   * 5.76ms through the iterator, 1.73ms for a per-element JS copy loop into a\n   * pre-sized array, 0.56ms for this. So a JS loop buys 3.3x and native copying\n   * 10x; at 30,000 rows, where the join is a single round, it is 20x. V8 JITs\n   * such a loop to near-memcpy, so the choice barely registers there and is\n   * worth 3x on a phone.\n   *\n   * Complexity: O(size). Nothing collected is mutated, so shared/cloned nodes\n   * are safe, and the arrays are copied rather than handed out.\n   */\n  toArray(): K[] {\n    const root = this.#root;\n    // The common small case: one native copy, and no leaf collection at all.\n    if (!root.isInternal()) {\n      return root.keys.slice();\n    }\n    const leaves: K[][] = [];\n    root.collectLeafKeys(leaves);\n    // `concat` takes the leaves as arguments, so they are joined in chunks to\n    // keep the argument count bounded however large the tree is. Each round\n    // copies the data once, and with 32 keys per leaf one round covers 32k rows\n    // and two cover 33M, so this is one or two passes in practice.\n    let level = leaves;\n    while (level.length > 1) {\n      const next: K[][] = [];\n      for (let i = 0; i < level.length; i += CONCAT_CHUNK) {\n        next.push(concatAll(level.slice(i, i + CONCAT_CHUNK)));\n      }\n      level = next;\n    }\n    // An internal node always has at least one child, so `level` holds exactly\n    // one array here; the fallback is for a tree in no state this class builds.\n    return level[0] ?? [];\n  }\n\n  /**\n   * Builds a BTreeSet from a pre-sorted iterable in O(N) by constructing\n   * the tree bottom-up. The caller must ensure entries are sorted by\n   * `comparator`; violating this produces an invalid tree.\n   */\n  static fromSorted<K>(\n    comparator: Comparator<K>,\n    sortedEntries: Iterable<K>,\n  ): BTreeSet<K> {\n    const tree = new BTreeSet<K>(comparator);\n\n    // Stream through entries, flushing a leaf node each time we fill MAX_NODE_SIZE keys.\n    const leaves: BNode<K>[] = [];\n    let currentKeys: K[] = [];\n    let size = 0;\n\n    for (const key of sortedEntries) {\n      currentKeys.push(key);\n      if (currentKeys.length === MAX_NODE_SIZE) {\n        leaves.push(new BNode<K>(currentKeys));\n        currentKeys = [];\n      }\n      size++;\n    }\n\n    if (currentKeys.length > 0) {\n      leaves.push(new BNode<K>(currentKeys));\n    }\n\n    if (leaves.length === 0) return tree;\n\n    tree.size = size;\n\n    if (leaves.length === 1) {\n      tree.#root = leaves[0];\n      return tree;\n    }\n\n    // Build internal nodes bottom-up until a single root remains.\n    let currentLevel: BNode<K>[] = leaves;\n    while (currentLevel.length > 1) {\n      const nextLevel: BNodeInternal<K>[] = [];\n      for (let i = 0; i < currentLevel.length; i += MAX_NODE_SIZE) {\n        nextLevel.push(\n          new BNodeInternal<K>(currentLevel.slice(i, i + MAX_NODE_SIZE)),\n        );\n      }\n      currentLevel = nextLevel;\n    }\n\n    tree.#root = currentLevel[0];\n    return tree;\n  }\n}\n\nclass BTreeForwardIterator<K> implements IterableIterator<K> {\n  readonly #nodeQueue: BNode<K>[][];\n  readonly #nodeIndex: number[];\n  #leaf: BNode<K>;\n  #i: number;\n\n  constructor(\n    nodeQueue: BNode<K>[][],\n    nodeIndex: number[],\n    leaf: BNode<K>,\n    startI: number,\n  ) {\n    this.#nodeQueue = nodeQueue;\n    this.#nodeIndex = nodeIndex;\n    this.#leaf = leaf;\n    this.#i = startI;\n  }\n\n  next(): IteratorResult<K> {\n    for (;;) {\n      if (++this.#i < this.#leaf.keys.length) {\n        return {done: false, value: this.#leaf.keys[this.#i]};\n      }\n\n      let level = -1;\n      for (;;) {\n        if (++level >= this.#nodeQueue.length) {\n          return {done: true, value: undefined as unknown as K};\n        }\n        if (++this.#nodeIndex[level] < this.#nodeQueue[level].length) {\n          break;\n        }\n      }\n      for (; level > 0; level--) {\n        this.#nodeQueue[level - 1] = (\n          this.#nodeQueue[level][this.#nodeIndex[level]] as BNodeInternal<K>\n        ).children;\n        this.#nodeIndex[level - 1] = 0;\n      }\n      this.#leaf = this.#nodeQueue[0][this.#nodeIndex[0]];\n      this.#i = -1;\n    }\n  }\n\n  [Symbol.iterator]() {\n    return this;\n  }\n}\n\nclass BTreeReverseIterator<K> implements IterableIterator<K> {\n  readonly #nodeQueue: BNode<K>[][];\n  readonly #nodeIndex: number[];\n  #leaf: BNode<K>;\n  #i: number;\n\n  constructor(\n    nodeQueue: BNode<K>[][],\n    nodeIndex: number[],\n    leaf: BNode<K>,\n    startI: number,\n  ) {\n    this.#nodeQueue = nodeQueue;\n    this.#nodeIndex = nodeIndex;\n    this.#leaf = leaf;\n    this.#i = startI;\n  }\n\n  next(): IteratorResult<K> {\n    for (;;) {\n      if (--this.#i >= 0) {\n        return {done: false, value: this.#leaf.keys[this.#i]};\n      }\n\n      let level;\n      // Advance to the next leaf node\n      for (level = -1; ;) {\n        if (++level >= this.#nodeQueue.length) {\n          return {done: true, value: undefined as unknown as K};\n        }\n        if (--this.#nodeIndex[level] >= 0) {\n          break;\n        }\n      }\n      for (; level > 0; level--) {\n        this.#nodeQueue[level - 1] = (\n          this.#nodeQueue[level][this.#nodeIndex[level]] as BNodeInternal<K>\n        ).children;\n        this.#nodeIndex[level - 1] = this.#nodeQueue[level - 1].length - 1;\n      }\n      this.#leaf = this.#nodeQueue[0][this.#nodeIndex[0]];\n      this.#i = this.#leaf.keys.length;\n    }\n  }\n\n  [Symbol.iterator]() {\n    return this;\n  }\n}\n\nfunction valuesFrom<K>(\n  root: BNode<K>,\n  comparator: Comparator<K>,\n  lowestKey: K | undefined,\n  inclusive: boolean,\n): IterableIterator<K> {\n  const info = findPath(lowestKey, root, comparator);\n  if (info === undefined) {\n    return iterator<K>(() => ({done: true, value: undefined}));\n  }\n\n  let [nodeQueue, nodeIndex, leaf] = info;\n  let i =\n    lowestKey === undefined\n      ? -1\n      : indexOf(lowestKey, leaf.keys, 0, comparator) - 1;\n\n  if (\n    !inclusive &&\n    lowestKey !== undefined &&\n    // +1 because we did -1 above.\n    i + 1 < leaf.keys.length &&\n    comparator(leaf.keys[i + 1], lowestKey) === 0\n  ) {\n    i++;\n  }\n\n  return new BTreeForwardIterator(nodeQueue, nodeIndex, leaf, i);\n}\n\nfunction valuesFromReversed<K>(\n  maxKey: K | undefined,\n  root: BNode<K>,\n  comparator: Comparator<K>,\n  highestKey: K | undefined,\n  inclusive: boolean,\n): IterableIterator<K> {\n  if (highestKey === undefined) {\n    highestKey = maxKey;\n    if (highestKey === undefined) {\n      return iterator<K>(() => ({done: true, value: undefined}));\n    } // collection is empty\n  }\n  let [nodeQueue, nodeIndex, leaf] =\n    findPath(highestKey, root, comparator) ||\n    findPath(maxKey, root, comparator)!;\n  assert(\n    !nodeQueue[0] || leaf === nodeQueue[0][nodeIndex[0]],\n    'BTreeSet: leaf node mismatch in iteration',\n  );\n  let i = indexOf(highestKey, leaf.keys, 0, comparator);\n  if (\n    inclusive &&\n    i < leaf.keys.length &&\n    comparator(leaf.keys[i], highestKey) <= 0\n  ) {\n    i++;\n  }\n\n  return new BTreeReverseIterator(nodeQueue, nodeIndex, leaf, i);\n}\n\nfunction findPath<K>(\n  key: K | undefined,\n  root: BNode<K>,\n  comparator: Comparator<K>,\n): [nodeQueue: BNode<K>[][], nodeIndex: number[], leaf: BNode<K>] | undefined {\n  let nextNode = root;\n  const nodeQueue: BNode<K>[][] = [];\n  const nodeIndex: number[] = [];\n\n  if (nextNode.isInternal()) {\n    for (let d = 0; nextNode.isInternal(); d++) {\n      nodeQueue[d] = nextNode.children;\n      nodeIndex[d] =\n        key === undefined ? 0 : indexOf(key, nextNode.keys, 0, comparator);\n      if (nodeIndex[d] >= nodeQueue[d].length) return; // first key > maxKey()\n      nextNode = nodeQueue[d][nodeIndex[d]];\n    }\n    nodeQueue.reverse();\n    nodeIndex.reverse();\n  }\n  return [nodeQueue, nodeIndex, nextNode];\n}\n\nfunction iterator<T>(next: () => IteratorResult<T>): IterableIterator<T> {\n  return {\n    next,\n    [Symbol.iterator]() {\n      return this;\n    },\n  };\n}\n\n/** Leaf node / base class. **************************************************/\nclass BNode<K> {\n  // If this is an internal node, _keys[i] is the highest key in children[i].\n  keys: K[];\n  // True if this node might be within multiple `BTree`s (or have multiple parents).\n  // If so, it must be cloned before being mutated to avoid changing an unrelated tree.\n  // This is transitive: if it's true, children are also shared even if `isShared!=true`\n  // in those children. (Certain operations will propagate isShared=true to children.)\n  isShared: true | undefined;\n\n  constructor(keys: K[]) {\n    this.keys = keys;\n    this.isShared = undefined;\n  }\n\n  isInternal(): this is BNodeInternal<K> {\n    return false;\n  }\n\n  maxKey() {\n    // oxlint-disable-next-line typescript/no-non-null-assertion\n    return this.keys.at(-1)!;\n  }\n\n  minKey(): K | undefined {\n    return this.keys[0];\n  }\n\n  clone(): BNode<K> {\n    return new BNode<K>(this.keys.slice(0));\n  }\n\n  /**\n   * Appends this node's `keys` arrays, in order, to `out`. Read-only: the\n   * arrays are not copied here and must not be mutated by the caller, which is\n   * why `toArray` only ever passes them to `concat`.\n   */\n  collectLeafKeys(out: K[][]): void {\n    out.push(this.keys);\n  }\n\n  get(key: K, tree: BTreeSet<K>): K | undefined {\n    const i = indexOf(key, this.keys, -1, tree.comparator);\n    return i < 0 ? undefined : this.keys[i];\n  }\n\n  has(key: K, tree: BTreeSet<K>): boolean {\n    const i = indexOf(key, this.keys, -1, tree.comparator);\n    return i >= 0 && i < this.keys.length;\n  }\n\n  set(key: K, tree: BTreeSet<K>): null | BNode<K> {\n    let i = indexOf(key, this.keys, -1, tree.comparator);\n    if (i < 0) {\n      // key does not exist yet\n      i = ~i;\n      tree.size++;\n\n      if (this.keys.length < MAX_NODE_SIZE) {\n        this.keys.splice(i, 0, key);\n        return null;\n      }\n      // This leaf node is full and must split\n      const newRightSibling = this.splitOffRightSide();\n      // oxlint-disable-next-line @typescript-eslint/no-this-alias\n      let target: BNode<K> = this;\n      if (i > this.keys.length) {\n        i -= this.keys.length;\n        target = newRightSibling;\n      }\n      // target.#insertInLeaf(i, key);\n      target.keys.splice(i, 0, key);\n\n      return newRightSibling;\n    }\n\n    // usually this is a no-op, but some users may wish to edit the key\n    this.keys[i] = key;\n    return null;\n  }\n\n  takeFromRight(rhs: BNode<K>) {\n    this.keys.push(rhs.keys.shift()!);\n  }\n\n  takeFromLeft(lhs: BNode<K>) {\n    this.keys.unshift(lhs.keys.pop()!);\n  }\n\n  splitOffRightSide(): BNode<K> {\n    const half = this.keys.length >> 1;\n    const keys = this.keys.splice(half);\n    return new BNode<K>(keys);\n  }\n\n  delete(key: K, tree: BTreeSet<K>): boolean {\n    const cmp = tree.comparator;\n    const iLow = indexOf(key, this.keys, -1, cmp);\n    const iHigh = iLow + 1;\n\n    if (iLow < 0) {\n      return false;\n    }\n\n    const {keys} = this;\n    for (let i = iLow; i < iHigh; i++) {\n      const key = keys[i];\n\n      if (key !== keys[i] || this.isShared === true) {\n        throw new Error('BTree illegally changed or cloned in delete');\n      }\n\n      this.keys.splice(i, 1);\n      tree.size--;\n      return true;\n    }\n\n    return false;\n  }\n\n  mergeSibling(rhs: BNode<K>, _: number) {\n    this.keys.push(...rhs.keys);\n  }\n}\n\n/** Internal node (non-leaf node) ********************************************/\nclass BNodeInternal<K> extends BNode<K> {\n  // Note: conventionally B+ trees have one fewer key than the number of\n  // children, but I find it easier to keep the array lengths equal: each\n  // keys[i] caches the value of children[i].maxKey().\n  children: BNode<K>[];\n\n  /**\n   * This does not mark `children` as shared, so it is the responsibility of the caller\n   * to ensure children are either marked shared, or aren't included in another tree.\n   */\n  constructor(children: BNode<K>[], keys?: K[]) {\n    if (!keys) {\n      keys = [];\n      for (let i = 0; i < children.length; i++) {\n        keys[i] = children[i].maxKey();\n      }\n    }\n    super(keys);\n    this.children = children;\n  }\n\n  isInternal(): this is BNodeInternal<K> {\n    return true;\n  }\n\n  clone(): BNode<K> {\n    const children = this.children.slice(0);\n    for (let i = 0; i < children.length; i++) {\n      children[i].isShared = true;\n    }\n    return new BNodeInternal<K>(children, this.keys.slice(0));\n  }\n\n  minKey() {\n    return this.children[0].minKey();\n  }\n\n  collectLeafKeys(out: K[][]): void {\n    // An internal node's `keys` cache its children's max keys, so the keys live\n    // in the leaves. Recursion depth is the tree height, log_32(size).\n    const {children} = this;\n    for (let i = 0; i < children.length; i++) {\n      children[i].collectLeafKeys(out);\n    }\n  }\n\n  get(key: K, tree: BTreeSet<K>): K | undefined {\n    const i = indexOf(key, this.keys, 0, tree.comparator);\n    const {children} = this;\n    return i < children.length ? children[i].get(key, tree) : undefined;\n  }\n\n  has(key: K, tree: BTreeSet<K>): boolean {\n    const i = indexOf(key, this.keys, 0, tree.comparator);\n    const {children} = this;\n    return i < children.length ? children[i].has(key, tree) : false;\n  }\n\n  set(key: K, tree: BTreeSet<K>): null | BNode<K> {\n    const c = this.children;\n    const cmp = tree.comparator;\n    let i = Math.min(indexOf(key, this.keys, 0, cmp), c.length - 1);\n    let child = c[i];\n\n    if (child.isShared) {\n      c[i] = child = child.clone();\n    }\n    if (child.keys.length >= MAX_NODE_SIZE) {\n      // child is full; inserting anything else will cause a split.\n      // Shifting an item to the left or right sibling may avoid a split.\n      // We can do a shift if the adjacent node is not full and if the\n      // current key can still be placed in the same node after the shift.\n      let other: BNode<K>;\n      if (\n        i > 0 &&\n        (other = c[i - 1]).keys.length < MAX_NODE_SIZE &&\n        cmp(child.keys[0], key) < 0\n      ) {\n        if (other.isShared) {\n          c[i - 1] = other = other.clone();\n        }\n        other.takeFromRight(child);\n        this.keys[i - 1] = other.maxKey();\n      } else if (\n        (other = c[i + 1]) !== undefined &&\n        other.keys.length < MAX_NODE_SIZE &&\n        cmp(child.maxKey(), key) < 0\n      ) {\n        if (other.isShared) c[i + 1] = other = other.clone();\n        other.takeFromLeft(child);\n        this.keys[i] = c[i].maxKey();\n      }\n    }\n\n    const result = child.set(key, tree);\n    this.keys[i] = child.maxKey();\n    if (result === null) return null;\n\n    // The child has split and `result` is a new right child... does it fit?\n    if (this.keys.length < MAX_NODE_SIZE) {\n      // yes\n      this.insert(i + 1, result);\n      return null;\n    }\n    // no, we must split also\n    const newRightSibling = this.splitOffRightSide();\n    // oxlint-disable-next-line @typescript-eslint/no-this-alias\n    let target: BNodeInternal<K> = this;\n    if (cmp(result.maxKey(), this.maxKey()) > 0) {\n      target = newRightSibling;\n      i -= this.keys.length;\n    }\n    target.insert(i + 1, result);\n    return newRightSibling;\n  }\n\n  /**\n   * Inserts `child` at index `i`.\n   * This does not mark `child` as shared, so it is the responsibility of the caller\n   * to ensure that either child is marked shared, or it is not included in another tree.\n   */\n  insert(i: number, child: BNode<K>) {\n    this.children.splice(i, 0, child);\n    this.keys.splice(i, 0, child.maxKey());\n  }\n\n  /**\n   * Split this node.\n   * Modifies this to remove the second half of the items, returning a separate node containing them.\n   */\n  splitOffRightSide() {\n    const half = this.children.length >> 1;\n    return new BNodeInternal<K>(\n      this.children.splice(half),\n      this.keys.splice(half),\n    );\n  }\n\n  takeFromRight(rhs: BNode<K>) {\n    this.keys.push(rhs.keys.shift()!);\n    this.children.push((rhs as BNodeInternal<K>).children.shift()!);\n  }\n\n  takeFromLeft(lhs: BNode<K>) {\n    this.keys.unshift(lhs.keys.pop()!);\n    this.children.unshift((lhs as BNodeInternal<K>).children.pop()!);\n  }\n\n  delete(key: K, tree: BTreeSet<K>): boolean {\n    const cmp = tree.comparator;\n    const {keys} = this;\n    const {children} = this;\n    let iLow = indexOf(key, this.keys, 0, cmp);\n    let i = iLow;\n    const iHigh = Math.min(iLow, keys.length - 1);\n    if (i <= iHigh) {\n      try {\n        if (children[i].isShared) {\n          children[i] = children[i].clone();\n        }\n        const result = children[i].delete(key, tree);\n        // Note: if children[i] is empty then keys[i]=undefined.\n        //       This is an invalid state, but it is fixed below.\n        keys[i] = children[i].maxKey();\n        return result;\n      } finally {\n        // Deletions may have occurred, so look for opportunities to merge nodes.\n        const half = MAX_NODE_SIZE >> 1;\n        if (iLow > 0) iLow--;\n        for (i = iHigh; i >= iLow; i--) {\n          if (children[i].keys.length <= half) {\n            if (children[i].keys.length !== 0) {\n              this.tryMerge(i, MAX_NODE_SIZE);\n            } else {\n              // child is empty! delete it!\n              keys.splice(i, 1);\n              children.splice(i, 1);\n            }\n          }\n        }\n      }\n    }\n    return false;\n  }\n\n  /** Merges child i with child i+1 if their combined size is not too large */\n  tryMerge(i: number, maxSize: number): boolean {\n    const {children} = this;\n    if (i >= 0 && i + 1 < children.length) {\n      if (children[i].keys.length + children[i + 1].keys.length <= maxSize) {\n        if (\n          children[i].isShared\n        ) // cloned already UNLESS i is outside scan range\n        {\n          children[i] = children[i].clone();\n        }\n        children[i].mergeSibling(children[i + 1], maxSize);\n        children.splice(i + 1, 1);\n        this.keys.splice(i + 1, 1);\n        this.keys[i] = children[i].maxKey();\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Move children from `rhs` into this.\n   * `rhs` must be part of this tree, and be removed from it after this call\n   * (otherwise isShared for its children could be incorrect).\n   */\n  mergeSibling(rhs: BNode<K>, maxNodeSize: number) {\n    // assert !this.isShared;\n    const oldLength = this.keys.length;\n    this.keys.push(...rhs.keys);\n    const rhsChildren = (rhs as unknown as BNodeInternal<K>).children;\n    this.children.push(...rhsChildren);\n\n    if (rhs.isShared && !this.isShared) {\n      // All children of a shared node are implicitly shared, and since their new\n      // parent is not shared, they must now be explicitly marked as shared.\n      for (let i = 0; i < rhsChildren.length; i++) {\n        rhsChildren[i].isShared = true;\n      }\n    }\n\n    // If our children are themselves almost empty due to a mass-delete,\n    // they may need to be merged too (but only the oldLength-1 and its\n    // right sibling should need this).\n    this.tryMerge(oldLength - 1, maxNodeSize);\n  }\n}\n\n// If key not found, returns i^failXor where i is the insertion index.\n// Callers that don't care whether there was a match will set failXor=0.\nfunction indexOf<K>(\n  key: K,\n  keys: K[],\n  failXor: number,\n  comparator: Comparator<K>,\n): number {\n  let lo = 0;\n  let hi = keys.length;\n  let mid = hi >> 1;\n  while (lo < hi) {\n    const c = comparator(keys[mid], key);\n    if (c < 0) {\n      lo = mid + 1;\n    } else if (c > 0) {\n      // key < keys[mid]\n      hi = mid;\n    } else if (c === 0) {\n      return mid;\n    } else {\n      // c is NaN or otherwise invalid\n      if (key === key) {\n        // at least the search key is not NaN\n        return keys.length;\n      }\n      throw new Error('NaN was used as a key');\n    }\n    mid = (lo + hi) >> 1;\n  }\n  return mid ^ failXor;\n}\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nconst emptyLeaf = new BNode<any>([]);\nemptyLeaf.isShared = true;\n"],"mappings":";;AAEA,IAAM,gBAAgB;;;;;;AAOtB,IAAM,eAAe;AAErB,SAAS,UAAa,QAAoB;CAMxC,OAAQ,CAAC,CAAC,CAAS,OAAO,GAAG,MAAM;AACrC;AAIA,IAAa,WAAb,MAAa,SAAY;CACvB,QAAkB;CAClB,OAAe;CAEf;CAEA,YAAY,YAA2B,SAA+B;EACpE,KAAK,aAAa;EAClB,IAAI,SACF,KAAK,MAAM,OAAO,SAChB,KAAK,IAAI,GAAG;CAGlB;;CAGA,QAAQ;EACN,KAAK,QAAQ;EACb,KAAK,OAAO;CACd;CAEA,QAAQ;EACN,KAAK,MAAM,WAAW;EACtB,MAAM,MAAM,IAAI,SAAY,KAAK,UAAU;EAC3C,IAAI,QAAQ,KAAK;EACjB,IAAI,OAAO,KAAK;EAChB,OAAO;CACT;CAEA,IAAI,KAAuB;EACzB,OAAO,KAAK,MAAM,IAAI,KAAK,IAAI;CACjC;CAEA,IAAI,KAAc;EAChB,IAAI,KAAK,MAAM,UAAU,KAAK,QAAQ,KAAK,MAAM,MAAM;EACvD,MAAM,SAAS,KAAK,MAAM,IAAI,KAAK,IAAI;EACvC,IAAI,WAAW,MAAM,OAAO;EAE5B,KAAK,QAAQ,IAAI,cAAiB,CAAC,KAAK,OAAO,MAAM,CAAC;EACtD,OAAO;CACT;;;;;;;;CASA,IAAI,KAAiB;EACnB,OAAO,KAAK,MAAM,IAAI,KAAK,IAAI;CACjC;;;;;;;CAQA,OAAO,KAAiB;EACtB,OAAO,KAAK,QAAQ,GAAG;CACzB;CAEA,QAAQ,KAAiB;EACvB,IAAI,OAAO,KAAK;EAChB,IAAI,KAAK,UACP,KAAK,QAAQ,OAAO,KAAK,MAAM;EAEjC,IAAI;GACF,OAAO,KAAK,OAAO,KAAK,IAAI;EAC9B,UAAU;GACR,IAAI;GACJ,OAAO,KAAK,KAAK,UAAU,KAAK,KAAK,WAAW,GAAG;IACjD,aAAa,KAAK;IAClB,KAAK,QAAQ,OACX,KAAK,KAAK,WAAW,IAAI,YAAY,KAAK,SAAS;GACvD;GAEA,IAAI,UACF,KAAK,WAAW;EAEpB;CACF;CAEA,OAA4B;EAC1B,OAAO,WAAW,KAAK,OAAO,KAAK,YAAY,KAAA,GAAW,IAAI;CAChE;CAEA,SAA8B;EAC5B,OAAO,WAAW,KAAK,OAAO,KAAK,YAAY,KAAA,GAAW,IAAI;CAChE;CAEA,WAAW,WAAe,YAAqB,MAA2B;EACxE,OAAO,WAAW,KAAK,OAAO,KAAK,YAAY,WAAW,SAAS;CACrE;CAEA,iBAAsC;EACpC,OAAO,mBACL,KAAK,QAAQ,GACb,KAAK,OACL,KAAK,YACL,KAAA,GACA,IACF;CACF;CAEA,mBACE,YACA,YAAqB,MACA;EACrB,OAAO,mBACL,KAAK,QAAQ,GACb,KAAK,OACL,KAAK,YACL,YACA,SACF;CACF;;CAGA,UAAyB;EACvB,OAAO,KAAK,MAAM,OAAO;CAC3B;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO,KAAK,KAAK;CACnB;;;;;;;;;;;;;;;;;;;;;CAsBA,UAAe;EACb,MAAM,OAAO,KAAK;EAElB,IAAI,CAAC,KAAK,WAAW,GACnB,OAAO,KAAK,KAAK,MAAM;EAEzB,MAAM,SAAgB,CAAC;EACvB,KAAK,gBAAgB,MAAM;EAK3B,IAAI,QAAQ;EACZ,OAAO,MAAM,SAAS,GAAG;GACvB,MAAM,OAAc,CAAC;GACrB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,cACrC,KAAK,KAAK,UAAU,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC;GAEvD,QAAQ;EACV;EAGA,OAAO,MAAM,MAAM,CAAC;CACtB;;;;;;CAOA,OAAO,WACL,YACA,eACa;EACb,MAAM,OAAO,IAAI,SAAY,UAAU;EAGvC,MAAM,SAAqB,CAAC;EAC5B,IAAI,cAAmB,CAAC;EACxB,IAAI,OAAO;EAEX,KAAK,MAAM,OAAO,eAAe;GAC/B,YAAY,KAAK,GAAG;GACpB,IAAI,YAAY,WAAW,eAAe;IACxC,OAAO,KAAK,IAAI,MAAS,WAAW,CAAC;IACrC,cAAc,CAAC;GACjB;GACA;EACF;EAEA,IAAI,YAAY,SAAS,GACvB,OAAO,KAAK,IAAI,MAAS,WAAW,CAAC;EAGvC,IAAI,OAAO,WAAW,GAAG,OAAO;EAEhC,KAAK,OAAO;EAEZ,IAAI,OAAO,WAAW,GAAG;GACvB,KAAK,QAAQ,OAAO;GACpB,OAAO;EACT;EAGA,IAAI,eAA2B;EAC/B,OAAO,aAAa,SAAS,GAAG;GAC9B,MAAM,YAAgC,CAAC;GACvC,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK,eAC5C,UAAU,KACR,IAAI,cAAiB,aAAa,MAAM,GAAG,IAAI,aAAa,CAAC,CAC/D;GAEF,eAAe;EACjB;EAEA,KAAK,QAAQ,aAAa;EAC1B,OAAO;CACT;AACF;AAEA,IAAM,uBAAN,MAA6D;CAC3D;CACA;CACA;CACA;CAEA,YACE,WACA,WACA,MACA,QACA;EACA,KAAK,aAAa;EAClB,KAAK,aAAa;EAClB,KAAK,QAAQ;EACb,KAAK,KAAK;CACZ;CAEA,OAA0B;EACxB,SAAS;GACP,IAAI,EAAE,KAAK,KAAK,KAAK,MAAM,KAAK,QAC9B,OAAO;IAAC,MAAM;IAAO,OAAO,KAAK,MAAM,KAAK,KAAK;GAAG;GAGtD,IAAI,QAAQ;GACZ,SAAS;IACP,IAAI,EAAE,SAAS,KAAK,WAAW,QAC7B,OAAO;KAAC,MAAM;KAAM,OAAO,KAAA;IAAyB;IAEtD,IAAI,EAAE,KAAK,WAAW,SAAS,KAAK,WAAW,MAAM,CAAC,QACpD;GAEJ;GACA,OAAO,QAAQ,GAAG,SAAS;IACzB,KAAK,WAAW,QAAQ,KACtB,KAAK,WAAW,MAAM,CAAC,KAAK,WAAW,OAAO,CAC9C;IACF,KAAK,WAAW,QAAQ,KAAK;GAC/B;GACA,KAAK,QAAQ,KAAK,WAAW,EAAE,CAAC,KAAK,WAAW;GAChD,KAAK,KAAK;EACZ;CACF;CAEA,CAAC,OAAO,YAAY;EAClB,OAAO;CACT;AACF;AAEA,IAAM,uBAAN,MAA6D;CAC3D;CACA;CACA;CACA;CAEA,YACE,WACA,WACA,MACA,QACA;EACA,KAAK,aAAa;EAClB,KAAK,aAAa;EAClB,KAAK,QAAQ;EACb,KAAK,KAAK;CACZ;CAEA,OAA0B;EACxB,SAAS;GACP,IAAI,EAAE,KAAK,MAAM,GACf,OAAO;IAAC,MAAM;IAAO,OAAO,KAAK,MAAM,KAAK,KAAK;GAAG;GAGtD,IAAI,QAES;GAAb,SAAoB;IAClB,IAAI,EAAE,SAAS,KAAK,WAAW,QAC7B,OAAO;KAAC,MAAM;KAAM,OAAO,KAAA;IAAyB;IAEtD,IAAI,EAAE,KAAK,WAAW,UAAU,GAC9B;GAEJ;GACA,OAAO,QAAQ,GAAG,SAAS;IACzB,KAAK,WAAW,QAAQ,KACtB,KAAK,WAAW,MAAM,CAAC,KAAK,WAAW,OAAO,CAC9C;IACF,KAAK,WAAW,QAAQ,KAAK,KAAK,WAAW,QAAQ,EAAE,CAAC,SAAS;GACnE;GACA,KAAK,QAAQ,KAAK,WAAW,EAAE,CAAC,KAAK,WAAW;GAChD,KAAK,KAAK,KAAK,MAAM,KAAK;EAC5B;CACF;CAEA,CAAC,OAAO,YAAY;EAClB,OAAO;CACT;AACF;AAEA,SAAS,WACP,MACA,YACA,WACA,WACqB;CACrB,MAAM,OAAO,SAAS,WAAW,MAAM,UAAU;CACjD,IAAI,SAAS,KAAA,GACX,OAAO,gBAAmB;EAAC,MAAM;EAAM,OAAO,KAAA;CAAS,EAAE;CAG3D,IAAI,CAAC,WAAW,WAAW,QAAQ;CACnC,IAAI,IACF,cAAc,KAAA,IACV,KACA,QAAQ,WAAW,KAAK,MAAM,GAAG,UAAU,IAAI;CAErD,IACE,CAAC,aACD,cAAc,KAAA,KAEd,IAAI,IAAI,KAAK,KAAK,UAClB,WAAW,KAAK,KAAK,IAAI,IAAI,SAAS,MAAM,GAE5C;CAGF,OAAO,IAAI,qBAAqB,WAAW,WAAW,MAAM,CAAC;AAC/D;AAEA,SAAS,mBACP,QACA,MACA,YACA,YACA,WACqB;CACrB,IAAI,eAAe,KAAA,GAAW;EAC5B,aAAa;EACb,IAAI,eAAe,KAAA,GACjB,OAAO,gBAAmB;GAAC,MAAM;GAAM,OAAO,KAAA;EAAS,EAAE;CAE7D;CACA,IAAI,CAAC,WAAW,WAAW,QACzB,SAAS,YAAY,MAAM,UAAU,KACrC,SAAS,QAAQ,MAAM,UAAU;CACnC,OACE,CAAC,UAAU,MAAM,SAAS,UAAU,EAAE,CAAC,UAAU,KACjD,2CACF;CACA,IAAI,IAAI,QAAQ,YAAY,KAAK,MAAM,GAAG,UAAU;CACpD,IACE,aACA,IAAI,KAAK,KAAK,UACd,WAAW,KAAK,KAAK,IAAI,UAAU,KAAK,GAExC;CAGF,OAAO,IAAI,qBAAqB,WAAW,WAAW,MAAM,CAAC;AAC/D;AAEA,SAAS,SACP,KACA,MACA,YAC4E;CAC5E,IAAI,WAAW;CACf,MAAM,YAA0B,CAAC;CACjC,MAAM,YAAsB,CAAC;CAE7B,IAAI,SAAS,WAAW,GAAG;EACzB,KAAK,IAAI,IAAI,GAAG,SAAS,WAAW,GAAG,KAAK;GAC1C,UAAU,KAAK,SAAS;GACxB,UAAU,KACR,QAAQ,KAAA,IAAY,IAAI,QAAQ,KAAK,SAAS,MAAM,GAAG,UAAU;GACnE,IAAI,UAAU,MAAM,UAAU,EAAE,CAAC,QAAQ;GACzC,WAAW,UAAU,EAAE,CAAC,UAAU;EACpC;EACA,UAAU,QAAQ;EAClB,UAAU,QAAQ;CACpB;CACA,OAAO;EAAC;EAAW;EAAW;CAAQ;AACxC;AAEA,SAAS,SAAY,MAAoD;CACvE,OAAO;EACL;EACA,CAAC,OAAO,YAAY;GAClB,OAAO;EACT;CACF;AACF;;AAGA,IAAM,QAAN,MAAM,MAAS;CAEb;CAKA;CAEA,YAAY,MAAW;EACrB,KAAK,OAAO;EACZ,KAAK,WAAW,KAAA;CAClB;CAEA,aAAuC;EACrC,OAAO;CACT;CAEA,SAAS;EAEP,OAAO,KAAK,KAAK,GAAG,EAAE;CACxB;CAEA,SAAwB;EACtB,OAAO,KAAK,KAAK;CACnB;CAEA,QAAkB;EAChB,OAAO,IAAI,MAAS,KAAK,KAAK,MAAM,CAAC,CAAC;CACxC;;;;;;CAOA,gBAAgB,KAAkB;EAChC,IAAI,KAAK,KAAK,IAAI;CACpB;CAEA,IAAI,KAAQ,MAAkC;EAC5C,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACrD,OAAO,IAAI,IAAI,KAAA,IAAY,KAAK,KAAK;CACvC;CAEA,IAAI,KAAQ,MAA4B;EACtC,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACrD,OAAO,KAAK,KAAK,IAAI,KAAK,KAAK;CACjC;CAEA,IAAI,KAAQ,MAAoC;EAC9C,IAAI,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACnD,IAAI,IAAI,GAAG;GAET,IAAI,CAAC;GACL,KAAK;GAEL,IAAI,KAAK,KAAK,SAAS,eAAe;IACpC,KAAK,KAAK,OAAO,GAAG,GAAG,GAAG;IAC1B,OAAO;GACT;GAEA,MAAM,kBAAkB,KAAK,kBAAkB;GAE/C,IAAI,SAAmB;GACvB,IAAI,IAAI,KAAK,KAAK,QAAQ;IACxB,KAAK,KAAK,KAAK;IACf,SAAS;GACX;GAEA,OAAO,KAAK,OAAO,GAAG,GAAG,GAAG;GAE5B,OAAO;EACT;EAGA,KAAK,KAAK,KAAK;EACf,OAAO;CACT;CAEA,cAAc,KAAe;EAC3B,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,CAAE;CAClC;CAEA,aAAa,KAAe;EAC1B,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,CAAE;CACnC;CAEA,oBAA8B;EAC5B,MAAM,OAAO,KAAK,KAAK,UAAU;EACjC,MAAM,OAAO,KAAK,KAAK,OAAO,IAAI;EAClC,OAAO,IAAI,MAAS,IAAI;CAC1B;CAEA,OAAO,KAAQ,MAA4B;EACzC,MAAM,MAAM,KAAK;EACjB,MAAM,OAAO,QAAQ,KAAK,KAAK,MAAM,IAAI,GAAG;EAC5C,MAAM,QAAQ,OAAO;EAErB,IAAI,OAAO,GACT,OAAO;EAGT,MAAM,EAAC,SAAQ;EACf,KAAK,IAAI,IAAI,MAAM,IAAI,OAAO,KAAK;GAGjC,IAFY,KAAK,OAEL,KAAK,MAAM,KAAK,aAAa,MACvC,MAAM,IAAI,MAAM,6CAA6C;GAG/D,KAAK,KAAK,OAAO,GAAG,CAAC;GACrB,KAAK;GACL,OAAO;EACT;EAEA,OAAO;CACT;CAEA,aAAa,KAAe,GAAW;EACrC,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI;CAC5B;AACF;;AAGA,IAAM,gBAAN,MAAM,sBAAyB,MAAS;CAItC;;;;;CAMA,YAAY,UAAsB,MAAY;EAC5C,IAAI,CAAC,MAAM;GACT,OAAO,CAAC;GACR,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,KAAK,KAAK,SAAS,EAAE,CAAC,OAAO;EAEjC;EACA,MAAM,IAAI;EACV,KAAK,WAAW;CAClB;CAEA,aAAuC;EACrC,OAAO;CACT;CAEA,QAAkB;EAChB,MAAM,WAAW,KAAK,SAAS,MAAM,CAAC;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,SAAS,EAAE,CAAC,WAAW;EAEzB,OAAO,IAAI,cAAiB,UAAU,KAAK,KAAK,MAAM,CAAC,CAAC;CAC1D;CAEA,SAAS;EACP,OAAO,KAAK,SAAS,EAAE,CAAC,OAAO;CACjC;CAEA,gBAAgB,KAAkB;EAGhC,MAAM,EAAC,aAAY;EACnB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,SAAS,EAAE,CAAC,gBAAgB,GAAG;CAEnC;CAEA,IAAI,KAAQ,MAAkC;EAC5C,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,UAAU;EACpD,MAAM,EAAC,aAAY;EACnB,OAAO,IAAI,SAAS,SAAS,SAAS,EAAE,CAAC,IAAI,KAAK,IAAI,IAAI,KAAA;CAC5D;CAEA,IAAI,KAAQ,MAA4B;EACtC,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,UAAU;EACpD,MAAM,EAAC,aAAY;EACnB,OAAO,IAAI,SAAS,SAAS,SAAS,EAAE,CAAC,IAAI,KAAK,IAAI,IAAI;CAC5D;CAEA,IAAI,KAAQ,MAAoC;EAC9C,MAAM,IAAI,KAAK;EACf,MAAM,MAAM,KAAK;EACjB,IAAI,IAAI,KAAK,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,GAAG,GAAG,EAAE,SAAS,CAAC;EAC9D,IAAI,QAAQ,EAAE;EAEd,IAAI,MAAM,UACR,EAAE,KAAK,QAAQ,MAAM,MAAM;EAE7B,IAAI,MAAM,KAAK,UAAU,eAAe;GAKtC,IAAI;GACJ,IACE,IAAI,MACH,QAAQ,EAAE,IAAI,GAAA,CAAI,KAAK,SAAS,iBACjC,IAAI,MAAM,KAAK,IAAI,GAAG,IAAI,GAC1B;IACA,IAAI,MAAM,UACR,EAAE,IAAI,KAAK,QAAQ,MAAM,MAAM;IAEjC,MAAM,cAAc,KAAK;IACzB,KAAK,KAAK,IAAI,KAAK,MAAM,OAAO;GAClC,OAAO,KACJ,QAAQ,EAAE,IAAI,QAAQ,KAAA,KACvB,MAAM,KAAK,SAAS,iBACpB,IAAI,MAAM,OAAO,GAAG,GAAG,IAAI,GAC3B;IACA,IAAI,MAAM,UAAU,EAAE,IAAI,KAAK,QAAQ,MAAM,MAAM;IACnD,MAAM,aAAa,KAAK;IACxB,KAAK,KAAK,KAAK,EAAE,EAAE,CAAC,OAAO;GAC7B;EACF;EAEA,MAAM,SAAS,MAAM,IAAI,KAAK,IAAI;EAClC,KAAK,KAAK,KAAK,MAAM,OAAO;EAC5B,IAAI,WAAW,MAAM,OAAO;EAG5B,IAAI,KAAK,KAAK,SAAS,eAAe;GAEpC,KAAK,OAAO,IAAI,GAAG,MAAM;GACzB,OAAO;EACT;EAEA,MAAM,kBAAkB,KAAK,kBAAkB;EAE/C,IAAI,SAA2B;EAC/B,IAAI,IAAI,OAAO,OAAO,GAAG,KAAK,OAAO,CAAC,IAAI,GAAG;GAC3C,SAAS;GACT,KAAK,KAAK,KAAK;EACjB;EACA,OAAO,OAAO,IAAI,GAAG,MAAM;EAC3B,OAAO;CACT;;;;;;CAOA,OAAO,GAAW,OAAiB;EACjC,KAAK,SAAS,OAAO,GAAG,GAAG,KAAK;EAChC,KAAK,KAAK,OAAO,GAAG,GAAG,MAAM,OAAO,CAAC;CACvC;;;;;CAMA,oBAAoB;EAClB,MAAM,OAAO,KAAK,SAAS,UAAU;EACrC,OAAO,IAAI,cACT,KAAK,SAAS,OAAO,IAAI,GACzB,KAAK,KAAK,OAAO,IAAI,CACvB;CACF;CAEA,cAAc,KAAe;EAC3B,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,CAAE;EAChC,KAAK,SAAS,KAAM,IAAyB,SAAS,MAAM,CAAE;CAChE;CAEA,aAAa,KAAe;EAC1B,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,CAAE;EACjC,KAAK,SAAS,QAAS,IAAyB,SAAS,IAAI,CAAE;CACjE;CAEA,OAAO,KAAQ,MAA4B;EACzC,MAAM,MAAM,KAAK;EACjB,MAAM,EAAC,SAAQ;EACf,MAAM,EAAC,aAAY;EACnB,IAAI,OAAO,QAAQ,KAAK,KAAK,MAAM,GAAG,GAAG;EACzC,IAAI,IAAI;EACR,MAAM,QAAQ,KAAK,IAAI,MAAM,KAAK,SAAS,CAAC;EAC5C,IAAI,KAAK,OACP,IAAI;GACF,IAAI,SAAS,EAAE,CAAC,UACd,SAAS,KAAK,SAAS,EAAE,CAAC,MAAM;GAElC,MAAM,SAAS,SAAS,EAAE,CAAC,OAAO,KAAK,IAAI;GAG3C,KAAK,KAAK,SAAS,EAAE,CAAC,OAAO;GAC7B,OAAO;EACT,UAAU;GAER,MAAM,OAAO;GACb,IAAI,OAAO,GAAG;GACd,KAAK,IAAI,OAAO,KAAK,MAAM,KACzB,IAAI,SAAS,EAAE,CAAC,KAAK,UAAU,MAAM;IACnC,IAAI,SAAS,EAAE,CAAC,KAAK,WAAW,GAC9B,KAAK,SAAS,GAAG,aAAa;SACzB;KAEL,KAAK,OAAO,GAAG,CAAC;KAChB,SAAS,OAAO,GAAG,CAAC;IACtB;GACF;EAEJ;EAEF,OAAO;CACT;;CAGA,SAAS,GAAW,SAA0B;EAC5C,MAAM,EAAC,aAAY;EACnB,IAAI,KAAK,KAAK,IAAI,IAAI,SAAS,QACzB;OAAA,SAAS,EAAE,CAAC,KAAK,SAAS,SAAS,IAAI,EAAE,CAAC,KAAK,UAAU,SAAS;IACpE,IACE,SAAS,EAAE,CAAC,UAGZ,SAAS,KAAK,SAAS,EAAE,CAAC,MAAM;IAElC,SAAS,EAAE,CAAC,aAAa,SAAS,IAAI,IAAI,OAAO;IACjD,SAAS,OAAO,IAAI,GAAG,CAAC;IACxB,KAAK,KAAK,OAAO,IAAI,GAAG,CAAC;IACzB,KAAK,KAAK,KAAK,SAAS,EAAE,CAAC,OAAO;IAClC,OAAO;GACT;;EAEF,OAAO;CACT;;;;;;CAOA,aAAa,KAAe,aAAqB;EAE/C,MAAM,YAAY,KAAK,KAAK;EAC5B,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI;EAC1B,MAAM,cAAe,IAAoC;EACzD,KAAK,SAAS,KAAK,GAAG,WAAW;EAEjC,IAAI,IAAI,YAAY,CAAC,KAAK,UAGxB,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,YAAY,EAAE,CAAC,WAAW;EAO9B,KAAK,SAAS,YAAY,GAAG,WAAW;CAC1C;AACF;AAIA,SAAS,QACP,KACA,MACA,SACA,YACQ;CACR,IAAI,KAAK;CACT,IAAI,KAAK,KAAK;CACd,IAAI,MAAM,MAAM;CAChB,OAAO,KAAK,IAAI;EACd,MAAM,IAAI,WAAW,KAAK,MAAM,GAAG;EACnC,IAAI,IAAI,GACN,KAAK,MAAM;OACN,IAAI,IAAI,GAEb,KAAK;OACA,IAAI,MAAM,GACf,OAAO;OACF;GAEL,IAAI,QAAQ,KAEV,OAAO,KAAK;GAEd,MAAM,IAAI,MAAM,uBAAuB;EACzC;EACA,MAAO,KAAK,MAAO;CACrB;CACA,OAAO,MAAM;AACf;AAGA,IAAM,YAAY,IAAI,MAAW,CAAC,CAAC;AACnC,UAAU,WAAW"}

package/out/shared/src/headers.js

@@ -0,0 +1,20 @@
+//#region ../shared/src/headers.ts
+var BEARER_PREFIX = "Bearer ";
+var BEARER_PATTERN = /^bearer +(.*)$/i;
+/**
+* Returns the token of an `Authorization: Bearer <token>` header value, or
+* `undefined` if there is no value or it uses another scheme.
+*/
+function getBearerToken(authorization) {
+	return authorization === void 0 ? void 0 : BEARER_PATTERN.exec(authorization)?.[1];
+}
+/**
+* Formats `token` as the value of an `Authorization: Bearer <token>` header.
+*/
+function bearerAuthorization(token) {
+	return BEARER_PREFIX + token;
+}
+//#endregion
+export { bearerAuthorization, getBearerToken };
+
+//# sourceMappingURL=headers.js.map

package/out/shared/src/headers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"headers.js","names":[],"sources":["../../../../shared/src/headers.ts"],"sourcesContent":["export function encodeHeaderValue(value: string): string {\n  // encodeURIComponent escapes the following chars which are allowed\n  // in header values.\n  // : ; , / \" ? { } [ ] @ < > = + # $ & ` | ^ space and %\n  // Unescape all of them expect %, to make the encoded value smaller and more\n  // readable.  Do not unescape % as that would break decoding of the\n  // percent decoding done by encodeURIComponent.\n  return encodeURIComponent(value).replace(\n    /%(3A|3B|2C|2F|22|3F|7B|7D|5B|5D|40|3C|3E|3D|2B|23|24|26|60|7C|5E|20)/g,\n    (_, hex) => String.fromCharCode(parseInt(hex, 16)),\n  );\n}\n\nexport function decodeHeaderValue(encoded: string): string {\n  return decodeURIComponent(encoded);\n}\n\nconst BEARER_PREFIX = 'Bearer ';\n\n// RFC 9110: the scheme is case-insensitive and is followed by one or more\n// spaces.\nconst BEARER_PATTERN = /^bearer +(.*)$/i;\n\n/**\n * Returns the token of an `Authorization: Bearer <token>` header value, or\n * `undefined` if there is no value or it uses another scheme.\n */\nexport function getBearerToken(\n  authorization: string | undefined,\n): string | undefined {\n  return authorization === undefined\n    ? undefined\n    : BEARER_PATTERN.exec(authorization)?.[1];\n}\n\n/**\n * Formats `token` as the value of an `Authorization: Bearer <token>` header.\n */\nexport function bearerAuthorization(token: string): string {\n  return BEARER_PREFIX + token;\n}\n"],"mappings":";AAiBA,IAAM,gBAAgB;AAItB,IAAM,iBAAiB;;;;;AAMvB,SAAgB,eACd,eACoB;CACpB,OAAO,kBAAkB,KAAA,IACrB,KAAA,IACA,eAAe,KAAK,aAAa,CAAC,GAAG;AAC3C;;;;AAKA,SAAgB,oBAAoB,OAAuB;CACzD,OAAO,gBAAgB;AACzB"}