@firebase/firestore 4.7.7 → 4.7.8

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

@@ -8,7 +8,7 @@ import { FirebaseError as _, base64 as c, DecodeBase64StringError as l, getDefau
 
 import { Integer as m } from "@firebase/webchannel-wrapper/bloom-blob";
 
-const T = "4.7.7";
+const A = "4.7.8";
 
 /**
  * @license
@@ -69,7 +69,7 @@ User.MOCK_USER = new User("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let A = "11.3.0";
+let T = "11.3.1";
 
 /**
  * @license
@@ -108,14 +108,14 @@ const P = new a("@firebase/firestore");
 function __PRIVATE_logDebug(t, ...e) {
     if (P.logLevel <= u.DEBUG) {
         const r = e.map(__PRIVATE_argToString);
-        P.debug(`Firestore (${A}): ${t}`, ...r);
+        P.debug(`Firestore (${T}): ${t}`, ...r);
     }
 }
 
 function __PRIVATE_logError(t, ...e) {
     if (P.logLevel <= u.ERROR) {
         const r = e.map(__PRIVATE_argToString);
-        P.error(`Firestore (${A}): ${t}`, ...r);
+        P.error(`Firestore (${T}): ${t}`, ...r);
     }
 }
 
@@ -124,7 +124,7 @@ function __PRIVATE_logError(t, ...e) {
  */ function __PRIVATE_logWarn(t, ...e) {
     if (P.logLevel <= u.WARN) {
         const r = e.map(__PRIVATE_argToString);
-        P.warn(`Firestore (${A}): ${t}`, ...r);
+        P.warn(`Firestore (${T}): ${t}`, ...r);
     }
 }
 
@@ -185,7 +185,7 @@ function __PRIVATE_logError(t, ...e) {
  */ function fail(t = "Unexpected state") {
     // Log the failure in addition to throw an exception, just in case the
     // exception is swallowed.
-    const e = `FIRESTORE (${A}) INTERNAL ASSERTION FAILED: ` + t;
+    const e = `FIRESTORE (${T}) INTERNAL ASSERTION FAILED: ` + t;
     // NOTE: We don't use FirestoreError here because these are internal failures
     // that cannot be handled by the user. (Also it would create a circular
     // dependency between the error and assert modules which doesn't work.)
@@ -480,60 +480,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
@@ -550,62 +496,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 Q = "__name__";
+const Q = "__name__";
 
 /**
  * Path represents an ordered sequence of string segments.
@@ -673,11 +564,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) {
@@ -1005,7 +898,7 @@ function __PRIVATE_cloneLongPollingOptions(t) {
 /**
  * The value returned from the most recent invocation of
  * `generateUniqueDebugId()`, or null if it has never been invoked.
- */ let x = null;
+ */ let M = null;
 
 /**
  * Generates and returns an initial value for `lastUniqueDebugId`.
@@ -1030,9 +923,9 @@ function __PRIVATE_cloneLongPollingOptions(t) {
  * @return the 10-character generated ID (e.g. "0xa1b2c3d4").
  */
 function __PRIVATE_generateUniqueDebugId() {
-    return null === x ? x = function __PRIVATE_generateInitialUniqueDebugId() {
+    return null === M ? M = function __PRIVATE_generateInitialUniqueDebugId() {
         return 268435456 + Math.round(2147483648 * Math.random());
-    }() : x++, "0x" + x.toString(16);
+    }() : M++, "0x" + M.toString(16);
 }
 
 /**
@@ -1083,7 +976,7 @@ function __PRIVATE_generateUniqueDebugId() {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const M = "RestConnection", U = {
+const x = "RestConnection", k = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery",
@@ -1100,7 +993,7 @@ const M = "RestConnection", U = {
  * 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;
@@ -1108,18 +1001,18 @@ 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 === $ ? `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 === $ ? `project_id=${r}` : `project_id=${r}&database_id=${n}`;
     }
     V(t, e, r, n, i) {
         const s = __PRIVATE_generateUniqueDebugId(), o = this.I(t, e.toUriEncodedString());
-        __PRIVATE_logDebug(M, `Sending RPC '${t}' ${s}:`, o, r);
+        __PRIVATE_logDebug(x, `Sending RPC '${t}' ${s}:`, o, r);
         const a = {
             "google-cloud-resource-prefix": this.P,
             "x-goog-request-params": this.R
         };
-        return this.p(a, n, i), this.F(t, o, a, r).then((e => (__PRIVATE_logDebug(M, `Received RPC '${t}' ${s}: `, e), 
+        return this.p(a, n, i), this.F(t, o, a, r).then((e => (__PRIVATE_logDebug(x, `Received RPC '${t}' ${s}: `, e), 
         e)), (e => {
-            throw __PRIVATE_logWarn(M, `RPC '${t}' ${s} failed with error: `, e, "url: ", o, "request:", r), 
+            throw __PRIVATE_logWarn(x, `RPC '${t}' ${s} failed with error: `, e, "url: ", o, "request:", r), 
             e;
         }));
     }
@@ -1136,7 +1029,7 @@ class __PRIVATE_RestConnection {
         // SDK_VERSION is updated to different value at runtime depending on the entry point,
         // so we need to get its value when we need it in a function.
         function __PRIVATE_getGoogApiClientValue() {
-            return "gl-js/ fire/" + A;
+            return "gl-js/ fire/" + T;
         }(), 
         // Content-Type: text/plain will avoid preflight requests which might
         // mess with CORS and redirects by proxies. If we add custom headers
@@ -1146,8 +1039,8 @@ class __PRIVATE_RestConnection {
         e && e.headers.forEach(((e, r) => t[r] = e)), r && r.headers.forEach(((e, r) => t[r] = e));
     }
     I(t, e) {
-        const r = U[t];
-        return `${this.A}/v1/${e}:${r}`;
+        const r = k[t];
+        return `${this.T}/v1/${e}:${r}`;
     }
     /**
      * Closes and cleans up any resources associated with the connection. This
@@ -1183,7 +1076,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 k, j;
+ */ var U, j;
 
 /**
  * Converts an HTTP Status Code to the equivalent error code.
@@ -1286,7 +1179,7 @@ function __PRIVATE_mapCodeFromHttpStatus(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (j = k || (k = {}))[j.OK = 0] = "OK", j[j.CANCELLED = 1] = "CANCELLED", j[j.UNKNOWN = 2] = "UNKNOWN", 
+ */ (j = U || (U = {}))[j.OK = 0] = "OK", j[j.CANCELLED = 1] = "CANCELLED", j[j.UNKNOWN = 2] = "UNKNOWN", 
 j[j.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", j[j.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", 
 j[j.NOT_FOUND = 5] = "NOT_FOUND", j[j.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", j[j.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
 j[j.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", j[j.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
@@ -1364,6 +1257,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
@@ -1967,7 +1937,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) {
@@ -2015,7 +1985,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;
@@ -3963,7 +3933,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();
     }
@@ -3980,7 +3950,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
@@ -3998,7 +3968,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);
@@ -4140,7 +4110,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.
@@ -6922,13 +6892,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.Vt(t);
             e && e.then((e => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
@@ -6952,7 +6922,7 @@ class __PRIVATE_TransactionRunner {
         }
     }
     It(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) {
@@ -7152,14 +7122,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(lt, "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);
@@ -7206,7 +7176,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 (!
                 /**
@@ -7245,7 +7215,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) {
@@ -7331,7 +7301,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.
@@ -7343,7 +7313,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) {
@@ -7434,7 +7404,7 @@ class Transaction {
  * @packageDocumentation
  */ !function __PRIVATE_registerFirestore() {
     !function __PRIVATE_setSDKVersion(t) {
-        A = t;
+        T = t;
     }(`${s}_lite`), n(new o("firestore/lite", ((t, {instanceIdentifier: e, options: r}) => {
         const n = t.getProvider("app").getImmediate(), i = new Firestore(new __PRIVATE_LiteAuthCredentialsProvider(t.getProvider("auth-internal")), new __PRIVATE_LiteAppCheckTokenProvider(n, t.getProvider("app-check-internal")), function __PRIVATE_databaseIdFromApp(t, e) {
             if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new FirestoreError(p, '"projectId" not provided in firebase.initializeApp.');
@@ -7443,7 +7413,7 @@ class Transaction {
         return r && i._setSettings(r), i;
     }), "PUBLIC").setMultipleInstances(!0)), 
     // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-    i("firestore-lite", T, "rn"), i("firestore-lite", T, "esm2017");
+    i("firestore-lite", A, "rn"), i("firestore-lite", A, "esm2017");
 }();
 
 export { AggregateField, AggregateQuerySnapshot, Bytes, CollectionReference, DocumentReference, DocumentSnapshot, FieldPath, FieldValue, Firestore, FirestoreError, GeoPoint, Query, QueryCompositeFilterConstraint, QueryConstraint, QueryDocumentSnapshot, QueryEndAtConstraint, QueryFieldFilterConstraint, QueryLimitConstraint, QueryOrderByConstraint, QuerySnapshot, QueryStartAtConstraint, Timestamp, Transaction, VectorValue, WriteBatch, addDoc, aggregateFieldEqual, aggregateQuerySnapshotEqual, and, arrayRemove, arrayUnion, average, collection, collectionGroup, connectFirestoreEmulator, count, deleteDoc, deleteField, doc, documentId, endAt, endBefore, getAggregate, getCount, getDoc, getDocs, getFirestore, increment, initializeFirestore, limit, limitToLast, or, orderBy, query, queryEqual, refEqual, runTransaction, serverTimestamp, setDoc, setLogLevel, snapshotEqual, startAfter, startAt, sum, terminate, updateDoc, vector, where, writeBatch };