npm - @rocicorp/zero - Versions diffs - 1.10.0-canary.21 → 1.10.0-canary.23 - Mend

@rocicorp/zero 1.10.0-canary.21 → 1.10.0-canary.23

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (334) hide show

package/out/replicache/src/replicache-impl.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"replicache-impl.js","names":["#subscriptions","#mutationRecovery","#kvStoreProvider","#zero","#auth","#idbDatabase","#clientID","#ready","#profileIDPromise","#clientGroupIDPromise","#mutatorRegistry","#requestOptions","#idbDatabases","#lc","#closeAbortController","#persistLock","#enableScheduledPersist","#enableScheduledRefresh","#enableRefresh","#enablePullAndPushInOpen","#onPersist","#queryInternal","#pullConnectionLoop","#invokePull","#pushConnectionLoop","#invokePush","#registerMutators","#wrapInOnlineCheck","#wrapInReauthRetries","#isPullDisabled","#isPushDisabled","#handlePersist","#open","#clientStateNotFoundOnClient","#fireOnUpdateNeeded","#onVisibilityChange","#closed","#checkForClientStateNotFoundAndCallHandler","#online","#schedulePersist","#changeSyncCounters","#convertToClientStateNotFoundError","#handleVersionNotSupportedResponse","#clientStateNotFoundOnServer","#fireOnClientStateNotFound","#schedule","#persistScheduler","#scheduleRefresh","#refreshScheduler","#pushCounter","#pullCounter","#mutate","#register"],"sources":["../../../../replicache/src/replicache-impl.ts"],"sourcesContent":["import {Lock} from '@rocicorp/lock';\nimport type {LogContext} from '@rocicorp/logger';\nimport {consoleLogSink} from '@rocicorp/logger';\nimport {resolver} from '@rocicorp/resolver';\nimport {AbortError} from '../../shared/src/abort-error.ts';\nimport {assert} from '../../shared/src/asserts.ts';\nimport {getBrowserGlobal} from '../../shared/src/browser-env.ts';\nimport {getDocumentVisibilityWatcher} from '../../shared/src/document-visible.ts';\nimport type {JSONValue, ReadonlyJSONValue} from '../../shared/src/json.ts';\nimport {promiseVoid} from '../../shared/src/resolved-promises.ts';\nimport {TESTING} from '../../shared/src/testing.ts';\nimport type {MaybePromise} from '../../shared/src/types.ts';\nimport {PullDelegate, PushDelegate} from './connection-loop-delegates.ts';\nimport {ConnectionLoop, MAX_DELAY_MS, MIN_DELAY_MS} from './connection-loop.ts';\nimport {assertCookie, type Cookie} from './cookies.ts';\nimport {LazyStore} from './dag/lazy-store.ts';\nimport {StoreImpl} from './dag/store-impl.ts';\nimport {ChunkNotFoundError, mustGetHeadHash, type Store} from './dag/store.ts';\nimport {\n baseSnapshotFromHash,\n DEFAULT_HEAD_NAME,\n isLocalMetaDD31,\n type LocalMeta,\n} from './db/commit.ts';\nimport {readFromDefaultHead} from './db/read.ts';\nimport {rebaseMutationAndCommit} from './db/rebase.ts';\nimport {newWriteLocal} from './db/write.ts';\nimport {\n isClientStateNotFoundResponse,\n isVersionNotSupportedResponse,\n type VersionNotSupportedResponse,\n} from './error-responses.ts';\nimport * as FormatVersion from './format-version-enum.ts';\nimport {deepFreeze} from './frozen-json.ts';\nimport {getDefaultPuller, isDefaultPuller} from './get-default-puller.ts';\nimport {getDefaultPusher, isDefaultPusher} from './get-default-pusher.ts';\nimport {getKVStoreProvider} from './get-kv-store-provider.ts';\nimport {assertHash, emptyHash, type Hash, newRandomHash} from './hash.ts';\nimport type {HTTPRequestInfo} from './http-request-info.ts';\nimport {httpStatusUnauthorized} from './http-status-unauthorized.ts';\nimport type {IndexDefinitions} from './index-defs.ts';\nimport type {StoreProvider} from './kv/store.ts';\nimport {createLogContext} from './log-options.ts';\nimport {makeIDBName} from './make-idb-name.ts';\nimport {MutationRecovery} from './mutation-recovery.ts';\nimport {initNewClientChannel} from './new-client-channel.ts';\nimport {\n initOnPersistChannel,\n type OnPersist,\n type PersistInfo,\n} from './on-persist-channel.ts';\nimport {\n type PendingMutation,\n pendingMutationsForAPI,\n} from './pending-mutations.ts';\nimport {\n CLIENT_MAX_INACTIVE_TIME,\n GC_INTERVAL,\n initClientGC,\n} from './persist/client-gc.ts';\nimport {initClientGroupGC} from './persist/client-group-gc.ts';\nimport {disableClientGroup} from './persist/client-groups.ts';\nimport {\n ClientStateNotFoundError,\n initClientV6,\n type OnClientsDeleted,\n hasClientState as persistHasClientState,\n} from './persist/clients.ts';\nimport {\n COLLECT_IDB_INTERVAL,\n initCollectIDBDatabases,\n INITIAL_COLLECT_IDB_DELAY,\n} from './persist/collect-idb-databases.ts';\nimport {HEARTBEAT_INTERVAL, startHeartbeats} from './persist/heartbeat.ts';\nimport {\n IDBDatabasesStore,\n type IndexedDBDatabase,\n} from './persist/idb-databases-store.ts';\nimport {makeClientID} from './persist/make-client-id.ts';\nimport {persistDD31} from './persist/persist.ts';\nimport {refresh} from './persist/refresh.ts';\nimport {ProcessScheduler} from './process-scheduler.ts';\nimport type {Puller} from './puller.ts';\nimport {type Pusher, PushError} from './pusher.ts';\nimport type {\n MutationTrackingData,\n ReplicacheOptions,\n ZeroOption,\n} from './replicache-options.ts';\nimport {ReportError} from './report-error.ts';\nimport {setIntervalWithSignal} from './set-interval-with-signal.ts';\nimport {\n type SubscribeOptions,\n SubscriptionImpl,\n type SubscriptionsManager,\n SubscriptionsManagerImpl,\n type WatchCallback,\n type WatchCallbackForOptions,\n type WatchNoIndexCallback,\n type WatchOptions,\n WatchSubscription,\n} from './subscriptions.ts';\nimport type {DiffsMap} from './sync/diff.ts';\nimport * as HandlePullResponseResultEnum from './sync/handle-pull-response-result-type-enum.ts';\nimport type {ClientGroupID, ClientID} from './sync/ids.ts';\nimport {PullError} from './sync/pull-error.ts';\nimport {beginPullV1, handlePullResponseV1, maybeEndPull} from './sync/pull.ts';\nimport {push, PUSH_VERSION_DD31} from './sync/push.ts';\nimport {newRequestID} from './sync/request-id.ts';\nimport {SYNC_HEAD_NAME} from './sync/sync-head-name.ts';\nimport {throwIfClosed} from './transaction-closed-error.ts';\nimport type {ReadTransaction, WriteTransaction} from './transactions.ts';\nimport {ReadTransactionImpl, WriteTransactionImpl} from './transactions.ts';\nimport type {\n BeginPullResult,\n MakeMutator,\n MakeMutators,\n MutatorDefs,\n MutatorReturn,\n PokeInternal,\n QueryInternal,\n RequestOptions,\n UpdateNeededReason,\n} from './types.ts';\nimport {version} from './version.ts';\nimport {\n withRead,\n withWrite,\n withWriteNoImplicitCommit,\n} from './with-transactions.ts';\n\n/*\n The maximum number of time to call out to getAuth before giving up\n * and throwing an error.\n /\nconst MAX_REAUTH_TRIES = 8;\n\nconst PERSIST_IDLE_TIMEOUT_MS = 1000;\nconst REFRESH_IDLE_TIMEOUT_MS = 1000;\n\nconst PERSIST_THROTTLE_MS = 500;\nconst REFRESH_THROTTLE_MS = 500;\n\n/\n Opening the database blocks everything Replicache does, including Zero's\n * first connect attempt, so a slow open is worth a warning rather than a\n * debug line.\n /\nconst SLOW_DB_OPEN_THRESHOLD_MS = 50;\n\nconst LAZY_STORE_SOURCE_CHUNK_CACHE_SIZE_LIMIT = 100 2 ** 20; // 100 MB\n\nconst RECOVER_MUTATIONS_INTERVAL_MS = 5 * 60 * 1000; // 5 mins\n\nconst noop = () => {\n // noop\n};\n\nconst updateNeededReasonNewClientGroup: UpdateNeededReason = {\n type: 'NewClientGroup',\n} as const;\n\n/** @deprecated Not used any more /\nexport interface MakeSubscriptionsManager {\n (queryInternal: QueryInternal, lc: LogContext): SubscriptionsManager;\n}\n\nexport interface ReplicacheImplOptions {\n /\n Defaults to true.\n /\n enableMutationRecovery?: boolean \| undefined;\n\n /\n Defaults to true.\n /\n enableScheduledPersist?: boolean \| undefined;\n\n /\n Defaults to true.\n /\n enableScheduledRefresh?: boolean \| undefined;\n\n /\n Defaults to `() => true`.\n /\n enableRefresh?: (() => boolean) \| undefined;\n\n /\n Defaults to true.\n /\n enablePullAndPushInOpen?: boolean \| undefined;\n\n /\n @deprecated Not used anymore.\n /\n makeSubscriptionsManager?: unknown;\n\n /\n Default is `true`. If `false` if an exact match client group\n * is not found, a new client group is always made instead of forking\n * from an existing client group.\n /\n enableClientGroupForking?: boolean \| undefined;\n\n /\n Callback for when Replicache has deleted clients.\n /\n onClientsDeleted?: OnClientsDeleted \| undefined;\n\n /\n Internal option used by Zero.\n * Replicache will call this to and, if zero is enabled, will\n * invoke various hooks to allow Zero the keep IVM in sync with Replicache's b-trees.\n /\n zero?: ZeroOption \| undefined;\n}\n\nexport class ReplicacheImpl<MD extends MutatorDefs = {}> {\n /* The URL to use when doing a pull request. /\n pullURL: string;\n\n /* The URL to use when doing a push request. /\n pushURL: string;\n\n /* The authorization token used when doing a push request. /\n #auth: string;\n\n /* The name of the Replicache database. Populated by {@link ReplicacheOptions#name}. /\n readonly name: string;\n\n readonly #subscriptions: SubscriptionsManager;\n readonly #mutationRecovery: MutationRecovery \| undefined;\n\n /\n Client groups gets disabled when the server does not know about it.\n * A disabled client group prevents the client from pushing and pulling.\n /\n isClientGroupDisabled = false;\n\n readonly #kvStoreProvider: StoreProvider;\n\n lastMutationID: number = 0;\n\n /\n This is the name Replicache uses for the IndexedDB database where data is\n * stored.\n /\n get idbName(): string {\n return makeIDBName(this.name, this.schemaVersion);\n }\n\n set auth(auth: string) {\n if (this.#zero) {\n this.#zero.auth = auth;\n }\n\n this.#auth = auth;\n }\n\n get auth() {\n return this.#auth;\n }\n\n /* The schema version of the data understood by this application. /\n readonly schemaVersion: string;\n\n get #idbDatabase(): IndexedDBDatabase {\n return {\n name: this.idbName,\n replicacheName: this.name,\n replicacheFormatVersion: FormatVersion.Latest,\n schemaVersion: this.schemaVersion,\n };\n }\n #closed = false;\n #online = true;\n readonly #clientID = makeClientID();\n readonly #ready: Promise<void>;\n readonly #profileIDPromise: Promise<string>;\n readonly #clientGroupIDPromise: Promise<string>;\n readonly #mutatorRegistry: MutatorDefs = {};\n\n /\n The mutators that was registered in the constructor.\n /\n readonly mutate: MakeMutators<MD>;\n\n // Number of pushes/pulls at the moment.\n #pushCounter = 0;\n #pullCounter = 0;\n\n #pullConnectionLoop: ConnectionLoop;\n #pushConnectionLoop: ConnectionLoop;\n\n /\n The duration between each periodic {@link pull}. Setting this to `null`\n * disables periodic pull completely. Pull will still happen if you call\n * {@link pull} manually.\n /\n pullInterval: number \| null;\n\n /\n The delay between when a change is made to Replicache and when Replicache\n * attempts to push that change.\n /\n pushDelay: number;\n\n readonly #requestOptions: Required<RequestOptions>;\n\n /\n The function to use to pull data from the server.\n /\n puller: Puller;\n\n /\n The function to use to push data to the server.\n /\n pusher: Pusher;\n\n readonly memdag: LazyStore;\n readonly perdag: Store;\n readonly #idbDatabases: IDBDatabasesStore;\n readonly #lc: LogContext;\n readonly #zero: ZeroOption \| undefined;\n\n readonly #closeAbortController = new AbortController();\n\n readonly #persistLock = new Lock();\n readonly #enableScheduledPersist: boolean;\n readonly #enableScheduledRefresh: boolean;\n readonly #enableRefresh: () => boolean;\n readonly #enablePullAndPushInOpen: boolean;\n #persistScheduler = new ProcessScheduler(\n () => this.persist(),\n PERSIST_IDLE_TIMEOUT_MS,\n PERSIST_THROTTLE_MS,\n this.#closeAbortController.signal,\n );\n readonly #onPersist: OnPersist;\n #refreshScheduler = new ProcessScheduler(\n () => this.refresh(),\n REFRESH_IDLE_TIMEOUT_MS,\n REFRESH_THROTTLE_MS,\n this.#closeAbortController.signal,\n );\n\n /\n The options used to control the {@link pull} and push request behavior. This\n * object is live so changes to it will affect the next pull or push call.\n /\n get requestOptions(): Required<RequestOptions> {\n return this.#requestOptions;\n }\n\n /\n `onSync(true)` is called when Replicache transitions from no push or pull\n * happening to at least one happening. `onSync(false)` is called in the\n * opposite case: when Replicache transitions from at least one push or pull\n * happening to none happening.\n \n This can be used in a React like app by doing something like the following:\n \n ```js\n * const [syncing, setSyncing] = useState(false);\n * useEffect(() => {\n * rep.onSync = setSyncing;\n * }, [rep]);\n * ```\n /\n onSync: ((syncing: boolean) => void) \| null = null;\n\n /\n `onClientStateNotFound` is called when the persistent client has been\n * garbage collected. This can happen if the client has no pending mutations\n * and has not been used for a while.\n \n The default behavior is to reload the page (using `location.reload()`). Set\n * this to `null` or provide your own function to prevent the page from\n * reloading automatically.\n /\n onClientStateNotFound: (() => void) \| null = reload;\n\n /\n `onUpdateNeeded` is called when a code update is needed.\n \n A code update can be needed because:\n * - the server no longer supports the {@link pushVersion},\n * {@link pullVersion} or {@link schemaVersion} of the current code.\n * - a new Replicache client has created a new client group, because its code\n * has different mutators, indexes, schema version and/or format version\n * from this Replicache client. This is likely due to the new client having\n * newer code. A code update is needed to be able to locally sync with this\n * new Replicache client (i.e. to sync while offline, the clients can still\n * sync with each other via the server).\n \n The default behavior is to reload the page (using `location.reload()`). Set\n * this to `null` or provide your own function to prevent the page from\n * reloading automatically. You may want to provide your own function to\n * display a toast to inform the end user there is a new version of your app\n * available and prompting them to refresh.\n /\n onUpdateNeeded: ((reason: UpdateNeededReason) => void) \| null = reload;\n\n /\n This gets called when we get an HTTP unauthorized (401) response from the\n * push or pull endpoint. Set this to a function that will ask your user to\n * reauthenticate.\n /\n getAuth: (() => MaybePromise<string \| null \| undefined>) \| null \| undefined =\n null;\n\n // These three are used for testing\n onPushInvoked = () => undefined;\n onBeginPull = () => undefined;\n onRecoverMutations = (r: Promise<boolean>) => r;\n\n constructor(\n options: ReplicacheOptions<MD>,\n implOptions: ReplicacheImplOptions = {},\n ) {\n validateOptions(options);\n const {\n name,\n logLevel = 'info',\n logSinks = [consoleLogSink],\n pullURL = '',\n auth,\n pushDelay = 10,\n pushURL = '',\n schemaVersion = '',\n pullInterval = 60000,\n mutators = {} as MD,\n requestOptions = {},\n puller,\n pusher,\n indexes = {},\n clientMaxAgeMs = CLIENT_MAX_INACTIVE_TIME,\n } = options;\n const {\n enableMutationRecovery = true,\n enableScheduledPersist = true,\n enableScheduledRefresh = true,\n enableRefresh = () => true,\n enablePullAndPushInOpen = true,\n enableClientGroupForking = true,\n onClientsDeleted = () => promiseVoid,\n } = implOptions;\n this.#zero = implOptions.zero;\n this.#auth = auth ?? '';\n this.pullURL = pullURL;\n this.pushURL = pushURL;\n this.name = name;\n this.schemaVersion = schemaVersion;\n this.pullInterval = pullInterval;\n this.pushDelay = pushDelay;\n this.puller = puller ?? getDefaultPuller(this);\n this.pusher = pusher ?? getDefaultPusher(this);\n\n this.#enableScheduledPersist = enableScheduledPersist;\n this.#enableScheduledRefresh = enableScheduledRefresh;\n this.#enableRefresh = enableRefresh;\n this.#enablePullAndPushInOpen = enablePullAndPushInOpen;\n\n this.#lc = createLogContext(logLevel, logSinks, {name});\n this.#lc.debug?.('Constructing Replicache', {\n name,\n 'replicache version': version,\n });\n\n this.#subscriptions = new SubscriptionsManagerImpl(\n this.#queryInternal,\n this.#lc,\n this.#closeAbortController.signal,\n );\n\n const kvStoreProvider = getKVStoreProvider(this.#lc, options.kvStore);\n this.#kvStoreProvider = kvStoreProvider;\n\n const perKVStore = kvStoreProvider.create(this.idbName);\n\n this.#idbDatabases = new IDBDatabasesStore(kvStoreProvider.create);\n this.perdag = new StoreImpl(perKVStore, newRandomHash, assertHash);\n this.memdag = new LazyStore(\n this.perdag,\n LAZY_STORE_SOURCE_CHUNK_CACHE_SIZE_LIMIT,\n newRandomHash,\n assertHash,\n );\n\n // Use a promise-resolve pair so that we have a promise to use even before\n // we call the Open RPC.\n const readyResolver = resolver<void>();\n this.#ready = readyResolver.promise;\n\n const {minDelayMs = MIN_DELAY_MS, maxDelayMs = MAX_DELAY_MS} =\n requestOptions;\n this.#requestOptions = {maxDelayMs, minDelayMs};\n\n const visibilityWatcher = getDocumentVisibilityWatcher(\n getBrowserGlobal('document'),\n 0,\n this.#closeAbortController.signal,\n );\n\n this.#pullConnectionLoop = new ConnectionLoop(\n this.#lc.withContext('PULL'),\n new PullDelegate(this, () => this.#invokePull()),\n visibilityWatcher,\n );\n\n this.#pushConnectionLoop = new ConnectionLoop(\n this.#lc.withContext('PUSH'),\n new PushDelegate(this, () => this.#invokePush()),\n );\n\n this.mutate = this.#registerMutators(mutators);\n\n const profileIDResolver = resolver<string>();\n this.#profileIDPromise = profileIDResolver.promise;\n const clientGroupIDResolver = resolver<string>();\n this.#clientGroupIDPromise = clientGroupIDResolver.promise;\n\n if (!process.env.DISABLE_MUTATION_RECOVERY) {\n this.#mutationRecovery = new MutationRecovery({\n delegate: this,\n lc: this.#lc,\n enableMutationRecovery,\n wrapInOnlineCheck: this.#wrapInOnlineCheck.bind(this),\n wrapInReauthRetries: this.#wrapInReauthRetries.bind(this),\n isPullDisabled: this.#isPullDisabled.bind(this),\n isPushDisabled: this.#isPushDisabled.bind(this),\n clientGroupIDPromise: this.#clientGroupIDPromise,\n });\n }\n\n this.#onPersist = initOnPersistChannel(\n this.name,\n this.#closeAbortController.signal,\n persistInfo => {\n void this.#handlePersist(persistInfo);\n },\n );\n\n void this.#open(\n indexes,\n enableClientGroupForking,\n enableMutationRecovery,\n clientMaxAgeMs,\n profileIDResolver.resolve,\n clientGroupIDResolver.resolve,\n readyResolver.resolve,\n onClientsDeleted,\n );\n }\n\n async #open(\n indexes: IndexDefinitions,\n enableClientGroupForking: boolean,\n enableMutationRecovery: boolean,\n clientMaxAgeMs: number,\n profileIDResolver: (profileID: string) => void,\n resolveClientGroupID: (clientGroupID: ClientGroupID) => void,\n resolveReady: () => void,\n onClientsDeleted: OnClientsDeleted,\n ): Promise<void> {\n const {clientID} = this;\n // Everything up to the head write is what it takes to have a usable\n // database, including waiting out a previous instance of the same name.\n // The timer stops before the replica is loaded into Zero's IVM sources,\n // which is separate work and usually the larger of the two: a number that\n // spanned both would report a slow hydration as a slow disk.\n const openStart = performance.now();\n // If we are currently closing a Replicache instance with the same name,\n // wait for it to finish closing.\n await closingInstances.get(this.name);\n await this.#idbDatabases.getProfileID().then(profileIDResolver);\n await this.#idbDatabases.putDatabase(this.#idbDatabase);\n const [client, headHash, , isNewClientGroup] = await initClientV6(\n clientID,\n this.#lc,\n this.perdag,\n Object.keys(this.#mutatorRegistry),\n indexes,\n FormatVersion.Latest,\n enableClientGroupForking,\n );\n\n resolveClientGroupID(client.clientGroupID);\n await withWrite(this.memdag, write =>\n write.setHead(DEFAULT_HEAD_NAME, headHash),\n );\n\n // Now we have a profileID, a clientID, a clientGroupID and DB!\n const dbOpenMs = performance.now() - openStart;\n if (dbOpenMs > SLOW_DB_OPEN_THRESHOLD_MS) {\n this.#lc.warn?.(`Opening the database took ${Math.round(dbOpenMs)}ms`, {\n name: this.idbName,\n });\n } else {\n this.#lc.debug?.('Opened the database in', Math.round(dbOpenMs), 'ms');\n }\n\n await this.#zero?.init(headHash, this.memdag);\n resolveReady();\n\n if (this.#enablePullAndPushInOpen) {\n this.pull().catch(noop);\n this.push().catch(noop);\n }\n\n const {signal} = this.#closeAbortController;\n\n startHeartbeats(\n clientID,\n this.perdag,\n () => {\n this.#clientStateNotFoundOnClient(clientID);\n },\n HEARTBEAT_INTERVAL,\n this.#lc,\n signal,\n );\n initClientGC(\n clientID,\n this.perdag,\n clientMaxAgeMs,\n GC_INTERVAL,\n onClientsDeleted,\n this.#lc,\n signal,\n );\n initCollectIDBDatabases(\n this.#idbDatabases,\n this.#kvStoreProvider,\n COLLECT_IDB_INTERVAL,\n INITIAL_COLLECT_IDB_DELAY,\n 2 clientMaxAgeMs,\n enableMutationRecovery,\n onClientsDeleted,\n this.#lc,\n signal,\n );\n initClientGroupGC(this.perdag, enableMutationRecovery, this.#lc, signal);\n initNewClientChannel(\n this.name,\n this.idbName,\n signal,\n client.clientGroupID,\n isNewClientGroup,\n () => {\n this.#fireOnUpdateNeeded(updateNeededReasonNewClientGroup);\n },\n this.perdag,\n );\n\n setIntervalWithSignal(\n () => this.recoverMutations(),\n RECOVER_MUTATIONS_INTERVAL_MS,\n signal,\n );\n void this.recoverMutations();\n\n getBrowserGlobal('document')?.addEventListener(\n 'visibilitychange',\n this.#onVisibilityChange,\n );\n }\n\n #onVisibilityChange = async () => {\n if (this.#closed) {\n return;\n }\n\n // In case of running in a worker, we don't have a document.\n if (getBrowserGlobal('document')?.visibilityState !== 'visible') {\n return;\n }\n\n await this.#checkForClientStateNotFoundAndCallHandler();\n };\n\n async #checkForClientStateNotFoundAndCallHandler(): Promise<boolean> {\n const {clientID} = this;\n const hasClientState = await withRead(this.perdag, read =>\n persistHasClientState(clientID, read),\n );\n if (!hasClientState) {\n this.#clientStateNotFoundOnClient(clientID);\n }\n return !hasClientState;\n }\n\n /*\n The browser profile ID for this browser profile. Every instance of Replicache\n * browser-profile-wide shares the same profile ID.\n /\n get profileID(): Promise<string> {\n return this.#profileIDPromise;\n }\n\n /\n The client ID for this instance of Replicache. Each instance of Replicache\n * gets a unique client ID.\n /\n get clientID(): string {\n return this.#clientID;\n }\n\n /\n The client group ID for this instance of Replicache. Instances of\n * Replicache will have the same client group ID if and only if they have\n * the same name, mutators, indexes, schema version, format version, and\n * browser profile.\n /\n get clientGroupID(): Promise<string> {\n return this.#clientGroupIDPromise;\n }\n\n /\n `onOnlineChange` is called when the {@link online} property changes. See\n * {@link online} for more details.\n /\n onOnlineChange: ((online: boolean) => void) \| null = null;\n\n /\n A rough heuristic for whether the client is currently online. Note that\n * there is no way to know for certain whether a client is online - the next\n * request can always fail. This property returns true if the last sync attempt succeeded,\n * and false otherwise.\n /\n get online(): boolean {\n return this.#online;\n }\n\n /\n Whether the Replicache database has been closed. Once Replicache has been\n * closed it no longer syncs and you can no longer read or write data out of\n * it. After it has been closed it is pretty much useless and should not be\n * used any more.\n /\n get closed(): boolean {\n return this.#closed;\n }\n\n /\n Closes this Replicache instance.\n \n When closed all subscriptions end and no more read or writes are allowed.\n /\n async close(): Promise<void> {\n this.#closed = true;\n const {promise, resolve} = resolver();\n closingInstances.set(this.name, promise);\n\n this.#closeAbortController.abort();\n\n getBrowserGlobal('document')?.removeEventListener(\n 'visibilitychange',\n this.#onVisibilityChange,\n );\n\n await this.#ready;\n const closingPromises = [\n this.memdag.close(),\n this.perdag.close(),\n this.#idbDatabases.close(),\n ];\n\n this.#pullConnectionLoop.close();\n this.#pushConnectionLoop.close();\n\n this.#subscriptions.clear();\n\n await Promise.all(closingPromises);\n closingInstances.delete(this.name);\n resolve();\n }\n\n async maybeEndPull(syncHead: Hash, requestID: string): Promise<void> {\n for (;;) {\n if (this.#closed) {\n return;\n }\n\n await this.#ready;\n const {clientID} = this;\n const lc = this.#lc\n .withContext('maybeEndPull')\n .withContext('requestID', requestID);\n const {replayMutations, diffs, oldMainHead, mainHead} =\n await maybeEndPull<LocalMeta>(\n this.memdag,\n lc,\n syncHead,\n clientID,\n this.#subscriptions,\n FormatVersion.Latest,\n );\n\n if (!replayMutations \|\| replayMutations.length === 0) {\n // All done.\n this.#zero?.advance(oldMainHead, mainHead, diffs.get('') ?? []);\n await this.#subscriptions.fire(diffs);\n void this.#schedulePersist();\n return;\n }\n\n // Replay.\n let zeroData = await this.#zero?.getTxData?.(syncHead);\n for (const mutation of replayMutations) {\n // TODO(greg): I'm not sure why this was in Replicache#_mutate...\n // Ensure that we run initial pending subscribe functions before starting a\n // write transaction.\n if (this.#subscriptions.hasPendingSubscriptionRuns) {\n await Promise.resolve();\n }\n const {meta} = mutation;\n const {result, zeroData: next} = await withWriteNoImplicitCommit(\n this.memdag,\n dagWrite =>\n rebaseMutationAndCommit(\n mutation,\n dagWrite,\n syncHead,\n SYNC_HEAD_NAME,\n this.#mutatorRegistry,\n lc,\n isLocalMetaDD31(meta) ? meta.clientID : clientID,\n FormatVersion.Latest,\n zeroData,\n ),\n );\n syncHead = result;\n // The fork the mutation ran against when it succeeded, or the branch we\n // came in with when it threw.\n zeroData = next;\n }\n }\n }\n\n #invokePull(): Promise<boolean> {\n if (this.#isPullDisabled()) {\n return Promise.resolve(true);\n }\n\n return this.#wrapInOnlineCheck(async () => {\n try {\n this.#changeSyncCounters(0, 1);\n const {syncHead, requestID, ok} = await this.beginPull();\n if (!ok) {\n return false;\n }\n if (syncHead !== emptyHash) {\n await this.maybeEndPull(syncHead, requestID);\n }\n } catch (e) {\n throw await this.#convertToClientStateNotFoundError(e);\n } finally {\n this.#changeSyncCounters(0, -1);\n }\n return true;\n }, 'Pull');\n }\n\n #isPullDisabled() {\n return (\n this.isClientGroupDisabled \|\|\n (this.pullURL === '' && isDefaultPuller(this.puller))\n );\n }\n\n async #wrapInOnlineCheck(\n f: () => Promise<boolean>,\n name: string,\n ): Promise<boolean> {\n let online = true;\n\n try {\n return await f();\n } catch (e) {\n // The error paths of beginPull and maybeEndPull need to be reworked.\n //\n // We want to distinguish between:\n // a) network requests failed -- we're offline basically\n // b) sync was aborted because one's already in progress\n // c) oh noes - something unexpected happened\n //\n // Right now, all of these come out as errors. We distinguish (b) with a\n // hacky string search. (a) and (c) are not distinguishable currently\n // because repc doesn't provide sufficient information, so we treat all\n // errors that aren't (b) as (a).\n if (e instanceof PushError \|\| e instanceof PullError) {\n online = false;\n this.#lc.debug?.(`${name} threw:\\n`, e, '\\nwith cause:\\n', e.causedBy);\n } else if (e instanceof ReportError) {\n this.#lc.error?.(e);\n } else {\n this.#lc.info?.(`${name} threw:\\n`, e);\n }\n return false;\n } finally {\n if (this.#online !== online) {\n this.#online = online;\n this.onOnlineChange?.(online);\n if (online) {\n void this.recoverMutations();\n }\n }\n }\n }\n\n async #wrapInReauthRetries<R>(\n f: (\n requestID: string,\n requestLc: LogContext,\n ) => Promise<{\n httpRequestInfo: HTTPRequestInfo \| undefined;\n result: R;\n }>,\n verb: string,\n lc: LogContext,\n preAuth: () => MaybePromise<void> = noop,\n postAuth: () => MaybePromise<void> = noop,\n ): Promise<{\n result: R;\n authFailure: boolean;\n }> {\n const {clientID} = this;\n let reauthAttempts = 0;\n let lastResult;\n lc = lc.withContext(verb);\n do {\n const requestID = newRequestID(clientID);\n const requestLc = lc.withContext('requestID', requestID);\n const {httpRequestInfo, result} = await f(requestID, requestLc);\n lastResult = result;\n if (!httpRequestInfo) {\n return {\n result,\n authFailure: false,\n };\n }\n const {errorMessage, httpStatusCode} = httpRequestInfo;\n\n if (errorMessage \|\| httpStatusCode !== 200) {\n // TODO(arv): Maybe we should not log the server URL when the error comes\n // from a Pusher/Puller?\n requestLc.error?.(\n `Got a non 200 response doing ${verb}: ${httpStatusCode}` +\n (errorMessage ? `: ${errorMessage}` : ''),\n );\n }\n if (httpStatusCode !== httpStatusUnauthorized) {\n return {\n result,\n authFailure: false,\n };\n }\n if (!this.getAuth) {\n return {\n result,\n authFailure: true,\n };\n }\n let auth;\n try {\n await preAuth();\n auth = await this.getAuth();\n } finally {\n await postAuth();\n }\n if (auth === null \|\| auth === undefined) {\n return {\n result,\n authFailure: true,\n };\n }\n this.auth = auth;\n reauthAttempts++;\n } while (reauthAttempts < MAX_REAUTH_TRIES);\n lc.info?.('Tried to reauthenticate too many times');\n return {\n result: lastResult,\n authFailure: true,\n };\n }\n\n #isPushDisabled() {\n return (\n this.isClientGroupDisabled \|\|\n (this.pushURL === '' && isDefaultPusher(this.pusher))\n );\n }\n\n async #invokePush(): Promise<boolean> {\n if (TESTING) {\n this.onPushInvoked();\n }\n if (this.#isPushDisabled()) {\n return true;\n }\n\n await this.#ready;\n const profileID = await this.#profileIDPromise;\n const {clientID} = this;\n const clientGroupID = await this.#clientGroupIDPromise;\n return this.#wrapInOnlineCheck(async () => {\n const {result: pusherResult} = await this.#wrapInReauthRetries(\n async (requestID: string, requestLc: LogContext) => {\n try {\n this.#changeSyncCounters(1, 0);\n const pusherResult = await push(\n requestID,\n this.memdag,\n requestLc,\n profileID,\n clientGroupID,\n clientID,\n this.pusher,\n this.schemaVersion,\n PUSH_VERSION_DD31,\n );\n return {\n result: pusherResult,\n httpRequestInfo: pusherResult?.httpRequestInfo,\n };\n } finally {\n this.#changeSyncCounters(-1, 0);\n }\n },\n 'push',\n this.#lc,\n );\n\n if (pusherResult === undefined) {\n // No pending mutations.\n return true;\n }\n\n const {response, httpRequestInfo} = pusherResult;\n\n if (isVersionNotSupportedResponse(response)) {\n this.#handleVersionNotSupportedResponse(response);\n } else if (isClientStateNotFoundResponse(response)) {\n await this.#clientStateNotFoundOnServer();\n }\n\n // No pushResponse means we didn't do a push because there were no\n // pending mutations.\n return httpRequestInfo.httpStatusCode === 200;\n }, 'Push');\n }\n\n #handleVersionNotSupportedResponse(response: VersionNotSupportedResponse) {\n const reason: UpdateNeededReason = {\n type: response.error,\n };\n if (response.versionType) {\n reason.versionType = response.versionType;\n }\n this.#fireOnUpdateNeeded(reason);\n }\n\n /\n Push pushes pending changes to the {@link pushURL}.\n \n You do not usually need to manually call push. If {@link pushDelay} is\n * non-zero (which it is by default) pushes happen automatically shortly after\n * mutations.\n \n If the server endpoint fails push will be continuously retried with an\n * exponential backoff.\n \n @param [now=false] If true, push will happen immediately and ignore\n * {@link pushDelay}, {@link RequestOptions.minDelayMs} as well as the\n * exponential backoff in case of errors.\n * @returns A promise that resolves when the next push completes. In case of\n * errors the first error will reject the returned promise. Subsequent errors\n * will not be reflected in the promise.\n /\n push({now = false} = {}): Promise<void> {\n return throwIfError(this.#pushConnectionLoop.send(now));\n }\n\n /\n Pull pulls changes from the {@link pullURL}. If there are any changes local\n * changes will get replayed on top of the new server state.\n \n If the server endpoint fails pull will be continuously retried with an\n * exponential backoff.\n \n @param [now=false] If true, pull will happen immediately and ignore\n * {@link RequestOptions.minDelayMs} as well as the exponential backoff in\n * case of errors.\n * @returns A promise that resolves when the next pull completes. In case of\n * errors the first error will reject the returned promise. Subsequent errors\n * will not be reflected in the promise.\n /\n pull({now = false} = {}): Promise<void> {\n return throwIfError(this.#pullConnectionLoop.send(now));\n }\n\n /\n Applies an update from the server to Replicache.\n * Throws an error if cookie does not match. In that case the server thinks\n * this client has a different cookie than it does; the caller should disconnect\n * from the server and re-register, which transmits the cookie the client actually\n * has.\n \n @experimental This method is under development and its semantics will change.\n /\n async poke(poke: PokeInternal): Promise<void> {\n await this.#ready;\n // TODO(MP) Previously we created a request ID here and included it with the\n // PullRequest to the server so we could tie events across client and server\n // together. Since the direction is now reversed, creating and adding a request ID\n // here is kind of silly. We should consider creating the request ID\n // on the server* and passing it down in the poke for inclusion here in the log\n // context\n const {clientID} = this;\n const requestID = newRequestID(clientID);\n const lc = this.#lc\n .withContext('handlePullResponse')\n .withContext('requestID', requestID);\n\n const {pullResponse} = poke;\n\n if (isVersionNotSupportedResponse(pullResponse)) {\n this.#handleVersionNotSupportedResponse(pullResponse);\n return;\n }\n\n if (isClientStateNotFoundResponse(pullResponse)) {\n await this.#clientStateNotFoundOnServer();\n return;\n }\n\n const result = await handlePullResponseV1(\n lc,\n this.memdag,\n deepFreeze(poke.baseCookie),\n pullResponse,\n clientID,\n FormatVersion.Latest,\n );\n\n switch (result.type) {\n case HandlePullResponseResultEnum.Applied:\n await this.maybeEndPull(result.syncHead, requestID);\n break;\n case HandlePullResponseResultEnum.CookieMismatch:\n throw new Error(\n 'unexpected base cookie for poke: ' + JSON.stringify(poke),\n );\n case HandlePullResponseResultEnum.NoOp:\n break;\n }\n }\n\n async beginPull(): Promise<BeginPullResult> {\n if (TESTING) {\n this.onBeginPull();\n }\n await this.#ready;\n const profileID = await this.profileID;\n const {clientID} = this;\n const clientGroupID = await this.#clientGroupIDPromise;\n const {\n result: {beginPullResponse, requestID},\n } = await this.#wrapInReauthRetries(\n async (requestID: string, requestLc: LogContext) => {\n const beginPullResponse = await beginPullV1(\n profileID,\n clientID,\n clientGroupID,\n this.schemaVersion,\n this.puller,\n requestID,\n this.memdag,\n FormatVersion.Latest,\n requestLc,\n );\n return {\n result: {beginPullResponse, requestID},\n httpRequestInfo: beginPullResponse.httpRequestInfo,\n };\n },\n 'pull',\n this.#lc,\n () => this.#changeSyncCounters(0, -1),\n () => this.#changeSyncCounters(0, 1),\n );\n\n const {pullResponse} = beginPullResponse;\n if (isVersionNotSupportedResponse(pullResponse)) {\n this.#handleVersionNotSupportedResponse(pullResponse);\n } else if (isClientStateNotFoundResponse(beginPullResponse.pullResponse)) {\n await this.#clientStateNotFoundOnServer();\n }\n\n const {syncHead, httpRequestInfo} = beginPullResponse;\n return {requestID, syncHead, ok: httpRequestInfo.httpStatusCode === 200};\n }\n\n persist(): Promise<void> {\n // Prevent multiple persist calls from running at the same time.\n return this.#persistLock.withLock(async () => {\n const {clientID} = this;\n await this.#ready;\n if (this.#closed) {\n return;\n }\n try {\n await persistDD31(\n this.#lc,\n clientID,\n this.memdag,\n this.perdag,\n this.#mutatorRegistry,\n () => this.#closed,\n FormatVersion.Latest,\n this.#zero?.getTxData,\n );\n } catch (e) {\n if (e instanceof ClientStateNotFoundError) {\n this.#clientStateNotFoundOnClient(clientID);\n } else if (this.#closed) {\n this.#lc.debug?.('Exception persisting during close', e);\n } else {\n throw e;\n }\n }\n\n const clientGroupID = await this.#clientGroupIDPromise;\n assert(clientGroupID, 'Expected clientGroupID to be defined');\n this.#onPersist({clientID, clientGroupID});\n });\n }\n\n async refresh(): Promise<void> {\n await this.#ready;\n const {clientID} = this;\n if (this.#closed \|\| !this.#enableRefresh()) {\n return;\n }\n let refreshResult: Awaited<ReturnType<typeof refresh>>;\n try {\n refreshResult = await refresh(\n this.#lc,\n this.memdag,\n this.perdag,\n clientID,\n this.#mutatorRegistry,\n this.#subscriptions,\n () => this.closed,\n FormatVersion.Latest,\n this.#zero,\n );\n } catch (e) {\n if (e instanceof ClientStateNotFoundError) {\n this.#clientStateNotFoundOnClient(clientID);\n } else if (this.#closed) {\n this.#lc.debug?.('Exception refreshing during close', e);\n } else {\n throw e;\n }\n }\n if (refreshResult !== undefined) {\n await this.#subscriptions.fire(refreshResult.diffs);\n }\n }\n\n #fireOnClientStateNotFound() {\n this.onClientStateNotFound?.();\n }\n\n #clientStateNotFoundOnClient(clientID: ClientID) {\n this.#lc.error?.(`Client state not found on client, clientID: ${clientID}`);\n this.#fireOnClientStateNotFound();\n }\n\n async #clientStateNotFoundOnServer() {\n const clientGroupID = await this.#clientGroupIDPromise;\n this.#lc.error?.(\n `Client state not found on server, clientGroupID: ${clientGroupID}`,\n );\n await this.disableClientGroup();\n this.#fireOnClientStateNotFound();\n }\n\n async disableClientGroup(): Promise<void> {\n const clientGroupID = await this.#clientGroupIDPromise;\n assert(clientGroupID, 'Expected clientGroupID to be defined');\n this.isClientGroupDisabled = true;\n await withWrite(this.perdag, dagWrite =>\n disableClientGroup(clientGroupID, dagWrite),\n );\n }\n\n #fireOnUpdateNeeded(reason: UpdateNeededReason) {\n this.#lc.debug?.(`Update needed, reason: ${reason}`);\n this.onUpdateNeeded?.(reason);\n }\n\n async #schedulePersist(): Promise<void> {\n if (!this.#enableScheduledPersist) {\n return;\n }\n await this.#schedule('persist', this.#persistScheduler);\n }\n\n async #handlePersist(persistInfo: PersistInfo): Promise<void> {\n this.#lc.debug?.('Handling persist', persistInfo);\n const clientGroupID = await this.#clientGroupIDPromise;\n if (persistInfo.clientGroupID === clientGroupID) {\n void this.#scheduleRefresh();\n }\n }\n\n async #scheduleRefresh(): Promise<void> {\n if (!this.#enableScheduledRefresh) {\n return;\n }\n await this.#schedule('refresh from storage', this.#refreshScheduler);\n }\n\n async #schedule(name: string, scheduler: ProcessScheduler): Promise<void> {\n try {\n await scheduler.schedule();\n } catch (e) {\n if (e instanceof AbortError) {\n this.#lc.debug?.(`Scheduled ${name} did not complete before close.`);\n } else {\n this.#lc.error?.(`Error during ${name}`, e);\n }\n }\n }\n\n /*\n Runs a refresh as soon as possible through the refresh scheduler.\n /\n runRefresh(): Promise<void> {\n return this.#refreshScheduler.run();\n }\n\n #changeSyncCounters(pushDelta: 0, pullDelta: 1 \| -1): void;\n #changeSyncCounters(pushDelta: 1 \| -1, pullDelta: 0): void;\n #changeSyncCounters(pushDelta: number, pullDelta: number): void {\n this.#pushCounter += pushDelta;\n this.#pullCounter += pullDelta;\n const delta = pushDelta + pullDelta;\n const counter = this.#pushCounter + this.#pullCounter;\n if ((delta === 1 && counter === 1) \|\| counter === 0) {\n const syncing = counter > 0;\n // Run in a new microtask.\n void Promise.resolve().then(() => this.onSync?.(syncing));\n }\n }\n\n /\n Subscribe to the result of a {@link query}. The `body` function is\n * evaluated once and its results are returned via `onData`.\n \n Thereafter, each time the the result of `body` changes, `onData` is fired\n * again with the new result.\n \n `subscribe()` goes to significant effort to avoid extraneous work\n * re-evaluating subscriptions:\n \n 1. subscribe tracks the keys that `body` accesses each time it runs. `body`\n * is only re-evaluated when those keys change.\n * 2. subscribe only re-fires `onData` in the case that a result changes by\n * way of the `isEqual` option which defaults to doing a deep JSON value\n * equality check.\n \n Because of (1), `body` must be a pure function of the data in Replicache.\n * `body` must not access anything other than the `tx` parameter passed to it.\n \n Although subscribe is as efficient as it can be, it is somewhat constrained\n * by the goal of returning an arbitrary computation of the cache. For even\n * better performance (but worse dx), see {@link experimentalWatch}.\n \n If an error occurs in the `body` the `onError` function is called if\n * present. Otherwise, the error is logged at log level 'error'.\n \n To cancel the subscription, call the returned function.\n \n @param body The function to evaluate to get the value to pass into\n * `onData`.\n * @param options Options is either a function or an object. If it is a\n * function it is equivalent to passing it as the `onData` property of an\n * object.\n /\n subscribe<R>(\n body: (tx: ReadTransaction) => Promise<R>,\n options: SubscribeOptions<R> \| ((result: R) => void),\n ): () => void {\n if (typeof options === 'function') {\n options = {onData: options};\n }\n\n const {onData, onError, onDone, isEqual} = options;\n return this.#subscriptions.add(\n new SubscriptionImpl(body, onData, onError, onDone, isEqual),\n );\n }\n\n /\n Watches Replicache for changes.\n \n The `callback` gets called whenever the underlying data changes and the\n * `key` changes matches the `prefix` of {@link ExperimentalWatchIndexOptions} or\n * {@link ExperimentalWatchNoIndexOptions} if present. If a change\n * occurs to the data but the change does not impact the key space the\n * callback is not called. In other words, the callback is never called with\n * an empty diff.\n \n This gets called after commit (a mutation or a rebase).\n \n @experimental This method is under development and its semantics will\n * change.\n /\n experimentalWatch(callback: WatchNoIndexCallback): () => void;\n experimentalWatch<Options extends WatchOptions>(\n callback: WatchCallbackForOptions<Options>,\n options?: Options,\n ): () => void;\n experimentalWatch<Options extends WatchOptions>(\n callback: WatchCallbackForOptions<Options>,\n options?: Options,\n ): () => void {\n return this.#subscriptions.add(\n new WatchSubscription(callback as WatchCallback, options),\n );\n }\n\n /\n Query is used for read transactions. It is recommended to use transactions\n * to ensure you get a consistent view across multiple calls to `get`, `has`\n * and `scan`.\n /\n query<R>(body: (tx: ReadTransaction) => Promise<R> \| R): Promise<R> {\n return this.#queryInternal(body);\n }\n\n get cookie(): Promise<Cookie> {\n return this.#ready.then(() =>\n withRead(this.memdag, async dagRead => {\n const mainHeadHash = await dagRead.getHead(DEFAULT_HEAD_NAME);\n if (!mainHeadHash) {\n throw new Error('Internal no main head found');\n }\n const baseSnapshot = await baseSnapshotFromHash(mainHeadHash, dagRead);\n const baseSnapshotMeta = baseSnapshot.meta;\n const cookie = baseSnapshotMeta.cookieJSON;\n assertCookie(cookie);\n return cookie;\n }),\n );\n }\n\n #queryInternal: QueryInternal = async body => {\n await this.#ready;\n const {clientID} = this;\n return withRead(this.memdag, async dagRead => {\n try {\n const dbRead = await readFromDefaultHead(dagRead, FormatVersion.Latest);\n const tx = new ReadTransactionImpl(clientID, dbRead, this.#lc);\n return await body(tx);\n } catch (ex) {\n throw await this.#convertToClientStateNotFoundError(ex);\n }\n });\n };\n\n #register<Return extends ReadonlyJSONValue \| void, Args extends JSONValue>(\n name: string,\n mutatorImpl: (tx: WriteTransaction, args?: Args) => MaybePromise<Return>,\n ): (\n args?: Args,\n ) => Promise<Return> \| {client: Promise<Return>; server: Promise<unknown>} {\n this.#mutatorRegistry[name] = mutatorImpl as (\n tx: WriteTransaction,\n args: JSONValue \| undefined,\n ) => Promise<void \| JSONValue>;\n\n return (\n args?: Args,\n ):\n \| Promise<Return>\n \| {client: Promise<Return>; server: Promise<unknown>} => {\n // DO NOT track CRUD mutations as they do not receive responses from\n // the server.\n const trackingData =\n name === '_zero_crud' ? undefined : this.#zero?.trackMutation();\n\n const result = this.#mutate(\n trackingData,\n name,\n mutatorImpl,\n args,\n performance.now(),\n );\n\n if (trackingData) {\n return {\n client: result,\n server: trackingData.serverPromise,\n };\n }\n\n return result;\n };\n }\n\n #registerMutators<\n M extends {\n [key: string]: (\n tx: WriteTransaction,\n args?: ReadonlyJSONValue,\n ) => MutatorReturn;\n },\n >(regs: M): MakeMutators<M> {\n type Mut = MakeMutators<M>;\n const rv: Partial<Mut> = Object.create(null);\n for (const k in regs) {\n rv[k] = this.#register(k, regs[k]) as MakeMutator<M[typeof k]>;\n }\n return rv as Mut;\n }\n\n async #mutate<\n R extends ReadonlyJSONValue \| void,\n A extends ReadonlyJSONValue,\n >(\n trackingData: MutationTrackingData \| undefined,\n name: string,\n mutatorImpl: (tx: WriteTransaction, args?: A) => MaybePromise<R>,\n args: A \| undefined,\n timestamp: number,\n ): Promise<R> {\n const frozenArgs = deepFreeze(args ?? null);\n\n // Ensure that we run initial pending subscribe functions before starting a\n // write transaction.\n if (this.#subscriptions.hasPendingSubscriptionRuns) {\n await Promise.resolve();\n }\n\n await this.#ready;\n const {clientID} = this;\n return withWriteNoImplicitCommit(this.memdag, async dagWrite => {\n try {\n let result: R;\n let newHead: Hash;\n let diffs: DiffsMap;\n let headHash: Hash;\n try {\n headHash = await mustGetHeadHash(DEFAULT_HEAD_NAME, dagWrite);\n const originalHash = null;\n\n const dbWrite = await newWriteLocal(\n headHash,\n name,\n frozenArgs,\n originalHash,\n dagWrite,\n timestamp,\n clientID,\n FormatVersion.Latest,\n );\n\n const mutationID = await dbWrite.getMutationID();\n const tx = new WriteTransactionImpl(\n clientID,\n mutationID,\n 'initial',\n await this.#zero?.getTxData(headHash, {\n openLazyRead: dagWrite,\n }),\n dbWrite,\n this.#lc,\n );\n\n if (trackingData) {\n this.#zero?.mutationIDAssigned(\n trackingData.ephemeralID,\n mutationID,\n );\n }\n\n result = await mutatorImpl(tx, args);\n\n throwIfClosed(dbWrite);\n const lastMutationID = await dbWrite.getMutationID();\n [newHead, diffs] = await dbWrite.commitWithDiffs(\n DEFAULT_HEAD_NAME,\n this.#subscriptions,\n );\n\n // Update this after the commit in case the commit fails.\n this.lastMutationID = lastMutationID;\n } catch (e) {\n // If we threw before we could persist the mutation\n // then we need to reject the mutation.\n if (trackingData) {\n this.#zero?.rejectMutation(trackingData.ephemeralID, e);\n }\n throw e;\n }\n\n this.#zero?.advance(headHash, newHead, diffs.get('') ?? []);\n\n // Send is not supposed to reject\n this.#pushConnectionLoop.send(false).catch(() => void 0);\n await this.#subscriptions.fire(diffs);\n void this.#schedulePersist();\n return result;\n } catch (ex) {\n throw await this.#convertToClientStateNotFoundError(ex);\n }\n });\n }\n\n /\n In the case we get a ChunkNotFoundError we check if the client got garbage\n * collected and if so change the error to a ClientStateNotFoundError instead\n /\n async #convertToClientStateNotFoundError(ex: unknown): Promise<unknown> {\n if (\n ex instanceof ChunkNotFoundError &&\n (await this.#checkForClientStateNotFoundAndCallHandler())\n ) {\n return new ClientStateNotFoundError(this.clientID);\n }\n\n return ex;\n }\n\n recoverMutations(): Promise<boolean> \| void {\n if (!process.env.DISABLE_MUTATION_RECOVERY) {\n // oxlint-disable-next-line no-non-null-assertion\n const result = this.#mutationRecovery!.recoverMutations(\n this.#ready,\n this.perdag,\n this.#idbDatabase,\n this.#idbDatabases,\n this.#kvStoreProvider.create,\n );\n if (TESTING) {\n void this.onRecoverMutations(result);\n }\n return result;\n }\n }\n\n /\n List of pending mutations. The order of this is from oldest to newest.\n \n Gives a list of local mutations that have `mutationID` >\n * `syncHead.mutationID` that exists on the main client group.\n \n @experimental This method is experimental and may change in the future.\n */\n experimentalPendingMutations(): Promise<readonly PendingMutation[]> {\n return withRead(this.memdag, pendingMutationsForAPI);\n }\n}\n\n// This map is used to keep track of closing instances of Replicache. When an\n// instance is opening we wait for any currently closing instances.\nconst closingInstances: Map<string, Promise<unknown>> = new Map();\n\nasync function throwIfError(p: Promise<undefined \| {error: unknown}>) {\n const res = await p;\n if (res) {\n throw res.error;\n }\n}\n\nfunction reload(): void {\n if (typeof location !== 'undefined') {\n location.reload();\n }\n}\n\nfunction validateOptions<MD extends MutatorDefs>(\n options: ReplicacheOptions<MD>,\n): void {\n const {name, clientMaxAgeMs} = options;\n if (typeof name !== 'string' \|\| !name) {\n throw new TypeError('name is required and must be non-empty');\n }\n\n if (clientMaxAgeMs !== undefined) {\n const min = Math.max(GC_INTERVAL, HEARTBEAT_INTERVAL);\n if (typeof clientMaxAgeMs !== 'number' \|\| clientMaxAgeMs <= min) {\n throw new TypeError(\n `clientAgeMaxMs must be a number larger than ${min}ms`,\n );\n }\n }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuIA,IAAM,mBAAmB;AAEzB,IAAM,0BAA0B;AAChC,IAAM,0BAA0B;AAEhC,IAAM,sBAAsB;AAC5B,IAAM,sBAAsB;;;;;;AAO5B,IAAM,4BAA4B;AAElC,IAAM,2CAA2C,MAAM,KAAK;AAE5D,IAAM,gCAAgC,MAAS;AAE/C,IAAM,aAAa,CAEnB;AAEA,IAAM,mCAAuD,EAC3D,MAAM,iBACR;AA0DA,IAAa,iBAAb,MAAyD;;CAEvD;;CAGA;;CAGA;;CAGA;CAEA;CACA;;;;;CAMA,wBAAwB;CAExB;CAEA,iBAAyB;;;;;CAMzB,IAAI,UAAkB;EACpB,OAAO,YAAY,KAAK,MAAM,KAAK,aAAa;CAClD;CAEA,IAAI,KAAK,MAAc;EACrB,IAAI,KAAKG,OACP,KAAKA,MAAM,OAAO;EAGpB,KAAKC,QAAQ;CACf;CAEA,IAAI,OAAO;EACT,OAAO,KAAKA;CACd;;CAGA;CAEA,IAAIC,eAAkC;EACpC,OAAO;GACL,MAAM,KAAK;GACX,gBAAgB,KAAK;GACrB,yBAAyB;GACzB,eAAe,KAAK;EACtB;CACF;CACA,UAAU;CACV,UAAU;CACV,YAAqB,aAAa;CAClC;CACA;CACA;CACA,mBAAyC,CAAC;;;;CAK1C;CAGA,eAAe;CACf,eAAe;CAEf;CACA;;;;;;CAOA;;;;;CAMA;CAEA;;;;CAKA;;;;CAKA;CAEA;CACA;CACA;CACA;CACA;CAEA,wBAAiC,IAAI,gBAAgB;CAErD,eAAwB,IAAI,KAAK;CACjC;CACA;CACA;CACA;CACA,oBAAoB,IAAI,uBAChB,KAAK,QAAQ,GACnB,yBACA,qBACA,KAAKS,sBAAsB,MAC7B;CACA;CACA,oBAAoB,IAAI,uBAChB,KAAK,QAAQ,GACnB,yBACA,qBACA,KAAKA,sBAAsB,MAC7B;;;;;CAMA,IAAI,iBAA2C;EAC7C,OAAO,KAAKH;CACd;;;;;;;;;;;;;;;;CAiBA,SAA8C;;;;;;;;;;CAW9C,wBAA6C;;;;;;;;;;;;;;;;;;;;CAqB7C,iBAAgE;;;;;;CAOhE,UACE;CAGF,sBAAsB,KAAA;CACtB,oBAAoB,KAAA;CACpB,sBAAsB,MAAwB;CAE9C,YACE,SACA,cAAqC,CAAC,GACtC;EACA,gBAAgB,OAAO;EACvB,MAAM,EACJ,MACA,WAAW,QACX,WAAW,CAAC,cAAc,GAC1B,UAAU,IACV,MACA,YAAY,IACZ,UAAU,IACV,gBAAgB,IAChB,eAAe,KACf,WAAW,CAAC,GACZ,iBAAiB,CAAC,GAClB,QACA,QACA,UAAU,CAAC,GACX,iBAAiB,6BACf;EACJ,MAAM,EACJ,yBAAyB,MACzB,yBAAyB,MACzB,yBAAyB,MACzB,sBAAsB,MACtB,0BAA0B,MAC1B,2BAA2B,MAC3B,yBAAyB,gBACvB;EACJ,KAAKR,QAAQ,YAAY;EACzB,KAAKC,QAAQ,QAAQ;EACrB,KAAK,UAAU;EACf,KAAK,UAAU;EACf,KAAK,OAAO;EACZ,KAAK,gBAAgB;EACrB,KAAK,eAAe;EACpB,KAAK,YAAY;EACjB,KAAK,SAAS,UAAU,iBAAiB,IAAI;EAC7C,KAAK,SAAS,UAAU,iBAAiB,IAAI;EAE7C,KAAKY,0BAA0B;EAC/B,KAAKC,0BAA0B;EAC/B,KAAKC,iBAAiB;EACtB,KAAKC,2BAA2B;EAEhC,KAAKN,MAAM,iBAAiB,UAAU,UAAU,EAAC,KAAI,CAAC;EACtD,KAAKA,IAAI,QAAQ,2BAA2B;GAC1C;GACA,sBAAsB;EACxB,CAAC;EAED,KAAKb,iBAAiB,IAAI,yBACxB,KAAKqB,gBACL,KAAKR,KACL,KAAKC,sBAAsB,MAC7B;EAEA,MAAM,kBAAkB,mBAAmB,KAAKD,KAAK,QAAQ,OAAO;EACpE,KAAKX,mBAAmB;EAExB,MAAM,aAAa,gBAAgB,OAAO,KAAK,OAAO;EAEtD,KAAKU,gBAAgB,IAAI,kBAAkB,gBAAgB,MAAM;EACjE,KAAK,SAAS,IAAI,UAAU,YAAY,eAAe,UAAU;EACjE,KAAK,SAAS,IAAI,UAChB,KAAK,QACL,0CACA,eACA,UACF;EAIA,MAAM,gBAAgB,SAAe;EACrC,KAAKL,SAAS,cAAc;EAE5B,MAAM,EAAC,aAAA,IAA2B,aAAa,iBAC7C;EACF,KAAKI,kBAAkB;GAAC;GAAY;EAAU;EAE9C,MAAM,oBAAoB,6BACxB,iBAAiB,UAAU,GAC3B,GACA,KAAKG,sBAAsB,MAC7B;EAEA,KAAKQ,sBAAsB,IAAI,eAC7B,KAAKT,IAAI,YAAY,MAAM,GAC3B,IAAI,aAAa,YAAY,KAAKU,YAAY,CAAC,GAC/C,iBACF;EAEA,KAAKC,sBAAsB,IAAI,eAC7B,KAAKX,IAAI,YAAY,MAAM,GAC3B,IAAI,aAAa,YAAY,KAAKY,YAAY,CAAC,CACjD;EAEA,KAAK,SAAS,KAAKC,kBAAkB,QAAQ;EAE7C,MAAM,oBAAoB,SAAiB;EAC3C,KAAKlB,oBAAoB,kBAAkB;EAC3C,MAAM,wBAAwB,SAAiB;EAC/C,KAAKC,wBAAwB,sBAAsB;EAenD,KAAKW,aAAa,qBAChB,KAAK,MACL,KAAKN,sBAAsB,SAC3B,gBAAe;GACb,KAAUiB,eAAe,WAAW;EACtC,CACF;EAEA,KAAUC,MACR,SACA,0BACA,wBACA,gBACA,kBAAkB,SAClB,sBAAsB,SACtB,cAAc,SACd,gBACF;CACF;CAEA,MAAMA,MACJ,SACA,0BACA,wBACA,gBACA,mBACA,sBACA,cACA,kBACe;EACf,MAAM,EAAC,aAAY;EAMnB,MAAM,YAAY,YAAY,IAAI;EAGlC,MAAM,iBAAiB,IAAI,KAAK,IAAI;EACpC,MAAM,KAAKpB,cAAc,aAAa,EAAE,KAAK,iBAAiB;EAC9D,MAAM,KAAKA,cAAc,YAAY,KAAKP,YAAY;EACtD,MAAM,CAAC,QAAQ,YAAY,oBAAoB,MAAM,aACnD,UACA,KAAKQ,KACL,KAAK,QACL,OAAO,KAAK,KAAKH,gBAAgB,GACjC,SACA,GACA,wBACF;EAEA,qBAAqB,OAAO,aAAa;EACzC,MAAM,UAAU,KAAK,SAAQ,UAC3B,MAAM,QAAQ,mBAAmB,QAAQ,CAC3C;EAGA,MAAM,WAAW,YAAY,IAAI,IAAI;EACrC,IAAI,WAAW,2BACb,KAAKG,IAAI,OAAO,6BAA6B,KAAK,MAAM,QAAQ,EAAE,KAAK,EACrE,MAAM,KAAK,QACb,CAAC;OAED,KAAKA,IAAI,QAAQ,0BAA0B,KAAK,MAAM,QAAQ,GAAG,IAAI;EAGvE,MAAM,KAAKV,OAAO,KAAK,UAAU,KAAK,MAAM;EAC5C,aAAa;EAEb,IAAI,KAAKgB,0BAA0B;GACjC,KAAK,KAAK,EAAE,MAAM,IAAI;GACtB,KAAK,KAAK,EAAE,MAAM,IAAI;EACxB;EAEA,MAAM,EAAC,WAAU,KAAKL;EAEtB,gBACE,UACA,KAAK,cACC;GACJ,KAAKmB,6BAA6B,QAAQ;EAC5C,GACA,oBACA,KAAKpB,KACL,MACF;EACA,aACE,UACA,KAAK,QACL,gBACA,aACA,kBACA,KAAKA,KACL,MACF;EACA,wBACE,KAAKD,eACL,KAAKV,kBACL,sBACA,2BACA,IAAI,gBACJ,wBACA,kBACA,KAAKW,KACL,MACF;EACA,kBAAkB,KAAK,QAAQ,wBAAwB,KAAKA,KAAK,MAAM;EACvE,qBACE,KAAK,MACL,KAAK,SACL,QACA,OAAO,eACP,wBACM;GACJ,KAAKqB,oBAAoB,gCAAgC;EAC3D,GACA,KAAK,MACP;EAEA,4BACQ,KAAK,iBAAiB,GAC5B,+BACA,MACF;EACA,KAAU,iBAAiB;EAE3B,iBAAiB,UAAU,GAAG,iBAC5B,oBACA,KAAKC,mBACP;CACF;CAEA,sBAAsB,YAAY;EAChC,IAAI,KAAKC,SACP;EAIF,IAAI,iBAAiB,UAAU,GAAG,oBAAoB,WACpD;EAGF,MAAM,KAAKC,2CAA2C;CACxD;CAEA,MAAMA,6CAA+D;EACnE,MAAM,EAAC,aAAY;EACnB,MAAM,mBAAiB,MAAM,SAAS,KAAK,SAAQ,SACjD,eAAsB,UAAU,IAAI,CACtC;EACA,IAAI,CAAC,kBACH,KAAKJ,6BAA6B,QAAQ;EAE5C,OAAO,CAAC;CACV;;;;;CAMA,IAAI,YAA6B;EAC/B,OAAO,KAAKzB;CACd;;;;;CAMA,IAAI,WAAmB;EACrB,OAAO,KAAKF;CACd;;;;;;;CAQA,IAAI,gBAAiC;EACnC,OAAO,KAAKG;CACd;;;;;CAMA,iBAAqD;;;;;;;CAQrD,IAAI,SAAkB;EACpB,OAAO,KAAK6B;CACd;;;;;;;CAQA,IAAI,SAAkB;EACpB,OAAO,KAAKF;CACd;;;;;;CAOA,MAAM,QAAuB;EAC3B,KAAKA,UAAU;EACf,MAAM,EAAC,SAAS,YAAW,SAAS;EACpC,iBAAiB,IAAI,KAAK,MAAM,OAAO;EAEvC,KAAKtB,sBAAsB,MAAM;EAEjC,iBAAiB,UAAU,GAAG,oBAC5B,oBACA,KAAKqB,mBACP;EAEA,MAAM,KAAK5B;EACX,MAAM,kBAAkB;GACtB,KAAK,OAAO,MAAM;GAClB,KAAK,OAAO,MAAM;GAClB,KAAKK,cAAc,MAAM;EAC3B;EAEA,KAAKU,oBAAoB,MAAM;EAC/B,KAAKE,oBAAoB,MAAM;EAE/B,KAAKxB,eAAe,MAAM;EAE1B,MAAM,QAAQ,IAAI,eAAe;EACjC,iBAAiB,OAAO,KAAK,IAAI;EACjC,QAAQ;CACV;CAEA,MAAM,aAAa,UAAgB,WAAkC;EACnE,SAAS;GACP,IAAI,KAAKoC,SACP;GAGF,MAAM,KAAK7B;GACX,MAAM,EAAC,aAAY;GACnB,MAAM,KAAK,KAAKM,IACb,YAAY,cAAc,EAC1B,YAAY,aAAa,SAAS;GACrC,MAAM,EAAC,iBAAiB,OAAO,aAAa,aAC1C,MAAM,aACJ,KAAK,QACL,IACA,UACA,UACA,KAAKb,gBACL,CACF;GAEF,IAAI,CAAC,mBAAmB,gBAAgB,WAAW,GAAG;IAEpD,KAAKG,OAAO,QAAQ,aAAa,UAAU,MAAM,IAAI,EAAE,KAAK,CAAC,CAAC;IAC9D,MAAM,KAAKH,eAAe,KAAK,KAAK;IACpC,KAAUuC,iBAAiB;IAC3B;GACF;GAGA,IAAI,WAAW,MAAM,KAAKpC,OAAO,YAAY,QAAQ;GACrD,KAAK,MAAM,YAAY,iBAAiB;IAItC,IAAI,KAAKH,eAAe,4BACtB,MAAM,QAAQ,QAAQ;IAExB,MAAM,EAAC,SAAQ;IACf,MAAM,EAAC,QAAQ,UAAU,SAAQ,MAAM,0BACrC,KAAK,SACL,aACE,wBACE,UACA,UACA,UACA,gBACA,KAAKU,kBACL,IACA,gBAAgB,IAAI,IAAI,KAAK,WAAW,UACxC,GACA,QACF,CACJ;IACA,WAAW;IAGX,WAAW;GACb;EACF;CACF;CAEA,cAAgC;EAC9B,IAAI,KAAKmB,gBAAgB,GACvB,OAAO,QAAQ,QAAQ,IAAI;EAG7B,OAAO,KAAKF,mBAAmB,YAAY;GACzC,IAAI;IACF,KAAKa,oBAAoB,GAAG,CAAC;IAC7B,MAAM,EAAC,UAAU,WAAW,OAAM,MAAM,KAAK,UAAU;IACvD,IAAI,CAAC,IACH,OAAO;IAET,IAAI,aAAa,WACf,MAAM,KAAK,aAAa,UAAU,SAAS;GAE/C,SAAS,GAAG;IACV,MAAM,MAAM,KAAKC,mCAAmC,CAAC;GACvD,UAAU;IACR,KAAKD,oBAAoB,GAAG,EAAE;GAChC;GACA,OAAO;EACT,GAAG,MAAM;CACX;CAEA,kBAAkB;EAChB,OACE,KAAK,yBACJ,KAAK,YAAY,MAAM,gBAAgB,KAAK,MAAM;CAEvD;CAEA,MAAMb,mBACJ,GACA,MACkB;EAClB,IAAI,SAAS;EAEb,IAAI;GACF,OAAO,MAAM,EAAE;EACjB,SAAS,GAAG;GAYV,IAAI,aAAa,aAAa,aAAa,WAAW;IACpD,SAAS;IACT,KAAKd,IAAI,QAAQ,GAAG,KAAK,YAAY,GAAG,mBAAmB,EAAE,QAAQ;GACvE,OAAO,IAAI,aAAa,aACtB,KAAKA,IAAI,QAAQ,CAAC;QAElB,KAAKA,IAAI,OAAO,GAAG,KAAK,YAAY,CAAC;GAEvC,OAAO;EACT,UAAU;GACR,IAAI,KAAKyB,YAAY,QAAQ;IAC3B,KAAKA,UAAU;IACf,KAAK,iBAAiB,MAAM;IAC5B,IAAI,QACF,KAAU,iBAAiB;GAE/B;EACF;CACF;CAEA,MAAMV,qBACJ,GAOA,MACA,IACA,UAAoC,MACpC,WAAqC,MAIpC;EACD,MAAM,EAAC,aAAY;EACnB,IAAI,iBAAiB;EACrB,IAAI;EACJ,KAAK,GAAG,YAAY,IAAI;EACxB,GAAG;GACD,MAAM,YAAY,aAAa,QAAQ;GACvC,MAAM,YAAY,GAAG,YAAY,aAAa,SAAS;GACvD,MAAM,EAAC,iBAAiB,WAAU,MAAM,EAAE,WAAW,SAAS;GAC9D,aAAa;GACb,IAAI,CAAC,iBACH,OAAO;IACL;IACA,aAAa;GACf;GAEF,MAAM,EAAC,cAAc,mBAAkB;GAEvC,IAAI,gBAAgB,mBAAmB,KAGrC,UAAU,QACR,gCAAgC,KAAK,IAAI,oBACtC,eAAe,KAAK,iBAAiB,GAC1C;GAEF,IAAI,mBAAA,KACF,OAAO;IACL;IACA,aAAa;GACf;GAEF,IAAI,CAAC,KAAK,SACR,OAAO;IACL;IACA,aAAa;GACf;GAEF,IAAI;GACJ,IAAI;IACF,MAAM,QAAQ;IACd,OAAO,MAAM,KAAK,QAAQ;GAC5B,UAAU;IACR,MAAM,SAAS;GACjB;GACA,IAAI,SAAS,QAAQ,SAAS,KAAA,GAC5B,OAAO;IACL;IACA,aAAa;GACf;GAEF,KAAK,OAAO;GACZ;EACF,SAAS,iBAAiB;EAC1B,GAAG,OAAO,wCAAwC;EAClD,OAAO;GACL,QAAQ;GACR,aAAa;EACf;CACF;CAEA,kBAAkB;EAChB,OACE,KAAK,yBACJ,KAAK,YAAY,MAAM,gBAAgB,KAAK,MAAM;CAEvD;CAEA,MAAMH,cAAgC;EAIpC,IAAI,KAAKK,gBAAgB,GACvB,OAAO;EAGT,MAAM,KAAKvB;EACX,MAAM,YAAY,MAAM,KAAKC;EAC7B,MAAM,EAAC,aAAY;EACnB,MAAM,gBAAgB,MAAM,KAAKC;EACjC,OAAO,KAAKkB,mBAAmB,YAAY;GACzC,MAAM,EAAC,QAAQ,iBAAgB,MAAM,KAAKC,qBACxC,OAAO,WAAmB,cAA0B;IAClD,IAAI;KACF,KAAKY,oBAAoB,GAAG,CAAC;KAC7B,MAAM,eAAe,MAAM,KACzB,WACA,KAAK,QACL,WACA,WACA,eACA,UACA,KAAK,QACL,KAAK,eAAA,CAEP;KACA,OAAO;MACL,QAAQ;MACR,iBAAiB,cAAc;KACjC;IACF,UAAU;KACR,KAAKA,oBAAoB,IAAI,CAAC;IAChC;GACF,GACA,QACA,KAAK3B,GACP;GAEA,IAAI,iBAAiB,KAAA,GAEnB,OAAO;GAGT,MAAM,EAAC,UAAU,oBAAmB;GAEpC,IAAI,8BAA8B,QAAQ,GACxC,KAAK6B,mCAAmC,QAAQ;QAC3C,IAAI,8BAA8B,QAAQ,GAC/C,MAAM,KAAKC,6BAA6B;GAK1C,OAAO,gBAAgB,mBAAmB;EAC5C,GAAG,MAAM;CACX;CAEA,mCAAmC,UAAuC;EACxE,MAAM,SAA6B,EACjC,MAAM,SAAS,MACjB;EACA,IAAI,SAAS,aACX,OAAO,cAAc,SAAS;EAEhC,KAAKT,oBAAoB,MAAM;CACjC;;;;;;;;;;;;;;;;;;CAmBA,KAAK,EAAC,MAAM,UAAS,CAAC,GAAkB;EACtC,OAAO,aAAa,KAAKV,oBAAoB,KAAK,GAAG,CAAC;CACxD;;;;;;;;;;;;;;;CAgBA,KAAK,EAAC,MAAM,UAAS,CAAC,GAAkB;EACtC,OAAO,aAAa,KAAKF,oBAAoB,KAAK,GAAG,CAAC;CACxD;;;;;;;;;;CAWA,MAAM,KAAK,MAAmC;EAC5C,MAAM,KAAKf;EAOX,MAAM,EAAC,aAAY;EACnB,MAAM,YAAY,aAAa,QAAQ;EACvC,MAAM,KAAK,KAAKM,IACb,YAAY,oBAAoB,EAChC,YAAY,aAAa,SAAS;EAErC,MAAM,EAAC,iBAAgB;EAEvB,IAAI,8BAA8B,YAAY,GAAG;GAC/C,KAAK6B,mCAAmC,YAAY;GACpD;EACF;EAEA,IAAI,8BAA8B,YAAY,GAAG;GAC/C,MAAM,KAAKC,6BAA6B;GACxC;EACF;EAEA,MAAM,SAAS,MAAM,qBACnB,IACA,KAAK,QACL,WAAW,KAAK,UAAU,GAC1B,cACA,UACA,CACF;EAEA,QAAQ,OAAO,MAAf;GACE,KAAK;IACH,MAAM,KAAK,aAAa,OAAO,UAAU,SAAS;IAClD;GACF,KAAK,GACH,MAAM,IAAI,MACR,sCAAsC,KAAK,UAAU,IAAI,CAC3D;GACF,KAAK,GACH;EACJ;CACF;CAEA,MAAM,YAAsC;EAI1C,MAAM,KAAKpC;EACX,MAAM,YAAY,MAAM,KAAK;EAC7B,MAAM,EAAC,aAAY;EACnB,MAAM,gBAAgB,MAAM,KAAKE;EACjC,MAAM,EACJ,QAAQ,EAAC,mBAAmB,gBAC1B,MAAM,KAAKmB,qBACb,OAAO,WAAmB,cAA0B;GAClD,MAAM,oBAAoB,MAAM,YAC9B,WACA,UACA,eACA,KAAK,eACL,KAAK,QACL,WACA,KAAK,QACL,GACA,SACF;GACA,OAAO;IACL,QAAQ;KAAC;KAAmB;IAAS;IACrC,iBAAiB,kBAAkB;GACrC;EACF,GACA,QACA,KAAKf,WACC,KAAK2B,oBAAoB,GAAG,EAAE,SAC9B,KAAKA,oBAAoB,GAAG,CAAC,CACrC;EAEA,MAAM,EAAC,iBAAgB;EACvB,IAAI,8BAA8B,YAAY,GAC5C,KAAKE,mCAAmC,YAAY;OAC/C,IAAI,8BAA8B,kBAAkB,YAAY,GACrE,MAAM,KAAKC,6BAA6B;EAG1C,MAAM,EAAC,UAAU,oBAAmB;EACpC,OAAO;GAAC;GAAW;GAAU,IAAI,gBAAgB,mBAAmB;EAAG;CACzE;CAEA,UAAyB;EAEvB,OAAO,KAAK5B,aAAa,SAAS,YAAY;GAC5C,MAAM,EAAC,aAAY;GACnB,MAAM,KAAKR;GACX,IAAI,KAAK6B,SACP;GAEF,IAAI;IACF,MAAM,YACJ,KAAKvB,KACL,UACA,KAAK,QACL,KAAK,QACL,KAAKH,wBACC,KAAK0B,SACX,GACA,KAAKjC,OAAO,SACd;GACF,SAAS,GAAG;IACV,IAAI,aAAa,0BACf,KAAK8B,6BAA6B,QAAQ;SACrC,IAAI,KAAKG,SACd,KAAKvB,IAAI,QAAQ,qCAAqC,CAAC;SAEvD,MAAM;GAEV;GAEA,MAAM,gBAAgB,MAAM,KAAKJ;GACjC,OAAO,eAAe,sCAAsC;GAC5D,KAAKW,WAAW;IAAC;IAAU;GAAa,CAAC;EAC3C,CAAC;CACH;CAEA,MAAM,UAAyB;EAC7B,MAAM,KAAKb;EACX,MAAM,EAAC,aAAY;EACnB,IAAI,KAAK6B,WAAW,CAAC,KAAKlB,eAAe,GACvC;EAEF,IAAI;EACJ,IAAI;GACF,gBAAgB,MAAM,QACpB,KAAKL,KACL,KAAK,QACL,KAAK,QACL,UACA,KAAKH,kBACL,KAAKV,sBACC,KAAK,QACX,GACA,KAAKG,KACP;EACF,SAAS,GAAG;GACV,IAAI,aAAa,0BACf,KAAK8B,6BAA6B,QAAQ;QACrC,IAAI,KAAKG,SACd,KAAKvB,IAAI,QAAQ,qCAAqC,CAAC;QAEvD,MAAM;EAEV;EACA,IAAI,kBAAkB,KAAA,GACpB,MAAM,KAAKb,eAAe,KAAK,cAAc,KAAK;CAEtD;CAEA,6BAA6B;EAC3B,KAAK,wBAAwB;CAC/B;CAEA,6BAA6B,UAAoB;EAC/C,KAAKa,IAAI,QAAQ,+CAA+C,UAAU;EAC1E,KAAK+B,2BAA2B;CAClC;CAEA,MAAMD,+BAA+B;EACnC,MAAM,gBAAgB,MAAM,KAAKlC;EACjC,KAAKI,IAAI,QACP,oDAAoD,eACtD;EACA,MAAM,KAAK,mBAAmB;EAC9B,KAAK+B,2BAA2B;CAClC;CAEA,MAAM,qBAAoC;EACxC,MAAM,gBAAgB,MAAM,KAAKnC;EACjC,OAAO,eAAe,sCAAsC;EAC5D,KAAK,wBAAwB;EAC7B,MAAM,UAAU,KAAK,SAAQ,aAC3B,mBAAmB,eAAe,QAAQ,CAC5C;CACF;CAEA,oBAAoB,QAA4B;EAC9C,KAAKI,IAAI,QAAQ,0BAA0B,QAAQ;EACnD,KAAK,iBAAiB,MAAM;CAC9B;CAEA,MAAM0B,mBAAkC;EACtC,IAAI,CAAC,KAAKvB,yBACR;EAEF,MAAM,KAAK6B,UAAU,WAAW,KAAKC,iBAAiB;CACxD;CAEA,MAAMf,eAAe,aAAyC;EAC5D,KAAKlB,IAAI,QAAQ,oBAAoB,WAAW;EAChD,MAAM,gBAAgB,MAAM,KAAKJ;EACjC,IAAI,YAAY,kBAAkB,eAChC,KAAUsC,iBAAiB;CAE/B;CAEA,MAAMA,mBAAkC;EACtC,IAAI,CAAC,KAAK9B,yBACR;EAEF,MAAM,KAAK4B,UAAU,wBAAwB,KAAKG,iBAAiB;CACrE;CAEA,MAAMH,UAAU,MAAc,WAA4C;EACxE,IAAI;GACF,MAAM,UAAU,SAAS;EAC3B,SAAS,GAAG;GACV,IAAI,aAAa,YACf,KAAKhC,IAAI,QAAQ,aAAa,KAAK,gCAAgC;QAEnE,KAAKA,IAAI,QAAQ,gBAAgB,QAAQ,CAAC;EAE9C;CACF;;;;CAKA,aAA4B;EAC1B,OAAO,KAAKmC,kBAAkB,IAAI;CACpC;CAIA,oBAAoB,WAAmB,WAAyB;EAC9D,KAAKC,gBAAgB;EACrB,KAAKC,gBAAgB;EACrB,MAAM,QAAQ,YAAY;EAC1B,MAAM,UAAU,KAAKD,eAAe,KAAKC;EACzC,IAAK,UAAU,KAAK,YAAY,KAAM,YAAY,GAAG;GACnD,MAAM,UAAU,UAAU;GAE1B,QAAa,QAAQ,EAAE,WAAW,KAAK,SAAS,OAAO,CAAC;EAC1D;CACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAoCA,UACE,MACA,SACY;EACZ,IAAI,OAAO,YAAY,YACrB,UAAU,EAAC,QAAQ,QAAO;EAG5B,MAAM,EAAC,QAAQ,SAAS,QAAQ,YAAW;EAC3C,OAAO,KAAKlD,eAAe,IACzB,IAAI,iBAAiB,MAAM,QAAQ,SAAS,QAAQ,OAAO,CAC7D;CACF;CAsBA,kBACE,UACA,SACY;EACZ,OAAO,KAAKA,eAAe,IACzB,IAAI,kBAAkB,UAA2B,OAAO,CAC1D;CACF;;;;;;CAOA,MAAS,MAA2D;EAClE,OAAO,KAAKqB,eAAe,IAAI;CACjC;CAEA,IAAI,SAA0B;EAC5B,OAAO,KAAKd,OAAO,WACjB,SAAS,KAAK,QAAQ,OAAM,YAAW;GACrC,MAAM,eAAe,MAAM,QAAQ,QAAQ,iBAAiB;GAC5D,IAAI,CAAC,cACH,MAAM,IAAI,MAAM,6BAA6B;GAI/C,MAAM,UADmB,MADE,qBAAqB,cAAc,OAAO,GAC/B,KACN;GAChC,aAAa,MAAM;GACnB,OAAO;EACT,CAAC,CACH;CACF;CAEA,iBAAgC,OAAM,SAAQ;EAC5C,MAAM,KAAKA;EACX,MAAM,EAAC,aAAY;EACnB,OAAO,SAAS,KAAK,QAAQ,OAAM,YAAW;GAC5C,IAAI;IAGF,OAAO,MAAM,KAAK,IADH,oBAAoB,UAAU,MADxB,oBAAoB,SAAS,CAAoB,GACjB,KAAKM,GACxC,CAAE;GACtB,SAAS,IAAI;IACX,MAAM,MAAM,KAAK4B,mCAAmC,EAAE;GACxD;EACF,CAAC;CACH;CAEA,UACE,MACA,aAGyE;EACzE,KAAK/B,iBAAiB,QAAQ;EAK9B,QACE,SAGyD;GAGzD,MAAM,eACJ,SAAS,eAAe,KAAA,IAAY,KAAKP,OAAO,cAAc;GAEhE,MAAM,SAAS,KAAKgD,QAClB,cACA,MACA,aACA,MACA,YAAY,IAAI,CAClB;GAEA,IAAI,cACF,OAAO;IACL,QAAQ;IACR,QAAQ,aAAa;GACvB;GAGF,OAAO;EACT;CACF;CAEA,kBAOE,MAA0B;EAE1B,MAAM,KAAmB,OAAO,OAAO,IAAI;EAC3C,KAAK,MAAM,KAAK,MACd,GAAG,KAAK,KAAKC,UAAU,GAAG,KAAK,EAAE;EAEnC,OAAO;CACT;CAEA,MAAMD,QAIJ,cACA,MACA,aACA,MACA,WACY;EACZ,MAAM,aAAa,WAAW,QAAQ,IAAI;EAI1C,IAAI,KAAKnD,eAAe,4BACtB,MAAM,QAAQ,QAAQ;EAGxB,MAAM,KAAKO;EACX,MAAM,EAAC,aAAY;EACnB,OAAO,0BAA0B,KAAK,QAAQ,OAAM,aAAY;GAC9D,IAAI;IACF,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;KACF,WAAW,MAAM,gBAAgB,mBAAmB,QAAQ;KAG5D,MAAM,UAAU,MAAM,cACpB,UACA,MACA,YACA,MACA,UACA,WACA,UACA,CACF;KAEA,MAAM,aAAa,MAAM,QAAQ,cAAc;KAC/C,MAAM,KAAK,IAAI,qBACb,UACA,YACA,WACA,MAAM,KAAKJ,OAAO,UAAU,UAAU,EACpC,cAAc,SAChB,CAAC,GACD,SACA,KAAKU,GACP;KAEA,IAAI,cACF,KAAKV,OAAO,mBACV,aAAa,aACb,UACF;KAGF,SAAS,MAAM,YAAY,IAAI,IAAI;KAEnC,cAAc,OAAO;KACrB,MAAM,iBAAiB,MAAM,QAAQ,cAAc;KACnD,CAAC,SAAS,SAAS,MAAM,QAAQ,gBAC/B,mBACA,KAAKH,cACP;KAGA,KAAK,iBAAiB;IACxB,SAAS,GAAG;KAGV,IAAI,cACF,KAAKG,OAAO,eAAe,aAAa,aAAa,CAAC;KAExD,MAAM;IACR;IAEA,KAAKA,OAAO,QAAQ,UAAU,SAAS,MAAM,IAAI,EAAE,KAAK,CAAC,CAAC;IAG1D,KAAKqB,oBAAoB,KAAK,KAAK,EAAE,YAAY,KAAK,CAAC;IACvD,MAAM,KAAKxB,eAAe,KAAK,KAAK;IACpC,KAAUuC,iBAAiB;IAC3B,OAAO;GACT,SAAS,IAAI;IACX,MAAM,MAAM,KAAKE,mCAAmC,EAAE;GACxD;EACF,CAAC;CACH;;;;;CAMA,MAAMA,mCAAmC,IAA+B;EACtE,IACE,cAAc,sBACb,MAAM,KAAKJ,2CAA2C,GAEvD,OAAO,IAAI,yBAAyB,KAAK,QAAQ;EAGnD,OAAO;CACT;CAEA,mBAA4C,CAe5C;;;;;;;;;CAUA,+BAAoE;EAClE,OAAO,SAAS,KAAK,QAAQ,sBAAsB;CACrD;AACF;AAIA,IAAM,mCAAkD,IAAI,IAAI;AAEhE,eAAe,aAAa,GAA0C;CACpE,MAAM,MAAM,MAAM;CAClB,IAAI,KACF,MAAM,IAAI;AAEd;AAEA,SAAS,SAAe;CACtB,IAAI,OAAO,aAAa,aACtB,SAAS,OAAO;AAEpB;AAEA,SAAS,gBACP,SACM;CACN,MAAM,EAAC,MAAM,mBAAkB;CAC/B,IAAI,OAAO,SAAS,YAAY,CAAC,MAC/B,MAAM,IAAI,UAAU,wCAAwC;CAG9D,IAAI,mBAAmB,KAAA,GAAW;EAChC,MAAM,MAAM,KAAK,IAAI,aAAa,kBAAkB;EACpD,IAAI,OAAO,mBAAmB,YAAY,kBAAkB,KAC1D,MAAM,IAAI,UACR,+CAA+C,IAAI,GACrD;CAEJ;AACF"}
1	+ {"version":3,"file":"replicache-impl.js","names":["#subscriptions","#mutationRecovery","#kvStoreProvider","#perKVStore","#zero","#auth","#idbDatabase","#clientID","#ready","#openFailed","#profileIDPromise","#clientGroupIDPromise","#mutatorRegistry","#requestOptions","#idbDatabases","#lc","#closeAbortController","#persistLock","#enableScheduledPersist","#enableScheduledRefresh","#enableRefresh","#enablePullAndPushInOpen","#onPersist","#queryInternal","#onInvalidRefCount","#pullConnectionLoop","#invokePull","#pushConnectionLoop","#invokePush","#registerMutators","#wrapInOnlineCheck","#wrapInReauthRetries","#isPullDisabled","#isPushDisabled","#handlePersist","#open","#clientStateNotFoundOnClient","#fireOnUpdateNeeded","#onVisibilityChange","#closed","#checkForClientStateNotFoundAndCallHandler","#online","#schedulePersist","#changeSyncCounters","#convertToClientStateNotFoundError","#handleVersionNotSupportedResponse","#clientStateNotFoundOnServer","#handleInvalidRefCount","#fireOnClientStateNotFound","#corruptDatabaseRecovery","#dropDatabaseAndFireOnClientStateNotFound","#schedule","#persistScheduler","#scheduleRefresh","#refreshScheduler","#pushCounter","#pullCounter","#mutate","#register"],"sources":["../../../../replicache/src/replicache-impl.ts"],"sourcesContent":["import {Lock} from '@rocicorp/lock';\nimport type {LogContext} from '@rocicorp/logger';\nimport {consoleLogSink} from '@rocicorp/logger';\nimport {resolver} from '@rocicorp/resolver';\nimport {AbortError} from '../../shared/src/abort-error.ts';\nimport {assert} from '../../shared/src/asserts.ts';\nimport {getBrowserGlobal} from '../../shared/src/browser-env.ts';\nimport {getDocumentVisibilityWatcher} from '../../shared/src/document-visible.ts';\nimport type {JSONValue, ReadonlyJSONValue} from '../../shared/src/json.ts';\nimport {promiseVoid} from '../../shared/src/resolved-promises.ts';\nimport {TESTING} from '../../shared/src/testing.ts';\nimport type {MaybePromise} from '../../shared/src/types.ts';\nimport {PullDelegate, PushDelegate} from './connection-loop-delegates.ts';\nimport {ConnectionLoop, MAX_DELAY_MS, MIN_DELAY_MS} from './connection-loop.ts';\nimport {assertCookie, type Cookie} from './cookies.ts';\nimport {InvalidRefCountError} from './dag/invalid-ref-count-error.ts';\nimport {LazyStore} from './dag/lazy-store.ts';\nimport {StoreImpl} from './dag/store-impl.ts';\nimport {ChunkNotFoundError, mustGetHeadHash, type Store} from './dag/store.ts';\nimport {\n baseSnapshotFromHash,\n DEFAULT_HEAD_NAME,\n isLocalMetaDD31,\n type LocalMeta,\n} from './db/commit.ts';\nimport {readFromDefaultHead} from './db/read.ts';\nimport {rebaseMutationAndCommit} from './db/rebase.ts';\nimport {newWriteLocal} from './db/write.ts';\nimport {\n isClientStateNotFoundResponse,\n isVersionNotSupportedResponse,\n type VersionNotSupportedResponse,\n} from './error-responses.ts';\nimport * as FormatVersion from './format-version-enum.ts';\nimport {deepFreeze} from './frozen-json.ts';\nimport {getDefaultPuller, isDefaultPuller} from './get-default-puller.ts';\nimport {getDefaultPusher, isDefaultPusher} from './get-default-pusher.ts';\nimport {getKVStoreProvider} from './get-kv-store-provider.ts';\nimport {assertHash, emptyHash, type Hash, newRandomHash} from './hash.ts';\nimport type {HTTPRequestInfo} from './http-request-info.ts';\nimport {httpStatusUnauthorized} from './http-status-unauthorized.ts';\nimport type {IndexDefinitions} from './index-defs.ts';\nimport type {Store as KVStore, StoreProvider} from './kv/store.ts';\nimport {createLogContext} from './log-options.ts';\nimport {makeIDBName} from './make-idb-name.ts';\nimport {MutationRecovery} from './mutation-recovery.ts';\nimport {initNewClientChannel} from './new-client-channel.ts';\nimport {\n initOnPersistChannel,\n type OnPersist,\n type PersistInfo,\n} from './on-persist-channel.ts';\nimport {\n type PendingMutation,\n pendingMutationsForAPI,\n} from './pending-mutations.ts';\nimport {\n CLIENT_MAX_INACTIVE_TIME,\n GC_INTERVAL,\n initClientGC,\n} from './persist/client-gc.ts';\nimport {initClientGroupGC} from './persist/client-group-gc.ts';\nimport {disableClientGroup} from './persist/client-groups.ts';\nimport {\n ClientStateNotFoundError,\n initClientV6,\n type OnClientsDeleted,\n hasClientState as persistHasClientState,\n} from './persist/clients.ts';\nimport {\n COLLECT_IDB_INTERVAL,\n dropDatabaseInternal,\n initCollectIDBDatabases,\n INITIAL_COLLECT_IDB_DELAY,\n} from './persist/collect-idb-databases.ts';\nimport {HEARTBEAT_INTERVAL, startHeartbeats} from './persist/heartbeat.ts';\nimport {\n IDBDatabasesStore,\n type IndexedDBDatabase,\n} from './persist/idb-databases-store.ts';\nimport {makeClientID} from './persist/make-client-id.ts';\nimport {persistDD31} from './persist/persist.ts';\nimport {refresh} from './persist/refresh.ts';\nimport {ProcessScheduler} from './process-scheduler.ts';\nimport type {Puller} from './puller.ts';\nimport {type Pusher, PushError} from './pusher.ts';\nimport type {\n MutationTrackingData,\n ReplicacheOptions,\n ZeroOption,\n} from './replicache-options.ts';\nimport {ReportError} from './report-error.ts';\nimport {setIntervalWithSignal} from './set-interval-with-signal.ts';\nimport {\n type SubscribeOptions,\n SubscriptionImpl,\n type SubscriptionsManager,\n SubscriptionsManagerImpl,\n type WatchCallback,\n type WatchCallbackForOptions,\n type WatchNoIndexCallback,\n type WatchOptions,\n WatchSubscription,\n} from './subscriptions.ts';\nimport type {DiffsMap} from './sync/diff.ts';\nimport * as HandlePullResponseResultEnum from './sync/handle-pull-response-result-type-enum.ts';\nimport type {ClientGroupID, ClientID} from './sync/ids.ts';\nimport {PullError} from './sync/pull-error.ts';\nimport {beginPullV1, handlePullResponseV1, maybeEndPull} from './sync/pull.ts';\nimport {push, PUSH_VERSION_DD31} from './sync/push.ts';\nimport {newRequestID} from './sync/request-id.ts';\nimport {SYNC_HEAD_NAME} from './sync/sync-head-name.ts';\nimport {throwIfClosed} from './transaction-closed-error.ts';\nimport type {ReadTransaction, WriteTransaction} from './transactions.ts';\nimport {ReadTransactionImpl, WriteTransactionImpl} from './transactions.ts';\nimport type {\n BeginPullResult,\n MakeMutator,\n MakeMutators,\n MutatorDefs,\n MutatorReturn,\n PokeInternal,\n QueryInternal,\n RequestOptions,\n UpdateNeededReason,\n} from './types.ts';\nimport {version} from './version.ts';\nimport {\n withRead,\n withWrite,\n withWriteNoImplicitCommit,\n} from './with-transactions.ts';\n\n/*\n The maximum number of time to call out to getAuth before giving up\n * and throwing an error.\n /\nconst MAX_REAUTH_TRIES = 8;\n\nconst PERSIST_IDLE_TIMEOUT_MS = 1000;\nconst REFRESH_IDLE_TIMEOUT_MS = 1000;\n\nconst PERSIST_THROTTLE_MS = 500;\nconst REFRESH_THROTTLE_MS = 500;\n\n/\n Opening the database blocks everything Replicache does, including Zero's\n * first connect attempt, so a slow open is worth a warning rather than a\n * debug line.\n /\nconst SLOW_DB_OPEN_THRESHOLD_MS = 50;\n\nconst LAZY_STORE_SOURCE_CHUNK_CACHE_SIZE_LIMIT = 100 2 ** 20; // 100 MB\n\nconst RECOVER_MUTATIONS_INTERVAL_MS = 5 * 60 * 1000; // 5 mins\n\nconst noop = () => {\n // noop\n};\n\nconst updateNeededReasonNewClientGroup: UpdateNeededReason = {\n type: 'NewClientGroup',\n} as const;\n\n/** @deprecated Not used any more /\nexport interface MakeSubscriptionsManager {\n (queryInternal: QueryInternal, lc: LogContext): SubscriptionsManager;\n}\n\nexport interface ReplicacheImplOptions {\n /\n Defaults to true.\n /\n enableMutationRecovery?: boolean \| undefined;\n\n /\n Defaults to true.\n /\n enableScheduledPersist?: boolean \| undefined;\n\n /\n Defaults to true.\n /\n enableScheduledRefresh?: boolean \| undefined;\n\n /\n Defaults to `() => true`.\n /\n enableRefresh?: (() => boolean) \| undefined;\n\n /\n Defaults to true.\n /\n enablePullAndPushInOpen?: boolean \| undefined;\n\n /\n @deprecated Not used anymore.\n /\n makeSubscriptionsManager?: unknown;\n\n /\n Default is `true`. If `false` if an exact match client group\n * is not found, a new client group is always made instead of forking\n * from an existing client group.\n /\n enableClientGroupForking?: boolean \| undefined;\n\n /\n Callback for when Replicache has deleted clients.\n /\n onClientsDeleted?: OnClientsDeleted \| undefined;\n\n /\n Internal option used by Zero.\n * Replicache will call this to and, if zero is enabled, will\n * invoke various hooks to allow Zero the keep IVM in sync with Replicache's b-trees.\n /\n zero?: ZeroOption \| undefined;\n}\n\nexport class ReplicacheImpl<MD extends MutatorDefs = {}> {\n /* The URL to use when doing a pull request. /\n pullURL: string;\n\n /* The URL to use when doing a push request. /\n pushURL: string;\n\n /* The authorization token used when doing a push request. /\n #auth: string;\n\n /* The name of the Replicache database. Populated by {@link ReplicacheOptions#name}. /\n readonly name: string;\n\n readonly #subscriptions: SubscriptionsManager;\n readonly #mutationRecovery: MutationRecovery \| undefined;\n\n /\n Client groups gets disabled when the server does not know about it.\n * A disabled client group prevents the client from pushing and pulling.\n /\n isClientGroupDisabled = false;\n\n readonly #kvStoreProvider: StoreProvider;\n readonly #perKVStore: KVStore;\n\n lastMutationID: number = 0;\n\n /\n This is the name Replicache uses for the IndexedDB database where data is\n * stored.\n /\n get idbName(): string {\n return makeIDBName(this.name, this.schemaVersion);\n }\n\n /\n The KV store backing this instance. Its `kind` reflects the storage\n * currently in use, e.g. `'mem'` after an IndexedDB store fell back to\n * memory.\n /\n get kvStore(): KVStore {\n return this.#perKVStore;\n }\n\n set auth(auth: string) {\n if (this.#zero) {\n this.#zero.auth = auth;\n }\n\n this.#auth = auth;\n }\n\n get auth() {\n return this.#auth;\n }\n\n /* The schema version of the data understood by this application. /\n readonly schemaVersion: string;\n\n get #idbDatabase(): IndexedDBDatabase {\n return {\n name: this.idbName,\n replicacheName: this.name,\n replicacheFormatVersion: FormatVersion.Latest,\n schemaVersion: this.schemaVersion,\n };\n }\n #closed = false;\n #online = true;\n readonly #clientID = makeClientID();\n readonly #ready: Promise<void>;\n /\n Resolves if open fails, for whatever reason. `#ready` never resolves in\n * that case, so `close()` waits on whichever of the two settles first\n * instead of hanging forever.\n /\n readonly #openFailed = resolver<void>();\n readonly #profileIDPromise: Promise<string>;\n readonly #clientGroupIDPromise: Promise<string>;\n readonly #mutatorRegistry: MutatorDefs = {};\n\n /\n The mutators that was registered in the constructor.\n /\n readonly mutate: MakeMutators<MD>;\n\n // Number of pushes/pulls at the moment.\n #pushCounter = 0;\n #pullCounter = 0;\n\n #pullConnectionLoop: ConnectionLoop;\n #pushConnectionLoop: ConnectionLoop;\n\n /\n The duration between each periodic {@link pull}. Setting this to `null`\n * disables periodic pull completely. Pull will still happen if you call\n * {@link pull} manually.\n /\n pullInterval: number \| null;\n\n /\n The delay between when a change is made to Replicache and when Replicache\n * attempts to push that change.\n /\n pushDelay: number;\n\n readonly #requestOptions: Required<RequestOptions>;\n\n /\n The function to use to pull data from the server.\n /\n puller: Puller;\n\n /\n The function to use to push data to the server.\n /\n pusher: Pusher;\n\n readonly memdag: LazyStore;\n readonly perdag: Store;\n readonly #idbDatabases: IDBDatabasesStore;\n readonly #lc: LogContext;\n readonly #zero: ZeroOption \| undefined;\n\n readonly #closeAbortController = new AbortController();\n\n readonly #persistLock = new Lock();\n readonly #enableScheduledPersist: boolean;\n readonly #enableScheduledRefresh: boolean;\n readonly #enableRefresh: () => boolean;\n readonly #enablePullAndPushInOpen: boolean;\n #persistScheduler = new ProcessScheduler(\n () => this.persist(),\n PERSIST_IDLE_TIMEOUT_MS,\n PERSIST_THROTTLE_MS,\n this.#closeAbortController.signal,\n );\n readonly #onPersist: OnPersist;\n #refreshScheduler = new ProcessScheduler(\n () => this.refresh(),\n REFRESH_IDLE_TIMEOUT_MS,\n REFRESH_THROTTLE_MS,\n this.#closeAbortController.signal,\n );\n\n /\n The options used to control the {@link pull} and push request behavior. This\n * object is live so changes to it will affect the next pull or push call.\n /\n get requestOptions(): Required<RequestOptions> {\n return this.#requestOptions;\n }\n\n /\n `onSync(true)` is called when Replicache transitions from no push or pull\n * happening to at least one happening. `onSync(false)` is called in the\n * opposite case: when Replicache transitions from at least one push or pull\n * happening to none happening.\n \n This can be used in a React like app by doing something like the following:\n \n ```js\n * const [syncing, setSyncing] = useState(false);\n * useEffect(() => {\n * rep.onSync = setSyncing;\n * }, [rep]);\n * ```\n /\n onSync: ((syncing: boolean) => void) \| null = null;\n\n /\n `onClientStateNotFound` is called when the persistent client state can no\n * longer be used. This happens when:\n * - the persistent client has been garbage collected. This can happen if the\n * client has no pending mutations and has not been used for a while.\n * - the persistent store was found to be corrupt. Replicache then tries to\n * drop the database, including any pending mutations, so that a fresh one\n * is created on reload.\n \n The default behavior is to reload the page (using `location.reload()`). Set\n * this to `null` or provide your own function to prevent the page from\n * reloading automatically.\n /\n onClientStateNotFound: (() => void) \| null = reload;\n\n /\n `onUpdateNeeded` is called when a code update is needed.\n \n A code update can be needed because:\n * - the server no longer supports the {@link pushVersion},\n * {@link pullVersion} or {@link schemaVersion} of the current code.\n * - a new Replicache client has created a new client group, because its code\n * has different mutators, indexes, schema version and/or format version\n * from this Replicache client. This is likely due to the new client having\n * newer code. A code update is needed to be able to locally sync with this\n * new Replicache client (i.e. to sync while offline, the clients can still\n * sync with each other via the server).\n \n The default behavior is to reload the page (using `location.reload()`). Set\n * this to `null` or provide your own function to prevent the page from\n * reloading automatically. You may want to provide your own function to\n * display a toast to inform the end user there is a new version of your app\n * available and prompting them to refresh.\n /\n onUpdateNeeded: ((reason: UpdateNeededReason) => void) \| null = reload;\n\n /\n This gets called when we get an HTTP unauthorized (401) response from the\n * push or pull endpoint. Set this to a function that will ask your user to\n * reauthenticate.\n /\n getAuth: (() => MaybePromise<string \| null \| undefined>) \| null \| undefined =\n null;\n\n // These three are used for testing\n onPushInvoked = () => undefined;\n onBeginPull = () => undefined;\n onRecoverMutations = (r: Promise<boolean>) => r;\n\n constructor(\n options: ReplicacheOptions<MD>,\n implOptions: ReplicacheImplOptions = {},\n ) {\n validateOptions(options);\n const {\n name,\n logLevel = 'info',\n logSinks = [consoleLogSink],\n pullURL = '',\n auth,\n pushDelay = 10,\n pushURL = '',\n schemaVersion = '',\n pullInterval = 60000,\n mutators = {} as MD,\n requestOptions = {},\n puller,\n pusher,\n indexes = {},\n clientMaxAgeMs = CLIENT_MAX_INACTIVE_TIME,\n } = options;\n const {\n enableMutationRecovery = true,\n enableScheduledPersist = true,\n enableScheduledRefresh = true,\n enableRefresh = () => true,\n enablePullAndPushInOpen = true,\n enableClientGroupForking = true,\n onClientsDeleted = () => promiseVoid,\n } = implOptions;\n this.#zero = implOptions.zero;\n this.#auth = auth ?? '';\n this.pullURL = pullURL;\n this.pushURL = pushURL;\n this.name = name;\n this.schemaVersion = schemaVersion;\n this.pullInterval = pullInterval;\n this.pushDelay = pushDelay;\n this.puller = puller ?? getDefaultPuller(this);\n this.pusher = pusher ?? getDefaultPusher(this);\n\n this.#enableScheduledPersist = enableScheduledPersist;\n this.#enableScheduledRefresh = enableScheduledRefresh;\n this.#enableRefresh = enableRefresh;\n this.#enablePullAndPushInOpen = enablePullAndPushInOpen;\n\n this.#lc = createLogContext(logLevel, logSinks, {name});\n this.#lc.debug?.('Constructing Replicache', {\n name,\n 'replicache version': version,\n });\n\n this.#subscriptions = new SubscriptionsManagerImpl(\n this.#queryInternal,\n this.#lc,\n this.#closeAbortController.signal,\n );\n\n const kvStoreProvider = getKVStoreProvider(this.#lc, options.kvStore);\n this.#kvStoreProvider = kvStoreProvider;\n\n const perKVStore = kvStoreProvider.create(this.idbName);\n this.#perKVStore = perKVStore;\n\n this.#idbDatabases = new IDBDatabasesStore(kvStoreProvider.create);\n this.perdag = new StoreImpl(\n perKVStore,\n newRandomHash,\n assertHash,\n this.#onInvalidRefCount,\n );\n this.memdag = new LazyStore(\n this.perdag,\n LAZY_STORE_SOURCE_CHUNK_CACHE_SIZE_LIMIT,\n newRandomHash,\n assertHash,\n );\n\n // Use a promise-resolve pair so that we have a promise to use even before\n // we call the Open RPC.\n const readyResolver = resolver<void>();\n this.#ready = readyResolver.promise;\n\n const {minDelayMs = MIN_DELAY_MS, maxDelayMs = MAX_DELAY_MS} =\n requestOptions;\n this.#requestOptions = {maxDelayMs, minDelayMs};\n\n const visibilityWatcher = getDocumentVisibilityWatcher(\n getBrowserGlobal('document'),\n 0,\n this.#closeAbortController.signal,\n );\n\n this.#pullConnectionLoop = new ConnectionLoop(\n this.#lc.withContext('PULL'),\n new PullDelegate(this, () => this.#invokePull()),\n visibilityWatcher,\n );\n\n this.#pushConnectionLoop = new ConnectionLoop(\n this.#lc.withContext('PUSH'),\n new PushDelegate(this, () => this.#invokePush()),\n );\n\n this.mutate = this.#registerMutators(mutators);\n\n const profileIDResolver = resolver<string>();\n this.#profileIDPromise = profileIDResolver.promise;\n const clientGroupIDResolver = resolver<string>();\n this.#clientGroupIDPromise = clientGroupIDResolver.promise;\n\n if (!process.env.DISABLE_MUTATION_RECOVERY) {\n this.#mutationRecovery = new MutationRecovery({\n delegate: this,\n lc: this.#lc,\n enableMutationRecovery,\n wrapInOnlineCheck: this.#wrapInOnlineCheck.bind(this),\n wrapInReauthRetries: this.#wrapInReauthRetries.bind(this),\n isPullDisabled: this.#isPullDisabled.bind(this),\n isPushDisabled: this.#isPushDisabled.bind(this),\n clientGroupIDPromise: this.#clientGroupIDPromise,\n });\n }\n\n this.#onPersist = initOnPersistChannel(\n this.name,\n this.#closeAbortController.signal,\n persistInfo => {\n void this.#handlePersist(persistInfo);\n },\n );\n\n void this.#open(\n indexes,\n enableClientGroupForking,\n enableMutationRecovery,\n clientMaxAgeMs,\n profileIDResolver.resolve,\n clientGroupIDResolver.resolve,\n readyResolver.resolve,\n onClientsDeleted,\n ).catch(e => {\n // Whatever the reason, this open is over: `#ready` stays pending so\n // reads and writes never run against a store that failed to open, but\n // `close()` must still be able to dispose the instance. This must not\n // depend on why the open failed.\n this.#openFailed.resolve();\n if (e instanceof InvalidRefCountError) {\n // #onInvalidRefCount (called from the write's release()) already\n // started recovery: drop the database and fire onClientStateNotFound.\n // Nothing else can be done with this instance.\n this.#lc.debug?.('Open failed because the persistent store is corrupt');\n return;\n }\n throw e;\n });\n }\n\n async #open(\n indexes: IndexDefinitions,\n enableClientGroupForking: boolean,\n enableMutationRecovery: boolean,\n clientMaxAgeMs: number,\n profileIDResolver: (profileID: string) => void,\n resolveClientGroupID: (clientGroupID: ClientGroupID) => void,\n resolveReady: () => void,\n onClientsDeleted: OnClientsDeleted,\n ): Promise<void> {\n const {clientID} = this;\n // Everything up to the head write is what it takes to have a usable\n // database, including waiting out a previous instance of the same name.\n // The timer stops before the replica is loaded into Zero's IVM sources,\n // which is separate work and usually the larger of the two: a number that\n // spanned both would report a slow hydration as a slow disk.\n const openStart = performance.now();\n // If we are currently closing a Replicache instance with the same name,\n // wait for it to finish closing.\n await closingInstances.get(this.name);\n await this.#idbDatabases.getProfileID().then(profileIDResolver);\n await this.#idbDatabases.putDatabase(this.#idbDatabase);\n const [client, headHash, , isNewClientGroup] = await initClientV6(\n clientID,\n this.#lc,\n this.perdag,\n Object.keys(this.#mutatorRegistry),\n indexes,\n FormatVersion.Latest,\n enableClientGroupForking,\n );\n\n resolveClientGroupID(client.clientGroupID);\n await withWrite(this.memdag, write =>\n write.setHead(DEFAULT_HEAD_NAME, headHash),\n );\n\n // Now we have a profileID, a clientID, a clientGroupID and DB!\n const dbOpenMs = performance.now() - openStart;\n if (dbOpenMs > SLOW_DB_OPEN_THRESHOLD_MS) {\n this.#lc.warn?.(`Opening the database took ${Math.round(dbOpenMs)}ms`, {\n name: this.idbName,\n });\n } else {\n this.#lc.debug?.('Opened the database in', Math.round(dbOpenMs), 'ms');\n }\n\n await this.#zero?.init(headHash, this.memdag);\n resolveReady();\n\n if (this.#enablePullAndPushInOpen) {\n this.pull().catch(noop);\n this.push().catch(noop);\n }\n\n const {signal} = this.#closeAbortController;\n\n startHeartbeats(\n clientID,\n this.perdag,\n () => {\n this.#clientStateNotFoundOnClient(clientID);\n },\n HEARTBEAT_INTERVAL,\n this.#lc,\n signal,\n );\n initClientGC(\n clientID,\n this.perdag,\n clientMaxAgeMs,\n GC_INTERVAL,\n onClientsDeleted,\n this.#lc,\n signal,\n );\n initCollectIDBDatabases(\n this.#idbDatabases,\n this.#kvStoreProvider,\n COLLECT_IDB_INTERVAL,\n INITIAL_COLLECT_IDB_DELAY,\n 2 clientMaxAgeMs,\n enableMutationRecovery,\n onClientsDeleted,\n this.#lc,\n signal,\n // Collection writes deleted clients into every surviving database using\n // its own dag store. When that is our database, a corrupt ref count\n // found there must reach the same recovery as writes through `perdag`.\n // A corrupt foreign database is left for its own instance to discover\n // and recover from on its next write.\n (name, createKVStore) =>\n new StoreImpl(\n createKVStore(name),\n newRandomHash,\n assertHash,\n name === this.idbName ? this.#onInvalidRefCount : undefined,\n ),\n );\n initClientGroupGC(this.perdag, enableMutationRecovery, this.#lc, signal);\n initNewClientChannel(\n this.name,\n this.idbName,\n signal,\n client.clientGroupID,\n isNewClientGroup,\n () => {\n this.#fireOnUpdateNeeded(updateNeededReasonNewClientGroup);\n },\n this.perdag,\n );\n\n setIntervalWithSignal(\n () => this.recoverMutations(),\n RECOVER_MUTATIONS_INTERVAL_MS,\n signal,\n );\n void this.recoverMutations();\n\n getBrowserGlobal('document')?.addEventListener(\n 'visibilitychange',\n this.#onVisibilityChange,\n );\n }\n\n #onVisibilityChange = async () => {\n if (this.#closed) {\n return;\n }\n\n // In case of running in a worker, we don't have a document.\n if (getBrowserGlobal('document')?.visibilityState !== 'visible') {\n return;\n }\n\n await this.#checkForClientStateNotFoundAndCallHandler();\n };\n\n async #checkForClientStateNotFoundAndCallHandler(): Promise<boolean> {\n const {clientID} = this;\n const hasClientState = await withRead(this.perdag, read =>\n persistHasClientState(clientID, read),\n );\n if (!hasClientState) {\n this.#clientStateNotFoundOnClient(clientID);\n }\n return !hasClientState;\n }\n\n /*\n The browser profile ID for this browser profile. Every instance of Replicache\n * browser-profile-wide shares the same profile ID.\n /\n get profileID(): Promise<string> {\n return this.#profileIDPromise;\n }\n\n /\n The client ID for this instance of Replicache. Each instance of Replicache\n * gets a unique client ID.\n /\n get clientID(): string {\n return this.#clientID;\n }\n\n /\n The client group ID for this instance of Replicache. Instances of\n * Replicache will have the same client group ID if and only if they have\n * the same name, mutators, indexes, schema version, format version, and\n * browser profile.\n /\n get clientGroupID(): Promise<string> {\n return this.#clientGroupIDPromise;\n }\n\n /\n `onOnlineChange` is called when the {@link online} property changes. See\n * {@link online} for more details.\n /\n onOnlineChange: ((online: boolean) => void) \| null = null;\n\n /\n A rough heuristic for whether the client is currently online. Note that\n * there is no way to know for certain whether a client is online - the next\n * request can always fail. This property returns true if the last sync attempt succeeded,\n * and false otherwise.\n /\n get online(): boolean {\n return this.#online;\n }\n\n /\n Whether the Replicache database has been closed. Once Replicache has been\n * closed it no longer syncs and you can no longer read or write data out of\n * it. After it has been closed it is pretty much useless and should not be\n * used any more.\n /\n get closed(): boolean {\n return this.#closed;\n }\n\n /\n Closes this Replicache instance.\n \n When closed all subscriptions end and no more read or writes are allowed.\n /\n async close(): Promise<void> {\n this.#closed = true;\n const {promise, resolve} = resolver();\n closingInstances.set(this.name, promise);\n\n this.#closeAbortController.abort();\n\n getBrowserGlobal('document')?.removeEventListener(\n 'visibilitychange',\n this.#onVisibilityChange,\n );\n\n await Promise.race([this.#ready, this.#openFailed.promise]);\n const closingPromises = [\n this.memdag.close(),\n this.perdag.close(),\n this.#idbDatabases.close(),\n ];\n\n this.#pullConnectionLoop.close();\n this.#pushConnectionLoop.close();\n\n this.#subscriptions.clear();\n\n await Promise.all(closingPromises);\n closingInstances.delete(this.name);\n resolve();\n }\n\n async maybeEndPull(syncHead: Hash, requestID: string): Promise<void> {\n for (;;) {\n if (this.#closed) {\n return;\n }\n\n await this.#ready;\n const {clientID} = this;\n const lc = this.#lc\n .withContext('maybeEndPull')\n .withContext('requestID', requestID);\n const {replayMutations, diffs, oldMainHead, mainHead} =\n await maybeEndPull<LocalMeta>(\n this.memdag,\n lc,\n syncHead,\n clientID,\n this.#subscriptions,\n FormatVersion.Latest,\n );\n\n if (!replayMutations \|\| replayMutations.length === 0) {\n // All done.\n this.#zero?.advance(oldMainHead, mainHead, diffs.get('') ?? []);\n await this.#subscriptions.fire(diffs);\n void this.#schedulePersist();\n return;\n }\n\n // Replay.\n let zeroData = await this.#zero?.getTxData?.(syncHead);\n for (const mutation of replayMutations) {\n // TODO(greg): I'm not sure why this was in Replicache#_mutate...\n // Ensure that we run initial pending subscribe functions before starting a\n // write transaction.\n if (this.#subscriptions.hasPendingSubscriptionRuns) {\n await Promise.resolve();\n }\n const {meta} = mutation;\n const {result, zeroData: next} = await withWriteNoImplicitCommit(\n this.memdag,\n dagWrite =>\n rebaseMutationAndCommit(\n mutation,\n dagWrite,\n syncHead,\n SYNC_HEAD_NAME,\n this.#mutatorRegistry,\n lc,\n isLocalMetaDD31(meta) ? meta.clientID : clientID,\n FormatVersion.Latest,\n zeroData,\n ),\n );\n syncHead = result;\n // The fork the mutation ran against when it succeeded, or the branch we\n // came in with when it threw.\n zeroData = next;\n }\n }\n }\n\n #invokePull(): Promise<boolean> {\n if (this.#isPullDisabled()) {\n return Promise.resolve(true);\n }\n\n return this.#wrapInOnlineCheck(async () => {\n try {\n this.#changeSyncCounters(0, 1);\n const {syncHead, requestID, ok} = await this.beginPull();\n if (!ok) {\n return false;\n }\n if (syncHead !== emptyHash) {\n await this.maybeEndPull(syncHead, requestID);\n }\n } catch (e) {\n throw await this.#convertToClientStateNotFoundError(e);\n } finally {\n this.#changeSyncCounters(0, -1);\n }\n return true;\n }, 'Pull');\n }\n\n #isPullDisabled() {\n return (\n this.isClientGroupDisabled \|\|\n (this.pullURL === '' && isDefaultPuller(this.puller))\n );\n }\n\n async #wrapInOnlineCheck(\n f: () => Promise<boolean>,\n name: string,\n ): Promise<boolean> {\n let online = true;\n\n try {\n return await f();\n } catch (e) {\n // The error paths of beginPull and maybeEndPull need to be reworked.\n //\n // We want to distinguish between:\n // a) network requests failed -- we're offline basically\n // b) sync was aborted because one's already in progress\n // c) oh noes - something unexpected happened\n //\n // Right now, all of these come out as errors. We distinguish (b) with a\n // hacky string search. (a) and (c) are not distinguishable currently\n // because repc doesn't provide sufficient information, so we treat all\n // errors that aren't (b) as (a).\n if (e instanceof PushError \|\| e instanceof PullError) {\n online = false;\n this.#lc.debug?.(`${name} threw:\\n`, e, '\\nwith cause:\\n', e.causedBy);\n } else if (e instanceof ReportError) {\n this.#lc.error?.(e);\n } else {\n this.#lc.info?.(`${name} threw:\\n`, e);\n }\n return false;\n } finally {\n if (this.#online !== online) {\n this.#online = online;\n this.onOnlineChange?.(online);\n if (online) {\n void this.recoverMutations();\n }\n }\n }\n }\n\n async #wrapInReauthRetries<R>(\n f: (\n requestID: string,\n requestLc: LogContext,\n ) => Promise<{\n httpRequestInfo: HTTPRequestInfo \| undefined;\n result: R;\n }>,\n verb: string,\n lc: LogContext,\n preAuth: () => MaybePromise<void> = noop,\n postAuth: () => MaybePromise<void> = noop,\n ): Promise<{\n result: R;\n authFailure: boolean;\n }> {\n const {clientID} = this;\n let reauthAttempts = 0;\n let lastResult;\n lc = lc.withContext(verb);\n do {\n const requestID = newRequestID(clientID);\n const requestLc = lc.withContext('requestID', requestID);\n const {httpRequestInfo, result} = await f(requestID, requestLc);\n lastResult = result;\n if (!httpRequestInfo) {\n return {\n result,\n authFailure: false,\n };\n }\n const {errorMessage, httpStatusCode} = httpRequestInfo;\n\n if (errorMessage \|\| httpStatusCode !== 200) {\n // TODO(arv): Maybe we should not log the server URL when the error comes\n // from a Pusher/Puller?\n requestLc.error?.(\n `Got a non 200 response doing ${verb}: ${httpStatusCode}` +\n (errorMessage ? `: ${errorMessage}` : ''),\n );\n }\n if (httpStatusCode !== httpStatusUnauthorized) {\n return {\n result,\n authFailure: false,\n };\n }\n if (!this.getAuth) {\n return {\n result,\n authFailure: true,\n };\n }\n let auth;\n try {\n await preAuth();\n auth = await this.getAuth();\n } finally {\n await postAuth();\n }\n if (auth === null \|\| auth === undefined) {\n return {\n result,\n authFailure: true,\n };\n }\n this.auth = auth;\n reauthAttempts++;\n } while (reauthAttempts < MAX_REAUTH_TRIES);\n lc.info?.('Tried to reauthenticate too many times');\n return {\n result: lastResult,\n authFailure: true,\n };\n }\n\n #isPushDisabled() {\n return (\n this.isClientGroupDisabled \|\|\n (this.pushURL === '' && isDefaultPusher(this.pusher))\n );\n }\n\n async #invokePush(): Promise<boolean> {\n if (TESTING) {\n this.onPushInvoked();\n }\n if (this.#isPushDisabled()) {\n return true;\n }\n\n await this.#ready;\n const profileID = await this.#profileIDPromise;\n const {clientID} = this;\n const clientGroupID = await this.#clientGroupIDPromise;\n return this.#wrapInOnlineCheck(async () => {\n const {result: pusherResult} = await this.#wrapInReauthRetries(\n async (requestID: string, requestLc: LogContext) => {\n try {\n this.#changeSyncCounters(1, 0);\n const pusherResult = await push(\n requestID,\n this.memdag,\n requestLc,\n profileID,\n clientGroupID,\n clientID,\n this.pusher,\n this.schemaVersion,\n PUSH_VERSION_DD31,\n );\n return {\n result: pusherResult,\n httpRequestInfo: pusherResult?.httpRequestInfo,\n };\n } finally {\n this.#changeSyncCounters(-1, 0);\n }\n },\n 'push',\n this.#lc,\n );\n\n if (pusherResult === undefined) {\n // No pending mutations.\n return true;\n }\n\n const {response, httpRequestInfo} = pusherResult;\n\n if (isVersionNotSupportedResponse(response)) {\n this.#handleVersionNotSupportedResponse(response);\n } else if (isClientStateNotFoundResponse(response)) {\n await this.#clientStateNotFoundOnServer();\n }\n\n // No pushResponse means we didn't do a push because there were no\n // pending mutations.\n return httpRequestInfo.httpStatusCode === 200;\n }, 'Push');\n }\n\n #handleVersionNotSupportedResponse(response: VersionNotSupportedResponse) {\n const reason: UpdateNeededReason = {\n type: response.error,\n };\n if (response.versionType) {\n reason.versionType = response.versionType;\n }\n this.#fireOnUpdateNeeded(reason);\n }\n\n /\n Push pushes pending changes to the {@link pushURL}.\n \n You do not usually need to manually call push. If {@link pushDelay} is\n * non-zero (which it is by default) pushes happen automatically shortly after\n * mutations.\n \n If the server endpoint fails push will be continuously retried with an\n * exponential backoff.\n \n @param [now=false] If true, push will happen immediately and ignore\n * {@link pushDelay}, {@link RequestOptions.minDelayMs} as well as the\n * exponential backoff in case of errors.\n * @returns A promise that resolves when the next push completes. In case of\n * errors the first error will reject the returned promise. Subsequent errors\n * will not be reflected in the promise.\n /\n push({now = false} = {}): Promise<void> {\n return throwIfError(this.#pushConnectionLoop.send(now));\n }\n\n /\n Pull pulls changes from the {@link pullURL}. If there are any changes local\n * changes will get replayed on top of the new server state.\n \n If the server endpoint fails pull will be continuously retried with an\n * exponential backoff.\n \n @param [now=false] If true, pull will happen immediately and ignore\n * {@link RequestOptions.minDelayMs} as well as the exponential backoff in\n * case of errors.\n * @returns A promise that resolves when the next pull completes. In case of\n * errors the first error will reject the returned promise. Subsequent errors\n * will not be reflected in the promise.\n /\n pull({now = false} = {}): Promise<void> {\n return throwIfError(this.#pullConnectionLoop.send(now));\n }\n\n /\n Applies an update from the server to Replicache.\n * Throws an error if cookie does not match. In that case the server thinks\n * this client has a different cookie than it does; the caller should disconnect\n * from the server and re-register, which transmits the cookie the client actually\n * has.\n \n @experimental This method is under development and its semantics will change.\n /\n async poke(poke: PokeInternal): Promise<void> {\n await this.#ready;\n // TODO(MP) Previously we created a request ID here and included it with the\n // PullRequest to the server so we could tie events across client and server\n // together. Since the direction is now reversed, creating and adding a request ID\n // here is kind of silly. We should consider creating the request ID\n // on the server* and passing it down in the poke for inclusion here in the log\n // context\n const {clientID} = this;\n const requestID = newRequestID(clientID);\n const lc = this.#lc\n .withContext('handlePullResponse')\n .withContext('requestID', requestID);\n\n const {pullResponse} = poke;\n\n if (isVersionNotSupportedResponse(pullResponse)) {\n this.#handleVersionNotSupportedResponse(pullResponse);\n return;\n }\n\n if (isClientStateNotFoundResponse(pullResponse)) {\n await this.#clientStateNotFoundOnServer();\n return;\n }\n\n const result = await handlePullResponseV1(\n lc,\n this.memdag,\n deepFreeze(poke.baseCookie),\n pullResponse,\n clientID,\n FormatVersion.Latest,\n );\n\n switch (result.type) {\n case HandlePullResponseResultEnum.Applied:\n await this.maybeEndPull(result.syncHead, requestID);\n break;\n case HandlePullResponseResultEnum.CookieMismatch:\n throw new Error(\n 'unexpected base cookie for poke: ' + JSON.stringify(poke),\n );\n case HandlePullResponseResultEnum.NoOp:\n break;\n }\n }\n\n async beginPull(): Promise<BeginPullResult> {\n if (TESTING) {\n this.onBeginPull();\n }\n await this.#ready;\n const profileID = await this.profileID;\n const {clientID} = this;\n const clientGroupID = await this.#clientGroupIDPromise;\n const {\n result: {beginPullResponse, requestID},\n } = await this.#wrapInReauthRetries(\n async (requestID: string, requestLc: LogContext) => {\n const beginPullResponse = await beginPullV1(\n profileID,\n clientID,\n clientGroupID,\n this.schemaVersion,\n this.puller,\n requestID,\n this.memdag,\n FormatVersion.Latest,\n requestLc,\n );\n return {\n result: {beginPullResponse, requestID},\n httpRequestInfo: beginPullResponse.httpRequestInfo,\n };\n },\n 'pull',\n this.#lc,\n () => this.#changeSyncCounters(0, -1),\n () => this.#changeSyncCounters(0, 1),\n );\n\n const {pullResponse} = beginPullResponse;\n if (isVersionNotSupportedResponse(pullResponse)) {\n this.#handleVersionNotSupportedResponse(pullResponse);\n } else if (isClientStateNotFoundResponse(beginPullResponse.pullResponse)) {\n await this.#clientStateNotFoundOnServer();\n }\n\n const {syncHead, httpRequestInfo} = beginPullResponse;\n return {requestID, syncHead, ok: httpRequestInfo.httpStatusCode === 200};\n }\n\n persist(): Promise<void> {\n // Prevent multiple persist calls from running at the same time.\n return this.#persistLock.withLock(async () => {\n const {clientID} = this;\n await this.#ready;\n if (this.#closed) {\n return;\n }\n try {\n await persistDD31(\n this.#lc,\n clientID,\n this.memdag,\n this.perdag,\n this.#mutatorRegistry,\n () => this.#closed,\n FormatVersion.Latest,\n this.#zero?.getTxData,\n );\n } catch (e) {\n if (e instanceof ClientStateNotFoundError) {\n this.#clientStateNotFoundOnClient(clientID);\n } else if (e instanceof InvalidRefCountError) {\n await this.#handleInvalidRefCount(e);\n // Nothing was persisted and the database is gone. Do not tell this\n // or other instances to refresh from it.\n return;\n } else if (this.#closed) {\n this.#lc.debug?.('Exception persisting during close', e);\n } else {\n throw e;\n }\n }\n\n const clientGroupID = await this.#clientGroupIDPromise;\n assert(clientGroupID, 'Expected clientGroupID to be defined');\n this.#onPersist({clientID, clientGroupID});\n });\n }\n\n async refresh(): Promise<void> {\n await this.#ready;\n const {clientID} = this;\n if (this.#closed \|\| !this.#enableRefresh()) {\n return;\n }\n let refreshResult: Awaited<ReturnType<typeof refresh>>;\n try {\n refreshResult = await refresh(\n this.#lc,\n this.memdag,\n this.perdag,\n clientID,\n this.#mutatorRegistry,\n this.#subscriptions,\n () => this.closed,\n FormatVersion.Latest,\n this.#zero,\n );\n } catch (e) {\n if (e instanceof ClientStateNotFoundError) {\n this.#clientStateNotFoundOnClient(clientID);\n } else if (e instanceof InvalidRefCountError) {\n await this.#handleInvalidRefCount(e);\n } else if (this.#closed) {\n this.#lc.debug?.('Exception refreshing during close', e);\n } else {\n throw e;\n }\n }\n if (refreshResult !== undefined) {\n await this.#subscriptions.fire(refreshResult.diffs);\n }\n }\n\n #fireOnClientStateNotFound() {\n this.onClientStateNotFound?.();\n }\n\n #clientStateNotFoundOnClient(clientID: ClientID) {\n this.#lc.error?.(`Client state not found on client, clientID: ${clientID}`);\n this.#fireOnClientStateNotFound();\n }\n\n /*\n Set once recovery from a corrupt database has started. Every write path\n * into the perdag (open, persist, refresh, heartbeat, GC, ...) can trip on\n * the same corrupt key, so recovery runs once and later reports await it.\n /\n #corruptDatabaseRecovery: Promise<void> \| undefined;\n\n /\n Installed on the dag store that writes to our database. The store calls\n * it after the failing transaction has been released, so dropping the\n * database from here does not race with the rollback.\n /\n readonly #onInvalidRefCount = (e: InvalidRefCountError): void => {\n void this.#handleInvalidRefCount(e);\n };\n\n /\n The persistent dag store contains an invalid ref count. This means the\n * store is corrupt (due to some unknown bug) and every subsequent write that\n * touches that chunk would fail the same way. There is no way to repair it,\n * so we treat it like the client state was lost and fire\n * `onClientStateNotFound`.\n \n Disabling the client group is not enough: the corrupt ref count stays in\n * the underlying kv store and any later write that touches that chunk (for\n * example rewriting the `clients` chunk when a new client starts) would hit\n * it again. Instead we drop the whole database so that the reload starts\n * from a fresh store. Pending local mutations in this database are lost.\n \n This is expected to be exceedingly rare. Other instances sharing the\n * database are not told: they simply hit the same corrupt key (or, once\n * this instance drops the database, a generic storage error) on their own\n * next write and recover the same way then. That's an acceptable delay for\n * something we don't expect to ever happen.\n /\n #handleInvalidRefCount(e: InvalidRefCountError): Promise<void> {\n if (this.#corruptDatabaseRecovery === undefined) {\n this.#lc.error?.(\n `Client state is corrupt on client, clientID: ${this.clientID}. Dropping database ${this.idbName}`,\n e,\n );\n this.#corruptDatabaseRecovery =\n this.#dropDatabaseAndFireOnClientStateNotFound();\n }\n return this.#corruptDatabaseRecovery;\n }\n\n /\n Drops our database, then fires `onClientStateNotFound` so the app can\n * recover, whether or not the drop itself succeeded.\n \n Uses its own handle on the databases registry rather than `#idbDatabases`\n * so it works even when `close()` is already closing this instance.\n /\n async #dropDatabaseAndFireOnClientStateNotFound(): Promise<void> {\n const {idbName, clientID} = this;\n let idbDatabases: IDBDatabasesStore \| undefined;\n try {\n idbDatabases = new IDBDatabasesStore(this.#kvStoreProvider.create);\n await dropDatabaseInternal(\n idbName,\n idbDatabases,\n this.#kvStoreProvider.drop,\n );\n } catch (dropError) {\n this.#lc.error?.(\n `Failed to drop database ${idbName}, clientID: ${clientID}`,\n dropError,\n );\n }\n try {\n await idbDatabases?.close();\n } catch (closeError) {\n // Closing the registry handle is best effort. The callback below must\n // fire regardless, and the drop outcome was already logged.\n this.#lc.debug?.(\n `Failed to close the databases registry after dropping ${idbName}, clientID: ${clientID}`,\n closeError,\n );\n }\n this.#fireOnClientStateNotFound();\n }\n\n async #clientStateNotFoundOnServer() {\n const clientGroupID = await this.#clientGroupIDPromise;\n this.#lc.error?.(\n `Client state not found on server, clientGroupID: ${clientGroupID}`,\n );\n await this.disableClientGroup();\n this.#fireOnClientStateNotFound();\n }\n\n async disableClientGroup(): Promise<void> {\n const clientGroupID = await this.#clientGroupIDPromise;\n assert(clientGroupID, 'Expected clientGroupID to be defined');\n this.isClientGroupDisabled = true;\n await withWrite(this.perdag, dagWrite =>\n disableClientGroup(clientGroupID, dagWrite),\n );\n }\n\n #fireOnUpdateNeeded(reason: UpdateNeededReason) {\n this.#lc.debug?.(`Update needed, reason: ${reason}`);\n this.onUpdateNeeded?.(reason);\n }\n\n async #schedulePersist(): Promise<void> {\n if (!this.#enableScheduledPersist) {\n return;\n }\n await this.#schedule('persist', this.#persistScheduler);\n }\n\n async #handlePersist(persistInfo: PersistInfo): Promise<void> {\n this.#lc.debug?.('Handling persist', persistInfo);\n const clientGroupID = await this.#clientGroupIDPromise;\n if (persistInfo.clientGroupID === clientGroupID) {\n void this.#scheduleRefresh();\n }\n }\n\n async #scheduleRefresh(): Promise<void> {\n if (!this.#enableScheduledRefresh) {\n return;\n }\n await this.#schedule('refresh from storage', this.#refreshScheduler);\n }\n\n async #schedule(name: string, scheduler: ProcessScheduler): Promise<void> {\n try {\n await scheduler.schedule();\n } catch (e) {\n if (e instanceof AbortError) {\n this.#lc.debug?.(`Scheduled ${name} did not complete before close.`);\n } else {\n this.#lc.error?.(`Error during ${name}`, e);\n }\n }\n }\n\n /\n Runs a refresh as soon as possible through the refresh scheduler.\n /\n runRefresh(): Promise<void> {\n return this.#refreshScheduler.run();\n }\n\n #changeSyncCounters(pushDelta: 0, pullDelta: 1 \| -1): void;\n #changeSyncCounters(pushDelta: 1 \| -1, pullDelta: 0): void;\n #changeSyncCounters(pushDelta: number, pullDelta: number): void {\n this.#pushCounter += pushDelta;\n this.#pullCounter += pullDelta;\n const delta = pushDelta + pullDelta;\n const counter = this.#pushCounter + this.#pullCounter;\n if ((delta === 1 && counter === 1) \|\| counter === 0) {\n const syncing = counter > 0;\n // Run in a new microtask.\n void Promise.resolve().then(() => this.onSync?.(syncing));\n }\n }\n\n /\n Subscribe to the result of a {@link query}. The `body` function is\n * evaluated once and its results are returned via `onData`.\n \n Thereafter, each time the the result of `body` changes, `onData` is fired\n * again with the new result.\n \n `subscribe()` goes to significant effort to avoid extraneous work\n * re-evaluating subscriptions:\n \n 1. subscribe tracks the keys that `body` accesses each time it runs. `body`\n * is only re-evaluated when those keys change.\n * 2. subscribe only re-fires `onData` in the case that a result changes by\n * way of the `isEqual` option which defaults to doing a deep JSON value\n * equality check.\n \n Because of (1), `body` must be a pure function of the data in Replicache.\n * `body` must not access anything other than the `tx` parameter passed to it.\n \n Although subscribe is as efficient as it can be, it is somewhat constrained\n * by the goal of returning an arbitrary computation of the cache. For even\n * better performance (but worse dx), see {@link experimentalWatch}.\n \n If an error occurs in the `body` the `onError` function is called if\n * present. Otherwise, the error is logged at log level 'error'.\n \n To cancel the subscription, call the returned function.\n \n @param body The function to evaluate to get the value to pass into\n * `onData`.\n * @param options Options is either a function or an object. If it is a\n * function it is equivalent to passing it as the `onData` property of an\n * object.\n /\n subscribe<R>(\n body: (tx: ReadTransaction) => Promise<R>,\n options: SubscribeOptions<R> \| ((result: R) => void),\n ): () => void {\n if (typeof options === 'function') {\n options = {onData: options};\n }\n\n const {onData, onError, onDone, isEqual} = options;\n return this.#subscriptions.add(\n new SubscriptionImpl(body, onData, onError, onDone, isEqual),\n );\n }\n\n /\n Watches Replicache for changes.\n \n The `callback` gets called whenever the underlying data changes and the\n * `key` changes matches the `prefix` of {@link ExperimentalWatchIndexOptions} or\n * {@link ExperimentalWatchNoIndexOptions} if present. If a change\n * occurs to the data but the change does not impact the key space the\n * callback is not called. In other words, the callback is never called with\n * an empty diff.\n \n This gets called after commit (a mutation or a rebase).\n \n @experimental This method is under development and its semantics will\n * change.\n /\n experimentalWatch(callback: WatchNoIndexCallback): () => void;\n experimentalWatch<Options extends WatchOptions>(\n callback: WatchCallbackForOptions<Options>,\n options?: Options,\n ): () => void;\n experimentalWatch<Options extends WatchOptions>(\n callback: WatchCallbackForOptions<Options>,\n options?: Options,\n ): () => void {\n return this.#subscriptions.add(\n new WatchSubscription(callback as WatchCallback, options),\n );\n }\n\n /\n Query is used for read transactions. It is recommended to use transactions\n * to ensure you get a consistent view across multiple calls to `get`, `has`\n * and `scan`.\n /\n query<R>(body: (tx: ReadTransaction) => Promise<R> \| R): Promise<R> {\n return this.#queryInternal(body);\n }\n\n get cookie(): Promise<Cookie> {\n return this.#ready.then(() =>\n withRead(this.memdag, async dagRead => {\n const mainHeadHash = await dagRead.getHead(DEFAULT_HEAD_NAME);\n if (!mainHeadHash) {\n throw new Error('Internal no main head found');\n }\n const baseSnapshot = await baseSnapshotFromHash(mainHeadHash, dagRead);\n const baseSnapshotMeta = baseSnapshot.meta;\n const cookie = baseSnapshotMeta.cookieJSON;\n assertCookie(cookie);\n return cookie;\n }),\n );\n }\n\n #queryInternal: QueryInternal = async body => {\n await this.#ready;\n const {clientID} = this;\n return withRead(this.memdag, async dagRead => {\n try {\n const dbRead = await readFromDefaultHead(dagRead, FormatVersion.Latest);\n const tx = new ReadTransactionImpl(clientID, dbRead, this.#lc);\n return await body(tx);\n } catch (ex) {\n throw await this.#convertToClientStateNotFoundError(ex);\n }\n });\n };\n\n #register<Return extends ReadonlyJSONValue \| void, Args extends JSONValue>(\n name: string,\n mutatorImpl: (tx: WriteTransaction, args?: Args) => MaybePromise<Return>,\n ): (\n args?: Args,\n ) => Promise<Return> \| {client: Promise<Return>; server: Promise<unknown>} {\n this.#mutatorRegistry[name] = mutatorImpl as (\n tx: WriteTransaction,\n args: JSONValue \| undefined,\n ) => Promise<void \| JSONValue>;\n\n return (\n args?: Args,\n ):\n \| Promise<Return>\n \| {client: Promise<Return>; server: Promise<unknown>} => {\n // DO NOT track CRUD mutations as they do not receive responses from\n // the server.\n const trackingData =\n name === '_zero_crud' ? undefined : this.#zero?.trackMutation();\n\n const result = this.#mutate(\n trackingData,\n name,\n mutatorImpl,\n args,\n performance.now(),\n );\n\n if (trackingData) {\n return {\n client: result,\n server: trackingData.serverPromise,\n };\n }\n\n return result;\n };\n }\n\n #registerMutators<\n M extends {\n [key: string]: (\n tx: WriteTransaction,\n args?: ReadonlyJSONValue,\n ) => MutatorReturn;\n },\n >(regs: M): MakeMutators<M> {\n type Mut = MakeMutators<M>;\n const rv: Partial<Mut> = Object.create(null);\n for (const k in regs) {\n rv[k] = this.#register(k, regs[k]) as MakeMutator<M[typeof k]>;\n }\n return rv as Mut;\n }\n\n async #mutate<\n R extends ReadonlyJSONValue \| void,\n A extends ReadonlyJSONValue,\n >(\n trackingData: MutationTrackingData \| undefined,\n name: string,\n mutatorImpl: (tx: WriteTransaction, args?: A) => MaybePromise<R>,\n args: A \| undefined,\n timestamp: number,\n ): Promise<R> {\n const frozenArgs = deepFreeze(args ?? null);\n\n // Ensure that we run initial pending subscribe functions before starting a\n // write transaction.\n if (this.#subscriptions.hasPendingSubscriptionRuns) {\n await Promise.resolve();\n }\n\n await this.#ready;\n const {clientID} = this;\n return withWriteNoImplicitCommit(this.memdag, async dagWrite => {\n try {\n let result: R;\n let newHead: Hash;\n let diffs: DiffsMap;\n let headHash: Hash;\n try {\n headHash = await mustGetHeadHash(DEFAULT_HEAD_NAME, dagWrite);\n const originalHash = null;\n\n const dbWrite = await newWriteLocal(\n headHash,\n name,\n frozenArgs,\n originalHash,\n dagWrite,\n timestamp,\n clientID,\n FormatVersion.Latest,\n );\n\n const mutationID = await dbWrite.getMutationID();\n const tx = new WriteTransactionImpl(\n clientID,\n mutationID,\n 'initial',\n await this.#zero?.getTxData(headHash, {\n openLazyRead: dagWrite,\n }),\n dbWrite,\n this.#lc,\n );\n\n if (trackingData) {\n this.#zero?.mutationIDAssigned(\n trackingData.ephemeralID,\n mutationID,\n );\n }\n\n result = await mutatorImpl(tx, args);\n\n throwIfClosed(dbWrite);\n const lastMutationID = await dbWrite.getMutationID();\n [newHead, diffs] = await dbWrite.commitWithDiffs(\n DEFAULT_HEAD_NAME,\n this.#subscriptions,\n );\n\n // Update this after the commit in case the commit fails.\n this.lastMutationID = lastMutationID;\n } catch (e) {\n // If we threw before we could persist the mutation\n // then we need to reject the mutation.\n if (trackingData) {\n this.#zero?.rejectMutation(trackingData.ephemeralID, e);\n }\n throw e;\n }\n\n this.#zero?.advance(headHash, newHead, diffs.get('') ?? []);\n\n // Send is not supposed to reject\n this.#pushConnectionLoop.send(false).catch(() => void 0);\n await this.#subscriptions.fire(diffs);\n void this.#schedulePersist();\n return result;\n } catch (ex) {\n throw await this.#convertToClientStateNotFoundError(ex);\n }\n });\n }\n\n /\n In the case we get a ChunkNotFoundError we check if the client got garbage\n * collected and if so change the error to a ClientStateNotFoundError instead\n /\n async #convertToClientStateNotFoundError(ex: unknown): Promise<unknown> {\n if (\n ex instanceof ChunkNotFoundError &&\n (await this.#checkForClientStateNotFoundAndCallHandler())\n ) {\n return new ClientStateNotFoundError(this.clientID);\n }\n\n return ex;\n }\n\n recoverMutations(): Promise<boolean> \| void {\n if (!process.env.DISABLE_MUTATION_RECOVERY) {\n // oxlint-disable-next-line no-non-null-assertion\n const result = this.#mutationRecovery!.recoverMutations(\n this.#ready,\n this.perdag,\n this.#idbDatabase,\n this.#idbDatabases,\n this.#kvStoreProvider.create,\n );\n if (TESTING) {\n void this.onRecoverMutations(result);\n }\n return result;\n }\n }\n\n /\n List of pending mutations. The order of this is from oldest to newest.\n \n Gives a list of local mutations that have `mutationID` >\n * `syncHead.mutationID` that exists on the main client group.\n \n @experimental This method is experimental and may change in the future.\n */\n experimentalPendingMutations(): Promise<readonly PendingMutation[]> {\n return withRead(this.memdag, pendingMutationsForAPI);\n }\n}\n\n// This map is used to keep track of closing instances of Replicache. When an\n// instance is opening we wait for any currently closing instances.\nconst closingInstances: Map<string, Promise<unknown>> = new Map();\n\nasync function throwIfError(p: Promise<undefined \| {error: unknown}>) {\n const res = await p;\n if (res) {\n throw res.error;\n }\n}\n\nfunction reload(): void {\n if (typeof location !== 'undefined') {\n location.reload();\n }\n}\n\nfunction validateOptions<MD extends MutatorDefs>(\n options: ReplicacheOptions<MD>,\n): void {\n const {name, clientMaxAgeMs} = options;\n if (typeof name !== 'string' \|\| !name) {\n throw new TypeError('name is required and must be non-empty');\n }\n\n if (clientMaxAgeMs !== undefined) {\n const min = Math.max(GC_INTERVAL, HEARTBEAT_INTERVAL);\n if (typeof clientMaxAgeMs !== 'number' \|\| clientMaxAgeMs <= min) {\n throw new TypeError(\n `clientAgeMaxMs must be a number larger than ${min}ms`,\n );\n }\n }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyIA,IAAM,mBAAmB;AAEzB,IAAM,0BAA0B;AAChC,IAAM,0BAA0B;AAEhC,IAAM,sBAAsB;AAC5B,IAAM,sBAAsB;;;;;;AAO5B,IAAM,4BAA4B;AAElC,IAAM,2CAA2C,MAAM,KAAK;AAE5D,IAAM,gCAAgC,MAAS;AAE/C,IAAM,aAAa,CAEnB;AAEA,IAAM,mCAAuD,EAC3D,MAAM,iBACR;AA0DA,IAAa,iBAAb,MAAyD;;CAEvD;;CAGA;;CAGA;;CAGA;CAEA;CACA;;;;;CAMA,wBAAwB;CAExB;CACA;CAEA,iBAAyB;;;;;CAMzB,IAAI,UAAkB;EACpB,OAAO,YAAY,KAAK,MAAM,KAAK,aAAa;CAClD;;;;;;CAOA,IAAI,UAAmB;EACrB,OAAO,KAAKG;CACd;CAEA,IAAI,KAAK,MAAc;EACrB,IAAI,KAAKC,OACP,KAAKA,MAAM,OAAO;EAGpB,KAAKC,QAAQ;CACf;CAEA,IAAI,OAAO;EACT,OAAO,KAAKA;CACd;;CAGA;CAEA,IAAIC,eAAkC;EACpC,OAAO;GACL,MAAM,KAAK;GACX,gBAAgB,KAAK;GACrB,yBAAyB;GACzB,eAAe,KAAK;EACtB;CACF;CACA,UAAU;CACV,UAAU;CACV,YAAqB,aAAa;CAClC;;;;;;CAMA,cAAuB,SAAe;CACtC;CACA;CACA,mBAAyC,CAAC;;;;CAK1C;CAGA,eAAe;CACf,eAAe;CAEf;CACA;;;;;;CAOA;;;;;CAMA;CAEA;;;;CAKA;;;;CAKA;CAEA;CACA;CACA;CACA;CACA;CAEA,wBAAiC,IAAI,gBAAgB;CAErD,eAAwB,IAAI,KAAK;CACjC;CACA;CACA;CACA;CACA,oBAAoB,IAAI,uBAChB,KAAK,QAAQ,GACnB,yBACA,qBACA,KAAKU,sBAAsB,MAC7B;CACA;CACA,oBAAoB,IAAI,uBAChB,KAAK,QAAQ,GACnB,yBACA,qBACA,KAAKA,sBAAsB,MAC7B;;;;;CAMA,IAAI,iBAA2C;EAC7C,OAAO,KAAKH;CACd;;;;;;;;;;;;;;;;CAiBA,SAA8C;;;;;;;;;;;;;;CAe9C,wBAA6C;;;;;;;;;;;;;;;;;;;;CAqB7C,iBAAgE;;;;;;CAOhE,UACE;CAGF,sBAAsB,KAAA;CACtB,oBAAoB,KAAA;CACpB,sBAAsB,MAAwB;CAE9C,YACE,SACA,cAAqC,CAAC,GACtC;EACA,gBAAgB,OAAO;EACvB,MAAM,EACJ,MACA,WAAW,QACX,WAAW,CAAC,cAAc,GAC1B,UAAU,IACV,MACA,YAAY,IACZ,UAAU,IACV,gBAAgB,IAChB,eAAe,KACf,WAAW,CAAC,GACZ,iBAAiB,CAAC,GAClB,QACA,QACA,UAAU,CAAC,GACX,iBAAiB,6BACf;EACJ,MAAM,EACJ,yBAAyB,MACzB,yBAAyB,MACzB,yBAAyB,MACzB,sBAAsB,MACtB,0BAA0B,MAC1B,2BAA2B,MAC3B,yBAAyB,gBACvB;EACJ,KAAKT,QAAQ,YAAY;EACzB,KAAKC,QAAQ,QAAQ;EACrB,KAAK,UAAU;EACf,KAAK,UAAU;EACf,KAAK,OAAO;EACZ,KAAK,gBAAgB;EACrB,KAAK,eAAe;EACpB,KAAK,YAAY;EACjB,KAAK,SAAS,UAAU,iBAAiB,IAAI;EAC7C,KAAK,SAAS,UAAU,iBAAiB,IAAI;EAE7C,KAAKa,0BAA0B;EAC/B,KAAKC,0BAA0B;EAC/B,KAAKC,iBAAiB;EACtB,KAAKC,2BAA2B;EAEhC,KAAKN,MAAM,iBAAiB,UAAU,UAAU,EAAC,KAAI,CAAC;EACtD,KAAKA,IAAI,QAAQ,2BAA2B;GAC1C;GACA,sBAAsB;EACxB,CAAC;EAED,KAAKf,iBAAiB,IAAI,yBACxB,KAAKuB,gBACL,KAAKR,KACL,KAAKC,sBAAsB,MAC7B;EAEA,MAAM,kBAAkB,mBAAmB,KAAKD,KAAK,QAAQ,OAAO;EACpE,KAAKb,mBAAmB;EAExB,MAAM,aAAa,gBAAgB,OAAO,KAAK,OAAO;EACtD,KAAKC,cAAc;EAEnB,KAAKW,gBAAgB,IAAI,kBAAkB,gBAAgB,MAAM;EACjE,KAAK,SAAS,IAAI,UAChB,YACA,eACA,YACA,KAAKU,kBACP;EACA,KAAK,SAAS,IAAI,UAChB,KAAK,QACL,0CACA,eACA,UACF;EAIA,MAAM,gBAAgB,SAAe;EACrC,KAAKhB,SAAS,cAAc;EAE5B,MAAM,EAAC,aAAA,IAA2B,aAAa,iBAC7C;EACF,KAAKK,kBAAkB;GAAC;GAAY;EAAU;EAE9C,MAAM,oBAAoB,6BACxB,iBAAiB,UAAU,GAC3B,GACA,KAAKG,sBAAsB,MAC7B;EAEA,KAAKS,sBAAsB,IAAI,eAC7B,KAAKV,IAAI,YAAY,MAAM,GAC3B,IAAI,aAAa,YAAY,KAAKW,YAAY,CAAC,GAC/C,iBACF;EAEA,KAAKC,sBAAsB,IAAI,eAC7B,KAAKZ,IAAI,YAAY,MAAM,GAC3B,IAAI,aAAa,YAAY,KAAKa,YAAY,CAAC,CACjD;EAEA,KAAK,SAAS,KAAKC,kBAAkB,QAAQ;EAE7C,MAAM,oBAAoB,SAAiB;EAC3C,KAAKnB,oBAAoB,kBAAkB;EAC3C,MAAM,wBAAwB,SAAiB;EAC/C,KAAKC,wBAAwB,sBAAsB;EAenD,KAAKW,aAAa,qBAChB,KAAK,MACL,KAAKN,sBAAsB,SAC3B,gBAAe;GACb,KAAUkB,eAAe,WAAW;EACtC,CACF;EAEA,KAAUC,MACR,SACA,0BACA,wBACA,gBACA,kBAAkB,SAClB,sBAAsB,SACtB,cAAc,SACd,gBACF,EAAE,OAAM,MAAK;GAKX,KAAK1B,YAAY,QAAQ;GACzB,IAAI,aAAa,sBAAsB;IAIrC,KAAKM,IAAI,QAAQ,qDAAqD;IACtE;GACF;GACA,MAAM;EACR,CAAC;CACH;CAEA,MAAMoB,MACJ,SACA,0BACA,wBACA,gBACA,mBACA,sBACA,cACA,kBACe;EACf,MAAM,EAAC,aAAY;EAMnB,MAAM,YAAY,YAAY,IAAI;EAGlC,MAAM,iBAAiB,IAAI,KAAK,IAAI;EACpC,MAAM,KAAKrB,cAAc,aAAa,EAAE,KAAK,iBAAiB;EAC9D,MAAM,KAAKA,cAAc,YAAY,KAAKR,YAAY;EACtD,MAAM,CAAC,QAAQ,YAAY,oBAAoB,MAAM,aACnD,UACA,KAAKS,KACL,KAAK,QACL,OAAO,KAAK,KAAKH,gBAAgB,GACjC,SACA,GACA,wBACF;EAEA,qBAAqB,OAAO,aAAa;EACzC,MAAM,UAAU,KAAK,SAAQ,UAC3B,MAAM,QAAQ,mBAAmB,QAAQ,CAC3C;EAGA,MAAM,WAAW,YAAY,IAAI,IAAI;EACrC,IAAI,WAAW,2BACb,KAAKG,IAAI,OAAO,6BAA6B,KAAK,MAAM,QAAQ,EAAE,KAAK,EACrE,MAAM,KAAK,QACb,CAAC;OAED,KAAKA,IAAI,QAAQ,0BAA0B,KAAK,MAAM,QAAQ,GAAG,IAAI;EAGvE,MAAM,KAAKX,OAAO,KAAK,UAAU,KAAK,MAAM;EAC5C,aAAa;EAEb,IAAI,KAAKiB,0BAA0B;GACjC,KAAK,KAAK,EAAE,MAAM,IAAI;GACtB,KAAK,KAAK,EAAE,MAAM,IAAI;EACxB;EAEA,MAAM,EAAC,WAAU,KAAKL;EAEtB,gBACE,UACA,KAAK,cACC;GACJ,KAAKoB,6BAA6B,QAAQ;EAC5C,GACA,oBACA,KAAKrB,KACL,MACF;EACA,aACE,UACA,KAAK,QACL,gBACA,aACA,kBACA,KAAKA,KACL,MACF;EACA,wBACE,KAAKD,eACL,KAAKZ,kBACL,sBACA,2BACA,IAAI,gBACJ,wBACA,kBACA,KAAKa,KACL,SAMC,MAAM,kBACL,IAAI,UACF,cAAc,IAAI,GAClB,eACA,YACA,SAAS,KAAK,UAAU,KAAKS,qBAAqB,KAAA,CACpD,CACJ;EACA,kBAAkB,KAAK,QAAQ,wBAAwB,KAAKT,KAAK,MAAM;EACvE,qBACE,KAAK,MACL,KAAK,SACL,QACA,OAAO,eACP,wBACM;GACJ,KAAKsB,oBAAoB,gCAAgC;EAC3D,GACA,KAAK,MACP;EAEA,4BACQ,KAAK,iBAAiB,GAC5B,+BACA,MACF;EACA,KAAU,iBAAiB;EAE3B,iBAAiB,UAAU,GAAG,iBAC5B,oBACA,KAAKC,mBACP;CACF;CAEA,sBAAsB,YAAY;EAChC,IAAI,KAAKC,SACP;EAIF,IAAI,iBAAiB,UAAU,GAAG,oBAAoB,WACpD;EAGF,MAAM,KAAKC,2CAA2C;CACxD;CAEA,MAAMA,6CAA+D;EACnE,MAAM,EAAC,aAAY;EACnB,MAAM,mBAAiB,MAAM,SAAS,KAAK,SAAQ,SACjD,eAAsB,UAAU,IAAI,CACtC;EACA,IAAI,CAAC,kBACH,KAAKJ,6BAA6B,QAAQ;EAE5C,OAAO,CAAC;CACV;;;;;CAMA,IAAI,YAA6B;EAC/B,OAAO,KAAK1B;CACd;;;;;CAMA,IAAI,WAAmB;EACrB,OAAO,KAAKH;CACd;;;;;;;CAQA,IAAI,gBAAiC;EACnC,OAAO,KAAKI;CACd;;;;;CAMA,iBAAqD;;;;;;;CAQrD,IAAI,SAAkB;EACpB,OAAO,KAAK8B;CACd;;;;;;;CAQA,IAAI,SAAkB;EACpB,OAAO,KAAKF;CACd;;;;;;CAOA,MAAM,QAAuB;EAC3B,KAAKA,UAAU;EACf,MAAM,EAAC,SAAS,YAAW,SAAS;EACpC,iBAAiB,IAAI,KAAK,MAAM,OAAO;EAEvC,KAAKvB,sBAAsB,MAAM;EAEjC,iBAAiB,UAAU,GAAG,oBAC5B,oBACA,KAAKsB,mBACP;EAEA,MAAM,QAAQ,KAAK,CAAC,KAAK9B,QAAQ,KAAKC,YAAY,OAAO,CAAC;EAC1D,MAAM,kBAAkB;GACtB,KAAK,OAAO,MAAM;GAClB,KAAK,OAAO,MAAM;GAClB,KAAKK,cAAc,MAAM;EAC3B;EAEA,KAAKW,oBAAoB,MAAM;EAC/B,KAAKE,oBAAoB,MAAM;EAE/B,KAAK3B,eAAe,MAAM;EAE1B,MAAM,QAAQ,IAAI,eAAe;EACjC,iBAAiB,OAAO,KAAK,IAAI;EACjC,QAAQ;CACV;CAEA,MAAM,aAAa,UAAgB,WAAkC;EACnE,SAAS;GACP,IAAI,KAAKuC,SACP;GAGF,MAAM,KAAK/B;GACX,MAAM,EAAC,aAAY;GACnB,MAAM,KAAK,KAAKO,IACb,YAAY,cAAc,EAC1B,YAAY,aAAa,SAAS;GACrC,MAAM,EAAC,iBAAiB,OAAO,aAAa,aAC1C,MAAM,aACJ,KAAK,QACL,IACA,UACA,UACA,KAAKf,gBACL,CACF;GAEF,IAAI,CAAC,mBAAmB,gBAAgB,WAAW,GAAG;IAEpD,KAAKI,OAAO,QAAQ,aAAa,UAAU,MAAM,IAAI,EAAE,KAAK,CAAC,CAAC;IAC9D,MAAM,KAAKJ,eAAe,KAAK,KAAK;IACpC,KAAU0C,iBAAiB;IAC3B;GACF;GAGA,IAAI,WAAW,MAAM,KAAKtC,OAAO,YAAY,QAAQ;GACrD,KAAK,MAAM,YAAY,iBAAiB;IAItC,IAAI,KAAKJ,eAAe,4BACtB,MAAM,QAAQ,QAAQ;IAExB,MAAM,EAAC,SAAQ;IACf,MAAM,EAAC,QAAQ,UAAU,SAAQ,MAAM,0BACrC,KAAK,SACL,aACE,wBACE,UACA,UACA,UACA,gBACA,KAAKY,kBACL,IACA,gBAAgB,IAAI,IAAI,KAAK,WAAW,UACxC,GACA,QACF,CACJ;IACA,WAAW;IAGX,WAAW;GACb;EACF;CACF;CAEA,cAAgC;EAC9B,IAAI,KAAKoB,gBAAgB,GACvB,OAAO,QAAQ,QAAQ,IAAI;EAG7B,OAAO,KAAKF,mBAAmB,YAAY;GACzC,IAAI;IACF,KAAKa,oBAAoB,GAAG,CAAC;IAC7B,MAAM,EAAC,UAAU,WAAW,OAAM,MAAM,KAAK,UAAU;IACvD,IAAI,CAAC,IACH,OAAO;IAET,IAAI,aAAa,WACf,MAAM,KAAK,aAAa,UAAU,SAAS;GAE/C,SAAS,GAAG;IACV,MAAM,MAAM,KAAKC,mCAAmC,CAAC;GACvD,UAAU;IACR,KAAKD,oBAAoB,GAAG,EAAE;GAChC;GACA,OAAO;EACT,GAAG,MAAM;CACX;CAEA,kBAAkB;EAChB,OACE,KAAK,yBACJ,KAAK,YAAY,MAAM,gBAAgB,KAAK,MAAM;CAEvD;CAEA,MAAMb,mBACJ,GACA,MACkB;EAClB,IAAI,SAAS;EAEb,IAAI;GACF,OAAO,MAAM,EAAE;EACjB,SAAS,GAAG;GAYV,IAAI,aAAa,aAAa,aAAa,WAAW;IACpD,SAAS;IACT,KAAKf,IAAI,QAAQ,GAAG,KAAK,YAAY,GAAG,mBAAmB,EAAE,QAAQ;GACvE,OAAO,IAAI,aAAa,aACtB,KAAKA,IAAI,QAAQ,CAAC;QAElB,KAAKA,IAAI,OAAO,GAAG,KAAK,YAAY,CAAC;GAEvC,OAAO;EACT,UAAU;GACR,IAAI,KAAK0B,YAAY,QAAQ;IAC3B,KAAKA,UAAU;IACf,KAAK,iBAAiB,MAAM;IAC5B,IAAI,QACF,KAAU,iBAAiB;GAE/B;EACF;CACF;CAEA,MAAMV,qBACJ,GAOA,MACA,IACA,UAAoC,MACpC,WAAqC,MAIpC;EACD,MAAM,EAAC,aAAY;EACnB,IAAI,iBAAiB;EACrB,IAAI;EACJ,KAAK,GAAG,YAAY,IAAI;EACxB,GAAG;GACD,MAAM,YAAY,aAAa,QAAQ;GACvC,MAAM,YAAY,GAAG,YAAY,aAAa,SAAS;GACvD,MAAM,EAAC,iBAAiB,WAAU,MAAM,EAAE,WAAW,SAAS;GAC9D,aAAa;GACb,IAAI,CAAC,iBACH,OAAO;IACL;IACA,aAAa;GACf;GAEF,MAAM,EAAC,cAAc,mBAAkB;GAEvC,IAAI,gBAAgB,mBAAmB,KAGrC,UAAU,QACR,gCAAgC,KAAK,IAAI,oBACtC,eAAe,KAAK,iBAAiB,GAC1C;GAEF,IAAI,mBAAA,KACF,OAAO;IACL;IACA,aAAa;GACf;GAEF,IAAI,CAAC,KAAK,SACR,OAAO;IACL;IACA,aAAa;GACf;GAEF,IAAI;GACJ,IAAI;IACF,MAAM,QAAQ;IACd,OAAO,MAAM,KAAK,QAAQ;GAC5B,UAAU;IACR,MAAM,SAAS;GACjB;GACA,IAAI,SAAS,QAAQ,SAAS,KAAA,GAC5B,OAAO;IACL;IACA,aAAa;GACf;GAEF,KAAK,OAAO;GACZ;EACF,SAAS,iBAAiB;EAC1B,GAAG,OAAO,wCAAwC;EAClD,OAAO;GACL,QAAQ;GACR,aAAa;EACf;CACF;CAEA,kBAAkB;EAChB,OACE,KAAK,yBACJ,KAAK,YAAY,MAAM,gBAAgB,KAAK,MAAM;CAEvD;CAEA,MAAMH,cAAgC;EAIpC,IAAI,KAAKK,gBAAgB,GACvB,OAAO;EAGT,MAAM,KAAKzB;EACX,MAAM,YAAY,MAAM,KAAKE;EAC7B,MAAM,EAAC,aAAY;EACnB,MAAM,gBAAgB,MAAM,KAAKC;EACjC,OAAO,KAAKmB,mBAAmB,YAAY;GACzC,MAAM,EAAC,QAAQ,iBAAgB,MAAM,KAAKC,qBACxC,OAAO,WAAmB,cAA0B;IAClD,IAAI;KACF,KAAKY,oBAAoB,GAAG,CAAC;KAC7B,MAAM,eAAe,MAAM,KACzB,WACA,KAAK,QACL,WACA,WACA,eACA,UACA,KAAK,QACL,KAAK,eAAA,CAEP;KACA,OAAO;MACL,QAAQ;MACR,iBAAiB,cAAc;KACjC;IACF,UAAU;KACR,KAAKA,oBAAoB,IAAI,CAAC;IAChC;GACF,GACA,QACA,KAAK5B,GACP;GAEA,IAAI,iBAAiB,KAAA,GAEnB,OAAO;GAGT,MAAM,EAAC,UAAU,oBAAmB;GAEpC,IAAI,8BAA8B,QAAQ,GACxC,KAAK8B,mCAAmC,QAAQ;QAC3C,IAAI,8BAA8B,QAAQ,GAC/C,MAAM,KAAKC,6BAA6B;GAK1C,OAAO,gBAAgB,mBAAmB;EAC5C,GAAG,MAAM;CACX;CAEA,mCAAmC,UAAuC;EACxE,MAAM,SAA6B,EACjC,MAAM,SAAS,MACjB;EACA,IAAI,SAAS,aACX,OAAO,cAAc,SAAS;EAEhC,KAAKT,oBAAoB,MAAM;CACjC;;;;;;;;;;;;;;;;;;CAmBA,KAAK,EAAC,MAAM,UAAS,CAAC,GAAkB;EACtC,OAAO,aAAa,KAAKV,oBAAoB,KAAK,GAAG,CAAC;CACxD;;;;;;;;;;;;;;;CAgBA,KAAK,EAAC,MAAM,UAAS,CAAC,GAAkB;EACtC,OAAO,aAAa,KAAKF,oBAAoB,KAAK,GAAG,CAAC;CACxD;;;;;;;;;;CAWA,MAAM,KAAK,MAAmC;EAC5C,MAAM,KAAKjB;EAOX,MAAM,EAAC,aAAY;EACnB,MAAM,YAAY,aAAa,QAAQ;EACvC,MAAM,KAAK,KAAKO,IACb,YAAY,oBAAoB,EAChC,YAAY,aAAa,SAAS;EAErC,MAAM,EAAC,iBAAgB;EAEvB,IAAI,8BAA8B,YAAY,GAAG;GAC/C,KAAK8B,mCAAmC,YAAY;GACpD;EACF;EAEA,IAAI,8BAA8B,YAAY,GAAG;GAC/C,MAAM,KAAKC,6BAA6B;GACxC;EACF;EAEA,MAAM,SAAS,MAAM,qBACnB,IACA,KAAK,QACL,WAAW,KAAK,UAAU,GAC1B,cACA,UACA,CACF;EAEA,QAAQ,OAAO,MAAf;GACE,KAAK;IACH,MAAM,KAAK,aAAa,OAAO,UAAU,SAAS;IAClD;GACF,KAAK,GACH,MAAM,IAAI,MACR,sCAAsC,KAAK,UAAU,IAAI,CAC3D;GACF,KAAK,GACH;EACJ;CACF;CAEA,MAAM,YAAsC;EAI1C,MAAM,KAAKtC;EACX,MAAM,YAAY,MAAM,KAAK;EAC7B,MAAM,EAAC,aAAY;EACnB,MAAM,gBAAgB,MAAM,KAAKG;EACjC,MAAM,EACJ,QAAQ,EAAC,mBAAmB,gBAC1B,MAAM,KAAKoB,qBACb,OAAO,WAAmB,cAA0B;GAClD,MAAM,oBAAoB,MAAM,YAC9B,WACA,UACA,eACA,KAAK,eACL,KAAK,QACL,WACA,KAAK,QACL,GACA,SACF;GACA,OAAO;IACL,QAAQ;KAAC;KAAmB;IAAS;IACrC,iBAAiB,kBAAkB;GACrC;EACF,GACA,QACA,KAAKhB,WACC,KAAK4B,oBAAoB,GAAG,EAAE,SAC9B,KAAKA,oBAAoB,GAAG,CAAC,CACrC;EAEA,MAAM,EAAC,iBAAgB;EACvB,IAAI,8BAA8B,YAAY,GAC5C,KAAKE,mCAAmC,YAAY;OAC/C,IAAI,8BAA8B,kBAAkB,YAAY,GACrE,MAAM,KAAKC,6BAA6B;EAG1C,MAAM,EAAC,UAAU,oBAAmB;EACpC,OAAO;GAAC;GAAW;GAAU,IAAI,gBAAgB,mBAAmB;EAAG;CACzE;CAEA,UAAyB;EAEvB,OAAO,KAAK7B,aAAa,SAAS,YAAY;GAC5C,MAAM,EAAC,aAAY;GACnB,MAAM,KAAKT;GACX,IAAI,KAAK+B,SACP;GAEF,IAAI;IACF,MAAM,YACJ,KAAKxB,KACL,UACA,KAAK,QACL,KAAK,QACL,KAAKH,wBACC,KAAK2B,SACX,GACA,KAAKnC,OAAO,SACd;GACF,SAAS,GAAG;IACV,IAAI,aAAa,0BACf,KAAKgC,6BAA6B,QAAQ;SACrC,IAAI,aAAa,sBAAsB;KAC5C,MAAM,KAAKW,uBAAuB,CAAC;KAGnC;IACF,OAAO,IAAI,KAAKR,SACd,KAAKxB,IAAI,QAAQ,qCAAqC,CAAC;SAEvD,MAAM;GAEV;GAEA,MAAM,gBAAgB,MAAM,KAAKJ;GACjC,OAAO,eAAe,sCAAsC;GAC5D,KAAKW,WAAW;IAAC;IAAU;GAAa,CAAC;EAC3C,CAAC;CACH;CAEA,MAAM,UAAyB;EAC7B,MAAM,KAAKd;EACX,MAAM,EAAC,aAAY;EACnB,IAAI,KAAK+B,WAAW,CAAC,KAAKnB,eAAe,GACvC;EAEF,IAAI;EACJ,IAAI;GACF,gBAAgB,MAAM,QACpB,KAAKL,KACL,KAAK,QACL,KAAK,QACL,UACA,KAAKH,kBACL,KAAKZ,sBACC,KAAK,QACX,GACA,KAAKI,KACP;EACF,SAAS,GAAG;GACV,IAAI,aAAa,0BACf,KAAKgC,6BAA6B,QAAQ;QACrC,IAAI,aAAa,sBACtB,MAAM,KAAKW,uBAAuB,CAAC;QAC9B,IAAI,KAAKR,SACd,KAAKxB,IAAI,QAAQ,qCAAqC,CAAC;QAEvD,MAAM;EAEV;EACA,IAAI,kBAAkB,KAAA,GACpB,MAAM,KAAKf,eAAe,KAAK,cAAc,KAAK;CAEtD;CAEA,6BAA6B;EAC3B,KAAK,wBAAwB;CAC/B;CAEA,6BAA6B,UAAoB;EAC/C,KAAKe,IAAI,QAAQ,+CAA+C,UAAU;EAC1E,KAAKiC,2BAA2B;CAClC;;;;;;CAOA;;;;;;CAOA,sBAA+B,MAAkC;EAC/D,KAAUD,uBAAuB,CAAC;CACpC;;;;;;;;;;;;;;;;;;;;CAqBA,uBAAuB,GAAwC;EAC7D,IAAI,KAAKE,6BAA6B,KAAA,GAAW;GAC/C,KAAKlC,IAAI,QACP,gDAAgD,KAAK,SAAS,sBAAsB,KAAK,WACzF,CACF;GACA,KAAKkC,2BACH,KAAKC,0CAA0C;EACnD;EACA,OAAO,KAAKD;CACd;;;;;;;;CASA,MAAMC,4CAA2D;EAC/D,MAAM,EAAC,SAAS,aAAY;EAC5B,IAAI;EACJ,IAAI;GACF,eAAe,IAAI,kBAAkB,KAAKhD,iBAAiB,MAAM;GACjE,MAAM,qBACJ,SACA,cACA,KAAKA,iBAAiB,IACxB;EACF,SAAS,WAAW;GAClB,KAAKa,IAAI,QACP,2BAA2B,QAAQ,cAAc,YACjD,SACF;EACF;EACA,IAAI;GACF,MAAM,cAAc,MAAM;EAC5B,SAAS,YAAY;GAGnB,KAAKA,IAAI,QACP,yDAAyD,QAAQ,cAAc,YAC/E,UACF;EACF;EACA,KAAKiC,2BAA2B;CAClC;CAEA,MAAMF,+BAA+B;EACnC,MAAM,gBAAgB,MAAM,KAAKnC;EACjC,KAAKI,IAAI,QACP,oDAAoD,eACtD;EACA,MAAM,KAAK,mBAAmB;EAC9B,KAAKiC,2BAA2B;CAClC;CAEA,MAAM,qBAAoC;EACxC,MAAM,gBAAgB,MAAM,KAAKrC;EACjC,OAAO,eAAe,sCAAsC;EAC5D,KAAK,wBAAwB;EAC7B,MAAM,UAAU,KAAK,SAAQ,aAC3B,mBAAmB,eAAe,QAAQ,CAC5C;CACF;CAEA,oBAAoB,QAA4B;EAC9C,KAAKI,IAAI,QAAQ,0BAA0B,QAAQ;EACnD,KAAK,iBAAiB,MAAM;CAC9B;CAEA,MAAM2B,mBAAkC;EACtC,IAAI,CAAC,KAAKxB,yBACR;EAEF,MAAM,KAAKiC,UAAU,WAAW,KAAKC,iBAAiB;CACxD;CAEA,MAAMlB,eAAe,aAAyC;EAC5D,KAAKnB,IAAI,QAAQ,oBAAoB,WAAW;EAChD,MAAM,gBAAgB,MAAM,KAAKJ;EACjC,IAAI,YAAY,kBAAkB,eAChC,KAAU0C,iBAAiB;CAE/B;CAEA,MAAMA,mBAAkC;EACtC,IAAI,CAAC,KAAKlC,yBACR;EAEF,MAAM,KAAKgC,UAAU,wBAAwB,KAAKG,iBAAiB;CACrE;CAEA,MAAMH,UAAU,MAAc,WAA4C;EACxE,IAAI;GACF,MAAM,UAAU,SAAS;EAC3B,SAAS,GAAG;GACV,IAAI,aAAa,YACf,KAAKpC,IAAI,QAAQ,aAAa,KAAK,gCAAgC;QAEnE,KAAKA,IAAI,QAAQ,gBAAgB,QAAQ,CAAC;EAE9C;CACF;;;;CAKA,aAA4B;EAC1B,OAAO,KAAKuC,kBAAkB,IAAI;CACpC;CAIA,oBAAoB,WAAmB,WAAyB;EAC9D,KAAKC,gBAAgB;EACrB,KAAKC,gBAAgB;EACrB,MAAM,QAAQ,YAAY;EAC1B,MAAM,UAAU,KAAKD,eAAe,KAAKC;EACzC,IAAK,UAAU,KAAK,YAAY,KAAM,YAAY,GAAG;GACnD,MAAM,UAAU,UAAU;GAE1B,QAAa,QAAQ,EAAE,WAAW,KAAK,SAAS,OAAO,CAAC;EAC1D;CACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAoCA,UACE,MACA,SACY;EACZ,IAAI,OAAO,YAAY,YACrB,UAAU,EAAC,QAAQ,QAAO;EAG5B,MAAM,EAAC,QAAQ,SAAS,QAAQ,YAAW;EAC3C,OAAO,KAAKxD,eAAe,IACzB,IAAI,iBAAiB,MAAM,QAAQ,SAAS,QAAQ,OAAO,CAC7D;CACF;CAsBA,kBACE,UACA,SACY;EACZ,OAAO,KAAKA,eAAe,IACzB,IAAI,kBAAkB,UAA2B,OAAO,CAC1D;CACF;;;;;;CAOA,MAAS,MAA2D;EAClE,OAAO,KAAKuB,eAAe,IAAI;CACjC;CAEA,IAAI,SAA0B;EAC5B,OAAO,KAAKf,OAAO,WACjB,SAAS,KAAK,QAAQ,OAAM,YAAW;GACrC,MAAM,eAAe,MAAM,QAAQ,QAAQ,iBAAiB;GAC5D,IAAI,CAAC,cACH,MAAM,IAAI,MAAM,6BAA6B;GAI/C,MAAM,UADmB,MADE,qBAAqB,cAAc,OAAO,GAC/B,KACN;GAChC,aAAa,MAAM;GACnB,OAAO;EACT,CAAC,CACH;CACF;CAEA,iBAAgC,OAAM,SAAQ;EAC5C,MAAM,KAAKA;EACX,MAAM,EAAC,aAAY;EACnB,OAAO,SAAS,KAAK,QAAQ,OAAM,YAAW;GAC5C,IAAI;IAGF,OAAO,MAAM,KAAK,IADH,oBAAoB,UAAU,MADxB,oBAAoB,SAAS,CAAoB,GACjB,KAAKO,GACxC,CAAE;GACtB,SAAS,IAAI;IACX,MAAM,MAAM,KAAK6B,mCAAmC,EAAE;GACxD;EACF,CAAC;CACH;CAEA,UACE,MACA,aAGyE;EACzE,KAAKhC,iBAAiB,QAAQ;EAK9B,QACE,SAGyD;GAGzD,MAAM,eACJ,SAAS,eAAe,KAAA,IAAY,KAAKR,OAAO,cAAc;GAEhE,MAAM,SAAS,KAAKqD,QAClB,cACA,MACA,aACA,MACA,YAAY,IAAI,CAClB;GAEA,IAAI,cACF,OAAO;IACL,QAAQ;IACR,QAAQ,aAAa;GACvB;GAGF,OAAO;EACT;CACF;CAEA,kBAOE,MAA0B;EAE1B,MAAM,KAAmB,OAAO,OAAO,IAAI;EAC3C,KAAK,MAAM,KAAK,MACd,GAAG,KAAK,KAAKC,UAAU,GAAG,KAAK,EAAE;EAEnC,OAAO;CACT;CAEA,MAAMD,QAIJ,cACA,MACA,aACA,MACA,WACY;EACZ,MAAM,aAAa,WAAW,QAAQ,IAAI;EAI1C,IAAI,KAAKzD,eAAe,4BACtB,MAAM,QAAQ,QAAQ;EAGxB,MAAM,KAAKQ;EACX,MAAM,EAAC,aAAY;EACnB,OAAO,0BAA0B,KAAK,QAAQ,OAAM,aAAY;GAC9D,IAAI;IACF,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;KACF,WAAW,MAAM,gBAAgB,mBAAmB,QAAQ;KAG5D,MAAM,UAAU,MAAM,cACpB,UACA,MACA,YACA,MACA,UACA,WACA,UACA,CACF;KAEA,MAAM,aAAa,MAAM,QAAQ,cAAc;KAC/C,MAAM,KAAK,IAAI,qBACb,UACA,YACA,WACA,MAAM,KAAKJ,OAAO,UAAU,UAAU,EACpC,cAAc,SAChB,CAAC,GACD,SACA,KAAKW,GACP;KAEA,IAAI,cACF,KAAKX,OAAO,mBACV,aAAa,aACb,UACF;KAGF,SAAS,MAAM,YAAY,IAAI,IAAI;KAEnC,cAAc,OAAO;KACrB,MAAM,iBAAiB,MAAM,QAAQ,cAAc;KACnD,CAAC,SAAS,SAAS,MAAM,QAAQ,gBAC/B,mBACA,KAAKJ,cACP;KAGA,KAAK,iBAAiB;IACxB,SAAS,GAAG;KAGV,IAAI,cACF,KAAKI,OAAO,eAAe,aAAa,aAAa,CAAC;KAExD,MAAM;IACR;IAEA,KAAKA,OAAO,QAAQ,UAAU,SAAS,MAAM,IAAI,EAAE,KAAK,CAAC,CAAC;IAG1D,KAAKuB,oBAAoB,KAAK,KAAK,EAAE,YAAY,KAAK,CAAC;IACvD,MAAM,KAAK3B,eAAe,KAAK,KAAK;IACpC,KAAU0C,iBAAiB;IAC3B,OAAO;GACT,SAAS,IAAI;IACX,MAAM,MAAM,KAAKE,mCAAmC,EAAE;GACxD;EACF,CAAC;CACH;;;;;CAMA,MAAMA,mCAAmC,IAA+B;EACtE,IACE,cAAc,sBACb,MAAM,KAAKJ,2CAA2C,GAEvD,OAAO,IAAI,yBAAyB,KAAK,QAAQ;EAGnD,OAAO;CACT;CAEA,mBAA4C,CAe5C;;;;;;;;;CAUA,+BAAoE;EAClE,OAAO,SAAS,KAAK,QAAQ,sBAAsB;CACrD;AACF;AAIA,IAAM,mCAAkD,IAAI,IAAI;AAEhE,eAAe,aAAa,GAA0C;CACpE,MAAM,MAAM,MAAM;CAClB,IAAI,KACF,MAAM,IAAI;AAEd;AAEA,SAAS,SAAe;CACtB,IAAI,OAAO,aAAa,aACtB,SAAS,OAAO;AAEpB;AAEA,SAAS,gBACP,SACM;CACN,MAAM,EAAC,MAAM,mBAAkB;CAC/B,IAAI,OAAO,SAAS,YAAY,CAAC,MAC/B,MAAM,IAAI,UAAU,wCAAwC;CAG9D,IAAI,mBAAmB,KAAA,GAAW;EAChC,MAAM,MAAM,KAAK,IAAI,aAAa,kBAAkB;EACpD,IAAI,OAAO,mBAAmB,YAAY,kBAAkB,KAC1D,MAAM,IAAI,UACR,+CAA+C,IAAI,GACrD;CAEJ;AACF"}

package/out/shared/src/arrays.js CHANGED Viewed

@@ -1,19 +1,5 @@
 import { assert } from "./asserts.js";
 //#region ../shared/src/arrays.ts
-/**
-* Returns `arr` as is if none of the elements are `undefined`.
-* Otherwise returns a new array with only defined elements in `arr`.
-*/
-function defined(arr) {
-	let i = arr.findIndex((x) => x === void 0);
-	if (i < 0) return arr;
-	const defined = arr.slice(0, i);
-	for (i++; i < arr.length; i++) {
-		const x = arr[i];
-		if (x !== void 0) defined.push(x);
-	}
-	return defined;
-}
 function areEqual(arr1, arr2) {
 	return arr1.length === arr2.length && arr1.every((e, i) => e === arr2[i]);
 }
@@ -40,6 +26,6 @@ function groupBy(arr, keyFn) {
 	return groups;
 }
 //#endregion
-export { areEqual, defined, groupBy, last, zip };
+export { areEqual, groupBy, last, zip };
 //# sourceMappingURL=arrays.js.map

package/out/shared/src/arrays.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"arrays.js","names":[],"sources":["../../../../shared/src/arrays.ts"],"sourcesContent":["import {assert} from './asserts.ts';\n\n/*\n Returns `arr` as is if none of the elements are `undefined`.\n * Otherwise returns a new array with only defined elements in `arr`.\n */\nexport function defined<T>(arr: (T \| undefined)[]): T[] {\n // avoid an array copy if possible\n let i = arr.findIndex(x => x === undefined);\n if (i < 0) {\n return arr as T[];\n }\n const defined: T[] = arr.slice(0, i) as T[];\n for (i++; i < arr.length; i++) {\n const x = arr[i];\n if (x !== undefined) {\n defined.push(x);\n }\n }\n return defined;\n}\n\nexport function areEqual<T>(arr1: readonly T[], arr2: readonly T[]): boolean {\n return arr1.length === arr2.length && arr1.every((e, i) => e === arr2[i]);\n}\n\nexport function zip<T1, T2>(a1: readonly T1[], a2: readonly T2[]): [T1, T2][] {\n assert(a1.length === a2.length, 'zip: arrays must have equal length');\n const result: [T1, T2][] = [];\n for (let i = 0; i < a1.length; i++) {\n result.push([a1[i], a2[i]]);\n }\n return result;\n}\n\nexport function last<T>(arr: T[]): T \| undefined {\n return arr.at(-1);\n}\n\nexport function groupBy<T, K>(\n arr: readonly T[],\n keyFn: (el: T) => K,\n): Map<K, T[]> {\n const groups = new Map<K, T[]>();\n for (const el of arr) {\n const key = keyFn(el);\n let group = groups.get(key);\n if (group === undefined) {\n group = [];\n groups.set(key, group);\n }\n group.push(el);\n }\n return groups;\n}\n"],"mappings":"~~;;;;;;AAMA~~,SAAgB,QAAW,KAA6B;CAEtD,IAAI,IAAI,IAAI,WAAU,MAAK,MAAM,KAAA,CAAS;CAC1C,IAAI,IAAI,GACN,OAAO;CAET,MAAM,UAAe,IAAI,MAAM,GAAG,CAAC;CACnC,KAAK,KAAK,IAAI,IAAI,QAAQ,KAAK;EAC7B,MAAM,IAAI,IAAI;EACd,IAAI,MAAM,KAAA,GACR,QAAQ,KAAK,CAAC;CAElB;CACA,OAAO;AACT;AAEA,SAAgB,SAAY,MAAoB,MAA6B;CAC3E,OAAO,KAAK,WAAW,KAAK,UAAU,KAAK,OAAO,GAAG,MAAM,MAAM,KAAK,EAAE;AAC1E;AAEA,SAAgB,IAAY,IAAmB,IAA+B;CAC5E,OAAO,GAAG,WAAW,GAAG,QAAQ,oCAAoC;CACpE,MAAM,SAAqB,CAAC;CAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,KAC7B,OAAO,KAAK,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC;CAE5B,OAAO;AACT;AAEA,SAAgB,KAAQ,KAAyB;CAC/C,OAAO,IAAI,GAAG,EAAE;AAClB;AAEA,SAAgB,QACd,KACA,OACa;CACb,MAAM,yBAAS,IAAI,IAAY;CAC/B,KAAK,MAAM,MAAM,KAAK;EACpB,MAAM,MAAM,MAAM,EAAE;EACpB,IAAI,QAAQ,OAAO,IAAI,GAAG;EAC1B,IAAI,UAAU,KAAA,GAAW;GACvB,QAAQ,CAAC;GACT,OAAO,IAAI,KAAK,KAAK;EACvB;EACA,MAAM,KAAK,EAAE;CACf;CACA,OAAO;AACT"}
1	+ {"version":3,"file":"arrays.js","names":[],"sources":["../../../../shared/src/arrays.ts"],"sourcesContent":["import {assert} from './asserts.ts';\n\n/*\n Returns `arr` as is if none of the elements are `undefined`.\n * Otherwise returns a new array with only defined elements in `arr`.\n */\nexport function defined<T>(arr: (T \| undefined)[]): T[] {\n // avoid an array copy if possible\n let i = arr.findIndex(x => x === undefined);\n if (i < 0) {\n return arr as T[];\n }\n const defined: T[] = arr.slice(0, i) as T[];\n for (i++; i < arr.length; i++) {\n const x = arr[i];\n if (x !== undefined) {\n defined.push(x);\n }\n }\n return defined;\n}\n\nexport function areEqual<T>(arr1: readonly T[], arr2: readonly T[]): boolean {\n return arr1.length === arr2.length && arr1.every((e, i) => e === arr2[i]);\n}\n\nexport function zip<T1, T2>(a1: readonly T1[], a2: readonly T2[]): [T1, T2][] {\n assert(a1.length === a2.length, 'zip: arrays must have equal length');\n const result: [T1, T2][] = [];\n for (let i = 0; i < a1.length; i++) {\n result.push([a1[i], a2[i]]);\n }\n return result;\n}\n\nexport function last<T>(arr: T[]): T \| undefined {\n return arr.at(-1);\n}\n\nexport function groupBy<T, K>(\n arr: readonly T[],\n keyFn: (el: T) => K,\n): Map<K, T[]> {\n const groups = new Map<K, T[]>();\n for (const el of arr) {\n const key = keyFn(el);\n let group = groups.get(key);\n if (group === undefined) {\n group = [];\n groups.set(key, group);\n }\n group.push(el);\n }\n return groups;\n}\n"],"mappings":";;AAsBA,SAAgB,SAAY,MAAoB,MAA6B;CAC3E,OAAO,KAAK,WAAW,KAAK,UAAU,KAAK,OAAO,GAAG,MAAM,MAAM,KAAK,EAAE;AAC1E;AAEA,SAAgB,IAAY,IAAmB,IAA+B;CAC5E,OAAO,GAAG,WAAW,GAAG,QAAQ,oCAAoC;CACpE,MAAM,SAAqB,CAAC;CAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,KAC7B,OAAO,KAAK,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC;CAE5B,OAAO;AACT;AAEA,SAAgB,KAAQ,KAAyB;CAC/C,OAAO,IAAI,GAAG,EAAE;AAClB;AAEA,SAAgB,QACd,KACA,OACa;CACb,MAAM,yBAAS,IAAI,IAAY;CAC/B,KAAK,MAAM,MAAM,KAAK;EACpB,MAAM,MAAM,MAAM,EAAE;EACpB,IAAI,QAAQ,OAAO,IAAI,GAAG;EAC1B,IAAI,UAAU,KAAA,GAAW;GACvB,QAAQ,CAAC;GACT,OAAO,IAAI,KAAK,KAAK;EACvB;EACA,MAAM,KAAK,EAAE;CACf;CACA,OAAO;AACT"}

