@fncts/base 0.0.39 → 0.0.41

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

@@ -3,8 +3,7 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports._traverse = _traverse;
-exports.append = exports._traverseWithIndex = void 0;
+exports.append = void 0;
 exports.chunksOf = chunksOf;
 exports.concat = void 0;
 exports.contains = contains;
@@ -73,7 +72,8 @@ exports.takeLastWhile = takeLastWhile;
 exports.takeWhile = takeWhile;
 exports.toArray = toArray;
 exports.toList = toList;
-exports.traverseWithIndex = exports.traverse = void 0;
+exports.traverseWithIndex_ = exports.traverseWithIndex = exports.traverse = void 0;
+exports.traverse_ = traverse_;
 exports.unfold = unfold;
 exports.uniq = uniq;
 exports.vector = exports.updateAt = exports.unsafeLast = exports.unsafeHead = exports.unsafeGet = exports.unsafeFindLast = exports.unsafeFind = void 0;
@@ -86,21 +86,19 @@ var tsplus_module_5 = /*#__PURE__*/_interopRequireWildcard(/*#__PURE__*/require(
 var tsplus_module_6 = /*#__PURE__*/_interopRequireWildcard(/*#__PURE__*/require("@fncts/base/data/Maybe/constructors"));
 var tsplus_module_7 = /*#__PURE__*/_interopRequireWildcard(/*#__PURE__*/require("@fncts/base/collection/mutable/ListBuffer"));
 var tsplus_module_8 = /*#__PURE__*/_interopRequireWildcard(/*#__PURE__*/require("@fncts/base/data/Maybe/definition"));
-function _getRequireWildcardCache(e) { if ("function" != typeof WeakMap) return null; var r = new WeakMap(), t = new WeakMap(); return (_getRequireWildcardCache = function (e) { return e ? t : r; })(e); }
-function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e; if (null === e || "object" != typeof e && "function" != typeof e) return { default: e }; var t = _getRequireWildcardCache(r); if (t && t.has(e)) return t.get(e); var n = { __proto__: null }, a = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var u in e) if ("default" !== u && {}.hasOwnProperty.call(e, u)) { var i = a ? Object.getOwnPropertyDescriptor(e, u) : null; i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u]; } return n.default = e, t && t.set(e, n), n; }
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
 const append = exports.append = append_1;
+const concat = exports.concat = concat_1;
 const filterMapWithIndex = exports.filterMapWithIndex = filterMapWithIndex_1;
 const filterWithIndex = exports.filterWithIndex = filterWithIndex_1;
-const concat = exports.concat = concat_1;
 const dropRepeatsWith = exports.dropRepeatsWith = dropRepeatsWith_1;
 const empty = exports.empty = empty_1;
 const emptyPushable = exports.emptyPushable = emptyPushable_1;
-const some = exports.some = some_1;
 const findIndex = exports.findIndex = findIndex_1;
 const flatten = exports.flatten = flatten_1;
 const foldLeft = exports.foldLeft = foldLeft_1;
-const foldLeftWithIndex = exports.foldLeftWithIndex = foldLeftWithIndex_1;
 const foldLeftWhile = exports.foldLeftWhile = foldLeftWhile_1;
+const foldLeftWithIndex = exports.foldLeftWithIndex = foldLeftWithIndex_1;
 const foldMapWithIndex = exports.foldMapWithIndex = foldMapWithIndex_1;
 const foldRightWithIndex = exports.foldRightWithIndex = foldRightWithIndex_1;
 const forEach = exports.forEach = forEach_1;
@@ -110,9 +108,10 @@ const mutableClone = exports.mutableClone = mutableClone_1;
 const pop = exports.pop = pop_1;
 const prepend = exports.prepend = prepend_1;
 const slice = exports.slice = slice_1;
+const some = exports.some = some_1;
 const sortWith = exports.sortWith = sortWith_1;
 const splitAt = exports.splitAt = splitAt_1;
