@fncts/base 0.0.20 → 0.0.22

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

@@ -3,46 +3,36 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.find_ = void 0;
-exports.forEachBetween_ = forEachBetween_;
-exports.forEachGt_ = forEachGt_;
-exports.forEachGte_ = forEachGte_;
-exports.forEachLt_ = forEachLt_;
-exports.forEachLte_ = forEachLte_;
-exports.forEach_ = forEach_;
-exports.getGt_ = getGt_;
-exports.getGte_ = getGte_;
-exports.getLt_ = getLt_;
-exports.getLte_ = getLte_;
-exports.get_ = get_;
-exports.insertWith_ = insertWith_;
-exports.insert_ = insert_;
+exports.find = void 0;
+exports.forEach = forEach;
+exports.forEachBetween = forEachBetween;
+exports.forEachGt = forEachGt;
+exports.forEachGte = forEachGte;
+exports.forEachLt = forEachLt;
+exports.forEachLte = forEachLte;
+exports.get = get;
+exports.getGt = getGt;
+exports.getGte = getGte;
+exports.getLt = getLt;
+exports.getLte = getLte;
 exports.isEmpty = isEmpty;
 exports.isNonEmpty = isNonEmpty;
 exports.make = make;
-exports.remove_ = remove_;
+exports.remove = remove;
+exports.set = set;
+exports.setWith = setWith;
 exports.visitLte = exports.visitLt = exports.visitGte = exports.visitGt = exports.visitFull = exports.visitBetween = void 0;
-
 var tsplus_module_1 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/data/Maybe/constructors"));
-
 var tsplus_module_2 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/data/Maybe/definition"));
-
 var tsplus_module_3 = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@fncts/base/internal/Stack"));
-
 var _definition2 = /*#__PURE__*/require("@fncts/base/collection/immutable/SortedMap/definition");
-
 var _internal = /*#__PURE__*/require("@fncts/base/collection/immutable/SortedMap/internal");
-
 var _iterator = /*#__PURE__*/require("@fncts/base/collection/immutable/SortedMap/iterator");
-
 var _node = /*#__PURE__*/require("@fncts/base/collection/immutable/SortedMap/node");
-
 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 find_ = find_1;
-exports.find_ = find_;
+const find = find_1;
+exports.find = find;
 const visitFull = visitFull_1;
 exports.visitFull = visitFull;
 const visitLte = visitLte_1;
@@ -55,637 +45,550 @@ const visitGt = visitGt_1;
 exports.visitGt = visitGt;
 const visitBetween = visitBetween_1;
 exports.visitBetween = visitBetween;
-
 /**
- * @tsplus fluent fncts.SortedMap find
+ * @tsplus pipeable fncts.SortedMap find
  */
