@fncts/base 0.0.21 → 0.0.22

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

@@ -15,32 +15,22 @@ exports.getGt = getGt;
 exports.getGte = getGte;
 exports.getLt = getLt;
 exports.getLte = getLte;
-exports.insert = insert;
-exports.insertWith = insertWith;
 exports.isEmpty = isEmpty;
 exports.isNonEmpty = isNonEmpty;
 exports.make = make;
 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 visitFull = visitFull_1;
@@ -55,7 +45,6 @@ const visitGt = visitGt_1;
 exports.visitGt = visitGt;
 const visitBetween = visitBetween_1;
 exports.visitBetween = visitBetween;
-
 /**
  * @tsplus pipeable fncts.SortedMap find
  */
@@ -63,28 +52,23 @@ 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(key, n.key);
+          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;
@@ -92,10 +76,8 @@ function find_1(key, direction = 0) {
               }
           }
         }
-
         return new _iterator.SortedMapIterator(m, [], direction);
       }
-
     };
   };
 }
@@ -104,90 +86,78 @@ function find_1(key, direction = 0) {
  *
  * @tsplus pipeable fncts.SortedMap forEach
  */
-
-
 function forEach(visit) {
-  return m => {
-    if (m.root) {
+  return self => {
+    if (self.root) {
       visitFull_1((k, v) => {
         visit(k, v);
         return tsplus_module_1.nothing();
-      })(m);
+      })(self);
     }
   };
 }
 /**
  * @tsplus pipeable fncts.SortedMap forEachBetween
  */
-
-
 function forEachBetween(min, max, visit) {
-  return m => {
-    if (m.root) {
+  return self => {
+    if (self.root) {
       visitBetween_1(min, max, (k, v) => {
         visit(k, v);
         return tsplus_module_1.nothing();
-      })(m);
+      })(self);
     }
   };
 }
 /**
  * @tsplus pipeable fncts.SortedMap forEachLte
  */
-
-
 function forEachLte(max, visit) {
-  return m => {
-    if (m.root) {
+  return self => {
+    if (self.root) {
       visitLte_1(max, (k, v) => {
         visit(k, v);
         return tsplus_module_1.nothing();
-      })(m);
+      })(self);
     }
   };
 }
 /**
  * @tsplus pipeable fncts.SortedMap forEachLt
  */
-
-
 function forEachLt(max, visit) {
-  return m => {
-    if (m.root) {
+  return self => {
+    if (self.root) {
       visitLt_1(max, (k, v) => {
         visit(k, v);
         return tsplus_module_1.nothing();
-      })(m);
+      })(self);
     }
   };
 }
 /**
  * @tsplus pipeable fncts.SortedMap forEachGte
  */
-
-
 function forEachGte(min, visit) {
-  return m => {
-    if (m.root) {
+  return self => {
+    if (self.root) {
       visitGte_1(min, (k, v) => {
         visit(k, v);
         return tsplus_module_1.nothing();
-      })(m);
+      })(self);
     }
   };
 }
 /**
  * @tsplus pipeable fncts.SortedMap forEachGt
  */
-
-
 function forEachGt(min, visit) {
-  return m => {
-    if (m.root) {
+  return self => {
+    if (self.root) {
       visitGt_1(min, (k, v) => {
         visit(k, v);
         return tsplus_module_1.nothing();
-      })(m);
+      })(self);
     }
   };
 }
@@ -196,28 +166,22 @@ function forEachGt(min, visit) {
  *
  * @tsplus pipeable fncts.SortedMap get
  */
-
-
 function get(key) {
-  return m => {
-    const cmp = m.ord.compare;
-    let n = m.root;
-
+  return self => {
+    const cmp = self.ord.compare;
+    let n = self.root;
     while (n) {
-      const d = cmp(key, n.key);
-
+      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;
@@ -225,7 +189,6 @@ function get(key) {
           }
       }
     }
-
     return tsplus_module_1.nothing();
   };
 }
@@ -234,17 +197,13 @@ function get(key) {
  *
  * @tsplus pipeable fncts.SortedMap getGt
  */
-
-
 function getGt(key) {
-  return m => {
-    const cmp = m.ord.compare;
-    let n = m.root;
+  return self => {
+    const cmp = self.ord.compare;
+    let n = self.root;
     let lastValue = tsplus_module_1.nothing();
-
     while (n) {
-      const d = cmp(key, n.key);
-
+      const d = cmp(n.key)(key);
       if (d < 0) {
         lastValue = tsplus_module_1.just(n.value);
         n = n.left;
@@ -252,11 +211,9 @@ function getGt(key) {
         if (tsplus_module_2.isJust(lastValue)) {
           break;
         }
-
         n = n.right;
       }
     }
-
     return lastValue;
   };
 }
@@ -265,28 +222,22 @@ function getGt(key) {
  *
  * @tsplus pipeable fncts.SortedMap getLt
  */
-
-
 function getLt(key) {
-  return m => {
-    const cmp = m.ord.compare;
-    let n = m.root;
+  return self => {
+    const cmp = self.ord.compare;
+    let n = self.root;
     let lastValue = tsplus_module_1.nothing();
-
     while (n) {
-      const d = cmp(key, n.key);
-
+      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;
   };
 }
@@ -295,29 +246,23 @@ function getLt(key) {
  *
  * @tsplus pipeable fncts.SortedMap getLte
  */
-
-
 function getLte(key) {
-  return m => {
-    const cmp = m.ord.compare;
-    let n = m.root;
+  return self => {
+    const cmp = self.ord.compare;
+    let n = self.root;
     let lastValue = tsplus_module_1.nothing();
-
     while (n) {
-      const d = cmp(key, n.key);
-
+      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;
       }
     }
-
     return lastValue;
   };
 }
@@ -326,17 +271,13 @@ function getLte(key) {
  *
  * @tsplus pipeable fncts.SortedMap getGte
  */
-
-
 function getGte(key) {
-  return m => {
-    const cmp = m.ord.compare;
-    let n = m.root;
+  return self => {
+    const cmp = self.ord.compare;
+    let n = self.root;
     let lastValue = tsplus_module_1.nothing();
-
     while (n) {
-      const d = cmp(key, n.key);
-
+      const d = cmp(n.key)(key);
       if (d <= 0) {
         lastValue = tsplus_module_1.just(n.value);
         n = n.left;
@@ -344,142 +285,113 @@ function getGte(key) {
         if (tsplus_module_2.isJust(lastValue)) {
           break;
         }
-
         n = n.right;
       }
     }
-
     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 pipeable fncts.SortedMap insert
+ * @tsplus pipeable fncts.SortedMap set
  */
-
-
-function insert(key, value) {
-  return m => {
-    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));
+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));
     }
-
-    const cmp = m.ord.compare;
+    const cmp = self.ord.compare;
     const nodeStack = [];
     const orderStack = [];
-    let n = m.root;
-
+    let n = self.root;
     while (n) {
-      const d = cmp(key, n.key);
+      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));
+    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]);
+    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);
 }
 /**
@@ -487,25 +399,20 @@ function make(ord) {
  *
  * @tsplus pipeable fncts.SortedMap remove
  */
-
-
 function remove(key) {
-  return m => {
-    const iter = find_1(key)(m)[Symbol.iterator]();
-    return iter.isEmpty ? m : iter.remove();
+  return self => {
+    const iter = find_1(key)(self)[Symbol.iterator]();
+    return iter.isEmpty ? self : iter.remove();
   };
 }
 /**
  * @tsplus pipeable fncts.SortedMap visitFull
  */
-
-
 function visitFull_1(visit) {
-  return m => {
-    let current = m.root;
+  return self => {
+    let current = self.root;
     const stack = tsplus_module_3.makeStack();
     let done = false;
-
     while (!done) {
       if (current) {
         stack.push(current);
@@ -513,218 +420,174 @@ function visitFull_1(visit) {
       } 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();
   };
 }
 /**
  * @tsplus pipeable fncts.SortedMap visitLte
  */
-
-
 function visitLte_1(max, visit) {
-  return m => {
-    let current = m.root;
+  return self => {
+    let current = self.root;
     const stack = tsplus_module_3.makeStack();
     let done = false;
-    const cmp = m.ord.compare;
-
+    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(next.key, max) > 0) {
+        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;
       }
     }
-
     return tsplus_module_1.nothing();
   };
 }
 /**
  * @tsplus pipeable fncts.SortedMap visitLt
  */
-
-
 function visitLt_1(max, visit) {
-  return m => {
-    let current = m.root;
+  return self => {
+    let current = self.root;
     const stack = tsplus_module_3.makeStack();
     let done = false;
-    const cmp = m.ord.compare;
-
+    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(next.key, max) >= 0) {
+        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;
       }
     }
-
     return tsplus_module_1.nothing();
   };
 }
 /**
  * @tsplus pipeable fncts.SortedMap visitGte
  */
-
-
 function visitGte_1(min, visit) {
-  return m => {
-    let current = m.root;
+  return self => {
+    let current = self.root;
     const stack = tsplus_module_3.makeStack();
     let done = false;
-    const cmp = m.ord.compare;
-
+    const cmp = self.ord.compare;
     while (!done) {
       if (current) {
         stack.push(current);
-
-        if (cmp(current.key, min) >= 0) {
+        if (cmp(min)(current.key) >= 0) {
           current = current.left;
         } else {
           current = null;
         }
       } else if (stack.hasNext) {
         const next = stack.pop();
-
-        if (cmp(next.key, min) >= 0) {
+        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;
       }
     }
-
     return tsplus_module_1.nothing();
   };
 }
 /**
  * @tsplus pipeable fncts.SortedMap visitGt
  */
-
-
 function visitGt_1(min, visit) {
-  return m => {
-    let current = m.root;
+  return self => {
+    let current = self.root;
     const stack = tsplus_module_3.makeStack();
     let done = false;
-    const cmp = m.ord.compare;
-
+    const cmp = self.ord.compare;
     while (!done) {
       if (current) {
         stack.push(current);
-
-        if (cmp(current.key, min) > 0) {
+        if (cmp(min)(current.key) > 0) {
           current = current.left;
         } else {
           current = null;
         }
       } else if (stack.hasNext) {
         const next = stack.pop();
-
-        if (cmp(next.key, min) > 0) {
+        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;
       }
     }
-
     return tsplus_module_1.nothing();
   };
 }
 /**
  * @tsplus pipeable fncts.SortedMap visitBetween
  */
-
-
 function visitBetween_1(min, max, visit) {
-  return m => {
-    let current = m.root;
+  return self => {
+    let current = self.root;
     const stack = tsplus_module_3.makeStack();
     let done = false;
-    const cmp = m.ord.compare;
-
+    const cmp = self.ord.compare;
     while (!done) {
       if (current) {
         stack.push(current);
-
-        if (cmp(current.key, min) > 0) {
+        if (cmp(min)(current.key) > 0) {
           current = current.left;
         } else {
           current = null;
         }
       } else if (stack.hasNext) {
         const next = stack.pop();
-
-        if (cmp(next.key, max) >= 0) {
+        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;
       }
     }
-
     return tsplus_module_1.nothing();
   };
 }