@react-native-firebase/app 20.1.0 → 20.2.0

package/lib/internal/web/memidb/lib/ObjectStore.js

@@ -0,0 +1,172 @@
+import { ConstraintError, DataError } from './errors.js';
+import extractKey from './extractKey.js';
+import KeyGenerator from './KeyGenerator.js';
+import RecordStore from './RecordStore.js';
+// http://www.w3.org/TR/2015/REC-IndexedDB-20150108/#dfn-object-store
+class ObjectStore {
+  deleted = false;
+  records = new RecordStore();
+  rawIndexes = new Map();
+  constructor(rawDatabase, name, keyPath, autoIncrement) {
+    this.rawDatabase = rawDatabase;
+    this.keyGenerator = autoIncrement === true ? new KeyGenerator() : null;
+    this.deleted = false;
+    this.name = name;
+    this.keyPath = keyPath;
+    this.autoIncrement = autoIncrement;
+  }
+
+  // http://www.w3.org/TR/2015/REC-IndexedDB-20150108/#dfn-steps-for-retrieving-a-value-from-an-object-store
+  getKey(key) {
+    const record = this.records.get(key);
+    return record !== undefined ? structuredClone(record.key) : undefined;
+  }
+
+  // http://w3c.github.io/IndexedDB/#retrieve-multiple-keys-from-an-object-store
+  getAllKeys(range, count) {
+    if (count === undefined || count === 0) {
+      count = Infinity;
+    }
+    const records = [];
+    for (const record of this.records.values(range)) {
+      records.push(structuredClone(record.key));
+      if (records.length >= count) {
+        break;
+      }
+    }
+    return records;
+  }
+
+  // http://www.w3.org/TR/2015/REC-IndexedDB-20150108/#dfn-steps-for-retrieving-a-value-from-an-object-store
+  getValue(key) {
+    const record = this.records.get(key);
+    return record !== undefined ? structuredClone(record.value) : undefined;
+  }
+
+  // http://w3c.github.io/IndexedDB/#retrieve-multiple-values-from-an-object-store
+  getAllValues(range, count) {
+    if (count === undefined || count === 0) {
+      count = Infinity;
+    }
+    const records = [];
+    for (const record of this.records.values(range)) {
+      records.push(structuredClone(record.value));
+      if (records.length >= count) {
+        break;
+      }
+    }
+    return records;
+  }
+
+  // http://www.w3.org/TR/2015/REC-IndexedDB-20150108/#dfn-steps-for-storing-a-record-into-an-object-store
+  storeRecord(newRecord, noOverwrite, rollbackLog) {
+    if (this.keyPath !== null) {
+      const key = extractKey(this.keyPath, newRecord.value);
+      if (key !== undefined) {
+        newRecord.key = key;
+      }
+    }
+    if (this.keyGenerator !== null && newRecord.key === undefined) {
+      if (rollbackLog) {
+        const keyGeneratorBefore = this.keyGenerator.num;
+        rollbackLog.push(() => {
+          if (this.keyGenerator) {
+            this.keyGenerator.num = keyGeneratorBefore;
+          }
+        });
+      }
+      newRecord.key = this.keyGenerator.next();
+
+      // Set in value if keyPath defiend but led to no key
+      // http://www.w3.org/TR/2015/REC-IndexedDB-20150108/#dfn-steps-to-assign-a-key-to-a-value-using-a-key-path
+      if (this.keyPath !== null) {
+        if (Array.isArray(this.keyPath)) {
+          throw new Error('Cannot have an array key path in an object store with a key generator');
+        }
+        let remainingKeyPath = this.keyPath;
+        let object = newRecord.value;
+        let identifier;
+        let i = 0; // Just to run the loop at least once
+        while (i >= 0) {
+          if (typeof object !== 'object') {
+            throw new DataError();
+          }
+          i = remainingKeyPath.indexOf('.');
+          if (i >= 0) {
+            identifier = remainingKeyPath.slice(0, i);
+            remainingKeyPath = remainingKeyPath.slice(i + 1);
+            if (!Object.hasOwn(object, identifier)) {
+              object[identifier] = {};
+            }
+            object = object[identifier];
+          }
+        }
+        identifier = remainingKeyPath;
+        object[identifier] = newRecord.key;
+      }
+    } else if (this.keyGenerator !== null && typeof newRecord.key === 'number') {
+      this.keyGenerator.setIfLarger(newRecord.key);
+    }
+    const existingRecord = this.records.get(newRecord.key);
+    if (existingRecord) {
+      if (noOverwrite) {
+        throw new ConstraintError();
+      }
+      this.deleteRecord(newRecord.key, rollbackLog);
+    }
+    this.records.add(newRecord);
+    if (rollbackLog) {
+      rollbackLog.push(() => {
+        this.deleteRecord(newRecord.key);
+      });
+    }
+
+    // Update indexes
+    for (const rawIndex of this.rawIndexes.values()) {
+      if (rawIndex.initialized) {
+        rawIndex.storeRecord(newRecord);
+      }
+    }
+    return newRecord.key;
+  }
+
+  // http://www.w3.org/TR/2015/REC-IndexedDB-20150108/#dfn-steps-for-deleting-records-from-an-object-store
+  deleteRecord(key, rollbackLog) {
+    const deletedRecords = this.records.delete(key);
+    if (rollbackLog) {
+      for (const record of deletedRecords) {
+        rollbackLog.push(() => {
+          this.storeRecord(record, true);
+        });
+      }
+    }
+    for (const rawIndex of this.rawIndexes.values()) {
+      rawIndex.records.deleteByValue(key);
+    }
+  }
+
+  // http://www.w3.org/TR/2015/REC-IndexedDB-20150108/#dfn-steps-for-clearing-an-object-store
+  clear(rollbackLog) {
+    const deletedRecords = this.records.clear();
+    if (rollbackLog) {
+      for (const record of deletedRecords) {
+        rollbackLog.push(() => {
+          this.storeRecord(record, true);
+        });
+      }
+    }
+    for (const rawIndex of this.rawIndexes.values()) {
+      rawIndex.records.clear();
+    }
+  }
+  count(range) {
+    let count = 0;
+
+    // eslint-disable-next-line @typescript-eslint/no-unused-vars
+    for (const record of this.records.values(range)) {
+      count += 1;
+    }
+    return count;
+  }
+}
+export default ObjectStore;

