immutable 4.0.0-rc.12 → 4.0.0-rc.14

package/dist/immutable.es.js

@@ -1,11 +1,26 @@
 /**
- * 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.
  */
-
-// Used for setting prototype methods that IE8 chokes on.
 var DELETE = 'delete';
 
 // Constants describing the size of trie nodes.
@@ -84,12 +99,12 @@ function resolveIndex(index, size, defaultIndex) {
   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) {
@@ -97,7 +112,6 @@ function isNeg(value) {
   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) {
@@ -207,10 +221,10 @@ Iterator.KEYS = ITERATE_KEYS;
 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;
 };
 
@@ -273,17 +287,17 @@ function isArrayLike(value) {
   );
 }
 
-var Seq = /*@__PURE__*/(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 () {
@@ -346,12 +360,12 @@ var KeyedSeq = /*@__PURE__*/(function (Seq) {
     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;
@@ -370,12 +384,12 @@ var IndexedSeq = /*@__PURE__*/(function (Seq) {
     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;
@@ -399,9 +413,8 @@ var IndexedSeq = /*@__PURE__*/(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();
   }
 
@@ -586,8 +599,8 @@ function keyedSeqFromValue(value) {
   var seq = Array.isArray(value)
     ? new ArraySeq(value)
     : hasIterator(value)
-      ? new CollectionSeq(value)
-      : undefined;
+    ? new CollectionSeq(value)
+    : undefined;
   if (seq) {
     return seq.fromEntrySeq();
   }
@@ -627,8 +640,8 @@ function maybeIndexedSeqFromValue(value) {
   return isArrayLike(value)
     ? new ArraySeq(value)
     : hasIterator(value)
-      ? new CollectionSeq(value)
-      : undefined;
+    ? new CollectionSeq(value)
+    : undefined;
 }
 
 var IS_MAP_SYMBOL = '@@__IMMUTABLE_MAP__@@';
@@ -753,41 +766,50 @@ function smi(i32) {
 var defaultValueOf = Object.prototype.valueOf;
 
 function hash(o) {
-  switch (typeof 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(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 o ? 0x42108421 : 0x42108420;
+      return v ? 0x42108421 : 0x42108420;
     case 'number':
-      return hashNumber(o);
+      return hashNumber(v);
     case 'string':
-      return o.length > STRING_HASH_CACHE_MIN_STRLEN
-        ? cachedHashString(o)
-        : hashString(o);
+      return v.length > STRING_HASH_CACHE_MIN_STRLEN
+        ? cachedHashString(v)
+        : hashString(v);
     case 'object':
     case 'function':
-      if (o === null) {
-        return 0x42108422;
-      }
-      if (typeof o.hashCode === 'function') {
-        // Drop any high bits from accidentally long hash codes.
-        return smi(o.hashCode(o));
-      }
-      if (o.valueOf !== defaultValueOf && typeof o.valueOf === 'function') {
-        o = o.valueOf(o);
-      }
-      return hashJSObj(o);
-    case 'undefined':
-      return 0x42108423;
+      return hashJSObj(v);
+    case 'symbol':
+      return hashSymbol(v);
     default:
-      if (typeof o.toString === 'function') {
-        return hashString(o.toString());
+      if (typeof v.toString === 'function') {
+        return hashString(v.toString());
       }
-      throw new Error('Value type ' + typeof o + ' cannot be hashed.');
+      throw new Error('Value type ' + typeof v + ' cannot be hashed.');
   }
 }
 
+function hashNullish(nullish) {
+  return nullish === null ? 0x42108422 : /* undefined */ 0x42108423;
+}
+
 // Compress arbitrarily large numbers into smi hashes.
 function hashNumber(n) {
   if (n !== n || n === Infinity) {
@@ -833,6 +855,19 @@ function hashString(string) {
   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) {
@@ -859,10 +894,7 @@ function hashJSObj(obj) {
     }
   }
 
-  hashed = ++objHashUID;
-  if (objHashUID & 0x40000000) {
-    objHashUID = 0;
-  }
+  hashed = nextHash();
 
   if (usingWeakMap) {
     weakMap.set(obj, hashed);
@@ -883,7 +915,7 @@ function hashJSObj(obj) {
     // 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
@@ -907,7 +939,7 @@ function hashJSObj(obj) {
 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;
@@ -929,6 +961,20 @@ function getIENodeHash(node) {
   }
 }
 
+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;
@@ -936,7 +982,9 @@ if (usingWeakMap) {
   weakMap = new WeakMap();
 }
 
-var objHashUID = 0;
+var symbolMap = Object.create(null);
+
+var _objHashUID = 0;
 
 var UID_HASH_KEY = '__immutablehash__';
 if (typeof Symbol === 'function') {
@@ -948,15 +996,15 @@ var STRING_HASH_CACHE_MAX_SIZE = 255;
 var STRING_HASH_CACHE_SIZE = 0;
 var stringHashCache = {};
 
-var ToKeyedSequence = /*@__PURE__*/(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) {
@@ -972,29 +1020,29 @@ var ToKeyedSequence = /*@__PURE__*/(function (KeyedSeq$$1) {
   };
 
   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) {
@@ -1005,14 +1053,14 @@ var ToKeyedSequence = /*@__PURE__*/(function (KeyedSeq$$1) {
 }(KeyedSeq));
 ToKeyedSequence.prototype[IS_ORDERED_SYMBOL] = true;
 
-var ToIndexedSequence = /*@__PURE__*/(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) {
@@ -1020,18 +1068,18 @@ var ToIndexedSequence = /*@__PURE__*/(function (IndexedSeq$$1) {
   };
 
   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;
@@ -1042,7 +1090,7 @@ var ToIndexedSequence = /*@__PURE__*/(function (IndexedSeq$$1) {
         ? step
         : iteratorValue(
             type,
-            reverse ? this$1.size - ++i : i++,
+            reverse ? this$1$1.size - ++i : i++,
             step.value,
             step
           );
@@ -1052,14 +1100,14 @@ var ToIndexedSequence = /*@__PURE__*/(function (IndexedSeq$$1) {
   return ToIndexedSequence;
 }(IndexedSeq));
 
-var ToSetSequence = /*@__PURE__*/(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) {
@@ -1067,9 +1115,9 @@ var ToSetSequence = /*@__PURE__*/(function (SetSeq$$1) {
   };
 
   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) {
@@ -1085,14 +1133,14 @@ var ToSetSequence = /*@__PURE__*/(function (SetSeq$$1) {
   return ToSetSequence;
 }(SetSeq));
 
-var FromEntriesSequence = /*@__PURE__*/(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 () {
@@ -1100,7 +1148,7 @@ var FromEntriesSequence = /*@__PURE__*/(function (KeyedSeq$$1) {
   };
 
   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
@@ -1111,7 +1159,7 @@ var FromEntriesSequence = /*@__PURE__*/(function (KeyedSeq$$1) {
         return fn(
           indexedCollection ? entry.get(1) : entry[1],
           indexedCollection ? entry.get(0) : entry[0],
-          this$1
+          this$1$1
         );
       }
     }, reverse);
@@ -1145,14 +1193,18 @@ var FromEntriesSequence = /*@__PURE__*/(function (KeyedSeq$$1) {
   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;
@@ -1160,12 +1212,12 @@ function flipFactory(collection) {
   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 () {
@@ -1196,15 +1248,15 @@ function mapFactory(collection, mapper, context) {
       ? 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();
@@ -1225,14 +1277,14 @@ function mapFactory(collection, mapper, context) {
 }
 
 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;
@@ -1242,13 +1294,13 @@ function reverseFactory(collection, useKeys) {
   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
     );
   };
@@ -1264,7 +1316,7 @@ function reverseFactory(collection, useKeys) {
       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
       );
@@ -1287,19 +1339,19 @@ function filterFactory(collection, predicate, context, useKeys) {
         : 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 () {
@@ -1376,7 +1428,7 @@ function sliceFactory(collection, begin, end, useKeys) {
     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)
@@ -1384,8 +1436,8 @@ function sliceFactory(collection, begin, end, useKeys) {
     };
   }
 
-  sliceSeq.__iterateUncached = function(fn, reverse) {
-    var this$1 = this;
+  sliceSeq.__iterateUncached = function (fn, reverse) {
+    var this$1$1 = this;
 
     if (sliceSize === 0) {
       return 0;
@@ -1400,7 +1452,7 @@ function sliceFactory(collection, begin, end, useKeys) {
       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
         );
       }
@@ -1408,7 +1460,7 @@ function sliceFactory(collection, begin, end, useKeys) {
     return iterations;
   };
 
-  sliceSeq.__iteratorUncached = function(type, reverse) {
+  sliceSeq.__iteratorUncached = function (type, reverse) {
     if (sliceSize !== 0 && reverse) {
       return this.cacheResult().__iterator(type, reverse);
     }
@@ -1442,20 +1494,20 @@ function sliceFactory(collection, begin, end, useKeys) {
 
 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);
@@ -1473,7 +1525,7 @@ function takeWhileFactory(collection, predicate, context) {
       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();
       }
@@ -1485,8 +1537,8 @@ function takeWhileFactory(collection, predicate, context) {
 
 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);
@@ -1496,13 +1548,13 @@ function skipWhileFactory(collection, predicate, context, useKeys) {
     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);
@@ -1528,7 +1580,7 @@ function skipWhileFactory(collection, predicate, context, useKeys) {
         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);
     });
@@ -1587,7 +1639,7 @@ function concatFactory(collection, values) {
 
 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);
     }
@@ -1609,7 +1661,7 @@ function flattenFactory(collection, depth, useKeys) {
     flatDeep(collection, 0);
     return iterations;
   };
-  flatSequence.__iteratorUncached = function(type, reverse) {
+  flatSequence.__iteratorUncached = function (type, reverse) {
     if (reverse) {
       return this.cacheResult().__iterator(type, reverse);
     }
@@ -1651,18 +1703,18 @@ function flatMapFactory(collection, mapper, context) {
 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;
@@ -1692,20 +1744,22 @@ function sortFactory(collection, comparator, mapper) {
     .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) {
@@ -1738,7 +1792,7 @@ function zipWithFactory(keyIter, zipper, iters, zipAll) {
   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) {
+  zipSequence.__iterate = function (fn, reverse) {
     /* generic:
     var iterator = this.__iterator(ITERATE_ENTRIES, reverse);
     var step;
@@ -1762,7 +1816,7 @@ function zipWithFactory(keyIter, zipper, iters, zipAll) {
     }
     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)); }
     );
@@ -1780,7 +1834,10 @@ function zipWithFactory(keyIter, zipper, iters, zipAll) {
       return iteratorValue(
         type,
         iterations++,
-        zipper.apply(null, steps.map(function (s) { return s.value; }))
+        zipper.apply(
+          null,
+          steps.map(function (s) { return s.value; })
+        )
       );
     });
   };
@@ -1803,8 +1860,8 @@ function collectionClass(collection) {
   return isKeyed(collection)
     ? KeyedCollection
     : isIndexed(collection)
-      ? IndexedCollection
-      : SetCollection;
+    ? IndexedCollection
+    : SetCollection;
 }
 
 function makeSequence(collection) {
@@ -1812,8 +1869,8 @@ function makeSequence(collection) {
     (isKeyed(collection)
       ? KeyedSeq
       : isIndexed(collection)
-        ? IndexedSeq
-        : SetSeq
+      ? IndexedSeq
+      : SetSeq
     ).prototype
   );
 }
@@ -1843,7 +1900,6 @@ function defaultComparator(a, b) {
   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);
@@ -1877,12 +1933,31 @@ function coerceKeyPath(keyPath) {
   );
 }
 
-function isPlainObj(value) {
-  return (
-    value &&
-    (typeof value.constructor !== 'function' ||
-      value.constructor.name === 'Object')
-  );
+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;
 }
 
 /**
@@ -1892,13 +1967,10 @@ function isPlainObj(value) {
 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);
@@ -1917,10 +1989,10 @@ function get(collection, key, notSetValue) {
   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) {
@@ -1984,7 +2056,7 @@ function set(collection, key, value) {
   return collectionCopy;
 }
 
-function updateIn(collection, keyPath, notSetValue, updater) {
+function updateIn$1(collection, keyPath, notSetValue, updater) {
   if (!updater) {
     updater = notSetValue;
     notSetValue = undefined;
@@ -2035,52 +2107,52 @@ function updateInDeeply(
   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 ];
 
@@ -2111,11 +2183,7 @@ function mergeIntoKeyedWith(collection, collections, merger) {
   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) {
@@ -2127,28 +2195,28 @@ function mergeIntoKeyedWith(collection, collections, merger) {
   });
 }
 
-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 ];
 
@@ -2169,12 +2237,12 @@ function mergeWithSources(collection, sources, merger) {
     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
@@ -2196,7 +2264,7 @@ function mergeWithSources(collection, sources, merger) {
         }
       };
   for (var i = 0; i < sources.length; i++) {
-    Collection$$1(sources[i]).forEach(mergeItem);
+    Collection(sources[i]).forEach(mergeItem);
   }
   return merged;
 }
@@ -2206,20 +2274,20 @@ function deepMergerWith(merger) {
     return isDataStructure(oldValue) && isDataStructure(newValue)
       ? mergeWithSources(oldValue, [newValue], deepMerger)
       : merger
-        ? merger(oldValue, newValue, key)
-        : newValue;
+      ? merger(oldValue, newValue, key)
+      : newValue;
   }
   return deepMerger;
 }
 
-function mergeDeep$1() {
+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 ];
 
@@ -2230,14 +2298,14 @@ function mergeIn(keyPath) {
   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); }
   );
 }
 
@@ -2259,21 +2327,21 @@ function wasAltered() {
   return this.__altered;
 }
 
-var Map = /*@__PURE__*/(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 () {
@@ -2351,9 +2419,11 @@ var Map = /*@__PURE__*/(function (KeyedCollection$$1) {
   };
 
   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));
       });
     });
   };
@@ -2365,13 +2435,13 @@ var Map = /*@__PURE__*/(function (KeyedCollection$$1) {
   };
 
   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;
   };
@@ -2400,24 +2470,24 @@ var MapPrototype = Map.prototype;
 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();
 };
 
@@ -2756,45 +2826,41 @@ ValueNode.prototype.update = function update (ownerID, shift, keyHash, key, valu
 
 // #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 = /*@__PURE__*/(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 () {
@@ -2849,12 +2915,12 @@ function mapIteratorFrame(node, prev) {
   };
 }
 
-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;
 }
@@ -3051,7 +3117,7 @@ function isList(maybeList) {
   return Boolean(maybeList && maybeList[IS_LIST_SYMBOL]);
 }
 
-var List = /*@__PURE__*/(function (IndexedCollection$$1) {
+var List = /*@__PURE__*/(function (IndexedCollection) {
   function List(value) {
     var empty = emptyList();
     if (value === null || value === undefined) {
@@ -3060,7 +3126,7 @@ var List = /*@__PURE__*/(function (IndexedCollection$$1) {
     if (isList(value)) {
       return value;
     }
-    var iter = IndexedCollection$$1(value);
+    var iter = IndexedCollection(value);
     var size = iter.size;
     if (size === 0) {
       return empty;
@@ -3075,8 +3141,8 @@ var List = /*@__PURE__*/(function (IndexedCollection$$1) {
     });
   }
 
-  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*/) {
@@ -3109,10 +3175,10 @@ var List = /*@__PURE__*/(function (IndexedCollection$$1) {
     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) {
@@ -3126,8 +3192,7 @@ var List = /*@__PURE__*/(function (IndexedCollection$$1) {
     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;
     }
@@ -3171,7 +3236,7 @@ var List = /*@__PURE__*/(function (IndexedCollection$$1) {
     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]
@@ -3196,11 +3261,11 @@ var List = /*@__PURE__*/(function (IndexedCollection$$1) {
   };
 
   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));
       }
     });
   };
@@ -3274,20 +3339,20 @@ var ListPrototype = List.prototype;
 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();
 };
 
@@ -3570,8 +3635,8 @@ function setListBounds(list, begin, end) {
     end === undefined
       ? oldCapacity
       : end < 0
-        ? oldCapacity + end
-        : oldOrigin + end;
+      ? oldCapacity + end
+      : oldOrigin + end;
   if (newOrigin === oldOrigin && newCapacity === oldCapacity) {
     return list;
   }
@@ -3619,8 +3684,8 @@ function setListBounds(list, begin, end) {
     newTailOffset < oldTailOffset
       ? listNodeFor(list, newCapacity - 1)
       : newTailOffset > oldTailOffset
-        ? new VNode([], owner)
-        : oldTail;
+      ? new VNode([], owner)
+      : oldTail;
 
   // Merge Tail into tree.
   if (
@@ -3703,21 +3768,21 @@ function getTailOffset(size) {
   return size < SIZE ? 0 : ((size - 1) >>> SHIFT) << SHIFT;
 }
 
-var OrderedMap = /*@__PURE__*/(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*/) {
@@ -3745,6 +3810,7 @@ var OrderedMap = /*@__PURE__*/(function (Map$$1) {
       this.size = 0;
       this._map.clear();
       this._list.clear();
+      this.__altered = true;
       return this;
     }
     return emptyOrderedMap();
@@ -3758,15 +3824,11 @@ var OrderedMap = /*@__PURE__*/(function (Map$$1) {
     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
     );
   };
@@ -3786,6 +3848,7 @@ var OrderedMap = /*@__PURE__*/(function (Map$$1) {
         return emptyOrderedMap();
       }
       this.__ownerID = ownerID;
+      this.__altered = false;
       this._map = newMap;
       this._list = newList;
       return this;
@@ -3808,6 +3871,7 @@ function makeOrderedMap(map, list, ownerID, hash) {
   omap._list = list;
   omap.__ownerID = ownerID;
   omap.__hash = hash;
+  omap.__altered = false;
   return omap;
 }
 
@@ -3860,6 +3924,7 @@ function updateOrderedMap(omap, k, v) {
     omap._map = newMap;
     omap._list = newList;
     omap.__hash = undefined;
+    omap.__altered = true;
     return omap;
   }
   return makeOrderedMap(newMap, newList);
@@ -3871,17 +3936,17 @@ function isStack(maybeStack) {
   return Boolean(maybeStack && maybeStack[IS_STACK_SYMBOL]);
 }
 
-var Stack = /*@__PURE__*/(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*/) {
@@ -3934,7 +3999,7 @@ var Stack = /*@__PURE__*/(function (IndexedCollection$$1) {
   };
 
   Stack.prototype.pushAll = function pushAll (iter) {
-    iter = IndexedCollection$$1(iter);
+    iter = IndexedCollection(iter);
     if (iter.size === 0) {
       return this;
     }
@@ -3987,7 +4052,7 @@ var Stack = /*@__PURE__*/(function (IndexedCollection$$1) {
     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;
@@ -4024,11 +4089,11 @@ var Stack = /*@__PURE__*/(function (IndexedCollection$$1) {
   // @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
       );
     }
@@ -4073,10 +4138,10 @@ StackPrototype.withMutations = withMutations;
 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();
 };
 
@@ -4160,8 +4225,8 @@ function deepEqual(a, b) {
       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;
@@ -4171,9 +4236,6 @@ function deepEqual(a, b) {
   return allEqual && a.size === bSize;
 }
 
-/**
- * Contributes additional methods to a constructor
- */
 function mixin(ctor, methods) {
   var keyCopier = function (key) {
     ctor.prototype[key] = methods[key];
@@ -4208,21 +4270,21 @@ function toJS(value) {
   return result;
 }
 
-var Set = /*@__PURE__*/(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*/) {
@@ -4274,21 +4336,27 @@ var Set = /*@__PURE__*/(function (SetCollection$$1) {
   // @pragma Composition
 
   Set.prototype.map = function map (mapper, context) {
-    var this$1 = this;
+    var this$1$1 = this;
 
-    var removes = [];
-    var adds = [];
-    this.forEach(function (value) {
-      var mapped = mapper.call(context, value, value, this$1);
-      if (mapped !== value) {
-        removes.push(value);
-        adds.push(mapped);
-      }
-    });
-    return this.withMutations(function (set) {
-      removes.forEach(function (value) { return set.remove(value); });
-      adds.forEach(function (value) { return set.add(value); });
-    });
+    // 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);
+
+        if (mapped !== v) {
+          didChanges = true;
+        }
+
+        return [mapped, mapped];
+      }, context)
+    );
+
+    return didChanges ? newMap : this;
   };
 
   Set.prototype.union = function union () {
@@ -4304,7 +4372,7 @@ var Set = /*@__PURE__*/(function (SetCollection$$1) {
     }
     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 +4384,7 @@ var Set = /*@__PURE__*/(function (SetCollection$$1) {
     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 +4405,7 @@ var Set = /*@__PURE__*/(function (SetCollection$$1) {
     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 +4434,9 @@ var Set = /*@__PURE__*/(function (SetCollection$$1) {
   };
 
   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 +4471,10 @@ SetPrototype.merge = SetPrototype.concat = SetPrototype.union;
 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 +4490,8 @@ function updateSet(set, newMap) {
   return newMap === set._map
     ? set
     : newMap.size === 0
-      ? set.__empty()
-      : set.__make(newMap);
+    ? set.__empty()
+    : set.__make(newMap);
 }
 
 function makeSet(map, ownerID) {
@@ -4444,7 +4512,7 @@ function emptySet() {
  * (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 = /*@__PURE__*/(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 +4538,8 @@ var Range = /*@__PURE__*/(function (IndexedSeq$$1) {
     }
   }
 
-  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 () {
@@ -4576,7 +4644,7 @@ var Range = /*@__PURE__*/(function (IndexedSeq$$1) {
 
 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) {
@@ -4588,16 +4656,16 @@ function getIn(collection, searchKeyPath, notSetValue) {
   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() {
@@ -4675,8 +4743,8 @@ mixin(Collection, {
     return isIndexed(this)
       ? this.toIndexedSeq()
       : isKeyed(this)
-        ? this.toKeyedSeq()
-        : this.toSetSeq();
+      ? this.toKeyedSeq()
+      : this.toSetSeq();
   },
 
   toStack: function toStack() {
@@ -4702,9 +4770,7 @@ mixin(Collection, {
     return (
       head +
       ' ' +
-      this.toSeq()
-        .map(this.__toStringMapper)
-        .join(', ') +
+      this.toSeq().map(this.__toStringMapper).join(', ') +
       ' ' +
       tail
     );
@@ -4845,10 +4911,7 @@ mixin(Collection, {
       // 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;
   },
@@ -4874,9 +4937,7 @@ mixin(Collection, {
   },
 
   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) {
@@ -4886,9 +4947,7 @@ mixin(Collection, {
   },
 
   findLastKey: function findLastKey(predicate, context) {
-    return this.toKeyedSeq()
-      .reverse()
-      .findKey(predicate, context);
+    return this.toKeyedSeq().reverse().findKey(predicate, context);
   },
 
   first: function first(notSetValue) {
@@ -4911,7 +4970,7 @@ mixin(Collection, {
     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);
@@ -4921,7 +4980,7 @@ mixin(Collection, {
     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);
@@ -4938,21 +4997,15 @@ mixin(Collection, {
   },
 
   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) {
@@ -5044,7 +5097,7 @@ CollectionPrototype[IS_COLLECTION_SYMBOL] = true;
 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;
@@ -5058,25 +5111,25 @@ mixin(KeyedCollection, {
   },
 
   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()
     );
   },
@@ -5161,7 +5214,8 @@ mixin(IndexedCollection, {
   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);
   },
@@ -5274,13 +5328,13 @@ function entryMapper(v, k) {
 }
 
 function not(predicate) {
-  return function() {
+  return function () {
     return !predicate.apply(this, arguments);
   };
 }
 
 function neg(predicate) {
-  return function() {
+  return function () {
     return -predicate.apply(this, arguments);
   };
 }
@@ -5310,12 +5364,12 @@ function hashCollection(collection) {
             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);
 }
@@ -5335,21 +5389,21 @@ function hashMerge(a, b) {
   return (a ^ (b + 0x9e3779b9 + (a << 6) + (a >> 2))) | 0; // int
 }
 
-var OrderedSet = /*@__PURE__*/(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*/) {
@@ -5373,6 +5427,7 @@ var OrderedSetPrototype = OrderedSet.prototype;
 OrderedSetPrototype[IS_ORDERED_SYMBOL] = true;
 OrderedSetPrototype.zip = IndexedCollectionPrototype.zip;
 OrderedSetPrototype.zipWith = IndexedCollectionPrototype.zipWith;
+OrderedSetPrototype.zipAll = IndexedCollectionPrototype.zipAll;
 
 OrderedSetPrototype.__empty = emptyOrderedSet;
 OrderedSetPrototype.__make = makeOrderedSet;
@@ -5392,11 +5447,33 @@ function emptyOrderedSet() {
   );
 }
 
+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;
@@ -5436,16 +5513,16 @@ var Record = function Record(defaultValues, name) {
     }
     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) {
@@ -5468,10 +5545,7 @@ Record.prototype.toString = function toString () {
 
 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)))
   );
 };
 
@@ -5515,6 +5589,7 @@ Record.prototype.remove = function remove (k) {
 
 Record.prototype.clear = function clear () {
   var newValues = this._values.clear().setSize(this._keys.length);
+
   return this.__ownerID ? this : makeRecord(this, newValues);
 };
 
@@ -5561,24 +5636,24 @@ var RecordPrototype = Record.prototype;
 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();
 };
 
@@ -5600,10 +5675,10 @@ function recordSeq(record) {
 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);
       },
@@ -5617,7 +5692,7 @@ function setProp(prototype, name) {
  * Returns a lazy Seq of `value` repeated `times` times. When `times` is
  * undefined, returns an infinite sequence of `value`.
  */
-var Repeat = /*@__PURE__*/(function (IndexedSeq$$1) {
+var Repeat = /*@__PURE__*/(function (IndexedSeq) {
   function Repeat(value, times) {
     if (!(this instanceof Repeat)) {
       return new Repeat(value, times);
@@ -5632,8 +5707,8 @@ var Repeat = /*@__PURE__*/(function (IndexedSeq$$1) {
     }
   }
 
-  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 () {
@@ -5691,14 +5766,13 @@ var Repeat = /*@__PURE__*/(function (IndexedSeq$$1) {
   };
 
   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); }
     );
   };
 
@@ -5727,9 +5801,9 @@ function fromJS(value, converter) {
 function fromJSWith(stack, converter, value, key, keyPath, parentValue) {
   var toSeq = Array.isArray(value)
     ? IndexedSeq
-    : isPlainObj(value)
-      ? KeyedSeq
-      : null;
+    : isPlainObject(value)
+    ? KeyedSeq
+    : null;
   if (toSeq) {
     if (~stack.indexOf(value)) {
       throw new TypeError('Cannot convert circular structure to Immutable');
@@ -5754,7 +5828,7 @@ function defaultConverter(k, v) {
   return isKeyed(v) ? v.toMap() : v.toList();
 }
 
-var version = "4.0.0-rc.11";
+var version = "4.0.0-rc.14";
 
 var Immutable = {
   version: version,
@@ -5786,6 +5860,7 @@ var Immutable = {
   isAssociative: isAssociative,
   isOrdered: isOrdered,
   isValueObject: isValueObject,
+  isPlainObject: isPlainObject,
   isSeq: isSeq,
   isList: isList,
   isMap: isMap,
@@ -5796,23 +5871,23 @@ var Immutable = {
   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;
 
 export default Immutable;
-export { version, Collection, Iterable, Seq, Map, OrderedMap, List, Stack, Set, OrderedSet, Record, Range, Repeat, is, fromJS, hash, isImmutable, isCollection, isKeyed, isIndexed, isAssociative, isOrdered, isValueObject, get, getIn, has, hasIn, merge$1 as merge, mergeDeep, mergeWith$1 as mergeWith, mergeDeepWith, remove, removeIn, set, setIn, update, updateIn };
+export { Collection, Iterable, List, Map, OrderedMap, OrderedSet, Range, Record, Repeat, Seq, Set, Stack, fromJS, get, getIn$1 as getIn, has, hasIn$1 as hasIn, hash, is, isAssociative, isCollection, isImmutable, isIndexed, isKeyed, isList, isMap, isOrdered, isOrderedMap, isOrderedSet, isPlainObject, isRecord, isSeq, isSet, isStack, isValueObject, merge, mergeDeep$1 as mergeDeep, mergeDeepWith$1 as mergeDeepWith, mergeWith, remove, removeIn, set, setIn$1 as setIn, update$1 as update, updateIn$1 as updateIn, version };