package/out/shared/src/hash.d.ts CHANGED Viewed

@@ -1,4 +1,5 @@
 export declare const h32: (s: string) => number;
 export declare const h64: (s: string) => bigint;
 export declare const h128: (s: string) => bigint;
+export { avalanche32, PRIME32_1, PRIME32_5, round32 } from './xxhash32.ts';
 //# sourceMappingURL=hash.d.ts.map

package/out/shared/src/hash.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../../../shared/src/hash.ts"],"names":[],"mappings":"~~AAAA~~,eAAO,MAAM,GAAG,GAAI,GAAG,MAAM,WAG5B,CAAC;AACF,eAAO,MAAM,GAAG,GAAI,GAAG,MAAM,WAAe,CAAC;AAC7C,eAAO,MAAM,IAAI,GAAI,GAAG,MAAM,WAAe,CAAC"}
1	+ {"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../../../shared/src/hash.ts"],"names":[],"mappings":"AAUA,eAAO,MAAM,GAAG,GAAI,GAAG,MAAM,WAG5B,CAAC;AACF,eAAO,MAAM,GAAG,GAAI,GAAG,MAAM,WAAe,CAAC;AAC7C,eAAO,MAAM,IAAI,GAAI,GAAG,MAAM,WAAe,CAAC;AAkJ9C,OAAO,EAAC,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAC,MAAM,eAAe,CAAC"}

