@fncts/base 0.0.1

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

@@ -0,0 +1,631 @@
+import * as tsplus_module_1 from "@fncts/base/data/Maybe/constructors";
+import * as tsplus_module_2 from "@fncts/base/data/Maybe/definition";
+import * as tsplus_module_3 from "@fncts/base/internal/Stack";
+export const find_ = find_1;
+export const visitFull = visitFull_1;
+export const visitLte = visitLte_1;
+export const visitLt = visitLt_1;
+export const visitGte = visitGte_1;
+export const visitGt = visitGt_1;
+export const visitBetween = visitBetween_1;
+import { SortedMap } from "@fncts/base/collection/immutable/SortedMap/definition";
+import { balanceModifiedPath, isEmptyNode, rebuildModifiedPath } from "@fncts/base/collection/immutable/SortedMap/internal";
+import { SortedMapIterator } from "@fncts/base/collection/immutable/SortedMap/iterator";
+import { Leaf, Node } from "@fncts/base/collection/immutable/SortedMap/node";
+/**
+ * @tsplus fluent 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 SortedMapIterator(m, stack, direction);
+            }
+
+          case -1:
+            {
+              n = n.left;
+              break;
+            }
+
+          case 1:
+            {
+              n = n.right;
+              break;
+            }
+        }
+      }
+
+      return new SortedMapIterator(m, [], direction);
+    }
+
+  };
+}
+/**
+ * Iterates through the elements of the map inorder, performing the given function for each element
+ *
+ * @tsplus fluent fncts.SortedMap forEach
+ */
+
+
+export function forEach_(m, visit) {
+  if (m.root) {
+    visitFull_1(m, (k, v) => {
+      visit(k, v);
+      return tsplus_module_1.nothing();
+    });
+  }
+}
+/**
+ * @tsplus fluent fncts.SortedMap forEachBetween
+ */
+
+export function forEachBetween_(m, min, max, visit) {
+  if (m.root) {
+    visitBetween_1(m, min, max, (k, v) => {
+      visit(k, v);
+      return tsplus_module_1.nothing();
+    });
+  }
+}
+/**
+ * @tsplus fluent fncts.SortedMap forEachLte
+ */
+
+export function forEachLte_(m, max, visit) {
+  if (m.root) {
+    visitLte_1(m, max, (k, v) => {
+      visit(k, v);
+      return tsplus_module_1.nothing();
+    });
+  }
+}
+/**
+ * @tsplus fluent fncts.SortedMap forEachLt
+ */
+
+export function forEachLt_(m, max, visit) {
+  if (m.root) {
+    visitLt_1(m, max, (k, v) => {
+      visit(k, v);
+      return tsplus_module_1.nothing();
+    });
+  }
+}
+/**
+ * @tsplus fluent fncts.SortedMap forEachGte
+ */
+
+export function forEachGte_(m, min, visit) {
+  if (m.root) {
+    visitGte_1(m, min, (k, v) => {
+      visit(k, v);
+      return tsplus_module_1.nothing();
+    });
+  }
+}
+/**
+ * @tsplus fluent fncts.SortedMap forEachGt
+ */
+
+export function forEachGt_(m, min, visit) {
+  if (m.root) {
+    visitGt_1(m, min, (k, v) => {
+      visit(k, v);
+      return tsplus_module_1.nothing();
+    });
+  }
+}
+/**
+ * Searches the map for a given key, returning it's value, if it exists
+ *
+ * @tsplus fluent fncts.SortedMap get
+ */
+
+export 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;
+        }
+    }
+  }
+
+  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
+ */
+
+export 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;
+      }
+
+      n = n.right;
+    }
+  }
+
+  return lastValue;
+}
+/**
+ * Searches the map and returns the first value in sorted order that is < key, if it exists
+ *
+ * @tsplus fluent fncts.SortedMap getLt
+ */
+
+export 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;
+    }
+  }
+
+  return lastValue;
+}
+/**
+ * Searches the map and returns the first value in sorted order that is <= key, if it exists
+ *
+ * @tsplus fluent fncts.SortedMap getLte
+ */
+
+export 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;
+      }
+
+      n = n.right;
+    } else {
+      lastValue = tsplus_module_1.just(n.value);
+      n = n.left;
+    }
+  }
+
+  return lastValue;
+}
+/**
+ * Searches the map and returns the first value in sorted order that is >= key, if it exists
+ *
+ * @tsplus fluent fncts.SortedMap getGte
+ */
+
+export 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;
+      }
+
+      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_`
+ *
+ * @tsplus fluent fncts.SortedMap insert
+ */
+
+export function insert_(m, key, value) {
+  if (isEmptyNode(m.root)) {
+    return new SortedMap(m.ord, new Node(0
+    /* Color.R */
+    , Leaf, key, value, 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;
+    }
+  }
+
+  nodeStack.push(new Node(0
+  /* Color.R */
+  , Leaf, key, value, Leaf, 1));
+  rebuildModifiedPath(nodeStack, orderStack);
+  balanceModifiedPath(nodeStack);
+  return new SortedMap(m.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
+ */
+
+export function insertWith_(S) {
+  return (m, key, value) => {
+    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;
+          }
+      }
+    }
+
+    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]);
+  };
+}
+/**
+ * @tsplus getter fncts.SortedMap isEmpty
+ */
+
+export function isEmpty(m) {
+  return m.root === Leaf;
+}
+/**
+ * @tsplus getter fncts.SortedMap isNonEmpty
+ */
+
+export function isNonEmpty(m) {
+  return m.root !== Leaf;
+}
+/**
+ * @tsplus static fncts.SortedMapOps make
+ */
+
+export function make(ord) {
+  return new SortedMap(ord, null);
+}
+/**
+ * Removes an element from the map
+ *
+ * @tsplus fluent fncts.SortedMap remove
+ */
+
+export function remove_(m, key) {
+  const iter = find_1(m, key)[Symbol.iterator]();
+  return iter.isEmpty ? m : iter.remove();
+}
+/**
+ * @tsplus fluent fncts.SortedMap visitFull
+ */
+
+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();
+}
+/**
+ * @tsplus fluent fncts.SortedMap visitLte
+ */
+
+
+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;
+      }
+
+      current = next.right;
+    } else {
+      done = true;
+    }
+  }
+
+  return tsplus_module_1.nothing();
+}
+/**
+ * @tsplus fluent fncts.SortedMap visitLt
+ */
+
+
+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;
+      }
+
+      current = next.right;
+    } else {
+      done = true;
+    }
+  }
+
+  return tsplus_module_1.nothing();
+}
+/**
+ * @tsplus fluent fncts.SortedMap visitGte
+ */
+
+
+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) {
+        current = current.left;
+      } else {
+        current = null;
+      }
+    } 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;
+        }
+      }
+
+      current = next.right;
+    } else {
+      done = true;
+    }
+  }
+
+  return tsplus_module_1.nothing();
+}
+/**
+ * @tsplus fluent fncts.SortedMap visitGt
+ */
+
+
+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;
+      } else {
+        current = null;
+      }
+    } 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;
+        }
+      }
+
+      current = next.right;
+    } else {
+      done = true;
+    }
+  }
+
+  return tsplus_module_1.nothing();
+}
+/**
+ * @tsplus fluent 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;
+      } else {
+        current = null;
+      }
+    } 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;
+      }
+
+      current = next.right;
+    } else {
+      done = true;
+    }
+  }
+
+  return tsplus_module_1.nothing();
+}
+//# sourceMappingURL=api.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"api.mjs","mappings":";;;aAiBgBA,KAAK;aAqVLC,SAAS;aA0BTC,QAAQ;aA8BRC,OAAO;aA8BPC,QAAQ;aAiCRC,OAAO;aAiCPC,YAAY;AA1f5B,SAASC,SAAT,QAA0B,uDAA1B;AACA,SACEC,mBADF,EAEEC,WAFF,EAGEC,mBAHF,QAIO,qDAJP;AAKA,SAASC,iBAAT,QAAkC,qDAAlC;AACA,SAAgBC,IAAhB,EAAsBC,IAAtB,QAAkC,iDAAlC;AAGA;;;;AAGA,gBAA4BC,CAA5B,EAAgDC,GAAhD,EAAwDC,YAAmB,CAA3E,EAA4E;EAC1E,OAAO;IACLC,GAAG,EAAEH,CAAC,CAACG,GADF;;IAEL,CAACC,MAAM,CAACC,QAAR,IAAiB;MACf,MAAMC,GAAG,GAAGN,CAAC,CAACG,GAAF,CAAMI,QAAlB;MACA,IAAIC,CAAC,GAAOR,CAAC,CAACS,IAAd;MACA,MAAMC,KAAK,GAAsB,EAAjC;;MACA,OAAOF,CAAP,EAAU;QACR,MAAMG,CAAC,GAAGL,GAAG,CAACL,GAAD,EAAMO,CAAC,CAACP,GAAR,CAAb;QACAS,KAAK,CAACE,IAAN,CAAWJ,CAAX;;QACA,QAAQG,CAAR;UACE,KAAK,CAAL;YAAQ;cACN,OAAO,IAAId,iBAAJ,CAAsBG,CAAtB,EAAyBU,KAAzB,EAAgCR,SAAhC,CAAP;YACD;;UACD,KAAK,CAAC,CAAN;YAAS;cACPM,CAAC,GAAGA,CAAC,CAACK,IAAN;cACA;YACD;;UACD,KAAK,CAAL;YAAQ;cACNL,CAAC,GAAGA,CAAE,CAACM,KAAP;cACA;YACD;QAXH;MAaD;;MACD,OAAO,IAAIjB,iBAAJ,CAAsBG,CAAtB,EAAyB,EAAzB,EAA6BE,SAA7B,CAAP;IACD;;EAxBI,CAAP;AA0BD;AAED;;;;;;;AAKA,OAAM,SAAUa,QAAV,CAAyBf,CAAzB,EAA6CgB,KAA7C,EAA8E;EAClF,IAAIhB,CAAC,CAACS,IAAN,EAAY;IACVQ,eAAY,CAACC,CAAD,EAAIC,CAAJ,KAAS;MACnBH,KAAK,CAACE,CAAD,EAAIC,CAAJ,CAAL;MACA,OAAOC,yBAAP;IACD,CAHD;EAID;AACF;AAED;;;;AAGA,OAAM,SAAUC,eAAV,CAAgCrB,CAAhC,EAAoDsB,GAApD,EAA4DC,GAA5D,EAAoEP,KAApE,EAA+F;EACnG,IAAIhB,CAAC,CAACS,IAAN,EAAY;IACVe,kBAAeF,GAAf,EAAoBC,GAApB,EAAyB,CAACL,CAAD,EAAIC,CAAJ,KAAS;MAChCH,KAAK,CAACE,CAAD,EAAIC,CAAJ,CAAL;MACA,OAAOC,yBAAP;IACD,CAHD;EAID;AACF;AAED;;;;AAGA,OAAM,SAAUK,WAAV,CAA4BzB,CAA5B,EAAgDuB,GAAhD,EAAwDP,KAAxD,EAAmF;EACvF,IAAIhB,CAAC,CAACS,IAAN,EAAY;IACViB,cAAWH,GAAX,EAAgB,CAACL,CAAD,EAAIC,CAAJ,KAAS;MACvBH,KAAK,CAACE,CAAD,EAAIC,CAAJ,CAAL;MACA,OAAOC,yBAAP;IACD,CAHD;EAID;AACF;AAED;;;;AAGA,OAAM,SAAUO,UAAV,CAA2B3B,CAA3B,EAA+CuB,GAA/C,EAAuDP,KAAvD,EAAkF;EACtF,IAAIhB,CAAC,CAACS,IAAN,EAAY;IACVmB,aAAUL,GAAV,EAAe,CAACL,CAAD,EAAIC,CAAJ,KAAS;MACtBH,KAAK,CAACE,CAAD,EAAIC,CAAJ,CAAL;MACA,OAAOC,yBAAP;IACD,CAHD;EAID;AACF;AAED;;;;AAGA,OAAM,SAAUS,WAAV,CAA4B7B,CAA5B,EAAgDsB,GAAhD,EAAwDN,KAAxD,EAAmF;EACvF,IAAIhB,CAAC,CAACS,IAAN,EAAY;IACVqB,cAAWR,GAAX,EAAgB,CAACJ,CAAD,EAAIC,CAAJ,KAAS;MACvBH,KAAK,CAACE,CAAD,EAAIC,CAAJ,CAAL;MACA,OAAOC,yBAAP;IACD,CAHD;EAID;AACF;AAED;;;;AAGA,OAAM,SAAUW,UAAV,CAA2B/B,CAA3B,EAA+CsB,GAA/C,EAAuDN,KAAvD,EAAkF;EACtF,IAAIhB,CAAC,CAACS,IAAN,EAAY;IACVuB,aAAUV,GAAV,EAAe,CAACJ,CAAD,EAAIC,CAAJ,KAAS;MACtBH,KAAK,CAACE,CAAD,EAAIC,CAAJ,CAAL;MACA,OAAOC,yBAAP;IACD,CAHD;EAID;AACF;AAED;;;;;;AAKA,OAAM,SAAUa,IAAV,CAAqBjC,CAArB,EAAyCC,GAAzC,EAA+C;EACnD,MAAMK,GAAG,GAAGN,CAAC,CAACG,GAAF,CAAMI,QAAlB;EACA,IAAIC,CAAC,GAAOR,CAAC,CAACS,IAAd;;EACA,OAAOD,CAAP,EAAU;IACR,MAAMG,CAAC,GAAGL,GAAG,CAACL,GAAD,EAAMO,CAAC,CAACP,GAAR,CAAb;;IACA,QAAQU,CAAR;MACE,KAAK,CAAL;QAAQ;UACN,OAAOS,qBAAKZ,CAAC,CAAC0B,KAAP,CAAP;QACD;;MACD,KAAK,CAAC,CAAN;QAAS;UACP1B,CAAC,GAAGA,CAAC,CAACK,IAAN;UACA;QACD;;MACD,KAAK,CAAL;QAAQ;UACNL,CAAC,GAAGA,CAAC,CAACM,KAAN;UACA;QACD;IAXH;EAaD;;EACD,OAAOM,yBAAP;AACD;AAED;;;;;;AAKA,OAAM,SAAUe,MAAV,CAAuBnC,CAAvB,EAA2CC,GAA3C,EAAiD;EACrD,MAAMK,GAAG,GAAON,CAAC,CAACG,GAAF,CAAMI,QAAtB;EACA,IAAIC,CAAC,GAAWR,CAAC,CAACS,IAAlB;EACA,IAAI2B,SAAS,GAAGhB,yBAAhB;;EACA,OAAOZ,CAAP,EAAU;IACR,MAAMG,CAAC,GAAGL,GAAG,CAACL,GAAD,EAAMO,CAAC,CAACP,GAAR,CAAb;;IACA,IAAIU,CAAC,GAAG,CAAR,EAAW;MACTyB,SAAS,GAAGhB,qBAAKZ,CAAC,CAAC0B,KAAP,CAAZ;MACA1B,CAAC,GAAWA,CAAC,CAACK,IAAd;IACD,CAHD,MAGO;MACL,IAAIwB,iCAAJ,EAAwB;QACtB;MACD;;MACD7B,CAAC,GAAGA,CAAC,CAACM,KAAN;IACD;EACF;;EACD,OAAOsB,SAAP;AACD;AAED;;;;;;AAKA,OAAM,SAAUE,MAAV,CAAuBtC,CAAvB,EAA2CC,GAA3C,EAAiD;EACrD,MAAMK,GAAG,GAAON,CAAC,CAACG,GAAF,CAAMI,QAAtB;EACA,IAAIC,CAAC,GAAWR,CAAC,CAACS,IAAlB;EACA,IAAI2B,SAAS,GAAGhB,yBAAhB;;EACA,OAAOZ,CAAP,EAAU;IACR,MAAMG,CAAC,GAAGL,GAAG,CAACL,GAAD,EAAMO,CAAC,CAACP,GAAR,CAAb;;IACA,IAAIU,CAAC,GAAG,CAAR,EAAW;MACTyB,SAAS,GAAGhB,qBAAKZ,CAAC,CAAC0B,KAAP,CAAZ;IACD;;IACD,IAAIvB,CAAC,IAAI,CAAT,EAAY;MACVH,CAAC,GAAGA,CAAC,CAACK,IAAN;IACD,CAFD,MAEO;MACLL,CAAC,GAAGA,CAAC,CAACM,KAAN;IACD;EACF;;EACD,OAAOsB,SAAP;AACD;AAED;;;;;;AAKA,OAAM,SAAUG,OAAV,CAAwBvC,CAAxB,EAA4CC,GAA5C,EAAkD;EACtD,MAAMK,GAAG,GAAON,CAAC,CAACG,GAAF,CAAMI,QAAtB;EACA,IAAIC,CAAC,GAAWR,CAAC,CAACS,IAAlB;EACA,IAAI2B,SAAS,GAAGhB,yBAAhB;;EACA,OAAOZ,CAAP,EAAU;IACR,MAAMG,CAAC,GAAGL,GAAG,CAACL,GAAD,EAAMO,CAAC,CAACP,GAAR,CAAb;;IACA,IAAIU,CAAC,GAAG,CAAR,EAAW;MACT,IAAI0B,iCAAJ,EAAwB;QACtB;MACD;;MACD7B,CAAC,GAAGA,CAAC,CAACM,KAAN;IACD,CALD,MAKO;MACLsB,SAAS,GAAGhB,qBAAKZ,CAAC,CAAC0B,KAAP,CAAZ;MACA1B,CAAC,GAAWA,CAAC,CAACK,IAAd;IACD;EACF;;EACD,OAAOuB,SAAP;AACD;AAED;;;;;;AAKA,OAAM,SAAUI,OAAV,CAAwBxC,CAAxB,EAA4CC,GAA5C,EAAkD;EACtD,MAAMK,GAAG,GAAON,CAAC,CAACG,GAAF,CAAMI,QAAtB;EACA,IAAIC,CAAC,GAAWR,CAAC,CAACS,IAAlB;EACA,IAAI2B,SAAS,GAAGhB,yBAAhB;;EACA,OAAOZ,CAAP,EAAU;IACR,MAAMG,CAAC,GAAGL,GAAG,CAACL,GAAD,EAAMO,CAAC,CAACP,GAAR,CAAb;;IACA,IAAIU,CAAC,IAAI,CAAT,EAAY;MACVyB,SAAS,GAAGhB,qBAAKZ,CAAC,CAAC0B,KAAP,CAAZ;MACA1B,CAAC,GAAWA,CAAC,CAACK,IAAd;IACD,CAHD,MAGO;MACL,IAAIwB,iCAAJ,EAAwB;QACtB;MACD;;MACD7B,CAAC,GAAGA,CAAC,CAACM,KAAN;IACD;EACF;;EACD,OAAOsB,SAAP;AACD;AAED;;;;;;;;AAOA,OAAM,SAAUK,OAAV,CAAwBzC,CAAxB,EAA4CC,GAA5C,EAAoDiC,KAApD,EAA4D;EAChE,IAAIvC,WAAW,CAACK,CAAC,CAACS,IAAH,CAAf,EAAyB;IACvB,OAAO,IAAIhB,SAAJ,CAAcO,CAAC,CAACG,GAAhB,EAAqB,IAAIJ,IAAJ,CAAQ;IAAA;IAAR,EAAkBD,IAAlB,EAAwBG,GAAxB,EAA6BiC,KAA7B,EAAoCpC,IAApC,EAA0C,CAA1C,CAArB,CAAP;EACD;;EACD,MAAMQ,GAAG,GAAGN,CAAC,CAACG,GAAF,CAAMI,QAAlB;EACA,MAAMmC,SAAS,GAAsB,EAArC;EACA,MAAMC,UAAU,GAAqB,EAArC;EACA,IAAInC,CAAC,GAAgCR,CAAC,CAACS,IAAvC;;EACA,OAAOD,CAAP,EAAU;IACR,MAAMG,CAAC,GAAGL,GAAG,CAACL,GAAD,EAAMO,CAAC,CAACP,GAAR,CAAb;IACAyC,SAAS,CAAC9B,IAAV,CAAeJ,CAAf;IACAmC,UAAU,CAAC/B,IAAX,CAAgBD,CAAhB;;IACA,IAAIA,CAAC,IAAI,CAAT,EAAY;MACVH,CAAC,GAAGA,CAAC,CAACK,IAAN;IACD,CAFD,MAEO;MACLL,CAAC,GAAGA,CAAC,CAACM,KAAN;IACD;EACF;;EAED4B,SAAS,CAAC9B,IAAV,CAAe,IAAIb,IAAJ,CAAQ;EAAA;EAAR,EAAkBD,IAAlB,EAAwBG,GAAxB,EAA6BiC,KAA7B,EAAoCpC,IAApC,EAA0C,CAA1C,CAAf;EACAF,mBAAmB,CAAC8C,SAAD,EAAYC,UAAZ,CAAnB;EACAjD,mBAAmB,CAACgD,SAAD,CAAnB;EAEA,OAAO,IAAIjD,SAAJ,CAAcO,CAAC,CAACG,GAAhB,EAAqBuC,SAAS,CAAC,CAAD,CAA9B,CAAP;AACD;AAED;;;;;AAIA,OAAM,SAAUE,WAAV,CAAyBC,CAAzB,EAAwC;EAC5C,OAAO,CAAI7C,CAAJ,EAAwBC,GAAxB,EAAgCiC,KAAhC,KAA4C;IACjD,IAAIvC,WAAW,CAACK,CAAC,CAACS,IAAH,CAAf,EAAyB;MACvB,OAAO,IAAIhB,SAAJ,CAAcO,CAAC,CAACG,GAAhB,EAAqB,IAAIJ,IAAJ,CAAQ;MAAA;MAAR,EAAkBD,IAAlB,EAAwBG,GAAxB,EAA6BiC,KAA7B,EAAoCpC,IAApC,EAA0C,CAA1C,CAArB,CAAP;IACD;;IACD,MAAMgD,GAAG,GAAGD,CAAC,CAACE,QAAd;IACA,MAAMzC,GAAG,GAAGN,CAAC,CAACG,GAAF,CAAMI,QAAlB;IACA,MAAMmC,SAAS,GAAsB,EAArC;IACA,MAAMC,UAAU,GAAqB,EAArC;IACA,IAAInC,CAAC,GAAgCR,CAAC,CAACS,IAAvC;IACA,IAAIuC,EAAE,GAA+B,IAArC;;IACA,OAAOxC,CAAC,IAAI,CAACwC,EAAb,EAAiB;MACf,MAAMrC,CAAC,GAAGL,GAAG,CAACL,GAAD,EAAMO,CAAC,CAACP,GAAR,CAAb;MACAyC,SAAS,CAAC9B,IAAV,CAAeJ,CAAf;;MACA,QAAQG,CAAR;QACE,KAAK,CAAC,CAAN;UAAS;YACPgC,UAAU,CAAC/B,IAAX,CAAgBD,CAAhB;YACAH,CAAC,GAAGA,CAAC,CAACK,IAAN;YACA;UACD;;QACD,KAAK,CAAL;UAAQ;YACN8B,UAAU,CAAC/B,IAAX,CAAgBD,CAAhB;YACAH,CAAC,GAAGA,CAAC,CAACM,KAAN;YACA;UACD;;QACD,KAAK,CAAL;UAAQ;YACNkC,EAAE,GAAGF,GAAG,CAACtC,CAAC,CAAC0B,KAAH,EAAUA,KAAV,CAAR;YACA;UACD;MAdH;IAgBD;;IACD,IAAIc,EAAJ,EAAQ;MACN,MAAMC,CAAC,GAA2BP,SAAS,CAACA,SAAS,CAACQ,MAAV,GAAmB,CAApB,CAA3C;MACA,MAAMC,OAAO,GAAqB,IAAIpD,IAAJ,CAASkD,CAAC,CAACG,KAAX,EAAkBH,CAAC,CAACpC,IAApB,EAA0BoC,CAAC,CAAChD,GAA5B,EAAiC+C,EAAjC,EAAqCC,CAAC,CAACnC,KAAvC,EAA8CmC,CAAC,CAACI,KAAhD,CAAlC;MACAX,SAAS,CAACA,SAAS,CAACQ,MAAV,GAAmB,CAApB,CAAT,GAAkCC,OAAlC;MACAvD,mBAAmB,CAAC8C,SAAD,EAAYC,UAAZ,EAAwB,CAAxB,CAAnB;IACD,CALD,MAKO;MACLD,SAAS,CAAC9B,IAAV,CAAe,IAAIb,IAAJ,CAAQ;MAAA;MAAR,EAAkBD,IAAlB,EAAwBG,GAAxB,EAA6BiC,KAA7B,EAAoCpC,IAApC,EAA0C,CAA1C,CAAf;MACAF,mBAAmB,CAAC8C,SAAD,EAAYC,UAAZ,CAAnB;MACAjD,mBAAmB,CAACgD,SAAD,CAAnB;IACD;;IACD,OAAO,IAAIjD,SAAJ,CAAcO,CAAC,CAACG,GAAhB,EAAqBuC,SAAS,CAAC,CAAD,CAA9B,CAAP;EACD,CAzCD;AA0CD;AAED;;;;AAGA,OAAM,SAAUY,OAAV,CAAwBtD,CAAxB,EAA0C;EAC9C,OAAOA,CAAC,CAACS,IAAF,KAAWX,IAAlB;AACD;AAED;;;;AAGA,OAAM,SAAUyD,UAAV,CAA2BvD,CAA3B,EAA6C;EACjD,OAAOA,CAAC,CAACS,IAAF,KAAWX,IAAlB;AACD;AAED;;;;AAGA,OAAM,SAAU0D,IAAV,CAAqBrD,GAArB,EAAgC;EACpC,OAAO,IAAIV,SAAJ,CAAoBU,GAApB,EAAyB,IAAzB,CAAP;AACD;AAED;;;;;;AAKA,OAAM,SAAUsD,OAAV,CAAwBzD,CAAxB,EAA4CC,GAA5C,EAAkD;EACtD,MAAMyD,IAAI,GAAGC,UAAO1D,GAAP,EAAYG,MAAM,CAACC,QAAnB,GAAb;EACA,OAAOqD,IAAI,CAACJ,OAAL,GAAetD,CAAf,GAAmB0D,IAAI,CAACE,MAAL,EAA1B;AACD;AAED;;;;AAGA,qBAAmC5D,CAAnC,EAAuDgB,KAAvD,EAA4F;EAC1F,IAAI6C,OAAO,GAAsB7D,CAAC,CAACS,IAAnC;EACA,MAAMC,KAAK,GAAsBoD,yBAAjC;EACA,IAAIC,IAAI,GAAG,KAAX;;EAEA,OAAO,CAACA,IAAR,EAAc;IACZ,IAAIF,OAAJ,EAAa;MACXnD,KAAK,CAACE,IAAN,CAAWiD,OAAX;MACAA,OAAO,GAAGA,OAAO,CAAChD,IAAlB;IACD,CAHD,MAGO,IAAIH,KAAK,CAACsD,OAAV,EAAmB;MACxB,MAAM9B,KAAK,GAAGxB,KAAK,CAACuD,GAAN,EAAd;MACA,MAAM9C,CAAC,GAAOH,KAAK,CAACkB,KAAK,CAACjC,GAAP,EAAYiC,KAAK,CAACA,KAAlB,CAAnB;;MACA,IAAIG,yBAAJ,EAAgB;QACd,OAAOlB,CAAP;MACD;;MACD0C,OAAO,GAAG3B,KAAK,CAACpB,KAAhB;IACD,CAPM,MAOA;MACLiD,IAAI,GAAG,IAAP;IACD;EACF;;EACD,OAAO3C,yBAAP;AACD;AAED;;;;;AAGA,oBAAkCpB,CAAlC,EAAsDuB,GAAtD,EAA8DP,KAA9D,EAA6F;EAC3F,IAAI6C,OAAO,GAAsB7D,CAAC,CAACS,IAAnC;EACA,MAAMC,KAAK,GAAsBoD,yBAAjC;EACA,IAAIC,IAAI,GAAI,KAAZ;EACA,MAAMzD,GAAG,GAAGN,CAAC,CAACG,GAAF,CAAMI,QAAlB;;EAEA,OAAO,CAACwD,IAAR,EAAc;IACZ,IAAIF,OAAJ,EAAa;MACXnD,KAAK,CAACE,IAAN,CAAWiD,OAAX;MACAA,OAAO,GAAGA,OAAO,CAAChD,IAAlB;IACD,CAHD,MAGO,IAAIH,KAAK,CAACsD,OAAV,EAAmB;MACxB,MAAME,IAAI,GAAGxD,KAAK,CAACuD,GAAN,EAAb;;MACA,IAAI3D,GAAG,CAAC4D,IAAI,CAACjE,GAAN,EAAWsB,GAAX,CAAH,GAAqB,CAAzB,EAA4B;QAC1B;MACD;;MACD,MAAMJ,CAAC,GAAGH,KAAK,CAACkD,IAAI,CAACjE,GAAN,EAAWiE,IAAI,CAAChC,KAAhB,CAAf;;MACA,IAAIG,yBAAJ,EAAgB;QACd,OAAOlB,CAAP;MACD;;MACD0C,OAAO,GAAGK,IAAI,CAACpD,KAAf;IACD,CAVM,MAUA;MACLiD,IAAI,GAAG,IAAP;IACD;EACF;;EACD,OAAO3C,yBAAP;AACD;AAED;;;;;AAGA,mBAAiCpB,CAAjC,EAAqDuB,GAArD,EAA6DP,KAA7D,EAA4F;EAC1F,IAAI6C,OAAO,GAAsB7D,CAAC,CAACS,IAAnC;EACA,MAAMC,KAAK,GAAsBoD,yBAAjC;EACA,IAAIC,IAAI,GAAI,KAAZ;EACA,MAAMzD,GAAG,GAAGN,CAAC,CAACG,GAAF,CAAMI,QAAlB;;EAEA,OAAO,CAACwD,IAAR,EAAc;IACZ,IAAIF,OAAJ,EAAa;MACXnD,KAAK,CAACE,IAAN,CAAWiD,OAAX;MACAA,OAAO,GAAGA,OAAO,CAAChD,IAAlB;IACD,CAHD,MAGO,IAAIH,KAAK,CAACsD,OAAV,EAAmB;MACxB,MAAME,IAAI,GAAGxD,KAAK,CAACuD,GAAN,EAAb;;MACA,IAAI3D,GAAG,CAAC4D,IAAI,CAACjE,GAAN,EAAWsB,GAAX,CAAH,IAAsB,CAA1B,EAA6B;QAC3B;MACD;;MACD,MAAMJ,CAAC,GAAGH,KAAK,CAACkD,IAAI,CAACjE,GAAN,EAAWiE,IAAI,CAAChC,KAAhB,CAAf;;MACA,IAAIG,yBAAJ,EAAgB;QACd,OAAOlB,CAAP;MACD;;MACD0C,OAAO,GAAGK,IAAI,CAACpD,KAAf;IACD,CAVM,MAUA;MACLiD,IAAI,GAAG,IAAP;IACD;EACF;;EACD,OAAO3C,yBAAP;AACD;AAED;;;;;AAGA,oBAAkCpB,CAAlC,EAAsDsB,GAAtD,EAA8DN,KAA9D,EAA6F;EAC3F,IAAI6C,OAAO,GAAsB7D,CAAC,CAACS,IAAnC;EACA,MAAMC,KAAK,GAAsBoD,yBAAjC;EACA,IAAIC,IAAI,GAAI,KAAZ;EACA,MAAMzD,GAAG,GAAGN,CAAC,CAACG,GAAF,CAAMI,QAAlB;;EAEA,OAAO,CAACwD,IAAR,EAAc;IACZ,IAAIF,OAAJ,EAAa;MACXnD,KAAK,CAACE,IAAN,CAAWiD,OAAX;;MACA,IAAIvD,GAAG,CAACuD,OAAO,CAAC5D,GAAT,EAAcqB,GAAd,CAAH,IAAyB,CAA7B,EAAgC;QAC9BuC,OAAO,GAAGA,OAAO,CAAChD,IAAlB;MACD,CAFD,MAEO;QACLgD,OAAO,GAAG,IAAV;MACD;IACF,CAPD,MAOO,IAAInD,KAAK,CAACsD,OAAV,EAAmB;MACxB,MAAME,IAAI,GAAGxD,KAAK,CAACuD,GAAN,EAAb;;MACA,IAAI3D,GAAG,CAAC4D,IAAI,CAACjE,GAAN,EAAWqB,GAAX,CAAH,IAAsB,CAA1B,EAA6B;QAC3B,MAAMH,CAAC,GAAGH,KAAK,CAACkD,IAAI,CAACjE,GAAN,EAAWiE,IAAI,CAAChC,KAAhB,CAAf;;QACA,IAAIG,yBAAJ,EAAgB;UACd,OAAOlB,CAAP;QACD;MACF;;MACD0C,OAAO,GAAGK,IAAI,CAACpD,KAAf;IACD,CATM,MASA;MACLiD,IAAI,GAAG,IAAP;IACD;EACF;;EACD,OAAO3C,yBAAP;AACD;AAED;;;;;AAGA,mBAAiCpB,CAAjC,EAAqDsB,GAArD,EAA6DN,KAA7D,EAA4F;EAC1F,IAAI6C,OAAO,GAAsB7D,CAAC,CAACS,IAAnC;EACA,MAAMC,KAAK,GAAsBoD,yBAAjC;EACA,IAAIC,IAAI,GAAI,KAAZ;EACA,MAAMzD,GAAG,GAAGN,CAAC,CAACG,GAAF,CAAMI,QAAlB;;EAEA,OAAO,CAACwD,IAAR,EAAc;IACZ,IAAIF,OAAJ,EAAa;MACXnD,KAAK,CAACE,IAAN,CAAWiD,OAAX;;MACA,IAAIvD,GAAG,CAACuD,OAAO,CAAC5D,GAAT,EAAcqB,GAAd,CAAH,GAAwB,CAA5B,EAA+B;QAC7BuC,OAAO,GAAGA,OAAO,CAAChD,IAAlB;MACD,CAFD,MAEO;QACLgD,OAAO,GAAG,IAAV;MACD;IACF,CAPD,MAOO,IAAInD,KAAK,CAACsD,OAAV,EAAmB;MACxB,MAAME,IAAI,GAAGxD,KAAK,CAACuD,GAAN,EAAb;;MACA,IAAI3D,GAAG,CAAC4D,IAAI,CAACjE,GAAN,EAAWqB,GAAX,CAAH,GAAqB,CAAzB,EAA4B;QAC1B,MAAMH,CAAC,GAAGH,KAAK,CAACkD,IAAI,CAACjE,GAAN,EAAWiE,IAAI,CAAChC,KAAhB,CAAf;;QACA,IAAIG,yBAAJ,EAAgB;UACd,OAAOlB,CAAP;QACD;MACF;;MACD0C,OAAO,GAAGK,IAAI,CAACpD,KAAf;IACD,CATM,MASA;MACLiD,IAAI,GAAG,IAAP;IACD;EACF;;EACD,OAAO3C,yBAAP;AACD;AAED;;;;;AAGA,wBAAsCpB,CAAtC,EAA0DsB,GAA1D,EAAkEC,GAAlE,EAA0EP,KAA1E,EAAyG;EACvG,IAAI6C,OAAO,GAAsB7D,CAAC,CAACS,IAAnC;EACA,MAAMC,KAAK,GAAsBoD,yBAAjC;EACA,IAAIC,IAAI,GAAI,KAAZ;EACA,MAAMzD,GAAG,GAAGN,CAAC,CAACG,GAAF,CAAMI,QAAlB;;EAEA,OAAO,CAACwD,IAAR,EAAc;IACZ,IAAIF,OAAJ,EAAa;MACXnD,KAAK,CAACE,IAAN,CAAWiD,OAAX;;MACA,IAAIvD,GAAG,CAACuD,OAAO,CAAC5D,GAAT,EAAcqB,GAAd,CAAH,GAAwB,CAA5B,EAA+B;QAC7BuC,OAAO,GAAGA,OAAO,CAAChD,IAAlB;MACD,CAFD,MAEO;QACLgD,OAAO,GAAG,IAAV;MACD;IACF,CAPD,MAOO,IAAInD,KAAK,CAACsD,OAAV,EAAmB;MACxB,MAAME,IAAI,GAAGxD,KAAK,CAACuD,GAAN,EAAb;;MACA,IAAI3D,GAAG,CAAC4D,IAAI,CAACjE,GAAN,EAAWsB,GAAX,CAAH,IAAsB,CAA1B,EAA6B;QAC3B;MACD;;MACD,MAAMJ,CAAC,GAAGH,KAAK,CAACkD,IAAI,CAACjE,GAAN,EAAWiE,IAAI,CAAChC,KAAhB,CAAf;;MACA,IAAIG,yBAAJ,EAAgB;QACd,OAAOlB,CAAP;MACD;;MACD0C,OAAO,GAAGK,IAAI,CAACpD,KAAf;IACD,CAVM,MAUA;MACLiD,IAAI,GAAG,IAAP;IACD;EACF;;EACD,OAAO3C,yBAAP;AACD","names":["find_","visitFull","visitLte","visitLt","visitGte","visitGt","visitBetween","SortedMap","balanceModifiedPath","isEmptyNode","rebuildModifiedPath","SortedMapIterator","Leaf","Node","m","key","direction","ord","Symbol","iterator","cmp","compare_","n","root","stack","d","push","left","right","forEach_","visit","visitFull_1","k","v","tsplus_module_1","forEachBetween_","min","max","visitBetween_1","forEachLte_","visitLte_1","forEachLt_","visitLt_1","forEachGte_","visitGte_1","forEachGt_","visitGt_1","get_","value","getGt_","lastValue","tsplus_module_2","getLt_","getLte_","getGte_","insert_","nodeStack","orderStack","insertWith_","S","com","combine_","cv","u","length","updated","color","count","isEmpty","isNonEmpty","make","remove_","iter","find_1","remove","current","tsplus_module_3","done","hasNext","pop","next"],"sourceRoot":"","sources":["../../../../_src/collection/immutable/SortedMap/api.ts"],"sourcesContent":[null]}

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

@@ -0,0 +1,18 @@
+import { forward } from "@fncts/base/collection/immutable/SortedMap/iterator";
+/**
+ * @tsplus type fncts.SortedMap
+ * @tsplus companion fncts.SortedMapOps
+ */
+
+export class SortedMap {
+  constructor(ord, root) {
+    this.ord = ord;
+    this.root = root;
+  }
+
+  [Symbol.iterator]() {
+    return forward(this)[Symbol.iterator]();
+  }
+
+}
+//# sourceMappingURL=definition.mjs.map

package/_mjs/collection/immutable/SortedMap/definition.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"definition.mjs","mappings":"AAIA,SAASA,OAAT,QAAwB,qDAAxB;AAEA;;;;;AAIA,OAAM,MAAOC,SAAP,CAAgB;EACpBC,YAAqBC,GAArB,EAA2CC,IAA3C,EAA6D;IAAxC;IAAsB;EAAsB;;EAEjD,CAAfC,MAAM,CAACC,QAAQ,IAAC;IACf,OAAON,OAAO,CAAC,IAAD,CAAP,CAAcK,MAAM,CAACC,QAArB,GAAP;EACD;;AALmB","names":["forward","SortedMap","constructor","ord","root","Symbol","iterator"],"sourceRoot":"","sources":["../../../../_src/collection/immutable/SortedMap/definition.ts"],"sourcesContent":[null]}