-const _traverseWithIndex = exports._traverseWithIndex = _traverseWithIndex_1;
+const traverseWithIndex_ = exports.traverseWithIndex_ = traverseWithIndex_1;
 const unsafeFind = exports.unsafeFind = unsafeFind_1;
 const unsafeFindLast = exports.unsafeFindLast = unsafeFindLast_1;
 const unsafeGet = exports.unsafeGet = unsafeGet_1;
@@ -143,43 +142,6 @@ function append_1(a) {
     return newVector;
   };
 }
-/**
- * @tsplus pipeable fncts.Vector filterMapWithIndex
- */
-function filterMapWithIndex_1(f) {
-  return self => {
-    return foldLeftWithIndex_1(emptyPushable_1(), (i, acc, a) => tsplus_module_3.match(() => acc, b => tsplus_module_2.push(b)(acc))(f(i, a)))(self);
-  };
-}
-/**
- * @tsplus pipeable fncts.Vector filterMap
- */
-function filterMap(f) {
-  return self => {
-    return filterMapWithIndex_1((_, a) => f(a))(self);
-  };
-}
-function filterWithIndex_1(predicate) {
-  return self => {
-    return foldLeftWithIndex_1(emptyPushable_1(), (i, acc, a) => predicate(i, a) ? tsplus_module_2.push(a)(acc) : acc)(self);
-  };
-}
-function filter(predicate) {
-  return self => {
-    return filterWithIndex_1((_, a) => predicate(a))(self);
-  };
-}
-/**
- * Maps a function over a Vector and concatenates all the resulting
- * Vectors together.
- *
- * @tsplus pipeable fncts.Vector flatMap
- */
-function flatMap(f) {
-  return self => {
-    return flatten_1(map_1(f)(self));
-  };
-}
 /**
  * Splits the Vector into chunks of the given size.
  *
@@ -256,13 +218,47 @@ function concat_1(that) {
     }
   };
 }
+function filter(predicate) {
+  return self => {
+    return filterWithIndex_1((_, a) => predicate(a))(self);
+  };
+}
+/**
+ * @tsplus pipeable fncts.Vector filterMap
+ */
+function filterMap(f) {
+  return self => {
+    return filterMapWithIndex_1((_, a) => f(a))(self);
+  };
+}
+/**
+ * @tsplus pipeable fncts.Vector filterMapWithIndex
+ */
+function filterMapWithIndex_1(f) {
+  return self => {
+    return foldLeftWithIndex_1(emptyPushable_1(), (i, acc, a) => tsplus_module_3.match(() => acc, b => tsplus_module_2.push(b)(acc))(f(i, a)))(self);
+  };
+}
+function filterWithIndex_1(predicate) {
+  return self => {
+    return foldLeftWithIndex_1(emptyPushable_1(), (i, acc, a) => predicate(i, a) ? tsplus_module_2.push(a)(acc) : acc)(self);
+  };
+}
+/**
+ * Maps a function over a Vector and concatenates all the resulting
+ * Vectors together.
+ *
+ * @tsplus pipeable fncts.Vector flatMap
+ */
+function flatMap(f) {
+  return self => {
+    return flatten_1(map_1(f)(self));
+  };
+}
 const containsState = {
   element: undefined,
   result: false
 };
