@fncts/base 0.0.32 → 0.0.33

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

@@ -78,79 +78,48 @@ 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 _internal = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/collection/immutable/Vector/internal"));
+var tsplus_module_2 = _internal;
 var tsplus_module_3 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/data/Maybe/destructors"));
 var tsplus_module_4 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/data/Equatable/api"));
 var tsplus_module_5 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/collection/immutable/Vector/definition"));
 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(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 filterMapWithIndex = filterMapWithIndex_1;
-exports.filterMapWithIndex = filterMapWithIndex;
-const filterWithIndex = filterWithIndex_1;
-exports.filterWithIndex = filterWithIndex;
-const concat = concat_1;
-exports.concat = concat;
-const dropRepeatsWith = dropRepeatsWith_1;
-exports.dropRepeatsWith = dropRepeatsWith;
-const empty = empty_1;
-exports.empty = empty;
-const emptyPushable = emptyPushable_1;
-exports.emptyPushable = emptyPushable;
-const some = some_1;
-exports.some = some;
-const findIndex = findIndex_1;
-exports.findIndex = findIndex;
-const flatten = flatten_1;
-exports.flatten = flatten;
-const foldLeft = foldLeft_1;
-exports.foldLeft = foldLeft;
-const foldLeftWithIndex = foldLeftWithIndex_1;
-exports.foldLeftWithIndex = foldLeftWithIndex;
-const foldLeftWhile = foldLeftWhile_1;
-exports.foldLeftWhile = foldLeftWhile;
-const foldMapWithIndex = foldMapWithIndex_1;
-exports.foldMapWithIndex = foldMapWithIndex;
-const foldRightWithIndex = foldRightWithIndex_1;
-exports.foldRightWithIndex = foldRightWithIndex;
-const forEach = forEach_1;
-exports.forEach = forEach;
-const map = map_1;
-exports.map = map;
-const mapWithIndex = mapWithIndex_1;
-exports.mapWithIndex = mapWithIndex;
-const mutableClone = mutableClone_1;
-exports.mutableClone = mutableClone;
-const pop = pop_1;
-exports.pop = pop;
-const prepend = prepend_1;
-exports.prepend = prepend;
-const slice = slice_1;
-exports.slice = slice;
-const sortWith = sortWith_1;
-exports.sortWith = sortWith;
-const splitAt = splitAt_1;
-exports.splitAt = splitAt;
-const _traverseWithIndex = _traverseWithIndex_1;
-exports._traverseWithIndex = _traverseWithIndex;
-const unsafeFind = unsafeFind_1;
-exports.unsafeFind = unsafeFind;
-const unsafeFindLast = unsafeFindLast_1;
-exports.unsafeFindLast = unsafeFindLast;
-const unsafeGet = unsafeGet_1;
-exports.unsafeGet = unsafeGet;
-const unsafeHead = unsafeHead_1;
-exports.unsafeHead = unsafeHead;
-const unsafeLast = unsafeLast_1;
-exports.unsafeLast = unsafeLast;
-const updateAt = updateAt_1;
-exports.updateAt = updateAt;
-const vector = vector_1;
-exports.vector = vector;
+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 && Object.prototype.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; }
+const append = exports.append = append_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 foldMapWithIndex = exports.foldMapWithIndex = foldMapWithIndex_1;
+const foldRightWithIndex = exports.foldRightWithIndex = foldRightWithIndex_1;
+const forEach = exports.forEach = forEach_1;
+const map = exports.map = map_1;
+const mapWithIndex = exports.mapWithIndex = mapWithIndex_1;
+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 sortWith = exports.sortWith = sortWith_1;
+const splitAt = exports.splitAt = splitAt_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;
+const unsafeHead = exports.unsafeHead = unsafeHead_1;
+const unsafeLast = exports.unsafeLast = unsafeLast_1;
+const updateAt = exports.updateAt = updateAt_1;
+const vector = exports.vector = vector_1;
 /**
  * Appends an element to the end of a Vector and returns the new Vector.
  *
@@ -161,16 +130,16 @@ exports.vector = vector;
  */
 function append_1(a) {
   return self => {
-    const suffixSize = (0, tsplus_module_2.getSuffixSize)(self);
+    const suffixSize = (0, _internal.getSuffixSize)(self);
     if (suffixSize < 32) {
-      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));
+      return new tsplus_module_1.Vector((0, _internal.incrementSuffix)(self.bits), self.offset, self.length + 1, self.prefix, self.root, (0, _internal.affixPush)(a, self.suffix, suffixSize));
     }
     const newSuffix = [a];
     const newVector = mutableClone_1(self);