package/out/shared/src/hash.js CHANGED Viewed

@@ -1,3 +1,4 @@
+import { PRIME32_1, PRIME32_2, PRIME32_3, PRIME32_4, PRIME32_5, avalanche32, round32 } from "./xxhash32.js";
 //#region ../shared/src/hash.ts
 var h32 = (s) => {
 	digest(s, 1);
@@ -5,23 +6,11 @@ var h32 = (s) => {
 };
 var h64 = (s) => wide(s, 2);
 var h128 = (s) => wide(s, 4);
-var PRIME32_1 = 2654435761;
-var PRIME32_2 = 2246822519;
-var PRIME32_3 = 3266489917;
-var PRIME32_4 = 668265263;
-var PRIME32_5 = 374761393;
 var MAX_WORDS = 4;
 var accs = new Int32Array(MAX_WORDS);
 var stripes = new Int32Array(MAX_WORDS * 4);
 var digests = new Uint32Array(MAX_WORDS);
 var encoder;
-function round(acc, lane) {
-	const laneN0 = lane & 65535;
-	const laneN1 = lane >>> 16;
-	acc = acc + (laneN0 * PRIME32_2 + (laneN1 * PRIME32_2 << 16)) & 4294967295;
-	acc = acc << 13 | acc >>> 19;
-	return (acc & 65535) * PRIME32_1 + ((acc >>> 16) * PRIME32_1 << 16) & 4294967295;
-}
 /**
 * xxHash32 over the UTF-8 bytes of `str` under seeds `0..words-1`, leaving the
 * digests in `digests[0..words)`.
@@ -53,10 +42,10 @@ function digest(str, words) {
 			const l3 = b[offset + 12] | b[offset + 13] << 8 | b[offset + 14] << 16 | b[offset + 15] << 24;
 			for (let w = 0; w < words; w++) {
 				const base = w << 2;
-				stripes[base] = round(stripes[base], l0);
-				stripes[base + 1] = round(stripes[base + 1], l1);
-				stripes[base + 2] = round(stripes[base + 2], l2);
-				stripes[base + 3] = round(stripes[base + 3], l3);
+				stripes[base] = round32(stripes[base], l0);
+				stripes[base + 1] = round32(stripes[base + 1], l1);
+				stripes[base + 2] = round32(stripes[base + 2], l2);
+				stripes[base + 3] = round32(stripes[base + 3], l3);
 			}
 		}
 		for (let w = 0; w < words; w++) {
@@ -75,27 +64,20 @@ function digest(str, words) {
 		const laneN1 = b[offset + 2] + (b[offset + 3] << 8);
 		const laneP = laneN0 * PRIME32_3 + (laneN1 * PRIME32_3 << 16);
 		for (let w = 0; w < words; w++) {
-			let acc = accs[w] + laneP & 4294967295;
+			let acc = accs[w] + laneP | 0;
 			acc = acc << 17 | acc >>> 15;
-			accs[w] = (acc & 65535) * PRIME32_4 + ((acc >>> 16) * PRIME32_4 << 16) & 4294967295;
+			accs[w] = Math.imul(acc, PRIME32_4);
 		}
 	}
 	for (; offset < len; ++offset) {
 		const lane = b[offset];
 		for (let w = 0; w < words; w++) {
-			let acc = accs[w] + lane * PRIME32_5;
+			let acc = accs[w] + Math.imul(lane, PRIME32_5) | 0;
 			acc = acc << 11 | acc >>> 21;
-			accs[w] = (acc & 65535) * PRIME32_1 + ((acc >>> 16) * PRIME32_1 << 16) & 4294967295;
+			accs[w] = Math.imul(acc, PRIME32_1);
 		}
 	}
-	for (let w = 0; w < words; w++) {
-		let acc = accs[w];
-		acc = acc ^ acc >>> 15;
-		acc = ((acc & 65535) * PRIME32_2 & 4294967295) + ((acc >>> 16) * PRIME32_2 << 16);
-		acc = acc ^ acc >>> 13;
-		acc = ((acc & 65535) * PRIME32_3 & 4294967295) + ((acc >>> 16) * PRIME32_3 << 16);
-		digests[w] = acc ^ acc >>> 16;
-	}
+	for (let w = 0; w < words; w++) digests[w] = avalanche32(accs[w]);
 }
 /**
 * A hash wider than 32 bits, folding `words` digests together highest seed

package/out/shared/src/hash.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"hash.js","names":[],"sources":["../../../../shared/src/hash.ts"],"sourcesContent":["~~export~~ const h32 = (s: string) => {\n digest(s, 1);\n return digests[0];\n};\nexport const h64 = (s: string) => wide(s, 2);\nexport const h128 = (s: string) => wide(s, 4);\n\nconst ~~PRIME32_1 = 2654435761;\nconst PRIME32_2 = 2246822519;\nconst PRIME32_3 = 3266489917;\nconst PRIME32_4 = 668265263;\nconst PRIME32_5 = 374761393;\n\nconst~~ MAX_WORDS = 4;\n\n// `digest` is synchronous and does not recurse, so these can be reused across\n// calls instead of allocated per call.\nconst accs = new Int32Array(MAX_WORDS);\nconst stripes = new Int32Array(MAX_WORDS * 4);\nconst digests = new Uint32Array(MAX_WORDS);\nlet encoder: TextEncoder \| undefined;\n\~~nfunction round(acc: number, lane: number): number {\~~n const laneN0 = lane & 0xffff;\n const laneN1 = lane >>> 16;\n acc =\n (acc + (laneN0 * PRIME32_2 + ((laneN1 * PRIME32_2) << 16))) & 0xffffffff;\n acc = (acc << 13) \| (acc >>> 19);\n return (\n ((acc & 0xffff) * PRIME32_1 + (((acc >>> 16) * PRIME32_1) << 16)) &\n 0xffffffff\n );\n}\n\n/*\n xxHash32 over the UTF-8 bytes of `str` under seeds `0..words-1`, leaving the\n * digests in `digests[0..words)`.\n \n A seed only changes the initial accumulator values, so every word digests the\n * same input lanes. This walks the bytes once, advancing all `words` sets of\n * accumulators per lane, and UTF-8 encodes the string once. The result is\n * identical to `words` separate `xxHash32(str, i)` calls — which is what this\n * used to delegate to, and what `hash.test.ts` checks it still matches.\n /\nfunction digest(str: string, words: number): void {\n const b = (encoder ??= new TextEncoder()).encode(str);\n const len = b.length;\n\n for (let w = 0; w < words; w++) {\n accs[w] = (w + PRIME32_5) & 0xffffffff;\n }\n\n let offset = 0;\n\n /\n Step 2. Process stripes\n A stripe is a contiguous segment of 16 bytes, evenly divided into 4 lanes\n of 4 bytes each, each lane updating its own accumulator. Inputs shorter\n than a stripe skip straight to step 4 with a single accumulator.\n /\n if (len >= 16) {\n for (let w = 0; w < words; w++) {\n const base = w << 2;\n stripes[base] = (w + PRIME32_1 + PRIME32_2) & 0xffffffff;\n stripes[base + 1] = (w + PRIME32_2) & 0xffffffff;\n stripes[base + 2] = w;\n stripes[base + 3] = (w - PRIME32_1) & 0xffffffff;\n }\n\n const limit = len - 16;\n for (; offset <= limit; offset += 16) {\n const l0 =\n b[offset] \|\n (b[offset + 1] << 8) \|\n (b[offset + 2] << 16) \|\n (b[offset + 3] << 24);\n const l1 =\n b[offset + 4] \|\n (b[offset + 5] << 8) \|\n (b[offset + 6] << 16) \|\n (b[offset + 7] << 24);\n const l2 =\n b[offset + 8] \|\n (b[offset + 9] << 8) \|\n (b[offset + 10] << 16) \|\n (b[offset + 11] << 24);\n const l3 =\n b[offset + 12] \|\n (b[offset + 13] << 8) \|\n (b[offset + 14] << 16) \|\n (b[offset + 15] << 24);\n for (let w = 0; w < words; w++) {\n const base = w << 2;\n stripes[base] = ~~round~~(stripes[base], l0);\n stripes[base + 1] = ~~round~~(stripes[base + 1], l1);\n stripes[base + 2] = ~~round~~(stripes[base + 2], l2);\n stripes[base + 3] = ~~round~~(stripes[base + 3], l3);\n }\n }\n\n /\n Step 3. Accumulator convergence\n acc = (acc1 <<< 1) + (acc2 <<< 7) + (acc3 <<< 12) + (acc4 <<< 18);\n /\n for (let w = 0; w < words; w++) {\n const base = w << 2;\n const s0 = stripes[base];\n const s1 = stripes[base + 1];\n const s2 = stripes[base + 2];\n const s3 = stripes[base + 3];\n accs[w] =\n (((s0 << 1) \| (s0 >>> 31)) +\n ((s1 << 7) \| (s1 >>> 25)) +\n ((s2 << 12) \| (s2 >>> 20)) +\n ((s3 << 18) \| (s3 >>> 14))) &\n 0xffffffff;\n }\n }\n\n // Step 4. Add input length.\n for (let w = 0; w < words; w++) {\n accs[w] = (accs[w] + len) & 0xffffffff;\n }\n\n // Step 5. Consume the remaining input, 4 bytes at a time and then 1 at a time.\n const limit4 = len - 4;\n for (; offset <= limit4; offset += 4) {\n const laneN0 = b[offset] + (b[offset + 1] << 8);\n const laneN1 = b[offset + 2] + (b[offset + 3] << 8);\n const laneP = laneN0 PRIME32_3 + ((laneN1 * PRIME32_3) << 16);\n for (let w = 0; w < words; w++) {\n let acc = (accs[w] + laneP) & ~~0xffffffff~~;\n acc = (acc << 17) \| (acc >>> 15);\n accs[w] ~~=\n ((acc~~ ~~& 0xffff) * PRIME32_4 +~~ (((acc >>> 16) * PRIME32_4) ~~<< 16)) &\n 0xffffffff~~;\n }\n }\n\n for (; offset < len; ++offset) {\n const lane = b[offset];\n for (let w = 0; w < words; w++) {\n let acc = accs[w] + lane * ~~PRIME32_5~~;\n acc = (acc << 11) \| (acc >>> 21);\n accs[w] ~~=\n ((acc~~ ~~& 0xffff) * PRIME32_1 +~~ (((acc >>> 16) * PRIME32_1) ~~<< 16)) &\n 0xffffffff~~;\n }\n }\n\n // Step 6. Final mix (avalanche). The Uint32Array store turns any negatives\n // back into a positive number.\n for (let w = 0; w < words; w++) {\n ~~let acc = accs~~[w]~~;\n acc~~ = ~~acc ^~~ (acc >>> 15);\n acc =\n (((acc & 0xffff) * PRIME32_2) & 0xffffffff) +\n (((acc >>> 16) * PRIME32_2) << 16);\n acc = acc ^ (acc >>> 13);\n acc =\n (((acc & 0xffff) * PRIME32_3) & 0xffffffff) +\n (((acc >>> 16) * PRIME32_3) << 16);\n digests[w] ~~= acc ^ (acc >>> 16~~);\n }\n}\n\n/*\n A hash wider than 32 bits, folding `words` digests together highest seed\n * first.\n */\nfunction wide(str: string, words: number): bigint {\n digest(str, words);\n let result = 0n;\n for (let w = 0; w < words; w++) {\n result = (result << 32n) + BigInt(digests[w]);\n }\n return result;\n}\n"],"mappings":"~~;AAAA~~,IAAa,OAAO,MAAc;CAChC,OAAO,GAAG,CAAC;CACX,OAAO,QAAQ;AACjB;AACA,IAAa,OAAO,MAAc,KAAK,GAAG,CAAC;AAC3C,IAAa,QAAQ,MAAc,KAAK,GAAG,CAAC;AAE5C,IAAM,YAAY;~~AAClB,IAAM,YAAY;AAClB,IAAM,YAAY;AAClB,IAAM,YAAY;AAClB,IAAM,YAAY;AAElB,IAAM,YAAY;~~AAIlB,IAAM,OAAO,IAAI,WAAW,SAAS;AACrC,IAAM,UAAU,IAAI,WAAW,YAAY,CAAC;AAC5C,IAAM,UAAU,IAAI,YAAY,SAAS;AACzC,IAAI~~;AAEJ,SAAS,MAAM,KAAa,MAAsB;CAChD,MAAM,SAAS,OAAO;CACtB,MAAM,SAAS,SAAS;CACxB,MACG,OAAO,SAAS,aAAc,SAAS,aAAc,OAAQ;CAChE,MAAO,OAAO,KAAO,QAAQ;CAC7B,QACI,MAAM,SAAU,cAAe,QAAQ,MAAM,aAAc,MAC7D;AAEJ~~;;;;;;;;;;;~~AAYA~~,SAAS,OAAO,KAAa,OAAqB;CAChD,MAAM,KAAK,YAAY,IAAI,YAAY,GAAG,OAAO,GAAG;CACpD,MAAM,MAAM,EAAE;CAEd,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,KAAK,KAAM,IAAI,YAAa;CAG9B,IAAI,SAAS;CAQb,IAAI,OAAO,IAAI;EACb,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,OAAO,KAAK;GAClB,QAAQ,QAAS,IAAI,YAAY,YAAa;GAC9C,QAAQ,OAAO,KAAM,IAAI,YAAa;GACtC,QAAQ,OAAO,KAAK;GACpB,QAAQ,OAAO,KAAM,IAAI,YAAa;EACxC;EAEA,MAAM,QAAQ,MAAM;EACpB,OAAO,UAAU,OAAO,UAAU,IAAI;GACpC,MAAM,KACJ,EAAE,UACD,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,MAAM,KACjB,EAAE,SAAS,MAAM;GACpB,MAAM,KACJ,EAAE,SAAS,KACV,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,MAAM,KACjB,EAAE,SAAS,MAAM;GACpB,MAAM,KACJ,EAAE,SAAS,KACV,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,OAAO,KAClB,EAAE,SAAS,OAAO;GACrB,MAAM,KACJ,EAAE,SAAS,MACV,EAAE,SAAS,OAAO,IAClB,EAAE,SAAS,OAAO,KAClB,EAAE,SAAS,OAAO;GACrB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;IAC9B,MAAM,OAAO,KAAK;IAClB,QAAQ,QAAQ,~~MAAM~~,QAAQ,OAAO,EAAE;~~IACvC~~,QAAQ,OAAO,KAAK,~~MAAM~~,QAAQ,OAAO,IAAI,EAAE;~~IAC/C~~,QAAQ,OAAO,KAAK,~~MAAM~~,QAAQ,OAAO,IAAI,EAAE;~~IAC/C~~,QAAQ,OAAO,KAAK,~~MAAM~~,QAAQ,OAAO,IAAI,EAAE;~~GACjD~~;EACF;EAMA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,OAAO,KAAK;GAClB,MAAM,KAAK,QAAQ;GACnB,MAAM,KAAK,QAAQ,OAAO;GAC1B,MAAM,KAAK,QAAQ,OAAO;GAC1B,MAAM,KAAK,QAAQ,OAAO;GAC1B,KAAK,MACA,MAAM,IAAM,OAAO,OAClB,MAAM,IAAM,OAAO,OACnB,MAAM,KAAO,OAAO,OACpB,MAAM,KAAO,OAAO,MACxB;EACJ;CACF;CAGA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,KAAK,KAAM,KAAK,KAAK,MAAO;CAI9B,MAAM,SAAS,MAAM;CACrB,OAAO,UAAU,QAAQ,UAAU,GAAG;EACpC,MAAM,SAAS,EAAE,WAAW,EAAE,SAAS,MAAM;EAC7C,MAAM,SAAS,EAAE,SAAS,MAAM,EAAE,SAAS,MAAM;EACjD,MAAM,QAAQ,SAAS,aAAc,SAAS,aAAc;EAC5D,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,IAAI,MAAO,KAAK,KAAK,QAAS;GAC9B,MAAO,OAAO,KAAO,QAAQ;GAC7B,KAAK,~~MACD~~,~~MAAM~~,~~SAAU~~,~~cAAe~~,~~QAAQ,MAAM,aAAc,MAC7D~~;~~EACJ~~;CACF;CAEA,OAAO,SAAS,KAAK,EAAE,QAAQ;EAC7B,MAAM,OAAO,EAAE;EACf,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,IAAI,~~MAAM~~,KAAK,KAAK,~~OAAO~~;~~GAC3B~~,MAAO,OAAO,KAAO,QAAQ;GAC7B,KAAK,~~MACD~~,~~MAAM~~,~~SAAU~~,~~cAAe~~,~~QAAQ,MAAM,aAAc,MAC7D~~;~~EACJ~~;CACF;CAIA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,~~KAAK;EAC9B~~,~~IAAI~~,~~MAAM,~~KAAK~~;EACf~~,~~MAAM~~,~~MAAO,QAAQ;EACrB,QACK,MAAM,SAAU,YAAa,gBAC7B,QAAQ,MAAM,aAAc;EACjC,MAAM,MAAO,QAAQ;EACrB,QACK,MAAM,SAAU,YAAa,gBAC7B,QAAQ,MAAM,aAAc;EACjC,QAAQ,~~KAAK,~~MAAO,QAAQ~~;~~CAC9B;AACF~~;;;;;AAMA,SAAS,KAAK,KAAa,OAAuB;CAChD,OAAO,KAAK,KAAK;CACjB,IAAI,SAAS;CACb,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,UAAU,UAAU,OAAO,OAAO,QAAQ,EAAE;CAE9C,OAAO;AACT"}
1	+ {"version":3,"file":"hash.js","names":[],"sources":["../../../../shared/src/hash.ts"],"sourcesContent":["import {\n avalanche32,\n PRIME32_1,\n PRIME32_2,\n PRIME32_3,\n PRIME32_4,\n PRIME32_5,\n round32,\n} from './xxhash32.ts';\n\nexport const h32 = (s: string) => {\n digest(s, 1);\n return digests[0];\n};\nexport const h64 = (s: string) => wide(s, 2);\nexport const h128 = (s: string) => wide(s, 4);\n\nconst MAX_WORDS = 4;\n\n// `digest` is synchronous and does not recurse, so these can be reused across\n// calls instead of allocated per call.\nconst accs = new Int32Array(MAX_WORDS);\nconst stripes = new Int32Array(MAX_WORDS * 4);\nconst digests = new Uint32Array(MAX_WORDS);\nlet encoder: TextEncoder \| undefined;\n\n/*\n xxHash32 over the UTF-8 bytes of `str` under seeds `0..words-1`, leaving the\n * digests in `digests[0..words)`.\n \n A seed only changes the initial accumulator values, so every word digests the\n * same input lanes. This walks the bytes once, advancing all `words` sets of\n * accumulators per lane, and UTF-8 encodes the string once. The result is\n * identical to `words` separate `xxHash32(str, i)` calls — which is what this\n * used to delegate to, and what `hash.test.ts` checks it still matches.\n /\nfunction digest(str: string, words: number): void {\n const b = (encoder ??= new TextEncoder()).encode(str);\n const len = b.length;\n\n for (let w = 0; w < words; w++) {\n accs[w] = (w + PRIME32_5) & 0xffffffff;\n }\n\n let offset = 0;\n\n /\n Step 2. Process stripes\n A stripe is a contiguous segment of 16 bytes, evenly divided into 4 lanes\n of 4 bytes each, each lane updating its own accumulator. Inputs shorter\n than a stripe skip straight to step 4 with a single accumulator.\n /\n if (len >= 16) {\n for (let w = 0; w < words; w++) {\n const base = w << 2;\n stripes[base] = (w + PRIME32_1 + PRIME32_2) & 0xffffffff;\n stripes[base + 1] = (w + PRIME32_2) & 0xffffffff;\n stripes[base + 2] = w;\n stripes[base + 3] = (w - PRIME32_1) & 0xffffffff;\n }\n\n const limit = len - 16;\n for (; offset <= limit; offset += 16) {\n const l0 =\n b[offset] \|\n (b[offset + 1] << 8) \|\n (b[offset + 2] << 16) \|\n (b[offset + 3] << 24);\n const l1 =\n b[offset + 4] \|\n (b[offset + 5] << 8) \|\n (b[offset + 6] << 16) \|\n (b[offset + 7] << 24);\n const l2 =\n b[offset + 8] \|\n (b[offset + 9] << 8) \|\n (b[offset + 10] << 16) \|\n (b[offset + 11] << 24);\n const l3 =\n b[offset + 12] \|\n (b[offset + 13] << 8) \|\n (b[offset + 14] << 16) \|\n (b[offset + 15] << 24);\n for (let w = 0; w < words; w++) {\n const base = w << 2;\n stripes[base] = round32(stripes[base], l0);\n stripes[base + 1] = round32(stripes[base + 1], l1);\n stripes[base + 2] = round32(stripes[base + 2], l2);\n stripes[base + 3] = round32(stripes[base + 3], l3);\n }\n }\n\n /\n Step 3. Accumulator convergence\n acc = (acc1 <<< 1) + (acc2 <<< 7) + (acc3 <<< 12) + (acc4 <<< 18);\n /\n for (let w = 0; w < words; w++) {\n const base = w << 2;\n const s0 = stripes[base];\n const s1 = stripes[base + 1];\n const s2 = stripes[base + 2];\n const s3 = stripes[base + 3];\n accs[w] =\n (((s0 << 1) \| (s0 >>> 31)) +\n ((s1 << 7) \| (s1 >>> 25)) +\n ((s2 << 12) \| (s2 >>> 20)) +\n ((s3 << 18) \| (s3 >>> 14))) &\n 0xffffffff;\n }\n }\n\n // Step 4. Add input length.\n for (let w = 0; w < words; w++) {\n accs[w] = (accs[w] + len) & 0xffffffff;\n }\n\n // Step 5. Consume the remaining input, 4 bytes at a time and then 1 at a time.\n const limit4 = len - 4;\n for (; offset <= limit4; offset += 4) {\n const laneN0 = b[offset] + (b[offset + 1] << 8);\n const laneN1 = b[offset + 2] + (b[offset + 3] << 8);\n const laneP = laneN0 PRIME32_3 + ((laneN1 * PRIME32_3) << 16);\n for (let w = 0; w < words; w++) {\n let acc = (accs[w] + laneP) \| 0;\n acc = (acc << 17) \| (acc >>> 15);\n accs[w] = Math.imul(acc, PRIME32_4);\n }\n }\n\n for (; offset < len; ++offset) {\n const lane = b[offset];\n for (let w = 0; w < words; w++) {\n let acc = (accs[w] + Math.imul(lane, PRIME32_5)) \| 0;\n acc = (acc << 11) \| (acc >>> 21);\n accs[w] = Math.imul(acc, PRIME32_1);\n }\n }\n\n // Step 6. Final mix (avalanche). The Uint32Array store turns any negatives\n // back into a positive number.\n for (let w = 0; w < words; w++) {\n digests[w] = avalanche32(accs[w]);\n }\n}\n\n/*\n A hash wider than 32 bits, folding `words` digests together highest seed\n * first.\n */\nfunction wide(str: string, words: number): bigint {\n digest(str, words);\n let result = 0n;\n for (let w = 0; w < words; w++) {\n result = (result << 32n) + BigInt(digests[w]);\n }\n return result;\n}\n\n// Re-exported for zero-protocol's AST hash, which cannot import xxhash32.ts\n// directly without tripping a tsc 7.0.2 bug (see the import comment in\n// zero-protocol/src/query-hash-visitor.ts).\nexport {avalanche32, PRIME32_1, PRIME32_5, round32} from './xxhash32.ts';\n"],"mappings":";;AAUA,IAAa,OAAO,MAAc;CAChC,OAAO,GAAG,CAAC;CACX,OAAO,QAAQ;AACjB;AACA,IAAa,OAAO,MAAc,KAAK,GAAG,CAAC;AAC3C,IAAa,QAAQ,MAAc,KAAK,GAAG,CAAC;AAE5C,IAAM,YAAY;AAIlB,IAAM,OAAO,IAAI,WAAW,SAAS;AACrC,IAAM,UAAU,IAAI,WAAW,YAAY,CAAC;AAC5C,IAAM,UAAU,IAAI,YAAY,SAAS;AACzC,IAAI;;;;;;;;;;;AAYJ,SAAS,OAAO,KAAa,OAAqB;CAChD,MAAM,KAAK,YAAY,IAAI,YAAY,GAAG,OAAO,GAAG;CACpD,MAAM,MAAM,EAAE;CAEd,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,KAAK,KAAM,IAAI,YAAa;CAG9B,IAAI,SAAS;CAQb,IAAI,OAAO,IAAI;EACb,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,OAAO,KAAK;GAClB,QAAQ,QAAS,IAAI,YAAY,YAAa;GAC9C,QAAQ,OAAO,KAAM,IAAI,YAAa;GACtC,QAAQ,OAAO,KAAK;GACpB,QAAQ,OAAO,KAAM,IAAI,YAAa;EACxC;EAEA,MAAM,QAAQ,MAAM;EACpB,OAAO,UAAU,OAAO,UAAU,IAAI;GACpC,MAAM,KACJ,EAAE,UACD,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,MAAM,KACjB,EAAE,SAAS,MAAM;GACpB,MAAM,KACJ,EAAE,SAAS,KACV,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,MAAM,KACjB,EAAE,SAAS,MAAM;GACpB,MAAM,KACJ,EAAE,SAAS,KACV,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,OAAO,KAClB,EAAE,SAAS,OAAO;GACrB,MAAM,KACJ,EAAE,SAAS,MACV,EAAE,SAAS,OAAO,IAClB,EAAE,SAAS,OAAO,KAClB,EAAE,SAAS,OAAO;GACrB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;IAC9B,MAAM,OAAO,KAAK;IAClB,QAAQ,QAAQ,QAAQ,QAAQ,OAAO,EAAE;IACzC,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,IAAI,EAAE;IACjD,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,IAAI,EAAE;IACjD,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,IAAI,EAAE;GACnD;EACF;EAMA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,OAAO,KAAK;GAClB,MAAM,KAAK,QAAQ;GACnB,MAAM,KAAK,QAAQ,OAAO;GAC1B,MAAM,KAAK,QAAQ,OAAO;GAC1B,MAAM,KAAK,QAAQ,OAAO;GAC1B,KAAK,MACA,MAAM,IAAM,OAAO,OAClB,MAAM,IAAM,OAAO,OACnB,MAAM,KAAO,OAAO,OACpB,MAAM,KAAO,OAAO,MACxB;EACJ;CACF;CAGA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,KAAK,KAAM,KAAK,KAAK,MAAO;CAI9B,MAAM,SAAS,MAAM;CACrB,OAAO,UAAU,QAAQ,UAAU,GAAG;EACpC,MAAM,SAAS,EAAE,WAAW,EAAE,SAAS,MAAM;EAC7C,MAAM,SAAS,EAAE,SAAS,MAAM,EAAE,SAAS,MAAM;EACjD,MAAM,QAAQ,SAAS,aAAc,SAAS,aAAc;EAC5D,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,IAAI,MAAO,KAAK,KAAK,QAAS;GAC9B,MAAO,OAAO,KAAO,QAAQ;GAC7B,KAAK,KAAK,KAAK,KAAK,KAAK,SAAS;EACpC;CACF;CAEA,OAAO,SAAS,KAAK,EAAE,QAAQ;EAC7B,MAAM,OAAO,EAAE;EACf,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,IAAI,MAAO,KAAK,KAAK,KAAK,KAAK,MAAM,SAAS,IAAK;GACnD,MAAO,OAAO,KAAO,QAAQ;GAC7B,KAAK,KAAK,KAAK,KAAK,KAAK,SAAS;EACpC;CACF;CAIA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,QAAQ,KAAK,YAAY,KAAK,EAAE;AAEpC;;;;;AAMA,SAAS,KAAK,KAAa,OAAuB;CAChD,OAAO,KAAK,KAAK;CACjB,IAAI,SAAS;CACb,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,UAAU,UAAU,OAAO,OAAO,QAAQ,EAAE;CAE9C,OAAO;AACT"}

package/out/shared/src/iterables.d.ts CHANGED Viewed

@@ -16,5 +16,7 @@ export declare function wrapIterable<T>(iter: Iterable<T>): IteratorWithHelpers<
  */
 export declare function toSorted<T>(iter: Iterable<T>, compare?: (a: T, b: T) => number): T[];
 export declare function some<T>(iterable: Iterable<T>, predicate: (item: T, index: number) => boolean): boolean;
+export declare const emptyIterator: IterableIterator<any, undefined, any>;
+export declare function makeEmptyIteratorWithReturn<T>(value: T): IterableIterator<any, T, any>;
 export {};
 //# sourceMappingURL=iterables.d.ts.map

package/out/shared/src/iterables.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"iterables.d.ts","sourceRoot":"","sources":["../../../../shared/src/iterables.ts"],"names":[],"mappings":"AAAA,wBAAiB,aAAa,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,2BAIxD;AAwBD,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAK3D;AAED,wBAAiB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAOzD;AAKD,KAAK,mBAAmB,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG;IAC1C,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAC9D,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;IACpE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAAG,OAAO,CAAC;IACnD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,mBAAmB,CAAC,CAAC,CAAC,CAAC;CAC7C,CAAC;AA6CF,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAEzE;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EACxB,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EACjB,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,GAC/B,CAAC,EAAE,CAGL;AAED,wBAAgB,IAAI,CAAC,CAAC,EACpB,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EACrB,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAC7C,OAAO,CAQT"}
1	+ {"version":3,"file":"iterables.d.ts","sourceRoot":"","sources":["../../../../shared/src/iterables.ts"],"names":[],"mappings":"AAAA,wBAAiB,aAAa,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,2BAIxD;AAwBD,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAK3D;AAED,wBAAiB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAOzD;AAKD,KAAK,mBAAmB,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG;IAC1C,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAC9D,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;IACpE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAAG,OAAO,CAAC;IACnD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,mBAAmB,CAAC,CAAC,CAAC,CAAC;CAC7C,CAAC;AA6CF,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAEzE;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EACxB,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EACjB,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,GAC/B,CAAC,EAAE,CAGL;AAED,wBAAgB,IAAI,CAAC,CAAC,EACpB,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EACrB,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAC7C,OAAO,CAQT;AAuBD,eAAO,MAAM,aAAa,EAAE,gBAAgB,CAAC,GAAG,EAAE,SAAS,EAAE,GAAG,CACxB,CAAC;AAEzC,wBAAgB,2BAA2B,CAAC,CAAC,EAC3C,KAAK,EAAE,CAAC,GAEP,gBAAgB,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAE/B"}

package/out/shared/src/iterables.js CHANGED Viewed

@@ -55,7 +55,24 @@ function some(iterable, predicate) {
 	for (const item of iterable) if (predicate(item, index++)) return true;
 	return false;
 }
+var EmptyIteratorWithReturn = class {
+	value;
+	done = true;
+	constructor(value) {
+		this.value = value;
+	}
+	[Symbol.iterator]() {
+		return this;
+	}
+	next() {
+		return this;
+	}
+};
+var emptyIterator = new EmptyIteratorWithReturn(void 0);
+function makeEmptyIteratorWithReturn(value) {
+	return new EmptyIteratorWithReturn(value);
+}
 //#endregion
-export { joinIterables, once, some, toSorted, wrapIterable };
+export { emptyIterator, joinIterables, makeEmptyIteratorWithReturn, once, some, toSorted, wrapIterable };
 //# sourceMappingURL=iterables.js.map