@fncts/base 0.0.21 → 0.0.23

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

@@ -17,7 +17,6 @@ exports.elem = elem;
 exports.emptyPushable = exports.empty = void 0;
 exports.equals = equals;
 exports.every = every;
-exports.exists = void 0;
 exports.find = find;
 exports.findIndex = void 0;
 exports.findLast = findLast;
@@ -61,7 +60,7 @@ exports.replicate = replicate;
 exports.reverse = reverse;
 exports.scanLeft = scanLeft;
 exports.single = single;
-exports.slice = void 0;
+exports.some = exports.slice = void 0;
 exports.sort = sort;
 exports.splitAt = exports.sortWith = void 0;
 exports.splitWhen = splitWhen;
@@ -76,25 +75,15 @@ exports.traverseWithIndex = exports.traverse = void 0;
 exports.unfold = unfold;
 exports.uniq = uniq;
 exports.vector = exports.updateAt = exports.unsafeLast = exports.unsafeHead = exports.unsafeGet = exports.unsafeFindLast = exports.unsafeFind = void 0;
-
 var tsplus_module_1 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/collection/immutable/Vector"));
-
 var tsplus_module_2 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/collection/immutable/Vector/internal"));
-
-var tsplus_module_3 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/typeclass/Equatable/api"));
-
+var tsplus_module_3 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/data/Equatable/api"));
 var tsplus_module_4 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/collection/immutable/Vector/definition"));
-
 var tsplus_module_5 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/data/Maybe/constructors"));
-
 var tsplus_module_6 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/collection/mutable/ListBuffer"));
-
 var tsplus_module_7 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/data/Maybe/definition"));
-
 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 append = append_1;
 exports.append = append;
 const concat = concat_1;
@@ -105,8 +94,8 @@ const empty = empty_1;
 exports.empty = empty;
 const emptyPushable = emptyPushable_1;
 exports.emptyPushable = emptyPushable;
-const exists = exists_1;
-exports.exists = exists;
+const some = some_1;
+exports.some = some;
 const findIndex = findIndex_1;
 exports.findIndex = findIndex;
 const flatten = flatten_1;
@@ -153,7 +142,6 @@ const updateAt = updateAt_1;
 exports.updateAt = updateAt;
 const vector = vector_1;
 exports.vector = vector;