-function containsCb(value, state) {
-  return !(state.result = value === state.element);
-}
 /**
  * Returns `true` if the Vector contains the specified element.
  * Otherwise it returns `false`.
@@ -277,6 +273,9 @@ function contains(element) {
     return (0, _internal.foldLeftCb)(containsCb, containsState, self).result;
   };
 }
+function containsCb(value, state) {
+  return !(state.result = value === state.element);
+}
 /**
  * Returns a new Vector without the first `n` elements.
  *
@@ -320,14 +319,6 @@ function dropRepeatsWith_1(predicate) {
     return foldLeft_1(emptyPushable_1(), (acc, a) => acc.length !== 0 && predicate(unsafeLast_1(acc), a) ? acc : tsplus_module_2.push(a)(acc))(self);
   };
 }
-function findNotIndexCb(value, state) {
-  if (state.predicate(value)) {
-    ++state.index;
-    return true;
-  } else {
-    return false;
-  }
-}
 /**
  * Removes the first elements in the Vector for which the predicate returns
  * `true`.
@@ -347,9 +338,6 @@ function dropWhile(predicate) {
     return slice_1(index, self.length)(self);
   };
 }
-function elemCb(value, state) {
-  return !(state.result = state.equals(state.element)(value));
-}
 /**
  * @tsplus pipeable fncts.Vector elem
  */
@@ -364,27 +352,8 @@ function elem(a, /** @tsplus auto */E) {
     return (0, _internal.foldLeftCb)(elemCb, elemState, self).result;
   };
 }