package/lib/internal/web/memidb/lib/RecordStore.js

@@ -0,0 +1,141 @@
+import FDBKeyRange from '../FDBKeyRange.js';
+import {
+  getByKey,
+  getByKeyRange,
+  getIndexByKey,
+  getIndexByKeyGTE,
+  getIndexByKeyRange,
+} from './binarySearch.js';
+import cmp from './cmp.js';
+class RecordStore {
+  records = [];
+  get(key) {
+    if (key instanceof FDBKeyRange) {
+      return getByKeyRange(this.records, key);
+    }
+    return getByKey(this.records, key);
+  }
+  add(newRecord) {
+    // Find where to put it so it's sorted by key
+    let i;
+    if (this.records.length === 0) {
+      i = 0;
+    } else {
+      i = getIndexByKeyGTE(this.records, newRecord.key);
+      if (i === -1) {
+        // If no matching key, add to end
+        i = this.records.length;
+      } else {
+        // If matching key, advance to appropriate position based on value (used in indexes)
+        while (i < this.records.length && cmp(this.records[i].key, newRecord.key) === 0) {
+          if (cmp(this.records[i].value, newRecord.value) !== -1) {
+            // Record value >= newRecord value, so insert here
+            break;
+          }
+          i += 1; // Look at next record
+        }
+      }
+    }
+    this.records.splice(i, 0, newRecord);
+  }
+  delete(key) {
+    const deletedRecords = [];
+    const isRange = key instanceof FDBKeyRange;
+    while (true) {
+      const idx = isRange
+        ? getIndexByKeyRange(this.records, key)
+        : getIndexByKey(this.records, key);
+      if (idx === -1) {
+        break;
+      }
+      deletedRecords.push(this.records[idx]);
+      this.records.splice(idx, 1);
+    }
+    return deletedRecords;
+  }
+  deleteByValue(key) {
+    const range = key instanceof FDBKeyRange ? key : FDBKeyRange.only(key);
+    const deletedRecords = [];
+    this.records = this.records.filter(record => {
+      const shouldDelete = range.includes(record.value);
+      if (shouldDelete) {
+        deletedRecords.push(record);
+      }
+      return !shouldDelete;
+    });
+    return deletedRecords;
+  }
+  clear() {
+    const deletedRecords = this.records.slice();
+    this.records = [];
+    return deletedRecords;
+  }
+  values(range, direction = 'next') {
+    return {
+      [Symbol.iterator]: () => {
+        let i;
+        if (direction === 'next') {
+          i = 0;
+          if (range !== undefined && range.lower !== undefined) {
+            while (this.records[i] !== undefined) {
+              const cmpResult = cmp(this.records[i].key, range.lower);
+              if (cmpResult === 1 || (cmpResult === 0 && !range.lowerOpen)) {
+                break;
+              }
+              i += 1;
+            }
+          }
+        } else {
+          i = this.records.length - 1;
+          if (range !== undefined && range.upper !== undefined) {
+            while (this.records[i] !== undefined) {
+              const cmpResult = cmp(this.records[i].key, range.upper);
+              if (cmpResult === -1 || (cmpResult === 0 && !range.upperOpen)) {
+                break;
+              }
+              i -= 1;
+            }
+          }
+        }
+        return {
+          next: () => {
+            let done;
+            let value;
+            if (direction === 'next') {
+              value = this.records[i];
+              done = i >= this.records.length;
+              i += 1;
+              if (!done && range !== undefined && range.upper !== undefined) {
+                const cmpResult = cmp(value.key, range.upper);
+                done = cmpResult === 1 || (cmpResult === 0 && range.upperOpen);
+                if (done) {
+                  value = undefined;
+                }
+              }
+            } else {
+              value = this.records[i];
+              done = i < 0;
+              i -= 1;
+              if (!done && range !== undefined && range.lower !== undefined) {
+                const cmpResult = cmp(value.key, range.lower);
+                done = cmpResult === -1 || (cmpResult === 0 && range.lowerOpen);
+                if (done) {
+                  value = undefined;
+                }
+              }
+            }
+
+            // The weird "as IteratorResult<Record>" is needed because of
+            // https://github.com/Microsoft/TypeScript/issues/11375 and
+            // https://github.com/Microsoft/TypeScript/issues/2983
+            return {
+              done,
+              value,
+            };
+          },
+        };
+      },
+    };
+  }
+}
+export default RecordStore;