-
 /**
  * Appends an element to the end of a Vector and returns the new Vector.
  *
@@ -163,16 +151,14 @@ exports.vector = vector;
  * @tsplus pipeable-operator fncts.Vector +
  */
 function append_1(a) {
-  return as => {
-    const suffixSize = (0, tsplus_module_2.getSuffixSize)(as);
-
+  return self => {
+    const suffixSize = (0, tsplus_module_2.getSuffixSize)(self);
     if (suffixSize < 32) {
-      return new tsplus_module_1.Vector((0, tsplus_module_2.incrementSuffix)(as.bits), as.offset, as.length + 1, as.prefix, as.root, (0, tsplus_module_2.affixPush)(a, as.suffix, suffixSize));
+      return new tsplus_module_1.Vector((0, tsplus_module_2.incrementSuffix)(self.bits), self.offset, self.length + 1, self.prefix, self.root, (0, tsplus_module_2.affixPush)(a, self.suffix, suffixSize));
     }
-
     const newSuffix = [a];
-    const newVector = mutableClone_1(as);
-    (0, tsplus_module_2.appendNodeToTree)(newVector, as.suffix);
+    const newVector = mutableClone_1(self);
+    (0, tsplus_module_2.appendNodeToTree)(newVector, self.suffix);
     newVector.suffix = newSuffix;
     newVector.length++;
     newVector.bits = (0, tsplus_module_2.setSuffix)(1, newVector.bits);
@@ -185,11 +171,9 @@ function append_1(a) {
  *
  * @tsplus pipeable fncts.Vector flatMap
  */
-
-
 function flatMap(f) {
-  return ma => {
-    return flatten_1(map_1(f)(ma));
+  return self => {
+    return flatten_1(map_1(f)(self));
   };
 }
 /**
@@ -197,10 +181,8 @@ function flatMap(f) {
  *
  * @tsplus pipeable fncts.Vector chunksOf
  */
-
-
 function chunksOf(size) {
-  return as => {
+  return self => {
     const {
       buffer,
       l2
@@ -212,7 +194,6 @@ function chunksOf(size) {
       l2
     }, elem) => {
       tsplus_module_2.push(elem)(buffer);
-
       if (buffer.length === size) {
         return {
           l2: tsplus_module_2.push(buffer)(l2),
@@ -224,11 +205,10 @@ function chunksOf(size) {
           buffer
         };
       }
-    })(as);
+    })(self);
     return buffer.length === 0 ? l2 : tsplus_module_2.push(buffer)(l2);
   };
 }
-
 function concat_1(that) {
   return self => {
     if (self.length === 0) {
@@ -236,22 +216,18 @@ function concat_1(that) {
     } else if (that.length === 0) {
       return self;
     }
-
     const newSize = self.length + that.length;
     const rightSuffixSize = (0, tsplus_module_2.getSuffixSize)(that);
     let newVector = mutableClone_1(self);
-
     if (that.root === undefined) {
       // right is nothing but a prefix and a suffix
       const nrOfAffixes = (0, tsplus_module_2.concatAffixes)(self, that);
-
       for (let i = 0; i < nrOfAffixes; ++i) {
         newVector = (0, tsplus_module_2.appendNodeToTree)(newVector, tsplus_module_2.concatBuffer[i]);
-        newVector.length += tsplus_module_2.concatBuffer[i].length; // wipe pointer, otherwise it might end up keeping the array alive
-
+        newVector.length += tsplus_module_2.concatBuffer[i].length;
+        // wipe pointer, otherwise it might end up keeping the array alive
         tsplus_module_2.concatBuffer[i] = undefined;
       }
-
       newVector.length = newSize;
       newVector.suffix = tsplus_module_2.concatBuffer[nrOfAffixes];
       newVector.bits = (0, tsplus_module_2.setSuffix)(tsplus_module_2.concatBuffer[nrOfAffixes].length, newVector.bits);
@@ -259,12 +235,10 @@ function concat_1(that) {
       return newVector;
     } else {
       const leftSuffixSize = (0, tsplus_module_2.getSuffixSize)(self);
-
       if (leftSuffixSize > 0) {
         newVector = (0, tsplus_module_2.appendNodeToTree)(newVector, self.suffix.slice(0, leftSuffixSize));
         newVector.length += leftSuffixSize;
       }
-
       newVector = (0, tsplus_module_2.appendNodeToTree)(newVector, that.prefix.slice(0, (0, tsplus_module_2.getPrefixSize)(that)).reverse());
       const newNode = (0, tsplus_module_2.concatSubTree)(newVector.root, (0, tsplus_module_2.getDepth)(newVector), that.root, (0, tsplus_module_2.getDepth)(that), true);
       const newDepth = (0, tsplus_module_2.getHeight)(newNode);
@@ -278,12 +252,10 @@ function concat_1(that) {
     }
   };
 }
-
 const containsState = {
   element: undefined,
   result: false
 };
-
 function containsCb(value, state) {
   return !(state.result = value === state.element);
 }
@@ -294,13 +266,11 @@ function containsCb(value, state) {
  * @complexity O(n)
  * @tsplus pipeable fncts.Vector contains
  */
-
-
 function contains(element) {
-  return as => {
+  return self => {
     containsState.element = element;
     containsState.result = false;
-    return (0, tsplus_module_2.foldLeftCb)(containsCb, containsState, as).result;
+    return (0, tsplus_module_2.foldLeftCb)(containsCb, containsState, self).result;
   };
 }
 /**
@@ -309,11 +279,9 @@ function contains(element) {
  * @complexity `O(log(n))`
  * @tsplus pipeable fncts.Vector drop
  */
-
-
 function drop(n) {
-  return as => {
-    return slice_1(n, as.length)(as);
+  return self => {
+    return slice_1(n, self.length)(self);
   };
 }
 /**
@@ -322,11 +290,9 @@ function drop(n) {
  * @complexity `O(log(n))`
  * @tsplus pipeable fncts.Vector dropLast
  */
-
-
 function dropLast(n) {
-  return as => {
-    return slice_1(0, as.length - n)(as);
+  return self => {
+    return slice_1(0, self.length - n)(self);
   };
 }
 /**
@@ -335,10 +301,8 @@ function dropLast(n) {
  * @complexity `O(n)`
  * @tsplus getter fncts.Vector dropRepeats
  */
-
-
-function dropRepeats(as) {
-  return dropRepeatsWith_1(tsplus_module_3.strictEquals)(as);
+function dropRepeats(self) {
+  return dropRepeatsWith_1(tsplus_module_3.strictEquals)(self);
 }
 /**
  * Returns a new Vector without repeated elements by using the given
@@ -347,14 +311,11 @@ function dropRepeats(as) {
  * @complexity `O(n)`
  * @tsplus pipeable fncts.Vector dropRepeatsWith
  */
-
-
 function dropRepeatsWith_1(predicate) {
-  return as => {
-    return foldLeft_1(emptyPushable_1(), (acc, a) => acc.length !== 0 && predicate(unsafeLast_1(acc), a) ? acc : tsplus_module_2.push(a)(acc))(as);
+  return self => {
+    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;
@@ -371,31 +332,24 @@ function findNotIndexCb(value, state) {
  * satisfying the predicate.
  * @tsplus pipeable fncts.Vector dropWhile
  */
-
-
 function dropWhile(predicate) {
-  return as => {
+  return self => {
     const {
       index
     } = (0, tsplus_module_2.foldLeftCb)(findNotIndexCb, {
       predicate,
       index: 0
-    }, as);
-    return slice_1(index, as.length)(as);
+    }, self);
+    return slice_1(index, self.length)(self);
   };
 }
-
 function elemCb(value, state) {
-  return !(state.result = state.equals(value, state.element));
+  return !(state.result = state.equals(state.element)(value));
 }
 /**
  * @tsplus pipeable fncts.Vector elem
  */
-
-
-function elem(a,
-/** @tsplus auto */
-E) {
+function elem(a, /** @tsplus auto */E) {
   const elemState = {
     equals: E.equals,
     element: undefined,
@@ -412,24 +366,20 @@ E) {
  * @complexity O(n)
  * @tsplus pipeable fncts.Vector equals
  */
-
-
 function equals(that) {
   return self => {
     return tsplus_module_4.corresponds(that, tsplus_module_3.strictEquals)(self);
   };
 }
-
 function everyCb(value, state) {
   return state.result = state.predicate(value);
 }
-
 function every(predicate) {
-  return as => {
+  return self => {
     return (0, tsplus_module_2.foldLeftCb)(everyCb, {
       predicate,
       result: true
-    }, as).result;
+    }, self).result;
   };
 }
 /**
@@ -438,21 +388,16 @@ function every(predicate) {
  * @complexity O(1)
  * @tsplus static fncts.VectorOps empty
  */
-
-
 function empty_1() {
   return new tsplus_module_1.Vector(0, 0, 0, tsplus_module_2.emptyAffix, undefined, tsplus_module_2.emptyAffix);
 }
 /**
  * @tsplus static fncts.VectorOps emptyPushable
  */
-
-
 function emptyPushable_1() {
   return new tsplus_module_1.Vector(0, 0, 0, [], undefined, []);
 }
-
-function existsCb(value, state) {
+function someCb(value, state) {
   return !(state.result = state.predicate(value));
 }
 /**
@@ -461,16 +406,14 @@ function existsCb(value, state) {
  *
  * @complexity O(n)
  *
- * @tsplus pipeable fncts.Vector exists
+ * @tsplus pipeable fncts.Vector some
  */
-
-
-function exists_1(predicate) {
-  return as => {
-    return (0, tsplus_module_2.foldLeftCb)(existsCb, {
+function some_1(predicate) {
+  return self => {
+    return (0, tsplus_module_2.foldLeftCb)(someCb, {
       predicate,
       result: false
-    }, as).result;
+    }, self).result;
   };
 }
 /**
@@ -480,14 +423,11 @@ function exists_1(predicate) {
  * @complexity O(n)
  * @tsplus pipeable fncts.Vector find
  */
-
-
 function find(predicate) {
-  return as => {
-    return tsplus_module_5.fromNullable(unsafeFind_1(predicate)(as));
+  return self => {
+    return tsplus_module_5.fromNullable(unsafeFind_1(predicate)(self));
   };
 }
-
 function findIndexCb(value, state) {
   ++state.index;
   return !(state.found = state.predicate(value));
@@ -500,10 +440,8 @@ function findIndexCb(value, state) {
  * @complexity O(n)
  * @tsplus pipeable fncts.Vector findIndex
  */
-
-
 function findIndex_1(predicate) {
-  return as => {
+  return self => {
     const {
       found,
       index
@@ -511,7 +449,7 @@ function findIndex_1(predicate) {
       predicate,
       found: false,
       index: -1
-    }, as);
+    }, self);
     return found ? index : -1;
   };
 }
@@ -522,11 +460,9 @@ function findIndex_1(predicate) {
  * @complexity O(n)
  * @tsplus pipeable fncts.Vector findLast
  */
-
-
 function findLast(predicate) {
-  return as => {
-    return tsplus_module_5.fromNullable(unsafeFindLast_1(predicate)(as));
+  return self => {
+    return tsplus_module_5.fromNullable(unsafeFindLast_1(predicate)(self));
   };
 }
 /**
@@ -537,10 +473,8 @@ function findLast(predicate) {
  * @complexity O(n)
  * @tsplus pipeable fncts.Vector findLastIndex
  */
-
-
 function findLastIndex(predicate) {
-  return as => {
+  return self => {
     const {
       found,
       index
@@ -548,7 +482,7 @@ function findLastIndex(predicate) {
       predicate,
       found: false,
       index: -0
-    }, as);
+    }, self);
     return found ? index : -1;
   };
 }
@@ -560,15 +494,11 @@ function findLastIndex(predicate) {
  *
  * @tsplus getter fncts.Vector flatten
  */
-
-
-function flatten_1(mma) {
-  return foldLeft_1(empty_1(), (acc, a) => concat_1(a)(acc))(mma);
+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);
@@ -576,12 +506,10 @@ function from(sequence) {
   } 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;
 }
 /**
@@ -589,29 +517,23 @@ function from(sequence) {
  *
  * @tsplus pipeable fncts.Vector foldLeft
  */
-
-
 function foldLeft_1(initial, f) {
-  return fa => {
-    return foldLeftWithIndex_1(initial, (_, b, a) => f(b, a))(fa);
+  return self => {
+    return foldLeftWithIndex_1(initial, (_, b, a) => f(b, a))(self);
   };
 }
 /**
  * @tsplus pipeable fncts.Vector foldLeftWithIndex
  */
-
-
 function foldLeftWithIndex_1(b, f) {
-  return fa => {
-    const suffixSize = (0, tsplus_module_2.getSuffixSize)(fa);
-    const prefixSize = (0, tsplus_module_2.getPrefixSize)(fa);
-    let [acc, index] = (0, tsplus_module_2.foldLeftPrefix)(f, b, fa.prefix, prefixSize);
-
-    if (fa.root !== undefined) {
-      [acc, index] = (0, tsplus_module_2.foldLeftNode)(f, acc, fa.root, (0, tsplus_module_2.getDepth)(fa), index);
+  return self => {
+    const suffixSize = (0, tsplus_module_2.getSuffixSize)(self);
+    const prefixSize = (0, tsplus_module_2.getPrefixSize)(self);
+    let [acc, index] = (0, tsplus_module_2.foldLeftPrefix)(f, b, self.prefix, prefixSize);
+    if (self.root !== undefined) {
+      [acc, index] = (0, tsplus_module_2.foldLeftNode)(f, acc, self.root, (0, tsplus_module_2.getDepth)(self), index);
     }
-
-    return (0, tsplus_module_2.foldLeftSuffix)(f, acc, fa.suffix, suffixSize, index)[0];
+    return (0, tsplus_module_2.foldLeftSuffix)(f, acc, self.suffix, suffixSize, index)[0];
   };
 }
 /**
@@ -628,56 +550,44 @@ function foldLeftWithIndex_1(b, f) {
  * 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
  */
-
-
 function foldLeftWhile(b, cont, f) {
-  return fa => {
+  return self => {
     if (!cont(b)) {
       return b;
     }
-
     return (0, tsplus_module_2.foldLeftCb)(foldWhileCb, {
       predicate: cont,
       f,
       result: b
-    }, fa).result;
+    }, self).result;
   };
 }
 /**
  * @tsplus pipeable fncts.Vector foldRightWhile
  */
-
-
 function foldRightWhile(b, cont, f) {
-  return fa => {
+  return self => {
     return (0, tsplus_module_2.foldRightCb)(foldWhileCb, {
       predicate: cont,
       result: b,
       f: (i, b, a) => f(i, a, b)
-    }, fa).result;
+    }, self).result;
   };
 }
 /**
  * @tsplus pipeable fncts.Vector foldMap
  */
-
-
-function foldMap(f,
-/** @tsplus auto */
-M) {
+function foldMap(f, /** @tsplus auto */M) {
   return self => {
     return foldMapWithIndex_1((_, a) => f(a), M)(self);
   };
@@ -685,13 +595,9 @@ M) {
 /**
  * @tsplus pipeable fncts.Vector foldMapWithIndex
  */
-
-
-function foldMapWithIndex_1(f,
-/** @tsplus auto */
-M) {
+function foldMapWithIndex_1(f, /** @tsplus auto */M) {
   return self => {
-    return foldLeftWithIndex_1(M.nat, (i, b, a) => M.combine(b, f(i, a)))(self);
+    return foldLeftWithIndex_1(M.nat, (i, b, a) => M.combine(f(i, a))(b))(self);
   };
 }
 /**
@@ -700,11 +606,9 @@ M) {
  * @complexity O(n)
  * @tsplus pipeable fncts.Vector foldRight
  */
-
-
 function foldRight(initial, f) {
-  return fa => {
-    return foldRightWithIndex_1(initial, (_, a, b) => f(a, b))(fa);
+  return self => {
+    return foldRightWithIndex_1(initial, (_, a, b) => f(a, b))(self);
   };
 }
 /**
@@ -713,19 +617,15 @@ function foldRight(initial, f) {
  * @complexity O(n)
  * @tsplus pipeable fncts.Vector foldRightWithIndex
  */
-
-
 function foldRightWithIndex_1(b, f) {
-  return fa => {
-    const suffixSize = (0, tsplus_module_2.getSuffixSize)(fa);
-    const prefixSize = (0, tsplus_module_2.getPrefixSize)(fa);
-    let [acc, j] = (0, tsplus_module_2.foldRightSuffix)(f, b, fa.suffix, suffixSize, fa.length - 1);
-
-    if (fa.root !== undefined) {
-      [acc, j] = (0, tsplus_module_2.foldRightNode)(f, acc, fa.root, (0, tsplus_module_2.getDepth)(fa), j);
+  return self => {
+    const suffixSize = (0, tsplus_module_2.getSuffixSize)(self);
+    const prefixSize = (0, tsplus_module_2.getPrefixSize)(self);
+    let [acc, j] = (0, tsplus_module_2.foldRightSuffix)(f, b, self.suffix, suffixSize, self.length - 1);
+    if (self.root !== undefined) {
+      [acc, j] = (0, tsplus_module_2.foldRightNode)(f, acc, self.root, (0, tsplus_module_2.getDepth)(self), j);
     }
-
-    return (0, tsplus_module_2.foldRightPrefix)(f, acc, fa.prefix, prefixSize, j)[0];
+    return (0, tsplus_module_2.foldRightPrefix)(f, acc, self.prefix, prefixSize, j)[0];
   };
 }
 /**
@@ -740,21 +640,17 @@ function foldRightWithIndex_1(b, f) {
  * @complexity O(n)
  * @tsplus pipeable fncts.Vector forEach
  */
-
-
 function forEach_1(f) {
-  return as => {
-    foldLeft_1(undefined, (_, element) => f(element))(as);
+  return self => {
+    foldLeft_1(undefined, (_, element) => f(element))(self);
   };
 }
 /**
  * @tsplus pipeable fncts.Vector forEachWithIndex
  */
-
-
 function forEachWithIndex(f) {
-  return as => {
-    foldLeftWithIndex_1(undefined, (index, _, element) => f(index, element))(as);
+  return self => {
+    foldLeftWithIndex_1(undefined, (index, _, element) => f(index, element))(self);
   };
 }
 /**
@@ -764,8 +660,6 @@ function forEachWithIndex(f) {
  * @complexity O(log(n))
  * @tsplus pipeable fncts.Vector get
  */
-
-
 function get(index) {
   return self => {
     return tsplus_module_5.fromNullable(unsafeGet_1(index)(self));
@@ -781,10 +675,8 @@ function get(index) {
  *
  * @tsplus pipeable fncts.Vector groupWith
  */
-
-
 function groupWith(f) {
-  return as => {
+  return self => {
     const result = emptyPushable_1();
     let buffer = emptyPushable_1();
     forEach_1(a => {
@@ -792,9 +684,8 @@ function groupWith(f) {
         tsplus_module_2.push(buffer)(result);
         buffer = emptyPushable_1();
       }
-
       tsplus_module_2.push(a)(buffer);
-    })(as);
+    })(self);
     return buffer.length === 0 ? result : tsplus_module_2.push(buffer)(result);
   };
 }
@@ -804,12 +695,9 @@ function groupWith(f) {
  * @complexity O(1)
  * @tsplus getter fncts.Vector head
  */
-
-
 function head(self) {
   return tsplus_module_5.fromNullable(unsafeHead_1(self));
 }
-
 function indexOfCb(value, state) {
   ++state.index;
   return !(state.found = tsplus_module_3.strictEquals(value, state.element));
@@ -821,16 +709,14 @@ function indexOfCb(value, state) {
  * @complexity O(n)
  * @tsplus pipeable fncts.Vector indexOf
  */
-
-
 function indexOf(element) {
-  return as => {
+  return self => {
     const state = {
       element,
       found: false,
       index: -1
     };
-    (0, tsplus_module_2.foldLeftCb)(indexOfCb, state, as);
+    (0, tsplus_module_2.foldLeftCb)(indexOfCb, state, self);
     return state.found ? state.index : -1;
   };
 }
@@ -840,11 +726,9 @@ function indexOf(element) {
  * @complexity O(log(n))
  * @tsplus pipeable fncts.Vector insertAt
  */
-
-
 function insertAt(index, element) {
-  return as => {
-    return concat_1(slice_1(index, as.length)(as))(append_1(element)(slice_1(0, index)(as)));
+  return self => {
+    return concat_1(slice_1(index, self.length)(self))(append_1(element)(slice_1(0, index)(self)));
   };
 }
 /**
@@ -853,11 +737,9 @@ function insertAt(index, element) {
  * @complexity `O(log(n))`
  * @tsplus pipeable fncts.Vector insertAllAt
  */
-
-
 function insertAllAt(index, elements) {
-  return as => {
-    return concat_1(slice_1(index, as.length)(as))(concat_1(elements)(slice_1(0, index)(as)));
+  return self => {
+    return concat_1(slice_1(index, self.length)(self))(concat_1(elements)(slice_1(0, index)(self)));
   };
 }
 /**
@@ -865,39 +747,31 @@ function insertAllAt(index, elements) {
  *
  * @tsplus pipeable fncts.Vector intersperse
  */
-
-
 function intersperse(separator) {
-  return as => {
-    return pop_1(foldLeft_1(emptyPushable_1(), (l2, a) => tsplus_module_2.push(separator)(tsplus_module_2.push(a)(l2)))(as));
+  return self => {
+    return pop_1(foldLeft_1(emptyPushable_1(), (l2, a) => tsplus_module_2.push(separator)(tsplus_module_2.push(a)(l2)))(self));
   };
 }
 /**
  * @tsplus fluent fncts.Vector isEmpty
  */
-
-
-function isEmpty(l) {
-  return l.length === 0;
+function isEmpty(self) {
+  return self.length === 0;
 }
 /**
  * @tsplus fluent fncts.Vector isNonEmpty
  */
-
-
-function isNonEmpty(l) {
-  return l.length > 0;
+function isNonEmpty(self) {
+  return self.length > 0;
 }
 /**
  * Concatenates the strings in the Vector separated by a specified separator.
  *
  * @tsplus pipeable fncts.Vector join
  */
-
-
 function join(separator) {
-  return as => {
-    return foldLeft_1("", (a, b) => a.length === 0 ? b : a + separator + b)(as);
+  return self => {
+    return foldLeft_1("", (a, b) => a.length === 0 ? b : a + separator + b)(self);
   };
 }
 /**
@@ -906,10 +780,8 @@ function join(separator) {
  * @complexity O(1)
  * @tsplus getter fncts.Vector last
  */
-
-
-function last(l) {
-  return tsplus_module_5.fromNullable(unsafeLast_1(l));
+function last(self) {
+  return tsplus_module_5.fromNullable(unsafeLast_1(self));
 }
 /**
  * Returns the index of the _last_ element in the Vector that is equal
@@ -918,17 +790,15 @@ function last(l) {
  * @complexity O(n)
  * @tsplus pipeable fncts.Vector lastIndexOf
  */
-
-
 function lastIndexOf(element) {
-  return as => {
+  return self => {
     const state = {
       element,
       found: false,
       index: 0
     };
-    (0, tsplus_module_2.foldRightCb)(indexOfCb, state, as);
-    return state.found ? as.length - state.index : -1;
+    (0, tsplus_module_2.foldRightCb)(indexOfCb, state, self);
+    return state.found ? self.length - state.index : -1;
   };
 }
 /**
@@ -938,29 +808,23 @@ function lastIndexOf(element) {
  * @complexity O(n)
  * @tsplus static fncts.VectorOps makeBy
  */
-
-
 function makeBy(n, f) {
   const l = emptyPushable_1();
-
   for (let i = 0; i < n; i++) {
     tsplus_module_2.push(f(i))(l);
   }
-
   return l;
 }
 /**
  * @tsplus pipeable fncts.Vector mapAccum
  */
-
-
 function mapAccum(s, f) {
-  return fa => {
+  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]];
-    })(fa);
+    })(self);
   };
 }
 /**
@@ -970,11 +834,9 @@ function mapAccum(s, f) {
  * @complexity O(n)
  * @tsplus pipeable fncts.Vector map
  */
-
-
 function map_1(f) {
-  return fa => {
-    return mapWithIndex_1((_, a) => f(a))(fa);
+  return self => {
+    return mapWithIndex_1((_, a) => f(a))(self);
   };
 }
 /**
@@ -984,20 +846,16 @@ function map_1(f) {
  * @complexity O(n)
  * @tsplus pipeable fncts.Vector mapWithIndex
  */
-
-
 function mapWithIndex_1(f) {
-  return fa => {
-    return new tsplus_module_1.Vector(fa.bits, fa.offset, fa.length, (0, tsplus_module_2.mapPrefix)(f, fa.prefix, (0, tsplus_module_2.getPrefixSize)(fa)), fa.root === undefined ? undefined : (0, tsplus_module_2.mapNode)(f, fa.root, (0, tsplus_module_2.getDepth)(fa), (0, tsplus_module_2.getPrefixSize)(fa), 1)[0], (0, tsplus_module_2.mapAffix)(f, fa.suffix, (0, tsplus_module_2.getSuffixSize)(fa), fa.length));
+  return self => {
+    return new tsplus_module_1.Vector(self.bits, self.offset, self.length, (0, tsplus_module_2.mapPrefix)(f, self.prefix, (0, tsplus_module_2.getPrefixSize)(self)), self.root === undefined ? undefined : (0, tsplus_module_2.mapNode)(f, self.root, (0, tsplus_module_2.getDepth)(self), (0, tsplus_module_2.getPrefixSize)(self), 1)[0], (0, tsplus_module_2.mapAffix)(f, self.suffix, (0, tsplus_module_2.getSuffixSize)(self), self.length));
   };
 }
 /**
  * @tsplus getter fncts.Vector mutableClone
  */
-
-
-function mutableClone_1(as) {
-  return new tsplus_module_1.Vector(as.bits, as.offset, as.length, as.prefix, as.root, as.suffix);
+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
@@ -1010,15 +868,12 @@ function mutableClone_1(as) {
  *
  * @tsplus pipeable fncts.Vector modifyAt
  */
-
-
 function modifyAt(i, f) {
-  return as => {
-    if (i < 0 || as.length <= i) {
-      return as;
+  return self => {
+    if (i < 0 || self.length <= i) {
+      return self;
     }
-
-    return updateAt_1(i, f(unsafeGet_1(i)(as)))(as);
+    return updateAt_1(i, f(unsafeGet_1(i)(self)))(self);
   };
 }
 /**
@@ -1029,11 +884,9 @@ function modifyAt(i, f) {
  *
  * @tsplus pipeable fncts.Vector none
  */
-
-
 function none(predicate) {
-  return as => {
-    return !exists_1(predicate)(as);
+  return self => {
+    return !some_1(predicate)(self);
   };
 }
 /**
@@ -1042,8 +895,6 @@ function none(predicate) {
  * @complexity O(1)
  * @tsplus static fncts.VectorOps pair
  */
-
-
 function pair(first, second) {
   return new tsplus_module_1.Vector(2, 0, 2, tsplus_module_2.emptyAffix, undefined, [first, second]);
 }
@@ -1054,10 +905,8 @@ function pair(first, second) {
  * @complexity `O(1)`
  * @tsplus getter fncts.Vector pop
  */
-
-
-function pop_1(as) {
-  return slice_1(0, -1)(as);
+function pop_1(self) {
+  return slice_1(0, -1)(self);
 }
 /**
  * Prepends an element to the front of a Vector and returns the new Vector.
@@ -1066,17 +915,14 @@ function pop_1(as) {
  *
  * @tsplus pipeable fncts.Vector prepend
  */
-
-
 function prepend_1(a) {
-  return as => {
-    const prefixSize = (0, tsplus_module_2.getPrefixSize)(as);
-
+  return self => {
+    const prefixSize = (0, tsplus_module_2.getPrefixSize)(self);
     if (prefixSize < 32) {
-      return new tsplus_module_1.Vector((0, tsplus_module_2.incrementPrefix)(as.bits), as.offset, as.length + 1, (0, tsplus_module_2.affixPush)(a, as.prefix, prefixSize), as.root, as.suffix);
+      return new tsplus_module_1.Vector((0, tsplus_module_2.incrementPrefix)(self.bits), self.offset, self.length + 1, (0, tsplus_module_2.affixPush)(a, self.prefix, prefixSize), self.root, self.suffix);
     } else {
-      const newVector = mutableClone_1(as);
-      (0, tsplus_module_2.prependNodeToTree)(newVector, (0, tsplus_module_2.reverseArray)(as.prefix));
+      const newVector = mutableClone_1(self);
+      (0, tsplus_module_2.prependNodeToTree)(newVector, (0, tsplus_module_2.reverseArray)(self.prefix));
       const newPrefix = [a];
       newVector.prefix = newPrefix;
       newVector.length++;
@@ -1088,10 +934,8 @@ function prepend_1(a) {
 /**
  * @tsplus operator fncts.Vector +
  */
-
-
-function prependOperator(a, as) {
-  return prepend_1(a)(as);
+function prependOperator(a, self) {
+  return prepend_1(a)(self);
 }
 /**
  * Returns a Vector of numbers between an inclusive lower bound and an exclusive upper bound.
@@ -1099,15 +943,11 @@ function prependOperator(a, as) {
  * @complexity O(n)
  * @tsplus static fncts.VectorOps range
  */
-
-
 function range(start, end) {
   const vec = emptyPushable_1();
-
   for (let i = start; i < end; ++i) {
     tsplus_module_2.push(i)(vec);
   }
-
   return vec;
 }
 /**
@@ -1119,11 +959,9 @@ function range(start, end) {
  *
  * @tsplus pipeable fncts.Vector remove
  */
-
-
 function remove(from, amount) {
-  return as => {
-    return concat_1(slice_1(from + amount, as.length)(as))(slice_1(0, from)(as));
+  return self => {
+    return concat_1(slice_1(from + amount, self.length)(self))(slice_1(0, from)(self));
   };
 }
 /**
@@ -1133,23 +971,17 @@ function remove(from, amount) {
  * @complexity O(n)
  * @tsplus static fncts.VectorOps replicate
  */
-
-
 function replicate(n, a) {
   let t = n;
   const l = emptyPushable_1();
-
   while (--t >= 0) {
     tsplus_module_2.push(a)(l);
   }
-
   return l;
 }
 /**
  * @tsplus getter fncts.Vector reverse
  */
-
-
 function reverse(self) {
   return foldLeft_1(empty_1(), (vec, elem) => prepend_1(elem)(vec))(self);
 }
@@ -1159,11 +991,9 @@ function reverse(self) {
  *
  * @tsplus pipeable fncts.Vector scanLeft
  */
-
-
 function scanLeft(initial, f) {
-  return as => {
-    return foldLeft_1(tsplus_module_2.push(initial)(emptyPushable_1()), (l2, a) => tsplus_module_2.push(f(unsafeLast_1(l2), a))(l2))(as);
+  return self => {
+    return foldLeft_1(tsplus_module_2.push(initial)(emptyPushable_1()), (l2, a) => tsplus_module_2.push(f(unsafeLast_1(l2), a))(l2))(self);
   };
 }
 /**
@@ -1172,8 +1002,6 @@ function scanLeft(initial, f) {
  * @complexity O(1)
  * @tsplus static fncts.VectorOps single
  */
-
-
 function single(a) {
   return vector_1(a);
 }
@@ -1185,102 +1013,87 @@ function single(a) {
  * @complexity `O(log(n))`
  * @tsplus pipeable fncts.Vector slice
  */
-
-
 function slice_1(from, to) {
-  return as => {
+  return self => {
     let {
       bits,
       length
-    } = as;
+    } = self;
     let _to = to;
     let _from = from;
-    _to = Math.min(length, to); // Handle negative indices
-
+    _to = Math.min(length, to);
+    // Handle negative indices
     if (_from < 0) {
       _from = length + from;
     }
-
     if (_to < 0) {
       _to = length + to;
-    } // Should we just return the empty Vector?
-
-
+    }
+    // Should we just return the empty Vector?
     if (_to <= _from || _to <= 0 || length <= _from) {
       return empty_1();
-    } // Return Vector unchanged if we are slicing nothing off
-
-
+    }
+    // Return Vector unchanged if we are slicing nothing off
     if (_from <= 0 && length <= _to) {
-      return as;
+      return self;
     }
-
     const newLength = _to - _from;
-    let prefixSize = (0, tsplus_module_2.getPrefixSize)(as);
-    const suffixSize = (0, tsplus_module_2.getSuffixSize)(as); // Both indices lie in the prefix
-
+    let prefixSize = (0, tsplus_module_2.getPrefixSize)(self);
+    const suffixSize = (0, tsplus_module_2.getSuffixSize)(self);
+    // Both indices lie in the prefix
     if (_to <= prefixSize) {
-      return new tsplus_module_1.Vector((0, tsplus_module_2.setPrefix)(newLength, 0), 0, newLength, as.prefix.slice(prefixSize - _to, prefixSize - _from), undefined, tsplus_module_2.emptyAffix);
+      return new tsplus_module_1.Vector((0, tsplus_module_2.setPrefix)(newLength, 0), 0, newLength, self.prefix.slice(prefixSize - _to, prefixSize - _from), undefined, tsplus_module_2.emptyAffix);
     }
-
-    const suffixStart = length - suffixSize; // Both indices lie in the suffix
-
+    const suffixStart = length - suffixSize;
+    // Both indices lie in the suffix
     if (suffixStart <= _from) {
-      return new tsplus_module_1.Vector((0, tsplus_module_2.setSuffix)(newLength, 0), 0, newLength, tsplus_module_2.emptyAffix, undefined, as.suffix.slice(_from - suffixStart, _to - suffixStart));
+      return new tsplus_module_1.Vector((0, tsplus_module_2.setSuffix)(newLength, 0), 0, newLength, tsplus_module_2.emptyAffix, undefined, self.suffix.slice(_from - suffixStart, _to - suffixStart));
     }
-
-    const newVector = mutableClone_1(as);
-    newVector.length = newLength; // Both indices lie in the tree
-
+    const newVector = mutableClone_1(self);
+    newVector.length = newLength;
+    // Both indices lie in the tree
     if (prefixSize <= _from && _to <= suffixStart) {
-      (0, tsplus_module_2.sliceTreeVector)(_from - prefixSize + as.offset, _to - prefixSize + as.offset - 1, as.root, (0, tsplus_module_2.getDepth)(as), as.offset, newVector);
+      (0, tsplus_module_2.sliceTreeVector)(_from - prefixSize + self.offset, _to - prefixSize + self.offset - 1, self.root, (0, tsplus_module_2.getDepth)(self), self.offset, newVector);
       return newVector;
     }
-
     if (0 < _from) {
       // we need _to slice something off of the left
       if (_from < prefixSize) {
         // shorten the prefix even though it's not strictly needed,
         // so that referenced items can be GC'd
-        newVector.prefix = as.prefix.slice(0, prefixSize - _from);
+        newVector.prefix = self.prefix.slice(0, prefixSize - _from);
         bits = (0, tsplus_module_2.setPrefix)(prefixSize - _from, bits);
       } else {
         // if we're here `_to` can't lie in the tree, so we can set the
         // root
         (0, tsplus_module_2.zeroOffset)();
-        newVector.root = (0, tsplus_module_2.sliceLeft)(newVector.root, (0, tsplus_module_2.getDepth)(as), _from - prefixSize, as.offset, true);
+        newVector.root = (0, tsplus_module_2.sliceLeft)(newVector.root, (0, tsplus_module_2.getDepth)(self), _from - prefixSize, self.offset, true);
         newVector.offset = tsplus_module_2.newOffset;
-
         if (newVector.root === undefined) {
           bits = (0, tsplus_module_2.setDepth)(0, bits);
         }
-
         bits = (0, tsplus_module_2.setPrefix)(tsplus_module_2.newAffix.length, bits);
         prefixSize = tsplus_module_2.newAffix.length;
         newVector.prefix = tsplus_module_2.newAffix;
       }
     }
-
     if (_to < length) {
       // we need _to slice something off of the right
       if (length - _to < suffixSize) {
-        bits = (0, tsplus_module_2.setSuffix)(suffixSize - (length - _to), bits); // slice the suffix even though it's not strictly needed,
+        bits = (0, tsplus_module_2.setSuffix)(suffixSize - (length - _to), bits);
+        // slice the suffix even though it's not strictly needed,
         // _to allow the removed items _to be GC'd
-
-        newVector.suffix = as.suffix.slice(0, suffixSize - (length - _to));
+        newVector.suffix = self.suffix.slice(0, suffixSize - (length - _to));
       } else {
-        newVector.root = (0, tsplus_module_2.sliceRight)(newVector.root, (0, tsplus_module_2.getDepth)(as), _to - prefixSize - 1, newVector.offset);
-
+        newVector.root = (0, tsplus_module_2.sliceRight)(newVector.root, (0, tsplus_module_2.getDepth)(self), _to - prefixSize - 1, newVector.offset);
         if (newVector.root === undefined) {
           bits = (0, tsplus_module_2.setDepth)(0, bits);
           newVector.offset = 0;
         }
-
         bits = (0, tsplus_module_2.setSuffix)(tsplus_module_2.newAffix.length, bits);
         newVector.suffix = tsplus_module_2.newAffix;
       }
     }
-
     newVector.bits = bits;
     return newVector;
   };
@@ -1288,13 +1101,9 @@ function slice_1(from, to) {
 /**
  * @tsplus pipeable fncts.Vector sort
  */
-
-
-function sort(
-/** @tsplus auto */
-O) {
+function sort( /** @tsplus auto */O) {
   return self => {
-    return sortWith_1(O.compare)(self);
+    return sortWith_1((a, b) => O.compare(b)(a))(self);
   };
 }
 /**
@@ -1308,16 +1117,14 @@ O) {
  *
  * @tsplus pipeable fncts.Vector sortWith
  */
-
-
 function sortWith_1(compare) {
-  return as => {
+  return self => {
     const arr = [];
     let i = 0;
     forEach_1(elm => arr.push({
       idx: i++,
       elm
-    }))(as);
+    }))(self);
     arr.sort(({
       elm: a,
       idx: i
@@ -1329,11 +1136,9 @@ function sortWith_1(compare) {
       return c !== 0 ? c : i < j ? -1 : 1;
     });
     const newL = emptyPushable_1();
-
     for (let i = 0; i < arr.length; ++i) {
       tsplus_module_2.push(arr[i].elm)(newL);
     }
-
     return newL;
   };
 }
@@ -1347,11 +1152,9 @@ function sortWith_1(compare) {
  *
  * @tsplus pipeable fncts.Vector splitAt
  */
-
-
 function splitAt_1(index) {
-  return as => {
-    return [slice_1(0, index)(as), slice_1(index, as.length)(as)];
+  return self => {
+    return [slice_1(0, index)(self), slice_1(index, self.length)(self)];
   };
 }
 /**
@@ -1362,12 +1165,10 @@ function splitAt_1(index) {
  *
  * @tsplus pipeable fncts.Vector splitWhen
  */
-
-
 function splitWhen(predicate) {
-  return as => {
-    const idx = findIndex_1(predicate)(as);
-    return idx === -1 ? [as, empty_1()] : splitAt_1(idx)(as);
+  return self => {
+    const idx = findIndex_1(predicate)(self);
+    return idx === -1 ? [self, empty_1()] : splitAt_1(idx)(self);
   };
 }
 /**
@@ -1378,10 +1179,8 @@ function splitWhen(predicate) {
  *
  * @tsplus getter fncts.Vector tail
  */
-
-
-function tail(as) {
-  return slice_1(1, as.length)(as);
+function tail(self) {
+  return slice_1(1, self.length)(self);
 }
 /**
  * Takes the first `n` elements from a Vector and returns them in a new Vector.
@@ -1389,11 +1188,9 @@ function tail(as) {
  * @complexity `O(log(n))`
  * @tsplus pipeable fncts.Vector take
  */
-
-
 function take(n) {
-  return as => {
-    return slice_1(0, n)(as);
+  return self => {
+    return slice_1(0, n)(self);
   };
 }
 /**
@@ -1405,17 +1202,15 @@ function take(n) {
  *
  * @tsplus pipeable fncts.Vector takeWhile
  */
-
-
 function takeWhile(predicate) {
-  return as => {
+  return self => {
     const {
       index
     } = (0, tsplus_module_2.foldLeftCb)(findNotIndexCb, {
       predicate,
       index: 0
-    }, as);
-    return slice_1(0, index)(as);
+    }, self);
+    return slice_1(0, index)(self);
   };
 }
 /**
@@ -1425,11 +1220,9 @@ function takeWhile(predicate) {
  * @complexity `O(log(n))`
  * @tsplus pipeable fncts.Vector takeLast
  */
-
-
 function takeLast(n) {
-  return as => {
-    return slice_1(as.length - n, as.length)(as);
+  return self => {
+    return slice_1(self.length - n, self.length)(self);
   };
 }
 /**
@@ -1441,17 +1234,15 @@ function takeLast(n) {
  *
  * @tsplus pipeable fncts.Vector takeLastWhile
  */
-
-
 function takeLastWhile(predicate) {
-  return as => {
+  return self => {
     const {
       index
     } = (0, tsplus_module_2.foldRightCb)(findNotIndexCb, {
       predicate,
       index: 0
-    }, as);
-    return slice_1(as.length - index, as.length)(as);
+    }, self);
+    return slice_1(self.length - index, self.length)(self);
   };
 }
 /**
@@ -1460,8 +1251,6 @@ function takeLastWhile(predicate) {
  * @complexity `O(n)`
  * @tsplus getter fncts.Vector toArray
  */
-
-
 function toArray(self) {
   return foldLeft_1([], tsplus_module_2.arrayPush)(self);
 }
@@ -1471,8 +1260,6 @@ function toArray(self) {
  * @complexity `O(n)`
  * @tsplus getter fncts.Vector toList
  */
-
-
 function toList(self) {
   const buffer = new tsplus_module_6.ListBuffer();
   forEach_1(a => {
@@ -1480,7 +1267,6 @@ function toList(self) {
   })(self);
   return buffer.toList;
 }
-
 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);
@@ -1490,43 +1276,32 @@ function _traverseWithIndex_1(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);
-
 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 getter fncts.Vector uniq
+ * @tsplus pipeable fncts.Vector uniq
  */
-
-
 exports.traverse = traverse;
-
-function uniq(as) {
-  return E => dropRepeatsWith_1(E.equals)(as);
+function uniq(E) {
+  return self => dropRepeatsWith_1((a, b) => E.equals(b)(a))(self);
 }
 /**
  * @tsplus static fncts.VectorOps unfold
  */
-
-
 function unfold(b, f) {
   const out = emptyPushable_1();
-  let state = b; // eslint-disable-next-line no-constant-condition
-
+  let state = b;
+  // eslint-disable-next-line no-constant-condition
   while (true) {
     const mt = f(state);
-
     if (tsplus_module_7.isJust(mt)) {
       const [a, b] = mt.value;
       tsplus_module_2.push(a)(out);
@@ -1535,10 +1310,8 @@ function unfold(b, f) {
       break;
     }
   }
-
   return out;
 }
-
 function findCb(value, state) {
   if (state.predicate(value)) {
     state.result = value;
@@ -1554,14 +1327,12 @@ function findCb(value, state) {
  * @complexity O(n)
  * @tsplus pipeable fncts.Vector unsafeFind
  */
-
-
 function unsafeFind_1(predicate) {
-  return as => {
+  return self => {
     return (0, tsplus_module_2.foldLeftCb)(findCb, {
       predicate,
       result: undefined
-    }, as).result;
+    }, self).result;
   };
 }
 /**
@@ -1571,14 +1342,12 @@ function unsafeFind_1(predicate) {
  * @complexity O(n)
  * @tsplus pipeable fncts.Vector unsafeFindLast
  */
-
-
 function unsafeFindLast_1(predicate) {
-  return as => {
+  return self => {
     return (0, tsplus_module_2.foldRightCb)(findCb, {
       predicate,
       result: undefined
-    }, as).result;
+    }, self).result;
   };
 }
 /**
@@ -1589,28 +1358,23 @@ function unsafeFindLast_1(predicate) {
  * @tsplus pipeable fncts.Vector unsafeGet
  * @tsplus pipeable-index fncts.Vector
  */
-
-
 function unsafeGet_1(index) {
-  return l => {
-    if (index < 0 || l.length <= index) {
+  return self => {
+    if (index < 0 || self.length <= index) {
       return undefined;
     }
-
-    const prefixSize = (0, tsplus_module_2.getPrefixSize)(l);
-    const suffixSize = (0, tsplus_module_2.getSuffixSize)(l);
-
+    const prefixSize = (0, tsplus_module_2.getPrefixSize)(self);
+    const suffixSize = (0, tsplus_module_2.getSuffixSize)(self);
     if (index < prefixSize) {
-      return l.prefix[prefixSize - index - 1];
-    } else if (index >= l.length - suffixSize) {
-      return l.suffix[index - (l.length - suffixSize)];
+      return self.prefix[prefixSize - index - 1];
+    } else if (index >= self.length - suffixSize) {
+      return self.suffix[index - (self.length - suffixSize)];
     }
-
     const {
       offset
-    } = l;
-    const depth = (0, tsplus_module_2.getDepth)(l);
-    return l.root.sizes === undefined ? (0, tsplus_module_2.nodeNthDense)(l.root, depth, offset === 0 ? index - prefixSize : (0, tsplus_module_2.handleOffset)(depth, offset, index - prefixSize)) : (0, tsplus_module_2.nodeNth)(l.root, depth, offset, index - prefixSize);
+    } = self;
+    const depth = (0, tsplus_module_2.getDepth)(self);
+    return self.root.sizes === undefined ? (0, tsplus_module_2.nodeNthDense)(self.root, depth, offset === 0 ? index - prefixSize : (0, tsplus_module_2.handleOffset)(depth, offset, index - prefixSize)) : (0, tsplus_module_2.nodeNth)(self.root, depth, offset, index - prefixSize);
   };
 }
 /**
@@ -1620,11 +1384,9 @@ function unsafeGet_1(index) {
  * @complexity O(1)
  * @tsplus getter fncts.Vector unsafeHead
  */
-
-
-function unsafeHead_1(l) {
-  const prefixSize = (0, tsplus_module_2.getPrefixSize)(l);
-  return prefixSize !== 0 ? l.prefix[prefixSize - 1] : l.length !== 0 ? l.suffix[0] : undefined;
+function unsafeHead_1(self) {
+  const prefixSize = (0, tsplus_module_2.getPrefixSize)(self);
+  return prefixSize !== 0 ? self.prefix[prefixSize - 1] : self.length !== 0 ? self.suffix[0] : undefined;
 }
 /**
  * Returns the last element of the Vector. If the Vector is empty the
@@ -1633,11 +1395,9 @@ function unsafeHead_1(l) {
  * @complexity O(1)
  * @tsplus getter fncts.Vector unsafeLast
  */
-
-
-function unsafeLast_1(l) {
-  const suffixSize = (0, tsplus_module_2.getSuffixSize)(l);
-  return suffixSize !== 0 ? l.suffix[suffixSize - 1] : l.length !== 0 ? l.prefix[0] : undefined;
+function unsafeLast_1(self) {
+  const suffixSize = (0, tsplus_module_2.getSuffixSize)(self);
+  return suffixSize !== 0 ? self.suffix[suffixSize - 1] : self.length !== 0 ? self.prefix[0] : undefined;
 }
 /**
  * Returns a Vector that has the entry specified by the index replaced with the given value.
@@ -1647,45 +1407,36 @@ function unsafeLast_1(l) {
  * @complexity O(log(n))
  * @tsplus pipeable fncts.Vector updateAt
  */
-
-
 function updateAt_1(i, a) {
-  return as => {
-    if (i < 0 || as.length <= i) {
-      return as;
+  return self => {
+    if (i < 0 || self.length <= i) {
+      return self;
     }
-
-    const prefixSize = (0, tsplus_module_2.getPrefixSize)(as);
-    const suffixSize = (0, tsplus_module_2.getSuffixSize)(as);
-    const newVector = mutableClone_1(as);
-
+    const prefixSize = (0, tsplus_module_2.getPrefixSize)(self);
+    const suffixSize = (0, tsplus_module_2.getSuffixSize)(self);
+    const newVector = mutableClone_1(self);
     if (i < prefixSize) {
       const newPrefix = (0, tsplus_module_2.copyArray)(newVector.prefix);
       newPrefix[newPrefix.length - i - 1] = a;
       newVector.prefix = newPrefix;
-    } else if (i >= as.length - suffixSize) {
+    } else if (i >= self.length - suffixSize) {
       const newSuffix = (0, tsplus_module_2.copyArray)(newVector.suffix);
-      newSuffix[i - (as.length - suffixSize)] = a;
+      newSuffix[i - (self.length - suffixSize)] = a;
       newVector.suffix = newSuffix;
     } else {
-      newVector.root = (0, tsplus_module_2.updateNode)(as.root, (0, tsplus_module_2.getDepth)(as), i - prefixSize, as.offset, a);
+      newVector.root = (0, tsplus_module_2.updateNode)(self.root, (0, tsplus_module_2.getDepth)(self), i - prefixSize, self.offset, a);
     }
-
     return newVector;
   };
 }
 /**
  * @tsplus static fncts.VectorOps __call
  */
-
-
 function vector_1(...elements) {
   const v = emptyPushable_1();
-
   for (const element of elements) {
     tsplus_module_2.push(element)(v);
   }
-
   return v;
 }
 //# sourceMappingURL=api.cjs.map