npm - immutable - Versions diffs - 4.0.0-rc.10 → 4.0.0-rc.15 - Mend

immutable 4.0.0-rc.10 → 4.0.0-rc.15

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (13) hide show

package/LICENSE +1 -1
package/README.md +174 -100
package/dist/immutable.d.ts +824 -528
package/dist/immutable.es.js +626 -509
package/dist/immutable.js +657 -531
package/dist/immutable.js.flow +937 -264
package/dist/immutable.min.js +53 -36
package/package.json +7 -11
package/contrib/cursor/README.md +0 -43
package/contrib/cursor/__tests__/Cursor.ts.skip +0 -395
package/contrib/cursor/index.d.ts +0 -287
package/contrib/cursor/index.js +0 -360
package/dist/immutable-nonambient.d.ts +0 -5333

package/dist/immutable.js CHANGED Viewed

@@ -1,17 +1,32 @@
 /**
- * Copyright (c) 2014-present, Facebook, Inc.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
+ * MIT License
+ *
+ * Copyright (c) 2014-present, Lee Byron and other contributors.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in all
+ * copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
  */
 (function (global, factory) {
   typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
   typeof define === 'function' && define.amd ? define(['exports'], factory) :
-  (factory((global.Immutable = {})));
+  (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.Immutable = {}));
 }(this, (function (exports) { 'use strict';
-  // Used for setting prototype methods that IE8 chokes on.
   var DELETE = 'delete';
   // Constants describing the size of trie nodes.
@@ -90,12 +105,12 @@
     return index === undefined
       ? defaultIndex
       : isNeg(index)
-        ? size === Infinity
-          ? size
-          : Math.max(0, size + index) | 0
-        : size === undefined || size === index
-          ? index
-          : Math.min(size, index) | 0;
+      ? size === Infinity
+        ? size
+        : Math.max(0, size + index) | 0
+      : size === undefined || size === index
+      ? index
+      : Math.min(size, index) | 0;
   }
   function isNeg(value) {
@@ -103,7 +118,6 @@
     return value < 0 || (value === 0 && 1 / value === -Infinity);
   }
-  // Note: value is unchanged to not break immutable-devtools.
   var IS_COLLECTION_SYMBOL = '@@__IMMUTABLE_ITERABLE__@@';
   function isCollection(maybeCollection) {
@@ -130,7 +144,7 @@
     return isCollection(value) ? value : Seq(value);
   };
-  var KeyedCollection = (function (Collection) {
+  var KeyedCollection = /*@__PURE__*/(function (Collection) {
     function KeyedCollection(value) {
       return isKeyed(value) ? value : KeyedSeq(value);
     }
@@ -142,7 +156,7 @@
     return KeyedCollection;
   }(Collection));
-  var IndexedCollection = (function (Collection) {
+  var IndexedCollection = /*@__PURE__*/(function (Collection) {
     function IndexedCollection(value) {
       return isIndexed(value) ? value : IndexedSeq(value);
     }
@@ -154,7 +168,7 @@
     return IndexedCollection;
   }(Collection));
-  var SetCollection = (function (Collection) {
+  var SetCollection = /*@__PURE__*/(function (Collection) {
     function SetCollection(value) {
       return isCollection(value) && !isAssociative(value) ? value : SetSeq(value);
     }
@@ -213,10 +227,10 @@
   Iterator.VALUES = ITERATE_VALUES;
   Iterator.ENTRIES = ITERATE_ENTRIES;
-  Iterator.prototype.inspect = Iterator.prototype.toSource = function() {
+  Iterator.prototype.inspect = Iterator.prototype.toSource = function () {
     return this.toString();
   };
-  Iterator.prototype[ITERATOR_SYMBOL] = function() {
+  Iterator.prototype[ITERATOR_SYMBOL] = function () {
     return this;
   };
@@ -236,6 +250,11 @@
   }
   function hasIterator(maybeIterable) {
+    if (Array.isArray(maybeIterable)) {
+      // IE11 trick as it does not support `Symbol.iterator`
+      return true;
+    }
     return !!getIteratorFn(maybeIterable);
   }
@@ -258,6 +277,16 @@
     }
   }
+  function isEntriesIterable(maybeIterable) {
+    var iteratorFn = getIteratorFn(maybeIterable);
+    return iteratorFn && iteratorFn === maybeIterable.entries;
+  }
+  function isKeysIterable(maybeIterable) {
+    var iteratorFn = getIteratorFn(maybeIterable);
+    return iteratorFn && iteratorFn === maybeIterable.keys;
+  }
   var hasOwnProperty = Object.prototype.hasOwnProperty;
   function isArrayLike(value) {
@@ -279,17 +308,17 @@
     );
   }
-  var Seq = (function (Collection$$1) {
+  var Seq = /*@__PURE__*/(function (Collection) {
     function Seq(value) {
       return value === null || value === undefined
         ? emptySequence()
         : isImmutable(value)
-          ? value.toSeq()
-          : seqFromValue(value);
+        ? value.toSeq()
+        : seqFromValue(value);
     }
-    if ( Collection$$1 ) Seq.__proto__ = Collection$$1;
-    Seq.prototype = Object.create( Collection$$1 && Collection$$1.prototype );
+    if ( Collection ) Seq.__proto__ = Collection;
+    Seq.prototype = Object.create( Collection && Collection.prototype );
     Seq.prototype.constructor = Seq;
     Seq.prototype.toSeq = function toSeq () {
@@ -311,15 +340,13 @@
     // abstract __iterateUncached(fn, reverse)
     Seq.prototype.__iterate = function __iterate (fn, reverse) {
-      var this$1 = this;
       var cache = this._cache;
       if (cache) {
         var size = cache.length;
         var i = 0;
         while (i !== size) {
           var entry = cache[reverse ? size - ++i : i++];
-          if (fn(entry[1], entry[0], this$1) === false) {
+          if (fn(entry[1], entry[0], this) === false) {
             break;
           }
         }
@@ -349,17 +376,17 @@
     return Seq;
   }(Collection));
-  var KeyedSeq = (function (Seq) {
+  var KeyedSeq = /*@__PURE__*/(function (Seq) {
     function KeyedSeq(value) {
       return value === null || value === undefined
         ? emptySequence().toKeyedSeq()
         : isCollection(value)
-          ? isKeyed(value)
-            ? value.toSeq()
-            : value.fromEntrySeq()
-          : isRecord(value)
-            ? value.toSeq()
-            : keyedSeqFromValue(value);
+        ? isKeyed(value)
+          ? value.toSeq()
+          : value.fromEntrySeq()
+        : isRecord(value)
+        ? value.toSeq()
+        : keyedSeqFromValue(value);
     }
     if ( Seq ) KeyedSeq.__proto__ = Seq;
@@ -373,17 +400,17 @@
     return KeyedSeq;
   }(Seq));
-  var IndexedSeq = (function (Seq) {
+  var IndexedSeq = /*@__PURE__*/(function (Seq) {
     function IndexedSeq(value) {
       return value === null || value === undefined
         ? emptySequence()
         : isCollection(value)
-          ? isKeyed(value)
-            ? value.entrySeq()
-            : value.toIndexedSeq()
-          : isRecord(value)
-            ? value.toSeq().entrySeq()
-            : indexedSeqFromValue(value);
+        ? isKeyed(value)
+          ? value.entrySeq()
+          : value.toIndexedSeq()
+        : isRecord(value)
+        ? value.toSeq().entrySeq()
+        : indexedSeqFromValue(value);
     }
     if ( Seq ) IndexedSeq.__proto__ = Seq;
@@ -405,11 +432,10 @@
     return IndexedSeq;
   }(Seq));
-  var SetSeq = (function (Seq) {
+  var SetSeq = /*@__PURE__*/(function (Seq) {
     function SetSeq(value) {
-      return (isCollection(value) && !isAssociative(value)
-        ? value
-        : IndexedSeq(value)
+      return (
+        isCollection(value) && !isAssociative(value) ? value : IndexedSeq(value)
       ).toSetSeq();
     }
@@ -437,7 +463,7 @@
   // #pragma Root Sequences
-  var ArraySeq = (function (IndexedSeq) {
+  var ArraySeq = /*@__PURE__*/(function (IndexedSeq) {
     function ArraySeq(array) {
       this._array = array;
       this.size = array.length;
@@ -452,14 +478,12 @@
     };
     ArraySeq.prototype.__iterate = function __iterate (fn, reverse) {
-      var this$1 = this;
       var array = this._array;
       var size = array.length;
       var i = 0;
       while (i !== size) {
         var ii = reverse ? size - ++i : i++;
-        if (fn(array[ii], ii, this$1) === false) {
+        if (fn(array[ii], ii, this) === false) {
           break;
         }
       }
@@ -482,7 +506,7 @@
     return ArraySeq;
   }(IndexedSeq));
-  var ObjectSeq = (function (KeyedSeq) {
+  var ObjectSeq = /*@__PURE__*/(function (KeyedSeq) {
     function ObjectSeq(object) {
       var keys = Object.keys(object);
       this._object = object;
@@ -506,15 +530,13 @@
     };
     ObjectSeq.prototype.__iterate = function __iterate (fn, reverse) {
-      var this$1 = this;
       var object = this._object;
       var keys = this._keys;
       var size = keys.length;
       var i = 0;
       while (i !== size) {
         var key = keys[reverse ? size - ++i : i++];
-        if (fn(object[key], key, this$1) === false) {
+        if (fn(object[key], key, this) === false) {
           break;
         }
       }
@@ -539,7 +561,7 @@
   }(KeyedSeq));
   ObjectSeq.prototype[IS_ORDERED_SYMBOL] = true;
-  var CollectionSeq = (function (IndexedSeq) {
+  var CollectionSeq = /*@__PURE__*/(function (IndexedSeq) {
     function CollectionSeq(collection) {
       this._collection = collection;
       this.size = collection.length || collection.size;
@@ -550,8 +572,6 @@
     CollectionSeq.prototype.constructor = CollectionSeq;
     CollectionSeq.prototype.__iterateUncached = function __iterateUncached (fn, reverse) {
-      var this$1 = this;
       if (reverse) {
         return this.cacheResult().__iterate(fn, reverse);
       }
@@ -561,7 +581,7 @@
       if (isIterator(iterator)) {
         var step;
         while (!(step = iterator.next()).done) {
-          if (fn(step.value, iterations++, this$1) === false) {
+          if (fn(step.value, iterations++, this) === false) {
             break;
           }
         }
@@ -597,11 +617,7 @@
   }
   function keyedSeqFromValue(value) {
-    var seq = Array.isArray(value)
-      ? new ArraySeq(value)
-      : hasIterator(value)
-        ? new CollectionSeq(value)
-        : undefined;
+    var seq = maybeIndexedSeqFromValue(value);
     if (seq) {
       return seq.fromEntrySeq();
     }
@@ -627,7 +643,11 @@
   function seqFromValue(value) {
     var seq = maybeIndexedSeqFromValue(value);
     if (seq) {
-      return seq;
+      return isEntriesIterable(value)
+        ? seq.fromEntrySeq()
+        : isKeysIterable(value)
+        ? seq.toSetSeq()
+        : seq;
     }
     if (typeof value === 'object') {
       return new ObjectSeq(value);
@@ -641,8 +661,8 @@
     return isArrayLike(value)
       ? new ArraySeq(value)
       : hasIterator(value)
-        ? new CollectionSeq(value)
-        : undefined;
+      ? new CollectionSeq(value)
+      : undefined;
   }
   var IS_MAP_SYMBOL = '@@__IMMUTABLE_MAP__@@';
@@ -764,50 +784,67 @@
     return ((i32 >>> 1) & 0x40000000) | (i32 & 0xbfffffff);
   }
+  var defaultValueOf = Object.prototype.valueOf;
   function hash(o) {
-    if (o === false || o === null || o === undefined) {
-      return 0;
-    }
-    if (typeof o.valueOf === 'function') {
-      o = o.valueOf();
-      if (o === false || o === null || o === undefined) {
-        return 0;
-      }
-    }
-    if (o === true) {
-      return 1;
-    }
-    var type = typeof o;
-    if (type === 'number') {
-      if (o !== o || o === Infinity) {
-        return 0;
-      }
-      var h = o | 0;
-      if (h !== o) {
-        h ^= o * 0xffffffff;
-      }
-      while (o > 0xffffffff) {
-        o /= 0xffffffff;
-        h ^= o;
-      }
-      return smi(h);
-    }
-    if (type === 'string') {
-      return o.length > STRING_HASH_CACHE_MIN_STRLEN
-        ? cachedHashString(o)
-        : hashString(o);
+    if (o == null) {
+      return hashNullish(o);
     }
     if (typeof o.hashCode === 'function') {
       // Drop any high bits from accidentally long hash codes.
-      return smi(o.hashCode());
+      return smi(o.hashCode(o));
+    }
+    var v = valueOf(o);
+    if (v == null) {
+      return hashNullish(v);
+    }
+    switch (typeof v) {
+      case 'boolean':
+        // The hash values for built-in constants are a 1 value for each 5-byte
+        // shift region expect for the first, which encodes the value. This
+        // reduces the odds of a hash collision for these common values.
+        return v ? 0x42108421 : 0x42108420;
+      case 'number':
+        return hashNumber(v);
+      case 'string':
+        return v.length > STRING_HASH_CACHE_MIN_STRLEN
+          ? cachedHashString(v)
+          : hashString(v);
+      case 'object':
+      case 'function':
+        return hashJSObj(v);
+      case 'symbol':
+        return hashSymbol(v);
+      default:
+        if (typeof v.toString === 'function') {
+          return hashString(v.toString());
+        }
+        throw new Error('Value type ' + typeof v + ' cannot be hashed.');
     }
-    if (type === 'object' || type === 'function') {
-      return hashJSObj(o);
+  }
+  function hashNullish(nullish) {
+    return nullish === null ? 0x42108422 : /* undefined */ 0x42108423;
+  }
+  // Compress arbitrarily large numbers into smi hashes.
+  function hashNumber(n) {
+    if (n !== n || n === Infinity) {
+      return 0;
+    }
+    var hash = n | 0;
+    if (hash !== n) {
+      hash ^= n * 0xffffffff;
     }
-    if (typeof o.toString === 'function') {
-      return hashString(o.toString());
+    while (n > 0xffffffff) {
+      n /= 0xffffffff;
+      hash ^= n;
     }
-    throw new Error('Value type ' + type + ' cannot be hashed.');
+    return smi(hash);
   }
   function cachedHashString(string) {
@@ -839,6 +876,19 @@
     return smi(hashed);
   }
+  function hashSymbol(sym) {
+    var hashed = symbolMap[sym];
+    if (hashed !== undefined) {
+      return hashed;
+    }
+    hashed = nextHash();
+    symbolMap[sym] = hashed;
+    return hashed;
+  }
   function hashJSObj(obj) {
     var hashed;
     if (usingWeakMap) {
@@ -865,10 +915,7 @@
       }
     }
-    hashed = ++objHashUID;
-    if (objHashUID & 0x40000000) {
-      objHashUID = 0;
-    }
+    hashed = nextHash();
     if (usingWeakMap) {
       weakMap.set(obj, hashed);
@@ -889,7 +936,7 @@
       // we'll hijack one of the less-used non-enumerable properties to
       // save our hash on it. Since this is a function it will not show up in
       // `JSON.stringify` which is what we want.
-      obj.propertyIsEnumerable = function() {
+      obj.propertyIsEnumerable = function () {
         return this.constructor.prototype.propertyIsEnumerable.apply(
           this,
           arguments
@@ -913,7 +960,7 @@
   var isExtensible = Object.isExtensible;
   // True if Object.defineProperty works as expected. IE8 fails this test.
-  var canDefineProperty = (function() {
+  var canDefineProperty = (function () {
     try {
       Object.defineProperty({}, '@', {});
       return true;
@@ -935,6 +982,20 @@
     }
   }
+  function valueOf(obj) {
+    return obj.valueOf !== defaultValueOf && typeof obj.valueOf === 'function'
+      ? obj.valueOf(obj)
+      : obj;
+  }
+  function nextHash() {
+    var nextHash = ++_objHashUID;
+    if (_objHashUID & 0x40000000) {
+      _objHashUID = 0;
+    }
+    return nextHash;
+  }
   // If possible, use a WeakMap.
   var usingWeakMap = typeof WeakMap === 'function';
   var weakMap;
@@ -942,7 +1003,9 @@
     weakMap = new WeakMap();
   }
-  var objHashUID = 0;
+  var symbolMap = Object.create(null);
+  var _objHashUID = 0;
   var UID_HASH_KEY = '__immutablehash__';
   if (typeof Symbol === 'function') {
@@ -954,15 +1017,15 @@
   var STRING_HASH_CACHE_SIZE = 0;
   var stringHashCache = {};
-  var ToKeyedSequence = (function (KeyedSeq$$1) {
+  var ToKeyedSequence = /*@__PURE__*/(function (KeyedSeq) {
     function ToKeyedSequence(indexed, useKeys) {
       this._iter = indexed;
       this._useKeys = useKeys;
       this.size = indexed.size;
     }
-    if ( KeyedSeq$$1 ) ToKeyedSequence.__proto__ = KeyedSeq$$1;
-    ToKeyedSequence.prototype = Object.create( KeyedSeq$$1 && KeyedSeq$$1.prototype );
+    if ( KeyedSeq ) ToKeyedSequence.__proto__ = KeyedSeq;
+    ToKeyedSequence.prototype = Object.create( KeyedSeq && KeyedSeq.prototype );
     ToKeyedSequence.prototype.constructor = ToKeyedSequence;
     ToKeyedSequence.prototype.get = function get (key, notSetValue) {
@@ -978,29 +1041,29 @@
     };
     ToKeyedSequence.prototype.reverse = function reverse () {
-      var this$1 = this;
+      var this$1$1 = this;
       var reversedSequence = reverseFactory(this, true);
       if (!this._useKeys) {
-        reversedSequence.valueSeq = function () { return this$1._iter.toSeq().reverse(); };
+        reversedSequence.valueSeq = function () { return this$1$1._iter.toSeq().reverse(); };
       }
       return reversedSequence;
     };
     ToKeyedSequence.prototype.map = function map (mapper, context) {
-      var this$1 = this;
+      var this$1$1 = this;
       var mappedSequence = mapFactory(this, mapper, context);
       if (!this._useKeys) {
-        mappedSequence.valueSeq = function () { return this$1._iter.toSeq().map(mapper, context); };
+        mappedSequence.valueSeq = function () { return this$1$1._iter.toSeq().map(mapper, context); };
       }
       return mappedSequence;
     };
     ToKeyedSequence.prototype.__iterate = function __iterate (fn, reverse) {
-      var this$1 = this;
+      var this$1$1 = this;
-      return this._iter.__iterate(function (v, k) { return fn(v, k, this$1); }, reverse);
+      return this._iter.__iterate(function (v, k) { return fn(v, k, this$1$1); }, reverse);
     };
     ToKeyedSequence.prototype.__iterator = function __iterator (type, reverse) {
@@ -1011,14 +1074,14 @@
   }(KeyedSeq));
   ToKeyedSequence.prototype[IS_ORDERED_SYMBOL] = true;
-  var ToIndexedSequence = (function (IndexedSeq$$1) {
+  var ToIndexedSequence = /*@__PURE__*/(function (IndexedSeq) {
     function ToIndexedSequence(iter) {
       this._iter = iter;
       this.size = iter.size;
     }
-    if ( IndexedSeq$$1 ) ToIndexedSequence.__proto__ = IndexedSeq$$1;
-    ToIndexedSequence.prototype = Object.create( IndexedSeq$$1 && IndexedSeq$$1.prototype );
+    if ( IndexedSeq ) ToIndexedSequence.__proto__ = IndexedSeq;
+    ToIndexedSequence.prototype = Object.create( IndexedSeq && IndexedSeq.prototype );
     ToIndexedSequence.prototype.constructor = ToIndexedSequence;
     ToIndexedSequence.prototype.includes = function includes (value) {
@@ -1026,18 +1089,18 @@
     };
     ToIndexedSequence.prototype.__iterate = function __iterate (fn, reverse) {
-      var this$1 = this;
+      var this$1$1 = this;
       var i = 0;
       reverse && ensureSize(this);
       return this._iter.__iterate(
-        function (v) { return fn(v, reverse ? this$1.size - ++i : i++, this$1); },
+        function (v) { return fn(v, reverse ? this$1$1.size - ++i : i++, this$1$1); },
         reverse
       );
     };
     ToIndexedSequence.prototype.__iterator = function __iterator (type, reverse) {
-      var this$1 = this;
+      var this$1$1 = this;
       var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);
       var i = 0;
@@ -1048,7 +1111,7 @@
           ? step
           : iteratorValue(
               type,
-              reverse ? this$1.size - ++i : i++,
+              reverse ? this$1$1.size - ++i : i++,
               step.value,
               step
             );
@@ -1058,14 +1121,14 @@
     return ToIndexedSequence;
   }(IndexedSeq));
-  var ToSetSequence = (function (SetSeq$$1) {
+  var ToSetSequence = /*@__PURE__*/(function (SetSeq) {
     function ToSetSequence(iter) {
       this._iter = iter;
       this.size = iter.size;
     }
-    if ( SetSeq$$1 ) ToSetSequence.__proto__ = SetSeq$$1;
-    ToSetSequence.prototype = Object.create( SetSeq$$1 && SetSeq$$1.prototype );
+    if ( SetSeq ) ToSetSequence.__proto__ = SetSeq;
+    ToSetSequence.prototype = Object.create( SetSeq && SetSeq.prototype );
     ToSetSequence.prototype.constructor = ToSetSequence;
     ToSetSequence.prototype.has = function has (key) {
@@ -1073,9 +1136,9 @@
     };
     ToSetSequence.prototype.__iterate = function __iterate (fn, reverse) {
-      var this$1 = this;
+      var this$1$1 = this;
-      return this._iter.__iterate(function (v) { return fn(v, v, this$1); }, reverse);
+      return this._iter.__iterate(function (v) { return fn(v, v, this$1$1); }, reverse);
     };
     ToSetSequence.prototype.__iterator = function __iterator (type, reverse) {
@@ -1091,14 +1154,14 @@
     return ToSetSequence;
   }(SetSeq));
-  var FromEntriesSequence = (function (KeyedSeq$$1) {
+  var FromEntriesSequence = /*@__PURE__*/(function (KeyedSeq) {
     function FromEntriesSequence(entries) {
       this._iter = entries;
       this.size = entries.size;
     }
-    if ( KeyedSeq$$1 ) FromEntriesSequence.__proto__ = KeyedSeq$$1;
-    FromEntriesSequence.prototype = Object.create( KeyedSeq$$1 && KeyedSeq$$1.prototype );
+    if ( KeyedSeq ) FromEntriesSequence.__proto__ = KeyedSeq;
+    FromEntriesSequence.prototype = Object.create( KeyedSeq && KeyedSeq.prototype );
     FromEntriesSequence.prototype.constructor = FromEntriesSequence;
     FromEntriesSequence.prototype.entrySeq = function entrySeq () {
@@ -1106,7 +1169,7 @@
     };
     FromEntriesSequence.prototype.__iterate = function __iterate (fn, reverse) {
-      var this$1 = this;
+      var this$1$1 = this;
       return this._iter.__iterate(function (entry) {
         // Check if entry exists first so array access doesn't throw for holes
@@ -1117,7 +1180,7 @@
           return fn(
             indexedCollection ? entry.get(1) : entry[1],
             indexedCollection ? entry.get(0) : entry[0],
-            this$1
+            this$1$1
           );
         }
       }, reverse);
@@ -1151,14 +1214,18 @@
     return FromEntriesSequence;
   }(KeyedSeq));
-  ToIndexedSequence.prototype.cacheResult = ToKeyedSequence.prototype.cacheResult = ToSetSequence.prototype.cacheResult = FromEntriesSequence.prototype.cacheResult = cacheResultThrough;
+  ToIndexedSequence.prototype.cacheResult =
+    ToKeyedSequence.prototype.cacheResult =
+    ToSetSequence.prototype.cacheResult =
+    FromEntriesSequence.prototype.cacheResult =
+      cacheResultThrough;
   function flipFactory(collection) {
     var flipSequence = makeSequence(collection);
     flipSequence._iter = collection;
     flipSequence.size = collection.size;
     flipSequence.flip = function () { return collection; };
-    flipSequence.reverse = function() {
+    flipSequence.reverse = function () {
       var reversedSequence = collection.reverse.apply(this); // super.reverse()
       reversedSequence.flip = function () { return collection.reverse(); };
       return reversedSequence;
@@ -1166,12 +1233,12 @@
     flipSequence.has = function (key) { return collection.includes(key); };
     flipSequence.includes = function (key) { return collection.has(key); };
     flipSequence.cacheResult = cacheResultThrough;
-    flipSequence.__iterateUncached = function(fn, reverse) {
-      var this$1 = this;
+    flipSequence.__iterateUncached = function (fn, reverse) {
+      var this$1$1 = this;
-      return collection.__iterate(function (v, k) { return fn(k, v, this$1) !== false; }, reverse);
+      return collection.__iterate(function (v, k) { return fn(k, v, this$1$1) !== false; }, reverse);
     };
-    flipSequence.__iteratorUncached = function(type, reverse) {
+    flipSequence.__iteratorUncached = function (type, reverse) {
       if (type === ITERATE_ENTRIES) {
         var iterator = collection.__iterator(type, reverse);
         return new Iterator(function () {
@@ -1202,15 +1269,15 @@
         ? notSetValue
         : mapper.call(context, v, key, collection);
     };
-    mappedSequence.__iterateUncached = function(fn, reverse) {
-      var this$1 = this;
+    mappedSequence.__iterateUncached = function (fn, reverse) {
+      var this$1$1 = this;
       return collection.__iterate(
-        function (v, k, c) { return fn(mapper.call(context, v, k, c), k, this$1) !== false; },
+        function (v, k, c) { return fn(mapper.call(context, v, k, c), k, this$1$1) !== false; },
         reverse
       );
     };
-    mappedSequence.__iteratorUncached = function(type, reverse) {
+    mappedSequence.__iteratorUncached = function (type, reverse) {
       var iterator = collection.__iterator(ITERATE_ENTRIES, reverse);
       return new Iterator(function () {
         var step = iterator.next();
@@ -1231,14 +1298,14 @@
   }
   function reverseFactory(collection, useKeys) {
-    var this$1 = this;
+    var this$1$1 = this;
     var reversedSequence = makeSequence(collection);
     reversedSequence._iter = collection;
     reversedSequence.size = collection.size;
     reversedSequence.reverse = function () { return collection; };
     if (collection.flip) {
-      reversedSequence.flip = function() {
+      reversedSequence.flip = function () {
         var flipSequence = flipFactory(collection);
         flipSequence.reverse = function () { return collection.flip(); };
         return flipSequence;
@@ -1248,13 +1315,13 @@
     reversedSequence.has = function (key) { return collection.has(useKeys ? key : -1 - key); };
     reversedSequence.includes = function (value) { return collection.includes(value); };
     reversedSequence.cacheResult = cacheResultThrough;
-    reversedSequence.__iterate = function(fn, reverse) {
-      var this$1 = this;
+    reversedSequence.__iterate = function (fn, reverse) {
+      var this$1$1 = this;
       var i = 0;
       reverse && ensureSize(collection);
       return collection.__iterate(
-        function (v, k) { return fn(v, useKeys ? k : reverse ? this$1.size - ++i : i++, this$1); },
+        function (v, k) { return fn(v, useKeys ? k : reverse ? this$1$1.size - ++i : i++, this$1$1); },
         !reverse
       );
     };
@@ -1270,7 +1337,7 @@
         var entry = step.value;
         return iteratorValue(
           type,
-          useKeys ? entry[0] : reverse ? this$1.size - ++i : i++,
+          useKeys ? entry[0] : reverse ? this$1$1.size - ++i : i++,
           entry[1],
           step
         );
@@ -1293,19 +1360,19 @@
           : notSetValue;
       };
     }
-    filterSequence.__iterateUncached = function(fn, reverse) {
-      var this$1 = this;
+    filterSequence.__iterateUncached = function (fn, reverse) {
+      var this$1$1 = this;
       var iterations = 0;
       collection.__iterate(function (v, k, c) {
         if (predicate.call(context, v, k, c)) {
           iterations++;
-          return fn(v, useKeys ? k : iterations - 1, this$1);
+          return fn(v, useKeys ? k : iterations - 1, this$1$1);
         }
       }, reverse);
       return iterations;
     };
-    filterSequence.__iteratorUncached = function(type, reverse) {
+    filterSequence.__iteratorUncached = function (type, reverse) {
       var iterator = collection.__iterator(ITERATE_ENTRIES, reverse);
       var iterations = 0;
       return new Iterator(function () {
@@ -1382,7 +1449,7 @@
       sliceSize === 0 ? sliceSize : (collection.size && sliceSize) || undefined;
     if (!useKeys && isSeq(collection) && sliceSize >= 0) {
-      sliceSeq.get = function(index, notSetValue) {
+      sliceSeq.get = function (index, notSetValue) {
         index = wrapIndex(this, index);
         return index >= 0 && index < sliceSize
           ? collection.get(index + resolvedBegin, notSetValue)
@@ -1390,8 +1457,8 @@
       };
     }
-    sliceSeq.__iterateUncached = function(fn, reverse) {
-      var this$1 = this;
+    sliceSeq.__iterateUncached = function (fn, reverse) {
+      var this$1$1 = this;
       if (sliceSize === 0) {
         return 0;
@@ -1406,7 +1473,7 @@
         if (!(isSkipping && (isSkipping = skipped++ < resolvedBegin))) {
           iterations++;
           return (
-            fn(v, useKeys ? k : iterations - 1, this$1) !== false &&
+            fn(v, useKeys ? k : iterations - 1, this$1$1) !== false &&
             iterations !== sliceSize
           );
         }
@@ -1414,7 +1481,7 @@
       return iterations;
     };
-    sliceSeq.__iteratorUncached = function(type, reverse) {
+    sliceSeq.__iteratorUncached = function (type, reverse) {
       if (sliceSize !== 0 && reverse) {
         return this.cacheResult().__iterator(type, reverse);
       }
@@ -1448,20 +1515,20 @@
   function takeWhileFactory(collection, predicate, context) {
     var takeSequence = makeSequence(collection);
-    takeSequence.__iterateUncached = function(fn, reverse) {
-      var this$1 = this;
+    takeSequence.__iterateUncached = function (fn, reverse) {
+      var this$1$1 = this;
       if (reverse) {
         return this.cacheResult().__iterate(fn, reverse);
       }
       var iterations = 0;
       collection.__iterate(
-        function (v, k, c) { return predicate.call(context, v, k, c) && ++iterations && fn(v, k, this$1); }
+        function (v, k, c) { return predicate.call(context, v, k, c) && ++iterations && fn(v, k, this$1$1); }
       );
       return iterations;
     };
-    takeSequence.__iteratorUncached = function(type, reverse) {
-      var this$1 = this;
+    takeSequence.__iteratorUncached = function (type, reverse) {
+      var this$1$1 = this;
       if (reverse) {
         return this.cacheResult().__iterator(type, reverse);
@@ -1479,7 +1546,7 @@
         var entry = step.value;
         var k = entry[0];
         var v = entry[1];
-        if (!predicate.call(context, v, k, this$1)) {
+        if (!predicate.call(context, v, k, this$1$1)) {
           iterating = false;
           return iteratorDone();
         }
@@ -1491,8 +1558,8 @@
   function skipWhileFactory(collection, predicate, context, useKeys) {
     var skipSequence = makeSequence(collection);
-    skipSequence.__iterateUncached = function(fn, reverse) {
-      var this$1 = this;
+    skipSequence.__iterateUncached = function (fn, reverse) {
+      var this$1$1 = this;
       if (reverse) {
         return this.cacheResult().__iterate(fn, reverse);
@@ -1502,13 +1569,13 @@
       collection.__iterate(function (v, k, c) {
         if (!(isSkipping && (isSkipping = predicate.call(context, v, k, c)))) {
           iterations++;
-          return fn(v, useKeys ? k : iterations - 1, this$1);
+          return fn(v, useKeys ? k : iterations - 1, this$1$1);
         }
       });
       return iterations;
     };
-    skipSequence.__iteratorUncached = function(type, reverse) {
-      var this$1 = this;
+    skipSequence.__iteratorUncached = function (type, reverse) {
+      var this$1$1 = this;
       if (reverse) {
         return this.cacheResult().__iterator(type, reverse);
@@ -1534,7 +1601,7 @@
           var entry = step.value;
           k = entry[0];
           v = entry[1];
-          skipping && (skipping = predicate.call(context, v, k, this$1));
+          skipping && (skipping = predicate.call(context, v, k, this$1$1));
         } while (skipping);
         return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);
       });
@@ -1593,7 +1660,7 @@
   function flattenFactory(collection, depth, useKeys) {
     var flatSequence = makeSequence(collection);
-    flatSequence.__iterateUncached = function(fn, reverse) {
+    flatSequence.__iterateUncached = function (fn, reverse) {
       if (reverse) {
         return this.cacheResult().__iterate(fn, reverse);
       }
@@ -1615,7 +1682,7 @@
       flatDeep(collection, 0);
       return iterations;
     };
-    flatSequence.__iteratorUncached = function(type, reverse) {
+    flatSequence.__iteratorUncached = function (type, reverse) {
       if (reverse) {
         return this.cacheResult().__iterator(type, reverse);
       }
@@ -1657,18 +1724,18 @@
   function interposeFactory(collection, separator) {
     var interposedSequence = makeSequence(collection);
     interposedSequence.size = collection.size && collection.size * 2 - 1;
-    interposedSequence.__iterateUncached = function(fn, reverse) {
-      var this$1 = this;
+    interposedSequence.__iterateUncached = function (fn, reverse) {
+      var this$1$1 = this;
       var iterations = 0;
       collection.__iterate(
-        function (v) { return (!iterations || fn(separator, iterations++, this$1) !== false) &&
-          fn(v, iterations++, this$1) !== false; },
+        function (v) { return (!iterations || fn(separator, iterations++, this$1$1) !== false) &&
+          fn(v, iterations++, this$1$1) !== false; },
         reverse
       );
       return iterations;
     };
-    interposedSequence.__iteratorUncached = function(type, reverse) {
+    interposedSequence.__iteratorUncached = function (type, reverse) {
       var iterator = collection.__iterator(ITERATE_VALUES, reverse);
       var iterations = 0;
       var step;
@@ -1698,20 +1765,22 @@
       .map(function (v, k) { return [k, v, index++, mapper ? mapper(v, k, collection) : v]; })
       .valueSeq()
       .toArray();
-    entries.sort(function (a, b) { return comparator(a[3], b[3]) || a[2] - b[2]; }).forEach(
-      isKeyedCollection
-        ? function (v, i) {
-            entries[i].length = 2;
-          }
-        : function (v, i) {
-            entries[i] = v[1];
-          }
-    );
+    entries
+      .sort(function (a, b) { return comparator(a[3], b[3]) || a[2] - b[2]; })
+      .forEach(
+        isKeyedCollection
+          ? function (v, i) {
+              entries[i].length = 2;
+            }
+          : function (v, i) {
+              entries[i] = v[1];
+            }
+      );
     return isKeyedCollection
       ? KeyedSeq(entries)
       : isIndexed(collection)
-        ? IndexedSeq(entries)
-        : SetSeq(entries);
+      ? IndexedSeq(entries)
+      : SetSeq(entries);
   }
   function maxFactory(collection, comparator, mapper) {
@@ -1744,9 +1813,7 @@
     zipSequence.size = zipAll ? sizes.max() : sizes.min();
     // Note: this a generic base implementation of __iterate in terms of
     // __iterator which may be more generically useful in the future.
-    zipSequence.__iterate = function(fn, reverse) {
-      var this$1 = this;
+    zipSequence.__iterate = function (fn, reverse) {
       /* generic:
       var iterator = this.__iterator(ITERATE_ENTRIES, reverse);
       var step;
@@ -1764,13 +1831,13 @@
       var step;
       var iterations = 0;
       while (!(step = iterator.next()).done) {
-        if (fn(step.value, iterations++, this$1) === false) {
+        if (fn(step.value, iterations++, this) === false) {
           break;
         }
       }
       return iterations;
     };
-    zipSequence.__iteratorUncached = function(type, reverse) {
+    zipSequence.__iteratorUncached = function (type, reverse) {
       var iterators = iters.map(
         function (i) { return ((i = Collection(i)), getIterator(reverse ? i.reverse() : i)); }
       );
@@ -1788,7 +1855,10 @@
         return iteratorValue(
           type,
           iterations++,
-          zipper.apply(null, steps.map(function (s) { return s.value; }))
+          zipper.apply(
+            null,
+            steps.map(function (s) { return s.value; })
+          )
         );
       });
     };
@@ -1811,8 +1881,8 @@
     return isKeyed(collection)
       ? KeyedCollection
       : isIndexed(collection)
-        ? IndexedCollection
-        : SetCollection;
+      ? IndexedCollection
+      : SetCollection;
   }
   function makeSequence(collection) {
@@ -1820,8 +1890,8 @@
       (isKeyed(collection)
         ? KeyedSeq
         : isIndexed(collection)
-          ? IndexedSeq
-          : SetSeq
+        ? IndexedSeq
+        : SetSeq
       ).prototype
     );
   }
@@ -1851,7 +1921,6 @@
     return a > b ? 1 : a < b ? -1 : 0;
   }
-  // http://jsperf.com/copy-array-inline
   function arrCopy(arr, offset) {
     offset = offset || 0;
     var len = Math.max(0, arr.length - offset);
@@ -1885,12 +1954,31 @@
     );
   }
-  function isPlainObj(value) {
-    return (
-      value &&
-      ((value.constructor && value.constructor.name === 'Object') ||
-        value.constructor === undefined)
-    );
+  var toString = Object.prototype.toString;
+  function isPlainObject(value) {
+    // The base prototype's toString deals with Argument objects and native namespaces like Math
+    if (
+      !value ||
+      typeof value !== 'object' ||
+      toString.call(value) !== '[object Object]'
+    ) {
+      return false;
+    }
+    var proto = Object.getPrototypeOf(value);
+    if (proto === null) {
+      return true;
+    }
+    // Iteratively going up the prototype chain is needed for cross-realm environments (differing contexts, iframes, etc)
+    var parentProto = proto;
+    var nextProto = Object.getPrototypeOf(proto);
+    while (nextProto !== null) {
+      parentProto = nextProto;
+      nextProto = Object.getPrototypeOf(parentProto);
+    }
+    return parentProto === proto;
   }
   /**
@@ -1900,13 +1988,10 @@
   function isDataStructure(value) {
     return (
       typeof value === 'object' &&
-      (isImmutable(value) || Array.isArray(value) || isPlainObj(value))
+      (isImmutable(value) || Array.isArray(value) || isPlainObject(value))
     );
   }
-  /**
-   * Converts a value to a string, adding quotes if a string was provided.
-   */
   function quoteString(value) {
     try {
       return typeof value === 'string' ? JSON.stringify(value) : String(value);
@@ -1925,10 +2010,10 @@
     return isImmutable(collection)
       ? collection.get(key, notSetValue)
       : !has(collection, key)
-        ? notSetValue
-        : typeof collection.get === 'function'
-          ? collection.get(key)
-          : collection[key];
+      ? notSetValue
+      : typeof collection.get === 'function'
+      ? collection.get(key)
+      : collection[key];
   }
   function shallowCopy(from) {
@@ -1992,7 +2077,7 @@
     return collectionCopy;
   }
-  function updateIn(collection, keyPath, notSetValue, updater) {
+  function updateIn$1(collection, keyPath, notSetValue, updater) {
     if (!updater) {
       updater = notSetValue;
       notSetValue = undefined;
@@ -2043,52 +2128,52 @@
     return nextUpdated === nextExisting
       ? existing
       : nextUpdated === NOT_SET
-        ? remove(existing, key)
-        : set(
-            wasNotSet ? (inImmutable ? emptyMap() : {}) : existing,
-            key,
-            nextUpdated
-          );
+      ? remove(existing, key)
+      : set(
+          wasNotSet ? (inImmutable ? emptyMap() : {}) : existing,
+          key,
+          nextUpdated
+        );
   }
-  function setIn(collection, keyPath, value) {
-    return updateIn(collection, keyPath, NOT_SET, function () { return value; });
+  function setIn$1(collection, keyPath, value) {
+    return updateIn$1(collection, keyPath, NOT_SET, function () { return value; });
   }
-  function setIn$1(keyPath, v) {
-    return setIn(this, keyPath, v);
+  function setIn(keyPath, v) {
+    return setIn$1(this, keyPath, v);
   }
   function removeIn(collection, keyPath) {
-    return updateIn(collection, keyPath, function () { return NOT_SET; });
+    return updateIn$1(collection, keyPath, function () { return NOT_SET; });
   }
   function deleteIn(keyPath) {
     return removeIn(this, keyPath);
   }
-  function update(collection, key, notSetValue, updater) {
-    return updateIn(collection, [key], notSetValue, updater);
+  function update$1(collection, key, notSetValue, updater) {
+    return updateIn$1(collection, [key], notSetValue, updater);
   }
-  function update$1(key, notSetValue, updater) {
+  function update(key, notSetValue, updater) {
     return arguments.length === 1
       ? key(this)
-      : update(this, key, notSetValue, updater);
+      : update$1(this, key, notSetValue, updater);
   }
-  function updateIn$1(keyPath, notSetValue, updater) {
-    return updateIn(this, keyPath, notSetValue, updater);
+  function updateIn(keyPath, notSetValue, updater) {
+    return updateIn$1(this, keyPath, notSetValue, updater);
   }
-  function merge() {
+  function merge$1() {
     var iters = [], len = arguments.length;
     while ( len-- ) iters[ len ] = arguments[ len ];
     return mergeIntoKeyedWith(this, iters);
   }
-  function mergeWith(merger) {
+  function mergeWith$1(merger) {
     var iters = [], len = arguments.length - 1;
     while ( len-- > 0 ) iters[ len ] = arguments[ len + 1 ];
@@ -2119,11 +2204,7 @@
     return collection.withMutations(function (collection) {
       var mergeIntoCollection = merger
         ? function (value, key) {
-            update(
-              collection,
-              key,
-              NOT_SET,
-              function (oldVal) { return (oldVal === NOT_SET ? value : merger(oldVal, value, key)); }
+            update$1(collection, key, NOT_SET, function (oldVal) { return oldVal === NOT_SET ? value : merger(oldVal, value, key); }
             );
           }
         : function (value, key) {
@@ -2135,28 +2216,28 @@
     });
   }
-  function merge$1(collection) {
+  function merge(collection) {
     var sources = [], len = arguments.length - 1;
     while ( len-- > 0 ) sources[ len ] = arguments[ len + 1 ];
     return mergeWithSources(collection, sources);
   }
-  function mergeWith$1(merger, collection) {
+  function mergeWith(merger, collection) {
     var sources = [], len = arguments.length - 2;
     while ( len-- > 0 ) sources[ len ] = arguments[ len + 2 ];
     return mergeWithSources(collection, sources, merger);
   }
-  function mergeDeep(collection) {
+  function mergeDeep$1(collection) {
     var sources = [], len = arguments.length - 1;
     while ( len-- > 0 ) sources[ len ] = arguments[ len + 1 ];
     return mergeDeepWithSources(collection, sources);
   }
-  function mergeDeepWith(merger, collection) {
+  function mergeDeepWith$1(merger, collection) {
     var sources = [], len = arguments.length - 2;
     while ( len-- > 0 ) sources[ len ] = arguments[ len + 2 ];
@@ -2177,12 +2258,12 @@
       return typeof merger === 'function' && collection.mergeWith
         ? collection.mergeWith.apply(collection, [ merger ].concat( sources ))
         : collection.merge
-          ? collection.merge.apply(collection, sources)
-          : collection.concat.apply(collection, sources);
+        ? collection.merge.apply(collection, sources)
+        : collection.concat.apply(collection, sources);
     }
     var isArray = Array.isArray(collection);
     var merged = collection;
-    var Collection$$1 = isArray ? IndexedCollection : KeyedCollection;
+    var Collection = isArray ? IndexedCollection : KeyedCollection;
     var mergeItem = isArray
       ? function (value) {
           // Copy on write
@@ -2204,30 +2285,48 @@
           }
         };
     for (var i = 0; i < sources.length; i++) {
-      Collection$$1(sources[i]).forEach(mergeItem);
+      Collection(sources[i]).forEach(mergeItem);
     }
     return merged;
   }
   function deepMergerWith(merger) {
     function deepMerger(oldValue, newValue, key) {
-      return isDataStructure(oldValue) && isDataStructure(newValue)
+      return isDataStructure(oldValue) &&
+        isDataStructure(newValue) &&
+        areMergeable(oldValue, newValue)
         ? mergeWithSources(oldValue, [newValue], deepMerger)
         : merger
-          ? merger(oldValue, newValue, key)
-          : newValue;
+        ? merger(oldValue, newValue, key)
+        : newValue;
     }
     return deepMerger;
   }
-  function mergeDeep$1() {
+  /**
+   * It's unclear what the desired behavior is for merging two collections that
+   * fall into separate categories between keyed, indexed, or set-like, so we only
+   * consider them mergeable if they fall into the same category.
+   */
+  function areMergeable(oldDataStructure, newDataStructure) {
+    var oldSeq = Seq(oldDataStructure);
+    var newSeq = Seq(newDataStructure);
+    // This logic assumes that a sequence can only fall into one of the three
+    // categories mentioned above (since there's no `isSetLike()` method).
+    return (
+      isIndexed(oldSeq) === isIndexed(newSeq) &&
+      isKeyed(oldSeq) === isKeyed(newSeq)
+    );
+  }
+  function mergeDeep() {
     var iters = [], len = arguments.length;
     while ( len-- ) iters[ len ] = arguments[ len ];
     return mergeDeepWithSources(this, iters);
   }
-  function mergeDeepWith$1(merger) {
+  function mergeDeepWith(merger) {
     var iters = [], len = arguments.length - 1;
     while ( len-- > 0 ) iters[ len ] = arguments[ len + 1 ];
@@ -2238,14 +2337,14 @@
     var iters = [], len = arguments.length - 1;
     while ( len-- > 0 ) iters[ len ] = arguments[ len + 1 ];
-    return updateIn(this, keyPath, emptyMap(), function (m) { return mergeWithSources(m, iters); });
+    return updateIn$1(this, keyPath, emptyMap(), function (m) { return mergeWithSources(m, iters); });
   }
   function mergeDeepIn(keyPath) {
     var iters = [], len = arguments.length - 1;
     while ( len-- > 0 ) iters[ len ] = arguments[ len + 1 ];
-    return updateIn(this, keyPath, emptyMap(), function (m) { return mergeDeepWithSources(m, iters); }
+    return updateIn$1(this, keyPath, emptyMap(), function (m) { return mergeDeepWithSources(m, iters); }
     );
   }
@@ -2267,21 +2366,21 @@
     return this.__altered;
   }
-  var Map = (function (KeyedCollection$$1) {
+  var Map = /*@__PURE__*/(function (KeyedCollection) {
     function Map(value) {
       return value === null || value === undefined
         ? emptyMap()
         : isMap(value) && !isOrdered(value)
-          ? value
-          : emptyMap().withMutations(function (map) {
-              var iter = KeyedCollection$$1(value);
-              assertNotInfinite(iter.size);
-              iter.forEach(function (v, k) { return map.set(k, v); });
-            });
+        ? value
+        : emptyMap().withMutations(function (map) {
+            var iter = KeyedCollection(value);
+            assertNotInfinite(iter.size);
+            iter.forEach(function (v, k) { return map.set(k, v); });
+          });
     }
-    if ( KeyedCollection$$1 ) Map.__proto__ = KeyedCollection$$1;
-    Map.prototype = Object.create( KeyedCollection$$1 && KeyedCollection$$1.prototype );
+    if ( KeyedCollection ) Map.__proto__ = KeyedCollection;
+    Map.prototype = Object.create( KeyedCollection && KeyedCollection.prototype );
     Map.prototype.constructor = Map;
     Map.of = function of () {
@@ -2359,9 +2458,11 @@
     };
     Map.prototype.map = function map (mapper, context) {
+      var this$1$1 = this;
       return this.withMutations(function (map) {
         map.forEach(function (value, key) {
-          map.set(key, mapper.call(context, value, key, map));
+          map.set(key, mapper.call(context, value, key, this$1$1));
         });
       });
     };
@@ -2373,13 +2474,13 @@
     };
     Map.prototype.__iterate = function __iterate (fn, reverse) {
-      var this$1 = this;
+      var this$1$1 = this;
       var iterations = 0;
       this._root &&
         this._root.iterate(function (entry) {
           iterations++;
-          return fn(entry[1], entry[0], this$1);
+          return fn(entry[1], entry[0], this$1$1);
         }, reverse);
       return iterations;
     };
@@ -2408,24 +2509,24 @@
   MapPrototype[IS_MAP_SYMBOL] = true;
   MapPrototype[DELETE] = MapPrototype.remove;
   MapPrototype.removeAll = MapPrototype.deleteAll;
-  MapPrototype.setIn = setIn$1;
+  MapPrototype.setIn = setIn;
   MapPrototype.removeIn = MapPrototype.deleteIn = deleteIn;
-  MapPrototype.update = update$1;
-  MapPrototype.updateIn = updateIn$1;
-  MapPrototype.merge = MapPrototype.concat = merge;
-  MapPrototype.mergeWith = mergeWith;
-  MapPrototype.mergeDeep = mergeDeep$1;
-  MapPrototype.mergeDeepWith = mergeDeepWith$1;
+  MapPrototype.update = update;
+  MapPrototype.updateIn = updateIn;
+  MapPrototype.merge = MapPrototype.concat = merge$1;
+  MapPrototype.mergeWith = mergeWith$1;
+  MapPrototype.mergeDeep = mergeDeep;
+  MapPrototype.mergeDeepWith = mergeDeepWith;
   MapPrototype.mergeIn = mergeIn;
   MapPrototype.mergeDeepIn = mergeDeepIn;
   MapPrototype.withMutations = withMutations;
   MapPrototype.wasAltered = wasAltered;
   MapPrototype.asImmutable = asImmutable;
   MapPrototype['@@transducer/init'] = MapPrototype.asMutable = asMutable;
-  MapPrototype['@@transducer/step'] = function(result, arr) {
+  MapPrototype['@@transducer/step'] = function (result, arr) {
     return result.set(arr[0], arr[1]);
   };
-  MapPrototype['@@transducer/result'] = function(obj) {
+  MapPrototype['@@transducer/result'] = function (obj) {
     return obj.asImmutable();
   };
@@ -2764,50 +2865,44 @@
   // #pragma Iterators
-  ArrayMapNode.prototype.iterate = HashCollisionNode.prototype.iterate = function(
-    fn,
-    reverse
-  ) {
-    var entries = this.entries;
-    for (var ii = 0, maxIndex = entries.length - 1; ii <= maxIndex; ii++) {
-      if (fn(entries[reverse ? maxIndex - ii : ii]) === false) {
-        return false;
+  ArrayMapNode.prototype.iterate = HashCollisionNode.prototype.iterate =
+    function (fn, reverse) {
+      var entries = this.entries;
+      for (var ii = 0, maxIndex = entries.length - 1; ii <= maxIndex; ii++) {
+        if (fn(entries[reverse ? maxIndex - ii : ii]) === false) {
+          return false;
+        }
       }
-    }
-  };
+    };
-  BitmapIndexedNode.prototype.iterate = HashArrayMapNode.prototype.iterate = function(
-    fn,
-    reverse
-  ) {
-    var nodes = this.nodes;
-    for (var ii = 0, maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {
-      var node = nodes[reverse ? maxIndex - ii : ii];
-      if (node && node.iterate(fn, reverse) === false) {
-        return false;
+  BitmapIndexedNode.prototype.iterate = HashArrayMapNode.prototype.iterate =
+    function (fn, reverse) {
+      var nodes = this.nodes;
+      for (var ii = 0, maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {
+        var node = nodes[reverse ? maxIndex - ii : ii];
+        if (node && node.iterate(fn, reverse) === false) {
+          return false;
+        }
       }
-    }
-  };
+    };
   // eslint-disable-next-line no-unused-vars
-  ValueNode.prototype.iterate = function(fn, reverse) {
+  ValueNode.prototype.iterate = function (fn, reverse) {
     return fn(this.entry);
   };
-  var MapIterator = (function (Iterator$$1) {
+  var MapIterator = /*@__PURE__*/(function (Iterator) {
     function MapIterator(map, type, reverse) {
       this._type = type;
       this._reverse = reverse;
       this._stack = map._root && mapIteratorFrame(map._root);
     }
-    if ( Iterator$$1 ) MapIterator.__proto__ = Iterator$$1;
-    MapIterator.prototype = Object.create( Iterator$$1 && Iterator$$1.prototype );
+    if ( Iterator ) MapIterator.__proto__ = Iterator;
+    MapIterator.prototype = Object.create( Iterator && Iterator.prototype );
     MapIterator.prototype.constructor = MapIterator;
     MapIterator.prototype.next = function next () {
-      var this$1 = this;
       var type = this._type;
       var stack = this._stack;
       while (stack) {
@@ -2823,23 +2918,23 @@
           if (index <= maxIndex) {
             return mapIteratorValue(
               type,
-              node.entries[this$1._reverse ? maxIndex - index : index]
+              node.entries[this._reverse ? maxIndex - index : index]
             );
           }
         } else {
           maxIndex = node.nodes.length - 1;
           if (index <= maxIndex) {
-            var subNode = node.nodes[this$1._reverse ? maxIndex - index : index];
+            var subNode = node.nodes[this._reverse ? maxIndex - index : index];
             if (subNode) {
               if (subNode.entry) {
                 return mapIteratorValue(type, subNode.entry);
               }
-              stack = this$1._stack = mapIteratorFrame(subNode, stack);
+              stack = this._stack = mapIteratorFrame(subNode, stack);
             }
             continue;
           }
         }
-        stack = this$1._stack = this$1._stack.__prev;
+        stack = this._stack = this._stack.__prev;
       }
       return iteratorDone();
     };
@@ -2859,12 +2954,12 @@
     };
   }
-  function makeMap(size, root, ownerID, hash$$1) {
+  function makeMap(size, root, ownerID, hash) {
     var map = Object.create(MapPrototype);
     map.size = size;
     map._root = root;
     map.__ownerID = ownerID;
-    map.__hash = hash$$1;
+    map.__hash = hash;
     map.__altered = false;
     return map;
   }
@@ -3061,7 +3156,7 @@
     return Boolean(maybeList && maybeList[IS_LIST_SYMBOL]);
   }
-  var List = (function (IndexedCollection$$1) {
+  var List = /*@__PURE__*/(function (IndexedCollection) {
     function List(value) {
       var empty = emptyList();
       if (value === null || value === undefined) {
@@ -3070,7 +3165,7 @@
       if (isList(value)) {
         return value;
       }
-      var iter = IndexedCollection$$1(value);
+      var iter = IndexedCollection(value);
       var size = iter.size;
       if (size === 0) {
         return empty;
@@ -3085,8 +3180,8 @@
       });
     }
-    if ( IndexedCollection$$1 ) List.__proto__ = IndexedCollection$$1;
-    List.prototype = Object.create( IndexedCollection$$1 && IndexedCollection$$1.prototype );
+    if ( IndexedCollection ) List.__proto__ = IndexedCollection;
+    List.prototype = Object.create( IndexedCollection && IndexedCollection.prototype );
     List.prototype.constructor = List;
     List.of = function of (/*...values*/) {
@@ -3119,10 +3214,10 @@
       return !this.has(index)
         ? this
         : index === 0
-          ? this.shift()
-          : index === this.size - 1
-            ? this.pop()
-            : this.splice(index, 1);
+        ? this.shift()
+        : index === this.size - 1
+        ? this.pop()
+        : this.splice(index, 1);
     };
     List.prototype.insert = function insert (index, value) {
@@ -3136,8 +3231,7 @@
       if (this.__ownerID) {
         this.size = this._origin = this._capacity = 0;
         this._level = SHIFT;
-        this._root = this._tail = null;
-        this.__hash = undefined;
+        this._root = this._tail = this.__hash = undefined;
         this.__altered = true;
         return this;
       }
@@ -3181,7 +3275,7 @@
       var seqs = [];
       for (var i = 0; i < arguments.length; i++) {
         var argument = arguments$1[i];
-        var seq = IndexedCollection$$1(
+        var seq = IndexedCollection(
           typeof argument !== 'string' && hasIterator(argument)
             ? argument
             : [argument]
@@ -3206,11 +3300,11 @@
     };
     List.prototype.map = function map (mapper, context) {
-      var this$1 = this;
+      var this$1$1 = this;
       return this.withMutations(function (list) {
-        for (var i = 0; i < this$1.size; i++) {
-          list.set(i, mapper.call(context, list.get(i), i, list));
+        for (var i = 0; i < this$1$1.size; i++) {
+          list.set(i, mapper.call(context, list.get(i), i, this$1$1));
         }
       });
     };
@@ -3241,13 +3335,11 @@
     };
     List.prototype.__iterate = function __iterate (fn, reverse) {
-      var this$1 = this;
       var index = reverse ? this.size : 0;
       var values = iterateList(this, reverse);
       var value;
       while ((value = values()) !== DONE) {
-        if (fn(value, reverse ? --index : index++, this$1) === false) {
+        if (fn(value, reverse ? --index : index++, this) === false) {
           break;
         }
       }
@@ -3286,20 +3378,20 @@
   ListPrototype[IS_LIST_SYMBOL] = true;
   ListPrototype[DELETE] = ListPrototype.remove;
   ListPrototype.merge = ListPrototype.concat;
-  ListPrototype.setIn = setIn$1;
+  ListPrototype.setIn = setIn;
   ListPrototype.deleteIn = ListPrototype.removeIn = deleteIn;
-  ListPrototype.update = update$1;
-  ListPrototype.updateIn = updateIn$1;
+  ListPrototype.update = update;
+  ListPrototype.updateIn = updateIn;
   ListPrototype.mergeIn = mergeIn;
   ListPrototype.mergeDeepIn = mergeDeepIn;
   ListPrototype.withMutations = withMutations;
   ListPrototype.wasAltered = wasAltered;
   ListPrototype.asImmutable = asImmutable;
   ListPrototype['@@transducer/init'] = ListPrototype.asMutable = asMutable;
-  ListPrototype['@@transducer/step'] = function(result, arr) {
+  ListPrototype['@@transducer/step'] = function (result, arr) {
     return result.push(arr);
   };
-  ListPrototype['@@transducer/result'] = function(obj) {
+  ListPrototype['@@transducer/result'] = function (obj) {
     return obj.asImmutable();
   };
@@ -3582,8 +3674,8 @@
       end === undefined
         ? oldCapacity
         : end < 0
-          ? oldCapacity + end
-          : oldOrigin + end;
+        ? oldCapacity + end
+        : oldOrigin + end;
     if (newOrigin === oldOrigin && newCapacity === oldCapacity) {
       return list;
     }
@@ -3631,8 +3723,8 @@
       newTailOffset < oldTailOffset
         ? listNodeFor(list, newCapacity - 1)
         : newTailOffset > oldTailOffset
-          ? new VNode([], owner)
-          : oldTail;
+        ? new VNode([], owner)
+        : oldTail;
     // Merge Tail into tree.
     if (
@@ -3715,21 +3807,21 @@
     return size < SIZE ? 0 : ((size - 1) >>> SHIFT) << SHIFT;
   }
-  var OrderedMap = (function (Map$$1) {
+  var OrderedMap = /*@__PURE__*/(function (Map) {
     function OrderedMap(value) {
       return value === null || value === undefined
         ? emptyOrderedMap()
         : isOrderedMap(value)
-          ? value
-          : emptyOrderedMap().withMutations(function (map) {
-              var iter = KeyedCollection(value);
-              assertNotInfinite(iter.size);
-              iter.forEach(function (v, k) { return map.set(k, v); });
-            });
+        ? value
+        : emptyOrderedMap().withMutations(function (map) {
+            var iter = KeyedCollection(value);
+            assertNotInfinite(iter.size);
+            iter.forEach(function (v, k) { return map.set(k, v); });
+          });
     }
-    if ( Map$$1 ) OrderedMap.__proto__ = Map$$1;
-    OrderedMap.prototype = Object.create( Map$$1 && Map$$1.prototype );
+    if ( Map ) OrderedMap.__proto__ = Map;
+    OrderedMap.prototype = Object.create( Map && Map.prototype );
     OrderedMap.prototype.constructor = OrderedMap;
     OrderedMap.of = function of (/*...values*/) {
@@ -3757,6 +3849,7 @@
         this.size = 0;
         this._map.clear();
         this._list.clear();
+        this.__altered = true;
         return this;
       }
       return emptyOrderedMap();
@@ -3770,15 +3863,11 @@
       return updateOrderedMap(this, k, NOT_SET);
     };
-    OrderedMap.prototype.wasAltered = function wasAltered () {
-      return this._map.wasAltered() || this._list.wasAltered();
-    };
     OrderedMap.prototype.__iterate = function __iterate (fn, reverse) {
-      var this$1 = this;
+      var this$1$1 = this;
       return this._list.__iterate(
-        function (entry) { return entry && fn(entry[1], entry[0], this$1); },
+        function (entry) { return entry && fn(entry[1], entry[0], this$1$1); },
         reverse
       );
     };
@@ -3798,6 +3887,7 @@
           return emptyOrderedMap();
         }
         this.__ownerID = ownerID;
+        this.__altered = false;
         this._map = newMap;
         this._list = newList;
         return this;
@@ -3820,6 +3910,7 @@
     omap._list = list;
     omap.__ownerID = ownerID;
     omap.__hash = hash;
+    omap.__altered = false;
     return omap;
   }
@@ -3872,6 +3963,7 @@
       omap._map = newMap;
       omap._list = newList;
       omap.__hash = undefined;
+      omap.__altered = true;
       return omap;
     }
     return makeOrderedMap(newMap, newList);
@@ -3883,17 +3975,17 @@
     return Boolean(maybeStack && maybeStack[IS_STACK_SYMBOL]);
   }
-  var Stack = (function (IndexedCollection$$1) {
+  var Stack = /*@__PURE__*/(function (IndexedCollection) {
     function Stack(value) {
       return value === null || value === undefined
         ? emptyStack()
         : isStack(value)
-          ? value
-          : emptyStack().pushAll(value);
+        ? value
+        : emptyStack().pushAll(value);
     }
-    if ( IndexedCollection$$1 ) Stack.__proto__ = IndexedCollection$$1;
-    Stack.prototype = Object.create( IndexedCollection$$1 && IndexedCollection$$1.prototype );
+    if ( IndexedCollection ) Stack.__proto__ = IndexedCollection;
+    Stack.prototype = Object.create( IndexedCollection && IndexedCollection.prototype );
     Stack.prototype.constructor = Stack;
     Stack.of = function of (/*...values*/) {
@@ -3946,7 +4038,7 @@
     };
     Stack.prototype.pushAll = function pushAll (iter) {
-      iter = IndexedCollection$$1(iter);
+      iter = IndexedCollection(iter);
       if (iter.size === 0) {
         return this;
       }
@@ -3999,7 +4091,7 @@
       var resolvedEnd = resolveEnd(end, this.size);
       if (resolvedEnd !== this.size) {
         // super.slice(begin, end);
-        return IndexedCollection$$1.prototype.slice.call(this, begin, end);
+        return IndexedCollection.prototype.slice.call(this, begin, end);
       }
       var newSize = this.size - resolvedBegin;
       var head = this._head;
@@ -4036,18 +4128,18 @@
     // @pragma Iteration
     Stack.prototype.__iterate = function __iterate (fn, reverse) {
-      var this$1 = this;
+      var this$1$1 = this;
       if (reverse) {
         return new ArraySeq(this.toArray()).__iterate(
-          function (v, k) { return fn(v, k, this$1); },
+          function (v, k) { return fn(v, k, this$1$1); },
           reverse
         );
       }
       var iterations = 0;
       var node = this._head;
       while (node) {
-        if (fn(node.value, iterations++, this$1) === false) {
+        if (fn(node.value, iterations++, this) === false) {
           break;
         }
         node = node.next;
@@ -4085,10 +4177,10 @@
   StackPrototype.wasAltered = wasAltered;
   StackPrototype.asImmutable = asImmutable;
   StackPrototype['@@transducer/init'] = StackPrototype.asMutable = asMutable;
-  StackPrototype['@@transducer/step'] = function(result, arr) {
+  StackPrototype['@@transducer/step'] = function (result, arr) {
     return result.unshift(arr);
   };
-  StackPrototype['@@transducer/result'] = function(obj) {
+  StackPrototype['@@transducer/result'] = function (obj) {
     return obj.asImmutable();
   };
@@ -4172,8 +4264,8 @@
         notAssociative
           ? !a.has(v)
           : flipped
-            ? !is(v, a.get(k, NOT_SET))
-            : !is(a.get(k, NOT_SET), v)
+          ? !is(v, a.get(k, NOT_SET))
+          : !is(a.get(k, NOT_SET), v)
       ) {
         allEqual = false;
         return false;
@@ -4183,9 +4275,6 @@
     return allEqual && a.size === bSize;
   }
-  /**
-   * Contributes additional methods to a constructor
-   */
   function mixin(ctor, methods) {
     var keyCopier = function (key) {
       ctor.prototype[key] = methods[key];
@@ -4220,21 +4309,21 @@
     return result;
   }
-  var Set = (function (SetCollection$$1) {
+  var Set = /*@__PURE__*/(function (SetCollection) {
     function Set(value) {
       return value === null || value === undefined
         ? emptySet()
         : isSet(value) && !isOrdered(value)
-          ? value
-          : emptySet().withMutations(function (set) {
-              var iter = SetCollection$$1(value);
-              assertNotInfinite(iter.size);
-              iter.forEach(function (v) { return set.add(v); });
-            });
+        ? value
+        : emptySet().withMutations(function (set) {
+            var iter = SetCollection(value);
+            assertNotInfinite(iter.size);
+            iter.forEach(function (v) { return set.add(v); });
+          });
     }
-    if ( SetCollection$$1 ) Set.__proto__ = SetCollection$$1;
-    Set.prototype = Object.create( SetCollection$$1 && SetCollection$$1.prototype );
+    if ( SetCollection ) Set.__proto__ = SetCollection;
+    Set.prototype = Object.create( SetCollection && SetCollection.prototype );
     Set.prototype.constructor = Set;
     Set.of = function of (/*...values*/) {
@@ -4286,9 +4375,27 @@
     // @pragma Composition
     Set.prototype.map = function map (mapper, context) {
-      var this$1 = this;
+      var this$1$1 = this;
+      // keep track if the set is altered by the map function
+      var didChanges = false;
+      var newMap = updateSet(
+        this,
+        this._map.mapEntries(function (ref) {
+          var v = ref[1];
+          var mapped = mapper.call(context, v, v, this$1$1);
-      return updateSet(this, this._map.map(function (v) { return mapper(v, v, this$1); }, context));
+          if (mapped !== v) {
+            didChanges = true;
+          }
+          return [mapped, mapped];
+        }, context)
+      );
+      return didChanges ? newMap : this;
     };
     Set.prototype.union = function union () {
@@ -4304,7 +4411,7 @@
       }
       return this.withMutations(function (set) {
         for (var ii = 0; ii < iters.length; ii++) {
-          SetCollection$$1(iters[ii]).forEach(function (value) { return set.add(value); });
+          SetCollection(iters[ii]).forEach(function (value) { return set.add(value); });
         }
       });
     };
@@ -4316,7 +4423,7 @@
       if (iters.length === 0) {
         return this;
       }
-      iters = iters.map(function (iter) { return SetCollection$$1(iter); });
+      iters = iters.map(function (iter) { return SetCollection(iter); });
       var toRemove = [];
       this.forEach(function (value) {
         if (!iters.every(function (iter) { return iter.includes(value); })) {
@@ -4337,7 +4444,7 @@
       if (iters.length === 0) {
         return this;
       }
-      iters = iters.map(function (iter) { return SetCollection$$1(iter); });
+      iters = iters.map(function (iter) { return SetCollection(iter); });
       var toRemove = [];
       this.forEach(function (value) {
         if (iters.some(function (iter) { return iter.includes(value); })) {
@@ -4366,9 +4473,9 @@
     };
     Set.prototype.__iterate = function __iterate (fn, reverse) {
-      var this$1 = this;
+      var this$1$1 = this;
-      return this._map.__iterate(function (k) { return fn(k, k, this$1); }, reverse);
+      return this._map.__iterate(function (k) { return fn(k, k, this$1$1); }, reverse);
     };
     Set.prototype.__iterator = function __iterator (type, reverse) {
@@ -4403,10 +4510,10 @@
   SetPrototype.withMutations = withMutations;
   SetPrototype.asImmutable = asImmutable;
   SetPrototype['@@transducer/init'] = SetPrototype.asMutable = asMutable;
-  SetPrototype['@@transducer/step'] = function(result, arr) {
+  SetPrototype['@@transducer/step'] = function (result, arr) {
     return result.add(arr);
   };
-  SetPrototype['@@transducer/result'] = function(obj) {
+  SetPrototype['@@transducer/result'] = function (obj) {
     return obj.asImmutable();
   };
@@ -4422,8 +4529,8 @@
     return newMap === set._map
       ? set
       : newMap.size === 0
-        ? set.__empty()
-        : set.__make(newMap);
+      ? set.__empty()
+      : set.__make(newMap);
   }
   function makeSet(map, ownerID) {
@@ -4444,7 +4551,7 @@
    * (exclusive), by step, where start defaults to 0, step to 1, and end to
    * infinity. When start is equal to end, returns empty list.
    */
-  var Range = (function (IndexedSeq$$1) {
+  var Range = /*@__PURE__*/(function (IndexedSeq) {
     function Range(start, end, step) {
       if (!(this instanceof Range)) {
         return new Range(start, end, step);
@@ -4470,8 +4577,8 @@
       }
     }
-    if ( IndexedSeq$$1 ) Range.__proto__ = IndexedSeq$$1;
-    Range.prototype = Object.create( IndexedSeq$$1 && IndexedSeq$$1.prototype );
+    if ( IndexedSeq ) Range.__proto__ = IndexedSeq;
+    Range.prototype = Object.create( IndexedSeq && IndexedSeq.prototype );
     Range.prototype.constructor = Range;
     Range.prototype.toString = function toString () {
@@ -4535,14 +4642,12 @@
     };
     Range.prototype.__iterate = function __iterate (fn, reverse) {
-      var this$1 = this;
       var size = this.size;
       var step = this._step;
       var value = reverse ? this._start + (size - 1) * step : this._start;
       var i = 0;
       while (i !== size) {
-        if (fn(value, reverse ? size - ++i : i++, this$1) === false) {
+        if (fn(value, reverse ? size - ++i : i++, this) === false) {
           break;
         }
         value += reverse ? -step : step;
@@ -4578,7 +4683,7 @@
   var EMPTY_RANGE;
-  function getIn(collection, searchKeyPath, notSetValue) {
+  function getIn$1(collection, searchKeyPath, notSetValue) {
     var keyPath = coerceKeyPath(searchKeyPath);
     var i = 0;
     while (i !== keyPath.length) {
@@ -4590,16 +4695,16 @@
     return collection;
   }
-  function getIn$1(searchKeyPath, notSetValue) {
-    return getIn(this, searchKeyPath, notSetValue);
+  function getIn(searchKeyPath, notSetValue) {
+    return getIn$1(this, searchKeyPath, notSetValue);
   }
-  function hasIn(collection, keyPath) {
-    return getIn(collection, keyPath, NOT_SET) !== NOT_SET;
+  function hasIn$1(collection, keyPath) {
+    return getIn$1(collection, keyPath, NOT_SET) !== NOT_SET;
   }
-  function hasIn$1(searchKeyPath) {
-    return hasIn(this, searchKeyPath);
+  function hasIn(searchKeyPath) {
+    return hasIn$1(this, searchKeyPath);
   }
   function toObject() {
@@ -4677,8 +4782,8 @@
       return isIndexed(this)
         ? this.toIndexedSeq()
         : isKeyed(this)
-          ? this.toKeyedSeq()
-          : this.toSetSeq();
+        ? this.toKeyedSeq()
+        : this.toSetSeq();
     },
     toStack: function toStack() {
@@ -4704,9 +4809,7 @@
       return (
         head +
         ' ' +
-        this.toSeq()
-          .map(this.__toStringMapper)
-          .join(', ') +
+        this.toSeq().map(this.__toStringMapper).join(', ') +
         ' ' +
         tail
       );
@@ -4847,10 +4950,7 @@
         // We cache as an entries array, so we can just return the cache!
         return new ArraySeq(collection._cache);
       }
-      var entriesSequence = collection
-        .toSeq()
-        .map(entryMapper)
-        .toIndexedSeq();
+      var entriesSequence = collection.toSeq().map(entryMapper).toIndexedSeq();
       entriesSequence.fromEntrySeq = function () { return collection.toSeq(); };
       return entriesSequence;
     },
@@ -4876,9 +4976,7 @@
     },
     findLast: function findLast(predicate, context, notSetValue) {
-      return this.toKeyedSeq()
-        .reverse()
-        .find(predicate, context, notSetValue);
+      return this.toKeyedSeq().reverse().find(predicate, context, notSetValue);
     },
     findLastEntry: function findLastEntry(predicate, context, notSetValue) {
@@ -4888,9 +4986,7 @@
     },
     findLastKey: function findLastKey(predicate, context) {
-      return this.toKeyedSeq()
-        .reverse()
-        .findKey(predicate, context);
+      return this.toKeyedSeq().reverse().findKey(predicate, context);
     },
     first: function first(notSetValue) {
@@ -4913,7 +5009,7 @@
       return this.find(function (_, key) { return is(key, searchKey); }, undefined, notSetValue);
     },
-    getIn: getIn$1,
+    getIn: getIn,
     groupBy: function groupBy(grouper, context) {
       return groupByFactory(this, grouper, context);
@@ -4923,7 +5019,7 @@
       return this.get(searchKey, NOT_SET) !== NOT_SET;
     },
-    hasIn: hasIn$1,
+    hasIn: hasIn,
     isSubset: function isSubset(iter) {
       iter = typeof iter.includes === 'function' ? iter : Collection(iter);
@@ -4940,21 +5036,15 @@
     },
     keySeq: function keySeq() {
-      return this.toSeq()
-        .map(keyMapper)
-        .toIndexedSeq();
+      return this.toSeq().map(keyMapper).toIndexedSeq();
     },
     last: function last(notSetValue) {
-      return this.toSeq()
-        .reverse()
-        .first(notSetValue);
+      return this.toSeq().reverse().first(notSetValue);
     },
     lastKeyOf: function lastKeyOf(searchValue) {
-      return this.toKeyedSeq()
-        .reverse()
-        .keyOf(searchValue);
+      return this.toKeyedSeq().reverse().keyOf(searchValue);
     },
     max: function max(comparator) {
@@ -5046,7 +5136,7 @@
   CollectionPrototype[ITERATOR_SYMBOL] = CollectionPrototype.values;
   CollectionPrototype.toJSON = CollectionPrototype.toArray;
   CollectionPrototype.__toStringMapper = quoteString;
-  CollectionPrototype.inspect = CollectionPrototype.toSource = function() {
+  CollectionPrototype.inspect = CollectionPrototype.toSource = function () {
     return this.toString();
   };
   CollectionPrototype.chain = CollectionPrototype.flatMap;
@@ -5060,25 +5150,25 @@
     },
     mapEntries: function mapEntries(mapper, context) {
-      var this$1 = this;
+      var this$1$1 = this;
       var iterations = 0;
       return reify(
         this,
         this.toSeq()
-          .map(function (v, k) { return mapper.call(context, [k, v], iterations++, this$1); })
+          .map(function (v, k) { return mapper.call(context, [k, v], iterations++, this$1$1); })
           .fromEntrySeq()
       );
     },
     mapKeys: function mapKeys(mapper, context) {
-      var this$1 = this;
+      var this$1$1 = this;
       return reify(
         this,
         this.toSeq()
           .flip()
-          .map(function (k, v) { return mapper.call(context, k, v, this$1); })
+          .map(function (k, v) { return mapper.call(context, k, v, this$1$1); })
           .flip()
       );
     },
@@ -5163,7 +5253,8 @@
     get: function get(index, notSetValue) {
       index = wrapIndex(this, index);
       return index < 0 ||
-        (this.size === Infinity || (this.size !== undefined && index > this.size))
+        this.size === Infinity ||
+        (this.size !== undefined && index > this.size)
         ? notSetValue
         : this.find(function (_, key) { return key === index; }, undefined, notSetValue);
     },
@@ -5243,14 +5334,16 @@
     },
   });
-  SetCollection.prototype.has = CollectionPrototype.includes;
-  SetCollection.prototype.contains = SetCollection.prototype.includes;
+  var SetCollectionPrototype = SetCollection.prototype;
+  SetCollectionPrototype.has = CollectionPrototype.includes;
+  SetCollectionPrototype.contains = SetCollectionPrototype.includes;
+  SetCollectionPrototype.keys = SetCollectionPrototype.values;
   // Mixin subclasses
-  mixin(KeyedSeq, KeyedCollection.prototype);
-  mixin(IndexedSeq, IndexedCollection.prototype);
-  mixin(SetSeq, SetCollection.prototype);
+  mixin(KeyedSeq, KeyedCollectionPrototype);
+  mixin(IndexedSeq, IndexedCollectionPrototype);
+  mixin(SetSeq, SetCollectionPrototype);
   // #pragma Helper functions
@@ -5276,13 +5369,13 @@
   }
   function not(predicate) {
-    return function() {
+    return function () {
       return !predicate.apply(this, arguments);
     };
   }
   function neg(predicate) {
-    return function() {
+    return function () {
       return -predicate.apply(this, arguments);
     };
   }
@@ -5312,12 +5405,12 @@
               h = (h + hashMerge(hash(v), hash(k))) | 0;
             }
         : ordered
-          ? function (v) {
-              h = (31 * h + hash(v)) | 0;
-            }
-          : function (v) {
-              h = (h + hash(v)) | 0;
-            }
+        ? function (v) {
+            h = (31 * h + hash(v)) | 0;
+          }
+        : function (v) {
+            h = (h + hash(v)) | 0;
+          }
     );
     return murmurHashOfSize(size, h);
   }
@@ -5337,21 +5430,21 @@
     return (a ^ (b + 0x9e3779b9 + (a << 6) + (a >> 2))) | 0; // int
   }
-  var OrderedSet = (function (Set$$1) {
+  var OrderedSet = /*@__PURE__*/(function (Set) {
     function OrderedSet(value) {
       return value === null || value === undefined
         ? emptyOrderedSet()
         : isOrderedSet(value)
-          ? value
-          : emptyOrderedSet().withMutations(function (set) {
-              var iter = SetCollection(value);
-              assertNotInfinite(iter.size);
-              iter.forEach(function (v) { return set.add(v); });
-            });
+        ? value
+        : emptyOrderedSet().withMutations(function (set) {
+            var iter = SetCollection(value);
+            assertNotInfinite(iter.size);
+            iter.forEach(function (v) { return set.add(v); });
+          });
     }
-    if ( Set$$1 ) OrderedSet.__proto__ = Set$$1;
-    OrderedSet.prototype = Object.create( Set$$1 && Set$$1.prototype );
+    if ( Set ) OrderedSet.__proto__ = Set;
+    OrderedSet.prototype = Object.create( Set && Set.prototype );
     OrderedSet.prototype.constructor = OrderedSet;
     OrderedSet.of = function of (/*...values*/) {
@@ -5375,6 +5468,7 @@
   OrderedSetPrototype[IS_ORDERED_SYMBOL] = true;
   OrderedSetPrototype.zip = IndexedCollectionPrototype.zip;
   OrderedSetPrototype.zipWith = IndexedCollectionPrototype.zipWith;
+  OrderedSetPrototype.zipAll = IndexedCollectionPrototype.zipAll;
   OrderedSetPrototype.__empty = emptyOrderedSet;
   OrderedSetPrototype.__make = makeOrderedSet;
@@ -5394,11 +5488,33 @@
     );
   }
+  function throwOnInvalidDefaultValues(defaultValues) {
+    if (isRecord(defaultValues)) {
+      throw new Error(
+        'Can not call `Record` with an immutable Record as default values. Use a plain javascript object instead.'
+      );
+    }
+    if (isImmutable(defaultValues)) {
+      throw new Error(
+        'Can not call `Record` with an immutable Collection as default values. Use a plain javascript object instead.'
+      );
+    }
+    if (defaultValues === null || typeof defaultValues !== 'object') {
+      throw new Error(
+        'Can not call `Record` with a non-object as default values. Use a plain javascript object instead.'
+      );
+    }
+  }
   var Record = function Record(defaultValues, name) {
     var hasInitialized;
+    throwOnInvalidDefaultValues(defaultValues);
     var RecordType = function Record(values) {
-      var this$1 = this;
+      var this$1$1 = this;
       if (values instanceof RecordType) {
         return values;
@@ -5410,6 +5526,9 @@
         hasInitialized = true;
         var keys = Object.keys(defaultValues);
         var indices = (RecordTypePrototype._indices = {});
+        // Deprecated: left to attempt not to break any external code which
+        // relies on a ._name property existing on record instances.
+        // Use Record.getDescriptiveName() instead
         RecordTypePrototype._name = name;
         RecordTypePrototype._keys = keys;
         RecordTypePrototype._defaultValues = defaultValues;
@@ -5422,7 +5541,7 @@
               console.warn &&
               console.warn(
                 'Cannot define ' +
-                  recordName(this$1) +
+                  recordName(this) +
                   ' with property "' +
                   propName +
                   '" since that property name is part of the Record API.'
@@ -5435,40 +5554,39 @@
       }
       this.__ownerID = undefined;
       this._values = List().withMutations(function (l) {
-        l.setSize(this$1._keys.length);
+        l.setSize(this$1$1._keys.length);
         KeyedCollection(values).forEach(function (v, k) {
-          l.set(this$1._indices[k], v === this$1._defaultValues[k] ? undefined : v);
+          l.set(this$1$1._indices[k], v === this$1$1._defaultValues[k] ? undefined : v);
         });
       });
+      return this;
     };
-    var RecordTypePrototype = (RecordType.prototype = Object.create(
-      RecordPrototype
-    ));
+    var RecordTypePrototype = (RecordType.prototype =
+      Object.create(RecordPrototype));
     RecordTypePrototype.constructor = RecordType;
+    if (name) {
+      RecordType.displayName = name;
+    }
     return RecordType;
   };
   Record.prototype.toString = function toString () {
-      var this$1 = this;
     var str = recordName(this) + ' { ';
     var keys = this._keys;
     var k;
     for (var i = 0, l = keys.length; i !== l; i++) {
       k = keys[i];
-      str += (i ? ', ' : '') + k + ': ' + quoteString(this$1.get(k));
+      str += (i ? ', ' : '') + k + ': ' + quoteString(this.get(k));
     }
     return str + ' }';
   };
   Record.prototype.equals = function equals (other) {
     return (
-      this === other ||
-      (other &&
-        this._keys === other._keys &&
-        recordSeq(this).equals(recordSeq(other)))
+      this === other || (other && recordSeq(this).equals(recordSeq(other)))
     );
   };
@@ -5512,6 +5630,7 @@
   Record.prototype.clear = function clear () {
     var newValues = this._values.clear().setSize(this._keys.length);
     return this.__ownerID ? this : makeRecord(this, newValues);
   };
@@ -5558,24 +5677,24 @@
   RecordPrototype[IS_RECORD_SYMBOL] = true;
   RecordPrototype[DELETE] = RecordPrototype.remove;
   RecordPrototype.deleteIn = RecordPrototype.removeIn = deleteIn;
-  RecordPrototype.getIn = getIn$1;
+  RecordPrototype.getIn = getIn;
   RecordPrototype.hasIn = CollectionPrototype.hasIn;
-  RecordPrototype.merge = merge;
-  RecordPrototype.mergeWith = mergeWith;
+  RecordPrototype.merge = merge$1;
+  RecordPrototype.mergeWith = mergeWith$1;
   RecordPrototype.mergeIn = mergeIn;
-  RecordPrototype.mergeDeep = mergeDeep$1;
-  RecordPrototype.mergeDeepWith = mergeDeepWith$1;
+  RecordPrototype.mergeDeep = mergeDeep;
+  RecordPrototype.mergeDeepWith = mergeDeepWith;
   RecordPrototype.mergeDeepIn = mergeDeepIn;
-  RecordPrototype.setIn = setIn$1;
-  RecordPrototype.update = update$1;
-  RecordPrototype.updateIn = updateIn$1;
+  RecordPrototype.setIn = setIn;
+  RecordPrototype.update = update;
+  RecordPrototype.updateIn = updateIn;
   RecordPrototype.withMutations = withMutations;
   RecordPrototype.asMutable = asMutable;
   RecordPrototype.asImmutable = asImmutable;
   RecordPrototype[ITERATOR_SYMBOL] = RecordPrototype.entries;
   RecordPrototype.toJSON = RecordPrototype.toObject =
     CollectionPrototype.toObject;
-  RecordPrototype.inspect = RecordPrototype.toSource = function() {
+  RecordPrototype.inspect = RecordPrototype.toSource = function () {
     return this.toString();
   };
@@ -5587,7 +5706,7 @@
   }
   function recordName(record) {
-    return record._name || record.constructor.name || 'Record';
+    return record.constructor.displayName || record.constructor.name || 'Record';
   }
   function recordSeq(record) {
@@ -5597,10 +5716,10 @@
   function setProp(prototype, name) {
     try {
       Object.defineProperty(prototype, name, {
-        get: function() {
+        get: function () {
           return this.get(name);
         },
-        set: function(value) {
+        set: function (value) {
           invariant(this.__ownerID, 'Cannot set on an immutable record.');
           this.set(name, value);
         },
@@ -5614,7 +5733,7 @@
    * Returns a lazy Seq of `value` repeated `times` times. When `times` is
    * undefined, returns an infinite sequence of `value`.
    */
-  var Repeat = (function (IndexedSeq$$1) {
+  var Repeat = /*@__PURE__*/(function (IndexedSeq) {
     function Repeat(value, times) {
       if (!(this instanceof Repeat)) {
         return new Repeat(value, times);
@@ -5629,8 +5748,8 @@
       }
     }
-    if ( IndexedSeq$$1 ) Repeat.__proto__ = IndexedSeq$$1;
-    Repeat.prototype = Object.create( IndexedSeq$$1 && IndexedSeq$$1.prototype );
+    if ( IndexedSeq ) Repeat.__proto__ = IndexedSeq;
+    Repeat.prototype = Object.create( IndexedSeq && IndexedSeq.prototype );
     Repeat.prototype.constructor = Repeat;
     Repeat.prototype.toString = function toString () {
@@ -5677,12 +5796,10 @@
     };
     Repeat.prototype.__iterate = function __iterate (fn, reverse) {
-      var this$1 = this;
       var size = this.size;
       var i = 0;
       while (i !== size) {
-        if (fn(this$1._value, reverse ? size - ++i : i++, this$1) === false) {
+        if (fn(this._value, reverse ? size - ++i : i++, this) === false) {
           break;
         }
       }
@@ -5690,14 +5807,13 @@
     };
     Repeat.prototype.__iterator = function __iterator (type, reverse) {
-      var this$1 = this;
+      var this$1$1 = this;
       var size = this.size;
       var i = 0;
-      return new Iterator(
-        function () { return i === size
-            ? iteratorDone()
-            : iteratorValue(type, reverse ? size - ++i : i++, this$1._value); }
+      return new Iterator(function () { return i === size
+          ? iteratorDone()
+          : iteratorValue(type, reverse ? size - ++i : i++, this$1$1._value); }
       );
     };
@@ -5724,12 +5840,11 @@
   }
   function fromJSWith(stack, converter, value, key, keyPath, parentValue) {
-    var toSeq = Array.isArray(value)
-      ? IndexedSeq
-      : isPlainObj(value)
-        ? KeyedSeq
-        : null;
-    if (toSeq) {
+    if (
+      typeof value !== 'string' &&
+      !isImmutable(value) &&
+      (isArrayLike(value) || hasIterator(value) || isPlainObject(value))
+    ) {
       if (~stack.indexOf(value)) {
         throw new TypeError('Cannot convert circular structure to Immutable');
       }
@@ -5738,7 +5853,7 @@
       var converted = converter.call(
         parentValue,
         key,
-        toSeq(value).map(function (v, k) { return fromJSWith(stack, converter, v, k, keyPath, value); }
+        Seq(value).map(function (v, k) { return fromJSWith(stack, converter, v, k, keyPath, value); }
         ),
         keyPath && keyPath.slice()
       );
@@ -5750,10 +5865,11 @@
   }
   function defaultConverter(k, v) {
-    return isKeyed(v) ? v.toMap() : v.toList();
+    // Effectively the opposite of "Collection.toSeq()"
+    return isIndexed(v) ? v.toList() : isKeyed(v) ? v.toMap() : v.toSet();
   }
-  var version = "4.0.0-rc.10";
+  var version = "4.0.0-rc.15";
   var Immutable = {
     version: version,
@@ -5785,6 +5901,7 @@
     isAssociative: isAssociative,
     isOrdered: isOrdered,
     isValueObject: isValueObject,
+    isPlainObject: isPlainObject,
     isSeq: isSeq,
     isList: isList,
     isMap: isMap,
@@ -5795,62 +5912,71 @@
     isRecord: isRecord,
     get: get,
-    getIn: getIn,
+    getIn: getIn$1,
     has: has,
-    hasIn: hasIn,
-    merge: merge$1,
-    mergeDeep: mergeDeep,
-    mergeWith: mergeWith$1,
-    mergeDeepWith: mergeDeepWith,
+    hasIn: hasIn$1,
+    merge: merge,
+    mergeDeep: mergeDeep$1,
+    mergeWith: mergeWith,
+    mergeDeepWith: mergeDeepWith$1,
     remove: remove,
     removeIn: removeIn,
     set: set,
-    setIn: setIn,
-    update: update,
-    updateIn: updateIn,
+    setIn: setIn$1,
+    update: update$1,
+    updateIn: updateIn$1,
   };
   // Note: Iterable is deprecated
   var Iterable = Collection;
-  exports.default = Immutable;
-  exports.version = version;
   exports.Collection = Collection;
   exports.Iterable = Iterable;
-  exports.Seq = Seq;
+  exports.List = List;
   exports.Map = Map;
   exports.OrderedMap = OrderedMap;
-  exports.List = List;
-  exports.Stack = Stack;
-  exports.Set = Set;
   exports.OrderedSet = OrderedSet;
-  exports.Record = Record;
   exports.Range = Range;
+  exports.Record = Record;
   exports.Repeat = Repeat;
-  exports.is = is;
+  exports.Seq = Seq;
+  exports.Set = Set;
+  exports.Stack = Stack;
+  exports.default = Immutable;
   exports.fromJS = fromJS;
+  exports.get = get;
+  exports.getIn = getIn$1;
+  exports.has = has;
+  exports.hasIn = hasIn$1;
   exports.hash = hash;
-  exports.isImmutable = isImmutable;
+  exports.is = is;
+  exports.isAssociative = isAssociative;
   exports.isCollection = isCollection;
-  exports.isKeyed = isKeyed;
+  exports.isImmutable = isImmutable;
   exports.isIndexed = isIndexed;
-  exports.isAssociative = isAssociative;
+  exports.isKeyed = isKeyed;
+  exports.isList = isList;
+  exports.isMap = isMap;
   exports.isOrdered = isOrdered;
+  exports.isOrderedMap = isOrderedMap;
+  exports.isOrderedSet = isOrderedSet;
+  exports.isPlainObject = isPlainObject;
+  exports.isRecord = isRecord;
+  exports.isSeq = isSeq;
+  exports.isSet = isSet;
+  exports.isStack = isStack;
   exports.isValueObject = isValueObject;
-  exports.get = get;
-  exports.getIn = getIn;
-  exports.has = has;
-  exports.hasIn = hasIn;
-  exports.merge = merge$1;
-  exports.mergeDeep = mergeDeep;
-  exports.mergeWith = mergeWith$1;
-  exports.mergeDeepWith = mergeDeepWith;
+  exports.merge = merge;
+  exports.mergeDeep = mergeDeep$1;
+  exports.mergeDeepWith = mergeDeepWith$1;
+  exports.mergeWith = mergeWith;
   exports.remove = remove;
   exports.removeIn = removeIn;
   exports.set = set;
-  exports.setIn = setIn;
-  exports.update = update;
-  exports.updateIn = updateIn;
+  exports.setIn = setIn$1;
+  exports.update = update$1;
+  exports.updateIn = updateIn$1;
+  exports.version = version;
   Object.defineProperty(exports, '__esModule', { value: true });