-function find_1(m, key, direction = 0) {
-  return {
-    ord: m.ord,
-
-    [Symbol.iterator]() {
-      const cmp = m.ord.compare;
-      let n = m.root;
-      const stack = [];
-
-      while (n) {
-        const d = cmp(key, n.key);
-        stack.push(n);
-
-        switch (d) {
-          case 0:
-            {
-              return new _iterator.SortedMapIterator(m, stack, direction);
-            }
-
-          case -1:
-            {
-              n = n.left;
-              break;
-            }
-
-          case 1:
-            {
-              n = n.right;
-              break;
-            }
+function find_1(key, direction = 0) {
+  return m => {
+    return {
+      ord: m.ord,
+      [Symbol.iterator]() {
+        const cmp = m.ord.compare;
+        let n = m.root;
+        const stack = [];
+        while (n) {
+          const d = cmp(n.key)(key);
+          stack.push(n);
+          switch (d) {
+            case 0:
+              {
+                return new _iterator.SortedMapIterator(m, stack, direction);
+              }
+            case -1:
+              {
+                n = n.left;
+                break;
+              }
+            case 1:
+              {
+                n = n.right;
+                break;
+              }
+          }
         }
+        return new _iterator.SortedMapIterator(m, [], direction);
       }
-
-      return new _iterator.SortedMapIterator(m, [], direction);
-    }
-
+    };
   };
 }
 /**
  * Iterates through the elements of the map inorder, performing the given function for each element
  *
- * @tsplus fluent fncts.SortedMap forEach
+ * @tsplus pipeable fncts.SortedMap forEach
  */
-
-
-function forEach_(m, visit) {
-  if (m.root) {
-    visitFull_1(m, (k, v) => {
-      visit(k, v);
-      return tsplus_module_1.nothing();
-    });
-  }
+function forEach(visit) {
+  return self => {
+    if (self.root) {
+      visitFull_1((k, v) => {
+        visit(k, v);
+        return tsplus_module_1.nothing();
+      })(self);
+    }
+  };
 }
 /**
- * @tsplus fluent fncts.SortedMap forEachBetween
+ * @tsplus pipeable fncts.SortedMap forEachBetween
  */
-
-
-function forEachBetween_(m, min, max, visit) {
-  if (m.root) {
-    visitBetween_1(m, min, max, (k, v) => {
-      visit(k, v);
-      return tsplus_module_1.nothing();
-    });
-  }
+function forEachBetween(min, max, visit) {
+  return self => {
+    if (self.root) {
+      visitBetween_1(min, max, (k, v) => {
+        visit(k, v);
+        return tsplus_module_1.nothing();
+      })(self);
+    }
+  };
 }
 /**
- * @tsplus fluent fncts.SortedMap forEachLte
+ * @tsplus pipeable fncts.SortedMap forEachLte
  */
-
-
-function forEachLte_(m, max, visit) {
-  if (m.root) {
-    visitLte_1(m, max, (k, v) => {
-      visit(k, v);
-      return tsplus_module_1.nothing();
-    });
-  }
+function forEachLte(max, visit) {
+  return self => {
+    if (self.root) {
+      visitLte_1(max, (k, v) => {
+        visit(k, v);
+        return tsplus_module_1.nothing();
+      })(self);
+    }
+  };
 }
 /**
- * @tsplus fluent fncts.SortedMap forEachLt
+ * @tsplus pipeable fncts.SortedMap forEachLt
  */
-
-
-function forEachLt_(m, max, visit) {
-  if (m.root) {
-    visitLt_1(m, max, (k, v) => {
-      visit(k, v);
-      return tsplus_module_1.nothing();
-    });
-  }
+function forEachLt(max, visit) {
+  return self => {
+    if (self.root) {
+      visitLt_1(max, (k, v) => {
+        visit(k, v);
+        return tsplus_module_1.nothing();
+      })(self);
+    }
+  };
 }
 /**
- * @tsplus fluent fncts.SortedMap forEachGte
+ * @tsplus pipeable fncts.SortedMap forEachGte
  */
-
-
-function forEachGte_(m, min, visit) {
-  if (m.root) {
-    visitGte_1(m, min, (k, v) => {
-      visit(k, v);
-      return tsplus_module_1.nothing();
-    });
-  }
+function forEachGte(min, visit) {
+  return self => {
+    if (self.root) {
+      visitGte_1(min, (k, v) => {
+        visit(k, v);
+        return tsplus_module_1.nothing();
+      })(self);
+    }
+  };
 }
 /**
- * @tsplus fluent fncts.SortedMap forEachGt
+ * @tsplus pipeable fncts.SortedMap forEachGt
  */
-
-
-function forEachGt_(m, min, visit) {
-  if (m.root) {
-    visitGt_1(m, min, (k, v) => {
-      visit(k, v);
-      return tsplus_module_1.nothing();
-    });
-  }
+function forEachGt(min, visit) {
+  return self => {
+    if (self.root) {
+      visitGt_1(min, (k, v) => {
+        visit(k, v);
+        return tsplus_module_1.nothing();
+      })(self);
+    }
+  };
 }
 /**
  * Searches the map for a given key, returning it's value, if it exists
  *
- * @tsplus fluent fncts.SortedMap get
+ * @tsplus pipeable fncts.SortedMap get
  */
-
-
-function get_(m, key) {
-  const cmp = m.ord.compare;
-  let n = m.root;
-
-  while (n) {
-    const d = cmp(key, n.key);
-
-    switch (d) {
-      case 0:
-        {
-          return tsplus_module_1.just(n.value);
-        }
-
-      case -1:
-        {
-          n = n.left;
-          break;
-        }
-
-      case 1:
-        {
-          n = n.right;
-          break;
-        }
+function get(key) {
+  return self => {
+    const cmp = self.ord.compare;
+    let n = self.root;
+    while (n) {
+      const d = cmp(n.key)(key);
+      switch (d) {
+        case 0:
+          {
+            return tsplus_module_1.just(n.value);
+          }
+        case -1:
+          {
+            n = n.left;
+            break;
+          }
+        case 1:
+          {
+            n = n.right;
+            break;
+          }
+      }
     }
-  }
-
-  return tsplus_module_1.nothing();
+    return tsplus_module_1.nothing();
+  };
 }
 /**
  * Searches the map and returns the first value in sorted order that is > key, if it exists
  *
- * @tsplus fluent fncts.SortedMap getGt
+ * @tsplus pipeable fncts.SortedMap getGt
  */
-
-
-function getGt_(m, key) {
-  const cmp = m.ord.compare;
-  let n = m.root;
-  let lastValue = tsplus_module_1.nothing();
-
-  while (n) {
-    const d = cmp(key, n.key);
-
-    if (d < 0) {
-      lastValue = tsplus_module_1.just(n.value);
-      n = n.left;
-    } else {
-      if (tsplus_module_2.isJust(lastValue)) {
-        break;
+function getGt(key) {
+  return self => {
+    const cmp = self.ord.compare;
+    let n = self.root;
+    let lastValue = tsplus_module_1.nothing();
+    while (n) {
+      const d = cmp(n.key)(key);
+      if (d < 0) {
+        lastValue = tsplus_module_1.just(n.value);
+        n = n.left;
+      } else {
+        if (tsplus_module_2.isJust(lastValue)) {
+          break;
+        }
+        n = n.right;
       }
-
-      n = n.right;
     }
-  }
-
-  return lastValue;
+    return lastValue;
+  };
 }
 /**
  * Searches the map and returns the first value in sorted order that is < key, if it exists
  *
- * @tsplus fluent fncts.SortedMap getLt
+ * @tsplus pipeable fncts.SortedMap getLt
  */
-
-
-function getLt_(m, key) {
-  const cmp = m.ord.compare;
-  let n = m.root;
-  let lastValue = tsplus_module_1.nothing();
-
-  while (n) {
-    const d = cmp(key, n.key);
-
-    if (d > 0) {
-      lastValue = tsplus_module_1.just(n.value);
-    }
-
-    if (d <= 0) {
-      n = n.left;
-    } else {
-      n = n.right;
+function getLt(key) {
+  return self => {
+    const cmp = self.ord.compare;
+    let n = self.root;
+    let lastValue = tsplus_module_1.nothing();
+    while (n) {
+      const d = cmp(n.key)(key);
+      if (d > 0) {
+        lastValue = tsplus_module_1.just(n.value);
+      }
+      if (d <= 0) {
+        n = n.left;
+      } else {
+        n = n.right;
+      }
     }
-  }
-
-  return lastValue;
+    return lastValue;
+  };
 }
 /**
  * Searches the map and returns the first value in sorted order that is <= key, if it exists
  *
- * @tsplus fluent fncts.SortedMap getLte
+ * @tsplus pipeable fncts.SortedMap getLte
  */
-
-
-function getLte_(m, key) {
-  const cmp = m.ord.compare;
-  let n = m.root;
-  let lastValue = tsplus_module_1.nothing();
-
-  while (n) {
-    const d = cmp(key, n.key);
-
-    if (d > 0) {
-      if (tsplus_module_2.isJust(lastValue)) {
-        break;
+function getLte(key) {
+  return self => {
+    const cmp = self.ord.compare;
+    let n = self.root;
+    let lastValue = tsplus_module_1.nothing();
+    while (n) {
+      const d = cmp(n.key)(key);
+      if (d > 0) {
+        if (tsplus_module_2.isJust(lastValue)) {
+          break;
+        }
+        n = n.right;
+      } else {
+        lastValue = tsplus_module_1.just(n.value);
+        n = n.left;
       }
-
-      n = n.right;
-    } else {
-      lastValue = tsplus_module_1.just(n.value);
-      n = n.left;
     }
-  }
-
-  return lastValue;
+    return lastValue;
+  };
 }
 /**
  * Searches the map and returns the first value in sorted order that is >= key, if it exists
  *
- * @tsplus fluent fncts.SortedMap getGte
+ * @tsplus pipeable fncts.SortedMap getGte
  */
-
-
-function getGte_(m, key) {
-  const cmp = m.ord.compare;
-  let n = m.root;
-  let lastValue = tsplus_module_1.nothing();
-
-  while (n) {
-    const d = cmp(key, n.key);
-
-    if (d <= 0) {
-      lastValue = tsplus_module_1.just(n.value);
-      n = n.left;
-    } else {
-      if (tsplus_module_2.isJust(lastValue)) {
-        break;
+function getGte(key) {
+  return self => {
+    const cmp = self.ord.compare;
+    let n = self.root;
+    let lastValue = tsplus_module_1.nothing();
+    while (n) {
+      const d = cmp(n.key)(key);
+      if (d <= 0) {
+        lastValue = tsplus_module_1.just(n.value);
+        n = n.left;
+      } else {
+        if (tsplus_module_2.isJust(lastValue)) {
+          break;
+        }
+        n = n.right;
       }
-
-      n = n.right;
     }
-  }
-
-  return lastValue;
+    return lastValue;
+  };
 }
 /**
  * Inserts an element into the correct position in the map.
  * This function inserts duplicate keys. For one that combines duplicate key's values,
- * see `insertWith_`
+ * see `insertWith`
  *
- * @tsplus fluent fncts.SortedMap insert
+ * @tsplus pipeable fncts.SortedMap set
  */
-
-
-function insert_(m, key, value) {
-  if ((0, _internal.isEmptyNode)(m.root)) {
-    return new _definition2.SortedMap(m.ord, new _node.Node(0
-    /* Color.R */
-    , _node.Leaf, key, value, _node.Leaf, 1));
-  }
-
-  const cmp = m.ord.compare;
-  const nodeStack = [];
-  const orderStack = [];
-  let n = m.root;
-
-  while (n) {
-    const d = cmp(key, n.key);
-    nodeStack.push(n);
-    orderStack.push(d);
-
-    if (d <= 0) {
-      n = n.left;
-    } else {
-      n = n.right;
+function set(key, value) {
+  return self => {
+    if ((0, _internal.isEmptyNode)(self.root)) {
+      return new _definition2.SortedMap(self.ord, new _node.Node(0 /* Color.R */, _node.Leaf, key, value, _node.Leaf, 1));
     }
-  }
-
-  nodeStack.push(new _node.Node(0
-  /* Color.R */
-  , _node.Leaf, key, value, _node.Leaf, 1));
-  (0, _internal.rebuildModifiedPath)(nodeStack, orderStack);
-  (0, _internal.balanceModifiedPath)(nodeStack);
-  return new _definition2.SortedMap(m.ord, nodeStack[0]);
+    const cmp = self.ord.compare;
+    const nodeStack = [];
+    const orderStack = [];
+    let n = self.root;
+    while (n) {
+      const d = cmp(n.key)(key);
+      nodeStack.push(n);
+      orderStack.push(d);
+      if (d <= 0) {
+        n = n.left;
+      } else {
+        n = n.right;
+      }
+    }
+    nodeStack.push(new _node.Node(0 /* Color.R */, _node.Leaf, key, value, _node.Leaf, 1));
+    (0, _internal.rebuildModifiedPath)(nodeStack, orderStack);
+    (0, _internal.balanceModifiedPath)(nodeStack);
+    return new _definition2.SortedMap(self.ord, nodeStack[0]);
+  };
 }
 /**
  * Inserts an element into the correct position in the map, combining the values of keys of equal ordering
  * with a `Semigroup` instance
+ *
+ * @tsplus pipeable fncts.SortedMap setWith
  */
-
-
-function insertWith_(m, key, value,
-/** @tsplus auto */
-S) {
-  if ((0, _internal.isEmptyNode)(m.root)) {
-    return new _definition2.SortedMap(m.ord, new _node.Node(0
-    /* Color.R */
-    , _node.Leaf, key, value, _node.Leaf, 1));
-  }
-
-  const com = S.combine;
-  const cmp = m.ord.compare;
-  const nodeStack = [];
-  const orderStack = [];
-  let n = m.root;
-  let cv = null;
-
-  while (n && !cv) {
-    const d = cmp(key, n.key);
-    nodeStack.push(n);
-
-    switch (d) {
-      case -1:
-        {
-          orderStack.push(d);
-          n = n.left;
-          break;
-        }
-
-      case 1:
-        {
-          orderStack.push(d);
-          n = n.right;
-          break;
-        }
-
-      case 0:
-        {
-          cv = com(n.value, value);
-          break;
-        }
+function setWith(key, value, /** @tsplus auto */S) {
+  return self => {
+    if ((0, _internal.isEmptyNode)(self.root)) {
+      return new _definition2.SortedMap(self.ord, new _node.Node(0 /* Color.R */, _node.Leaf, key, value, _node.Leaf, 1));
     }
-  }
-
-  if (cv) {
-    const u = nodeStack[nodeStack.length - 1];
-    const updated = new _node.Node(u.color, u.left, u.key, cv, u.right, u.count);
-    nodeStack[nodeStack.length - 1] = updated;
-    (0, _internal.rebuildModifiedPath)(nodeStack, orderStack, 0);
-  } else {
-    nodeStack.push(new _node.Node(0
-    /* Color.R */
-    , _node.Leaf, key, value, _node.Leaf, 1));
-    (0, _internal.rebuildModifiedPath)(nodeStack, orderStack);
-    (0, _internal.balanceModifiedPath)(nodeStack);
-  }
-
-  return new _definition2.SortedMap(m.ord, nodeStack[0]);
+    const com = S.combine;
+    const cmp = self.ord.compare;
+    const nodeStack = [];
+    const orderStack = [];
+    let n = self.root;
+    let cv = null;
+    while (n && !cv) {
+      const d = cmp(n.key)(key);
+      nodeStack.push(n);
+      switch (d) {
+        case -1:
+          {
+            orderStack.push(d);
+            n = n.left;
+            break;
+          }
+        case 1:
+          {
+            orderStack.push(d);
+            n = n.right;
+            break;
+          }
+        case 0:
+          {
+            cv = com(value)(n.value);
+            break;
+          }
+      }
+    }
+    if (cv) {
+      const u = nodeStack[nodeStack.length - 1];
+      const updated = new _node.Node(u.color, u.left, u.key, cv, u.right, u.count);
+      nodeStack[nodeStack.length - 1] = updated;
+      (0, _internal.rebuildModifiedPath)(nodeStack, orderStack, 0);
+    } else {
+      nodeStack.push(new _node.Node(0 /* Color.R */, _node.Leaf, key, value, _node.Leaf, 1));
+      (0, _internal.rebuildModifiedPath)(nodeStack, orderStack);
+      (0, _internal.balanceModifiedPath)(nodeStack);
+    }
+    return new _definition2.SortedMap(self.ord, nodeStack[0]);
+  };
 }
 /**
  * @tsplus getter fncts.SortedMap isEmpty
  */
-
-
-function isEmpty(m) {
-  return m.root === _node.Leaf;
+function isEmpty(self) {
+  return self.root === _node.Leaf;
 }
 /**
  * @tsplus getter fncts.SortedMap isNonEmpty
  */
-
-
-function isNonEmpty(m) {
-  return m.root !== _node.Leaf;
+function isNonEmpty(self) {
+  return self.root !== _node.Leaf;
 }
 /**
  * @tsplus static fncts.SortedMapOps make
  */
-
-
-function make(ord) {
+function make( /** @tsplus auto */ord) {
   return new _definition2.SortedMap(ord, null);
 }
 /**
  * Removes an element from the map
  *
- * @tsplus fluent fncts.SortedMap remove
- */
-
-
-function remove_(m, key) {
-  const iter = find_1(m, key)[Symbol.iterator]();
-  return iter.isEmpty ? m : iter.remove();
-}
-/**
- * @tsplus fluent fncts.SortedMap visitFull
+ * @tsplus pipeable fncts.SortedMap remove
  */
-
-
-function visitFull_1(m, visit) {
-  let current = m.root;
-  const stack = tsplus_module_3.mkStack();
-  let done = false;
-
-  while (!done) {
-    if (current) {
-      stack.push(current);
-      current = current.left;
-    } else if (stack.hasNext) {
-      const value = stack.pop();
-      const v = visit(value.key, value.value);
-
-      if (tsplus_module_2.isJust(v)) {
-        return v;
-      }
-
-      current = value.right;
-    } else {
-      done = true;
-    }
-  }
-
-  return tsplus_module_1.nothing();
+function remove(key) {
+  return self => {
+    const iter = find_1(key)(self)[Symbol.iterator]();
+    return iter.isEmpty ? self : iter.remove();
+  };
 }
 /**
- * @tsplus fluent fncts.SortedMap visitLte
+ * @tsplus pipeable fncts.SortedMap visitFull
  */
-
-
-function visitLte_1(m, max, visit) {
-  let current = m.root;
-  const stack = tsplus_module_3.mkStack();
-  let done = false;
-  const cmp = m.ord.compare;
-
-  while (!done) {
-    if (current) {
-      stack.push(current);
-      current = current.left;
-    } else if (stack.hasNext) {
-      const next = stack.pop();
-
-      if (cmp(next.key, max) > 0) {
-        break;
-      }
-
-      const v = visit(next.key, next.value);
-
-      if (tsplus_module_2.isJust(v)) {
-        return v;
+function visitFull_1(visit) {
+  return self => {
+    let current = self.root;
+    const stack = tsplus_module_3.makeStack();
+    let done = false;
+    while (!done) {
+      if (current) {
+        stack.push(current);
+        current = current.left;
+      } else if (stack.hasNext) {
+        const value = stack.pop();
+        const v = visit(value.key, value.value);
+        if (tsplus_module_2.isJust(v)) {
+          return v;
+        }
+        current = value.right;
+      } else {
+        done = true;
       }
-
-      current = next.right;
-    } else {
-      done = true;
     }
-  }
-
-  return tsplus_module_1.nothing();
+    return tsplus_module_1.nothing();
+  };
 }
 /**
- * @tsplus fluent fncts.SortedMap visitLt
+ * @tsplus pipeable fncts.SortedMap visitLte
  */
-
-
-function visitLt_1(m, max, visit) {
-  let current = m.root;
-  const stack = tsplus_module_3.mkStack();
-  let done = false;
-  const cmp = m.ord.compare;
-
-  while (!done) {
-    if (current) {
-      stack.push(current);
-      current = current.left;
-    } else if (stack.hasNext) {
-      const next = stack.pop();
-
-      if (cmp(next.key, max) >= 0) {
-        break;
-      }
-
-      const v = visit(next.key, next.value);
-
-      if (tsplus_module_2.isJust(v)) {
-        return v;
+function visitLte_1(max, visit) {
+  return self => {
+    let current = self.root;
+    const stack = tsplus_module_3.makeStack();
+    let done = false;
+    const cmp = self.ord.compare;
+    while (!done) {
+      if (current) {
+        stack.push(current);
+        current = current.left;
+      } else if (stack.hasNext) {
+        const next = stack.pop();
+        if (cmp(max)(next.key) > 0) {
+          break;
+        }
+        const v = visit(next.key, next.value);
+        if (tsplus_module_2.isJust(v)) {
+          return v;
+        }
+        current = next.right;
+      } else {
+        done = true;
       }
-
-      current = next.right;
-    } else {
-      done = true;
     }
-  }
-
-  return tsplus_module_1.nothing();
+    return tsplus_module_1.nothing();
+  };
 }
 /**
- * @tsplus fluent fncts.SortedMap visitGte
+ * @tsplus pipeable fncts.SortedMap visitLt
  */
-
-
-function visitGte_1(m, min, visit) {
-  let current = m.root;
-  const stack = tsplus_module_3.mkStack();
-  let done = false;
-  const cmp = m.ord.compare;
-
-  while (!done) {
-    if (current) {
-      stack.push(current);
-
-      if (cmp(current.key, min) >= 0) {
+function visitLt_1(max, visit) {
+  return self => {
+    let current = self.root;
+    const stack = tsplus_module_3.makeStack();
+    let done = false;
+    const cmp = self.ord.compare;
+    while (!done) {
+      if (current) {
+        stack.push(current);
         current = current.left;
-      } else {
-        current = null;
-      }
-    } else if (stack.hasNext) {
-      const next = stack.pop();
-
-      if (cmp(next.key, min) >= 0) {
+      } else if (stack.hasNext) {
+        const next = stack.pop();
+        if (cmp(max)(next.key) >= 0) {
+          break;
+        }
         const v = visit(next.key, next.value);
-
         if (tsplus_module_2.isJust(v)) {
           return v;
         }
+        current = next.right;
+      } else {
+        done = true;
       }
-
-      current = next.right;
-    } else {
-      done = true;
     }
-  }
-
-  return tsplus_module_1.nothing();
+    return tsplus_module_1.nothing();
+  };
 }
 /**
- * @tsplus fluent fncts.SortedMap visitGt
+ * @tsplus pipeable fncts.SortedMap visitGte
  */
-
-
-function visitGt_1(m, min, visit) {
-  let current = m.root;
-  const stack = tsplus_module_3.mkStack();
-  let done = false;
-  const cmp = m.ord.compare;
-
-  while (!done) {
-    if (current) {
-      stack.push(current);
-
-      if (cmp(current.key, min) > 0) {
-        current = current.left;
+function visitGte_1(min, visit) {
+  return self => {
+    let current = self.root;
+    const stack = tsplus_module_3.makeStack();
+    let done = false;
+    const cmp = self.ord.compare;
+    while (!done) {
+      if (current) {
+        stack.push(current);
+        if (cmp(min)(current.key) >= 0) {
+          current = current.left;
+        } else {
+          current = null;
+        }
+      } else if (stack.hasNext) {
+        const next = stack.pop();
+        if (cmp(min)(next.key) >= 0) {
+          const v = visit(next.key, next.value);
+          if (tsplus_module_2.isJust(v)) {
+            return v;
+          }
+        }
+        current = next.right;
       } else {
-        current = null;
+        done = true;
       }
-    } else if (stack.hasNext) {
-      const next = stack.pop();
-
-      if (cmp(next.key, min) > 0) {
-        const v = visit(next.key, next.value);
-
-        if (tsplus_module_2.isJust(v)) {
-          return v;
+    }
+    return tsplus_module_1.nothing();
+  };
+}
+/**
+ * @tsplus pipeable fncts.SortedMap visitGt
+ */
+function visitGt_1(min, visit) {
+  return self => {
+    let current = self.root;
+    const stack = tsplus_module_3.makeStack();
+    let done = false;
+    const cmp = self.ord.compare;
+    while (!done) {
+      if (current) {
+        stack.push(current);
+        if (cmp(min)(current.key) > 0) {
+          current = current.left;
+        } else {
+          current = null;
         }
+      } else if (stack.hasNext) {
+        const next = stack.pop();
+        if (cmp(min)(next.key) > 0) {
+          const v = visit(next.key, next.value);
+          if (tsplus_module_2.isJust(v)) {
+            return v;
+          }
+        }
+        current = next.right;
+      } else {
+        done = true;
       }
-
-      current = next.right;
-    } else {
-      done = true;
     }
-  }
-
-  return tsplus_module_1.nothing();
+    return tsplus_module_1.nothing();
+  };
 }
 /**
- * @tsplus fluent fncts.SortedMap visitBetween
+ * @tsplus pipeable fncts.SortedMap visitBetween
  */
-
-
-function visitBetween_1(m, min, max, visit) {
-  let current = m.root;
-  const stack = tsplus_module_3.mkStack();
-  let done = false;
-  const cmp = m.ord.compare;
-
-  while (!done) {
-    if (current) {
-      stack.push(current);
-
-      if (cmp(current.key, min) > 0) {
-        current = current.left;
+function visitBetween_1(min, max, visit) {
+  return self => {
+    let current = self.root;
+    const stack = tsplus_module_3.makeStack();
+    let done = false;
+    const cmp = self.ord.compare;
+    while (!done) {
+      if (current) {
+        stack.push(current);
+        if (cmp(min)(current.key) > 0) {
+          current = current.left;
+        } else {
+          current = null;
+        }
+      } else if (stack.hasNext) {
+        const next = stack.pop();
+        if (cmp(max)(next.key) >= 0) {
+          break;
+        }
+        const v = visit(next.key, next.value);
+        if (tsplus_module_2.isJust(v)) {
+          return v;
+        }
+        current = next.right;
       } else {
-        current = null;
-      }
-    } else if (stack.hasNext) {
-      const next = stack.pop();
-
-      if (cmp(next.key, max) >= 0) {
-        break;
+        done = true;
       }
-
-      const v = visit(next.key, next.value);
-
-      if (tsplus_module_2.isJust(v)) {
-        return v;
-      }
-
-      current = next.right;
-    } else {
-      done = true;
     }
-  }
-
-  return tsplus_module_1.nothing();
+    return tsplus_module_1.nothing();
+  };
 }
 //# sourceMappingURL=api.cjs.map