-/**
- * Returns true if the two Vectors are equivalent.
- *
- * @complexity O(n)
- * @tsplus pipeable fncts.Vector equals
- */
-function equals(that) {
-  return self => {
-    return tsplus_module_5.corresponds(that, tsplus_module_4.strictEquals)(self);
-  };
-}
-function everyCb(value, state) {
-  return state.result = state.predicate(value);
-}
-function every(predicate) {
-  return self => {
-    return (0, _internal.foldLeftCb)(everyCb, {
-      predicate,
-      result: true
-    }, self).result;
-  };
+function elemCb(value, state) {
+  return !(state.result = state.equals(state.element)(value));
 }
 /**
  * Creates an empty Vector.
@@ -401,25 +370,28 @@ function empty_1() {
 function emptyPushable_1() {
   return new tsplus_module_1.Vector(0, 0, 0, [], undefined, []);
 }
-function someCb(value, state) {
-  return !(state.result = state.predicate(value));
-}
 /**
- * Returns true if and only if there exists an element in the Vector for
- * which the predicate returns true.
+ * Returns true if the two Vectors are equivalent.
  *
  * @complexity O(n)
- *
- * @tsplus pipeable fncts.Vector some
+ * @tsplus pipeable fncts.Vector equals
  */
-function some_1(predicate) {
+function equals(that) {
   return self => {
-    return (0, _internal.foldLeftCb)(someCb, {
+    return tsplus_module_5.corresponds(that, tsplus_module_4.strictEquals)(self);
+  };
+}
+function every(predicate) {
+  return self => {
+    return (0, _internal.foldLeftCb)(everyCb, {
       predicate,
-      result: false
+      result: true
     }, self).result;
   };
 }
+function everyCb(value, state) {
+  return state.result = state.predicate(value);
+}
 /**
  * Returns the _first_ element for which the predicate returns `true`.
  * If no such element is found the function returns `undefined`.
@@ -432,9 +404,13 @@ function find(predicate) {
     return tsplus_module_6.fromNullable(unsafeFind_1(predicate)(self));
   };
 }
-function findIndexCb(value, state) {
-  ++state.index;
-  return !(state.found = state.predicate(value));
+function findCb(value, state) {
+  if (state.predicate(value)) {
+    state.result = value;
+    return false;
+  } else {
+    return true;
+  }
 }
 /**
  * Returns the index of the `first` element for which the predicate
@@ -457,6 +433,10 @@ function findIndex_1(predicate) {
     return found ? index : -1;
   };
 }
+function findIndexCb(value, state) {
+  ++state.index;
+  return !(state.found = state.predicate(value));
+}
 /**
  * Returns the _last_ element for which the predicate returns `true`.
  * If no such element is found the function returns `undefined`.
@@ -490,6 +470,14 @@ function findLastIndex(predicate) {
     return found ? index : -1;
   };
 }
+function findNotIndexCb(value, state) {
+  if (state.predicate(value)) {
+    ++state.index;
+    return true;
+  } else {
+    return false;
+  }
+}
 /**
  * Flattens a Vector of Vectors into a Vector. Note that this function does
  * not flatten recursively. It removes one level of nesting only.
@@ -501,21 +489,6 @@ function findLastIndex(predicate) {
 function flatten_1(self) {
   return foldLeft_1(empty_1(), (acc, a) => concat_1(a)(acc))(self);
 }
-function from(sequence) {
-  const l = emptyPushable_1();
-  if (sequence.length > 0 && (sequence[0] !== undefined || 0 in sequence)) {
-    for (let i = 0; i < sequence.length; ++i) {
-      tsplus_module_2.push(sequence[i])(l);
-    }
-  } else if (Symbol.iterator in sequence) {
-    const iterator = sequence[Symbol.iterator]();
-    let cur;
-    while (!(cur = iterator.next()).done) {
-      tsplus_module_2.push(cur.value)(l);
-    }
-  }
-  return l;
-}
 /**
  * Folds a function over a Vector. Left-associative.
  *
@@ -526,41 +499,6 @@ function foldLeft_1(initial, f) {
     return foldLeftWithIndex_1(initial, (_, b, a) => f(b, a))(self);
   };
 }
-/**
- * @tsplus pipeable fncts.Vector foldLeftWithIndex
- */
-function foldLeftWithIndex_1(b, f) {
-  return self => {
-    const suffixSize = (0, _internal.getSuffixSize)(self);
-    const prefixSize = (0, _internal.getPrefixSize)(self);
-    let [acc, index] = (0, _internal.foldLeftPrefix)(f, b, self.prefix, prefixSize);
-    if (self.root !== undefined) {
-      [acc, index] = (0, _internal.foldLeftNode)(f, acc, self.root, (0, _internal.getDepth)(self), index);
-    }
-    return (0, _internal.foldLeftSuffix)(f, acc, self.suffix, suffixSize, index)[0];
-  };
-}
-/**
- * Similar to `foldl`. But, for each element it calls the predicate function
- * _before_ the folding function and stops folding if it returns `false`.
- *
- *
- * @example
- * const isOdd = (_acc:, x) => x % 2 === 1;
- *
- * const xs = V.vector(1, 3, 5, 60, 777, 800);
- * foldlWhile(isOdd, (n, m) => n + m, 0, xs) //=> 9
- *
- * const ys = V.vector(2, 4, 6);
- * foldlWhile(isOdd, (n, m) => n + m, 111, ys) //=> 111
- */
-function foldWhileCb(a, state, i) {
-  if (state.predicate(state.result) === false) {
-    return false;
-  }
-  state.result = state.f(i, state.result, a);
-  return true;
-}
 /**
  * @tsplus pipeable fncts.Vector foldLeftWhile
  */
@@ -577,15 +515,17 @@ function foldLeftWhile_1(b, cont, f) {
   };
 }
 /**
- * @tsplus pipeable fncts.Vector foldRightWhile
+ * @tsplus pipeable fncts.Vector foldLeftWithIndex
  */
-function foldRightWhile(b, cont, f) {
+function foldLeftWithIndex_1(b, f) {
   return self => {
-    return (0, _internal.foldRightCb)(foldWhileCb, {
-      predicate: cont,
-      result: b,
-      f: (i, b, a) => f(i, a, b)
-    }, self).result;
+    const suffixSize = (0, _internal.getSuffixSize)(self);
+    const prefixSize = (0, _internal.getPrefixSize)(self);
+    let [acc, index] = (0, _internal.foldLeftPrefix)(f, b, self.prefix, prefixSize);
+    if (self.root !== undefined) {
+      [acc, index] = (0, _internal.foldLeftNode)(f, acc, self.root, (0, _internal.getDepth)(self), index);
+    }
+    return (0, _internal.foldLeftSuffix)(f, acc, self.suffix, suffixSize, index)[0];
   };
 }
 /**
@@ -615,6 +555,18 @@ function foldRight(initial, f) {
     return foldRightWithIndex_1(initial, (_, a, b) => f(a, b))(self);
   };
 }
+/**
+ * @tsplus pipeable fncts.Vector foldRightWhile
+ */
+function foldRightWhile(b, cont, f) {
+  return self => {
+    return (0, _internal.foldRightCb)(foldWhileCb, {
+      predicate: cont,
+      result: b,
+      f: (i, b, a) => f(i, a, b)
+    }, self).result;
+  };
+}
 /**
  * Folds a function over a Vector. Right-associative.
  *
@@ -632,6 +584,27 @@ function foldRightWithIndex_1(b, f) {
     return (0, _internal.foldRightPrefix)(f, acc, self.prefix, prefixSize, j)[0];
   };
 }
+/**
+ * Similar to `foldl`. But, for each element it calls the predicate function
+ * _before_ the folding function and stops folding if it returns `false`.
+ *
+ *
+ * @example
+ * const isOdd = (_acc:, x) => x % 2 === 1;
+ *
+ * const xs = V.vector(1, 3, 5, 60, 777, 800);
+ * foldlWhile(isOdd, (n, m) => n + m, 0, xs) //=> 9
+ *
+ * const ys = V.vector(2, 4, 6);
+ * foldlWhile(isOdd, (n, m) => n + m, 111, ys) //=> 111
+ */
+function foldWhileCb(a, state, i) {
+  if (state.predicate(state.result) === false) {
+    return false;
+  }
+  state.result = state.f(i, state.result, a);
+  return true;
+}
 /**
  * Invokes a given callback for each element in the Vector from left to
  * right. Returns `undefined`.
@@ -657,6 +630,21 @@ function forEachWithIndex(f) {
     foldLeftWithIndex_1(undefined, (index, _, element) => f(index, element))(self);
   };
 }
+function from(sequence) {
+  const l = emptyPushable_1();
+  if (sequence.length > 0 && (sequence[0] !== undefined || 0 in sequence)) {
+    for (let i = 0; i < sequence.length; ++i) {
+      tsplus_module_2.push(sequence[i])(l);
+    }
+  } else if (Symbol.iterator in sequence) {
+    const iterator = sequence[Symbol.iterator]();
+    let cur;
+    while (!(cur = iterator.next()).done) {
+      tsplus_module_2.push(cur.value)(l);
+    }
+  }
+  return l;
+}
 /**
  * Gets the nth element of the Vector. If `n` is out of bounds
  * `undefined` is returned.
@@ -710,10 +698,6 @@ function includes(element) {
     return foldLeftWhile_1(false, found => !found, (_, __, a) => a === element)(self);
   };
 }
-function indexOfCb(value, state) {
-  ++state.index;
-  return !(state.found = tsplus_module_4.strictEquals(value, state.element));
-}
 /**
  * Returns the index of the _first_ element in the Vector that is equal
  * to the given element. If no such element is found `-1` is returned.
@@ -732,16 +716,9 @@ function indexOf(element) {
     return state.found ? state.index : -1;
   };
 }
-/**
- * Inserts the given element at the given index in the Vector.
- *
- * @complexity O(log(n))
- * @tsplus pipeable fncts.Vector insertAt
- */
-function insertAt(index, element) {
-  return self => {
-    return concat_1(slice_1(index, self.length)(self))(append_1(element)(slice_1(0, index)(self)));
-  };
+function indexOfCb(value, state) {
+  ++state.index;
+  return !(state.found = tsplus_module_4.strictEquals(value, state.element));
 }
 /**
  * Inserts the given Vector of elements at the given index in the Vector.
@@ -754,6 +731,17 @@ function insertAllAt(index, elements) {
     return concat_1(slice_1(index, self.length)(self))(concat_1(elements)(slice_1(0, index)(self)));
   };
 }
+/**
+ * Inserts the given element at the given index in the Vector.
+ *
+ * @complexity O(log(n))
+ * @tsplus pipeable fncts.Vector insertAt
+ */
+function insertAt(index, element) {
+  return self => {
+    return concat_1(slice_1(index, self.length)(self))(append_1(element)(slice_1(0, index)(self)));
+  };
+}
 /**
  * Inserts a separator between each element in a Vector.
  *
@@ -827,18 +815,6 @@ function makeBy(n, f) {
   }
   return l;
 }
-/**
- * @tsplus pipeable fncts.Vector mapAccum
- */
-function mapAccum(s, f) {
-  return self => {
-    return foldLeft_1([emptyPushable_1(), s], ([acc, s], a) => {
-      const r = f(s, a);
-      tsplus_module_2.push(r[0])(acc);
-      return [acc, r[1]];
-    })(self);
-  };
-}
 /**
  * Applies a function to each element in the given Vector and returns a
  * new Vector of the values that the function return.
@@ -851,6 +827,18 @@ function map_1(f) {
     return mapWithIndex_1((_, a) => f(a))(self);
   };
 }
+/**
+ * @tsplus pipeable fncts.Vector mapAccum
+ */
+function mapAccum(s, f) {
+  return self => {
+    return foldLeft_1([emptyPushable_1(), s], ([acc, s], a) => {
+      const r = f(s, a);
+      tsplus_module_2.push(r[0])(acc);
+      return [acc, r[1]];
+    })(self);
+  };
+}
 /**
  * Applies a function to each element in the given Vector and returns a
  * new Vector of the values that the function return.
@@ -863,12 +851,6 @@ function mapWithIndex_1(f) {
     return new tsplus_module_1.Vector(self.bits, self.offset, self.length, (0, _internal.mapPrefix)(f, self.prefix, (0, _internal.getPrefixSize)(self)), self.root === undefined ? undefined : (0, _internal.mapNode)(f, self.root, (0, _internal.getDepth)(self), (0, _internal.getPrefixSize)(self), 1)[0], (0, _internal.mapAffix)(f, self.suffix, (0, _internal.getSuffixSize)(self), self.length));
   };
 }
-/**
- * @tsplus getter fncts.Vector mutableClone
- */
-function mutableClone_1(self) {
-  return new tsplus_module_1.Vector(self.bits, self.offset, self.length, self.prefix, self.root, self.suffix);
-}
 /**
  * Returns a Vector that has the entry specified by the index replaced with
  * the value returned by applying the function to the value.
@@ -888,6 +870,12 @@ function modifyAt(i, f) {
     return updateAt_1(i, f(unsafeGet_1(i)(self)))(self);
   };
 }
+/**
+ * @tsplus getter fncts.Vector mutableClone
+ */
+function mutableClone_1(self) {
+  return new tsplus_module_1.Vector(self.bits, self.offset, self.length, self.prefix, self.root, self.suffix);
+}
 /**
  * Returns `true` if and only if the predicate function returns
  * `false` for every element in the given Vector.
@@ -1110,6 +1098,25 @@ function slice_1(from, to) {
     return newVector;
   };
 }
+/**
+ * Returns true if and only if there exists an element in the Vector for
+ * which the predicate returns true.
+ *
+ * @complexity O(n)
+ *
+ * @tsplus pipeable fncts.Vector some
+ */
+function some_1(predicate) {
+  return self => {
+    return (0, _internal.foldLeftCb)(someCb, {
+      predicate,
+      result: false
+    }, self).result;
+  };
+}
+function someCb(value, state) {
+  return !(state.result = state.predicate(value));
+}
 /**
  * @tsplus pipeable fncts.Vector sort
  */
@@ -1205,26 +1212,6 @@ function take(n) {
     return slice_1(0, n)(self);
   };
 }
-/**
- * Takes the first elements in the Vector for which the predicate returns
- * `true`.
- *
- * @complexity `O(k + log(n))` where `k` is the number of elements satisfying
- * the predicate.
- *
- * @tsplus pipeable fncts.Vector takeWhile
- */
-function takeWhile(predicate) {
-  return self => {
-    const {
-      index
-    } = (0, _internal.foldLeftCb)(findNotIndexCb, {
-      predicate,
-      index: 0
-    }, self);
-    return slice_1(0, index)(self);
-  };
-}
 /**
  * Takes the last `n` elements from a Vector and returns them in a new
  * Vector.
@@ -1257,6 +1244,26 @@ function takeLastWhile(predicate) {
     return slice_1(self.length - index, self.length)(self);
   };
 }
+/**
+ * Takes the first elements in the Vector for which the predicate returns
+ * `true`.
+ *
+ * @complexity `O(k + log(n))` where `k` is the number of elements satisfying
+ * the predicate.
+ *
+ * @tsplus pipeable fncts.Vector takeWhile
+ */
+function takeWhile(predicate) {
+  return self => {
+    const {
+      index
+    } = (0, _internal.foldLeftCb)(findNotIndexCb, {
+      predicate,
+      index: 0
+    }, self);
+    return slice_1(0, index)(self);
+  };
+}
 /**
  * Converts a Vector into an array.
  *
@@ -1279,35 +1286,25 @@ function toList(self) {
   })(self);
   return buffer.toList;
 }
-function _traverseWithIndex_1(self) {
+/**
+ * @tsplus getter fncts.Vector traverse
+ */
+function traverse_(self) {
+  return G => f => traverseWithIndex_1(self)(G)((_, a) => f(a));
+}
+function traverseWithIndex_1(self) {
   return G => f => foldLeftWithIndex_1(G.pure(emptyPushable_1()), (i, b, a) => G.zipWith(f(i, a), (v, b) => {
     tsplus_module_2.push(b)(v);
     return v;
   })(b))(self);
 }
-/**
- * @tsplus getter fncts.Vector traverse
- */
-function _traverse(self) {
-  return G => f => _traverseWithIndex_1(self)(G)((_, a) => f(a));
-}
-const traverseWithIndex = G => f => self => _traverseWithIndex_1(self)(G)(f);
+const traverseWithIndex = G => f => self => traverseWithIndex_1(self)(G)(f);
 exports.traverseWithIndex = traverseWithIndex;
-const traverse = G => f => self => _traverseWithIndex_1(self)(G)((_, a) => f(a));
-/**
- * Returns a new Vector without repeated elements by using the given
- * Eq instance to determine when elements are equal
- *
- * @complexity `O(n)`
- * @tsplus pipeable fncts.Vector uniq
- */
-exports.traverse = traverse;
-function uniq(E) {
-  return self => dropRepeatsWith_1((a, b) => E.equals(b)(a))(self);
-}
+const traverse = G => f => self => traverseWithIndex_1(self)(G)((_, a) => f(a));
 /**
  * @tsplus static fncts.VectorOps unfold
  */
+exports.traverse = traverse;
 function unfold(b, f) {
   const out = emptyPushable_1();
   let state = b;
@@ -1323,13 +1320,15 @@ function unfold(b, f) {
   }
   return out;
 }
-function findCb(value, state) {
-  if (state.predicate(value)) {
-    state.result = value;
-    return false;
-  } else {
-    return true;
-  }
+/**
+ * Returns a new Vector without repeated elements by using the given
+ * Eq instance to determine when elements are equal
+ *
+ * @complexity `O(n)`
+ * @tsplus pipeable fncts.Vector uniq
+ */
+function uniq(E) {
+  return self => dropRepeatsWith_1((a, b) => E.equals(b)(a))(self);
 }
 /**
  * Returns the _first_ element for which the predicate returns `true`.