@firebase/database 0.13.10 → 0.14.0

package/dist/node-esm/index.node.esm.js

@@ -1250,7 +1250,7 @@ WebSocketConnection.responsesRequiredToBeHealthy = 2;
 WebSocketConnection.healthyTimeout = 30000;
 
 const name = "@firebase/database";
-const version = "0.13.10";
+const version = "0.14.0";
 
 /**
  * @license
@@ -2266,7 +2266,7 @@ class Connection {
         this.lastSessionId = lastSessionId;
         this.connectionCount = 0;
         this.pendingDataMessages = [];
-        this.state_ = 0 /* CONNECTING */;
+        this.state_ = 0 /* RealtimeState.CONNECTING */;
         this.log_ = logWrapper('c:' + this.id + ':');
         this.transportManager_ = new TransportManager(repoInfo_);
         this.log_('Connection created');
@@ -2346,7 +2346,7 @@ class Connection {
     }
     connReceiver_(conn) {
         return (message) => {
-            if (this.state_ !== 2 /* DISCONNECTED */) {
+            if (this.state_ !== 2 /* RealtimeState.DISCONNECTED */) {
                 if (conn === this.rx_) {
                     this.onPrimaryMessageReceived_(message);
                 }
@@ -2512,7 +2512,7 @@ class Connection {
         this.sessionId = handshake.s;
         this.repoInfo_.host = host;
         // if we've already closed the connection, then don't bother trying to progress further
-        if (this.state_ === 0 /* CONNECTING */) {
+        if (this.state_ === 0 /* RealtimeState.CONNECTING */) {
             this.conn_.start();
             this.onConnectionEstablished_(this.conn_, timestamp);
             if (PROTOCOL_VERSION !== version) {
@@ -2550,7 +2550,7 @@ class Connection {
         this.repoInfo_.host = host;
         // TODO: if we're already "connected", we need to trigger a disconnect at the next layer up.
         // We don't currently support resets after the connection has already been established
-        if (this.state_ === 1 /* CONNECTED */) {
+        if (this.state_ === 1 /* RealtimeState.CONNECTED */) {
             this.close();
         }
         else {
@@ -2562,7 +2562,7 @@ class Connection {
     onConnectionEstablished_(conn, timestamp) {
         this.log_('Realtime connection established.');
         this.conn_ = conn;
-        this.state_ = 1 /* CONNECTED */;
+        this.state_ = 1 /* RealtimeState.CONNECTED */;
         if (this.onReady_) {
             this.onReady_(timestamp, this.sessionId);
             this.onReady_ = null;
@@ -2581,7 +2581,7 @@ class Connection {
     }
     sendPingOnPrimaryIfNecessary_() {
         // If the connection isn't considered healthy yet, we'll send a noop ping packet request.
-        if (!this.isHealthy_ && this.state_ === 1 /* CONNECTED */) {
+        if (!this.isHealthy_ && this.state_ === 1 /* RealtimeState.CONNECTED */) {
             this.log_('sending ping on primary.');
             this.sendData_({ t: 'c', d: { t: PING, d: {} } });
         }
@@ -2602,7 +2602,7 @@ class Connection {
         this.conn_ = null;
         // NOTE: IF you're seeing a Firefox error for this line, I think it might be because it's getting
         // called on window close and RealtimeState.CONNECTING is no longer defined.  Just a guess.
-        if (!everConnected && this.state_ === 0 /* CONNECTING */) {
+        if (!everConnected && this.state_ === 0 /* RealtimeState.CONNECTING */) {
             this.log_('Realtime connection failed.');
             // Since we failed to connect at all, clear any cached entry for this namespace in case the machine went away
             if (this.repoInfo_.isCacheableHost()) {
@@ -2611,7 +2611,7 @@ class Connection {
                 this.repoInfo_.internalHost = this.repoInfo_.host;
             }
         }
-        else if (this.state_ === 1 /* CONNECTED */) {
+        else if (this.state_ === 1 /* RealtimeState.CONNECTED */) {
             this.log_('Realtime connection lost.');
         }
         this.close();
@@ -2628,7 +2628,7 @@ class Connection {
         this.close();
     }
     sendData_(data) {
-        if (this.state_ !== 1 /* CONNECTED */) {
+        if (this.state_ !== 1 /* RealtimeState.CONNECTED */) {
             throw 'Connection is not connected';
         }
         else {
@@ -2639,9 +2639,9 @@ class Connection {
      * Cleans up this connection, calling the appropriate callbacks
      */
     close() {
-        if (this.state_ !== 2 /* DISCONNECTED */) {
+        if (this.state_ !== 2 /* RealtimeState.DISCONNECTED */) {
             this.log_('Closing realtime connection.');
-            this.state_ = 2 /* DISCONNECTED */;
+            this.state_ = 2 /* RealtimeState.DISCONNECTED */;
             this.closeConnections_();
             if (this.onDisconnect_) {
                 this.onDisconnect_();
@@ -5955,153 +5955,6 @@ class ValueIndex extends Index {
 }
 const VALUE_INDEX = new ValueIndex();
 
-/**
- * @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.
- */
-// Modeled after base64 web-safe chars, but ordered by ASCII.
-const PUSH_CHARS = '-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz';
-const MIN_PUSH_CHAR = '-';
-const MAX_PUSH_CHAR = 'z';
-const MAX_KEY_LEN = 786;
-/**
- * Fancy ID generator that creates 20-character string identifiers with the
- * following properties:
- *
- * 1. They're based on timestamp so that they sort *after* any existing ids.
- * 2. They contain 72-bits of random data after the timestamp so that IDs won't
- *    collide with other clients' IDs.
- * 3. They sort *lexicographically* (so the timestamp is converted to characters
- *    that will sort properly).
- * 4. They're monotonically increasing. Even if you generate more than one in
- *    the same timestamp, the latter ones will sort after the former ones. We do
- *    this by using the previous random bits but "incrementing" them by 1 (only
- *    in the case of a timestamp collision).
- */
-const nextPushId = (function () {
-    // Timestamp of last push, used to prevent local collisions if you push twice
-    // in one ms.
-    let lastPushTime = 0;
-    // We generate 72-bits of randomness which get turned into 12 characters and
-    // appended to the timestamp to prevent collisions with other clients. We
-    // store the last characters we generated because in the event of a collision,
-    // we'll use those same characters except "incremented" by one.
-    const lastRandChars = [];
-    return function (now) {
-        const duplicateTime = now === lastPushTime;
-        lastPushTime = now;
-        let i;
-        const timeStampChars = new Array(8);
-        for (i = 7; i >= 0; i--) {
-            timeStampChars[i] = PUSH_CHARS.charAt(now % 64);
-            // NOTE: Can't use << here because javascript will convert to int and lose
-            // the upper bits.
-            now = Math.floor(now / 64);
-        }
-        assert(now === 0, 'Cannot push at time == 0');
-        let id = timeStampChars.join('');
-        if (!duplicateTime) {
-            for (i = 0; i < 12; i++) {
-                lastRandChars[i] = Math.floor(Math.random() * 64);
-            }
-        }
-        else {
-            // If the timestamp hasn't changed since last push, use the same random
-            // number, except incremented by 1.
-            for (i = 11; i >= 0 && lastRandChars[i] === 63; i--) {
-                lastRandChars[i] = 0;
-            }
-            lastRandChars[i]++;
-        }
-        for (i = 0; i < 12; i++) {
-            id += PUSH_CHARS.charAt(lastRandChars[i]);
-        }
-        assert(id.length === 20, 'nextPushId: Length should be 20.');
-        return id;
-    };
-})();
-const 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;
-    }
-    const keyAsInt = tryParseInt(key);
-    if (keyAsInt != null) {
-        return '' + (keyAsInt + 1);
-    }
-    const next = new Array(key.length);
-    for (let i = 0; i < next.length; i++) {
-        next[i] = key.charAt(i);
-    }
-    if (next.length < MAX_KEY_LEN) {
-        next.push(MIN_PUSH_CHAR);
-        return next.join('');
-    }
-    let 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;
-    }
-    const source = next[i];
-    const 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.
-const predecessor = function (key) {
-    if (key === '' + INTEGER_32_MIN) {
-        return MIN_NAME;
-    }
-    const keyAsInt = tryParseInt(key);
-    if (keyAsInt != null) {
-        return '' + (keyAsInt - 1);
-    }
-    const next = new Array(key.length);
-    for (let 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
  * Copyright 2017 Google LLC
@@ -6119,24 +5972,24 @@ const predecessor = function (key) {
  * limitations under the License.
  */
 function changeValue(snapshotNode) {
-    return { type: "value" /* VALUE */, snapshotNode };
+    return { type: "value" /* ChangeType.VALUE */, snapshotNode };
 }
 function changeChildAdded(childName, snapshotNode) {
-    return { type: "child_added" /* CHILD_ADDED */, snapshotNode, childName };
+    return { type: "child_added" /* ChangeType.CHILD_ADDED */, snapshotNode, childName };
 }
 function changeChildRemoved(childName, snapshotNode) {
-    return { type: "child_removed" /* CHILD_REMOVED */, snapshotNode, childName };
+    return { type: "child_removed" /* ChangeType.CHILD_REMOVED */, snapshotNode, childName };
 }
 function changeChildChanged(childName, snapshotNode, oldSnap) {
     return {
-        type: "child_changed" /* CHILD_CHANGED */,
+        type: "child_changed" /* ChangeType.CHILD_CHANGED */,
         snapshotNode,
         childName,
         oldSnap
     };
 }
 function changeChildMoved(childName, snapshotNode) {
-    return { type: "child_moved" /* CHILD_MOVED */, snapshotNode, childName };
+    return { type: "child_moved" /* ChangeType.CHILD_MOVED */, snapshotNode, childName };
 }
 
 /**
@@ -6270,6 +6123,8 @@ class RangedFilter {
         this.index_ = params.getIndex();
         this.startPost_ = RangedFilter.getStartPost_(params);
         this.endPost_ = RangedFilter.getEndPost_(params);
+        this.startIsInclusive_ = !params.startAfterSet_;
+        this.endIsInclusive_ = !params.endBeforeSet_;
     }
     getStartPost() {
         return this.startPost_;
@@ -6278,8 +6133,13 @@ class RangedFilter {
         return this.endPost_;
     }
     matches(node) {
-        return (this.index_.compare(this.getStartPost(), node) <= 0 &&
-            this.index_.compare(node, this.getEndPost()) <= 0);
+        const isWithinStart = this.startIsInclusive_
+            ? this.index_.compare(this.getStartPost(), node) <= 0
+            : this.index_.compare(this.getStartPost(), node) < 0;
+        const isWithinEnd = this.endIsInclusive_
+            ? this.index_.compare(node, this.getEndPost()) <= 0
+            : this.index_.compare(node, this.getEndPost()) < 0;
+        return isWithinStart && isWithinEnd;
     }
     updateChild(snap, key, newChild, affectedPath, source, optChangeAccumulator) {
         if (!this.matches(new NamedNode(key, newChild))) {
@@ -6357,10 +6217,22 @@ class RangedFilter {
  */
 class LimitedFilter {
     constructor(params) {
+        this.withinDirectionalStart = (node) => this.reverse_ ? this.withinEndPost(node) : this.withinStartPost(node);
+        this.withinDirectionalEnd = (node) => this.reverse_ ? this.withinStartPost(node) : this.withinEndPost(node);
+        this.withinStartPost = (node) => {
+            const compareRes = this.index_.compare(this.rangedFilter_.getStartPost(), node);
+            return this.startIsInclusive_ ? compareRes <= 0 : compareRes < 0;
+        };
+        this.withinEndPost = (node) => {
+            const compareRes = this.index_.compare(node, this.rangedFilter_.getEndPost());
+            return this.endIsInclusive_ ? compareRes <= 0 : compareRes < 0;
+        };
         this.rangedFilter_ = new RangedFilter(params);
         this.index_ = params.getIndex();
         this.limit_ = params.getLimit();
         this.reverse_ = !params.isViewFromLeft();
+        this.startIsInclusive_ = !params.startAfterSet_;
+        this.endIsInclusive_ = !params.endBeforeSet_;
     }
     updateChild(snap, key, newChild, affectedPath, source, optChangeAccumulator) {
         if (!this.rangedFilter_.matches(new NamedNode(key, newChild))) {
@@ -6401,23 +6273,18 @@ class LimitedFilter {
                 let count = 0;
                 while (iterator.hasNext() && count < this.limit_) {
                     const next = iterator.getNext();
-                    let inRange;
-                    if (this.reverse_) {
-                        inRange =
-                            this.index_.compare(this.rangedFilter_.getStartPost(), next) <= 0;
+                    if (!this.withinDirectionalStart(next)) {
+                        // if we have not reached the start, skip to the next element
+                        continue;
                     }
-                    else {
-                        inRange =
-                            this.index_.compare(next, this.rangedFilter_.getEndPost()) <= 0;
+                    else if (!this.withinDirectionalEnd(next)) {
+                        // if we have reached the end, stop adding elements
+                        break;
                     }
-                    if (inRange) {
+                    else {
                         filtered = filtered.updateImmediateChild(next.name, next.node);
                         count++;
                     }
-                    else {
-                        // if we have reached the end post, we cannot keep adding elemments
-                        break;
-                    }
                 }
             }
             else {
@@ -6425,32 +6292,19 @@ class LimitedFilter {
                 filtered = newSnap.withIndex(this.index_);
                 // Don't support priorities on queries
                 filtered = filtered.updatePriority(ChildrenNode.EMPTY_NODE);
-                let startPost;
-                let endPost;
-                let cmp;
                 let iterator;
                 if (this.reverse_) {
                     iterator = filtered.getReverseIterator(this.index_);
-                    startPost = this.rangedFilter_.getEndPost();
-                    endPost = this.rangedFilter_.getStartPost();
-                    const indexCompare = this.index_.getCompare();
-                    cmp = (a, b) => indexCompare(b, a);
                 }
                 else {
                     iterator = filtered.getIterator(this.index_);
-                    startPost = this.rangedFilter_.getStartPost();
-                    endPost = this.rangedFilter_.getEndPost();
-                    cmp = this.index_.getCompare();
                 }
                 let count = 0;
-                let foundStartPost = false;
                 while (iterator.hasNext()) {
                     const next = iterator.getNext();
-                    if (!foundStartPost && cmp(startPost, next) <= 0) {
-                        // start adding
-                        foundStartPost = true;
-                    }
-                    const inRange = foundStartPost && count < this.limit_ && cmp(next, endPost) <= 0;
+                    const inRange = count < this.limit_ &&
+                        this.withinDirectionalStart(next) &&
+                        this.withinDirectionalEnd(next);
                     if (inRange) {
                         count++;
                     }
@@ -6581,10 +6435,10 @@ class QueryParams {
         this.limitSet_ = false;
         this.startSet_ = false;
         this.startNameSet_ = false;
-        this.startAfterSet_ = false;
+        this.startAfterSet_ = false; // can only be true if startSet_ is true
         this.endSet_ = false;
         this.endNameSet_ = false;
-        this.endBeforeSet_ = false;
+        this.endBeforeSet_ = false; // can only be true if endSet_ is true
         this.limit_ = 0;
         this.viewFrom_ = '';
         this.indexStartValue_ = null;
@@ -6596,12 +6450,6 @@ class QueryParams {
     hasStart() {
         return this.startSet_;
     }
-    hasStartAfter() {
-        return this.startAfterSet_;
-    }
-    hasEndBefore() {
-        return this.endBeforeSet_;
-    }
     /**
      * @returns True if it would return from left.
      */
@@ -6614,7 +6462,7 @@ class QueryParams {
             return this.startSet_;
         }
         else {
-            return this.viewFrom_ === "l" /* VIEW_FROM_LEFT */;
+            return this.viewFrom_ === "l" /* WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT */;
         }
     }
     /**
@@ -6690,10 +6538,12 @@ class QueryParams {
         copy.limitSet_ = this.limitSet_;
         copy.limit_ = this.limit_;
         copy.startSet_ = this.startSet_;
+        copy.startAfterSet_ = this.startAfterSet_;
         copy.indexStartValue_ = this.indexStartValue_;
         copy.startNameSet_ = this.startNameSet_;
         copy.indexStartName_ = this.indexStartName_;
         copy.endSet_ = this.endSet_;
+        copy.endBeforeSet_ = this.endBeforeSet_;
         copy.indexEndValue_ = this.indexEndValue_;
         copy.endNameSet_ = this.endNameSet_;
         copy.indexEndName_ = this.indexEndName_;
@@ -6717,14 +6567,14 @@ function queryParamsLimitToFirst(queryParams, newLimit) {
     const newParams = queryParams.copy();
     newParams.limitSet_ = true;
     newParams.limit_ = newLimit;
-    newParams.viewFrom_ = "l" /* VIEW_FROM_LEFT */;
+    newParams.viewFrom_ = "l" /* WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT */;
     return newParams;
 }
 function queryParamsLimitToLast(queryParams, newLimit) {
     const newParams = queryParams.copy();
     newParams.limitSet_ = true;
     newParams.limit_ = newLimit;
-    newParams.viewFrom_ = "r" /* VIEW_FROM_RIGHT */;
+    newParams.viewFrom_ = "r" /* WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_RIGHT */;
     return newParams;
 }
 function queryParamsStartAt(queryParams, indexValue, key) {
@@ -6746,21 +6596,11 @@ function queryParamsStartAt(queryParams, indexValue, key) {
 }
 function queryParamsStartAfter(queryParams, indexValue, key) {
     let params;
-    if (queryParams.index_ === KEY_INDEX) {
-        if (typeof indexValue === 'string') {
-            indexValue = successor(indexValue);
-        }
+    if (queryParams.index_ === KEY_INDEX || !!key) {
         params = queryParamsStartAt(queryParams, indexValue, key);
     }
     else {
-        let childKey;
-        if (key == null) {
-            childKey = MAX_NAME;
-        }
-        else {
-            childKey = successor(key);
-        }
-        params = queryParamsStartAt(queryParams, indexValue, childKey);
+        params = queryParamsStartAt(queryParams, indexValue, MAX_NAME);
     }
     params.startAfterSet_ = true;
     return params;
@@ -6783,22 +6623,12 @@ function queryParamsEndAt(queryParams, indexValue, key) {
     return newParams;
 }
 function queryParamsEndBefore(queryParams, indexValue, key) {
-    let childKey;
     let params;
-    if (queryParams.index_ === KEY_INDEX) {
-        if (typeof indexValue === 'string') {
-            indexValue = predecessor(indexValue);
-        }
+    if (queryParams.index_ === KEY_INDEX || !!key) {
         params = queryParamsEndAt(queryParams, indexValue, key);
     }
     else {
-        if (key == null) {
-            childKey = MIN_NAME;
-        }
-        else {
-            childKey = predecessor(key);
-        }
-        params = queryParamsEndAt(queryParams, indexValue, childKey);
+        params = queryParamsEndAt(queryParams, indexValue, MIN_NAME);
     }
     params.endBeforeSet_ = true;
     return params;
@@ -6820,39 +6650,43 @@ function queryParamsToRestQueryStringParameters(queryParams) {
     }
     let orderBy;
     if (queryParams.index_ === PRIORITY_INDEX) {
-        orderBy = "$priority" /* PRIORITY_INDEX */;
+        orderBy = "$priority" /* REST_QUERY_CONSTANTS.PRIORITY_INDEX */;
     }
     else if (queryParams.index_ === VALUE_INDEX) {
-        orderBy = "$value" /* VALUE_INDEX */;
+        orderBy = "$value" /* REST_QUERY_CONSTANTS.VALUE_INDEX */;
     }
     else if (queryParams.index_ === KEY_INDEX) {
-        orderBy = "$key" /* KEY_INDEX */;
+        orderBy = "$key" /* REST_QUERY_CONSTANTS.KEY_INDEX */;
     }
     else {
         assert(queryParams.index_ instanceof PathIndex, 'Unrecognized index type!');
         orderBy = queryParams.index_.toString();
     }
-    qs["orderBy" /* ORDER_BY */] = stringify(orderBy);
+    qs["orderBy" /* REST_QUERY_CONSTANTS.ORDER_BY */] = stringify(orderBy);
     if (queryParams.startSet_) {
-        qs["startAt" /* START_AT */] = stringify(queryParams.indexStartValue_);
+        const startParam = queryParams.startAfterSet_
+            ? "startAfter" /* REST_QUERY_CONSTANTS.START_AFTER */
+            : "startAt" /* REST_QUERY_CONSTANTS.START_AT */;
+        qs[startParam] = stringify(queryParams.indexStartValue_);
         if (queryParams.startNameSet_) {
-            qs["startAt" /* START_AT */] +=
-                ',' + stringify(queryParams.indexStartName_);
+            qs[startParam] += ',' + stringify(queryParams.indexStartName_);
         }
     }
     if (queryParams.endSet_) {
-        qs["endAt" /* END_AT */] = stringify(queryParams.indexEndValue_);
+        const endParam = queryParams.endBeforeSet_
+            ? "endBefore" /* REST_QUERY_CONSTANTS.END_BEFORE */
+            : "endAt" /* REST_QUERY_CONSTANTS.END_AT */;
+        qs[endParam] = stringify(queryParams.indexEndValue_);
         if (queryParams.endNameSet_) {
-            qs["endAt" /* END_AT */] +=
-                ',' + stringify(queryParams.indexEndName_);
+            qs[endParam] += ',' + stringify(queryParams.indexEndName_);
         }
     }
     if (queryParams.limitSet_) {
         if (queryParams.isViewFromLeft()) {
-            qs["limitToFirst" /* LIMIT_TO_FIRST */] = queryParams.limit_;
+            qs["limitToFirst" /* REST_QUERY_CONSTANTS.LIMIT_TO_FIRST */] = queryParams.limit_;
         }
         else {
-            qs["limitToLast" /* LIMIT_TO_LAST */] = queryParams.limit_;
+            qs["limitToLast" /* REST_QUERY_CONSTANTS.LIMIT_TO_LAST */] = queryParams.limit_;
         }
     }
     return qs;
@@ -6860,35 +6694,39 @@ function queryParamsToRestQueryStringParameters(queryParams) {
 function queryParamsGetQueryObject(queryParams) {
     const obj = {};
     if (queryParams.startSet_) {
-        obj["sp" /* INDEX_START_VALUE */] =
+        obj["sp" /* WIRE_PROTOCOL_CONSTANTS.INDEX_START_VALUE */] =
             queryParams.indexStartValue_;
         if (queryParams.startNameSet_) {
-            obj["sn" /* INDEX_START_NAME */] =
+            obj["sn" /* WIRE_PROTOCOL_CONSTANTS.INDEX_START_NAME */] =
                 queryParams.indexStartName_;
         }
+        obj["sin" /* WIRE_PROTOCOL_CONSTANTS.INDEX_START_IS_INCLUSIVE */] =
+            !queryParams.startAfterSet_;
     }
     if (queryParams.endSet_) {
-        obj["ep" /* INDEX_END_VALUE */] = queryParams.indexEndValue_;
+        obj["ep" /* WIRE_PROTOCOL_CONSTANTS.INDEX_END_VALUE */] = queryParams.indexEndValue_;
         if (queryParams.endNameSet_) {
-            obj["en" /* INDEX_END_NAME */] = queryParams.indexEndName_;
+            obj["en" /* WIRE_PROTOCOL_CONSTANTS.INDEX_END_NAME */] = queryParams.indexEndName_;
         }
+        obj["ein" /* WIRE_PROTOCOL_CONSTANTS.INDEX_END_IS_INCLUSIVE */] =
+            !queryParams.endBeforeSet_;
     }
     if (queryParams.limitSet_) {
-        obj["l" /* LIMIT */] = queryParams.limit_;
+        obj["l" /* WIRE_PROTOCOL_CONSTANTS.LIMIT */] = queryParams.limit_;
         let viewFrom = queryParams.viewFrom_;
         if (viewFrom === '') {
             if (queryParams.isViewFromLeft()) {
-                viewFrom = "l" /* VIEW_FROM_LEFT */;
+                viewFrom = "l" /* WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT */;
             }
             else {
-                viewFrom = "r" /* VIEW_FROM_RIGHT */;
+                viewFrom = "r" /* WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_RIGHT */;
             }
         }
-        obj["vf" /* VIEW_FROM */] = viewFrom;
+        obj["vf" /* WIRE_PROTOCOL_CONSTANTS.VIEW_FROM */] = viewFrom;
     }
     // For now, priority index is the default, so we only specify if it's some other index
     if (queryParams.index_ !== PRIORITY_INDEX) {
-        obj["i" /* INDEX */] = queryParams.index_.toString();
+        obj["i" /* WIRE_PROTOCOL_CONSTANTS.INDEX */] = queryParams.index_.toString();
     }
     return obj;
 }
@@ -7632,16 +7470,16 @@ function eventGeneratorGenerateEventsForChanges(eventGenerator, changes, eventCa
     const events = [];
     const moves = [];
     changes.forEach(change => {
-        if (change.type === "child_changed" /* CHILD_CHANGED */ &&
+        if (change.type === "child_changed" /* ChangeType.CHILD_CHANGED */ &&
             eventGenerator.index_.indexedValueChanged(change.oldSnap, change.snapshotNode)) {
             moves.push(changeChildMoved(change.childName, change.snapshotNode));
         }
     });
-    eventGeneratorGenerateEventsForType(eventGenerator, events, "child_removed" /* CHILD_REMOVED */, changes, eventRegistrations, eventCache);
-    eventGeneratorGenerateEventsForType(eventGenerator, events, "child_added" /* CHILD_ADDED */, changes, eventRegistrations, eventCache);
-    eventGeneratorGenerateEventsForType(eventGenerator, events, "child_moved" /* CHILD_MOVED */, moves, eventRegistrations, eventCache);
-    eventGeneratorGenerateEventsForType(eventGenerator, events, "child_changed" /* CHILD_CHANGED */, changes, eventRegistrations, eventCache);
-    eventGeneratorGenerateEventsForType(eventGenerator, events, "value" /* VALUE */, changes, eventRegistrations, eventCache);
+    eventGeneratorGenerateEventsForType(eventGenerator, events, "child_removed" /* ChangeType.CHILD_REMOVED */, changes, eventRegistrations, eventCache);
+    eventGeneratorGenerateEventsForType(eventGenerator, events, "child_added" /* ChangeType.CHILD_ADDED */, changes, eventRegistrations, eventCache);
+    eventGeneratorGenerateEventsForType(eventGenerator, events, "child_moved" /* ChangeType.CHILD_MOVED */, moves, eventRegistrations, eventCache);
+    eventGeneratorGenerateEventsForType(eventGenerator, events, "child_changed" /* ChangeType.CHILD_CHANGED */, changes, eventRegistrations, eventCache);
+    eventGeneratorGenerateEventsForType(eventGenerator, events, "value" /* ChangeType.VALUE */, changes, eventRegistrations, eventCache);
     return events;
 }
 /**
@@ -8722,31 +8560,31 @@ class ChildChangeAccumulator {
     trackChildChange(change) {
         const type = change.type;
         const childKey = change.childName;
-        assert(type === "child_added" /* CHILD_ADDED */ ||
-            type === "child_changed" /* CHILD_CHANGED */ ||
-            type === "child_removed" /* CHILD_REMOVED */, 'Only child changes supported for tracking');
+        assert(type === "child_added" /* ChangeType.CHILD_ADDED */ ||
+            type === "child_changed" /* ChangeType.CHILD_CHANGED */ ||
+            type === "child_removed" /* ChangeType.CHILD_REMOVED */, 'Only child changes supported for tracking');
         assert(childKey !== '.priority', 'Only non-priority child changes can be tracked.');
         const oldChange = this.changeMap.get(childKey);
         if (oldChange) {
             const oldType = oldChange.type;
-            if (type === "child_added" /* CHILD_ADDED */ &&
-                oldType === "child_removed" /* CHILD_REMOVED */) {
+            if (type === "child_added" /* ChangeType.CHILD_ADDED */ &&
+                oldType === "child_removed" /* ChangeType.CHILD_REMOVED */) {
                 this.changeMap.set(childKey, changeChildChanged(childKey, change.snapshotNode, oldChange.snapshotNode));
             }
-            else if (type === "child_removed" /* CHILD_REMOVED */ &&
-                oldType === "child_added" /* CHILD_ADDED */) {
+            else if (type === "child_removed" /* ChangeType.CHILD_REMOVED */ &&
+                oldType === "child_added" /* ChangeType.CHILD_ADDED */) {
                 this.changeMap.delete(childKey);
             }
-            else if (type === "child_removed" /* CHILD_REMOVED */ &&
-                oldType === "child_changed" /* CHILD_CHANGED */) {
+            else if (type === "child_removed" /* ChangeType.CHILD_REMOVED */ &&
+                oldType === "child_changed" /* ChangeType.CHILD_CHANGED */) {
                 this.changeMap.set(childKey, changeChildRemoved(childKey, oldChange.oldSnap));
             }
-            else if (type === "child_changed" /* CHILD_CHANGED */ &&
-                oldType === "child_added" /* CHILD_ADDED */) {
+            else if (type === "child_changed" /* ChangeType.CHILD_CHANGED */ &&
+                oldType === "child_added" /* ChangeType.CHILD_ADDED */) {
                 this.changeMap.set(childKey, changeChildAdded(childKey, change.snapshotNode));
             }
-            else if (type === "child_changed" /* CHILD_CHANGED */ &&
-                oldType === "child_changed" /* CHILD_CHANGED */) {
+            else if (type === "child_changed" /* ChangeType.CHILD_CHANGED */ &&
+                oldType === "child_changed" /* ChangeType.CHILD_CHANGED */) {
                 this.changeMap.set(childKey, changeChildChanged(childKey, change.snapshotNode, oldChange.oldSnap));
             }
             else {
@@ -11456,7 +11294,7 @@ function repoStartTransaction(repo, path, transactionUpdate, onComplete, unwatch
     else {
         validateFirebaseData('transaction failed: Data returned ', newVal, transaction.path);
         // Mark as run and add to our queue.
-        transaction.status = 0 /* RUN */;
+        transaction.status = 0 /* TransactionStatus.RUN */;
         const queueNode = treeSubTree(repo.transactionQueueTree_, path);
         const nodeQueue = treeGetValue(queueNode) || [];
         nodeQueue.push(transaction);
@@ -11514,7 +11352,7 @@ function repoSendReadyTransactions(repo, node = repo.transactionQueueTree_) {
     if (treeGetValue(node)) {
         const queue = repoBuildTransactionQueue(repo, node);
         assert(queue.length > 0, 'Sending zero length transaction queue');
-        const allRun = queue.every((transaction) => transaction.status === 0 /* RUN */);
+        const allRun = queue.every((transaction) => transaction.status === 0 /* TransactionStatus.RUN */);
         // If they're all run (and not sent), we can send them.  Else, we must wait.
         if (allRun) {
             repoSendTransactionQueue(repo, treeGetPath(node), queue);
@@ -11543,8 +11381,8 @@ function repoSendTransactionQueue(repo, path, queue) {
     const latestHash = latestState.hash();
     for (let i = 0; i < queue.length; i++) {
         const txn = queue[i];
-        assert(txn.status === 0 /* RUN */, 'tryToSendTransactionQueue_: items in queue should all be run.');
-        txn.status = 1 /* SENT */;
+        assert(txn.status === 0 /* TransactionStatus.RUN */, 'tryToSendTransactionQueue_: items in queue should all be run.');
+        txn.status = 1 /* TransactionStatus.SENT */;
         txn.retryCount++;
         const relativePath = newRelativePath(path, txn.path);
         // If we've gotten to this point, the output snapshot must be defined.
@@ -11565,7 +11403,7 @@ function repoSendTransactionQueue(repo, path, queue) {
             // transactions or sets.
             const callbacks = [];
             for (let i = 0; i < queue.length; i++) {
-                queue[i].status = 2 /* COMPLETED */;
+                queue[i].status = 2 /* TransactionStatus.COMPLETED */;
                 events = events.concat(syncTreeAckUserWrite(repo.serverSyncTree_, queue[i].currentWriteId));
                 if (queue[i].onComplete) {
                     // We never unset the output snapshot, and given that this
@@ -11588,18 +11426,18 @@ function repoSendTransactionQueue(repo, path, queue) {
             // transactions are no longer sent.  Update their status appropriately.
             if (status === 'datastale') {
                 for (let i = 0; i < queue.length; i++) {
-                    if (queue[i].status === 3 /* SENT_NEEDS_ABORT */) {
-                        queue[i].status = 4 /* NEEDS_ABORT */;
+                    if (queue[i].status === 3 /* TransactionStatus.SENT_NEEDS_ABORT */) {
+                        queue[i].status = 4 /* TransactionStatus.NEEDS_ABORT */;
                     }
                     else {
-                        queue[i].status = 0 /* RUN */;
+                        queue[i].status = 0 /* TransactionStatus.RUN */;
                     }
                 }
             }
             else {
                 warn('transaction at ' + pathToSend.toString() + ' failed: ' + status);
                 for (let i = 0; i < queue.length; i++) {
-                    queue[i].status = 4 /* NEEDS_ABORT */;
+                    queue[i].status = 4 /* TransactionStatus.NEEDS_ABORT */;
                     queue[i].abortReason = status;
                 }
             }
@@ -11643,7 +11481,7 @@ function repoRerunTransactionQueue(repo, queue, path) {
     let events = [];
     // Ignore all of the sets we're going to re-run.
     const txnsToRerun = queue.filter(q => {
-        return q.status === 0 /* RUN */;
+        return q.status === 0 /* TransactionStatus.RUN */;
     });
     const setsToIgnore = txnsToRerun.map(q => {
         return q.currentWriteId;
@@ -11653,12 +11491,12 @@ function repoRerunTransactionQueue(repo, queue, path) {
         const relativePath = newRelativePath(path, transaction.path);
         let abortTransaction = false, abortReason;
         assert(relativePath !== null, 'rerunTransactionsUnderNode_: relativePath should not be null.');
-        if (transaction.status === 4 /* NEEDS_ABORT */) {
+        if (transaction.status === 4 /* TransactionStatus.NEEDS_ABORT */) {
             abortTransaction = true;
             abortReason = transaction.abortReason;
             events = events.concat(syncTreeAckUserWrite(repo.serverSyncTree_, transaction.currentWriteId, true));
         }
-        else if (transaction.status === 0 /* RUN */) {
+        else if (transaction.status === 0 /* TransactionStatus.RUN */) {
             if (transaction.retryCount >= MAX_TRANSACTION_RETRIES) {
                 abortTransaction = true;
                 abortReason = 'maxretry';
@@ -11701,7 +11539,7 @@ function repoRerunTransactionQueue(repo, queue, path) {
         events = [];
         if (abortTransaction) {
             // Abort.
-            queue[i].status = 2 /* COMPLETED */;
+            queue[i].status = 2 /* TransactionStatus.COMPLETED */;
             // Removing a listener can trigger pruning which can muck with
             // mergedData/visibleData (as it prunes data). So defer the unwatcher
             // until we're done.
@@ -11782,7 +11620,7 @@ function repoPruneCompletedTransactionsBelowNode(repo, node) {
     if (queue) {
         let to = 0;
         for (let from = 0; from < queue.length; from++) {
-            if (queue[from].status !== 2 /* COMPLETED */) {
+            if (queue[from].status !== 2 /* TransactionStatus.COMPLETED */) {
                 queue[to] = queue[from];
                 to++;
             }
@@ -11830,16 +11668,16 @@ function repoAbortTransactionsOnNode(repo, node) {
         let events = [];
         let lastSent = -1;
         for (let i = 0; i < queue.length; i++) {
-            if (queue[i].status === 3 /* SENT_NEEDS_ABORT */) ;
-            else if (queue[i].status === 1 /* SENT */) {
+            if (queue[i].status === 3 /* TransactionStatus.SENT_NEEDS_ABORT */) ;
+            else if (queue[i].status === 1 /* TransactionStatus.SENT */) {
                 assert(lastSent === i - 1, 'All SENT items should be at beginning of queue.');
                 lastSent = i;
                 // Mark transaction for abort when it comes back.
-                queue[i].status = 3 /* SENT_NEEDS_ABORT */;
+                queue[i].status = 3 /* TransactionStatus.SENT_NEEDS_ABORT */;
                 queue[i].abortReason = 'set';
             }
             else {
-                assert(queue[i].status === 0 /* RUN */, 'Unexpected transaction status in abort');
+                assert(queue[i].status === 0 /* TransactionStatus.RUN */, 'Unexpected transaction status in abort');
                 // We can abort it immediately.
                 queue[i].unwatcher();
                 events = events.concat(syncTreeAckUserWrite(repo.serverSyncTree_, queue[i].currentWriteId, true));
@@ -12009,6 +11847,81 @@ const parseDatabaseURL = function (dataURL) {
     };
 };
 
+/**
+ * @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.
+ */
+// Modeled after base64 web-safe chars, but ordered by ASCII.
+const PUSH_CHARS = '-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz';
+/**
+ * Fancy ID generator that creates 20-character string identifiers with the
+ * following properties:
+ *
+ * 1. They're based on timestamp so that they sort *after* any existing ids.
+ * 2. They contain 72-bits of random data after the timestamp so that IDs won't
+ *    collide with other clients' IDs.
+ * 3. They sort *lexicographically* (so the timestamp is converted to characters
+ *    that will sort properly).
+ * 4. They're monotonically increasing. Even if you generate more than one in
+ *    the same timestamp, the latter ones will sort after the former ones. We do
+ *    this by using the previous random bits but "incrementing" them by 1 (only
+ *    in the case of a timestamp collision).
+ */
+const nextPushId = (function () {
+    // Timestamp of last push, used to prevent local collisions if you push twice
+    // in one ms.
+    let lastPushTime = 0;
+    // We generate 72-bits of randomness which get turned into 12 characters and
+    // appended to the timestamp to prevent collisions with other clients. We
+    // store the last characters we generated because in the event of a collision,
+    // we'll use those same characters except "incremented" by one.
+    const lastRandChars = [];
+    return function (now) {
+        const duplicateTime = now === lastPushTime;
+        lastPushTime = now;
+        let i;
+        const timeStampChars = new Array(8);
+        for (i = 7; i >= 0; i--) {
+            timeStampChars[i] = PUSH_CHARS.charAt(now % 64);
+            // NOTE: Can't use << here because javascript will convert to int and lose
+            // the upper bits.
+            now = Math.floor(now / 64);
+        }
+        assert(now === 0, 'Cannot push at time == 0');
+        let id = timeStampChars.join('');
+        if (!duplicateTime) {
+            for (i = 0; i < 12; i++) {
+                lastRandChars[i] = Math.floor(Math.random() * 64);
+            }
+        }
+        else {
+            // If the timestamp hasn't changed since last push, use the same random
+            // number, except incremented by 1.
+            for (i = 11; i >= 0 && lastRandChars[i] === 63; i--) {
+                lastRandChars[i] = 0;
+            }
+            lastRandChars[i]++;
+        }
+        for (i = 0; i < 12; i++) {
+            id += PUSH_CHARS.charAt(lastRandChars[i]);
+        }
+        assert(id.length === 20, 'nextPushId: Length should be 20.');
+        return id;
+    };
+})();
+
 /**
  * @license
  * Copyright 2017 Google LLC
@@ -13817,7 +13730,7 @@ function registerDatabase(variant) {
         const authProvider = container.getProvider('auth-internal');
         const appCheckProvider = container.getProvider('app-check-internal');
         return repoManagerDatabaseFromApp(app, authProvider, appCheckProvider, url);
-    }, "PUBLIC" /* PUBLIC */).setMultipleInstances(true));
+    }, "PUBLIC" /* ComponentType.PUBLIC */).setMultipleInstances(true));
     registerVersion(name, version, variant);
     // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation
     registerVersion(name, version, 'esm2017');