@firebase/database 0.8.3-canary.f7e30543a → 0.8.3

package/dist/index.d.ts

@@ -1,19 +1,3 @@
-/**
- * @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.
- */
 import { FirebaseNamespace } from '@firebase/app-types';
 import { Database } from './src/api/Database';
 import { Query } from './src/api/Query';

package/dist/index.esm.js

@@ -658,14 +658,6 @@ var errorForServerCode = function (code, query) {
  * @private
  */
 var INTEGER_REGEXP_ = new RegExp('^-?(0*)\\d{1,10}$');
-/**
- * For use in keys, the minimum possible 32-bit integer.
- */
-var INTEGER_32_MIN = -2147483648;
-/**
- * For use in kyes, the maximum possible 32-bit integer.
- */
-var INTEGER_32_MAX = 2147483647;
 /**
  * If the string contains a 32-bit integer, return it.  Else return null.
  * @param {!string} str
@@ -674,7 +666,7 @@ var INTEGER_32_MAX = 2147483647;
 var tryParseInt = function (str) {
     if (INTEGER_REGEXP_.test(str)) {
         var intVal = Number(str);
-        if (intVal >= INTEGER_32_MIN && intVal <= INTEGER_32_MAX) {
+        if (intVal >= -2147483648 && intVal <= 2147483647) {
             return intVal;
         }
     }
@@ -1875,11 +1867,6 @@ var TransactionResult = /** @class */ (function () {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-// Modeled after base64 web-safe chars, but ordered by ASCII.
-var PUSH_CHARS = '-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz';
-var MIN_PUSH_CHAR = '-';
-var MAX_PUSH_CHAR = 'z';
-var MAX_KEY_LEN = 786;
 /**
  * Fancy ID generator that creates 20-character string identifiers with the
  * following properties:
@@ -1895,6 +1882,8 @@ var MAX_KEY_LEN = 786;
  *    in the case of a timestamp collision).
  */
 var nextPushId = (function () {
+    // Modeled after base64 web-safe chars, but ordered by ASCII.
+    var PUSH_CHARS = '-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz';
     // Timestamp of last push, used to prevent local collisions if you push twice
     // in one ms.
     var lastPushTime = 0;
@@ -1935,76 +1924,7 @@ var nextPushId = (function () {
         assert(id.length === 20, 'nextPushId: Length should be 20.');
         return id;
     };
-})();
-var successor = function (key) {
-    if (key === '' + INTEGER_32_MAX) {
-        // See https://firebase.google.com/docs/database/web/lists-of-data#data-order
-        return MIN_PUSH_CHAR;
-    }
-    var keyAsInt = tryParseInt(key);
-    if (keyAsInt != null) {
-        return '' + (keyAsInt + 1);
-    }
-    var next = new Array(key.length);
-    for (var i_1 = 0; i_1 < next.length; i_1++) {
-        next[i_1] = key.charAt(i_1);
-    }
-    if (next.length < MAX_KEY_LEN) {
-        next.push(MIN_PUSH_CHAR);
-        return next.join('');
-    }
-    var i = next.length - 1;
-    while (i >= 0 && next[i] === MAX_PUSH_CHAR) {
-        i--;
-    }
-    // `successor` was called on the largest possible key, so return the
-    // MAX_NAME, which sorts larger than all keys.
-    if (i === -1) {
-        return MAX_NAME;
-    }
-    var source = next[i];
-    var sourcePlusOne = PUSH_CHARS.charAt(PUSH_CHARS.indexOf(source) + 1);
-    next[i] = sourcePlusOne;
-    return next.slice(0, i + 1).join('');
-};
-// `key` is assumed to be non-empty.
-var predecessor = function (key) {
-    if (key === '' + INTEGER_32_MIN) {
-        return MIN_NAME;
-    }
-    var keyAsInt = tryParseInt(key);
-    if (keyAsInt != null) {
-        return '' + (keyAsInt - 1);
-    }
-    var next = new Array(key.length);
-    for (var i = 0; i < next.length; i++) {
-        next[i] = key.charAt(i);
-    }
-    // If `key` ends in `MIN_PUSH_CHAR`, the largest key lexicographically
-    // smaller than `key`, is `key[0:key.length - 1]`. The next key smaller
-    // than that, `predecessor(predecessor(key))`, is
-    //
-    // `key[0:key.length - 2] + (key[key.length - 1] - 1) + \
-    //   { MAX_PUSH_CHAR repeated MAX_KEY_LEN - (key.length - 1) times }
-    //
-    // analogous to increment/decrement for base-10 integers.
-    //
-    // This works because lexigographic comparison works character-by-character,
-    // using length as a tie-breaker if one key is a prefix of the other.
-    if (next[next.length - 1] === MIN_PUSH_CHAR) {
-        if (next.length === 1) {
-            // See https://firebase.google.com/docs/database/web/lists-of-data#orderbykey
-            return '' + INTEGER_32_MAX;
-        }
-        delete next[next.length - 1];
-        return next.join('');
-    }
-    // Replace the last character with it's immediate predecessor, and
-    // fill the suffix of the key with MAX_PUSH_CHAR. This is the
-    // lexicographically largest possible key smaller than `key`.
-    next[next.length - 1] = PUSH_CHARS.charAt(PUSH_CHARS.indexOf(next[next.length - 1]) - 1);
-    return next.join('') + MAX_PUSH_CHAR.repeat(MAX_KEY_LEN - next.length);
-};
+})();
 
 /**
  * @license
@@ -4843,8 +4763,7 @@ var Query = /** @class */ (function () {
                 'or equalTo() must be a string.';
             if (params.hasStart()) {
                 var startName = params.getIndexStartName();
-                if (startName !== MIN_NAME &&
-                    !(params.hasStartAfter() && startName === MAX_NAME)) {
+                if (startName !== MIN_NAME) {
                     throw new Error(tooManyArgsError);
                 }
                 else if (typeof startNode !== 'string') {
@@ -4853,8 +4772,7 @@ var Query = /** @class */ (function () {
             }
             if (params.hasEnd()) {
                 var endName = params.getIndexEndName();
-                if (endName !== MAX_NAME &&
-                    !(params.hasEndBefore() && endName === MIN_NAME)) {
+                if (endName !== MAX_NAME) {
                     throw new Error(tooManyArgsError);
                 }
                 else if (typeof endNode !== 'string') {
@@ -5155,20 +5073,6 @@ var Query = /** @class */ (function () {
         }
         return new Query(this.repo, this.path, newParams, this.orderByCalled_);
     };
-    Query.prototype.startAfter = function (value, name) {
-        if (value === void 0) { value = null; }
-        validateArgCount('Query.startAfter', 0, 2, arguments.length);
-        validateFirebaseDataArg('Query.startAfter', 1, value, this.path, false);
-        validateKey('Query.startAfter', 2, name, true);
-        var newParams = this.queryParams_.startAfter(value, name);
-        Query.validateLimit_(newParams);
-        Query.validateQueryEndpoints_(newParams);
-        if (this.queryParams_.hasStart()) {
-            throw new Error('Query.startAfter: Starting point was already set (by another call to startAt, startAfter ' +
-                'or equalTo).');
-        }
-        return new Query(this.repo, this.path, newParams, this.orderByCalled_);
-    };
     /**
      * @param {number|string|boolean|null} value
      * @param {?string=} name
@@ -5183,21 +5087,7 @@ var Query = /** @class */ (function () {
         Query.validateLimit_(newParams);
         Query.validateQueryEndpoints_(newParams);
         if (this.queryParams_.hasEnd()) {
-            throw new Error('Query.endAt: Ending point was already set (by another call to endAt, endBefore, or ' +
-                'equalTo).');
-        }
-        return new Query(this.repo, this.path, newParams, this.orderByCalled_);
-    };
-    Query.prototype.endBefore = function (value, name) {
-        if (value === void 0) { value = null; }
-        validateArgCount('Query.endBefore', 0, 2, arguments.length);
-        validateFirebaseDataArg('Query.endBefore', 1, value, this.path, false);
-        validateKey('Query.endBefore', 2, name, true);
-        var newParams = this.queryParams_.endBefore(value, name);
-        Query.validateLimit_(newParams);
-        Query.validateQueryEndpoints_(newParams);
-        if (this.queryParams_.hasEnd()) {
-            throw new Error('Query.endBefore: Ending point was already set (by another call to endAt, endBefore, or ' +
+            throw new Error('Query.endAt: Ending point was already set (by another call to endAt or ' +
                 'equalTo).');
         }
         return new Query(this.repo, this.path, newParams, this.orderByCalled_);
@@ -12875,31 +12765,44 @@ var Repo = /** @class */ (function () {
      * The purpose of `getValue` is to return the latest known value
      * satisfying `query`.
      *
-     * This method will first check for in-memory cached values
-     * belonging to active listeners. If they are found, such values
-     * are considered to be the most up-to-date.
+     * If the client is connected, this method will send a request
+     * to the server. If the client is not connected, then either:
+     *
+     * 1. The client was once connected, but not anymore.
+     * 2. The client has never connected, this is the first operation
+     *    this repo is handling.
      *
-     * If the client is not connected, this method will try to
-     * establish a connection and request the value for `query`. If
-     * the client is not able to retrieve the query result, it reports
-     * an error.
+     * In case (1), it's possible that the client still has an active
+     * listener, with cached data. Since this is the latest known
+     * value satisfying the query, that's what getValue will return.
+     * If there is no cached data, `getValue` surfaces an "offline"
+     * error.
+     *
+     * In case (2), `getValue` will trigger a time-limited connection
+     * attempt. If the client is unable to connect to the server, it
+     * will surface an "offline" error because there cannot be any
+     * cached data. On the other hand, if the client is able to connect,
+     * `getValue` will return the server's value for the query, if one
+     * exists.
      *
      * @param query - The query to surface a value for.
      */
     Repo.prototype.getValue = function (query) {
         var _this = this;
-        // Only active queries are cached. There is no persisted cache.
-        var cached = this.serverSyncTree_.calcCompleteEventCache(query.path);
-        if (!cached.isEmpty()) {
-            return Promise.resolve(new DataSnapshot(cached, query.getRef(), query.getQueryParams().getIndex()));
-        }
         return this.server_.get(query).then(function (payload) {
             var node = nodeFromJSON$1(payload);
             var events = _this.serverSyncTree_.applyServerOverwrite(query.path, node);
             _this.eventQueue_.raiseEventsAtPath(query.path, events);
             return Promise.resolve(new DataSnapshot(node, query.getRef(), query.getQueryParams().getIndex()));
         }, function (err) {
-            _this.log_('get for query ' + stringify(query) + ' failed: ' + err);
+            _this.log_('get for query ' +
+                stringify(query) +
+                ' falling back to cache after error: ' +
+                err);
+            var cached = _this.serverSyncTree_.calcCompleteEventCache(query.path);
+            if (!cached.isEmpty()) {
+                return Promise.resolve(new DataSnapshot(cached, query.getRef(), query.getQueryParams().getIndex()));
+            }
             return Promise.reject(new Error(err));
         });
     };
@@ -13555,10 +13458,8 @@ var QueryParams = /** @class */ (function () {
         this.limitSet_ = false;
         this.startSet_ = false;
         this.startNameSet_ = false;
-        this.startAfterSet_ = false;
         this.endSet_ = false;
         this.endNameSet_ = false;
-        this.endBeforeSet_ = false;
         this.limit_ = 0;
         this.viewFrom_ = '';
         this.indexStartValue_ = null;
@@ -13573,12 +13474,6 @@ var QueryParams = /** @class */ (function () {
     QueryParams.prototype.hasStart = function () {
         return this.startSet_;
     };
-    QueryParams.prototype.hasStartAfter = function () {
-        return this.startAfterSet_;
-    };
-    QueryParams.prototype.hasEndBefore = function () {
-        return this.endBeforeSet_;
-    };
     /**
      * @return {boolean} True if it would return from left.
      */
@@ -13745,18 +13640,6 @@ var QueryParams = /** @class */ (function () {
         }
         return newParams;
     };
-    QueryParams.prototype.startAfter = function (indexValue, key) {
-        var childKey;
-        if (key == null) {
-            childKey = MAX_NAME;
-        }
-        else {
-            childKey = successor(key);
-        }
-        var params = this.startAt(indexValue, childKey);
-        params.startAfterSet_ = true;
-        return params;
-    };
     /**
      * @param {*} indexValue
      * @param {?string=} key
@@ -13779,18 +13662,6 @@ var QueryParams = /** @class */ (function () {
         }
         return newParams;
     };
-    QueryParams.prototype.endBefore = function (indexValue, key) {
-        var childKey;
-        if (key == null) {
-            childKey = MIN_NAME;
-        }
-        else {
-            childKey = predecessor(key);
-        }
-        var params = this.endAt(indexValue, childKey);
-        params.endBeforeSet_ = true;
-        return params;
-    };
     /**
      * @param {!Index} index
      * @return {!QueryParams}
@@ -15681,7 +15552,7 @@ var TEST_ACCESS = /*#__PURE__*/Object.freeze({
 });
 
 var name = "@firebase/database";
-var version = "0.8.3-canary.f7e30543a";
+var version = "0.8.3";
 
 /**
  * @license