package/lib/internal/web/memidb/lib/binarySearch.js

@@ -0,0 +1,78 @@
+import cmp from './cmp.js';
+/**
+ * Classic binary search implementation. Returns the index where the key
+ * should be inserted, assuming the records list is ordered.
+ */
+function binarySearch(records, key) {
+  let low = 0;
+  let high = records.length;
+  let mid;
+  while (low < high) {
+    mid = (low + high) >>> 1; // like Math.floor((low + high) / 2) but fast
+    if (cmp(records[mid].key, key) < 0) {
+      low = mid + 1;
+    } else {
+      high = mid;
+    }
+  }
+  return low;
+}
+
+/**
+ * Equivalent to `records.findIndex(record => cmp(record.key, key) === 0)`
+ */
+export function getIndexByKey(records, key) {
+  const idx = binarySearch(records, key);
+  const record = records[idx];
+  if (record && cmp(record.key, key) === 0) {
+    return idx;
+  }
+  return -1;
+}
+
+/**
+ * Equivalent to `records.find(record => cmp(record.key, key) === 0)`
+ */
+export function getByKey(records, key) {
+  const idx = getIndexByKey(records, key);
+  return records[idx];
+}
+
+/**
+ * Equivalent to `records.findIndex(record => key.includes(record.key))`
+ */
+export function getIndexByKeyRange(records, keyRange) {
+  const lowerIdx =
+    typeof keyRange.lower === 'undefined' ? 0 : binarySearch(records, keyRange.lower);
+  const upperIdx =
+    typeof keyRange.upper === 'undefined'
+      ? records.length - 1
+      : binarySearch(records, keyRange.upper);
+  for (let i = lowerIdx; i <= upperIdx; i++) {
+    const record = records[i];
+    if (record && keyRange.includes(record.key)) {
+      return i;
+    }
+  }
+  return -1;
+}
+
+/**
+ * Equivalent to `records.find(record => key.includes(record.key))`
+ */
+export function getByKeyRange(records, keyRange) {
+  const idx = getIndexByKeyRange(records, keyRange);
+  return records[idx];
+}
+
+/**
+ * Equivalent to `records.findIndex(record => cmp(record.key, key) >= 0)`
+ */
+export function getIndexByKeyGTE(records, key) {
+  const idx = binarySearch(records, key);
+  const record = records[idx];
+  if (record && cmp(record.key, key) >= 0) {
+    return idx;
+  }
+  return -1;
+}

package/lib/internal/web/memidb/lib/canInjectKey.js

@@ -0,0 +1,25 @@
+// http://w3c.github.io/IndexedDB/#check-that-a-key-could-be-injected-into-a-value
+const canInjectKey = (keyPath, value) => {
+  if (Array.isArray(keyPath)) {
+    throw new Error(
+      'The key paths used in this section are always strings and never sequences, since it is not possible to create a object store which has a key generator and also has a key path that is a sequence.',
+    );
+  }
+  const identifiers = keyPath.split('.');
+  if (identifiers.length === 0) {
+    throw new Error('Assert: identifiers is not empty');
+  }
+  identifiers.pop();
+  for (const identifier of identifiers) {
+    if (typeof value !== 'object' && !Array.isArray(value)) {
+      return false;
+    }
+    const hop = Object.hasOwn(value, identifier);
+    if (!hop) {
+      return true;
+    }
+    value = value[identifier];
+  }
+  return typeof value === 'object' || Array.isArray(value);
+};
+export default canInjectKey;

