@firebase/firestore 4.7.9 → 4.7.10-20250318131644

package/dist/lite/index.cjs.js

@@ -4,7 +4,7 @@ import { Logger, LogLevel } from '@firebase/logger';
 import { FirebaseError, getDefaultEmulatorHostnameAndPort, deepEqual, createMockUserToken, getModularInstance } from '@firebase/util';
 import { Integer } from '@firebase/webchannel-wrapper/bloom-blob';
 
-const E = "4.7.9";
+const E = "4.7.10-20250318131644";
 
 /**
  * @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.4.0";
+let m = "11.5.0-20250318131644";
 
 /**
  * @license
@@ -476,6 +476,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
@@ -492,7 +543,84 @@ class DatabaseInfo {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const B = "__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 B = "__name__";
 
 /**
  * Path represents an ordered sequence of string segments.
@@ -560,13 +688,11 @@ const B = "__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) {
@@ -1072,7 +1198,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 x, k;
+ */ var U, x;
 
 /**
  * Converts an HTTP Status Code to the equivalent error code.
@@ -1175,13 +1301,13 @@ function __PRIVATE_mapCodeFromHttpStatus(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (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";
+ */ (x = U || (U = {}))[x.OK = 0] = "OK", x[x.CANCELLED = 1] = "CANCELLED", x[x.UNKNOWN = 2] = "UNKNOWN", 
+x[x.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", x[x.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", 
+x[x.NOT_FOUND = 5] = "NOT_FOUND", x[x.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", x[x.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
+x[x.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", x[x.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
+x[x.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", x[x.ABORTED = 10] = "ABORTED", 
+x[x.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", x[x.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
+x[x.INTERNAL = 13] = "INTERNAL", x[x.UNAVAILABLE = 14] = "UNAVAILABLE", x[x.DATA_LOSS = 15] = "DATA_LOSS";
 
 class __PRIVATE_FetchConnection extends __PRIVATE_RestConnection {
     D(t, e) {
@@ -1253,83 +1379,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
@@ -1512,7 +1561,7 @@ class ByteString {
 
 ByteString.EMPTY_BYTE_STRING = new ByteString("");
 
-const U = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+const k = 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
@@ -1526,7 +1575,7 @@ const U = 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 = U.exec(t);
+        const r = k.exec(t);
         if (__PRIVATE_hardAssert(!!r), r[1]) {
             // Pad the fraction out to 9 digits (nanos).
             let t = r[1];
@@ -1925,7 +1974,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) {
@@ -1973,7 +2022,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;
@@ -3921,7 +3970,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.M = r, this.U = n, this.k = i, this.j = 0, this.W = null, 
         /** The last backoff attempt, as epoch milliseconds. */
         this.K = Date.now(), this.reset();
     }
@@ -3938,7 +3987,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
@@ -3956,7 +4005,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.U, this.j < this.M && (this.j = this.M), 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 {
     }
     /**
      * For Tests: Skip all subsequent delays for a timer id.
-     */    xt(t) {
+     */    Ut(t) {
         this.Ct.push(t);
     }
     /** Called once a DelayedOperation is run or canceled. */    $t(t) {