@fncts/base 0.0.1

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

@@ -0,0 +1,515 @@
+import * as tsplus_module_1 from "@fncts/base/typeclass/HashEq";
+import * as tsplus_module_2 from "@fncts/base/typeclass/Eq";
+import * as tsplus_module_3 from "@fncts/base/data/Maybe/definition";
+import * as tsplus_module_4 from "@fncts/base/data/Either/destructors";
+import * as tsplus_module_5 from "@fncts/base/internal/Stack";
+import * as tsplus_module_6 from "@fncts/base/data/Maybe/constructors";
+export const add_ = add_1;
+export const beginMutation = beginMutation_1;
+export const endMutation = endMutation_1;
+export const forEach_ = forEach_1;
+export const has_ = has_1;
+export const make = make_1;
+export const makeDefault = makeDefault_1;
+export const mutate_ = mutate_1;
+export const remove_ = remove_1;
+export const size = size_1;
+export const foldLeft_ = foldLeft_1;
+export const every_ = every_1;
+import { fromBitmap, hashFragment, SIZE, toBitmap } from "@fncts/base/collection/immutable/HashMap/internal";
+import { _EmptyNode, HashSet, isEmptyNode } from "@fncts/base/collection/immutable/HashSet/definition";
+import { tuple } from "@fncts/base/data/function";
+import * as P from "@fncts/base/typeclass";
+/**
+ * @tsplus fluent fncts.HashSet add
+ */
+
+function add_1(set, value) {
+  return modifyHash(set, value, set.config.hash(value), false);
+}
+/**
+ * Mark `set` as mutable.
+ *
+ * @tsplus getter fncts.HashSet beginMutation
+ */
+
+
+function beginMutation_1(set) {
+  return new HashSet(true, set._edit + 1, set.config, set._root, set._size);
+}
+/**
+ * Mark `set` as immutable.
+ *
+ * @tsplus getter fncts.HashSet endMutation
+ */
+
+
+function endMutation_1(set) {
+  set._editable = false;
+  return set;
+}
+/**
+ * Appy f to each element
+ *
+ * @tsplus fluent fncts.HashSet forEach
+ */
+
+
+function forEach_1(map, f) {
+  foldLeft_1(map, undefined, (_, value) => f(value, map));
+}
+/**
+ * @tsplus fluent fncts.HashSet has
+ */
+
+
+function has_1(set, value) {
+  return hasHash(set, value, set.config.hash(value));
+}
+/**
+ * @tsplus static fncts.HashSetOps make
+ */
+
+
+function make_1(config) {
+  return new HashSet(false, 0, config, _EmptyNode, 0);
+}
+/**
+ * @tsplus static fncts.HashSetOps makeDefault
+ */
+
+
+function makeDefault_1() {
+  return make_1(tsplus_module_1.StructuralStrict);
+}
+/**
+ * @tsplus static fncts.HashSetOps fromDefault
+ */
+
+
+export function fromDefault(...values) {
+  return mutate_1(makeDefault_1(), set => {
+    values.forEach(v => {
+      add_1(set, v);
+    });
+  });
+}
+/**
+ * Mutate `set` within the context of `f`.
+ *
+ * @tsplus fluent fncts.HashSet mutate
+ */
+
+function mutate_1(set, transient) {
+  const s = beginMutation_1(set);
+  transient(s);
+  return endMutation_1(s);
+}
+/**
+ * @tsplus fluent fncts.HashSet remove
+ */
+
+
+function remove_1(set, value) {
+  return modifyHash(set, value, set.config.hash(value), true);
+}
+/**
+ * Calculate the number of keys pairs in a set
+ *
+ * @tsplus getter fncts.HashSet size
+ */
+
+
+function size_1(set) {
+  return set._size;
+}
+/**
+ * If element is present remove it, if not add it
+ *
+ * @tsplus fluent fncts.HashSet toggle
+ */
+
+
+export function toggle_(set, a) {
+  return (has_1(set, a) ? remove_1 : add_1)(set, a);
+}
+/**
+ * Projects a Set through a function
+ */
+
+export function map_(C) {
+  const r = make_1(C);
+  return (fa, f) => mutate_1(r, r => {
+    forEach_1(fa, e => {
+      const v = f(e);
+
+      if (!has_1(r, v)) {
+        add_1(r, v);
+      }
+    });
+    return r;
+  });
+}
+/**
+ * Projects a Set through a function
+ *
+ * @tsplus fluent fncts.HashSet map
+ */
+
+export function mapDefault(self, f) {
+  return map_(tsplus_module_1.StructuralStrict)(self, f);
+}
+/**
+ * Map + Flatten
+ */
+
+export function flatMap_(C) {
+  const r = make_1(C);
+  return (set, f) => mutate_1(r, r => {
+    forEach_1(set, e => {
+      for (const a of f(e)) {
+        if (!has_1(r, a)) {
+          add_1(r, a);
+        }
+      }
+    });
+    return r;
+  });
+}
+/**
+ * @tsplus fluent fncts.HashSet flatMap
+ */
+
+export function flatMapDefault(self, f) {
+  return flatMap_(tsplus_module_1.StructuralStrict)(self, f);
+}
+/**
+ * Creates an equal for a set
+ *
+ * @tsplus static fncts.HashSetOps getEq
+ */
+
+export function getEq() {
+  return tsplus_module_2.mkEq({
+    equals_: (x, y) => {
+      if (y === x) {
+        return true;
+      }
+
+      if (size_1(x) !== size_1(y)) {
+        return false;
+      }
+
+      let eq = true;
+
+      for (const vx of x) {
+        if (!has_1(y, vx)) {
+          eq = false;
+          break;
+        }
+      }
+
+      return eq;
+    }
+  });
+}
+export function filter_(set, predicate) {
+  const r = make_1(set.config);
+  return mutate_1(r, r => {
+    forEach_1(set, v => {
+      if (predicate(v)) {
+        add_1(r, v);
+      }
+    });
+  });
+}
+export function filterMap_(B) {
+  return (fa, f) => {
+    const out = beginMutation_1(make_1(B));
+    forEach_1(fa, a => {
+      const ob = f(a);
+
+      if (tsplus_module_3.isJust(ob)) {
+        add_1(out, ob.value);
+      }
+    });
+    return endMutation_1(out);
+  };
+}
+export function partition_(self, p) {
+  const right = beginMutation_1(make_1(self.config));
+  const left = beginMutation_1(make_1(self.config));
+  forEach_1(self, v => {
+    if (p(v)) {
+      add_1(right, v);
+    } else {
+      add_1(left, v);
+    }
+  });
+  return tuple(endMutation_1(left), endMutation_1(right));
+}
+/**
+ * Partition set values using predicate
+ */
+
+export function partitionMap_(B, C) {
+  return (fa, f) => {
+    const right = beginMutation_1(make_1(C));
+    const left = beginMutation_1(make_1(B));
+    forEach_1(fa, v => {
+      tsplus_module_4.match_(f(v), b => {
+        add_1(left, b);
+      }, c => {
+        add_1(right, c);
+      });
+    });
+    return [endMutation_1(left), endMutation_1(right)];
+  };
+}
+/**
+ * Reduce a state over the set elements
+ *
+ * @tsplus fluent fncts.HashSet foldLeft
+ */
+
+function foldLeft_1(fa, b, f) {
+  const root = fa._root;
+  if (root._tag === "LeafNode") return f(b, root.value);
+  if (root._tag === "EmptyNode") return b;
+  const toVisit = tsplus_module_5.mkStack();
+  toVisit.push(root.children);
+
+  while (toVisit.hasNext) {
+    const children = toVisit.pop();
+
+    for (let i = 0, len = children.length; i < len;) {
+      const child = children[i++];
+
+      if (child && !isEmptyNode(child)) {
+        if (child._tag === "LeafNode") {
+          // eslint-disable-next-line no-param-reassign
+          b = f(b, child.value);
+        } else {
+          toVisit.push(child.children);
+        }
+      }
+    }
+  }
+
+  return b;
+}
+/**
+ * @tsplus fluent fncts.HashSet join
+ */
+
+
+export function join_(self, separator) {
+  if (self.size === 0) {
+    return "";
+  }
+
+  const iterator = self[Symbol.iterator]();
+  let first = true;
+  let s = "";
+  let result;
+
+  while (!(result = iterator.next()).done) {
+    if (first) {
+      first = false;
+      s += result.value;
+      result = iterator.next();
+    } else {
+      s += separator;
+      s += result.value;
+    }
+  }
+
+  return s;
+}
+/**
+ * Form the set difference
+ *
+ * @tsplus fluent fncts.HashSet difference
+ */
+
+export function difference_(x, y) {
+  return mutate_1(x, s => {
+    for (const k of y) {
+      remove_1(s, k);
+    }
+  });
+}
+/**
+ * true if all elements match predicate
+ *
+ * @tsplus fluent fncts.HashSet every
+ */
+
+function every_1(self, predicate) {
+  for (const e of self) {
+    if (!predicate(e)) {
+      return false;
+    }
+  }
+
+  return true;
+}
+/**
+ * The set of elements which are in both the first and second set,
+ *
+ * the hash and equal of the 2 sets has to be the same
+ */
+
+
+export function intersection_(self, that) {
+  const out = make_1(self.config);
+  return mutate_1(out, y => {
+    for (const k of that) {
+      if (has_1(self, k)) {
+        add_1(y, k);
+      }
+    }
+  });
+}
+/**
+ * `true` if and only if every element in the first set is an element of the second set,
+ *
+ * the hash and equal of the 2 sets has to be the same
+ */
+
+export function isSubset_(x, y) {
+  return every_1(x, a => has_1(y, a));
+}
+/**
+ * true if one or more elements match predicate
+ *
+ * @tsplus fluent fncts.HashSet exists
+ */
+
+export function exists_(set, predicate) {
+  let found = false;
+
+  for (const e of set) {
+    found = predicate(e);
+
+    if (found) {
+      break;
+    }
+  }
+
+  return found;
+}
+/**
+ * Form the union of two sets,
+ *
+ * the hash and equal of the 2 sets has to be the same
+ *
+ * @tsplus fluent fncts.HashSet union
+ */
+
+export function union_(l, r) {
+  return mutate_1(l, x => {
+    for (const a of r) {
+      add_1(x, a);
+    }
+  });
+}
+/**
+ * @tsplus static fncts.HashSet toArray
+ */
+
+export function toArray_(set, O) {
+  const r = [];
+  forEach_1(set, a => r.push(a));
+  return r.sort(O.compare_);
+}
+/*
+ * -------------------------------------------------------------------------------------------------
+ * internal
+ * -------------------------------------------------------------------------------------------------
+ */
+
+function setTree(set, newRoot, newSize) {
+  if (set._editable) {
+    set._root = newRoot;
+    set._size = newSize;
+    return set;
+  }
+
+  return newRoot === set._root ? set : new HashSet(set._editable, set._edit, set.config, newRoot, newSize);
+}
+
+function modifyHash(set, value, hash, remove) {
+  const size = {
+    value: set._size
+  };
+
+  const newRoot = set._root.modify(remove, set._editable ? set._edit : NaN, set.config.equals_, 0, hash, value, size);
+
+  return setTree(set, newRoot, size.value);
+}
+
+function tryGetHash(set, value, hash) {
+  let node = set._root;
+  let shift = 0;
+  const eq = set.config.equals_; // eslint-disable-next-line no-constant-condition
+
+  while (true) {
+    switch (node._tag) {
+      case "LeafNode":
+        {
+          return eq(node.value, value) ? tsplus_module_6.just(node.value) : tsplus_module_6.nothing();
+        }
+
+      case "CollisionNode":
+        {
+          if (hash === node.hash) {
+            const children = node.children;
+
+            for (let i = 0, len = children.length; i < len; ++i) {
+              const child = children[i];
+              if ("value" in child && eq(child.value, value)) return tsplus_module_6.just(child.value);
+            }
+          }
+
+          return tsplus_module_6.nothing();
+        }
+
+      case "IndexNode":
+        {
+          const frag = hashFragment(shift, hash);
+          const bit = toBitmap(frag);
+
+          if (node.mask & bit) {
+            node = node.children[fromBitmap(node.mask, bit)];
+            shift += SIZE;
+            break;
+          }
+
+          return tsplus_module_6.nothing();
+        }
+
+      case "ArrayNode":
+        {
+          node = node.children[hashFragment(shift, hash)];
+
+          if (node) {
+            shift += SIZE;
+            break;
+          }
+
+          return tsplus_module_6.nothing();
+        }
+
+      default:
+        {
+          return tsplus_module_6.nothing();
+        }
+    }
+  }
+}
+
+function hasHash(set, value, hash) {
+  return tsplus_module_3.isJust(tryGetHash(set, value, hash));
+}
+//# sourceMappingURL=api.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"api.mjs","mappings":";;;;;;aAYgBA,IAAI;aASJC,aAAa;aASbC,WAAW;aAUXC,QAAQ;aAORC,IAAI;aAOJC,IAAI;aAOJC,WAAW;aAoBXC,OAAO;aASPC,OAAO;aASPC,IAAI;aA4KJC,SAAS;aAiETC,MAAM;AA9UtB,SAASC,UAAT,EAAqBC,YAArB,EAAmCC,IAAnC,EAAyCC,QAAzC,QAAyD,mDAAzD;AACA,SAASC,UAAT,EAAqBC,OAArB,EAA8BC,WAA9B,QAAiD,qDAAjD;AACA,SAASC,KAAT,QAAsB,2BAAtB;AAEA,OAAO,KAAKC,CAAZ,MAAmB,uBAAnB;AAGA;;;;AAGA,eAAwBC,GAAxB,EAAyCC,KAAzC,EAAiD;EAC/C,OAAOC,UAAU,CAACF,GAAD,EAAMC,KAAN,EAAaD,GAAG,CAACG,MAAJ,CAAWC,IAAX,CAAgBH,KAAhB,CAAb,EAAqC,KAArC,CAAjB;AACD;AAED;;;;;;;AAKA,yBAAiCD,GAAjC,EAAgD;EAC9C,OAAO,IAAIJ,OAAJ,CAAY,IAAZ,EAAkBI,GAAG,CAACK,KAAJ,GAAY,CAA9B,EAAiCL,GAAG,CAACG,MAArC,EAA6CH,GAAG,CAACM,KAAjD,EAAwDN,GAAG,CAACO,KAA5D,CAAP;AACD;AAED;;;;;;;AAKA,uBAA+BP,GAA/B,EAA8C;EAC5CA,GAAG,CAACQ,SAAJ,GAAgB,KAAhB;EACA,OAAOR,GAAP;AACD;AAED;;;;;;;AAKA,mBAA4BS,GAA5B,EAA6CC,CAA7C,EAA6E;EAC3EC,WAAUF,GAAV,EAAeG,SAAf,EAAkC,CAACC,CAAD,EAAIZ,KAAJ,KAAcS,CAAC,CAACT,KAAD,EAAQQ,GAAR,CAAjD;AACD;AAED;;;;;AAGA,eAAwBT,GAAxB,EAAyCC,KAAzC,EAAiD;EAC/C,OAAOa,OAAO,CAACd,GAAD,EAAMC,KAAN,EAAaD,GAAG,CAACG,MAAJ,CAAWC,IAAX,CAAgBH,KAAhB,CAAb,CAAd;AACD;AAED;;;;;AAGA,gBAAwBE,MAAxB,EAAmD;EACjD,OAAO,IAAIP,OAAJ,CAAY,KAAZ,EAAmB,CAAnB,EAAsBO,MAAtB,EAA8BR,UAA9B,EAA0C,CAA1C,CAAP;AACD;AAED;;;;;AAGA;EACE,OAAOoB,wCAAP;AACD;AAED;;;;;AAGA,OAAM,SAAUC,WAAV,CAAyB,GAAGC,MAA5B,EAAoD;EACxD,OAAOC,SAAQC,eAAR,EAA2BnB,GAAD,IAAQ;IACvCiB,MAAM,CAACG,OAAP,CAAgBC,CAAD,IAAM;MACnBC,MAAKtB,GAAL,EAAUqB,CAAV;IACD,CAFD;EAGD,CAJM,CAAP;AAKD;AAED;;;;;;AAKA,kBAA2BrB,GAA3B,EAA4CuB,SAA5C,EAAgF;EAC9E,MAAMC,CAAC,GAAGC,gBAAczB,GAAd,CAAV;EACAuB,SAAS,CAACC,CAAD,CAAT;EACA,OAAOE,cAAYF,CAAZ,CAAP;AACD;AAED;;;;;AAGA,kBAA2BxB,GAA3B,EAA4CC,KAA5C,EAAoD;EAClD,OAAOC,UAAU,CAACF,GAAD,EAAMC,KAAN,EAAaD,GAAG,CAACG,MAAJ,CAAWC,IAAX,CAAgBH,KAAhB,CAAb,EAAqC,IAArC,CAAjB;AACD;AAED;;;;;;;AAKA,gBAAwBD,GAAxB,EAAuC;EACrC,OAAOA,GAAG,CAACO,KAAX;AACD;AAED;;;;;;;AAKA,OAAM,SAAUoB,OAAV,CAAqB3B,GAArB,EAAsC4B,CAAtC,EAA0C;EAC9C,OAAO,CAACC,MAAK7B,GAAL,EAAU4B,CAAV,IAAcE,QAAd,GAAwBR,KAAzB,EAAgCtB,GAAhC,EAAqC4B,CAArC,CAAP;AACD;AAED;;;;AAGA,OAAM,SAAUG,IAAV,CAAkBC,CAAlB,EAAgC;EACpC,MAAMC,CAAC,GAAGlB,OAAKiB,CAAL,CAAV;EAEA,OAAO,CAACE,EAAD,EAAKxB,CAAL,KACLQ,SAAQe,CAAR,EAAYA,CAAD,IAAM;IACfE,UAASD,EAAT,EAAcE,CAAD,IAAM;MACjB,MAAMf,CAAC,GAAGX,CAAC,CAAC0B,CAAD,CAAX;;MACA,IAAI,CAACP,MAAKI,CAAL,EAAQZ,CAAR,CAAL,EAAiB;QACfC,MAAKW,CAAL,EAAQZ,CAAR;MACD;IACF,CALD;IAMA,OAAOY,CAAP;EACD,CARD,CADF;AAUD;AAED;;;;;;AAKA,OAAM,SAAUI,UAAV,CAA2BC,IAA3B,EAA6C5B,CAA7C,EAA2D;EAC/D,OAAOqB,IAAI,CAACQ,gCAAD,CAAJ,CAA+CD,IAA/C,EAAqD5B,CAArD,CAAP;AACD;AAED;;;;AAGA,OAAM,SAAU8B,QAAV,CAAsBR,CAAtB,EAAoC;EACxC,MAAMC,CAAC,GAAGlB,OAAQiB,CAAR,CAAV;EACA,OAAO,CAAChC,GAAD,EAAMU,CAAN,KACLQ,SAAQe,CAAR,EAAYA,CAAD,IAAM;IACfE,UAASnC,GAAT,EAAeoC,CAAD,IAAM;MAClB,KAAK,MAAMR,CAAX,IAAgBlB,CAAC,CAAC0B,CAAD,CAAjB,EAAsB;QACpB,IAAI,CAACP,MAAKI,CAAL,EAAQL,CAAR,CAAL,EAAiB;UACfN,MAAKW,CAAL,EAAQL,CAAR;QACD;MACF;IACF,CAND;IAOA,OAAOK,CAAP;EACD,CATD,CADF;AAWD;AAED;;;;AAGA,OAAM,SAAUQ,cAAV,CAA+BH,IAA/B,EAAiD5B,CAAjD,EAAyE;EAC7E,OAAO8B,QAAQ,kCAAR,CAAqCF,IAArC,EAA2C5B,CAA3C,CAAP;AACD;AAED;;;;;;AAKA,OAAM,SAAUgC,KAAV,GAAe;EACnB,OAAOC,qBAAK;IACVC,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAS;MAChB,IAAIA,CAAC,KAAKD,CAAV,EAAa;QACX,OAAO,IAAP;MACD;;MACD,IAAIE,OAAKF,CAAL,MAAYE,OAAKD,CAAL,CAAhB,EAAyB;QACvB,OAAO,KAAP;MACD;;MACD,IAAIE,EAAE,GAAG,IAAT;;MACA,KAAK,MAAMC,EAAX,IAAiBJ,CAAjB,EAAoB;QAClB,IAAI,CAAChB,MAAKiB,CAAL,EAAQG,EAAR,CAAL,EAAkB;UAChBD,EAAE,GAAG,KAAL;UACA;QACD;MACF;;MACD,OAAOA,EAAP;IACD;EAhBS,CAAL,CAAP;AAkBD;AASD,OAAM,SAAUE,OAAV,CAAqBlD,GAArB,EAAsCmD,SAAtC,EAA6D;EACjE,MAAMlB,CAAC,GAAGlB,OAAKf,GAAG,CAACG,MAAT,CAAV;EAEA,OAAOe,SAAQe,CAAR,EAAYA,CAAD,IAAM;IACtBE,UAASnC,GAAT,EAAeqB,CAAD,IAAM;MAClB,IAAI8B,SAAS,CAAC9B,CAAD,CAAb,EAAkB;QAChBC,MAAKW,CAAL,EAAQZ,CAAR;MACD;IACF,CAJD;EAKD,CANM,CAAP;AAOD;AAED,OAAM,SAAU+B,UAAV,CAAwBC,CAAxB,EAAsC;EAC1C,OAAO,CAACnB,EAAD,EAAKxB,CAAL,KAAU;IACf,MAAM4C,GAAG,GAAG7B,gBAAcV,OAAKsC,CAAL,CAAd,CAAZ;IACAlB,UAASD,EAAT,EAAcN,CAAD,IAAM;MACjB,MAAM2B,EAAE,GAAG7C,CAAC,CAACkB,CAAD,CAAZ;;MACA,IAAI4B,0BAAJ,EAAiB;QACflC,MAAKgC,GAAL,EAAUC,EAAE,CAACtD,KAAb;MACD;IACF,CALD;IAMA,OAAOyB,cAAY4B,GAAZ,CAAP;EACD,CATD;AAUD;AASD,OAAM,SAAUG,UAAV,CAAwBnB,IAAxB,EAA0CoB,CAA1C,EAAyD;EAC7D,MAAMC,KAAK,GAAGlC,gBAAcV,OAAKuB,IAAI,CAACnC,MAAV,CAAd,CAAd;EACA,MAAMyD,IAAI,GAAInC,gBAAcV,OAAKuB,IAAI,CAACnC,MAAV,CAAd,CAAd;EACAgC,UAASG,IAAT,EAAgBjB,CAAD,IAAM;IACnB,IAAIqC,CAAC,CAACrC,CAAD,CAAL,EAAU;MACRC,MAAKqC,KAAL,EAAYtC,CAAZ;IACD,CAFD,MAEO;MACLC,MAAKsC,IAAL,EAAWvC,CAAX;IACD;EACF,CAND;EAOA,OAAOvB,KAAK,CAAC4B,cAAYkC,IAAZ,CAAD,EAAoBlC,cAAYiC,KAAZ,CAApB,CAAZ;AACD;AAED;;;;AAGA,OAAM,SAAUE,aAAV,CACJR,CADI,EAEJrB,CAFI,EAEU;EAEd,OAAO,CAACE,EAAD,EAAKxB,CAAL,KAAU;IACf,MAAMiD,KAAK,GAAGlC,gBAAcV,OAAKiB,CAAL,CAAd,CAAd;IACA,MAAM4B,IAAI,GAAInC,gBAAcV,OAAKsC,CAAL,CAAd,CAAd;IACAlB,UAASD,EAAT,EAAcb,CAAD,IAAM;MACjByC,wBAAC,CAACzC,CAAD,CAAD,EACG0C,CAAD,IAAM;QACJzC,MAAKsC,IAAL,EAAWG,CAAX;MACD,CAHH,EAIGC,CAAD,IAAM;QACJ1C,MAAKqC,KAAL,EAAYK,CAAZ;MACD,CANH;IAQD,CATD;IAUA,OAAO,CAACtC,cAAYkC,IAAZ,CAAD,EAAoBlC,cAAYiC,KAAZ,CAApB,CAAP;EACD,CAdD;AAeD;AAED;;;;;;AAKA,oBAAgCzB,EAAhC,EAAgD6B,CAAhD,EAAsDrD,CAAtD,EAA0E;EACxE,MAAMuD,IAAI,GAAG/B,EAAE,CAAC5B,KAAhB;EACA,IAAI2D,IAAI,CAACC,IAAL,KAAc,UAAlB,EAA8B,OAAOxD,CAAC,CAACqD,CAAD,EAAIE,IAAI,CAAChE,KAAT,CAAR;EAC9B,IAAIgE,IAAI,CAACC,IAAL,KAAc,WAAlB,EAA+B,OAAOH,CAAP;EAC/B,MAAMI,OAAO,GAA0BC,yBAAvC;EACAD,OAAO,CAACE,IAAR,CAAaJ,IAAI,CAACK,QAAlB;;EACA,OAAOH,OAAO,CAACI,OAAf,EAAwB;IACtB,MAAMD,QAAQ,GAAGH,OAAO,CAACK,GAAR,EAAjB;;IACA,KAAK,IAAIC,CAAC,GAAG,CAAR,EAAWC,GAAG,GAAGJ,QAAQ,CAACK,MAA/B,EAAuCF,CAAC,GAAGC,GAA3C,GAAkD;MAChD,MAAME,KAAK,GAAGN,QAAQ,CAACG,CAAC,EAAF,CAAtB;;MACA,IAAIG,KAAK,IAAI,CAAC/E,WAAW,CAAC+E,KAAD,CAAzB,EAAkC;QAChC,IAAIA,KAAK,CAACV,IAAN,KAAe,UAAnB,EAA+B;UAC7B;UACAH,CAAC,GAAGrD,CAAC,CAACqD,CAAD,EAAIa,KAAK,CAAC3E,KAAV,CAAL;QACD,CAHD,MAGO;UACLkE,OAAO,CAACE,IAAR,CAAaO,KAAK,CAACN,QAAnB;QACD;MACF;IACF;EACF;;EACD,OAAOP,CAAP;AACD;AAED;;;;;AAGA,OAAM,SAAUc,KAAV,CAAgBvC,IAAhB,EAAuCwC,SAAvC,EAAwD;EAC5D,IAAIxC,IAAI,CAAClD,IAAL,KAAc,CAAlB,EAAqB;IACnB,OAAO,EAAP;EACD;;EACD,MAAM2F,QAAQ,GAAGzC,IAAI,CAAC0C,MAAM,CAACD,QAAR,CAAJ,EAAjB;EACA,IAAIE,KAAK,GAAQ,IAAjB;EACA,IAAIzD,CAAC,GAAY,EAAjB;EACA,IAAI0D,MAAJ;;EACA,OAAO,CAAC,CAACA,MAAM,GAAGH,QAAQ,CAACI,IAAT,EAAV,EAA2BC,IAAnC,EAAyC;IACvC,IAAIH,KAAJ,EAAW;MACTA,KAAK,GAAI,KAAT;MACAzD,CAAC,IAAQ0D,MAAM,CAACjF,KAAhB;MACAiF,MAAM,GAAGH,QAAQ,CAACI,IAAT,EAAT;IACD,CAJD,MAIO;MACL3D,CAAC,IAAIsD,SAAL;MACAtD,CAAC,IAAI0D,MAAM,CAACjF,KAAZ;IACD;EACF;;EACD,OAAOuB,CAAP;AACD;AAED;;;;;;AAKA,OAAM,SAAU6D,WAAV,CAAyBxC,CAAzB,EAAwCC,CAAxC,EAAsD;EAC1D,OAAO5B,SAAQ2B,CAAR,EAAYrB,CAAD,IAAM;IACtB,KAAK,MAAM8D,CAAX,IAAgBxC,CAAhB,EAAmB;MACjBhB,SAAQN,CAAR,EAAW8D,CAAX;IACD;EACF,CAJM,CAAP;AAKD;AAED;;;;;;AAKA,iBAA0BhD,IAA1B,EAA4Ca,SAA5C,EAAmE;EACjE,KAAK,MAAMf,CAAX,IAAgBE,IAAhB,EAAsB;IACpB,IAAI,CAACa,SAAS,CAACf,CAAD,CAAd,EAAmB;MACjB,OAAO,KAAP;IACD;EACF;;EACD,OAAO,IAAP;AACD;AAED;;;;;;;AAKA,OAAM,SAAUmD,aAAV,CAA2BjD,IAA3B,EAA6CkD,IAA7C,EAA8D;EAClE,MAAMlC,GAAG,GAAGvC,OAAQuB,IAAI,CAACnC,MAAb,CAAZ;EAEA,OAAOe,cAAY4B,CAAD,IAAM;IACtB,KAAK,MAAMwC,CAAX,IAAgBE,IAAhB,EAAsB;MACpB,IAAI3D,MAAKS,IAAL,EAAWgD,CAAX,CAAJ,EAAmB;QACjBhE,SAAMgE,CAAN;MACD;IACF;EACF,CANM,CAAP;AAOD;AAED;;;;;;AAKA,OAAM,SAAUG,SAAV,CAAuB5C,CAAvB,EAAsCC,CAAtC,EAAmD;EACvD,OAAO4C,QAAO7C,CAAP,EAAWjB,CAAD,IAAUC,MAAKiB,CAAL,EAAQlB,CAAR,CAApB,CAAP;AACD;AAED;;;;;;AAKA,OAAM,SAAU+D,OAAV,CAAqB3F,GAArB,EAAsCmD,SAAtC,EAA6D;EACjE,IAAIyC,KAAK,GAAG,KAAZ;;EACA,KAAK,MAAMxD,CAAX,IAAgBpC,GAAhB,EAAqB;IACnB4F,KAAK,GAAGzC,SAAS,CAACf,CAAD,CAAjB;;IACA,IAAIwD,KAAJ,EAAW;MACT;IACD;EACF;;EACD,OAAOA,KAAP;AACD;AAED;;;;;;;;AAOA,OAAM,SAAUC,MAAV,CAAoBC,CAApB,EAAmC7D,CAAnC,EAAiD;EACrD,OAAOf,SAAQ4E,CAAR,EAAYjD,CAAD,IAAM;IACtB,KAAK,MAAMjB,CAAX,IAAgBK,CAAhB,EAAmB;MACjBX,MAAKuB,CAAL,EAAQjB,CAAR;IACD;EACF,CAJM,CAAP;AAKD;AAED;;;;AAGA,OAAM,SAAUmE,QAAV,CAAsB/F,GAAtB,EAAuCgG,CAAvC,EAAkD;EACtD,MAAM/D,CAAC,GAAa,EAApB;EACAE,eAAaP,CAAD,IAAOK,CAAC,CAACoC,IAAF,CAAOzC,CAAP,CAAnB;EACA,OAAOK,CAAC,CAACgE,IAAF,CAAOD,CAAC,CAACE,QAAT,CAAP;AACD;AAED;;;;;;AAMA,SAASC,OAAT,CAAoBnG,GAApB,EAAqCoG,OAArC,EAAuDC,OAAvD,EAAsE;EACpE,IAAIrG,GAAG,CAACQ,SAAR,EAAmB;IACjBR,GAAG,CAACM,KAAJ,GAAY8F,OAAZ;IACApG,GAAG,CAACO,KAAJ,GAAY8F,OAAZ;IACA,OAAOrG,GAAP;EACD;;EACD,OAAOoG,OAAO,KAAKpG,GAAG,CAACM,KAAhB,GAAwBN,GAAxB,GAA8B,IAAIJ,OAAJ,CAAYI,GAAG,CAACQ,SAAhB,EAA2BR,GAAG,CAACK,KAA/B,EAAsCL,GAAG,CAACG,MAA1C,EAAkDiG,OAAlD,EAA2DC,OAA3D,CAArC;AACD;;AAED,SAASnG,UAAT,CAAuBF,GAAvB,EAAwCC,KAAxC,EAAkDG,IAAlD,EAAgEkG,MAAhE,EAA+E;EAC7E,MAAMlH,IAAI,GAAM;IAAEa,KAAK,EAAED,GAAG,CAACO;EAAb,CAAhB;;EACA,MAAM6F,OAAO,GAAGpG,GAAG,CAACM,KAAJ,CAAUiG,MAAV,CAAiBD,MAAjB,EAAyBtG,GAAG,CAACQ,SAAJ,GAAgBR,GAAG,CAACK,KAApB,GAA4BmG,GAArD,EAA0DxG,GAAG,CAACG,MAAJ,CAAWyC,OAArE,EAA8E,CAA9E,EAAiFxC,IAAjF,EAAuFH,KAAvF,EAA8Fb,IAA9F,CAAhB;;EACA,OAAO+G,OAAO,CAACnG,GAAD,EAAMoG,OAAN,EAAehH,IAAI,CAACa,KAApB,CAAd;AACD;;AAED,SAASwG,UAAT,CAAuBzG,GAAvB,EAAwCC,KAAxC,EAAkDG,IAAlD,EAA8D;EAC5D,IAAIsG,IAAI,GAAI1G,GAAG,CAACM,KAAhB;EACA,IAAIqG,KAAK,GAAG,CAAZ;EACA,MAAM3D,EAAE,GAAIhD,GAAG,CAACG,MAAJ,CAAWyC,OAAvB,CAH4D,CAK5D;;EACA,OAAO,IAAP,EAAa;IACX,QAAQ8D,IAAI,CAACxC,IAAb;MACE,KAAK,UAAL;QAAiB;UACf,OAAOlB,EAAE,CAAC0D,IAAI,CAACzG,KAAN,EAAaA,KAAb,CAAF,GAAwB2G,qBAAKF,IAAI,CAACzG,KAAV,CAAxB,GAA2C2G,yBAAlD;QACD;;MACD,KAAK,eAAL;QAAsB;UACpB,IAAIxG,IAAI,KAAKsG,IAAI,CAACtG,IAAlB,EAAwB;YACtB,MAAMkE,QAAQ,GAAGoC,IAAI,CAACpC,QAAtB;;YACA,KAAK,IAAIG,CAAC,GAAG,CAAR,EAAWC,GAAG,GAAGJ,QAAQ,CAACK,MAA/B,EAAuCF,CAAC,GAAGC,GAA3C,EAAgD,EAAED,CAAlD,EAAqD;cACnD,MAAMG,KAAK,GAAGN,QAAQ,CAACG,CAAD,CAAtB;cACA,IAAI,WAAWG,KAAX,IAAoB5B,EAAE,CAAC4B,KAAK,CAAC3E,KAAP,EAAcA,KAAd,CAA1B,EAAgD,OAAO2G,qBAAKhC,KAAK,CAAC3E,KAAX,CAAP;YACjD;UACF;;UACD,OAAO2G,yBAAP;QACD;;MACD,KAAK,WAAL;QAAkB;UAChB,MAAMC,IAAI,GAAGrH,YAAY,CAACmH,KAAD,EAAQvG,IAAR,CAAzB;UACA,MAAM0G,GAAG,GAAIpH,QAAQ,CAACmH,IAAD,CAArB;;UACA,IAAIH,IAAI,CAACK,IAAL,GAAYD,GAAhB,EAAqB;YACnBJ,IAAI,GAAKA,IAAI,CAACpC,QAAL,CAAc/E,UAAU,CAACmH,IAAI,CAACK,IAAN,EAAYD,GAAZ,CAAxB,CAAT;YACAH,KAAK,IAAIlH,IAAT;YACA;UACD;;UACD,OAAOmH,yBAAP;QACD;;MACD,KAAK,WAAL;QAAkB;UAChBF,IAAI,GAAGA,IAAI,CAACpC,QAAL,CAAc9E,YAAY,CAACmH,KAAD,EAAQvG,IAAR,CAA1B,CAAP;;UACA,IAAIsG,IAAJ,EAAU;YACRC,KAAK,IAAIlH,IAAT;YACA;UACD;;UACD,OAAOmH,yBAAP;QACD;;MACD;QAAS;UACP,OAAOA,yBAAP;QACD;IAlCH;EAoCD;AACF;;AAED,SAAS9F,OAAT,CAAoBd,GAApB,EAAqCC,KAArC,EAA+CG,IAA/C,EAA2D;EACzD,OAAOoD,iCAAU,CAACxD,GAAD,EAAMC,KAAN,EAAaG,IAAb,CAAV,CAAP;AACD","names":["add_","beginMutation","endMutation","forEach_","has_","make","makeDefault","mutate_","remove_","size","foldLeft_","every_","fromBitmap","hashFragment","SIZE","toBitmap","_EmptyNode","HashSet","isEmptyNode","tuple","P","set","value","modifyHash","config","hash","_edit","_root","_size","_editable","map","f","foldLeft_1","undefined","_","hasHash","make_1","fromDefault","values","mutate_1","makeDefault_1","forEach","v","add_1","transient","s","beginMutation_1","endMutation_1","toggle_","a","has_1","remove_1","map_","C","r","fa","forEach_1","e","mapDefault","self","tsplus_module_1","flatMap_","flatMapDefault","getEq","tsplus_module_2","equals_","x","y","size_1","eq","vx","filter_","predicate","filterMap_","B","out","ob","tsplus_module_3","partition_","p","right","left","partitionMap_","tsplus_module_4","b","c","root","_tag","toVisit","tsplus_module_5","push","children","hasNext","pop","i","len","length","child","join_","separator","iterator","Symbol","first","result","next","done","difference_","k","intersection_","that","isSubset_","every_1","exists_","found","union_","l","toArray_","O","sort","compare_","setTree","newRoot","newSize","remove","modify","NaN","tryGetHash","node","shift","tsplus_module_6","frag","bit","mask"],"sourceRoot":"","sources":["../../../../_src/collection/immutable/HashSet/api.ts"],"sourcesContent":[null]}