package/lib/internal/web/memidb/lib/cmp.js

@@ -0,0 +1,77 @@
+import { DataError } from './errors.js';
+import valueToKey from './valueToKey.js';
+const getType = x => {
+  if (typeof x === 'number') {
+    return 'Number';
+  }
+  if (Object.prototype.toString.call(x) === '[object Date]') {
+    return 'Date';
+  }
+  if (Array.isArray(x)) {
+    return 'Array';
+  }
+  if (typeof x === 'string') {
+    return 'String';
+  }
+  if (x instanceof ArrayBuffer) {
+    return 'Binary';
+  }
+  throw new DataError();
+};
+
+// https://w3c.github.io/IndexedDB/#compare-two-keys
+const cmp = (first, second) => {
+  if (second === undefined) {
+    throw new TypeError();
+  }
+  first = valueToKey(first);
+  second = valueToKey(second);
+  const t1 = getType(first);
+  const t2 = getType(second);
+  if (t1 !== t2) {
+    if (t1 === 'Array') {
+      return 1;
+    }
+    if (t1 === 'Binary' && (t2 === 'String' || t2 === 'Date' || t2 === 'Number')) {
+      return 1;
+    }
+    if (t1 === 'String' && (t2 === 'Date' || t2 === 'Number')) {
+      return 1;
+    }
+    if (t1 === 'Date' && t2 === 'Number') {
+      return 1;
+    }
+    return -1;
+  }
+  if (t1 === 'Binary') {
+    first = new Uint8Array(first);
+    second = new Uint8Array(second);
+  }
+  if (t1 === 'Array' || t1 === 'Binary') {
+    const length = Math.min(first.length, second.length);
+    for (let i = 0; i < length; i++) {
+      const result = cmp(first[i], second[i]);
+      if (result !== 0) {
+        return result;
+      }
+    }
+    if (first.length > second.length) {
+      return 1;
+    }
+    if (first.length < second.length) {
+      return -1;
+    }
+    return 0;
+  }
+  if (t1 === 'Date') {
+    if (first.getTime() === second.getTime()) {
+      return 0;
+    }
+  } else {
+    if (first === second) {
+      return 0;
+    }
+  }
+  return first > second ? 1 : -1;
+};
+export default cmp;

package/lib/internal/web/memidb/lib/enforceRange.js

@@ -0,0 +1,13 @@
+// https://heycam.github.io/webidl/#EnforceRange
+
+const enforceRange = (num, type) => {
+  const min = 0;
+  const max = type === 'unsigned long' ? 4294967295 : 9007199254740991;
+  if (isNaN(num) || num < min || num > max) {
+    throw new TypeError();
+  }
+  if (num >= 0) {
+    return Math.floor(num);
+  }
+};
+export default enforceRange;

package/lib/internal/web/memidb/lib/errors.js

@@ -0,0 +1,69 @@
+const messages = {
+  AbortError: 'A request was aborted, for example through a call to IDBTransaction.abort.',
+  ConstraintError:
+    'A mutation operation in the transaction failed because a constraint was not satisfied. For example, an object such as an object store or index already exists and a request attempted to create a new one.',
+  DataCloneError:
+    'The data being stored could not be cloned by the internal structured cloning algorithm.',
+  DataError: 'Data provided to an operation does not meet requirements.',
+  InvalidAccessError:
+    'An invalid operation was performed on an object. For example transaction creation attempt was made, but an empty scope was provided.',
+  InvalidStateError:
+    'An operation was called on an object on which it is not allowed or at a time when it is not allowed. Also occurs if a request is made on a source object that has been deleted or removed. Use TransactionInactiveError or ReadOnlyError when possible, as they are more specific variations of InvalidStateError.',
+  NotFoundError:
+    'The operation failed because the requested database object could not be found. For example, an object store did not exist but was being opened.',
+  ReadOnlyError: 'The mutating operation was attempted in a "readonly" transaction.',
+  TransactionInactiveError:
+    'A request was placed against a transaction which is currently not active, or which is finished.',
+  VersionError:
+    'An attempt was made to open a database using a lower version than the existing version.',
+};
+export class AbortError extends DOMException {
+  constructor(message = messages.AbortError) {
+    super(message, 'AbortError');
+  }
+}
+export class ConstraintError extends DOMException {
+  constructor(message = messages.ConstraintError) {
+    super(message, 'ConstraintError');
+  }
+}
+export class DataCloneError extends DOMException {
+  constructor(message = messages.DataCloneError) {
+    super(message, 'DataCloneError');
+  }
+}
+export class DataError extends DOMException {
+  constructor(message = messages.DataError) {
+    super(message, 'DataError');
+  }
+}
+export class InvalidAccessError extends DOMException {
+  constructor(message = messages.InvalidAccessError) {
+    super(message, 'InvalidAccessError');
+  }
+}
+export class InvalidStateError extends DOMException {
+  constructor(message = messages.InvalidStateError) {
+    super(message, 'InvalidStateError');
+  }
+}
+export class NotFoundError extends DOMException {
+  constructor(message = messages.NotFoundError) {
+    super(message, 'NotFoundError');
+  }
+}
+export class ReadOnlyError extends DOMException {
+  constructor(message = messages.ReadOnlyError) {
+    super(message, 'ReadOnlyError');
+  }
+}
+export class TransactionInactiveError extends DOMException {
+  constructor(message = messages.TransactionInactiveError) {
+    super(message, 'TransactionInactiveError');
+  }
+}
+export class VersionError extends DOMException {
+  constructor(message = messages.VersionError) {
+    super(message, 'VersionError');
+  }
+}

