@fncts/base 0.0.21 → 0.0.22

package/_mjs/collection/immutable/SortedMap/api.mjs

@@ -16,33 +16,27 @@ import { Stack } from "@fncts/base/internal/Stack";
 /**
  * @tsplus pipeable fncts.SortedMap find
  */
-
 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 SortedMapIterator(m, stack, direction);
               }
-
             case -1:
               {
                 n = n.left;
                 break;
               }
-
             case 1:
               {
                 n = n.right;
@@ -50,10 +44,8 @@ function find_1(key, direction = 0) {
               }
           }
         }
-
         return new SortedMapIterator(m, [], direction);
       }
-
     };
   };
 }
@@ -62,85 +54,78 @@ function find_1(key, direction = 0) {
  *
  * @tsplus pipeable fncts.SortedMap forEach
  */
-
-
 export 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
  */
-
 export 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
  */
-
 export 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
  */
-
 export 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
  */
-
 export 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
  */
-
 export 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);
     }
   };
 }
@@ -149,27 +134,22 @@ export function forEachGt(min, visit) {
  *
  * @tsplus pipeable fncts.SortedMap get
  */
-
 export 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;
@@ -177,7 +157,6 @@ export function get(key) {
           }
       }
     }
-
     return tsplus_module_1.nothing();
   };
 }
@@ -186,16 +165,13 @@ export function get(key) {
  *
  * @tsplus pipeable fncts.SortedMap getGt
  */
-
 export 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;
@@ -203,11 +179,9 @@ export function getGt(key) {
         if (tsplus_module_2.isJust(lastValue)) {
           break;
         }
-
         n = n.right;
       }
     }
-
     return lastValue;
   };
 }
@@ -216,27 +190,22 @@ export function getGt(key) {
  *
  * @tsplus pipeable fncts.SortedMap getLt
  */
-
 export 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;
   };
 }
@@ -245,28 +214,23 @@ export function getLt(key) {
  *
  * @tsplus pipeable fncts.SortedMap getLte
  */
-
 export 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;
   };
 }
@@ -275,16 +239,13 @@ export function getLte(key) {
  *
  * @tsplus pipeable fncts.SortedMap getGte
  */
-
 export 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;
@@ -292,137 +253,113 @@ export 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
  */
-
-export function insert(key, value) {
-  return m => {
-    if (isEmptyNode(m.root)) {
-      return new SortedMap(m.ord, new Node(0
-      /* Color.R */
-      , Leaf, key, value, Leaf, 1));
+export function set(key, value) {
+  return self => {
+    if (isEmptyNode(self.root)) {
+      return new SortedMap(self.ord, new Node(0 /* Color.R */, Leaf, key, value, 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(0
-    /* Color.R */
-    , Leaf, key, value, Leaf, 1));
+    nodeStack.push(new Node(0 /* Color.R */, Leaf, key, value, Leaf, 1));
     rebuildModifiedPath(nodeStack, orderStack);
     balanceModifiedPath(nodeStack);
-    return new SortedMap(m.ord, nodeStack[0]);
+    return new 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
  */
-
-export function insertWith(m, key, value,
-/** @tsplus auto */
-S) {
-  if (isEmptyNode(m.root)) {
-    return new SortedMap(m.ord, new Node(0
-    /* Color.R */
-    , Leaf, key, value, 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;
-        }
+export function setWith(key, value, /** @tsplus auto */S) {
+  return self => {
+    if (isEmptyNode(self.root)) {
+      return new SortedMap(self.ord, new Node(0 /* Color.R */, Leaf, key, value, Leaf, 1));
     }
-  }
-
-  if (cv) {
-    const u = nodeStack[nodeStack.length - 1];
-    const updated = new Node(u.color, u.left, u.key, cv, u.right, u.count);
-    nodeStack[nodeStack.length - 1] = updated;
-    rebuildModifiedPath(nodeStack, orderStack, 0);
-  } else {
-    nodeStack.push(new Node(0
-    /* Color.R */
-    , Leaf, key, value, Leaf, 1));
-    rebuildModifiedPath(nodeStack, orderStack);
-    balanceModifiedPath(nodeStack);
-  }
-
-  return new 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(u.color, u.left, u.key, cv, u.right, u.count);
+      nodeStack[nodeStack.length - 1] = updated;
+      rebuildModifiedPath(nodeStack, orderStack, 0);
+    } else {
+      nodeStack.push(new Node(0 /* Color.R */, Leaf, key, value, Leaf, 1));
+      rebuildModifiedPath(nodeStack, orderStack);
+      balanceModifiedPath(nodeStack);
+    }
+    return new SortedMap(self.ord, nodeStack[0]);
+  };
 }
 /**
  * @tsplus getter fncts.SortedMap isEmpty
  */
-
-export function isEmpty(m) {
-  return m.root === Leaf;
+export function isEmpty(self) {
+  return self.root === Leaf;
 }
 /**
  * @tsplus getter fncts.SortedMap isNonEmpty
  */
-
-export function isNonEmpty(m) {
-  return m.root !== Leaf;
+export function isNonEmpty(self) {
+  return self.root !== Leaf;
 }
 /**
  * @tsplus static fncts.SortedMapOps make
  */
-
-export function make(ord) {
+export function make( /** @tsplus auto */ord) {
   return new SortedMap(ord, null);
 }
 /**
@@ -430,23 +367,20 @@ export function make(ord) {
  *
  * @tsplus pipeable fncts.SortedMap remove
  */
-
 export 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);
@@ -454,218 +388,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();
   };
 }