@firebase/firestore 4.7.9 → 4.7.10-20250318131644

package/dist/lite/index.node.cjs.js

@@ -10,7 +10,7 @@ var util = require('@firebase/util');
 var bloomBlob = require('@firebase/webchannel-wrapper/bloom-blob');
 var crypto = require('crypto');
 
-const version$1 = "4.7.9";
+const version$1 = "4.7.10-20250318131644";
 
 /**
  * @license
@@ -63,7 +63,7 @@ User.GOOGLE_CREDENTIALS = new User('google-credentials-uid');
 User.FIRST_PARTY = new User('first-party-uid');
 User.MOCK_USER = new User('mock-user');
 
-const version = "11.4.0";
+const version = "11.5.0-20250318131644";
 
 /**
  * @license
@@ -703,6 +703,171 @@ function databaseIdFromApp(app, database) {
     return new DatabaseId(app.options.projectId, database);
 }
 
+/**
+ * @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 randomBytes(nBytes) {
+    return crypto.randomBytes(nBytes);
+}
+
+/**
+ * @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 newTextEncoder() {
+    return new TextEncoder();
+}
+
+/**
+ * @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 AutoId {
+    static newId() {
+        // Alphanumeric characters
+        const chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';
+        // The largest byte value that is a multiple of `char.length`.
+        const maxMultiple = Math.floor(256 / chars.length) * chars.length;
+        let autoId = '';
+        const targetLength = 20;
+        while (autoId.length < targetLength) {
+            const bytes = randomBytes(40);
+            for (let i = 0; i < bytes.length; ++i) {
+                // Only accept values that are [0, maxMultiple), this ensures they can
+                // be evenly mapped to indices of `chars` via a modulo operation.
+                if (autoId.length < targetLength && bytes[i] < maxMultiple) {
+                    autoId += chars.charAt(bytes[i] % chars.length);
+                }
+            }
+        }
+        return autoId;
+    }
+}
+function primitiveComparator(left, right) {
+    if (left < right) {
+        return -1;
+    }
+    if (left > right) {
+        return 1;
+    }
+    return 0;
+}
+/** Compare strings in UTF-8 encoded byte order */
+function compareUtf8Strings(left, right) {
+    let i = 0;
+    while (i < left.length && i < right.length) {
+        const leftCodePoint = left.codePointAt(i);
+        const rightCodePoint = right.codePointAt(i);
+        if (leftCodePoint !== rightCodePoint) {
+            if (leftCodePoint < 128 && rightCodePoint < 128) {
+                // ASCII comparison
+                return primitiveComparator(leftCodePoint, rightCodePoint);
+            }
+            else {
+                // Lazy instantiate TextEncoder
+                const encoder = newTextEncoder();
+                // UTF-8 encode the character at index i for byte comparison.
+                const leftBytes = encoder.encode(getUtf8SafeSubstring(left, i));
+                const rightBytes = encoder.encode(getUtf8SafeSubstring(right, i));
+                const comp = compareByteArrays(leftBytes, rightBytes);
+                if (comp !== 0) {
+                    return comp;
+                }
+                else {
+                    // EXTREMELY RARE CASE: Code points differ, but their UTF-8 byte
+                    // representations are identical. This can happen with malformed input
+                    // (invalid surrogate pairs). The backend also actively prevents invalid
+                    // surrogates as INVALID_ARGUMENT errors, so we almost never receive
+                    // invalid strings from backend.
+                    // Fallback to code point comparison for graceful handling.
+                    return primitiveComparator(leftCodePoint, rightCodePoint);
+                }
+            }
+        }
+        // Increment by 2 for surrogate pairs, 1 otherwise
+        i += leftCodePoint > 0xffff ? 2 : 1;
+    }
+    // Compare lengths if all characters are equal
+    return primitiveComparator(left.length, right.length);
+}
+function getUtf8SafeSubstring(str, index) {
+    const firstCodePoint = str.codePointAt(index);
+    if (firstCodePoint > 0xffff) {
+        // It's a surrogate pair, return the whole pair
+        return str.substring(index, index + 2);
+    }
+    else {
+        // It's a single code point, return it
+        return str.substring(index, index + 1);
+    }
+}
+function compareByteArrays(left, right) {
+    for (let i = 0; i < left.length && i < right.length; ++i) {
+        if (left[i] !== right[i]) {
+            return primitiveComparator(left[i], right[i]);
+        }
+    }
+    return primitiveComparator(left.length, right.length);
+}
+/** Helper to compare arrays using isEqual(). */
+function arrayEquals(left, right, comparator) {
+    if (left.length !== right.length) {
+        return false;
+    }
+    return left.every((value, index) => comparator(value, right[index]));
+}
+
 /**
  * @license
  * Copyright 2017 Google LLC
@@ -825,7 +990,7 @@ class BasePath {
                 return comparison;
             }
         }
-        return Math.sign(p1.length - p2.length);
+        return primitiveComparator(p1.length, p2.length);
     }
     static compareSegments(lhs, rhs) {
         const isLhsNumeric = BasePath.isNumericId(lhs);
@@ -844,13 +1009,7 @@ class BasePath {
         }
         else {
             // both non-numeric
-            if (lhs < rhs) {
-                return -1;
-            }
-            if (lhs > rhs) {
-                return 1;
-            }
-            return 0;
+            return compareUtf8Strings(lhs, rhs);
         }
     }
     // Checks if a segment is a numeric ID (starts with "__id" and ends with "__").
@@ -1650,91 +1809,6 @@ function newConnection(databaseInfo) {
     return new FetchConnection(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 randomBytes(nBytes) {
-    return crypto.randomBytes(nBytes);
-}
-
-/**
- * @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 AutoId {
-    static newId() {
-        // Alphanumeric characters
-        const chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';
-        // The largest byte value that is a multiple of `char.length`.
-        const maxMultiple = Math.floor(256 / chars.length) * chars.length;
-        let autoId = '';
-        const targetLength = 20;
-        while (autoId.length < targetLength) {
-            const bytes = randomBytes(40);
-            for (let i = 0; i < bytes.length; ++i) {
-                // Only accept values that are [0, maxMultiple), this ensures they can
-                // be evenly mapped to indices of `chars` via a modulo operation.
-                if (autoId.length < targetLength && bytes[i] < maxMultiple) {
-                    autoId += chars.charAt(bytes[i] % chars.length);
-                }
-            }
-        }
-        return autoId;
-    }
-}
-function primitiveComparator(left, right) {
-    if (left < right) {
-        return -1;
-    }
-    if (left > right) {
-        return 1;
-    }
-    return 0;
-}
-/** Helper to compare arrays using isEqual(). */
-function arrayEquals(left, right, comparator) {
-    if (left.length !== right.length) {
-        return false;
-    }
-    return left.every((value, index) => comparator(value, right[index]));
-}
-
 /**
  * @license
  * Copyright 2017 Google LLC
@@ -2448,7 +2522,7 @@ function valueCompare(left, right) {
         case 4 /* TypeOrder.ServerTimestampValue */:
             return compareTimestamps(getLocalWriteTime(left), getLocalWriteTime(right));
         case 5 /* TypeOrder.StringValue */:
-            return primitiveComparator(left.stringValue, right.stringValue);
+            return compareUtf8Strings(left.stringValue, right.stringValue);
         case 6 /* TypeOrder.BlobValue */:
             return compareBlobs(left.bytesValue, right.bytesValue);
         case 7 /* TypeOrder.RefValue */:
@@ -2569,7 +2643,7 @@ function compareMaps(left, right) {
     leftKeys.sort();
     rightKeys.sort();
     for (let i = 0; i < leftKeys.length && i < rightKeys.length; ++i) {
-        const keyCompare = primitiveComparator(leftKeys[i], rightKeys[i]);
+        const keyCompare = compareUtf8Strings(leftKeys[i], rightKeys[i]);
         if (keyCompare !== 0) {
             return keyCompare;
         }