recursive-set 1.0.1 → 2.0.0

package/README.md

@@ -21,6 +21,20 @@ Supports arbitrary nesting, detects cycles (Foundation axiom), and includes all
 
 ---
 
+## Implementation Details
+
+This library enforces strict **ZFC Set Theory** semantics, differing from native JavaScript `Set`s:
+
+- **Extensionality:** Two sets are considered equal if they contain the same elements, regardless of object reference identity.
+  - Example: `new RecursiveSet(1).equals(new RecursiveSet(1))` is `true`.
+  - Native `Set` would treat them as distinct objects.
+- **Foundation Axiom:** The library performs cycle detection to prevent sets from containing themselves (recursively).
+- **Performance:** Internally powered by **Functional Red-Black Trees** (via `functional-red-black-tree`).
+  - Operations like insertion, deletion, and lookup are **O(log n)**.
+  - This allows for stable ordering and efficient deep comparison of nested sets.
+
+---
+
 ## Installation
 
 ```

package/dist/cjs/index.js

@@ -0,0 +1,229 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RecursiveSet = void 0;
+exports.emptySet = emptySet;
+exports.singleton = singleton;
+exports.fromIterable = fromIterable;
+const functional_red_black_tree_1 = __importDefault(require("functional-red-black-tree"));
+/**
+ * @module recursive-set
+ * A mutable recursive set implementation enforcing Cantor's ZFC axioms
+ * Powered by Red-Black Trees for O(log n) operations
+ */
+/**
+ * Comparator function for ZFC sets
+ * Returns -1 if a < b, 1 if a > b, 0 if a == b (structural equality)
+ */
+function compare(a, b) {
+    // 1. Identity optimization
+    if (a === b)
+        return 0;
+    // 2. Type separation: Sets are "greater" than primitives
+    const isSetA = a instanceof RecursiveSet;
+    const isSetB = b instanceof RecursiveSet;
+    if (isSetA !== isSetB)
+        return isSetA ? 1 : -1;
+    // 3. Primitives
+    if (!isSetA) {
+        if (typeof a !== typeof b) {
+            return typeof a > typeof b ? 1 : -1;
+        }
+        return a < b ? -1 : 1;
+    }
+    // 4. Recursive Sets
+    const sizeA = a.size;
+    const sizeB = b.size;
+    if (sizeA !== sizeB)
+        return sizeA < sizeB ? -1 : 1;
+    // Lexicographical comparison
+    const itA = a[Symbol.iterator]();
+    const itB = b[Symbol.iterator]();
+    let nextA = itA.next();
+    let nextB = itB.next();
+    while (!nextA.done) {
+        const cmp = compare(nextA.value, nextB.value);
+        if (cmp !== 0)
+            return cmp;
+        nextA = itA.next();
+        nextB = itB.next();
+    }
+    return 0;
+}
+class RecursiveSet {
+    // Red-Black Tree (immutable structure, we replace on mutation)
+    _tree; // Type from functional-red-black-tree
+    constructor(...elements) {
+        this._tree = (0, functional_red_black_tree_1.default)(compare);
+        for (const el of elements) {
+            this.add(el);
+        }
+    }
+    // === Mutable Operations ===
+    add(element) {
+        if (element instanceof RecursiveSet) {
+            if (!this.has(element)) {
+                if (this._wouldCreateCycle(element)) {
+                    throw new Error("Foundation axiom violated: membership cycle detected");
+                }
+            }
+        }
+        // Immutable insert - returns new tree
+        // We replace our internal tree (mutable API, immutable data structure)
+        this._tree = this._tree.insert(element, true);
+        return this;
+    }
+    remove(element) {
+        this._tree = this._tree.remove(element);
+        return this;
+    }
+    clear() {
+        this._tree = (0, functional_red_black_tree_1.default)(compare);
+        return this;
+    }
+    // === Immutable Operations ===
+    union(other) {
+        const result = new RecursiveSet();
+        for (const el of this)
+            result.add(el);
+        for (const el of other)
+            result.add(el);
+        return result;
+    }
+    intersection(other) {
+        const result = new RecursiveSet();
+        for (const el of this) {
+            if (other.has(el)) {
+                result.add(el);
+            }
+        }
+        return result;
+    }
+    difference(other) {
+        const result = new RecursiveSet();
+        for (const el of this) {
+            if (!other.has(el)) {
+                result.add(el);
+            }
+        }
+        return result;
+    }
+    symmetricDifference(other) {
+        return this.union(other).difference(this.intersection(other));
+    }
+    powerset() {
+        const elements = [];
+        this._tree.forEach((key) => elements.push(key));
+        const subsets = [];
+        const n = elements.length;
+        for (let i = 0; i < (1 << n); i++) {
+            const subset = new RecursiveSet();
+            for (let j = 0; j < n; j++) {
+                if (i & (1 << j)) {
+                    subset.add(elements[j]);
+                }
+            }
+            subsets.push(subset);
+        }
+        return new RecursiveSet(...subsets);
+    }
+    cartesianProduct(other) {
+        const pairs = [];
+        for (const x of this) {
+            for (const y of other) {
+                const valX = x;
+                const valY = y;
+                const pair = new RecursiveSet(new RecursiveSet(valX), new RecursiveSet(valX, valY));
+                pairs.push(pair);
+            }
+        }
+        return new RecursiveSet(...pairs);
+    }
+    // === Predicates ===
+    has(element) {
+        return this._tree.get(element) !== undefined;
+    }
+    isSubset(other) {
+        for (const el of this) {
+            if (!other.has(el))
+                return false;
+        }
+        return true;
+    }
+    isSuperset(other) {
+        return other.isSubset(this);
+    }
+    isProperSubset(other) {
+        return this.isSubset(other) && !this.equals(other);
+    }
+    isEmpty() {
+        return this.size === 0;
+    }
+    equals(other) {
+        return compare(this, other) === 0;
+    }
+    // === Internals ===
+    _wouldCreateCycle(element) {
+        const visited = new Set();
+        const stack = [element];
+        while (stack.length > 0) {
+            const current = stack.pop();
+            if (current === this)
+                return true;
+            if (visited.has(current))
+                continue;
+            visited.add(current);
+            for (const child of current) {
+                if (child instanceof RecursiveSet) {
+                    stack.push(child);
+                }
+            }
+        }
+        return false;
+    }
+    // === Utility ===
+    get size() {
+        return this._tree.length;
+    }
+    toSet() {
+        const result = new Set();
+        this._tree.forEach((key) => result.add(key));
+        return result;
+    }
+    *[Symbol.iterator]() {
+        const keys = [];
+        this._tree.forEach((key) => keys.push(key));
+        yield* keys;
+    }
+    toString() {
+        if (this.isEmpty())
+            return "∅";
+        const elements = [];
+        this._tree.forEach((key) => {
+            if (key instanceof RecursiveSet) {
+                elements.push(key.toString());
+            }
+            else {
+                elements.push(String(key));
+            }
+        });
+        return `{${elements.join(", ")}}`;
+    }
+    [Symbol.for('nodejs.util.inspect.custom')]() {
+        return this.toString();
+    }
+}
+exports.RecursiveSet = RecursiveSet;
+// === Helpers ===
+function emptySet() {
+    return new RecursiveSet();
+}
+function singleton(element) {
+    return new RecursiveSet(element);
+}
+function fromIterable(iterable) {
+    return new RecursiveSet(...iterable);
+}
+//# sourceMappingURL=index.js.map

package/dist/cjs/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;AA0PA,4BAEC;AAED,8BAEC;AAED,oCAEC;AApQD,0FAAmD;AAEnD;;;;GAIG;AAEH;;;GAGG;AACH,SAAS,OAAO,CAAC,CAAM,EAAE,CAAM;IAC3B,2BAA2B;IAC3B,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEtB,yDAAyD;IACzD,MAAM,MAAM,GAAG,CAAC,YAAY,YAAY,CAAC;IACzC,MAAM,MAAM,GAAG,CAAC,YAAY,YAAY,CAAC;IACzC,IAAI,MAAM,KAAK,MAAM;QAAE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9C,gBAAgB;IAChB,IAAI,CAAC,MAAM,EAAE,CAAC;QACV,IAAI,OAAO,CAAC,KAAK,OAAO,CAAC,EAAE,CAAC;YACxB,OAAO,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IAED,oBAAoB;IACpB,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC;IACrB,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC;IACrB,IAAI,KAAK,KAAK,KAAK;QAAE,OAAO,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnD,6BAA6B;IAC7B,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACjC,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IAEjC,IAAI,KAAK,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IACvB,IAAI,KAAK,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAEvB,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAI,GAAG,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QAC1B,KAAK,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IACvB,CAAC;IAED,OAAO,CAAC,CAAC;AACb,CAAC;AAED,MAAa,YAAY;IACrB,+DAA+D;IACvD,KAAK,CAAM,CAAC,sCAAsC;IAE1D,YAAY,GAAG,QAAoC;QAC/C,IAAI,CAAC,KAAK,GAAG,IAAA,mCAAU,EAAC,OAAO,CAAC,CAAC;QAEjC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YACxB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;IACL,CAAC;IAED,6BAA6B;IAE7B,GAAG,CAAC,OAA4B;QAC5B,IAAI,OAAO,YAAY,YAAY,EAAE,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBACrB,IAAI,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC;oBAClC,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;gBAC5E,CAAC;YACL,CAAC;QACL,CAAC;QAED,sCAAsC;QACtC,uEAAuE;QACvE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC9C,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,CAAC,OAA4B;QAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,KAAK;QACD,IAAI,CAAC,KAAK,GAAG,IAAA,mCAAU,EAAC,OAAO,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,+BAA+B;IAE/B,KAAK,CAAC,KAAsB;QACxB,MAAM,MAAM,GAAG,IAAI,YAAY,EAAK,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,IAAI;YAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACtC,KAAK,MAAM,EAAE,IAAI,KAAK;YAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvC,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,YAAY,CAAC,KAAsB;QAC/B,MAAM,MAAM,GAAG,IAAI,YAAY,EAAK,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,UAAU,CAAC,KAAsB;QAC7B,MAAM,MAAM,GAAG,IAAI,YAAY,EAAK,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACjB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,mBAAmB,CAAC,KAAsB;QACtC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,QAAQ;QACJ,MAAM,QAAQ,GAA+B,EAAE,CAAC;QAChD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAErD,MAAM,OAAO,GAAsB,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;QAE1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAI,YAAY,EAAK,CAAC;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;oBACf,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5B,CAAC;YACL,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzB,CAAC;QACD,OAAO,IAAI,YAAY,CAAkB,GAAG,OAAO,CAAC,CAAC;IACzD,CAAC;IAED,gBAAgB,CAAI,KAAsB;QACtC,MAAM,KAAK,GAA0B,EAAE,CAAC;QAIxC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACnB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACpB,MAAM,IAAI,GAAG,CAAe,CAAC;gBAC7B,MAAM,IAAI,GAAG,CAAe,CAAC;gBAE7B,MAAM,IAAI,GAAG,IAAI,YAAY,CACzB,IAAI,YAAY,CAAQ,IAAI,CAAC,EAC7B,IAAI,YAAY,CAAQ,IAAI,EAAE,IAAI,CAAC,CACtC,CAAC;gBACF,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;QACL,CAAC;QACD,OAAO,IAAI,YAAY,CAAsB,GAAG,KAAK,CAAC,CAAC;IAC3D,CAAC;IAED,qBAAqB;IAErB,GAAG,CAAC,OAA4B;QAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC;IACjD,CAAC;IAED,QAAQ,CAAC,KAAsB;QAC3B,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,OAAO,KAAK,CAAC;QACrC,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,UAAU,CAAC,KAAsB;QAC7B,OAAO,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,cAAc,CAAC,KAAsB;QACjC,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC;IAED,OAAO;QACH,OAAO,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,MAAM,CAAC,KAAsB;QACzB,OAAO,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC;IAED,oBAAoB;IAEZ,iBAAiB,CAAC,OAAwB;QAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC7C,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC;QAExB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAC7B,IAAI,OAAO,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC;YAElC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YACnC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAErB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC1B,IAAI,KAAK,YAAY,YAAY,EAAE,CAAC;oBAChC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACtB,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,kBAAkB;IAElB,IAAI,IAAI;QACJ,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED,KAAK;QACD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC9C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QACd,MAAM,IAAI,GAA+B,EAAE,CAAC;QAC5C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,KAAK,CAAC,CAAC,IAAI,CAAC;IAChB,CAAC;IAED,QAAQ;QACJ,IAAI,IAAI,CAAC,OAAO,EAAE;YAAE,OAAO,GAAG,CAAC;QAC/B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAQ,EAAE,EAAE;YAC5B,IAAI,GAAG,YAAY,YAAY,EAAE,CAAC;gBAC9B,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;YAClC,CAAC;iBAAM,CAAC;gBACJ,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/B,CAAC;QACL,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IACtC,CAAC;IAED,CAAC,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC;CACJ;AApMD,oCAoMC;AAED,kBAAkB;AAClB,SAAgB,QAAQ;IACpB,OAAO,IAAI,YAAY,EAAK,CAAC;AACjC,CAAC;AAED,SAAgB,SAAS,CAAI,OAAU;IACnC,OAAO,IAAI,YAAY,CAAI,OAAO,CAAC,CAAC;AACxC,CAAC;AAED,SAAgB,YAAY,CAAI,QAAqB;IACjD,OAAO,IAAI,YAAY,CAAI,GAAG,QAAQ,CAAC,CAAC;AAC5C,CAAC"}

package/dist/cjs/package.json

@@ -0,0 +1,3 @@
+{
+  "type": "commonjs"
+}

package/dist/esm/index.d.ts

@@ -0,0 +1,28 @@
+export declare class RecursiveSet<T = any> {
+    private _tree;
+    constructor(...elements: Array<T | RecursiveSet<T>>);
+    add(element: T | RecursiveSet<T>): this;
+    remove(element: T | RecursiveSet<T>): this;
+    clear(): this;
+    union(other: RecursiveSet<T>): RecursiveSet<T>;
+    intersection(other: RecursiveSet<T>): RecursiveSet<T>;
+    difference(other: RecursiveSet<T>): RecursiveSet<T>;
+    symmetricDifference(other: RecursiveSet<T>): RecursiveSet<T>;
+    powerset(): RecursiveSet<RecursiveSet<T>>;
+    cartesianProduct<U>(other: RecursiveSet<U>): RecursiveSet<RecursiveSet<T | U>>;
+    has(element: T | RecursiveSet<T>): boolean;
+    isSubset(other: RecursiveSet<T>): boolean;
+    isSuperset(other: RecursiveSet<T>): boolean;
+    isProperSubset(other: RecursiveSet<T>): boolean;
+    isEmpty(): boolean;
+    equals(other: RecursiveSet<T>): boolean;
+    private _wouldCreateCycle;
+    get size(): number;
+    toSet(): Set<T | RecursiveSet<T>>;
+    [Symbol.iterator](): Iterator<T | RecursiveSet<T>>;
+    toString(): string;
+}
+export declare function emptySet<T = any>(): RecursiveSet<T>;
+export declare function singleton<T>(element: T): RecursiveSet<T>;
+export declare function fromIterable<T>(iterable: Iterable<T>): RecursiveSet<T>;
+//# sourceMappingURL=index.d.ts.map

package/dist/esm/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAmDA,qBAAa,YAAY,CAAC,CAAC,GAAG,GAAG;IAE7B,OAAO,CAAC,KAAK,CAAM;gBAEP,GAAG,QAAQ,EAAE,KAAK,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAUnD,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI;IAevC,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI;IAK1C,KAAK,IAAI,IAAI;IAOb,KAAK,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IAO9C,YAAY,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IAUrD,UAAU,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IAUnD,mBAAmB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IAI5D,QAAQ,IAAI,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAmBzC,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAsB9E,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IAI1C,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IAOzC,UAAU,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IAI3C,cAAc,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IAI/C,OAAO,IAAI,OAAO;IAIlB,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IAMvC,OAAO,CAAC,iBAAiB;IAsBzB,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,KAAK,IAAI,GAAG,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAMhC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAMnD,QAAQ,IAAI,MAAM;CAgBrB;AAGD,wBAAgB,QAAQ,CAAC,CAAC,GAAG,GAAG,KAAK,YAAY,CAAC,CAAC,CAAC,CAEnD;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAExD;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAEtE"}

package/dist/esm/index.js

@@ -0,0 +1,219 @@
+import createTree from 'functional-red-black-tree';
+/**
+ * @module recursive-set
+ * A mutable recursive set implementation enforcing Cantor's ZFC axioms
+ * Powered by Red-Black Trees for O(log n) operations
+ */
+/**
+ * Comparator function for ZFC sets
+ * Returns -1 if a < b, 1 if a > b, 0 if a == b (structural equality)
+ */
+function compare(a, b) {
+    // 1. Identity optimization
+    if (a === b)
+        return 0;
+    // 2. Type separation: Sets are "greater" than primitives
+    const isSetA = a instanceof RecursiveSet;
+    const isSetB = b instanceof RecursiveSet;
+    if (isSetA !== isSetB)
+        return isSetA ? 1 : -1;
+    // 3. Primitives
+    if (!isSetA) {
+        if (typeof a !== typeof b) {
+            return typeof a > typeof b ? 1 : -1;
+        }
+        return a < b ? -1 : 1;
+    }
+    // 4. Recursive Sets
+    const sizeA = a.size;
+    const sizeB = b.size;
+    if (sizeA !== sizeB)
+        return sizeA < sizeB ? -1 : 1;
+    // Lexicographical comparison
+    const itA = a[Symbol.iterator]();
+    const itB = b[Symbol.iterator]();
+    let nextA = itA.next();
+    let nextB = itB.next();
+    while (!nextA.done) {
+        const cmp = compare(nextA.value, nextB.value);
+        if (cmp !== 0)
+            return cmp;
+        nextA = itA.next();
+        nextB = itB.next();
+    }
+    return 0;
+}
+export class RecursiveSet {
+    // Red-Black Tree (immutable structure, we replace on mutation)
+    _tree; // Type from functional-red-black-tree
+    constructor(...elements) {
+        this._tree = createTree(compare);
+        for (const el of elements) {
+            this.add(el);
+        }
+    }
+    // === Mutable Operations ===
+    add(element) {
+        if (element instanceof RecursiveSet) {
+            if (!this.has(element)) {
+                if (this._wouldCreateCycle(element)) {
+                    throw new Error("Foundation axiom violated: membership cycle detected");
+                }
+            }
+        }
+        // Immutable insert - returns new tree
+        // We replace our internal tree (mutable API, immutable data structure)
+        this._tree = this._tree.insert(element, true);
+        return this;
+    }
+    remove(element) {
+        this._tree = this._tree.remove(element);
+        return this;
+    }
+    clear() {
+        this._tree = createTree(compare);
+        return this;
+    }
+    // === Immutable Operations ===
+    union(other) {
+        const result = new RecursiveSet();
+        for (const el of this)
+            result.add(el);
+        for (const el of other)
+            result.add(el);
+        return result;
+    }
+    intersection(other) {
+        const result = new RecursiveSet();
+        for (const el of this) {
+            if (other.has(el)) {
+                result.add(el);
+            }
+        }
+        return result;
+    }
+    difference(other) {
+        const result = new RecursiveSet();
+        for (const el of this) {
+            if (!other.has(el)) {
+                result.add(el);
+            }
+        }
+        return result;
+    }
+    symmetricDifference(other) {
+        return this.union(other).difference(this.intersection(other));
+    }
+    powerset() {
+        const elements = [];
+        this._tree.forEach((key) => elements.push(key));
+        const subsets = [];
+        const n = elements.length;
+        for (let i = 0; i < (1 << n); i++) {
+            const subset = new RecursiveSet();
+            for (let j = 0; j < n; j++) {
+                if (i & (1 << j)) {
+                    subset.add(elements[j]);
+                }
+            }
+            subsets.push(subset);
+        }
+        return new RecursiveSet(...subsets);
+    }
+    cartesianProduct(other) {
+        const pairs = [];
+        for (const x of this) {
+            for (const y of other) {
+                const valX = x;
+                const valY = y;
+                const pair = new RecursiveSet(new RecursiveSet(valX), new RecursiveSet(valX, valY));
+                pairs.push(pair);
+            }
+        }
+        return new RecursiveSet(...pairs);
+    }
+    // === Predicates ===
+    has(element) {
+        return this._tree.get(element) !== undefined;
+    }
+    isSubset(other) {
+        for (const el of this) {
+            if (!other.has(el))
+                return false;
+        }
+        return true;
+    }
+    isSuperset(other) {
+        return other.isSubset(this);
+    }
+    isProperSubset(other) {
+        return this.isSubset(other) && !this.equals(other);
+    }
+    isEmpty() {
+        return this.size === 0;
+    }
+    equals(other) {
+        return compare(this, other) === 0;
+    }
+    // === Internals ===
+    _wouldCreateCycle(element) {
+        const visited = new Set();
+        const stack = [element];
+        while (stack.length > 0) {
+            const current = stack.pop();
+            if (current === this)
+                return true;
+            if (visited.has(current))
+                continue;
+            visited.add(current);
+            for (const child of current) {
+                if (child instanceof RecursiveSet) {
+                    stack.push(child);
+                }
+            }
+        }
+        return false;
+    }
+    // === Utility ===
+    get size() {
+        return this._tree.length;
+    }
+    toSet() {
+        const result = new Set();
+        this._tree.forEach((key) => result.add(key));
+        return result;
+    }
+    *[Symbol.iterator]() {
+        const keys = [];
+        this._tree.forEach((key) => keys.push(key));
+        yield* keys;
+    }
+    toString() {
+        if (this.isEmpty())
+            return "∅";
+        const elements = [];
+        this._tree.forEach((key) => {
+            if (key instanceof RecursiveSet) {
+                elements.push(key.toString());
+            }
+            else {
+                elements.push(String(key));
+            }
+        });
+        return `{${elements.join(", ")}}`;
+    }
+    [Symbol.for('nodejs.util.inspect.custom')]() {
+        return this.toString();
+    }
+}
+// === Helpers ===
+export function emptySet() {
+    return new RecursiveSet();
+}
+export function singleton(element) {
+    return new RecursiveSet(element);
+}
+export function fromIterable(iterable) {
+    return new RecursiveSet(...iterable);
+}
+//# sourceMappingURL=index.js.map

package/dist/esm/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,UAAU,MAAM,2BAA2B,CAAC;AAEnD;;;;GAIG;AAEH;;;GAGG;AACH,SAAS,OAAO,CAAC,CAAM,EAAE,CAAM;IAC3B,2BAA2B;IAC3B,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEtB,yDAAyD;IACzD,MAAM,MAAM,GAAG,CAAC,YAAY,YAAY,CAAC;IACzC,MAAM,MAAM,GAAG,CAAC,YAAY,YAAY,CAAC;IACzC,IAAI,MAAM,KAAK,MAAM;QAAE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9C,gBAAgB;IAChB,IAAI,CAAC,MAAM,EAAE,CAAC;QACV,IAAI,OAAO,CAAC,KAAK,OAAO,CAAC,EAAE,CAAC;YACxB,OAAO,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IAED,oBAAoB;IACpB,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC;IACrB,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC;IACrB,IAAI,KAAK,KAAK,KAAK;QAAE,OAAO,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnD,6BAA6B;IAC7B,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACjC,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IAEjC,IAAI,KAAK,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IACvB,IAAI,KAAK,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAEvB,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAI,GAAG,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QAC1B,KAAK,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IACvB,CAAC;IAED,OAAO,CAAC,CAAC;AACb,CAAC;AAED,MAAM,OAAO,YAAY;IACrB,+DAA+D;IACvD,KAAK,CAAM,CAAC,sCAAsC;IAE1D,YAAY,GAAG,QAAoC;QAC/C,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;QAEjC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YACxB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;IACL,CAAC;IAED,6BAA6B;IAE7B,GAAG,CAAC,OAA4B;QAC5B,IAAI,OAAO,YAAY,YAAY,EAAE,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBACrB,IAAI,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC;oBAClC,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;gBAC5E,CAAC;YACL,CAAC;QACL,CAAC;QAED,sCAAsC;QACtC,uEAAuE;QACvE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC9C,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,CAAC,OAA4B;QAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,KAAK;QACD,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,+BAA+B;IAE/B,KAAK,CAAC,KAAsB;QACxB,MAAM,MAAM,GAAG,IAAI,YAAY,EAAK,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,IAAI;YAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACtC,KAAK,MAAM,EAAE,IAAI,KAAK;YAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvC,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,YAAY,CAAC,KAAsB;QAC/B,MAAM,MAAM,GAAG,IAAI,YAAY,EAAK,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,UAAU,CAAC,KAAsB;QAC7B,MAAM,MAAM,GAAG,IAAI,YAAY,EAAK,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACjB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,mBAAmB,CAAC,KAAsB;QACtC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,QAAQ;QACJ,MAAM,QAAQ,GAA+B,EAAE,CAAC;QAChD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAErD,MAAM,OAAO,GAAsB,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;QAE1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAI,YAAY,EAAK,CAAC;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;oBACf,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5B,CAAC;YACL,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzB,CAAC;QACD,OAAO,IAAI,YAAY,CAAkB,GAAG,OAAO,CAAC,CAAC;IACzD,CAAC;IAED,gBAAgB,CAAI,KAAsB;QACtC,MAAM,KAAK,GAA0B,EAAE,CAAC;QAIxC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACnB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACpB,MAAM,IAAI,GAAG,CAAe,CAAC;gBAC7B,MAAM,IAAI,GAAG,CAAe,CAAC;gBAE7B,MAAM,IAAI,GAAG,IAAI,YAAY,CACzB,IAAI,YAAY,CAAQ,IAAI,CAAC,EAC7B,IAAI,YAAY,CAAQ,IAAI,EAAE,IAAI,CAAC,CACtC,CAAC;gBACF,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;QACL,CAAC;QACD,OAAO,IAAI,YAAY,CAAsB,GAAG,KAAK,CAAC,CAAC;IAC3D,CAAC;IAED,qBAAqB;IAErB,GAAG,CAAC,OAA4B;QAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC;IACjD,CAAC;IAED,QAAQ,CAAC,KAAsB;QAC3B,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,OAAO,KAAK,CAAC;QACrC,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,UAAU,CAAC,KAAsB;QAC7B,OAAO,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,cAAc,CAAC,KAAsB;QACjC,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC;IAED,OAAO;QACH,OAAO,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,MAAM,CAAC,KAAsB;QACzB,OAAO,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC;IAED,oBAAoB;IAEZ,iBAAiB,CAAC,OAAwB;QAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC7C,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC;QAExB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAC7B,IAAI,OAAO,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC;YAElC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YACnC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAErB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC1B,IAAI,KAAK,YAAY,YAAY,EAAE,CAAC;oBAChC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACtB,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,kBAAkB;IAElB,IAAI,IAAI;QACJ,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED,KAAK;QACD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC9C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QACd,MAAM,IAAI,GAA+B,EAAE,CAAC;QAC5C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,KAAK,CAAC,CAAC,IAAI,CAAC;IAChB,CAAC;IAED,QAAQ;QACJ,IAAI,IAAI,CAAC,OAAO,EAAE;YAAE,OAAO,GAAG,CAAC;QAC/B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAQ,EAAE,EAAE;YAC5B,IAAI,GAAG,YAAY,YAAY,EAAE,CAAC;gBAC9B,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;YAClC,CAAC;iBAAM,CAAC;gBACJ,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/B,CAAC;QACL,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IACtC,CAAC;IAED,CAAC,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC;CACJ;AAED,kBAAkB;AAClB,MAAM,UAAU,QAAQ;IACpB,OAAO,IAAI,YAAY,EAAK,CAAC;AACjC,CAAC;AAED,MAAM,UAAU,SAAS,CAAI,OAAU;IACnC,OAAO,IAAI,YAAY,CAAI,OAAO,CAAC,CAAC;AACxC,CAAC;AAED,MAAM,UAAU,YAAY,CAAI,QAAqB;IACjD,OAAO,IAAI,YAAY,CAAI,GAAG,QAAQ,CAAC,CAAC;AAC5C,CAAC"}

package/package.json

@@ -1,14 +1,15 @@
 {
   "name": "recursive-set",
-  "version": "1.0.1",
+  "version": "2.0.0",
   "description": "Mutable recursive sets with ZFC axioms for TypeScript",
-  "main": "./dist/index.js",
-  "types": "./dist/index.d.ts",
+  "main": "./dist/cjs/index.js",
+  "types": "./dist/esm/index.d.ts",
   "type": "module",
   "exports": {
     ".": {
-      "types": "./dist/index.d.ts",
-      "import": "./dist/index.js"
+      "types": "./dist/esm/index.d.ts",
+      "import": "./dist/esm/index.js",
+      "require": "./dist/cjs/index.js"
     }
   },
   "files": [
@@ -16,9 +17,9 @@
   ],
   "scripts": {
     "prepublishOnly": "npm run build",
-    "build": "tsc",
+    "build": "rimraf dist && tsc -p tsconfig.json && tsc -p tsconfig.cjs.json && node scripts/postbuild.cjs",
     "watch": "tsc --watch",
-    "clean": "rm -rf dist",
+    "clean": "rimraf dist",
     "test": "tsx test.ts"
   },
   "keywords": [
@@ -42,8 +43,13 @@
   },
   "homepage": "https://github.com/cstrerath/recursive-set#readme",
   "devDependencies": {
+    "@types/functional-red-black-tree": "^1.0.6",
     "@types/node": "^20.0.0",
+    "rimraf": "^6.1.2",
     "tsx": "^4.20.6",
     "typescript": "^5.6.0"
+  },
+  "dependencies": {
+    "functional-red-black-tree": "^1.0.1"
   }
 }

package/dist/index.d.ts

@@ -1,129 +0,0 @@
-/**
- * @module recursive-set
- * A mutable recursive set implementation enforcing Cantor's ZFC axioms
- */
-/**
- * RecursiveSet: Mutable set with arbitrary nesting depth
- *
- * Enforced ZFC Axioms (as class invariants):
- * - Extensionality: Sets with same elements are equal
- * - Foundation (Regularity): No membership cycles allowed
- * - Power Set: Can construct 𝒫(A) for any set A
- * - Union: Can construct A ∪ B for any sets A, B
- * - Pairing: Can construct {a, b} for any elements a, b
- */
-export declare class RecursiveSet<T = any> {
-    private _elements;
-    constructor(...elements: Array<T | RecursiveSet<T>>);
-    /**
-     * Internal: Add element with cycle detection (Foundation axiom)
-     */
-    private _addElement;
-    /**
-     * Check if adding element would violate Foundation axiom
-     */
-    private _wouldCreateCycle;
-    /**
-     * Verify class invariants (Design by Contract)
-     */
-    private _checkInvariants;
-    /**
-     * Add element to this set (Pairing axiom)
-     * @returns this for method chaining
-     */
-    add(element: T | RecursiveSet<T>): this;
-    /**
-     * Remove element from this set
-     * @returns this for method chaining
-     */
-    remove(element: T | RecursiveSet<T>): this;
-    /**
-     * Remove all elements
-     * @returns this for method chaining
-     */
-    clear(): this;
-    /**
-     * Union of two sets (Union axiom)
-     * Returns A ∪ B
-     */
-    union(other: RecursiveSet<T>): RecursiveSet<T>;
-    /**
-     * Intersection of two sets
-     * Returns A ∩ B
-     */
-    intersection(other: RecursiveSet<T>): RecursiveSet<T>;
-    /**
-     * Set difference
-     * Returns A \ B (elements in A but not in B)
-     */
-    difference(other: RecursiveSet<T>): RecursiveSet<T>;
-    /**
-     * Symmetric difference
-     * Returns A △ B (elements in either but not both)
-     */
-    symmetricDifference(other: RecursiveSet<T>): RecursiveSet<T>;
-    /**
-     * Power set construction (Power Set axiom)
-     * Returns 𝒫(A) - set of all subsets
-     */
-    powerset(): RecursiveSet<RecursiveSet<T>>;
-    /**
-     * Cartesian product
-     * Returns A × B as set of ordered pairs {{a}, {a,b}}
-     */
-    cartesianProduct<U>(other: RecursiveSet<U>): RecursiveSet<RecursiveSet<T | U>>;
-    /**
-     * Check membership (∈)
-     */
-    has(element: T | RecursiveSet<T>): boolean;
-    /**
-     * Check if subset (⊆)
-     */
-    isSubset(other: RecursiveSet<T>): boolean;
-    /**
-     * Check if superset (⊇)
-     */
-    isSuperset(other: RecursiveSet<T>): boolean;
-    /**
-     * Check if proper subset (⊂)
-     */
-    isProperSubset(other: RecursiveSet<T>): boolean;
-    /**
-     * Check if empty set
-     */
-    isEmpty(): boolean;
-    /**
-     * Structural equality (Extensionality axiom)
-     * Two sets are equal iff they have the same elements
-     */
-    equals(other: RecursiveSet<T>): boolean;
-    /**
-     * Cardinality |A|
-     */
-    get size(): number;
-    /**
-     * Convert to native Set (shallow)
-     */
-    toSet(): Set<T | RecursiveSet<T>>;
-    /**
-     * Iterate over elements
-     */
-    [Symbol.iterator](): Iterator<T | RecursiveSet<T>>;
-    /**
-     * Pretty print with mathematical notation
-     */
-    toString(): string;
-}
-/**
- * Create empty set (Null Set axiom)
- */
-export declare function emptySet<T = any>(): RecursiveSet<T>;
-/**
- * Create singleton set
- */
-export declare function singleton<T>(element: T): RecursiveSet<T>;
-/**
- * Create set from iterable
- */
-export declare function fromIterable<T>(iterable: Iterable<T>): RecursiveSet<T>;
-//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;GASG;AACH,qBAAa,YAAY,CAAC,CAAC,GAAG,GAAG;IAC7B,OAAO,CAAC,SAAS,CAA2B;gBAEhC,GAAG,QAAQ,EAAE,KAAK,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAQnD;;OAEG;IACH,OAAO,CAAC,WAAW;IAWnB;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAuBzB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAaxB;;;OAGG;IACH,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI;IAMvC;;;OAGG;IACH,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI;IAK1C;;;OAGG;IACH,KAAK,IAAI,IAAI;IAOb;;;OAGG;IACH,KAAK,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IAM9C;;;OAGG;IACH,YAAY,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IAUrD;;;OAGG;IACH,UAAU,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IAUnD;;;OAGG;IACH,mBAAmB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IAI5D;;;OAGG;IACH,QAAQ,IAAI,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAmBzC;;;OAGG;IACH,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAmB9E;;OAEG;IACH,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IAI1C;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IASzC;;OAEG;IACH,UAAU,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IAI3C;;OAEG;IACH,cAAc,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IAI/C;;OAEG;IACH,OAAO,IAAI,OAAO;IAMlB;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IAyBvC;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;OAEG;IACH,KAAK,IAAI,GAAG,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAIjC;;OAEG;IACF,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAInD;;OAEG;IACH,QAAQ,IAAI,MAAM;CAqBrB;AAID;;GAEG;AACH,wBAAgB,QAAQ,CAAC,CAAC,GAAG,GAAG,KAAK,YAAY,CAAC,CAAC,CAAC,CAEnD;AAED;;GAEG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAExD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAEtE"}

package/dist/index.js

@@ -1,299 +0,0 @@
-/**
- * @module recursive-set
- * A mutable recursive set implementation enforcing Cantor's ZFC axioms
- */
-/**
- * RecursiveSet: Mutable set with arbitrary nesting depth
- *
- * Enforced ZFC Axioms (as class invariants):
- * - Extensionality: Sets with same elements are equal
- * - Foundation (Regularity): No membership cycles allowed
- * - Power Set: Can construct 𝒫(A) for any set A
- * - Union: Can construct A ∪ B for any sets A, B
- * - Pairing: Can construct {a, b} for any elements a, b
- */
-export class RecursiveSet {
-    _elements;
-    constructor(...elements) {
-        this._elements = new Set();
-        for (const el of elements) {
-            this._addElement(el);
-        }
-        this._checkInvariants();
-    }
-    /**
-     * Internal: Add element with cycle detection (Foundation axiom)
-     */
-    _addElement(el) {
-        if (el instanceof RecursiveSet) {
-            if (this._wouldCreateCycle(el)) {
-                throw new Error("Foundation axiom violated: adding this element would create a membership cycle");
-            }
-        }
-        this._elements.add(el);
-    }
-    /**
-     * Check if adding element would violate Foundation axiom
-     */
-    _wouldCreateCycle(element) {
-        const visited = new Set();
-        const toCheck = [element];
-        while (toCheck.length > 0) {
-            const current = toCheck.pop();
-            if (current === this) {
-                return true;
-            }
-            if (visited.has(current)) {
-                continue;
-            }
-            visited.add(current);
-            for (const el of current._elements) {
-                if (el instanceof RecursiveSet) {
-                    toCheck.push(el);
-                }
-            }
-        }
-        return false;
-    }
-    /**
-     * Verify class invariants (Design by Contract)
-     */
-    _checkInvariants() {
-        // Extensionality: enforced by Set semantics
-        // Foundation: enforced by _wouldCreateCycle
-        // Well-definedness: enforced by TypeScript type system
-        // Additional runtime checks can be added here
-        if (process.env.NODE_ENV === 'development') {
-            // More expensive checks only in development
-        }
-    }
-    // === Mutable Operations ===
-    /**
-     * Add element to this set (Pairing axiom)
-     * @returns this for method chaining
-     */
-    add(element) {
-        this._addElement(element);
-        this._checkInvariants();
-        return this;
-    }
-    /**
-     * Remove element from this set
-     * @returns this for method chaining
-     */
-    remove(element) {
-        this._elements.delete(element);
-        return this;
-    }
-    /**
-     * Remove all elements
-     * @returns this for method chaining
-     */
-    clear() {
-        this._elements.clear();
-        return this;
-    }
-    // === Immutable Operations (return new sets) ===
-    /**
-     * Union of two sets (Union axiom)
-     * Returns A ∪ B
-     */
-    union(other) {
-        const result = new RecursiveSet();
-        result._elements = new Set([...this._elements, ...other._elements]);
-        return result;
-    }
-    /**
-     * Intersection of two sets
-     * Returns A ∩ B
-     */
-    intersection(other) {
-        const result = new RecursiveSet();
-        for (const el of this._elements) {
-            if (other.has(el)) {
-                result._elements.add(el);
-            }
-        }
-        return result;
-    }
-    /**
-     * Set difference
-     * Returns A \ B (elements in A but not in B)
-     */
-    difference(other) {
-        const result = new RecursiveSet();
-        for (const el of this._elements) {
-            if (!other.has(el)) {
-                result._elements.add(el);
-            }
-        }
-        return result;
-    }
-    /**
-     * Symmetric difference
-     * Returns A △ B (elements in either but not both)
-     */
-    symmetricDifference(other) {
-        return this.union(other).difference(this.intersection(other));
-    }
-    /**
-     * Power set construction (Power Set axiom)
-     * Returns 𝒫(A) - set of all subsets
-     */
-    powerset() {
-        const elements = Array.from(this._elements);
-        const subsets = [];
-        // Generate all 2^n subsets
-        const n = elements.length;
-        for (let i = 0; i < (1 << n); i++) {
-            const subset = new RecursiveSet();
-            for (let j = 0; j < n; j++) {
-                if (i & (1 << j)) {
-                    subset._elements.add(elements[j]);
-                }
-            }
-            subsets.push(subset);
-        }
-        return new RecursiveSet(...subsets);
-    }
-    /**
-     * Cartesian product
-     * Returns A × B as set of ordered pairs {{a}, {a,b}}
-     */
-    cartesianProduct(other) {
-        const pairs = [];
-        for (const x of this._elements) {
-            for (const y of other._elements) {
-                // Kuratowski ordered pair: (x,y) := {{x}, {x,y}}
-                const pair = new RecursiveSet(new RecursiveSet(x), new RecursiveSet(x, y));
-                pairs.push(pair);
-            }
-        }
-        return new RecursiveSet(...pairs);
-    }
-    // === Predicates ===
-    /**
-     * Check membership (∈)
-     */
-    has(element) {
-        return this._elements.has(element);
-    }
-    /**
-     * Check if subset (⊆)
-     */
-    isSubset(other) {
-        for (const el of this._elements) {
-            if (!other.has(el)) {
-                return false;
-            }
-        }
-        return true;
-    }
-    /**
-     * Check if superset (⊇)
-     */
-    isSuperset(other) {
-        return other.isSubset(this);
-    }
-    /**
-     * Check if proper subset (⊂)
-     */
-    isProperSubset(other) {
-        return this.isSubset(other) && !this.equals(other);
-    }
-    /**
-     * Check if empty set
-     */
-    isEmpty() {
-        return this._elements.size === 0;
-    }
-    // === Extensionality (Equality) ===
-    /**
-     * Structural equality (Extensionality axiom)
-     * Two sets are equal iff they have the same elements
-     */
-    equals(other) {
-        if (this._elements.size !== other._elements.size) {
-            return false;
-        }
-        for (const el of this._elements) {
-            if (el instanceof RecursiveSet) {
-                // Deep comparison for nested sets
-                let found = false;
-                for (const otherEl of other._elements) {
-                    if (otherEl instanceof RecursiveSet && el.equals(otherEl)) {
-                        found = true;
-                        break;
-                    }
-                }
-                if (!found)
-                    return false;
-            }
-            else {
-                if (!other.has(el))
-                    return false;
-            }
-        }
-        return true;
-    }
-    // === Utility ===
-    /**
-     * Cardinality |A|
-     */
-    get size() {
-        return this._elements.size;
-    }
-    /**
-     * Convert to native Set (shallow)
-     */
-    toSet() {
-        return new Set(this._elements);
-    }
-    /**
-     * Iterate over elements
-     */
-    *[Symbol.iterator]() {
-        yield* this._elements;
-    }
-    /**
-     * Pretty print with mathematical notation
-     */
-    toString() {
-        if (this.isEmpty()) {
-            return "∅";
-        }
-        const elements = Array.from(this._elements).map(el => {
-            if (el instanceof RecursiveSet) {
-                return el.toString();
-            }
-            return String(el);
-        });
-        return `{${elements.join(", ")}}`;
-    }
-    /**
-     * For console.log
-     */
-    [Symbol.for('nodejs.util.inspect.custom')]() {
-        return this.toString();
-    }
-}
-// === Helper Functions ===
-/**
- * Create empty set (Null Set axiom)
- */
-export function emptySet() {
-    return new RecursiveSet();
-}
-/**
- * Create singleton set
- */
-export function singleton(element) {
-    return new RecursiveSet(element);
-}
-/**
- * Create set from iterable
- */
-export function fromIterable(iterable) {
-    return new RecursiveSet(...iterable);
-}
-//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;GASG;AACH,MAAM,OAAO,YAAY;IACb,SAAS,CAA2B;IAE5C,YAAY,GAAG,QAAoC;QAC/C,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;QAC3B,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YACxB,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACzB,CAAC;QACD,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,EAAuB;QACvC,IAAI,EAAE,YAAY,YAAY,EAAE,CAAC;YAC7B,IAAI,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC7B,MAAM,IAAI,KAAK,CACX,gFAAgF,CACnF,CAAC;YACN,CAAC;QACL,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,OAAwB;QAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC7C,MAAM,OAAO,GAAwB,CAAC,OAAO,CAAC,CAAC;QAE/C,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,EAAG,CAAC;YAC/B,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;gBACnB,OAAO,IAAI,CAAC;YAChB,CAAC;YACD,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBACvB,SAAS;YACb,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAErB,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;gBACjC,IAAI,EAAE,YAAY,YAAY,EAAE,CAAC;oBAC7B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrB,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,gBAAgB;QACpB,4CAA4C;QAC5C,4CAA4C;QAC5C,uDAAuD;QAEvD,8CAA8C;QAC9C,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,aAAa,EAAE,CAAC;YACzC,4CAA4C;QAChD,CAAC;IACL,CAAC;IAED,6BAA6B;IAE7B;;;OAGG;IACH,GAAG,CAAC,OAA4B;QAC5B,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAC1B,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxB,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,OAA4B;QAC/B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC/B,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,KAAK;QACD,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,iDAAiD;IAEjD;;;OAGG;IACH,KAAK,CAAC,KAAsB;QACxB,MAAM,MAAM,GAAG,IAAI,YAAY,EAAK,CAAC;QACrC,MAAM,CAAC,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;QACpE,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,KAAsB;QAC/B,MAAM,MAAM,GAAG,IAAI,YAAY,EAAK,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChB,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7B,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,KAAsB;QAC7B,MAAM,MAAM,GAAG,IAAI,YAAY,EAAK,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACjB,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7B,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;OAGG;IACH,mBAAmB,CAAC,KAAsB;QACtC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;IAClE,CAAC;IAED;;;OAGG;IACH,QAAQ;QACJ,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC5C,MAAM,OAAO,GAAsB,EAAE,CAAC;QAEtC,2BAA2B;QAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAI,YAAY,EAAK,CAAC;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;oBACf,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,CAAC;YACL,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzB,CAAC;QAED,OAAO,IAAI,YAAY,CAAkB,GAAG,OAAO,CAAC,CAAC;IACzD,CAAC;IAED;;;OAGG;IACH,gBAAgB,CAAI,KAAsB;QACtC,MAAM,KAAK,GAA0B,EAAE,CAAC;QAExC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;gBAC9B,iDAAiD;gBACjD,MAAM,IAAI,GAAG,IAAI,YAAY,CACzB,IAAI,YAAY,CAAQ,CAAC,CAAC,EAC1B,IAAI,YAAY,CAAQ,CAAC,EAAE,CAAC,CAAC,CAChC,CAAC;gBACF,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;QACL,CAAC;QAED,OAAO,IAAI,YAAY,CAAsB,GAAG,KAAK,CAAC,CAAC;IAC3D,CAAC;IAED,qBAAqB;IAErB;;OAEG;IACH,GAAG,CAAC,OAA4B;QAC5B,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,KAAsB;QAC3B,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACjB,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,KAAsB;QAC7B,OAAO,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,KAAsB;QACjC,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC;IAED;;OAEG;IACH,OAAO;QACH,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,CAAC;IACrC,CAAC;IAED,oCAAoC;IAEpC;;;OAGG;IACH,MAAM,CAAC,KAAsB;QACzB,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;YAC/C,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC9B,IAAI,EAAE,YAAY,YAAY,EAAE,CAAC;gBAC7B,kCAAkC;gBAClC,IAAI,KAAK,GAAG,KAAK,CAAC;gBAClB,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;oBACpC,IAAI,OAAO,YAAY,YAAY,IAAI,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;wBACxD,KAAK,GAAG,IAAI,CAAC;wBACb,MAAM;oBACV,CAAC;gBACL,CAAC;gBACD,IAAI,CAAC,KAAK;oBAAE,OAAO,KAAK,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACJ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,OAAO,KAAK,CAAC;YACrC,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,kBAAkB;IAElB;;OAEG;IACH,IAAI,IAAI;QACJ,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,KAAK;QACD,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QACd,KAAK,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,QAAQ;QACJ,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;YACjB,OAAO,GAAG,CAAC;QACf,CAAC;QAED,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YACjD,IAAI,EAAE,YAAY,YAAY,EAAE,CAAC;gBAC7B,OAAO,EAAE,CAAC,QAAQ,EAAE,CAAC;YACzB,CAAC;YACD,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,CAAC,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC;CACJ;AAED,2BAA2B;AAE3B;;GAEG;AACH,MAAM,UAAU,QAAQ;IACpB,OAAO,IAAI,YAAY,EAAK,CAAC;AACjC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS,CAAI,OAAU;IACnC,OAAO,IAAI,YAAY,CAAI,OAAO,CAAC,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAI,QAAqB;IACjD,OAAO,IAAI,YAAY,CAAI,GAAG,QAAQ,CAAC,CAAC;AAC5C,CAAC"}