immutable 5.0.0-beta.2 → 5.0.0-beta.3

package/dist/es/Operations.js

@@ -1,952 +0,0 @@
-/**
- * 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.
- */
-import { ensureSize, NOT_SET, wholeSlice, wrapIndex, resolveBegin, resolveEnd } from './TrieUtils.js';
-import { KeyedCollection, IndexedCollection, SetCollection, Collection } from './Collection.js';
-import { isCollection } from './predicates/isCollection.js';
-import { isKeyed } from './predicates/isKeyed.js';
-import { isIndexed } from './predicates/isIndexed.js';
-import { IS_ORDERED_SYMBOL, isOrdered } from './predicates/isOrdered.js';
-import { isSeq } from './predicates/isSeq.js';
-import { ITERATE_VALUES, Iterator, iteratorValue, ITERATE_ENTRIES, ITERATE_KEYS, iteratorDone, getIterator } from './Iterator.js';
-import { KeyedSeq, IndexedSeq, SetSeq, keyedSeqFromValue, indexedSeqFromValue, ArraySeq, Seq } from './Seq.js';
-import { Map } from './Map.js';
-import { OrderedMap } from './OrderedMap.js';
-
-var ToKeyedSequence = /*@__PURE__*/(function (KeyedSeq) {
-  function ToKeyedSequence(indexed, useKeys) {
-    this._iter = indexed;
-    this._useKeys = useKeys;
-    this.size = indexed.size;
-  }
-
-  if ( KeyedSeq ) ToKeyedSequence.__proto__ = KeyedSeq;
-  ToKeyedSequence.prototype = Object.create( KeyedSeq && KeyedSeq.prototype );
-  ToKeyedSequence.prototype.constructor = ToKeyedSequence;
-
-  ToKeyedSequence.prototype.get = function get (key, notSetValue) {
-    return this._iter.get(key, notSetValue);
-  };
-
-  ToKeyedSequence.prototype.has = function has (key) {
-    return this._iter.has(key);
-  };
-
-  ToKeyedSequence.prototype.valueSeq = function valueSeq () {
-    return this._iter.valueSeq();
-  };
-
-  ToKeyedSequence.prototype.reverse = function reverse () {
-    var this$1$1 = this;
-
-    var reversedSequence = reverseFactory(this, true);
-    if (!this._useKeys) {
-      reversedSequence.valueSeq = function () { return this$1$1._iter.toSeq().reverse(); };
-    }
-    return reversedSequence;
-  };
-
-  ToKeyedSequence.prototype.map = function map (mapper, context) {
-    var this$1$1 = this;
-
-    var mappedSequence = mapFactory(this, mapper, context);
-    if (!this._useKeys) {
-      mappedSequence.valueSeq = function () { return this$1$1._iter.toSeq().map(mapper, context); };
-    }
-    return mappedSequence;
-  };
-
-  ToKeyedSequence.prototype.__iterate = function __iterate (fn, reverse) {
-    var this$1$1 = this;
-
-    return this._iter.__iterate(function (v, k) { return fn(v, k, this$1$1); }, reverse);
-  };
-
-  ToKeyedSequence.prototype.__iterator = function __iterator (type, reverse) {
-    return this._iter.__iterator(type, reverse);
-  };
-
-  return ToKeyedSequence;
-}(KeyedSeq));
-ToKeyedSequence.prototype[IS_ORDERED_SYMBOL] = true;
-
-var ToIndexedSequence = /*@__PURE__*/(function (IndexedSeq) {
-  function ToIndexedSequence(iter) {
-    this._iter = iter;
-    this.size = iter.size;
-  }
-
-  if ( IndexedSeq ) ToIndexedSequence.__proto__ = IndexedSeq;
-  ToIndexedSequence.prototype = Object.create( IndexedSeq && IndexedSeq.prototype );
-  ToIndexedSequence.prototype.constructor = ToIndexedSequence;
-
-  ToIndexedSequence.prototype.includes = function includes (value) {
-    return this._iter.includes(value);
-  };
-
-  ToIndexedSequence.prototype.__iterate = function __iterate (fn, reverse) {
-    var this$1$1 = this;
-
-    var i = 0;
-    reverse && ensureSize(this);
-    return this._iter.__iterate(
-      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$1 = this;
-
-    var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);
-    var i = 0;
-    reverse && ensureSize(this);
-    return new Iterator(function () {
-      var step = iterator.next();
-      return step.done
-        ? step
-        : iteratorValue(
-            type,
-            reverse ? this$1$1.size - ++i : i++,
-            step.value,
-            step
-          );
-    });
-  };
-
-  return ToIndexedSequence;
-}(IndexedSeq));
-
-var ToSetSequence = /*@__PURE__*/(function (SetSeq) {
-  function ToSetSequence(iter) {
-    this._iter = iter;
-    this.size = iter.size;
-  }
-
-  if ( SetSeq ) ToSetSequence.__proto__ = SetSeq;
-  ToSetSequence.prototype = Object.create( SetSeq && SetSeq.prototype );
-  ToSetSequence.prototype.constructor = ToSetSequence;
-
-  ToSetSequence.prototype.has = function has (key) {
-    return this._iter.includes(key);
-  };
-
-  ToSetSequence.prototype.__iterate = function __iterate (fn, reverse) {
-    var this$1$1 = this;
-
-    return this._iter.__iterate(function (v) { return fn(v, v, this$1$1); }, reverse);
-  };
-
-  ToSetSequence.prototype.__iterator = function __iterator (type, reverse) {
-    var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);
-    return new Iterator(function () {
-      var step = iterator.next();
-      return step.done
-        ? step
-        : iteratorValue(type, step.value, step.value, step);
-    });
-  };
-
-  return ToSetSequence;
-}(SetSeq));
-
-var FromEntriesSequence = /*@__PURE__*/(function (KeyedSeq) {
-  function FromEntriesSequence(entries) {
-    this._iter = entries;
-    this.size = entries.size;
-  }
-
-  if ( KeyedSeq ) FromEntriesSequence.__proto__ = KeyedSeq;
-  FromEntriesSequence.prototype = Object.create( KeyedSeq && KeyedSeq.prototype );
-  FromEntriesSequence.prototype.constructor = FromEntriesSequence;
-
-  FromEntriesSequence.prototype.entrySeq = function entrySeq () {
-    return this._iter.toSeq();
-  };
-
-  FromEntriesSequence.prototype.__iterate = function __iterate (fn, reverse) {
-    var this$1$1 = this;
-
-    return this._iter.__iterate(function (entry) {
-      // Check if entry exists first so array access doesn't throw for holes
-      // in the parent iteration.
-      if (entry) {
-        validateEntry(entry);
-        var indexedCollection = isCollection(entry);
-        return fn(
-          indexedCollection ? entry.get(1) : entry[1],
-          indexedCollection ? entry.get(0) : entry[0],
-          this$1$1
-        );
-      }
-    }, reverse);
-  };
-
-  FromEntriesSequence.prototype.__iterator = function __iterator (type, reverse) {
-    var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);
-    return new Iterator(function () {
-      while (true) {
-        var step = iterator.next();
-        if (step.done) {
-          return step;
-        }
-        var entry = step.value;
-        // Check if entry exists first so array access doesn't throw for holes
-        // in the parent iteration.
-        if (entry) {
-          validateEntry(entry);
-          var indexedCollection = isCollection(entry);
-          return iteratorValue(
-            type,
-            indexedCollection ? entry.get(0) : entry[0],
-            indexedCollection ? entry.get(1) : entry[1],
-            step
-          );
-        }
-      }
-    });
-  };
-
-  return FromEntriesSequence;
-}(KeyedSeq));
-
-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 () {
-    var reversedSequence = collection.reverse.apply(this); // super.reverse()
-    reversedSequence.flip = function () { return collection.reverse(); };
-    return reversedSequence;
-  };
-  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$1 = this;
-
-    return collection.__iterate(function (v, k) { return fn(k, v, this$1$1) !== false; }, reverse);
-  };
-  flipSequence.__iteratorUncached = function (type, reverse) {
-    if (type === ITERATE_ENTRIES) {
-      var iterator = collection.__iterator(type, reverse);
-      return new Iterator(function () {
-        var step = iterator.next();
-        if (!step.done) {
-          var k = step.value[0];
-          step.value[0] = step.value[1];
-          step.value[1] = k;
-        }
-        return step;
-      });
-    }
-    return collection.__iterator(
-      type === ITERATE_VALUES ? ITERATE_KEYS : ITERATE_VALUES,
-      reverse
-    );
-  };
-  return flipSequence;
-}
-
-function mapFactory(collection, mapper, context) {
-  var mappedSequence = makeSequence(collection);
-  mappedSequence.size = collection.size;
-  mappedSequence.has = function (key) { return collection.has(key); };
-  mappedSequence.get = function (key, notSetValue) {
-    var v = collection.get(key, NOT_SET);
-    return v === NOT_SET
-      ? notSetValue
-      : mapper.call(context, v, key, collection);
-  };
-  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$1) !== false; },
-      reverse
-    );
-  };
-  mappedSequence.__iteratorUncached = function (type, reverse) {
-    var iterator = collection.__iterator(ITERATE_ENTRIES, reverse);
-    return new Iterator(function () {
-      var step = iterator.next();
-      if (step.done) {
-        return step;
-      }
-      var entry = step.value;
-      var key = entry[0];
-      return iteratorValue(
-        type,
-        key,
-        mapper.call(context, entry[1], key, collection),
-        step
-      );
-    });
-  };
-  return mappedSequence;
-}
-
-function reverseFactory(collection, useKeys) {
-  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 () {
-      var flipSequence = flipFactory(collection);
-      flipSequence.reverse = function () { return collection.flip(); };
-      return flipSequence;
-    };
-  }
-  reversedSequence.get = function (key, notSetValue) { return collection.get(useKeys ? key : -1 - key, notSetValue); };
-  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$1 = this;
-
-    var i = 0;
-    reverse && ensureSize(collection);
-    return collection.__iterate(
-      function (v, k) { return fn(v, useKeys ? k : reverse ? this$1$1.size - ++i : i++, this$1$1); },
-      !reverse
-    );
-  };
-  reversedSequence.__iterator = function (type, reverse) {
-    var i = 0;
-    reverse && ensureSize(collection);
-    var iterator = collection.__iterator(ITERATE_ENTRIES, !reverse);
-    return new Iterator(function () {
-      var step = iterator.next();
-      if (step.done) {
-        return step;
-      }
-      var entry = step.value;
-      return iteratorValue(
-        type,
-        useKeys ? entry[0] : reverse ? this$1$1.size - ++i : i++,
-        entry[1],
-        step
-      );
-    });
-  };
-  return reversedSequence;
-}
-
-function filterFactory(collection, predicate, context, useKeys) {
-  var filterSequence = makeSequence(collection);
-  if (useKeys) {
-    filterSequence.has = function (key) {
-      var v = collection.get(key, NOT_SET);
-      return v !== NOT_SET && !!predicate.call(context, v, key, collection);
-    };
-    filterSequence.get = function (key, notSetValue) {
-      var v = collection.get(key, NOT_SET);
-      return v !== NOT_SET && predicate.call(context, v, key, collection)
-        ? v
-        : notSetValue;
-    };
-  }
-  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$1);
-      }
-    }, reverse);
-    return iterations;
-  };
-  filterSequence.__iteratorUncached = function (type, reverse) {
-    var iterator = collection.__iterator(ITERATE_ENTRIES, reverse);
-    var iterations = 0;
-    return new Iterator(function () {
-      while (true) {
-        var step = iterator.next();
-        if (step.done) {
-          return step;
-        }
-        var entry = step.value;
-        var key = entry[0];
-        var value = entry[1];
-        if (predicate.call(context, value, key, collection)) {
-          return iteratorValue(type, useKeys ? key : iterations++, value, step);
-        }
-      }
-    });
-  };
-  return filterSequence;
-}
-
-function countByFactory(collection, grouper, context) {
-  var groups = Map().asMutable();
-  collection.__iterate(function (v, k) {
-    groups.update(grouper.call(context, v, k, collection), 0, function (a) { return a + 1; });
-  });
-  return groups.asImmutable();
-}
-
-function groupByFactory(collection, grouper, context) {
-  var isKeyedIter = isKeyed(collection);
-  var groups = (isOrdered(collection) ? OrderedMap() : Map()).asMutable();
-  collection.__iterate(function (v, k) {
-    groups.update(
-      grouper.call(context, v, k, collection),
-      function (a) { return ((a = a || []), a.push(isKeyedIter ? [k, v] : v), a); }
-    );
-  });
-  var coerce = collectionClass(collection);
-  return groups.map(function (arr) { return reify(collection, coerce(arr)); }).asImmutable();
-}
-
-function partitionFactory(collection, predicate, context) {
-  var isKeyedIter = isKeyed(collection);
-  var groups = [[], []];
-  collection.__iterate(function (v, k) {
-    groups[predicate.call(context, v, k, collection) ? 1 : 0].push(
-      isKeyedIter ? [k, v] : v
-    );
-  });
-  var coerce = collectionClass(collection);
-  return groups.map(function (arr) { return reify(collection, coerce(arr)); });
-}
-
-function sliceFactory(collection, begin, end, useKeys) {
-  var originalSize = collection.size;
-
-  if (wholeSlice(begin, end, originalSize)) {
-    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
-  // 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) {
-    return sliceFactory(collection.toSeq().cacheResult(), begin, end, useKeys);
-  }
-
-  // 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.
-  // In that case, resolvedSize will be NaN and sliceSize will remain undefined.
-  var resolvedSize = resolvedEnd - resolvedBegin;
-  var sliceSize;
-  if (resolvedSize === resolvedSize) {
-    sliceSize = resolvedSize < 0 ? 0 : resolvedSize;
-  }
-
-  var sliceSeq = makeSequence(collection);
-
-  // If collection.size is undefined, the size of the realized sliceSeq is
-  // unknown at this point unless the number of items to slice is 0
-  sliceSeq.size =
-    sliceSize === 0 ? sliceSize : (collection.size && sliceSize) || undefined;
-
-  if (!useKeys && isSeq(collection) && sliceSize >= 0) {
-    sliceSeq.get = function (index, notSetValue) {
-      index = wrapIndex(this, index);
-      return index >= 0 && index < sliceSize
-        ? collection.get(index + resolvedBegin, notSetValue)
-        : notSetValue;
-    };
-  }
-
-  sliceSeq.__iterateUncached = function (fn, reverse) {
-    var this$1$1 = this;
-
-    if (sliceSize === 0) {
-      return 0;
-    }
-    if (reverse) {
-      return this.cacheResult().__iterate(fn, reverse);
-    }
-    var skipped = 0;
-    var isSkipping = true;
-    var iterations = 0;
-    collection.__iterate(function (v, k) {
-      if (!(isSkipping && (isSkipping = skipped++ < resolvedBegin))) {
-        iterations++;
-        return (
-          fn(v, useKeys ? k : iterations - 1, this$1$1) !== false &&
-          iterations !== sliceSize
-        );
-      }
-    });
-    return iterations;
-  };
-
-  sliceSeq.__iteratorUncached = function (type, reverse) {
-    if (sliceSize !== 0 && reverse) {
-      return this.cacheResult().__iterator(type, reverse);
-    }
-    // Don't bother instantiating parent iterator if taking 0.
-    if (sliceSize === 0) {
-      return new Iterator(iteratorDone);
-    }
-    var iterator = collection.__iterator(type, reverse);
-    var skipped = 0;
-    var iterations = 0;
-    return new Iterator(function () {
-      while (skipped++ < resolvedBegin) {
-        iterator.next();
-      }
-      if (++iterations > sliceSize) {
-        return iteratorDone();
-      }
-      var step = iterator.next();
-      if (useKeys || type === ITERATE_VALUES || step.done) {
-        return step;
-      }
-      if (type === ITERATE_KEYS) {
-        return iteratorValue(type, iterations - 1, undefined, step);
-      }
-      return iteratorValue(type, iterations - 1, step.value[1], step);
-    });
-  };
-
-  return sliceSeq;
-}
-
-function takeWhileFactory(collection, predicate, context) {
-  var takeSequence = makeSequence(collection);
-  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$1); }
-    );
-    return iterations;
-  };
-  takeSequence.__iteratorUncached = function (type, reverse) {
-    var this$1$1 = this;
-
-    if (reverse) {
-      return this.cacheResult().__iterator(type, reverse);
-    }
-    var iterator = collection.__iterator(ITERATE_ENTRIES, reverse);
-    var iterating = true;
-    return new Iterator(function () {
-      if (!iterating) {
-        return iteratorDone();
-      }
-      var step = iterator.next();
-      if (step.done) {
-        return step;
-      }
-      var entry = step.value;
-      var k = entry[0];
-      var v = entry[1];
-      if (!predicate.call(context, v, k, this$1$1)) {
-        iterating = false;
-        return iteratorDone();
-      }
-      return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);
-    });
-  };
-  return takeSequence;
-}
-
-function skipWhileFactory(collection, predicate, context, useKeys) {
-  var skipSequence = makeSequence(collection);
-  skipSequence.__iterateUncached = function (fn, reverse) {
-    var this$1$1 = this;
-
-    if (reverse) {
-      return this.cacheResult().__iterate(fn, reverse);
-    }
-    var isSkipping = true;
-    var iterations = 0;
-    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$1);
-      }
-    });
-    return iterations;
-  };
-  skipSequence.__iteratorUncached = function (type, reverse) {
-    var this$1$1 = this;
-
-    if (reverse) {
-      return this.cacheResult().__iterator(type, reverse);
-    }
-    var iterator = collection.__iterator(ITERATE_ENTRIES, reverse);
-    var skipping = true;
-    var iterations = 0;
-    return new Iterator(function () {
-      var step;
-      var k;
-      var v;
-      do {
-        step = iterator.next();
-        if (step.done) {
-          if (useKeys || type === ITERATE_VALUES) {
-            return step;
-          }
-          if (type === ITERATE_KEYS) {
-            return iteratorValue(type, iterations++, undefined, step);
-          }
-          return iteratorValue(type, iterations++, step.value[1], step);
-        }
-        var entry = step.value;
-        k = entry[0];
-        v = entry[1];
-        skipping && (skipping = predicate.call(context, v, k, this$1$1));
-      } while (skipping);
-      return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);
-    });
-  };
-  return skipSequence;
-}
-
-function concatFactory(collection, values) {
-  var isKeyedCollection = isKeyed(collection);
-  var iters = [collection]
-    .concat(values)
-    .map(function (v) {
-      if (!isCollection(v)) {
-        v = isKeyedCollection
-          ? keyedSeqFromValue(v)
-          : indexedSeqFromValue(Array.isArray(v) ? v : [v]);
-      } else if (isKeyedCollection) {
-        v = KeyedCollection(v);
-      }
-      return v;
-    })
-    .filter(function (v) { return v.size !== 0; });
-
-  if (iters.length === 0) {
-    return collection;
-  }
-
-  if (iters.length === 1) {
-    var singleton = iters[0];
-    if (
-      singleton === collection ||
-      (isKeyedCollection && isKeyed(singleton)) ||
-      (isIndexed(collection) && isIndexed(singleton))
-    ) {
-      return singleton;
-    }
-  }
-
-  var concatSeq = new ArraySeq(iters);
-  if (isKeyedCollection) {
-    concatSeq = concatSeq.toKeyedSeq();
-  } else if (!isIndexed(collection)) {
-    concatSeq = concatSeq.toSetSeq();
-  }
-  concatSeq = concatSeq.flatten(true);
-  concatSeq.size = iters.reduce(function (sum, seq) {
-    if (sum !== undefined) {
-      var size = seq.size;
-      if (size !== undefined) {
-        return sum + size;
-      }
-    }
-  }, 0);
-  return concatSeq;
-}
-
-function flattenFactory(collection, depth, useKeys) {
-  var flatSequence = makeSequence(collection);
-  flatSequence.__iterateUncached = function (fn, reverse) {
-    if (reverse) {
-      return this.cacheResult().__iterate(fn, reverse);
-    }
-    var iterations = 0;
-    var stopped = false;
-    function flatDeep(iter, currentDepth) {
-      iter.__iterate(function (v, k) {
-        if ((!depth || currentDepth < depth) && isCollection(v)) {
-          flatDeep(v, currentDepth + 1);
-        } else {
-          iterations++;
-          if (fn(v, useKeys ? k : iterations - 1, flatSequence) === false) {
-            stopped = true;
-          }
-        }
-        return !stopped;
-      }, reverse);
-    }
-    flatDeep(collection, 0);
-    return iterations;
-  };
-  flatSequence.__iteratorUncached = function (type, reverse) {
-    if (reverse) {
-      return this.cacheResult().__iterator(type, reverse);
-    }
-    var iterator = collection.__iterator(type, reverse);
-    var stack = [];
-    var iterations = 0;
-    return new Iterator(function () {
-      while (iterator) {
-        var step = iterator.next();
-        if (step.done !== false) {
-          iterator = stack.pop();
-          continue;
-        }
-        var v = step.value;
-        if (type === ITERATE_ENTRIES) {
-          v = v[1];
-        }
-        if ((!depth || stack.length < depth) && isCollection(v)) {
-          stack.push(iterator);
-          iterator = v.__iterator(type, reverse);
-        } else {
-          return useKeys ? step : iteratorValue(type, iterations++, v, step);
-        }
-      }
-      return iteratorDone();
-    });
-  };
-  return flatSequence;
-}
-
-function flatMapFactory(collection, mapper, context) {
-  var coerce = collectionClass(collection);
-  return collection
-    .toSeq()
-    .map(function (v, k) { return coerce(mapper.call(context, v, k, collection)); })
-    .flatten(true);
-}
-
-function interposeFactory(collection, separator) {
-  var interposedSequence = makeSequence(collection);
-  interposedSequence.size = collection.size && collection.size * 2 - 1;
-  interposedSequence.__iterateUncached = function (fn, reverse) {
-    var this$1$1 = this;
-
-    var iterations = 0;
-    collection.__iterate(
-      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) {
-    var iterator = collection.__iterator(ITERATE_VALUES, reverse);
-    var iterations = 0;
-    var step;
-    return new Iterator(function () {
-      if (!step || iterations % 2) {
-        step = iterator.next();
-        if (step.done) {
-          return step;
-        }
-      }
-      return iterations % 2
-        ? iteratorValue(type, iterations++, separator)
-        : iteratorValue(type, iterations++, step.value, step);
-    });
-  };
-  return interposedSequence;
-}
-
-function sortFactory(collection, comparator, mapper) {
-  if (!comparator) {
-    comparator = defaultComparator;
-  }
-  var isKeyedCollection = isKeyed(collection);
-  var index = 0;
-  var entries = collection
-    .toSeq()
-    .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];
-          }
-    );
-  return isKeyedCollection
-    ? KeyedSeq(entries)
-    : isIndexed(collection)
-    ? IndexedSeq(entries)
-    : SetSeq(entries);
-}
-
-function maxFactory(collection, comparator, mapper) {
-  if (!comparator) {
-    comparator = defaultComparator;
-  }
-  if (mapper) {
-    var entry = collection
-      .toSeq()
-      .map(function (v, k) { return [v, mapper(v, k, collection)]; })
-      .reduce(function (a, b) { return (maxCompare(comparator, a[1], b[1]) ? b : a); });
-    return entry && entry[0];
-  }
-  return collection.reduce(function (a, b) { return (maxCompare(comparator, a, b) ? b : a); });
-}
-
-function maxCompare(comparator, a, b) {
-  var comp = comparator(b, a);
-  // b is considered the new max if the comparator declares them equal, but
-  // they are not equal and b is in fact a nullish value.
-  return (
-    (comp === 0 && b !== a && (b === undefined || b === null || b !== b)) ||
-    comp > 0
-  );
-}
-
-function zipWithFactory(keyIter, zipper, iters, zipAll) {
-  var zipSequence = makeSequence(keyIter);
-  var sizes = new ArraySeq(iters).map(function (i) { return i.size; });
-  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) {
-    /* generic:
-    var iterator = this.__iterator(ITERATE_ENTRIES, reverse);
-    var step;
-    var iterations = 0;
-    while (!(step = iterator.next()).done) {
-      iterations++;
-      if (fn(step.value[1], step.value[0], this) === false) {
-        break;
-      }
-    }
-    return iterations;
-    */
-    // indexed:
-    var iterator = this.__iterator(ITERATE_VALUES, reverse);
-    var step;
-    var iterations = 0;
-    while (!(step = iterator.next()).done) {
-      if (fn(step.value, iterations++, this) === false) {
-        break;
-      }
-    }
-    return iterations;
-  };
-  zipSequence.__iteratorUncached = function (type, reverse) {
-    var iterators = iters.map(
-      function (i) { return ((i = Collection(i)), getIterator(reverse ? i.reverse() : i)); }
-    );
-    var iterations = 0;
-    var isDone = false;
-    return new Iterator(function () {
-      var steps;
-      if (!isDone) {
-        steps = iterators.map(function (i) { return i.next(); });
-        isDone = zipAll ? steps.every(function (s) { return s.done; }) : steps.some(function (s) { return s.done; });
-      }
-      if (isDone) {
-        return iteratorDone();
-      }
-      return iteratorValue(
-        type,
-        iterations++,
-        zipper.apply(
-          null,
-          steps.map(function (s) { return s.value; })
-        )
-      );
-    });
-  };
-  return zipSequence;
-}
-
-// #pragma Helper Functions
-
-function reify(iter, seq) {
-  return iter === seq ? iter : isSeq(iter) ? seq : iter.constructor(seq);
-}
-
-function validateEntry(entry) {
-  if (entry !== Object(entry)) {
-    throw new TypeError('Expected [K, V] tuple: ' + entry);
-  }
-}
-
-function collectionClass(collection) {
-  return isKeyed(collection)
-    ? KeyedCollection
-    : isIndexed(collection)
-    ? IndexedCollection
-    : SetCollection;
-}
-
-function makeSequence(collection) {
-  return Object.create(
-    (isKeyed(collection)
-      ? KeyedSeq
-      : isIndexed(collection)
-      ? IndexedSeq
-      : SetSeq
-    ).prototype
-  );
-}
-
-function cacheResultThrough() {
-  if (this._iter.cacheResult) {
-    this._iter.cacheResult();
-    this.size = this._iter.size;
-    return this;
-  }
-  return Seq.prototype.cacheResult.call(this);
-}
-
-function defaultComparator(a, b) {
-  if (a === undefined && b === undefined) {
-    return 0;
-  }
-
-  if (a === undefined) {
-    return 1;
-  }
-
-  if (b === undefined) {
-    return -1;
-  }
-
-  return a > b ? 1 : a < b ? -1 : 0;
-}
-
-export { FromEntriesSequence, ToIndexedSequence, ToKeyedSequence, ToSetSequence, concatFactory, countByFactory, filterFactory, flatMapFactory, flattenFactory, flipFactory, groupByFactory, interposeFactory, mapFactory, maxFactory, partitionFactory, reify, reverseFactory, skipWhileFactory, sliceFactory, sortFactory, takeWhileFactory, zipWithFactory };