@firebase/firestore 4.7.7 → 4.7.8

package/dist/lite/firestore/src/util/misc.d.ts

@@ -31,8 +31,6 @@ export declare function primitiveComparator<T>(left: T, right: T): number;
 export interface Equatable<T> {
     isEqual(other: T): boolean;
 }
-/** Compare strings in UTF-8 encoded byte order */
-export declare function compareUtf8Strings(left: string, right: string): number;
 export interface Iterable<V> {
     forEach: (cb: (v: V) => void) => void;
 }

package/dist/lite/index.browser.esm2017.js

@@ -4,7 +4,7 @@ import { Logger, LogLevel } from '@firebase/logger';
 import { FirebaseError, getDefaultEmulatorHostnameAndPort, createMockUserToken, getModularInstance, deepEqual } from '@firebase/util';
 import { Integer } from '@firebase/webchannel-wrapper/bloom-blob';
 
-const E = "4.7.7";
+const E = "4.7.8";
 
 /**
  * @license
@@ -65,7 +65,7 @@ User.MOCK_USER = new User("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let m = "11.3.0";
+let m = "11.3.1";
 
 /**
  * @license
@@ -83,7 +83,7 @@ let m = "11.3.0";
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const T = new Logger("@firebase/firestore");
+const A = new Logger("@firebase/firestore");
 
 /**
  * Sets the verbosity of Cloud Firestore logs (debug, error, or silent).
@@ -98,29 +98,29 @@ const T = new Logger("@firebase/firestore");
  *     <li><code>`silent` to turn off logging.</li>
  *   </ul>
  */ function setLogLevel(t) {
-    T.setLogLevel(t);
+    A.setLogLevel(t);
 }
 
 function __PRIVATE_logDebug(t, ...e) {
-    if (T.logLevel <= LogLevel.DEBUG) {
+    if (A.logLevel <= LogLevel.DEBUG) {
         const r = e.map(__PRIVATE_argToString);
-        T.debug(`Firestore (${m}): ${t}`, ...r);
+        A.debug(`Firestore (${m}): ${t}`, ...r);
     }
 }
 
 function __PRIVATE_logError(t, ...e) {
-    if (T.logLevel <= LogLevel.ERROR) {
+    if (A.logLevel <= LogLevel.ERROR) {
         const r = e.map(__PRIVATE_argToString);
-        T.error(`Firestore (${m}): ${t}`, ...r);
+        A.error(`Firestore (${m}): ${t}`, ...r);
     }
 }
 
 /**
  * @internal
  */ function __PRIVATE_logWarn(t, ...e) {
-    if (T.logLevel <= LogLevel.WARN) {
+    if (A.logLevel <= LogLevel.WARN) {
         const r = e.map(__PRIVATE_argToString);
-        T.warn(`Firestore (${m}): ${t}`, ...r);
+        A.warn(`Firestore (${m}): ${t}`, ...r);
     }
 }
 
@@ -221,7 +221,7 @@ e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const A = "ok", P = "cancelled", R = "unknown", I = "invalid-argument", V = "deadline-exceeded", p = "not-found", y = "already-exists", w = "permission-denied", g = "unauthenticated", F = "resource-exhausted", v = "failed-precondition", D = "aborted", b = "out-of-range", C = "unimplemented", S = "internal", N = "unavailable", O = "data-loss";
+ */ const T = "ok", P = "cancelled", R = "unknown", I = "invalid-argument", V = "deadline-exceeded", p = "not-found", y = "already-exists", w = "permission-denied", g = "unauthenticated", F = "resource-exhausted", v = "failed-precondition", D = "aborted", b = "out-of-range", C = "unimplemented", S = "internal", N = "unavailable", O = "data-loss";
 
 /** An error returned by a Firestore operation. */ class FirestoreError extends FirebaseError {
     /** @hideconstructor */
@@ -476,60 +476,6 @@ class DatabaseInfo {
     }
 }
 
-/**
- * @license
- * Copyright 2020 Google LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *   http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-/**
- * Generates `nBytes` of random bytes.
- *
- * If `nBytes < 0` , an error will be thrown.
- */
-function __PRIVATE_randomBytes(t) {
-    // Polyfills for IE and WebWorker by using `self` and `msCrypto` when `crypto` is not available.
-    const e = 
-    // eslint-disable-next-line @typescript-eslint/no-explicit-any
-    "undefined" != typeof self && (self.crypto || self.msCrypto), r = new Uint8Array(t);
-    if (e && "function" == typeof e.getRandomValues) e.getRandomValues(r); else 
-    // Falls back to Math.random
-    for (let e = 0; e < t; e++) r[e] = Math.floor(256 * Math.random());
-    return r;
-}
-
-/**
- * @license
- * Copyright 2023 Google LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *   http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-/**
- * An instance of the Platform's 'TextEncoder' implementation.
- */ function __PRIVATE_newTextEncoder() {
-    return new TextEncoder;
-}
-
 /**
  * @license
  * Copyright 2017 Google LLC
@@ -546,62 +492,7 @@ function __PRIVATE_randomBytes(t) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/**
- * A utility class for generating unique alphanumeric IDs of a specified length.
- *
- * @internal
- * Exported internally for testing purposes.
- */ class __PRIVATE_AutoId {
-    static newId() {
-        // Alphanumeric characters
-        const t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", e = 62 * Math.floor(256 / 62);
-        // The largest byte value that is a multiple of `char.length`.
-                let r = "";
-        for (;r.length < 20; ) {
-            const n = __PRIVATE_randomBytes(40);
-            for (let i = 0; i < n.length; ++i) 
-            // Only accept values that are [0, maxMultiple), this ensures they can
-            // be evenly mapped to indices of `chars` via a modulo operation.
-            r.length < 20 && n[i] < e && (r += t.charAt(n[i] % 62));
-        }
-        return r;
-    }
-}
-
-function __PRIVATE_primitiveComparator(t, e) {
-    return t < e ? -1 : t > e ? 1 : 0;
-}
-
-/** Compare strings in UTF-8 encoded byte order */ function __PRIVATE_compareUtf8Strings(t, e) {
-    // Convert the string to UTF-8 encoded bytes
-    const r = __PRIVATE_newTextEncoder().encode(t), n = __PRIVATE_newTextEncoder().encode(e);
-    for (let t = 0; t < Math.min(r.length, n.length); t++) {
-        const e = __PRIVATE_primitiveComparator(r[t], n[t]);
-        if (0 !== e) return e;
-    }
-    return __PRIVATE_primitiveComparator(r.length, n.length);
-}
-
-/** Helper to compare arrays using isEqual(). */ function __PRIVATE_arrayEquals(t, e, r) {
-    return t.length === e.length && t.every(((t, n) => r(t, e[n])));
-}
-
-/**
- * @license
- * Copyright 2017 Google LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *   http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */ const B = "__name__";
+const B = "__name__";
 
 /**
  * Path represents an ordered sequence of string segments.
@@ -669,11 +560,13 @@ function __PRIVATE_primitiveComparator(t, e) {
             const r = BasePath.compareSegments(t.get(n), e.get(n));
             if (0 !== r) return r;
         }
-        return __PRIVATE_primitiveComparator(t.length, e.length);
+        return Math.sign(t.length - e.length);
     }
     static compareSegments(t, e) {
         const r = BasePath.isNumericId(t), n = BasePath.isNumericId(e);
-        return r && !n ? -1 : !r && n ? 1 : r && n ? BasePath.extractNumericId(t).compare(BasePath.extractNumericId(e)) : __PRIVATE_compareUtf8Strings(t, e);
+        return r && !n ? -1 : !r && n ? 1 : r && n ? BasePath.extractNumericId(t).compare(BasePath.extractNumericId(e)) : 
+        // both non-numeric
+        t < e ? -1 : t > e ? 1 : 0;
     }
     // Checks if a segment is a numeric ID (starts with "__id" and ends with "__").
     static isNumericId(t) {
@@ -1079,7 +972,7 @@ function __PRIVATE_generateUniqueDebugId() {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const L = "RestConnection", x = {
+const L = "RestConnection", M = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery",
@@ -1096,7 +989,7 @@ const L = "RestConnection", x = {
  * HTTP).
  */
 class __PRIVATE_RestConnection {
-    get T() {
+    get A() {
         // Both `invokeRPC()` and `invokeStreamingRPC()` use their `path` arguments to determine
         // where to run the query, and expect the `request` to NOT specify the "path".
         return !1;
@@ -1104,7 +997,7 @@ class __PRIVATE_RestConnection {
     constructor(t) {
         this.databaseInfo = t, this.databaseId = t.databaseId;
         const e = t.ssl ? "https" : "http", r = encodeURIComponent(this.databaseId.projectId), n = encodeURIComponent(this.databaseId.database);
-        this.A = e + "://" + t.host, this.P = `projects/${r}/databases/${n}`, this.R = this.databaseId.database === q ? `project_id=${r}` : `project_id=${r}&database_id=${n}`;
+        this.T = e + "://" + t.host, this.P = `projects/${r}/databases/${n}`, this.R = this.databaseId.database === q ? `project_id=${r}` : `project_id=${r}&database_id=${n}`;
     }
     I(t, e, r, n, i) {
         const s = __PRIVATE_generateUniqueDebugId(), o = this.V(t, e.toUriEncodedString());
@@ -1142,8 +1035,8 @@ class __PRIVATE_RestConnection {
         e && e.headers.forEach(((e, r) => t[r] = e)), r && r.headers.forEach(((e, r) => t[r] = e));
     }
     V(t, e) {
-        const r = x[t];
-        return `${this.A}/v1/${e}:${r}`;
+        const r = M[t];
+        return `${this.T}/v1/${e}:${r}`;
     }
     /**
      * Closes and cleans up any resources associated with the connection. This
@@ -1179,7 +1072,7 @@ class __PRIVATE_RestConnection {
  * Important! The names of these identifiers matter because the string forms
  * are used for reverse lookups from the webchannel stream. Do NOT change the
  * names of these identifiers or change this into a const enum.
- */ var M, U;
+ */ var x, k;
 
 /**
  * Converts an HTTP Status Code to the equivalent error code.
@@ -1200,7 +1093,7 @@ function __PRIVATE_mapCodeFromHttpStatus(t) {
         switch (t) {
       case 200:
         // OK
-        return A;
+        return T;
 
       case 400:
         // Bad Request
@@ -1259,7 +1152,7 @@ function __PRIVATE_mapCodeFromHttpStatus(t) {
         return V;
 
       default:
-        return t >= 200 && t < 300 ? A : t >= 400 && t < 500 ? v : t >= 500 && t < 600 ? S : R;
+        return t >= 200 && t < 300 ? T : t >= 400 && t < 500 ? v : t >= 500 && t < 600 ? S : R;
     }
 }
 
@@ -1282,13 +1175,13 @@ function __PRIVATE_mapCodeFromHttpStatus(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (U = M || (M = {}))[U.OK = 0] = "OK", U[U.CANCELLED = 1] = "CANCELLED", U[U.UNKNOWN = 2] = "UNKNOWN", 
-U[U.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", U[U.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", 
-U[U.NOT_FOUND = 5] = "NOT_FOUND", U[U.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", U[U.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
-U[U.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", U[U.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
-U[U.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", U[U.ABORTED = 10] = "ABORTED", 
-U[U.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", U[U.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
-U[U.INTERNAL = 13] = "INTERNAL", U[U.UNAVAILABLE = 14] = "UNAVAILABLE", U[U.DATA_LOSS = 15] = "DATA_LOSS";
+ */ (k = x || (x = {}))[k.OK = 0] = "OK", k[k.CANCELLED = 1] = "CANCELLED", k[k.UNKNOWN = 2] = "UNKNOWN", 
+k[k.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", k[k.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", 
+k[k.NOT_FOUND = 5] = "NOT_FOUND", k[k.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", k[k.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
+k[k.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", k[k.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
+k[k.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", k[k.ABORTED = 10] = "ABORTED", 
+k[k.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", k[k.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
+k[k.INTERNAL = 13] = "INTERNAL", k[k.UNAVAILABLE = 14] = "UNAVAILABLE", k[k.DATA_LOSS = 15] = "DATA_LOSS";
 
 class __PRIVATE_FetchConnection extends __PRIVATE_RestConnection {
     D(t, e) {
@@ -1360,6 +1253,83 @@ class __PRIVATE_AggregateImpl {
     }
 }
 
+/**
+ * @license
+ * Copyright 2020 Google LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/**
+ * Generates `nBytes` of random bytes.
+ *
+ * If `nBytes < 0` , an error will be thrown.
+ */ function __PRIVATE_randomBytes(t) {
+    // Polyfills for IE and WebWorker by using `self` and `msCrypto` when `crypto` is not available.
+    const e = 
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    "undefined" != typeof self && (self.crypto || self.msCrypto), r = new Uint8Array(t);
+    if (e && "function" == typeof e.getRandomValues) e.getRandomValues(r); else 
+    // Falls back to Math.random
+    for (let e = 0; e < t; e++) r[e] = Math.floor(256 * Math.random());
+    return r;
+}
+
+/**
+ * @license
+ * Copyright 2017 Google LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/**
+ * A utility class for generating unique alphanumeric IDs of a specified length.
+ *
+ * @internal
+ * Exported internally for testing purposes.
+ */ class __PRIVATE_AutoId {
+    static newId() {
+        // Alphanumeric characters
+        const t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", e = 62 * Math.floor(256 / 62);
+        // The largest byte value that is a multiple of `char.length`.
+                let r = "";
+        for (;r.length < 20; ) {
+            const n = __PRIVATE_randomBytes(40);
+            for (let i = 0; i < n.length; ++i) 
+            // Only accept values that are [0, maxMultiple), this ensures they can
+            // be evenly mapped to indices of `chars` via a modulo operation.
+            r.length < 20 && n[i] < e && (r += t.charAt(n[i] % 62));
+        }
+        return r;
+    }
+}
+
+function __PRIVATE_primitiveComparator(t, e) {
+    return t < e ? -1 : t > e ? 1 : 0;
+}
+
+/** Helper to compare arrays using isEqual(). */ function __PRIVATE_arrayEquals(t, e, r) {
+    return t.length === e.length && t.every(((t, n) => r(t, e[n])));
+}
+
 /**
  * @license
  * Copyright 2017 Google LLC
@@ -1542,7 +1512,7 @@ class ByteString {
 
 ByteString.EMPTY_BYTE_STRING = new ByteString("");
 
-const k = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+const U = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
 /**
  * Converts the possible Proto values for a timestamp value into a "seconds and
@@ -1556,7 +1526,7 @@ const k = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         // (millis), so we do some custom parsing here.
         // Parse the nanos right out of the string.
         let e = 0;
-        const r = k.exec(t);
+        const r = U.exec(t);
         if (__PRIVATE_hardAssert(!!r), r[1]) {
             // Pad the fraction out to 9 digits (nanos).
             let t = r[1];
@@ -1955,7 +1925,7 @@ function __PRIVATE_valueCompare(t, e) {
         return __PRIVATE_compareTimestamps(__PRIVATE_getLocalWriteTime(t), __PRIVATE_getLocalWriteTime(e));
 
       case 5 /* TypeOrder.StringValue */ :
-        return __PRIVATE_compareUtf8Strings(t.stringValue, e.stringValue);
+        return __PRIVATE_primitiveComparator(t.stringValue, e.stringValue);
 
       case 6 /* TypeOrder.BlobValue */ :
         return function __PRIVATE_compareBlobs(t, e) {
@@ -2003,7 +1973,7 @@ function __PRIVATE_valueCompare(t, e) {
             // canonical IDs are independent of insertion order.
             n.sort(), s.sort();
             for (let t = 0; t < n.length && t < s.length; ++t) {
-                const e = __PRIVATE_compareUtf8Strings(n[t], s[t]);
+                const e = __PRIVATE_primitiveComparator(n[t], s[t]);
                 if (0 !== e) return e;
                 const o = __PRIVATE_valueCompare(r[n[t]], i[s[t]]);
                 if (0 !== o) return o;
@@ -3951,7 +3921,7 @@ class __PRIVATE_ExponentialBackoff {
      * Note that jitter will still be applied, so the actual delay could be as
      * much as 1.5*maxDelayMs.
      */ , i = 6e4) {
-        this.L = t, this.timerId = e, this.M = r, this.U = n, this.k = i, this.j = 0, this.W = null, 
+        this.L = t, this.timerId = e, this.M = r, this.k = n, this.U = i, this.j = 0, this.W = null, 
         /** The last backoff attempt, as epoch milliseconds. */
         this.K = Date.now(), this.reset();
     }
@@ -3968,7 +3938,7 @@ class __PRIVATE_ExponentialBackoff {
      * Resets the backoff delay to the maximum delay (e.g. for use after a
      * RESOURCE_EXHAUSTED error).
      */    G() {
-        this.j = this.k;
+        this.j = this.U;
     }
     /**
      * Returns a promise that resolves after currentDelayMs, and increases the
@@ -3986,7 +3956,7 @@ class __PRIVATE_ExponentialBackoff {
         t()))), 
         // Apply backoff factor to determine next delay and ensure it is within
         // bounds.
-        this.j *= this.U, this.j < this.M && (this.j = this.M), this.j > this.k && (this.j = this.k);
+        this.j *= this.k, this.j < this.M && (this.j = this.M), this.j > this.U && (this.j = this.U);
     }
     Y() {
         null !== this.W && (this.W.skipDelay(), this.W = null);
@@ -4128,7 +4098,7 @@ async function __PRIVATE_invokeRunAggregationQueryRpc(t, e, r) {
         // Do not include implicit order-bys for aggregate queries.
         e.q = __PRIVATE__queryToTarget(e, t.explicitOrderBy)), e.q;
     }(e), r);
-    i.connection.T || delete s.parent;
+    i.connection.A || delete s.parent;
     const u = (await i.v("RunAggregationQuery", i.serializer.databaseId, a, s, 
     /*expectedResponseCount=*/ 1)).filter((t => !!t.result));
     // Omit RunAggregationQueryResponse that only contain readTimes.
@@ -6910,13 +6880,13 @@ function __PRIVATE_validateReference(t, e) {
 class __PRIVATE_TransactionRunner {
     constructor(t, e, r, n, i) {
         this.asyncQueue = t, this.datastore = e, this.options = r, this.updateFunction = n, 
-        this.deferred = i, this.Tt = r.maxAttempts, this.At = new __PRIVATE_ExponentialBackoff(this.asyncQueue, "transaction_retry" /* TimerId.TransactionRetry */);
+        this.deferred = i, this.At = r.maxAttempts, this.Tt = new __PRIVATE_ExponentialBackoff(this.asyncQueue, "transaction_retry" /* TimerId.TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    Pt() {
-        this.Tt -= 1, this.Rt();
+        this.At -= 1, this.Rt();
     }
     Rt() {
-        this.At.H((async () => {
+        this.Tt.H((async () => {
             const t = new Transaction$1(this.datastore), e = this.It(t);
             e && e.then((e => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
@@ -6940,7 +6910,7 @@ class __PRIVATE_TransactionRunner {
         }
     }
     Vt(t) {
-        this.Tt > 0 && this.yt(t) ? (this.Tt -= 1, this.asyncQueue.enqueueAndForget((() => (this.Rt(), 
+        this.At > 0 && this.yt(t) ? (this.At -= 1, this.asyncQueue.enqueueAndForget((() => (this.Rt(), 
         Promise.resolve())))) : this.deferred.reject(t);
     }
     yt(t) {
@@ -6957,7 +6927,7 @@ class __PRIVATE_TransactionRunner {
  */
             function __PRIVATE_isPermanentError(t) {
                 switch (t) {
-                  case A:
+                  case T:
                     return fail();
 
                   case P:
@@ -7140,14 +7110,14 @@ class __PRIVATE_AsyncQueueImpl {
         // List of TimerIds to fast-forward delays for.
         this.Ct = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.At = new __PRIVATE_ExponentialBackoff(this, "async_queue_retry" /* TimerId.AsyncQueueRetry */), 
+        this.Tt = new __PRIVATE_ExponentialBackoff(this, "async_queue_retry" /* TimerId.AsyncQueueRetry */), 
         // Visibility handler that triggers an immediate retry of all retryable
         // operations. Meant to speed up recovery when we regain file system access
         // after page comes into foreground.
         this.St = () => {
             const t = getDocument();
             t && __PRIVATE_logDebug(ut, "Visibility state changed to " + t.visibilityState), 
-            this.At.Y();
+            this.Tt.Y();
         }, this.Nt = t;
         const e = getDocument();
         e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.St);
@@ -7194,7 +7164,7 @@ class __PRIVATE_AsyncQueueImpl {
      */    async Bt() {
         if (0 !== this.wt.length) {
             try {
-                await this.wt[0](), this.wt.shift(), this.At.reset();
+                await this.wt[0](), this.wt.shift(), this.Tt.reset();
             } catch (t) {
                 if (!
                 /**
@@ -7233,7 +7203,7 @@ class __PRIVATE_AsyncQueueImpl {
             // Since `backoffAndRun()` cancels an existing backoff and schedules a
             // new backoff on every call, there is only ever a single additional
             // operation in the queue.
-            this.At.H((() => this.Bt()));
+            this.Tt.H((() => this.Bt()));
         }
     }
     qt(t) {
@@ -7319,7 +7289,7 @@ class __PRIVATE_AsyncQueueImpl {
      * @param lastTimerId - Delayed operations up to and including this TimerId
      * will be drained. Pass TimerId.All to run all delayed operations.
      * @returns a Promise that resolves once all operations have been run.
-     */    xt(t) {
+     */    Mt(t) {
         // Note that draining may generate more delayed ops, so we do that first.
         return this.Qt().then((() => {
             // Run ops in the same order they'd run if they ran naturally.
@@ -7331,7 +7301,7 @@ class __PRIVATE_AsyncQueueImpl {
     }
     /**
      * For Tests: Skip all subsequent delays for a timer id.
-     */    Mt(t) {
+     */    xt(t) {
         this.Ct.push(t);
     }
     /** Called once a DelayedOperation is run or canceled. */    $t(t) {