@firebase/firestore 4.7.9 → 4.7.10-20250318131644

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 A = "4.7.9";
+const A = "4.7.10-20250318131644";
 
 /**
  * @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 T = "11.4.0";
+let T = "11.5.0-20250318131644";
 
 /**
  * @license
@@ -480,6 +480,57 @@ 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.
+ */
 /**
  * @license
  * Copyright 2017 Google LLC
@@ -496,7 +547,84 @@ class DatabaseInfo {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const Q = "__name__";
+/**
+ * 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) {
+    let r = 0;
+    for (;r < t.length && r < e.length; ) {
+        const n = t.codePointAt(r), i = e.codePointAt(r);
+        if (n !== i) {
+            if (n < 128 && i < 128) 
+            // ASCII comparison
+            return __PRIVATE_primitiveComparator(n, i);
+            {
+                // Lazy instantiate TextEncoder
+                const s = new TextEncoder, o = __PRIVATE_compareByteArrays(s.encode(__PRIVATE_getUtf8SafeSubstring(t, r)), s.encode(__PRIVATE_getUtf8SafeSubstring(e, r)));
+                // UTF-8 encode the character at index i for byte comparison.
+                                return 0 !== o ? o : __PRIVATE_primitiveComparator(n, i);
+            }
+        }
+        // Increment by 2 for surrogate pairs, 1 otherwise
+                r += n > 65535 ? 2 : 1;
+    }
+    // Compare lengths if all characters are equal
+        return __PRIVATE_primitiveComparator(t.length, e.length);
+}
+
+function __PRIVATE_getUtf8SafeSubstring(t, e) {
+    return t.codePointAt(e) > 65535 ? t.substring(e, e + 2) : t.substring(e, e + 1);
+}
+
+function __PRIVATE_compareByteArrays(t, e) {
+    for (let r = 0; r < t.length && r < e.length; ++r) if (t[r] !== e[r]) return __PRIVATE_primitiveComparator(t[r], e[r]);
+    return __PRIVATE_primitiveComparator(t.length, e.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__";
 
 /**
  * Path represents an ordered sequence of string segments.
@@ -564,13 +692,11 @@ const Q = "__name__";
             const r = BasePath.compareSegments(t.get(n), e.get(n));
             if (0 !== r) return r;
         }
-        return Math.sign(t.length - e.length);
+        return __PRIVATE_primitiveComparator(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)) : 
-        // both non-numeric
-        t < e ? -1 : t > e ? 1 : 0;
+        return r && !n ? -1 : !r && n ? 1 : r && n ? BasePath.extractNumericId(t).compare(BasePath.extractNumericId(e)) : __PRIVATE_compareUtf8Strings(t, e);
     }
     // Checks if a segment is a numeric ID (starts with "__id" and ends with "__").
     static isNumericId(t) {
@@ -898,7 +1024,7 @@ function __PRIVATE_cloneLongPollingOptions(t) {
 /**
  * The value returned from the most recent invocation of
  * `generateUniqueDebugId()`, or null if it has never been invoked.
- */ let M = null;
+ */ let U = null;
 
 /**
  * Generates and returns an initial value for `lastUniqueDebugId`.
@@ -923,9 +1049,9 @@ function __PRIVATE_cloneLongPollingOptions(t) {
  * @return the 10-character generated ID (e.g. "0xa1b2c3d4").
  */
 function __PRIVATE_generateUniqueDebugId() {
-    return null === M ? M = function __PRIVATE_generateInitialUniqueDebugId() {
+    return null === U ? U = function __PRIVATE_generateInitialUniqueDebugId() {
         return 268435456 + Math.round(2147483648 * Math.random());
-    }() : M++, "0x" + M.toString(16);
+    }() : U++, "0x" + U.toString(16);
 }
 
 /**
@@ -976,7 +1102,7 @@ function __PRIVATE_generateUniqueDebugId() {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const x = "RestConnection", k = {
+const M = "RestConnection", x = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery",
@@ -1005,14 +1131,14 @@ class __PRIVATE_RestConnection {
     }
     V(t, e, r, n, i) {
         const s = __PRIVATE_generateUniqueDebugId(), o = this.I(t, e.toUriEncodedString());
-        __PRIVATE_logDebug(x, `Sending RPC '${t}' ${s}:`, o, r);
+        __PRIVATE_logDebug(M, `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(x, `Received RPC '${t}' ${s}: `, e), 
+        return this.p(a, n, i), this.F(t, o, a, r).then((e => (__PRIVATE_logDebug(M, `Received RPC '${t}' ${s}: `, e), 
         e)), (e => {
-            throw __PRIVATE_logWarn(x, `RPC '${t}' ${s} failed with error: `, e, "url: ", o, "request:", r), 
+            throw __PRIVATE_logWarn(M, `RPC '${t}' ${s} failed with error: `, e, "url: ", o, "request:", r), 
             e;
         }));
     }
@@ -1039,7 +1165,7 @@ 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 = k[t];
+        const r = x[t];
         return `${this.T}/v1/${e}:${r}`;
     }
     /**
@@ -1076,7 +1202,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 U, j;
+ */ var k, j;
 
 /**
  * Converts an HTTP Status Code to the equivalent error code.
@@ -1179,7 +1305,7 @@ function __PRIVATE_mapCodeFromHttpStatus(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (j = U || (U = {}))[j.OK = 0] = "OK", j[j.CANCELLED = 1] = "CANCELLED", j[j.UNKNOWN = 2] = "UNKNOWN", 
+ */ (j = k || (k = {}))[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", 
@@ -1257,83 +1383,6 @@ 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
@@ -1937,7 +1986,7 @@ function __PRIVATE_valueCompare(t, e) {
         return __PRIVATE_compareTimestamps(__PRIVATE_getLocalWriteTime(t), __PRIVATE_getLocalWriteTime(e));
 
       case 5 /* TypeOrder.StringValue */ :
-        return __PRIVATE_primitiveComparator(t.stringValue, e.stringValue);
+        return __PRIVATE_compareUtf8Strings(t.stringValue, e.stringValue);
 
       case 6 /* TypeOrder.BlobValue */ :
         return function __PRIVATE_compareBlobs(t, e) {
@@ -1985,7 +2034,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_primitiveComparator(n[t], s[t]);
+                const e = __PRIVATE_compareUtf8Strings(n[t], s[t]);
                 if (0 !== e) return e;
                 const o = __PRIVATE_valueCompare(r[n[t]], i[s[t]]);
                 if (0 !== o) return o;
@@ -3933,7 +3982,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.k = n, this.U = i, this.j = 0, this.W = null, 
+        this.L = t, this.timerId = e, this.U = r, this.M = n, this.k = i, this.j = 0, this.W = null, 
         /** The last backoff attempt, as epoch milliseconds. */
         this.K = Date.now(), this.reset();
     }
@@ -3950,7 +3999,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.U;
+        this.j = this.k;
     }
     /**
      * Returns a promise that resolves after currentDelayMs, and increases the
@@ -3968,7 +4017,7 @@ class __PRIVATE_ExponentialBackoff {
         t()))), 
         // Apply backoff factor to determine next delay and ensure it is within
         // bounds.
-        this.j *= this.k, this.j < this.M && (this.j = this.M), this.j > this.U && (this.j = this.U);
+        this.j *= this.M, this.j < this.U && (this.j = this.U), this.j > this.k && (this.j = this.k);
     }
     Y() {
         null !== this.W && (this.W.skipDelay(), this.W = null);
@@ -7311,7 +7360,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.
-     */    Mt(t) {
+     */    Ut(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.
@@ -7323,7 +7372,7 @@ class __PRIVATE_AsyncQueueImpl {
     }
     /**
      * For Tests: Skip all subsequent delays for a timer id.
-     */    xt(t) {
+     */    Mt(t) {
         this.Ct.push(t);
     }
     /** Called once a DelayedOperation is run or canceled. */    $t(t) {