immutable 5.0.0-beta.4 → 5.0.0-rc.1

package/README.md

@@ -2,7 +2,7 @@
 
 [![Build Status](https://github.com/immutable-js/immutable-js/actions/workflows/ci.yml/badge.svg?branch=main)](https://github.com/immutable-js/immutable-js/actions/workflows/ci.yml?query=branch%3Amain) [Chat on slack](https://immutable-js.slack.com)
 
-[Read the docs](https://immutable-js.com) and eat your vegetables.
+[Read the docs](https://immutable-js.com/docs/) and eat your vegetables.
 
 Docs are automatically generated from [README.md][] and [immutable.d.ts][].
 Please contribute! Also, don't miss the [wiki][] which contains articles on
@@ -86,7 +86,7 @@ map1.get('b') + ' vs. ' + map2.get('b'); // 2 vs. 50
 
 Immutable.js has no dependencies, which makes it predictable to include in a Browser.
 
-It's highly recommended to use a module bundler like [webpack](https://webpack.github.io/),
+It's highly recommended to use a module bundler like [webpack](https://webpack.js.org/),
 [rollup](https://rollupjs.org/), or
 [browserify](https://browserify.org/). The `immutable` npm module works
 without any additional consideration. All examples throughout the documentation

package/dist/es/Collection.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.
@@ -21,18 +22,20 @@
  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  * SOFTWARE.
  */
-import { Seq, IndexedSeq, KeyedSeq, SetSeq } from './Seq.js';
+import { Seq, KeyedSeq, IndexedSeq, SetSeq } from './Seq.js';
 import { isCollection } from './predicates/isCollection.js';
 import { isKeyed } from './predicates/isKeyed.js';
 import { isIndexed } from './predicates/isIndexed.js';
 import { isAssociative } from './predicates/isAssociative.js';
 
 var Collection = function Collection(value) {
+  // eslint-disable-next-line no-constructor-return
   return isCollection(value) ? value : Seq(value);
 };
 
 var KeyedCollection = /*@__PURE__*/(function (Collection) {
   function KeyedCollection(value) {
+    // eslint-disable-next-line no-constructor-return
     return isKeyed(value) ? value : KeyedSeq(value);
   }
 
@@ -45,6 +48,7 @@ var KeyedCollection = /*@__PURE__*/(function (Collection) {
 
 var IndexedCollection = /*@__PURE__*/(function (Collection) {
   function IndexedCollection(value) {
+    // eslint-disable-next-line no-constructor-return
     return isIndexed(value) ? value : IndexedSeq(value);
   }
 
@@ -57,6 +61,7 @@ var IndexedCollection = /*@__PURE__*/(function (Collection) {
 
 var SetCollection = /*@__PURE__*/(function (Collection) {
   function SetCollection(value) {
+    // eslint-disable-next-line no-constructor-return
     return isCollection(value) && !isAssociative(value) ? value : SetSeq(value);
   }
 

package/dist/es/CollectionImpl.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.
@@ -22,17 +23,15 @@
  * SOFTWARE.
  */
 import { Collection, KeyedCollection, IndexedCollection, SetCollection } from './Collection.js';
-export { Collection } from './Collection.js';
-import { isCollection, IS_COLLECTION_SYMBOL } from './predicates/isCollection.js';
-import { isAssociative } from './predicates/isAssociative.js';
+import { IS_COLLECTION_SYMBOL } from './predicates/isCollection.js';
 import { isKeyed, IS_KEYED_SYMBOL } from './predicates/isKeyed.js';
 import { isIndexed, IS_INDEXED_SYMBOL } from './predicates/isIndexed.js';
-import { isOrdered, IS_ORDERED_SYMBOL } from './predicates/isOrdered.js';
+import { IS_ORDERED_SYMBOL, isOrdered } from './predicates/isOrdered.js';
 import { is } from './is.js';
 import { ensureSize, returnTrue, NOT_SET, resolveBegin, wrapIndex } from './TrieUtils.js';
 import { hash } from './Hash.js';
 import { imul, smi } from './Math.js';
-import { Iterator, ITERATE_ENTRIES, ITERATE_KEYS, ITERATE_VALUES, ITERATOR_SYMBOL } from './Iterator.js';
+import { ITERATE_ENTRIES, ITERATE_KEYS, ITERATE_VALUES, ITERATOR_SYMBOL, Iterator } from './Iterator.js';
 import arrCopy from './utils/arrCopy.js';
 import assertNotInfinite from './utils/assertNotInfinite.js';
 import deepEqual from './utils/deepEqual.js';
@@ -46,19 +45,12 @@ import { Set } from './Set.js';
 import { OrderedSet } from './OrderedSet.js';
 import { Stack } from './Stack.js';
 import { Range } from './Range.js';
-import { ArraySeq, KeyedSeq, IndexedSeq, SetSeq } from './Seq.js';
+import { ArraySeq, IndexedSeq, KeyedSeq, SetSeq } from './Seq.js';
 import { ToIndexedSequence, ToKeyedSequence, ToSetSequence, reify, concatFactory, filterFactory, partitionFactory, mapFactory, reverseFactory, sliceFactory, sortFactory, countByFactory, flatMapFactory, flattenFactory, FromEntriesSequence, groupByFactory, maxFactory, skipWhileFactory, takeWhileFactory, flipFactory, interposeFactory, zipWithFactory } from './Operations.js';
 import { getIn } from './methods/getIn.js';
 import { hasIn } from './methods/hasIn.js';
 import { toObject } from './methods/toObject.js';
 
-// Note: all of these methods are deprecated.
-Collection.isIterable = isCollection;
-Collection.isKeyed = isKeyed;
-Collection.isIndexed = isIndexed;
-Collection.isAssociative = isAssociative;
-Collection.isOrdered = isOrdered;
-
 Collection.Iterator = Iterator;
 
 mixin(Collection, {
@@ -293,6 +285,7 @@ mixin(Collection, {
   },
 
   entrySeq: function entrySeq() {
+    // eslint-disable-next-line @typescript-eslint/no-this-alias
     var collection = this;
     if (collection._cache) {
       // We cache as an entries array, so we can just return the cache!
@@ -743,7 +736,8 @@ function hashCollection(collection) {
   var ordered = isOrdered(collection);
   var keyed = isKeyed(collection);
   var h = ordered ? 1 : 0;
-  var size = collection.__iterate(
+
+  collection.__iterate(
     keyed
       ? ordered
         ? function (v, k) {
@@ -760,7 +754,8 @@ function hashCollection(collection) {
           h = (h + hash(v)) | 0;
         }
   );
-  return murmurHashOfSize(size, h);
+
+  return murmurHashOfSize(collection.size, h);
 }
 
 function murmurHashOfSize(size, h) {
@@ -778,4 +773,4 @@ function hashMerge(a, b) {
   return (a ^ (b + 0x9e3779b9 + (a << 6) + (a >> 2))) | 0; // int
 }
 
-export { CollectionPrototype, IndexedCollectionPrototype };
+export { Collection, CollectionPrototype, IndexedCollectionPrototype };

package/dist/es/Hash.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/Immutable.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.
@@ -65,9 +66,8 @@ export { update } from './functional/update.js';
 export { updateIn } from './functional/updateIn.js';
 export { version } from './package.json.js';
 import { Collection } from './Collection.js';
-export { Collection } from './Collection.js';
 
 // Note: Iterable is deprecated
 var Iterable = Collection;
 
-export { Iterable };
+export { Collection, Iterable };

package/dist/es/Iterator.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/List.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.
@@ -21,7 +22,7 @@
  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  * SOFTWARE.
  */
-import { wrapIndex, MASK, SHIFT, wholeSlice, DELETE, SIZE, SetRef, OwnerID, MakeRef, resolveEnd, resolveBegin } from './TrieUtils.js';
+import { wrapIndex, MASK, SHIFT, wholeSlice, DELETE, SetRef, OwnerID, SIZE, MakeRef, resolveEnd, resolveBegin } from './TrieUtils.js';
 import { isList, IS_LIST_SYMBOL } from './predicates/isList.js';
 import { IndexedCollection } from './Collection.js';
 import { hasIterator, Iterator, iteratorDone, iteratorValue } from './Iterator.js';
@@ -41,20 +42,25 @@ var List = /*@__PURE__*/(function (IndexedCollection) {
   function List(value) {
     var empty = emptyList();
     if (value === undefined || value === null) {
+      // eslint-disable-next-line no-constructor-return
       return empty;
     }
     if (isList(value)) {
+      // eslint-disable-next-line no-constructor-return
       return value;
     }
     var iter = IndexedCollection(value);
     var size = iter.size;
     if (size === 0) {
+      // eslint-disable-next-line no-constructor-return
       return empty;
     }
     assertNotInfinite(size);
     if (size > 0 && size < SIZE) {
+      // eslint-disable-next-line no-constructor-return
       return makeList(0, size, SHIFT, null, new VNode(iter.toArray()));
     }
+    // eslint-disable-next-line no-constructor-return
     return empty.withMutations(function (list) {
       list.setSize(size);
       iter.forEach(function (v, i) { return list.set(i, v); });

package/dist/es/Map.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.
@@ -27,7 +28,7 @@ import { isMap, IS_MAP_SYMBOL } from './predicates/isMap.js';
 import { isOrdered } from './predicates/isOrdered.js';
 import { DELETE, NOT_SET, SetRef, MakeRef, MASK, SHIFT, SIZE, OwnerID } from './TrieUtils.js';
 import { hash } from './Hash.js';
-import { iteratorValue, iteratorDone, Iterator } from './Iterator.js';
+import { iteratorDone, Iterator, iteratorValue } from './Iterator.js';
 import { sortFactory } from './Operations.js';
 import arrCopy from './utils/arrCopy.js';
 import assertNotInfinite from './utils/assertNotInfinite.js';
@@ -47,6 +48,7 @@ import { OrderedMap } from './OrderedMap.js';
 
 var Map = /*@__PURE__*/(function (KeyedCollection) {
   function Map(value) {
+    // eslint-disable-next-line no-constructor-return
     return value === undefined || value === null
       ? emptyMap()
       : isMap(value) && !isOrdered(value)
@@ -62,20 +64,6 @@ var Map = /*@__PURE__*/(function (KeyedCollection) {
   Map.prototype = Object.create( KeyedCollection && KeyedCollection.prototype );
   Map.prototype.constructor = Map;
 
-  Map.of = function of () {
-    var keyValues = [], len = arguments.length;
-    while ( len-- ) keyValues[ len ] = arguments[ len ];
-
-    return emptyMap().withMutations(function (map) {
-      for (var i = 0; i < keyValues.length; i += 2) {
-        if (i + 1 >= keyValues.length) {
-          throw new Error('Missing value for key: ' + keyValues[i]);
-        }
-        map.set(keyValues[i], keyValues[i + 1]);
-      }
-    });
-  };
-
   Map.prototype.toString = function toString () {
     return this.__toString('Map {', '}');
   };
@@ -565,7 +553,7 @@ BitmapIndexedNode.prototype.iterate = HashArrayMapNode.prototype.iterate =
     }
   };
 
-// eslint-disable-next-line no-unused-vars
+// eslint-disable-next-line @typescript-eslint/no-unused-vars
 ValueNode.prototype.iterate = function (fn, reverse) {
   return fn(this.entry);
 };

package/dist/es/Math.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/Operations.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.
@@ -22,7 +23,7 @@
  * SOFTWARE.
  */
 import { ensureSize, NOT_SET, wholeSlice, wrapIndex, resolveBegin, resolveEnd } from './TrieUtils.js';
-import { KeyedCollection, IndexedCollection, SetCollection, Collection } from './Collection.js';
+import { KeyedCollection, Collection, IndexedCollection, SetCollection } from './Collection.js';
 import { isCollection } from './predicates/isCollection.js';
 import { isKeyed } from './predicates/isKeyed.js';
 import { isIndexed } from './predicates/isIndexed.js';
@@ -449,16 +450,16 @@ function sliceFactory(collection, begin, end, useKeys) {
     return collection;
   }
 
-  var resolvedBegin = resolveBegin(begin, originalSize);
-  var resolvedEnd = resolveEnd(end, originalSize);
-
-  // begin or end will be NaN if they were provided as negative numbers and
+  // begin or end can not be resolved if they were provided as negative numbers and
   // this collection's size is unknown. In that case, cache first so there is
   // a known size and these do not resolve to NaN.
-  if (resolvedBegin !== resolvedBegin || resolvedEnd !== resolvedEnd) {
+  if (typeof originalSize === 'undefined' && (begin < 0 || end < 0)) {
     return sliceFactory(collection.toSeq().cacheResult(), begin, end, useKeys);
   }
 
+  var resolvedBegin = resolveBegin(begin, originalSize);
+  var resolvedEnd = resolveEnd(end, originalSize);
+
   // Note: resolvedEnd is undefined when the original sequence's length is
   // unknown and this slice did not supply an end and should contain all
   // elements after resolvedBegin.

package/dist/es/OrderedMap.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.
@@ -24,13 +25,14 @@
 import { KeyedCollection } from './Collection.js';
 import { IS_ORDERED_SYMBOL } from './predicates/isOrdered.js';
 import { isOrderedMap } from './predicates/isOrderedMap.js';
-import { emptyMap, Map } from './Map.js';
+import { Map, emptyMap } from './Map.js';
 import { emptyList } from './List.js';
 import { DELETE, NOT_SET, SIZE } from './TrieUtils.js';
 import assertNotInfinite from './utils/assertNotInfinite.js';
 
 var OrderedMap = /*@__PURE__*/(function (Map) {
   function OrderedMap(value) {
+    // eslint-disable-next-line no-constructor-return
     return value === undefined || value === null
       ? emptyOrderedMap()
       : isOrderedMap(value)

package/dist/es/OrderedSet.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.
@@ -21,7 +22,7 @@
  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  * SOFTWARE.
  */
-import { SetCollection, KeyedCollection } from './Collection.js';
+import { KeyedCollection, SetCollection } from './Collection.js';
 import { IS_ORDERED_SYMBOL } from './predicates/isOrdered.js';
 import { isOrderedSet } from './predicates/isOrderedSet.js';
 import { IndexedCollectionPrototype } from './CollectionImpl.js';
@@ -31,6 +32,7 @@ import assertNotInfinite from './utils/assertNotInfinite.js';
 
 var OrderedSet = /*@__PURE__*/(function (Set) {
   function OrderedSet(value) {
+    // eslint-disable-next-line no-constructor-return
     return value === undefined || value === null
       ? emptyOrderedSet()
       : isOrderedSet(value)

package/dist/es/PairSorting.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/Range.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.
@@ -34,15 +35,23 @@ import deepEqual from './utils/deepEqual.js';
  */
 var Range = /*@__PURE__*/(function (IndexedSeq) {
   function Range(start, end, step) {
+    if ( step === void 0 ) step = 1;
+
     if (!(this instanceof Range)) {
+      // eslint-disable-next-line no-constructor-return
       return new Range(start, end, step);
     }
     invariant(step !== 0, 'Cannot step a Range by 0');
-    start = start || 0;
-    if (end === undefined) {
-      end = Infinity;
-    }
-    step = step === undefined ? 1 : Math.abs(step);
+    invariant(
+      start !== undefined,
+      'You must define a start value when using Range'
+    );
+    invariant(
+      end !== undefined,
+      'You must define an end value when using Range'
+    );
+
+    step = Math.abs(step);
     if (end < start) {
       step = -step;
     }
@@ -52,8 +61,10 @@ var Range = /*@__PURE__*/(function (IndexedSeq) {
     this.size = Math.max(0, Math.ceil((end - start) / step - 1) + 1);
     if (this.size === 0) {
       if (EMPTY_RANGE) {
+        // eslint-disable-next-line no-constructor-return
         return EMPTY_RANGE;
       }
+      // eslint-disable-next-line @typescript-eslint/no-this-alias
       EMPTY_RANGE = this;
     }
   }

package/dist/es/Record.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.
@@ -25,7 +26,7 @@ import { toJS } from './toJS.js';
 import { KeyedCollection } from './Collection.js';
 import { keyedSeqFromValue } from './Seq.js';
 import { List } from './List.js';
-import { ITERATE_ENTRIES, ITERATOR_SYMBOL } from './Iterator.js';
+import { ITERATOR_SYMBOL, ITERATE_ENTRIES } from './Iterator.js';
 import { isRecord, IS_RECORD_SYMBOL } from './predicates/isRecord.js';
 import { CollectionPrototype } from './CollectionImpl.js';
 import { DELETE } from './TrieUtils.js';
@@ -127,6 +128,7 @@ var Record = function Record(defaultValues, name) {
     RecordType.displayName = name;
   }
 
+  // eslint-disable-next-line no-constructor-return
   return RecordType;
 };
 

package/dist/es/Repeat.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.
@@ -34,14 +35,17 @@ import deepEqual from './utils/deepEqual.js';
 var Repeat = /*@__PURE__*/(function (IndexedSeq) {
   function Repeat(value, times) {
     if (!(this instanceof Repeat)) {
+      // eslint-disable-next-line no-constructor-return
       return new Repeat(value, times);
     }
     this._value = value;
     this.size = times === undefined ? Infinity : Math.max(0, times);
     if (this.size === 0) {
       if (EMPTY_REPEAT) {
+        // eslint-disable-next-line no-constructor-return
         return EMPTY_REPEAT;
       }
+      // eslint-disable-next-line @typescript-eslint/no-this-alias
       EMPTY_REPEAT = this;
     }
   }
@@ -118,7 +122,7 @@ var Repeat = /*@__PURE__*/(function (IndexedSeq) {
   Repeat.prototype.equals = function equals (other) {
     return other instanceof Repeat
       ? is(this._value, other._value)
-      : deepEqual(other);
+      : deepEqual(this, other);
   };
 
   return Repeat;

package/dist/es/Seq.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.
@@ -30,12 +31,13 @@ import { isKeyed } from './predicates/isKeyed.js';
 import { isAssociative } from './predicates/isAssociative.js';
 import { isRecord } from './predicates/isRecord.js';
 import { IS_ORDERED_SYMBOL } from './predicates/isOrdered.js';
-import { Iterator, iteratorDone, iteratorValue, hasIterator, isEntriesIterable, isKeysIterable, getIterator, isIterator } from './Iterator.js';
+import { Iterator, iteratorDone, iteratorValue, isEntriesIterable, isKeysIterable, hasIterator, getIterator, isIterator } from './Iterator.js';
 import hasOwnProperty from './utils/hasOwnProperty.js';
 import isArrayLike from './utils/isArrayLike.js';
 
 var Seq = /*@__PURE__*/(function (Collection) {
   function Seq(value) {
+    // eslint-disable-next-line no-constructor-return
     return value === undefined || value === null
       ? emptySequence()
       : isImmutable(value)
@@ -104,6 +106,7 @@ var Seq = /*@__PURE__*/(function (Collection) {
 
 var KeyedSeq = /*@__PURE__*/(function (Seq) {
   function KeyedSeq(value) {
+    // eslint-disable-next-line no-constructor-return
     return value === undefined || value === null
       ? emptySequence().toKeyedSeq()
       : isCollection(value)
@@ -128,6 +131,7 @@ var KeyedSeq = /*@__PURE__*/(function (Seq) {
 
 var IndexedSeq = /*@__PURE__*/(function (Seq) {
   function IndexedSeq(value) {
+    // eslint-disable-next-line no-constructor-return
     return value === undefined || value === null
       ? emptySequence()
       : isCollection(value)
@@ -160,6 +164,7 @@ var IndexedSeq = /*@__PURE__*/(function (Seq) {
 
 var SetSeq = /*@__PURE__*/(function (Seq) {
   function SetSeq(value) {
+    // eslint-disable-next-line no-constructor-return
     return (
       isCollection(value) && !isAssociative(value) ? value : IndexedSeq(value)
     ).toSetSeq();

package/dist/es/Set.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.
@@ -35,6 +36,7 @@ import { OrderedSet } from './OrderedSet.js';
 
 var Set = /*@__PURE__*/(function (SetCollection) {
   function Set(value) {
+    // eslint-disable-next-line no-constructor-return
     return value === undefined || value === null
       ? emptySet()
       : isSet(value) && !isOrdered(value)

package/dist/es/Stack.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.
@@ -34,6 +35,7 @@ import { withMutations } from './methods/withMutations.js';
 
 var Stack = /*@__PURE__*/(function (IndexedCollection) {
   function Stack(value) {
+    // eslint-disable-next-line no-constructor-return
     return value === undefined || value === null
       ? emptyStack()
       : isStack(value)

package/dist/es/TrieUtils.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.
@@ -21,6 +22,7 @@
  * 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.

package/dist/es/fromJS.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/functional/get.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/functional/getIn.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/functional/has.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/functional/hasIn.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/functional/merge.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/functional/remove.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/functional/removeIn.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/functional/set.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/functional/setIn.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/functional/update.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/functional/updateIn.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/is.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/methods/asImmutable.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.

package/dist/es/methods/asMutable.js

@@ -1,4 +1,5 @@
 /**
+ * @license
  * MIT License
  * 
  * Copyright (c) 2014-present, Lee Byron and other contributors.