package/lib/internal/web/memidb/lib/extractKey.js

@@ -0,0 +1,39 @@
+import valueToKey from './valueToKey.js';
+
+// http://www.w3.org/TR/2015/REC-IndexedDB-20150108/#dfn-steps-for-extracting-a-key-from-a-value-using-a-key-path
+const extractKey = (keyPath, value) => {
+  if (Array.isArray(keyPath)) {
+    const result = [];
+    for (let item of keyPath) {
+      // This doesn't make sense to me based on the spec, but it is needed to pass the W3C KeyPath tests (see same
+      // comment in validateKeyPath)
+      if (item !== undefined && item !== null && typeof item !== 'string' && item.toString) {
+        item = item.toString();
+      }
+      result.push(valueToKey(extractKey(item, value)));
+    }
+    return result;
+  }
+  if (keyPath === '') {
+    return value;
+  }
+  let remainingKeyPath = keyPath;
+  let object = value;
+  while (remainingKeyPath !== null) {
+    let identifier;
+    const i = remainingKeyPath.indexOf('.');
+    if (i >= 0) {
+      identifier = remainingKeyPath.slice(0, i);
+      remainingKeyPath = remainingKeyPath.slice(i + 1);
+    } else {
+      identifier = remainingKeyPath;
+      remainingKeyPath = null;
+    }
+    if (object === undefined || object === null || !Object.hasOwn(object, identifier)) {
+      return;
+    }
+    object = object[identifier];
+  }
+  return object;
+};
+export default extractKey;

package/lib/internal/web/memidb/lib/scheduling.js

@@ -0,0 +1,30 @@
+// When running within Node.js (including jsdom), we want to use setImmediate
+// (which runs immediately) rather than setTimeout (which enforces a minimum
+// delay of 1ms, and on Windows only has a resolution of 15ms or so).  jsdom
+// doesn't provide setImmediate (to better match the browser environment) and
+// sandboxes scripts, but its sandbox is by necessity imperfect, so we can break
+// out of it:
+//
+// - https://github.com/jsdom/jsdom#executing-scripts
+// - https://github.com/jsdom/jsdom/issues/2729
+// - https://github.com/scala-js/scala-js-macrotask-executor/pull/17
+function getSetImmediateFromJsdom() {
+  if (typeof navigator !== 'undefined' && /jsdom/.test(navigator.userAgent)) {
+    const outerRealmFunctionConstructor = Node.constructor;
+    return new outerRealmFunctionConstructor('return setImmediate')();
+  } else {
+    return undefined;
+  }
+}
+
+// Schedules a task to run later.  Use Node.js's setImmediate if available and
+// setTimeout otherwise.  Note that options like process.nextTick or
+// queueMicrotask will likely not work: IndexedDB semantics require that
+// transactions are marked as not active when the event loop runs. The next
+// tick queue and microtask queue run within the current event loop macrotask,
+// so they'd process database operations too quickly.
+export const queueTask = fn => {
+  const setImmediate =
+    globalThis.setImmediate || getSetImmediateFromJsdom() || (fn => setTimeout(fn, 0));
+  setImmediate(fn);
+};

package/lib/internal/web/memidb/lib/types.js

@@ -0,0 +1 @@
+export {};