@fncts/base 0.0.1

package/_cjs/collection/immutable/Conc/api.cjs

@@ -0,0 +1,1493 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.alignWith_ = exports.ConcBuilder = void 0;
+exports.align_ = align_;
+exports.builder = exports.append_ = void 0;
+exports.chainRecBreadthFirst = chainRecBreadthFirst;
+exports.chainRecDepthFirst = chainRecDepthFirst;
+exports.chop_ = void 0;
+exports.chunksOf_ = chunksOf_;
+exports.collectWhile_ = void 0;
+exports.compact = compact;
+exports.concat_ = void 0;
+exports.dropWhile_ = dropWhile_;
+exports.drop_ = void 0;
+exports.elem_ = elem_;
+exports.filterWithIndex_ = exports.filterMap_ = exports.filterMapWithIndex_ = exports.exists_ = void 0;
+exports.filter_ = filter_;
+exports.find_ = find_;
+exports.flatMap_ = void 0;
+exports.flatten = flatten;
+exports.foldLeftWhile_ = foldLeftWhile_;
+exports.foldLeft_ = exports.foldLeftWithIndex_ = void 0;
+exports.foldMapSelf = foldMapSelf;
+exports.foldMapWithIndexSelf = void 0;
+exports.foldMapWithIndex_ = foldMapWithIndex_;
+exports.foldMap_ = foldMap_;
+exports.foldRightWithIndex_ = void 0;
+exports.foldRight_ = foldRight_;
+exports.forEachWithIndex_ = forEachWithIndex_;
+exports.forEach_ = void 0;
+exports.get_ = get_;
+exports.head = head;
+exports.init = init;
+exports.isNonEmpty = exports.isEmpty = void 0;
+exports.join_ = join_;
+exports.last = last;
+exports.mapAccum_ = mapAccum_;
+exports.mapWithIndex_ = void 0;
+exports.map_ = map_;
+exports.partitionWithIndex_ = exports.partitionMap_ = exports.partitionMapWithIndex_ = void 0;
+exports.partition_ = partition_;
+exports.prepend_ = prepend_;
+exports.reverse = reverse;
+exports.separate = separate;
+exports.splitAt_ = void 0;
+exports.splitWhere_ = splitWhere_;
+exports.tail = tail;
+exports.takeWhile_ = takeWhile_;
+exports.traverse_ = exports.traverseWithIndex_ = exports.traverseSelfWithIndex = exports.traverseSelf = exports.take_ = void 0;
+exports.unfold = unfold;
+exports.unsafeUpdateAt_ = exports.unsafeTail = exports.unsafeHead = exports.unsafeGet_ = void 0;
+exports.updateAt_ = updateAt_;
+exports.zipWithIndex = zipWithIndex;
+exports.zipWith_ = exports.zipWithIndexOffset_ = void 0;
+exports.zip_ = zip_;
+
+var tsplus_module_1 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/data/These/constructors"));
+
+var tsplus_module_2 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/collection/immutable/Conc/api/empty"));
+
+var tsplus_module_3 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/collection/immutable/Conc/constructors"));
+
+var tsplus_module_4 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/data/Maybe/destructors"));
+
+var tsplus_module_5 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/data/Maybe/definition"));
+
+var tsplus_module_6 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/data/Maybe/constructors"));
+
+var tsplus_module_7 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/internal/Stack"));
+
+var tsplus_module_8 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/data/Either/destructors"));
+
+var tsplus_module_9 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/collection/Iterable/constructors"));
+
+var tsplus_module_10 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/data/exceptions"));
+
+var _definition2 = /*#__PURE__*/require("@fncts/base/collection/immutable/Conc/definition");
+
+var _function = /*#__PURE__*/require("@fncts/base/data/function");
+
+var P = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/typeclass"));
+
+function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
+
+function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+
+const alignWith_ = alignWith_1;
+exports.alignWith_ = alignWith_;
+const append_ = append_1;
+exports.append_ = append_;
+const builder = builder_1;
+exports.builder = builder;
+const flatMap_ = flatMap_1;
+exports.flatMap_ = flatMap_;
+const chop_ = chop_1;
+exports.chop_ = chop_;
+const collectWhile_ = collectWhile_1;
+exports.collectWhile_ = collectWhile_;
+const concat_ = concat_1;
+exports.concat_ = concat_;
+const exists_ = exists_1;
+exports.exists_ = exists_;
+const drop_ = drop_1;
+exports.drop_ = drop_;
+const filterMap_ = filterMap_1;
+exports.filterMap_ = filterMap_;
+const filterMapWithIndex_ = filterMapWithIndex_1;
+exports.filterMapWithIndex_ = filterMapWithIndex_;
+const filterWithIndex_ = filterWithIndex_1;
+exports.filterWithIndex_ = filterWithIndex_;
+const foldLeft_ = foldLeft_1;
+exports.foldLeft_ = foldLeft_;
+const foldLeftWithIndex_ = foldLeftWithIndex_1;
+exports.foldLeftWithIndex_ = foldLeftWithIndex_;
+const foldMapWithIndexSelf = foldMapWithIndexSelf_1;
+exports.foldMapWithIndexSelf = foldMapWithIndexSelf;
+const foldRightWithIndex_ = foldRightWithIndex_1;
+exports.foldRightWithIndex_ = foldRightWithIndex_;
+const forEach_ = forEach_1;
+exports.forEach_ = forEach_;
+const mapWithIndex_ = mapWithIndex_1;
+exports.mapWithIndex_ = mapWithIndex_;
+const isEmpty = isEmpty_1;
+exports.isEmpty = isEmpty;
+const isNonEmpty = isNonEmpty_1;
+exports.isNonEmpty = isNonEmpty;
+const partitionMap_ = partitionMap_1;
+exports.partitionMap_ = partitionMap_;
+const partitionMapWithIndex_ = partitionMapWithIndex_1;
+exports.partitionMapWithIndex_ = partitionMapWithIndex_;
+const partitionWithIndex_ = partitionWithIndex_1;
+exports.partitionWithIndex_ = partitionWithIndex_;
+const splitAt_ = splitAt_1;
+exports.splitAt_ = splitAt_;
+const take_ = take_1;
+exports.take_ = take_;
+const unsafeGet_ = unsafeGet_1;
+exports.unsafeGet_ = unsafeGet_;
+const unsafeHead = unsafeHead_1;
+exports.unsafeHead = unsafeHead;
+const unsafeTail = unsafeTail_1;
+exports.unsafeTail = unsafeTail;
+const unsafeUpdateAt_ = unsafeUpdateAt_1;
+exports.unsafeUpdateAt_ = unsafeUpdateAt_;
+const zipWith_ = zipWith_1;
+exports.zipWith_ = zipWith_;
+const zipWithIndexOffset_ = zipWithIndexOffset_1;
+exports.zipWithIndexOffset_ = zipWithIndexOffset_;
+
+/**
+ * @tsplus fluent fncts.Conc align
+ */
+function align_(self, fb) {
+  return alignWith_1(self, fb, _function.identity);
+}
+/**
+ * @tsplus fluent fncts.Conc alignWith
+ */
+
+
+function alignWith_1(self, fb, f) {
+  void 0;
+  void 0;
+  const out = builder_1();
+  const minlen = Math.min(self.length, fb.length);
+  const maxlen = Math.max(self.length, fb.length);
+
+  for (let i = 0; i < minlen; i++) {
+    out.append(f(tsplus_module_1.both(self.get(i), fb.get(i))));
+  }
+
+  if (minlen === maxlen) {
+    return out.result();
+  } else if (self.length > fb.length) {
+    for (let i = minlen; i < maxlen; i++) {
+      out.append(f(tsplus_module_1.left(self.get(i))));
+    }
+  } else {
+    for (let i = minlen; i < maxlen; i++) {
+      out.append(f(tsplus_module_1.right(fb.get(i))));
+    }
+  }
+
+  return out.result();
+}
+/**
+ * @tsplus fluent fncts.Conc append
+ */
+
+
+function append_1(self, a) {
+  void 0;
+  return self.append(a);
+}
+
+class ConcBuilder {
+  constructor(conc) {
+    this.conc = conc;
+  }
+
+  append(a) {
+    this.conc = append_1(this.conc, a);
+    return this;
+  }
+
+  result() {
+    return this.conc;
+  }
+
+}
+/**
+ * @tsplus static fncts.ConcOps builder
+ */
+
+
+exports.ConcBuilder = ConcBuilder;
+
+function builder_1() {
+  return new ConcBuilder(tsplus_module_2.empty());
+}
+/**
+ * @tsplus fluent fncts.Conc flatMap
+ */
+
+
+function flatMap_1(ma, f) {
+  void 0;
+  const iterator = ma.arrayIterator();
+  let result;
+  let out = tsplus_module_2.empty();
+
+  while (!(result = iterator.next()).done) {
+    const arr = result.value;
+    const length = arr.length;
+
+    for (let i = 0; i < length; i++) {
+      const a = arr[i];
+      out = concat_1(out, f(a));
+    }
+  }
+
+  return out;
+}
+/**
+ * @tsplus static fncts.ConcOps chainRecDepthFirst
+ */
+
+
+function chainRecDepthFirst(a, f) {
+  let buffer = f(a);
+  let out = tsplus_module_2.empty();
+
+  while (buffer.length > 0) {
+    const e = unsafeHead_1(buffer);
+    buffer = unsafeTail_1(buffer);
+
+    if (e._tag === "Left"
+    /* EitherTag.Left */
+    ) {
+      buffer = concat_1(f(e.left), buffer);
+    } else {
+      out = append_1(out, e.right);
+    }
+  }
+
+  return out;
+}
+/**
+ * @tsplus static fncts.ConcOps chainRecBreadthFirst
+ */
+
+
+function chainRecBreadthFirst(a, f) {
+  const initial = f(a);
+  let buffer = tsplus_module_2.empty();
+  let out = tsplus_module_2.empty();
+
+  function go(e) {
+    if (e._tag === "Left"
+    /* EitherTag.Left */
+    ) {
+      forEach_1(f(e.left), ab => (buffer = append_1(buffer, ab), undefined));
+    } else {
+      out = append_1(out, e.right);
+    }
+  }
+
+  for (const e of initial) {
+    go(e);
+  }
+
+  while (buffer.length > 0) {
+    const ab = unsafeHead_1(buffer);
+    buffer = unsafeTail_1(buffer);
+    go(ab);
+  }
+
+  return out;
+}
+/**
+ * @tsplus fluent fncts.Conc chop
+ */
+
+
+function chop_1(self, f) {
+  const out = builder_1();
+  let cs = self;
+
+  while (isNonEmpty_1(cs)) {
+    const [b, c] = f(cs);
+    out.append(b);
+    cs = c;
+  }
+
+  return out.result();
+}
+/**
+ * @tsplus fluent fncts.Conc chunksOf
+ */
+
+
+function chunksOf_(self, n) {
+  return chop_1(self, as => splitAt_1(as, n));
+}
+/**
+ * Transforms all elements of the Conc for as long as the specified partial function is defined.
+ *
+ * @tsplus fluent fncts.Conc collectWhile
+ */
+
+
+function collectWhile_1(as, f) {
+  void 0;
+
+  switch (as._tag) {
+    case "Singleton"
+    /* ConcTag.Singleton */
+    :
+      {
+        return tsplus_module_4.match_(f(as.value), () => tsplus_module_2.empty(), tsplus_module_3.single);
+      }
+
+    case "Chunk"
+    /* ConcTag.Chunk */
+    :
+      {
+        const array = as.arrayLike();
+        let dest = tsplus_module_2.empty();
+
+        for (let i = 0; i < array.length; i++) {
+          const rhs = f(array[i]);
+
+          if (tsplus_module_5.isJust(rhs)) {
+            dest = append_1(dest, rhs.value);
+          } else {
+            return dest;
+          }
+        }
+
+        return dest;
+      }
+
+    default:
+      {
+        return collectWhile_1(as.materialize(), f);
+      }
+  }
+}
+/**
+ * @tsplus getter fncts.Conc compact
+ */
+
+
+function compact(self) {
+  return filterMap_1(self, _function.identity);
+}
+/**
+ * @tsplus fluent fncts.Conc concat
+ */
+
+
+function concat_1(self, that) {
+  void 0;
+  void 0;
+  return self.concat(that);
+}
+/**
+ * @tsplus getter fncts.Conc elem
+ */
+
+
+function elem_(self) {
+  return E => a => exists_1(self, el => E.equals_(el, a));
+}
+/**
+ * @tsplus fluent fncts.Conc exists
+ */
+
+
+function exists_1(as, predicate) {
+  void 0;
+  const iterator = as.arrayIterator();
+  let exists = false;
+  let result;
+
+  while (!exists && !(result = iterator.next()).done) {
+    const array = result.value;
+
+    for (let i = 0; !exists && i < array.length; i++) {
+      exists = predicate(array[i]);
+    }
+  }
+
+  return exists;
+}
+/**
+ * @tsplus fluent fncts.Conc drop
+ */
+
+
+function drop_1(self, n) {
+  void 0;
+  const len = self.length;
+
+  if (len <= 0) {
+    return self;
+  } else if (n >= len) {
+    return tsplus_module_2.empty();
+  } else {
+    switch (self._tag) {
+      case "Slice"
+      /* ConcTag.Slice */
+      :
+        return new _definition2.Slice(self.conc, self.offset + n, self.l - n);
+
+      case "Singleton"
+      /* ConcTag.Singleton */
+      :
+        return n > 0 ? tsplus_module_2.empty() : self;
+
+      case "Empty"
+      /* ConcTag.Empty */
+      :
+        return tsplus_module_2.empty();
+
+      default:
+        return new _definition2.Slice(self, n, len - n);
+    }
+  }
+}
+/**
+ * @tsplus fluent fncts.Conc dropWhile
+ */
+
+
+function dropWhile_(self, p) {
+  void 0;
+
+  switch (self._tag) {
+    case "Chunk"
+    /* ConcTag.Chunk */
+    :
+      {
+        const arr = self.arrayLike();
+        let i = 0;
+
+        while (i < arr.length && p(arr[i])) {
+          i++;
+        }
+
+        return drop_1(self, i);
+      }
+
+    default:
+      {
+        const iterator = self.arrayIterator();
+        let result;
+        let cont = true;
+        let i = 0;
+
+        while (cont && !(result = iterator.next()).done) {
+          const array = result.value;
+          let j = 0;
+
+          while (cont && j < array.length) {
+            if (p(array[j])) {
+              i++;
+              j++;
+            } else {
+              cont = false;
+            }
+          }
+        }
+
+        return drop_1(self, i);
+      }
+  }
+}
+
+function filter_(self, p) {
+  return filterWithIndex_1(self, (_, a) => p(a));
+}
+/**
+ * @tsplus fluent fncts.Conc filterMap
+ */
+
+
+function filterMap_1(self, f) {
+  return filterMapWithIndex_1(self, (_, a) => f(a));
+}
+/**
+ * @tsplus fluent fncts.Conc filterMapWithIndex
+ */
+
+
+function filterMapWithIndex_1(self, f) {
+  void 0;
+  const iterator = self.arrayIterator();
+  const out = builder_1();
+  let result;
+  let i = 0;
+
+  while (!(result = iterator.next()).done) {
+    const array = result.value;
+
+    for (let j = 0; j < array.length; j++) {
+      const ob = f(i, array[j]);
+
+      if (tsplus_module_5.isJust(ob)) {
+        out.append(ob.value);
+      }
+
+      i++;
+    }
+  }
+
+  return out.result();
+}
+
+function filterWithIndex_1(self, p) {
+  void 0;
+
+  switch (self._tag) {
+    case "Empty"
+    /* ConcTag.Empty */
+    :
+      {
+        return _definition2._Empty;
+      }
+
+    case "Chunk"
+    /* ConcTag.Chunk */
+    :
+      {
+        const arr = self.arrayLike();
+        let builder = tsplus_module_2.empty();
+
+        for (let i = 0; i < arr.length; i++) {
+          const a = arr[i];
+
+          if (p(i, a)) {
+            builder = append_1(builder, a);
+          }
+        }
+
+        return builder;
+      }
+
+    case "Singleton"
+    /* ConcTag.Singleton */
+    :
+      {
+        if (p(0, self.value)) {
+          return self;
+        }
+
+        return _definition2._Empty;
+      }
+
+    default:
+      {
+        const iterator = self.arrayIterator();
+        let out = tsplus_module_2.empty();
+        let result;
+        let i = 0;
+
+        while (!(result = iterator.next()).done) {
+          const array = result.value;
+
+          for (let j = 0; j < array.length; j++) {
+            const a = array[j];
+
+            if (p(i, a)) {
+              out = append_1(out, a);
+            }
+
+            i++;
+          }
+        }
+
+        return out;
+      }
+  }
+}
+/**
+ * @tsplus fluent fncts.Conc find
+ */
+
+
+function find_(self, f) {
+  void 0;
+  const iterator = self.arrayIterator();
+  let out = tsplus_module_6.nothing();
+  let result;
+
+  while (tsplus_module_5.isNothing(out) && !(result = iterator.next()).done) {
+    const array = result.value;
+    const length = array.length;
+
+    for (let i = 0; tsplus_module_5.isNothing(out) && i < length; i++) {
+      const a = array[i];
+
+      if (f(a)) {
+        out = tsplus_module_6.just(a);
+      }
+    }
+  }
+
+  return out;
+}
+/**
+ * @tsplus getter fncts.Conc flatten
+ */
+
+
+function flatten(self) {
+  return flatMap_1(self, _function.identity);
+}
+/**
+ * Folds over the elements in this Conc from the left.
+ * Stops the fold early when the condition is not fulfilled.
+ *
+ * @tsplus fluent fncts.Conc foldLeftWhile
+ */
+
+
+function foldLeftWhile_(as, b, p, f) {
+  void 0;
+  const iterator = as.arrayIterator();
+  let s = b;
+  let cont = p(s);
+  let result;
+
+  while (cont && !(result = iterator.next()).done) {
+    const array = result.value;
+
+    for (let i = 0; cont && i < array.length; i++) {
+      s = f(s, array[i]);
+      cont = p(s);
+    }
+  }
+
+  return s;
+}
+/**
+ * @tsplus fluent fncts.Conc foldLeft
+ */
+
+
+function foldLeft_1(self, b, f) {
+  return foldLeftWithIndex_1(self, b, (_, b, a) => f(b, a));
+}
+/**
+ * @tsplus fluent fncts.Conc foldLeftWithIndex
+ */
+
+
+function foldLeftWithIndex_1(self, b, f) {
+  void 0;
+  const iterator = self.arrayIterator();
+  let out = b;
+  let result;
+  let i = 0;
+
+  while (!(result = iterator.next()).done) {
+    const array = result.value;
+
+    for (let j = 0; j < array.length; j++) {
+      out = f(i, out, array[j]);
+      i++;
+    }
+  }
+
+  return out;
+}
+/**
+ * @constrained
+ */
+
+
+function foldMap_(M) {
+  return (fa, f) => foldMapWithIndexSelf_1(fa)(M)((_, a) => f(a));
+}
+/**
+ * @tsplus getter fncts.Conc foldMap
+ */
+
+
+function foldMapSelf(self) {
+  return M => f => foldMapWithIndexSelf_1(self)(M)((_, a) => f(a));
+}
+/**
+ * @constrained
+ */
+
+
+function foldMapWithIndex_(M) {
+  return (fa, f) => foldLeftWithIndex_1(fa, M.nat, (i, b, a) => M.combine_(b, f(i, a)));
+}
+/**
+ * @tsplus getter fncts.Conc foldMapWithIndex
+ */
+
+
+function foldMapWithIndexSelf_1(self) {
+  return M => f => foldMapWithIndex_(M)(self, f);
+}
+/**
+ * @tsplus fluent fncts.Conc foldRight
+ */
+
+
+function foldRight_(fa, b, f) {
+  return foldRightWithIndex_1(fa, b, (_, a, b) => f(a, b));
+}
+/**
+ * @tsplus fluent fncts.Conc foldRightWithIndex
+ */
+
+
+function foldRightWithIndex_1(self, b, f) {
+  void 0;
+  const iterator = self.reverseArrayIterator();
+  let out = b;
+  let result;
+  let i = self.length - 1;
+
+  while (!(result = iterator.next()).done) {
+    const array = result.value;
+
+    for (let j = array.length - 1; j >= 0; j--) {
+      out = f(i, array[i], out);
+      i--;
+    }
+  }
+
+  return out;
+}
+/**
+ * @tsplus fluent fncts.Conc forEach
+ */
+
+
+function forEach_1(self, f) {
+  void 0;
+  return self.forEach(0, (_, a) => f(a));
+}
+/**
+ * @tsplus fluent fncts.Conc forEachWithIndex
+ */
+
+
+function forEachWithIndex_(self, f) {
+  void 0;
+  self.forEach(0, f);
+}
+/**
+ * @tsplus fluent fncts.Conc get
+ */
+
+
+function get_(as, n) {
+  return tsplus_module_6.tryCatch(() => unsafeGet_1(as, n));
+}
+/**
+ * @tsplus getter fncts.Conc head
+ */
+
+
+function head(self) {
+  void 0;
+
+  if (isEmpty_1(self)) {
+    return tsplus_module_6.nothing();
+  }
+
+  return tsplus_module_6.just(self.get(0));
+}
+/**
+ * @tsplus getter fncts.Conc init
+ */
+
+
+function init(self) {
+  if (isEmpty_1(self)) {
+    return tsplus_module_6.nothing();
+  }
+
+  return tsplus_module_6.just(take_1(self, self.length - 1));
+}
+/**
+ * @tsplus fluent fncts.Conc join
+ */
+
+
+function join_(self, separator) {
+  if (self.length === 0) {
+    return "";
+  }
+
+  return foldLeft_1(unsafeTail_1(self), unsafeGet_1(self, 0), (b, s) => b + separator + s);
+}
+/**
+ * @tsplus getter fncts.Conc last
+ */
+
+
+function last(self) {
+  void 0;
+
+  if (isEmpty_1(self)) {
+    return tsplus_module_6.nothing();
+  }
+
+  return tsplus_module_6.just(self.get(self.length - 1));
+}
+/**
+ * @tsplus fluent fncts.Conc map
+ */
+
+
+function map_(self, f) {
+  return mapWithIndex_1(self, (_, a) => f(a));
+}
+/**
+ * Statefully maps over the Conc, producing new elements of type `B`.
+ *
+ * @tsplus fluent fncts.Conc mapAccum
+ */
+
+
+function mapAccum_(self, s, f) {
+  void 0;
+  const iterator = self.arrayIterator();
+  const out = builder_1();
+  let state = s;
+  let result;
+
+  while (!(result = iterator.next()).done) {
+    const array = result.value;
+    const length = array.length;
+
+    for (let i = 0; i < length; i++) {
+      const a = array[i];
+      const tup = f(state, a);
+      out.append(tup[0]);
+      state = tup[1];
+    }
+  }
+
+  return (0, _function.tuple)(out.result(), s);
+}
+
+function mapArrayLike(as, len, startIndex, f) {
+  let bs = tsplus_module_2.empty();
+
+  for (let i = 0; i < len; i++) {
+    bs = append_1(bs, f(i + startIndex, as[i]));
+  }
+
+  return bs;
+}
+
+function mapArrayLikeReverse(as, len, endIndex, f) {
+  let bs = tsplus_module_2.empty();
+
+  for (let i = _definition2.BUFFER_SIZE - len, j = len - 1; i < _definition2.BUFFER_SIZE; i++, j--) {
+    bs = append_1(bs, f(endIndex - j, as[i]));
+  }
+
+  return bs;
+}
+
+class DoneFrame {
+  constructor() {
+    this._tag = "Done";
+  }
+
+}
+
+class ConcatLeftFrame {
+  constructor(conc, currentIndex) {
+    this.conc = conc;
+    this.currentIndex = currentIndex;
+    this._tag = "ConcatLeft";
+  }
+
+}
+
+class ConcatRightFrame {
+  constructor(leftResult) {
+    this.leftResult = leftResult;
+    this._tag = "ConcatRight";
+  }
+
+}
+
+class AppendFrame {
+  constructor(buffer, bufferUsed, startIndex) {
+    this.buffer = buffer;
+    this.bufferUsed = bufferUsed;
+    this.startIndex = startIndex;
+    this._tag = "Append";
+  }
+
+}
+
+class PrependFrame {
+  constructor(pre, end) {
+    this.pre = pre;
+    this.end = end;
+    this._tag = "Prepend";
+  }
+
+}
+/**
+ * @tsplus fluent fncts.Conc mapWithIndex
+ */
+
+
+function mapWithIndex_1(self, f) {
+  let current = self;
+  let index = 0;
+  const stack = tsplus_module_7.mkStack();
+  stack.push(new DoneFrame());
+  let result = tsplus_module_2.empty();
+
+  recursion: while (stack.hasNext) {
+    // eslint-disable-next-line no-constant-condition
+    pushing: while (true) {
+      void 0;
+
+      switch (current._tag) {
+        case "Singleton"
+        /* ConcTag.Singleton */
+        :
+          {
+            result = new _definition2.Singleton(f(index++, current.value));
+            break pushing;
+          }
+
+        case "Empty"
+        /* ConcTag.Empty */
+        :
+          {
+            result = _definition2._Empty;
+            break pushing;
+          }
+
+        case "Chunk"
+        /* ConcTag.Chunk */
+        :
+          {
+            result = new _definition2.Chunk(current._array.map((a, i) => f(i + index, a)));
+            index += current.length;
+            break pushing;
+          }
+
+        case "Concat"
+        /* ConcTag.Concat */
+        :
+          {
+            stack.push(new ConcatLeftFrame(current, index));
+            current = current.left;
+            continue pushing;
+          }
+
+        case "AppendN"
+        /* ConcTag.AppendN */
+        :
+          {
+            stack.push(new AppendFrame(current.buffer, current.bufferUsed, index));
+            current = current.start;
+            continue pushing;
+          }
+
+        case "PrependN"
+        /* ConcTag.PrependN */
+        :
+          {
+            stack.push(new PrependFrame(mapArrayLikeReverse(current.buffer, current.bufferUsed, index + current.bufferUsed - 1, f), current.end));
+            index += current.bufferUsed;
+            break pushing;
+          }
+
+        case "Slice"
+        /* ConcTag.Slice */
+        :
+          {
+            let r = tsplus_module_2.empty();
+
+            for (let i = 0; i < current.length; i++) {
+              r = append_1(r, f(i + index, unsafeGet_1(current, i)));
+            }
+
+            result = r;
+            index += current.length;
+            break pushing;
+          }
+      }
+    } // eslint-disable-next-line no-constant-condition
+
+
+    popping: while (true) {
+      const top = stack.pop();
+
+      switch (top._tag) {
+        case "Done":
+          {
+            return result;
+          }
+
+        case "ConcatLeft":
+          {
+            current = top.conc.right;
+            stack.push(new ConcatRightFrame(result));
+            continue recursion;
+          }
+
+        case "ConcatRight":
+          {
+            result = concat_1(top.leftResult, result);
+            continue popping;
+          }
+
+        case "Append":
+          {
+            result = concat_1(result, mapArrayLike(top.buffer, top.bufferUsed, index, f));
+            continue popping;
+          }
+
+        case "Prepend":
+          {
+            current = top.end;
+            stack.push(new ConcatRightFrame(top.pre));
+            continue recursion;
+          }
+      }
+    }
+  }
+
+  throw new Error("bug");
+}
+/**
+ * @tsplus getter fncts.Conc isEmpty
+ */
+
+
+function isEmpty_1(self) {
+  void 0;
+  return self.length === 0;
+}
+/**
+ * @tsplus getter fncts.Conc isNonEmpty
+ */
+
+
+function isNonEmpty_1(conc) {
+  return !isEmpty_1(conc);
+}
+
+function partition_(self, p) {
+  return partitionWithIndex_1(self, (_, a) => p(a));
+}
+/**
+ * @tsplus fluent fncts.Conc partitionMap
+ */
+
+
+function partitionMap_1(self, f) {
+  return partitionMapWithIndex_1(self, (_, a) => f(a));
+}
+/**
+ * @tsplus fluent fncts.Conc partitionMapWithIndex
+ */
+
+
+function partitionMapWithIndex_1(fa, f) {
+  void 0;
+  const iterator = fa.arrayIterator();
+  const left = builder_1();
+  const right = builder_1();
+  let result;
+  let i = 0;
+
+  while (!(result = iterator.next()).done) {
+    const array = result.value;
+
+    for (let j = 0; j < array.length; j++) {
+      const eab = f(i, array[j]);
+      tsplus_module_8.match_(eab, b => left.append(b), c => right.append(c));
+      i++;
+    }
+  }
+
+  return [left.result(), right.result()];
+}
+
+function partitionWithIndex_1(self, p) {
+  void 0;
+  const iterator = self.arrayIterator();
+  const left = builder_1();
+  const right = builder_1();
+  let result;
+  let i = 0;
+
+  while (!(result = iterator.next()).done) {
+    const array = result.value;
+
+    for (let j = 0; j < array.length; j++) {
+      const a = array[j];
+
+      if (p(i, a)) {
+        right.append(a);
+      } else {
+        left.append(a);
+      }
+
+      i++;
+    }
+  }
+
+  return [left.result(), right.result()];
+}
+/**
+ * @tsplus fluent fncts.Conc prepend
+ */
+
+
+function prepend_(self, a) {
+  void 0;
+  return self.prepend(a);
+}
+/**
+ * @tsplus getter fncts.Conc reverse
+ */
+
+
+function reverse(self) {
+  void 0;
+  const arr = self.arrayLike();
+  return tsplus_module_9.mkIterable(() => {
+    let i = arr.length - 1;
+    return {
+      next: () => {
+        if (i >= 0 && i < arr.length) {
+          const k = arr[i];
+          i--;
+          return {
+            value: k,
+            done: false
+          };
+        } else {
+          return {
+            value: undefined,
+            done: true
+          };
+        }
+      }
+    };
+  });
+}
+/**
+ * @tsplus getter fncts.Conc separate
+ */
+
+
+function separate(self) {
+  return partitionMap_1(self, _function.identity);
+}
+/**
+ * @tsplus fluent fncts.Conc splitAt
+ */
+
+
+function splitAt_1(self, n) {
+  return [take_1(self, n), drop_1(self, n)];
+}
+/**
+ * Splits this Conc on the first element that matches this predicate.
+ *
+ * @tsplus fluent fncts.Conc splitWhere
+ */
+
+
+function splitWhere_(self, f) {
+  void 0;
+  const iterator = self.arrayIterator();
+  let next;
+  let cont = true;
+  let i = 0;
+
+  while (cont && (next = iterator.next()) && !next.done) {
+    const array = next.value;
+    const len = array.length;
+    let j = 0;
+
+    while (cont && j < len) {
+      const a = array[j];
+
+      if (f(a)) {
+        cont = false;
+      } else {
+        i++;
+        j++;
+      }
+    }
+  }
+
+  return splitAt_1(self, i);
+}
+/**
+ * @tsplus getter fncts.Conc tail
+ */
+
+
+function tail(conc) {
+  if (isEmpty_1(conc)) {
+    return tsplus_module_6.nothing();
+  }
+
+  return tsplus_module_6.just(drop_1(conc, 1));
+}
+/**
+ * @tsplus fluent fncts.Conc take
+ */
+
+
+function take_1(self, n) {
+  void 0;
+  return self.take(n);
+}
+/**
+ * @tsplus fluent fncts.Conc takeWhile
+ */
+
+
+function takeWhile_(self, p) {
+  void 0;
+
+  switch (self._tag) {
+    case "Chunk"
+    /* ConcTag.Chunk */
+    :
+      {
+        const arr = self.arrayLike();
+        let i = 0;
+
+        while (i < arr.length && p(arr[i])) {
+          i++;
+        }
+
+        return take_1(self, i);
+      }
+
+    default:
+      {
+        const iterator = self.arrayIterator();
+        let result;
+        let cont = true;
+        let i = 0;
+
+        while (cont && !(result = iterator.next()).done) {
+          const array = result.value;
+          let j = 0;
+
+          while (cont && j < array.length) {
+            if (!p(array[j])) {
+              cont = false;
+            } else {
+              i++;
+              j++;
+            }
+          }
+        }
+
+        return take_1(self, i);
+      }
+  }
+}
+
+const traverse_ = A => (ta, f) => traverseWithIndex_(A)(ta, (_, a) => f(a));
+/**
+ * @tsplus getter fncts.Conc traverse
+ */
+
+
+exports.traverse_ = traverse_;
+
+const traverseSelf = ta => A => f => traverseWithIndex_(A)(ta, (_, a) => f(a));
+
+exports.traverseSelf = traverseSelf;
+const traverseWithIndex_ = /*#__PURE__*/P.mkTraverseWithIndex_()(_ => A => (ta, f) => foldLeftWithIndex_1(ta, A.pure(tsplus_module_2.empty()), (i, fbs, a) => A.zipWith_(fbs, f(i, a), (bs, b) => append_1(bs, b))));
+/**
+ * @tsplus getter fncts.Conc traverseWithIndex
+ */
+
+exports.traverseWithIndex_ = traverseWithIndex_;
+
+const traverseSelfWithIndex = ta => A => f => traverseWithIndex_(A)(ta, f);
+/**
+ * @tsplus fluent fncts.ConcOps unfold
+ */
+
+
+exports.traverseSelfWithIndex = traverseSelfWithIndex;
+
+function unfold(b, f) {
+  const out = builder_1();
+  let bb = b;
+
+  while (true) {
+    const mt = f(bb);
+
+    if (tsplus_module_5.isJust(mt)) {
+      const [a, b] = mt.value;
+      out.append(a);
+      bb = b;
+    } else {
+      return out.result();
+    }
+  }
+}
+/**
+ * @tsplus fluent fncts.Conc unsafeGet
+ * @tsplus index fncts.Conc
+ */
+
+
+function unsafeGet_1(self, n) {
+  void 0;
+  return self.get(n);
+}
+/**
+ * Returns the first element of this Conc. Note that this method is partial
+ * in that it will throw an exception if the Conc is empty. Consider using
+ * `head` to explicitly handle the possibility that the Conc is empty
+ * or iterating over the elements of the Conc in lower level, performance
+ * sensitive code unless you really only need the first element of the Conc.
+ *
+ * @tsplus getter fncts.Conc unsafeHead
+ */
+
+
+function unsafeHead_1(as) {
+  void 0;
+  return as.get(0);
+}
+/**
+ * Returns every element after the first. Note that this method is partial
+ * in that it will throw an exception if the Conc is empty. Consider using
+ * `tail` to explicitly handle the possibility that the Conc is empty
+ *
+ * @tsplus getter fncts.Conc unsafeTail
+ */
+
+
+function unsafeTail_1(self) {
+  if (self.length === 0) {
+    throw new tsplus_module_10.ArrayIndexOutOfBoundsError("Chunk.unsafeTail access to 1");
+  }
+
+  return drop_1(self, 1);
+}
+/**
+ * @tsplus fluent fncts.Conc unsafeUpdateAt
+ */
+
+
+function unsafeUpdateAt_1(self, i, a) {
+  void 0;
+  return self.update(i, a);
+}
+/**
+ * @tsplus fluent fncts.Conc updateAt
+ */
+
+
+function updateAt_(self, i, a) {
+  try {
+    return tsplus_module_6.just(unsafeUpdateAt_1(self, i, a));
+  } catch {
+    return tsplus_module_6.nothing();
+  }
+}
+/**
+ * @tsplus fluent fncts.Conc zip
+ */
+
+
+function zip_(self, fb) {
+  return zipWith_1(self, fb, _function.tuple);
+}
+/**
+ * @tsplus fluent fncts.Conc zipWith
+ */
+
+
+function zipWith_1(self, fb, f) {
+  void 0;
+  void 0;
+  const length = Math.min(self.length, fb.length);
+
+  if (length === 0) {
+    return tsplus_module_2.empty();
+  } else {
+    const leftIterator = self.arrayIterator();
+    const rightIterator = fb.arrayIterator();
+    const out = builder_1();
+    let left = null;
+    let right = null;
+    let leftLength = 0;
+    let rightLength = 0;
+    let i = 0;
+    let j = 0;
+    let k = 0;
+
+    while (i < length) {
+      if (j < leftLength && k < rightLength) {
+        const a = left.value[j];
+        const b = right.value[k];
+        const c = f(a, b);
+        out.append(c);
+        i++;
+        j++;
+        k++;
+      } else if (j === leftLength && !(left = leftIterator.next()).done) {
+        leftLength = left.value.length;
+        j = 0;
+      } else if (k === rightLength && !(right = rightIterator.next()).done) {
+        rightLength = right.value.length;
+        k = 0;
+      }
+    }
+
+    return out.result();
+  }
+}
+/**
+ * @tsplus getter fncts.Conc zipWithIndex
+ */
+
+
+function zipWithIndex(self) {
+  return zipWithIndexOffset_1(self, 0);
+}
+/**
+ * @tsplus fluent fncts.Conc zipWithIndexOffset
+ */
+
+
+function zipWithIndexOffset_1(as, offset) {
+  void 0;
+  const iterator = as.arrayIterator();
+  let next;
+  let i = offset;
+  const out = builder_1();
+
+  while (!(next = iterator.next()).done) {
+    const array = next.value;
+    const len = array.length;
+
+    for (let j = 0; i < len; j++, i++) {
+      out.append([array[j], i]);
+    }
+  }
+
+  return out.result();
+}
+//# sourceMappingURL=api.cjs.map