-    (0, tsplus_module_2.appendNodeToTree)(newVector, self.suffix);
+    (0, _internal.appendNodeToTree)(newVector, self.suffix);
     newVector.suffix = newSuffix;
     newVector.length++;
-    newVector.bits = (0, tsplus_module_2.setSuffix)(1, newVector.bits);
+    newVector.bits = (0, _internal.setSuffix)(1, newVector.bits);
     return newVector;
   };
 }
@@ -252,36 +221,36 @@ function concat_1(that) {
       return self;
     }
     const newSize = self.length + that.length;
-    const rightSuffixSize = (0, tsplus_module_2.getSuffixSize)(that);
+    const rightSuffixSize = (0, _internal.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);
+      const nrOfAffixes = (0, _internal.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;
+        newVector = (0, _internal.appendNodeToTree)(newVector, _internal.concatBuffer[i]);
+        newVector.length += _internal.concatBuffer[i].length;
         // wipe pointer, otherwise it might end up keeping the array alive
-        tsplus_module_2.concatBuffer[i] = undefined;
+        _internal.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);
-      tsplus_module_2.concatBuffer[nrOfAffixes] = undefined;
+      newVector.suffix = _internal.concatBuffer[nrOfAffixes];
+      newVector.bits = (0, _internal.setSuffix)(_internal.concatBuffer[nrOfAffixes].length, newVector.bits);
+      _internal.concatBuffer[nrOfAffixes] = undefined;
       return newVector;
     } else {
-      const leftSuffixSize = (0, tsplus_module_2.getSuffixSize)(self);
+      const leftSuffixSize = (0, _internal.getSuffixSize)(self);
       if (leftSuffixSize > 0) {
-        newVector = (0, tsplus_module_2.appendNodeToTree)(newVector, self.suffix.slice(0, leftSuffixSize));
+        newVector = (0, _internal.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);
-      (0, tsplus_module_2.setSizes)(newNode, newDepth);
+      newVector = (0, _internal.appendNodeToTree)(newVector, that.prefix.slice(0, (0, _internal.getPrefixSize)(that)).reverse());
+      const newNode = (0, _internal.concatSubTree)(newVector.root, (0, _internal.getDepth)(newVector), that.root, (0, _internal.getDepth)(that), true);
+      const newDepth = (0, _internal.getHeight)(newNode);
+      (0, _internal.setSizes)(newNode, newDepth);
       newVector.root = newNode;
-      newVector.offset &= ~(tsplus_module_2.mask << (0, tsplus_module_2.getDepth)(self) * tsplus_module_2.branchBits);
+      newVector.offset &= ~(_internal.mask << (0, _internal.getDepth)(self) * _internal.branchBits);
       newVector.length = newSize;
-      newVector.bits = (0, tsplus_module_2.setSuffix)(rightSuffixSize, (0, tsplus_module_2.setDepth)(newDepth, newVector.bits));
+      newVector.bits = (0, _internal.setSuffix)(rightSuffixSize, (0, _internal.setDepth)(newDepth, newVector.bits));
       newVector.suffix = that.suffix;
       return newVector;
     }
@@ -305,7 +274,7 @@ function contains(element) {
   return self => {
     containsState.element = element;
     containsState.result = false;
-    return (0, tsplus_module_2.foldLeftCb)(containsCb, containsState, self).result;
+    return (0, _internal.foldLeftCb)(containsCb, containsState, self).result;
   };
 }
 /**
@@ -371,7 +340,7 @@ function dropWhile(predicate) {
   return self => {
     const {
       index
-    } = (0, tsplus_module_2.foldLeftCb)(findNotIndexCb, {
+    } = (0, _internal.foldLeftCb)(findNotIndexCb, {
       predicate,
       index: 0
     }, self);
@@ -392,7 +361,7 @@ function elem(a, /** @tsplus auto */E) {
   };
   return self => {
     elemState.element = a;
-    return (0, tsplus_module_2.foldLeftCb)(elemCb, elemState, self).result;
+    return (0, _internal.foldLeftCb)(elemCb, elemState, self).result;
   };
 }
 /**
@@ -411,7 +380,7 @@ function everyCb(value, state) {
 }
 function every(predicate) {
   return self => {
-    return (0, tsplus_module_2.foldLeftCb)(everyCb, {
+    return (0, _internal.foldLeftCb)(everyCb, {
       predicate,
       result: true
     }, self).result;
@@ -424,7 +393,7 @@ function every(predicate) {
  * @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);
+  return new tsplus_module_1.Vector(0, 0, 0, _internal.emptyAffix, undefined, _internal.emptyAffix);
 }
 /**
  * @tsplus static fncts.VectorOps emptyPushable
@@ -445,7 +414,7 @@ function someCb(value, state) {
  */
 function some_1(predicate) {
   return self => {
-    return (0, tsplus_module_2.foldLeftCb)(someCb, {
+    return (0, _internal.foldLeftCb)(someCb, {
       predicate,
       result: false
     }, self).result;
@@ -480,7 +449,7 @@ function findIndex_1(predicate) {
     const {
       found,
       index
-    } = (0, tsplus_module_2.foldLeftCb)(findIndexCb, {
+    } = (0, _internal.foldLeftCb)(findIndexCb, {
       predicate,
       found: false,
       index: -1
@@ -513,7 +482,7 @@ function findLastIndex(predicate) {
     const {
       found,
       index
-    } = (0, tsplus_module_2.foldRightCb)(findIndexCb, {
+    } = (0, _internal.foldRightCb)(findIndexCb, {
       predicate,
       found: false,
       index: -0
@@ -562,13 +531,13 @@ function foldLeft_1(initial, f) {
  */
 function foldLeftWithIndex_1(b, f) {
   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);
+    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, tsplus_module_2.foldLeftNode)(f, acc, self.root, (0, tsplus_module_2.getDepth)(self), index);
+      [acc, index] = (0, _internal.foldLeftNode)(f, acc, self.root, (0, _internal.getDepth)(self), index);
     }
-    return (0, tsplus_module_2.foldLeftSuffix)(f, acc, self.suffix, suffixSize, index)[0];
+    return (0, _internal.foldLeftSuffix)(f, acc, self.suffix, suffixSize, index)[0];
   };
 }
 /**
@@ -600,7 +569,7 @@ function foldLeftWhile_1(b, cont, f) {
     if (!cont(b)) {
       return b;
     }
-    return (0, tsplus_module_2.foldLeftCb)(foldWhileCb, {
+    return (0, _internal.foldLeftCb)(foldWhileCb, {
       predicate: cont,
       f,
       result: b
@@ -612,7 +581,7 @@ function foldLeftWhile_1(b, cont, f) {
  */
 function foldRightWhile(b, cont, f) {
   return self => {
-    return (0, tsplus_module_2.foldRightCb)(foldWhileCb, {
+    return (0, _internal.foldRightCb)(foldWhileCb, {
       predicate: cont,
       result: b,
       f: (i, b, a) => f(i, a, b)
@@ -654,13 +623,13 @@ function foldRight(initial, f) {
  */
 function foldRightWithIndex_1(b, f) {
   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);
+    const suffixSize = (0, _internal.getSuffixSize)(self);
+    const prefixSize = (0, _internal.getPrefixSize)(self);
+    let [acc, j] = (0, _internal.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);
+      [acc, j] = (0, _internal.foldRightNode)(f, acc, self.root, (0, _internal.getDepth)(self), j);
     }
-    return (0, tsplus_module_2.foldRightPrefix)(f, acc, self.prefix, prefixSize, j)[0];
+    return (0, _internal.foldRightPrefix)(f, acc, self.prefix, prefixSize, j)[0];
   };
 }
 /**
@@ -759,7 +728,7 @@ function indexOf(element) {
       found: false,
       index: -1
     };
-    (0, tsplus_module_2.foldLeftCb)(indexOfCb, state, self);
+    (0, _internal.foldLeftCb)(indexOfCb, state, self);
     return state.found ? state.index : -1;
   };
 }
@@ -840,7 +809,7 @@ function lastIndexOf(element) {
       found: false,
       index: 0
     };
-    (0, tsplus_module_2.foldRightCb)(indexOfCb, state, self);
+    (0, _internal.foldRightCb)(indexOfCb, state, self);
     return state.found ? self.length - state.index : -1;
   };
 }
@@ -891,7 +860,7 @@ function map_1(f) {
  */
 function mapWithIndex_1(f) {
   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));
+    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));
   };
 }
 /**
@@ -939,7 +908,7 @@ function none(predicate) {
  * @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]);
+  return new tsplus_module_1.Vector(2, 0, 2, _internal.emptyAffix, undefined, [first, second]);
 }
 /**
  * Returns a new Vector with the last element removed. If the Vector is
@@ -960,16 +929,16 @@ function pop_1(self) {
  */
 function prepend_1(a) {
   return self => {
-    const prefixSize = (0, tsplus_module_2.getPrefixSize)(self);
+    const prefixSize = (0, _internal.getPrefixSize)(self);
     if (prefixSize < 32) {
-      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);
+      return new tsplus_module_1.Vector((0, _internal.incrementPrefix)(self.bits), self.offset, self.length + 1, (0, _internal.affixPush)(a, self.prefix, prefixSize), self.root, self.suffix);
     } else {
       const newVector = mutableClone_1(self);
-      (0, tsplus_module_2.prependNodeToTree)(newVector, (0, tsplus_module_2.reverseArray)(self.prefix));
+      (0, _internal.prependNodeToTree)(newVector, (0, _internal.reverseArray)(self.prefix));
       const newPrefix = [a];
       newVector.prefix = newPrefix;
       newVector.length++;
-      newVector.bits = (0, tsplus_module_2.setPrefix)(1, newVector.bits);
+      newVector.bits = (0, _internal.setPrefix)(1, newVector.bits);
       return newVector;
     }
   };
@@ -1081,22 +1050,22 @@ function slice_1(from, to) {
       return self;
     }
     const newLength = _to - _from;
-    let prefixSize = (0, tsplus_module_2.getPrefixSize)(self);
-    const suffixSize = (0, tsplus_module_2.getSuffixSize)(self);
+    let prefixSize = (0, _internal.getPrefixSize)(self);
+    const suffixSize = (0, _internal.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, self.prefix.slice(prefixSize - _to, prefixSize - _from), undefined, tsplus_module_2.emptyAffix);
+      return new tsplus_module_1.Vector((0, _internal.setPrefix)(newLength, 0), 0, newLength, self.prefix.slice(prefixSize - _to, prefixSize - _from), undefined, _internal.emptyAffix);
     }
     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, self.suffix.slice(_from - suffixStart, _to - suffixStart));
+      return new tsplus_module_1.Vector((0, _internal.setSuffix)(newLength, 0), 0, newLength, _internal.emptyAffix, undefined, self.suffix.slice(_from - suffixStart, _to - suffixStart));
     }
     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 + self.offset, _to - prefixSize + self.offset - 1, self.root, (0, tsplus_module_2.getDepth)(self), self.offset, newVector);
+      (0, _internal.sliceTreeVector)(_from - prefixSize + self.offset, _to - prefixSize + self.offset - 1, self.root, (0, _internal.getDepth)(self), self.offset, newVector);
       return newVector;
     }
     if (0 < _from) {
@@ -1105,36 +1074,36 @@ function slice_1(from, to) {
         // shorten the prefix even though it's not strictly needed,
         // so that referenced items can be GC'd
         newVector.prefix = self.prefix.slice(0, prefixSize - _from);
-        bits = (0, tsplus_module_2.setPrefix)(prefixSize - _from, bits);
+        bits = (0, _internal.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)(self), _from - prefixSize, self.offset, true);
-        newVector.offset = tsplus_module_2.newOffset;
+        (0, _internal.zeroOffset)();
+        newVector.root = (0, _internal.sliceLeft)(newVector.root, (0, _internal.getDepth)(self), _from - prefixSize, self.offset, true);
+        newVector.offset = _internal.newOffset;
         if (newVector.root === undefined) {
-          bits = (0, tsplus_module_2.setDepth)(0, bits);
+          bits = (0, _internal.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;
+        bits = (0, _internal.setPrefix)(_internal.newAffix.length, bits);
+        prefixSize = _internal.newAffix.length;
+        newVector.prefix = _internal.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);
+        bits = (0, _internal.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 = self.suffix.slice(0, suffixSize - (length - _to));
       } else {
-        newVector.root = (0, tsplus_module_2.sliceRight)(newVector.root, (0, tsplus_module_2.getDepth)(self), _to - prefixSize - 1, newVector.offset);
+        newVector.root = (0, _internal.sliceRight)(newVector.root, (0, _internal.getDepth)(self), _to - prefixSize - 1, newVector.offset);
         if (newVector.root === undefined) {
-          bits = (0, tsplus_module_2.setDepth)(0, bits);
+          bits = (0, _internal.setDepth)(0, bits);
           newVector.offset = 0;
         }
-        bits = (0, tsplus_module_2.setSuffix)(tsplus_module_2.newAffix.length, bits);
-        newVector.suffix = tsplus_module_2.newAffix;
+        bits = (0, _internal.setSuffix)(_internal.newAffix.length, bits);
+        newVector.suffix = _internal.newAffix;
       }
     }
     newVector.bits = bits;
@@ -1249,7 +1218,7 @@ function takeWhile(predicate) {
   return self => {
     const {
       index
-    } = (0, tsplus_module_2.foldLeftCb)(findNotIndexCb, {
+    } = (0, _internal.foldLeftCb)(findNotIndexCb, {
       predicate,
       index: 0
     }, self);
@@ -1281,7 +1250,7 @@ function takeLastWhile(predicate) {
   return self => {
     const {
       index
-    } = (0, tsplus_module_2.foldRightCb)(findNotIndexCb, {
+    } = (0, _internal.foldRightCb)(findNotIndexCb, {
       predicate,
       index: 0
     }, self);
@@ -1295,7 +1264,7 @@ function takeLastWhile(predicate) {
  * @tsplus getter fncts.Vector toArray
  */
 function toArray(self) {
-  return foldLeft_1([], tsplus_module_2.arrayPush)(self);
+  return foldLeft_1([], _internal.arrayPush)(self);
 }
 /**
  * Converts a Vector into a List.
@@ -1372,7 +1341,7 @@ function findCb(value, state) {
  */
 function unsafeFind_1(predicate) {
   return self => {
-    return (0, tsplus_module_2.foldLeftCb)(findCb, {
+    return (0, _internal.foldLeftCb)(findCb, {
       predicate,
       result: undefined
     }, self).result;
@@ -1387,7 +1356,7 @@ function unsafeFind_1(predicate) {
  */
 function unsafeFindLast_1(predicate) {
   return self => {
-    return (0, tsplus_module_2.foldRightCb)(findCb, {
+    return (0, _internal.foldRightCb)(findCb, {
       predicate,
       result: undefined
     }, self).result;
@@ -1406,8 +1375,8 @@ function unsafeGet_1(index) {
     if (index < 0 || self.length <= index) {
       return undefined;
     }
-    const prefixSize = (0, tsplus_module_2.getPrefixSize)(self);
-    const suffixSize = (0, tsplus_module_2.getSuffixSize)(self);
+    const prefixSize = (0, _internal.getPrefixSize)(self);
+    const suffixSize = (0, _internal.getSuffixSize)(self);
     if (index < prefixSize) {
       return self.prefix[prefixSize - index - 1];
     } else if (index >= self.length - suffixSize) {
@@ -1416,8 +1385,8 @@ function unsafeGet_1(index) {
     const {
       offset
     } = 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);
+    const depth = (0, _internal.getDepth)(self);
+    return self.root.sizes === undefined ? (0, _internal.nodeNthDense)(self.root, depth, offset === 0 ? index - prefixSize : (0, _internal.handleOffset)(depth, offset, index - prefixSize)) : (0, _internal.nodeNth)(self.root, depth, offset, index - prefixSize);
   };
 }
 /**
@@ -1428,7 +1397,7 @@ function unsafeGet_1(index) {
  * @tsplus getter fncts.Vector unsafeHead
  */
 function unsafeHead_1(self) {
-  const prefixSize = (0, tsplus_module_2.getPrefixSize)(self);
+  const prefixSize = (0, _internal.getPrefixSize)(self);
   return prefixSize !== 0 ? self.prefix[prefixSize - 1] : self.length !== 0 ? self.suffix[0] : undefined;
 }
 /**
@@ -1439,7 +1408,7 @@ function unsafeHead_1(self) {
  * @tsplus getter fncts.Vector unsafeLast
  */
 function unsafeLast_1(self) {
-  const suffixSize = (0, tsplus_module_2.getSuffixSize)(self);
+  const suffixSize = (0, _internal.getSuffixSize)(self);
   return suffixSize !== 0 ? self.suffix[suffixSize - 1] : self.length !== 0 ? self.prefix[0] : undefined;
 }
 /**
@@ -1455,19 +1424,19 @@ function updateAt_1(i, a) {
     if (i < 0 || self.length <= i) {
       return self;
     }
-    const prefixSize = (0, tsplus_module_2.getPrefixSize)(self);
-    const suffixSize = (0, tsplus_module_2.getSuffixSize)(self);
+    const prefixSize = (0, _internal.getPrefixSize)(self);
+    const suffixSize = (0, _internal.getSuffixSize)(self);
     const newVector = mutableClone_1(self);
     if (i < prefixSize) {
-      const newPrefix = (0, tsplus_module_2.copyArray)(newVector.prefix);
+      const newPrefix = (0, _internal.copyArray)(newVector.prefix);
       newPrefix[newPrefix.length - i - 1] = a;
       newVector.prefix = newPrefix;
     } else if (i >= self.length - suffixSize) {
-      const newSuffix = (0, tsplus_module_2.copyArray)(newVector.suffix);
+      const newSuffix = (0, _internal.copyArray)(newVector.suffix);
       newSuffix[i - (self.length - suffixSize)] = a;
       newVector.suffix = newSuffix;
     } else {
-      newVector.root = (0, tsplus_module_2.updateNode)(self.root, (0, tsplus_module_2.getDepth)(self), i - prefixSize, self.offset, a);
+      newVector.root = (0, _internal.updateNode)(self.root, (0, _internal.getDepth)(self), i - prefixSize, self.offset, a);
     }
     return newVector;
   };