fractostate 1.0.1 → 1.0.2

package/dist/cjs/src/store.js

@@ -0,0 +1,373 @@
+'use strict';
+
+/**
+ * Fast & Secure Memory Vault
+ * Ultra-performant in-memory store with deep cloning and batching
+ * NO PERSISTENCE - Pure memory for maximum safety and speed
+ */
+class SecureVault {
+    constructor() {
+        Object.defineProperty(this, "vault", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: new Map()
+        });
+        Object.defineProperty(this, "initialValues", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: new Map()
+        });
+        Object.defineProperty(this, "listeners", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: new Map()
+        });
+        Object.defineProperty(this, "histories", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: new Map()
+        });
+        Object.defineProperty(this, "redoStacks", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: new Map()
+        });
+        Object.defineProperty(this, "debounceTimers", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: new Map()
+        });
+        Object.defineProperty(this, "batchQueue", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: new Set()
+        });
+        Object.defineProperty(this, "batchScheduled", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: false
+        });
+        this.setupSecureAccess();
+        this.setupAutoCleanup();
+    }
+    /**
+     * Protects the vault instance from global window inspection.
+     */
+    setupSecureAccess() {
+        if (typeof window !== "undefined") {
+            Object.defineProperty(window, "__FRACTO_VAULT__", {
+                get: () => "🔒 Access Denied: Secure Memory Instance",
+                configurable: false,
+            });
+        }
+    }
+    /**
+     * Periodically cleans up orphaned listeners.
+     */
+    setupAutoCleanup() {
+        if (typeof setInterval !== "undefined") {
+            setInterval(() => {
+                this.listeners.forEach((set, key) => {
+                    if (set.size === 0 && !this.vault.has(key)) {
+                        this.listeners.delete(key);
+                    }
+                });
+            }, 300000); // 5 min
+        }
+    }
+    /**
+     * Lightweight but ultra-fast obfuscation for memory protection.
+     */
+    obfuscate(data) {
+        if (data === undefined)
+            return undefined;
+        try {
+            const str = JSON.stringify(data);
+            // Simple scrambling to prevent plain-text memory inspection
+            return { _: btoa(encodeURIComponent(str)), t: Date.now() };
+        }
+        catch {
+            return data;
+        }
+    }
+    /**
+     * Reverts obfuscation to retrieve original data structure.
+     */
+    deobfuscate(vaultItem) {
+        if (!vaultItem || typeof vaultItem !== "object" || !vaultItem._)
+            return vaultItem;
+        try {
+            const decoded = decodeURIComponent(atob(vaultItem._));
+            return JSON.parse(decoded);
+        }
+        catch {
+            return undefined;
+        }
+    }
+    /**
+     * Retrieves state from the vault. Initializes if a value is provided and the key is missing.
+     */
+    get(key, initialValue) {
+        if (!this.vault.has(key)) {
+            if (initialValue === undefined)
+                return undefined;
+            const cloned = deepClone(initialValue);
+            this.vault.set(key, this.obfuscate(cloned));
+            this.initialValues.set(key, deepClone(cloned));
+            this.histories.set(key, new CircularBuffer(100, [cloned]));
+            this.redoStacks.set(key, []);
+        }
+        const val = this.deobfuscate(this.vault.get(key));
+        return val === undefined ? initialValue : val;
+    }
+    /**
+     * Updates state in the vault with optional debouncing and middleware support.
+     */
+    set(key, newValue, options = {}) {
+        const prevState = this.deobfuscate(this.vault.get(key));
+        let stateToSet = deepClone(newValue);
+        // Apply synchronous middleware
+        if (options.middleware) {
+            for (const fn of options.middleware) {
+                stateToSet = fn(stateToSet);
+            }
+        }
+        // Skip update if state has not changed (Deep equality check)
+        if (deepEqual(prevState, stateToSet))
+            return;
+        if (options.debounce) {
+            this.debouncedSet(key, stateToSet, options);
+            return;
+        }
+        this.applySet(key, stateToSet, options);
+    }
+    /**
+     * Executes a debounced state update.
+     */
+    debouncedSet(key, value, options) {
+        const existing = this.debounceTimers.get(key);
+        if (existing)
+            clearTimeout(existing);
+        const timer = setTimeout(() => {
+            this.applySet(key, value, options);
+            this.debounceTimers.delete(key);
+        }, options.debounce);
+        this.debounceTimers.set(key, timer);
+    }
+    /**
+     * Core logic for applying a state update and managing history.
+     */
+    applySet(key, stateToSet, options) {
+        this.vault.set(key, this.obfuscate(stateToSet));
+        if (options.timeTravel) {
+            const history = this.histories.get(key);
+            if (history)
+                history.push(deepClone(stateToSet));
+            const redo = this.redoStacks.get(key);
+            if (redo)
+                redo.length = 0;
+        }
+        this.scheduleBatchNotify(key);
+    }
+    /**
+     * Schedules a microtask to batch notifications and optimize React renders.
+     */
+    scheduleBatchNotify(key) {
+        this.batchQueue.add(key);
+        if (this.batchScheduled)
+            return;
+        this.batchScheduled = true;
+        queueMicrotask(() => this.flushBatchNotify());
+    }
+    /**
+     * Flushes and notifies all queued listeners.
+     */
+    flushBatchNotify() {
+        const keys = Array.from(this.batchQueue);
+        this.batchQueue.clear();
+        this.batchScheduled = false;
+        keys.forEach((key) => this.notify(key));
+    }
+    /**
+     * Connects a listener to a specific flow key.
+     */
+    subscribe(key, listener) {
+        if (!this.listeners.has(key))
+            this.listeners.set(key, new Set());
+        this.listeners.get(key).add(listener);
+        return () => {
+            this.listeners.get(key)?.delete(listener);
+        };
+    }
+    /**
+     * Directly notifies all listeners of a specific key.
+     */
+    notify(key) {
+        this.listeners.get(key)?.forEach((l) => l());
+    }
+    /**
+     * Reverts the state to the previous version in history.
+     */
+    undo(key) {
+        const history = this.histories.get(key);
+        const redo = this.redoStacks.get(key);
+        if (history && history.length() > 1) {
+            const current = history.pop();
+            if (current)
+                redo?.push(current);
+            const prev = history.peek();
+            this.vault.set(key, this.obfuscate(prev));
+            this.notify(key);
+        }
+    }
+    /**
+     * Restores the state to the next version in the redo stack.
+     */
+    redo(key) {
+        const history = this.histories.get(key);
+        const redo = this.redoStacks.get(key);
+        if (redo && redo.length > 0) {
+            const next = redo.pop();
+            history?.push(next);
+            this.vault.set(key, this.obfuscate(next));
+            this.notify(key);
+        }
+    }
+    /**
+     * Resets a flow to its initial value.
+     */
+    reset(key) {
+        const initial = this.initialValues.get(key);
+        if (initial !== undefined)
+            this.set(key, initial);
+    }
+    getHistory(key) {
+        return this.histories.get(key)?.toArray() || [];
+    }
+    getRedoStack(key) {
+        return this.redoStacks.get(key) || [];
+    }
+    /**
+     * Clears the entire store and all timers.
+     */
+    clearAll() {
+        this.debounceTimers.forEach((t) => clearTimeout(t));
+        this.vault.clear();
+        this.initialValues.clear();
+        this.listeners.clear();
+        this.histories.clear();
+        this.redoStacks.clear();
+    }
+}
+/**
+ * Circular Buffer implementation for high-performance memory-efficient history.
+ */
+class CircularBuffer {
+    constructor(maxSize, initial = []) {
+        Object.defineProperty(this, "buffer", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: void 0
+        });
+        Object.defineProperty(this, "head", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: 0
+        });
+        Object.defineProperty(this, "size", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: 0
+        });
+        Object.defineProperty(this, "maxSize", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: void 0
+        });
+        this.maxSize = maxSize;
+        this.buffer = new Array(maxSize);
+        initial.forEach((i) => this.push(i));
+    }
+    push(item) {
+        this.buffer[this.head] = item;
+        this.head = (this.head + 1) % this.maxSize;
+        if (this.size < this.maxSize)
+            this.size++;
+    }
+    pop() {
+        if (this.size <= 0)
+            return undefined;
+        this.head = (this.head - 1 + this.maxSize) % this.maxSize;
+        this.size--;
+        return this.buffer[this.head];
+    }
+    peek() {
+        return this.size > 0
+            ? this.buffer[(this.head - 1 + this.maxSize) % this.maxSize]
+            : undefined;
+    }
+    length() {
+        return this.size;
+    }
+    toArray() {
+        const res = [];
+        for (let i = 0; i < this.size; i++) {
+            res.push(this.buffer[(this.head - this.size + i + this.maxSize) % this.maxSize]);
+        }
+        return res;
+    }
+}
+/**
+ * High-performance deep cloning utility.
+ */
+function deepClone(obj) {
+    if (obj === null || typeof obj !== "object")
+        return obj;
+    if (Array.isArray(obj))
+        return obj.map(deepClone);
+    const cloned = {};
+    for (const key in obj) {
+        if (Object.prototype.hasOwnProperty.call(obj, key))
+            cloned[key] = deepClone(obj[key]);
+    }
+    return cloned;
+}
+/**
+ * High-performance deep equality utility.
+ */
+function deepEqual(a, b) {
+    if (a === b)
+        return true;
+    if (typeof a !== typeof b || a === null || b === null)
+        return false;
+    if (typeof a === "object") {
+        const keysA = Object.keys(a);
+        const keysB = Object.keys(b);
+        if (keysA.length !== keysB.length)
+            return false;
+        for (const key of keysA) {
+            if (!Object.prototype.hasOwnProperty.call(b, key))
+                return false;
+            if (!deepEqual(a[key], b[key]))
+                return false;
+        }
+        return true;
+    }
+    return false;
+}
+const store = new SecureVault();
+
+exports.store = store;
+//# sourceMappingURL=store.js.map

package/dist/cjs/src/store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.js","sources":["../../../src/store.ts"],"sourcesContent":["import type { FlowOptions } from \"./types\";\n\n/**\n * Fast & Secure Memory Vault\n * Ultra-performant in-memory store with deep cloning and batching\n * NO PERSISTENCE - Pure memory for maximum safety and speed\n */\nclass SecureVault {\n  private vault = new Map<string, any>();\n  private initialValues = new Map<string, any>();\n  private listeners = new Map<string, Set<() => void>>();\n  private histories = new Map<string, CircularBuffer<any>>();\n  private redoStacks = new Map<string, any[]>();\n  private debounceTimers = new Map<string, number>();\n  private batchQueue = new Set<string>();\n  private batchScheduled = false;\n\n  constructor() {\n    this.setupSecureAccess();\n    this.setupAutoCleanup();\n  }\n\n  /**\n   * Protects the vault instance from global window inspection.\n   */\n  private setupSecureAccess() {\n    if (typeof window !== \"undefined\") {\n      Object.defineProperty(window, \"__FRACTO_VAULT__\", {\n        get: () => \"🔒 Access Denied: Secure Memory Instance\",\n        configurable: false,\n      });\n    }\n  }\n\n  /**\n   * Periodically cleans up orphaned listeners.\n   */\n  private setupAutoCleanup() {\n    if (typeof setInterval !== \"undefined\") {\n      setInterval(() => {\n        this.listeners.forEach((set, key) => {\n          if (set.size === 0 && !this.vault.has(key)) {\n            this.listeners.delete(key);\n          }\n        });\n      }, 300000); // 5 min\n    }\n  }\n\n  /**\n   * Lightweight but ultra-fast obfuscation for memory protection.\n   */\n  private obfuscate(data: any): any {\n    if (data === undefined) return undefined;\n    try {\n      const str = JSON.stringify(data);\n      // Simple scrambling to prevent plain-text memory inspection\n      return { _: btoa(encodeURIComponent(str)), t: Date.now() };\n    } catch {\n      return data;\n    }\n  }\n\n  /**\n   * Reverts obfuscation to retrieve original data structure.\n   */\n  private deobfuscate(vaultItem: any): any {\n    if (!vaultItem || typeof vaultItem !== \"object\" || !vaultItem._)\n      return vaultItem;\n    try {\n      const decoded = decodeURIComponent(atob(vaultItem._));\n      return JSON.parse(decoded);\n    } catch {\n      return undefined;\n    }\n  }\n\n  /**\n   * Retrieves state from the vault. Initializes if a value is provided and the key is missing.\n   */\n  get(key: string, initialValue?: any) {\n    if (!this.vault.has(key)) {\n      if (initialValue === undefined) return undefined;\n\n      const cloned = deepClone(initialValue);\n      this.vault.set(key, this.obfuscate(cloned));\n      this.initialValues.set(key, deepClone(cloned));\n      this.histories.set(key, new CircularBuffer(100, [cloned]));\n      this.redoStacks.set(key, []);\n    }\n\n    const val = this.deobfuscate(this.vault.get(key));\n    return val === undefined ? initialValue : val;\n  }\n\n  /**\n   * Updates state in the vault with optional debouncing and middleware support.\n   */\n  set(key: string, newValue: any, options: FlowOptions = {}) {\n    const prevState = this.deobfuscate(this.vault.get(key));\n    let stateToSet = deepClone(newValue);\n\n    // Apply synchronous middleware\n    if (options.middleware) {\n      for (const fn of options.middleware) {\n        stateToSet = fn(stateToSet);\n      }\n    }\n\n    // Skip update if state has not changed (Deep equality check)\n    if (deepEqual(prevState, stateToSet)) return;\n\n    if (options.debounce) {\n      this.debouncedSet(key, stateToSet, options);\n      return;\n    }\n\n    this.applySet(key, stateToSet, options);\n  }\n\n  /**\n   * Executes a debounced state update.\n   */\n  private debouncedSet(key: string, value: any, options: FlowOptions) {\n    const existing = this.debounceTimers.get(key);\n    if (existing) clearTimeout(existing);\n\n    const timer = setTimeout(() => {\n      this.applySet(key, value, options);\n      this.debounceTimers.delete(key);\n    }, options.debounce);\n\n    this.debounceTimers.set(key, timer as any);\n  }\n\n  /**\n   * Core logic for applying a state update and managing history.\n   */\n  private applySet(key: string, stateToSet: any, options: FlowOptions) {\n    this.vault.set(key, this.obfuscate(stateToSet));\n\n    if (options.timeTravel) {\n      const history = this.histories.get(key);\n      if (history) history.push(deepClone(stateToSet));\n      const redo = this.redoStacks.get(key);\n      if (redo) redo.length = 0;\n    }\n\n    this.scheduleBatchNotify(key);\n  }\n\n  /**\n   * Schedules a microtask to batch notifications and optimize React renders.\n   */\n  private scheduleBatchNotify(key: string) {\n    this.batchQueue.add(key);\n    if (this.batchScheduled) return;\n    this.batchScheduled = true;\n    queueMicrotask(() => this.flushBatchNotify());\n  }\n\n  /**\n   * Flushes and notifies all queued listeners.\n   */\n  private flushBatchNotify() {\n    const keys = Array.from(this.batchQueue);\n    this.batchQueue.clear();\n    this.batchScheduled = false;\n    keys.forEach((key) => this.notify(key));\n  }\n\n  /**\n   * Connects a listener to a specific flow key.\n   */\n  subscribe(key: string, listener: () => void) {\n    if (!this.listeners.has(key)) this.listeners.set(key, new Set());\n    this.listeners.get(key)!.add(listener);\n    return () => {\n      this.listeners.get(key)?.delete(listener);\n    };\n  }\n\n  /**\n   * Directly notifies all listeners of a specific key.\n   */\n  private notify(key: string) {\n    this.listeners.get(key)?.forEach((l) => l());\n  }\n\n  /**\n   * Reverts the state to the previous version in history.\n   */\n  undo(key: string) {\n    const history = this.histories.get(key);\n    const redo = this.redoStacks.get(key);\n    if (history && history.length() > 1) {\n      const current = history.pop();\n      if (current) redo?.push(current);\n      const prev = history.peek();\n      this.vault.set(key, this.obfuscate(prev));\n      this.notify(key);\n    }\n  }\n\n  /**\n   * Restores the state to the next version in the redo stack.\n   */\n  redo(key: string) {\n    const history = this.histories.get(key);\n    const redo = this.redoStacks.get(key);\n    if (redo && redo.length > 0) {\n      const next = redo.pop();\n      history?.push(next);\n      this.vault.set(key, this.obfuscate(next));\n      this.notify(key);\n    }\n  }\n\n  /**\n   * Resets a flow to its initial value.\n   */\n  reset(key: string) {\n    const initial = this.initialValues.get(key);\n    if (initial !== undefined) this.set(key, initial);\n  }\n\n  getHistory(key: string) {\n    return this.histories.get(key)?.toArray() || [];\n  }\n  getRedoStack(key: string) {\n    return this.redoStacks.get(key) || [];\n  }\n\n  /**\n   * Clears the entire store and all timers.\n   */\n  clearAll() {\n    this.debounceTimers.forEach((t) => clearTimeout(t));\n    this.vault.clear();\n    this.initialValues.clear();\n    this.listeners.clear();\n    this.histories.clear();\n    this.redoStacks.clear();\n  }\n}\n\n/**\n * Circular Buffer implementation for high-performance memory-efficient history.\n */\nclass CircularBuffer<T> {\n  private buffer: T[];\n  private head = 0;\n  private size = 0;\n  private maxSize: number;\n\n  constructor(maxSize: number, initial: T[] = []) {\n    this.maxSize = maxSize;\n    this.buffer = new Array(maxSize);\n    initial.forEach((i) => this.push(i));\n  }\n  push(item: T) {\n    this.buffer[this.head] = item;\n    this.head = (this.head + 1) % this.maxSize;\n    if (this.size < this.maxSize) this.size++;\n  }\n  pop(): T | undefined {\n    if (this.size <= 0) return undefined;\n    this.head = (this.head - 1 + this.maxSize) % this.maxSize;\n    this.size--;\n    return this.buffer[this.head];\n  }\n  peek(): T | undefined {\n    return this.size > 0\n      ? this.buffer[(this.head - 1 + this.maxSize) % this.maxSize]\n      : undefined;\n  }\n  length() {\n    return this.size;\n  }\n  toArray(): T[] {\n    const res = [];\n    for (let i = 0; i < this.size; i++) {\n      res.push(\n        this.buffer[(this.head - this.size + i + this.maxSize) % this.maxSize],\n      );\n    }\n    return res;\n  }\n}\n\n/**\n * High-performance deep cloning utility.\n */\nfunction deepClone<T>(obj: T): T {\n  if (obj === null || typeof obj !== \"object\") return obj;\n  if (Array.isArray(obj)) return obj.map(deepClone) as any;\n  const cloned: any = {};\n  for (const key in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, key))\n      cloned[key] = deepClone(obj[key]);\n  }\n  return cloned;\n}\n\n/**\n * High-performance deep equality utility.\n */\nfunction deepEqual(a: any, b: any): boolean {\n  if (a === b) return true;\n  if (typeof a !== typeof b || a === null || b === null) return false;\n  if (typeof a === \"object\") {\n    const keysA = Object.keys(a);\n    const keysB = Object.keys(b);\n    if (keysA.length !== keysB.length) return false;\n    for (const key of keysA) {\n      if (!Object.prototype.hasOwnProperty.call(b, key)) return false;\n      if (!deepEqual(a[key], b[key])) return false;\n    }\n    return true;\n  }\n  return false;\n}\n\nexport const store = new SecureVault();\n"],"names":[],"mappings":";;AAEA;;;;AAIG;AACH,MAAM,WAAW,CAAA;AAUf,IAAA,WAAA,GAAA;AATQ,QAAA,MAAA,CAAA,cAAA,CAAA,IAAA,EAAA,OAAA,EAAA;;;;AAAQ,YAAA,KAAA,EAAA,IAAI,GAAG;AAAgB,SAAA,CAAA;AAC/B,QAAA,MAAA,CAAA,cAAA,CAAA,IAAA,EAAA,eAAA,EAAA;;;;AAAgB,YAAA,KAAA,EAAA,IAAI,GAAG;AAAgB,SAAA,CAAA;AACvC,QAAA,MAAA,CAAA,cAAA,CAAA,IAAA,EAAA,WAAA,EAAA;;;;AAAY,YAAA,KAAA,EAAA,IAAI,GAAG;AAA4B,SAAA,CAAA;AAC/C,QAAA,MAAA,CAAA,cAAA,CAAA,IAAA,EAAA,WAAA,EAAA;;;;AAAY,YAAA,KAAA,EAAA,IAAI,GAAG;AAAgC,SAAA,CAAA;AACnD,QAAA,MAAA,CAAA,cAAA,CAAA,IAAA,EAAA,YAAA,EAAA;;;;AAAa,YAAA,KAAA,EAAA,IAAI,GAAG;AAAkB,SAAA,CAAA;AACtC,QAAA,MAAA,CAAA,cAAA,CAAA,IAAA,EAAA,gBAAA,EAAA;;;;AAAiB,YAAA,KAAA,EAAA,IAAI,GAAG;AAAmB,SAAA,CAAA;AAC3C,QAAA,MAAA,CAAA,cAAA,CAAA,IAAA,EAAA,YAAA,EAAA;;;;AAAa,YAAA,KAAA,EAAA,IAAI,GAAG;AAAW,SAAA,CAAA;AAC/B,QAAA,MAAA,CAAA,cAAA,CAAA,IAAA,EAAA,gBAAA,EAAA;;;;mBAAiB;AAAM,SAAA,CAAA;QAG7B,IAAI,CAAC,iBAAiB,EAAE;QACxB,IAAI,CAAC,gBAAgB,EAAE;IACzB;AAEA;;AAEG;IACK,iBAAiB,GAAA;AACvB,QAAA,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE;AACjC,YAAA,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,kBAAkB,EAAE;AAChD,gBAAA,GAAG,EAAE,MAAM,0CAA0C;AACrD,gBAAA,YAAY,EAAE,KAAK;AACpB,aAAA,CAAC;QACJ;IACF;AAEA;;AAEG;IACK,gBAAgB,GAAA;AACtB,QAAA,IAAI,OAAO,WAAW,KAAK,WAAW,EAAE;YACtC,WAAW,CAAC,MAAK;gBACf,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,KAAI;AAClC,oBAAA,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;AAC1C,wBAAA,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC;oBAC5B;AACF,gBAAA,CAAC,CAAC;AACJ,YAAA,CAAC,EAAE,MAAM,CAAC,CAAC;QACb;IACF;AAEA;;AAEG;AACK,IAAA,SAAS,CAAC,IAAS,EAAA;QACzB,IAAI,IAAI,KAAK,SAAS;AAAE,YAAA,OAAO,SAAS;AACxC,QAAA,IAAI;YACF,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;;AAEhC,YAAA,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE;QAC5D;AAAE,QAAA,MAAM;AACN,YAAA,OAAO,IAAI;QACb;IACF;AAEA;;AAEG;AACK,IAAA,WAAW,CAAC,SAAc,EAAA;QAChC,IAAI,CAAC,SAAS,IAAI,OAAO,SAAS,KAAK,QAAQ,IAAI,CAAC,SAAS,CAAC,CAAC;AAC7D,YAAA,OAAO,SAAS;AAClB,QAAA,IAAI;YACF,MAAM,OAAO,GAAG,kBAAkB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AACrD,YAAA,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;QAC5B;AAAE,QAAA,MAAM;AACN,YAAA,OAAO,SAAS;QAClB;IACF;AAEA;;AAEG;IACH,GAAG,CAAC,GAAW,EAAE,YAAkB,EAAA;QACjC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YACxB,IAAI,YAAY,KAAK,SAAS;AAAE,gBAAA,OAAO,SAAS;AAEhD,YAAA,MAAM,MAAM,GAAG,SAAS,CAAC,YAAY,CAAC;AACtC,YAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;AAC3C,YAAA,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;AAC9C,YAAA,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,cAAc,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;YAC1D,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC;QAC9B;AAEA,QAAA,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjD,OAAO,GAAG,KAAK,SAAS,GAAG,YAAY,GAAG,GAAG;IAC/C;AAEA;;AAEG;AACH,IAAA,GAAG,CAAC,GAAW,EAAE,QAAa,EAAE,UAAuB,EAAE,EAAA;AACvD,QAAA,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACvD,QAAA,IAAI,UAAU,GAAG,SAAS,CAAC,QAAQ,CAAC;;AAGpC,QAAA,IAAI,OAAO,CAAC,UAAU,EAAE;AACtB,YAAA,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,UAAU,EAAE;AACnC,gBAAA,UAAU,GAAG,EAAE,CAAC,UAAU,CAAC;YAC7B;QACF;;AAGA,QAAA,IAAI,SAAS,CAAC,SAAS,EAAE,UAAU,CAAC;YAAE;AAEtC,QAAA,IAAI,OAAO,CAAC,QAAQ,EAAE;YACpB,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,UAAU,EAAE,OAAO,CAAC;YAC3C;QACF;QAEA,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,UAAU,EAAE,OAAO,CAAC;IACzC;AAEA;;AAEG;AACK,IAAA,YAAY,CAAC,GAAW,EAAE,KAAU,EAAE,OAAoB,EAAA;QAChE,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC;AAC7C,QAAA,IAAI,QAAQ;YAAE,YAAY,CAAC,QAAQ,CAAC;AAEpC,QAAA,MAAM,KAAK,GAAG,UAAU,CAAC,MAAK;YAC5B,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE,OAAO,CAAC;AAClC,YAAA,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,GAAG,CAAC;AACjC,QAAA,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC;QAEpB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,KAAY,CAAC;IAC5C;AAEA;;AAEG;AACK,IAAA,QAAQ,CAAC,GAAW,EAAE,UAAe,EAAE,OAAoB,EAAA;AACjE,QAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;AAE/C,QAAA,IAAI,OAAO,CAAC,UAAU,EAAE;YACtB,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC;AACvC,YAAA,IAAI,OAAO;gBAAE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;YAChD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;AACrC,YAAA,IAAI,IAAI;AAAE,gBAAA,IAAI,CAAC,MAAM,GAAG,CAAC;QAC3B;AAEA,QAAA,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC;IAC/B;AAEA;;AAEG;AACK,IAAA,mBAAmB,CAAC,GAAW,EAAA;AACrC,QAAA,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;QACxB,IAAI,IAAI,CAAC,cAAc;YAAE;AACzB,QAAA,IAAI,CAAC,cAAc,GAAG,IAAI;QAC1B,cAAc,CAAC,MAAM,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC/C;AAEA;;AAEG;IACK,gBAAgB,GAAA;QACtB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;AACxC,QAAA,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE;AACvB,QAAA,IAAI,CAAC,cAAc,GAAG,KAAK;AAC3B,QAAA,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACzC;AAEA;;AAEG;IACH,SAAS,CAAC,GAAW,EAAE,QAAoB,EAAA;QACzC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC;AAChE,QAAA,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,QAAQ,CAAC;AACtC,QAAA,OAAO,MAAK;AACV,YAAA,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAC;AAC3C,QAAA,CAAC;IACH;AAEA;;AAEG;AACK,IAAA,MAAM,CAAC,GAAW,EAAA;AACxB,QAAA,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;IAC9C;AAEA;;AAEG;AACH,IAAA,IAAI,CAAC,GAAW,EAAA;QACd,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;QACrC,IAAI,OAAO,IAAI,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE;AACnC,YAAA,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,EAAE;AAC7B,YAAA,IAAI,OAAO;AAAE,gBAAA,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC;AAChC,YAAA,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE;AAC3B,YAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;AACzC,YAAA,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;QAClB;IACF;AAEA;;AAEG;AACH,IAAA,IAAI,CAAC,GAAW,EAAA;QACd,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;QACrC,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;AAC3B,YAAA,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE;AACvB,YAAA,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC;AACnB,YAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;AACzC,YAAA,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;QAClB;IACF;AAEA;;AAEG;AACH,IAAA,KAAK,CAAC,GAAW,EAAA;QACf,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC;QAC3C,IAAI,OAAO,KAAK,SAAS;AAAE,YAAA,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC;IACnD;AAEA,IAAA,UAAU,CAAC,GAAW,EAAA;AACpB,QAAA,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE;IACjD;AACA,IAAA,YAAY,CAAC,GAAW,EAAA;QACtB,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE;IACvC;AAEA;;AAEG;IACH,QAAQ,GAAA;AACN,QAAA,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,CAAC;AACnD,QAAA,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE;AAClB,QAAA,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE;AAC1B,QAAA,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE;AACtB,QAAA,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE;AACtB,QAAA,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE;IACzB;AACD;AAED;;AAEG;AACH,MAAM,cAAc,CAAA;IAMlB,WAAA,CAAY,OAAe,EAAE,OAAA,GAAe,EAAE,EAAA;AALtC,QAAA,MAAA,CAAA,cAAA,CAAA,IAAA,EAAA,QAAA,EAAA;;;;;AAAY,SAAA,CAAA;AACZ,QAAA,MAAA,CAAA,cAAA,CAAA,IAAA,EAAA,MAAA,EAAA;;;;mBAAO;AAAE,SAAA,CAAA;AACT,QAAA,MAAA,CAAA,cAAA,CAAA,IAAA,EAAA,MAAA,EAAA;;;;mBAAO;AAAE,SAAA,CAAA;AACT,QAAA,MAAA,CAAA,cAAA,CAAA,IAAA,EAAA,SAAA,EAAA;;;;;AAAgB,SAAA,CAAA;AAGtB,QAAA,IAAI,CAAC,OAAO,GAAG,OAAO;QACtB,IAAI,CAAC,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC;AAChC,QAAA,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC;AACA,IAAA,IAAI,CAAC,IAAO,EAAA;QACV,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI;AAC7B,QAAA,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,OAAO;AAC1C,QAAA,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,OAAO;YAAE,IAAI,CAAC,IAAI,EAAE;IAC3C;IACA,GAAG,GAAA;AACD,QAAA,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC;AAAE,YAAA,OAAO,SAAS;AACpC,QAAA,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO;QACzD,IAAI,CAAC,IAAI,EAAE;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;IAC/B;IACA,IAAI,GAAA;AACF,QAAA,OAAO,IAAI,CAAC,IAAI,GAAG;cACf,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO;cACzD,SAAS;IACf;IACA,MAAM,GAAA;QACJ,OAAO,IAAI,CAAC,IAAI;IAClB;IACA,OAAO,GAAA;QACL,MAAM,GAAG,GAAG,EAAE;AACd,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;AAClC,YAAA,GAAG,CAAC,IAAI,CACN,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,CACvE;QACH;AACA,QAAA,OAAO,GAAG;IACZ;AACD;AAED;;AAEG;AACH,SAAS,SAAS,CAAI,GAAM,EAAA;AAC1B,IAAA,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ;AAAE,QAAA,OAAO,GAAG;AACvD,IAAA,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;AAAE,QAAA,OAAO,GAAG,CAAC,GAAG,CAAC,SAAS,CAAQ;IACxD,MAAM,MAAM,GAAQ,EAAE;AACtB,IAAA,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE;QACrB,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC;YAChD,MAAM,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACrC;AACA,IAAA,OAAO,MAAM;AACf;AAEA;;AAEG;AACH,SAAS,SAAS,CAAC,CAAM,EAAE,CAAM,EAAA;IAC/B,IAAI,CAAC,KAAK,CAAC;AAAE,QAAA,OAAO,IAAI;AACxB,IAAA,IAAI,OAAO,CAAC,KAAK,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI;AAAE,QAAA,OAAO,KAAK;AACnE,IAAA,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;QACzB,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5B,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;AAC5B,QAAA,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;AAAE,YAAA,OAAO,KAAK;AAC/C,QAAA,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE;AACvB,YAAA,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC;AAAE,gBAAA,OAAO,KAAK;AAC/D,YAAA,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;AAAE,gBAAA,OAAO,KAAK;QAC9C;AACA,QAAA,OAAO,IAAI;IACb;AACA,IAAA,OAAO,KAAK;AACd;AAEO,MAAM,KAAK,GAAG,IAAI,WAAW;;;;"}

package/dist/esm/index.js

@@ -0,0 +1,2 @@
+// ESM re-export from src directory
+export * from './src/index.js';

package/dist/esm/package.json

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

package/dist/esm/src/index.js

@@ -0,0 +1,63 @@
+import { useState, useEffect, useCallback, useMemo } from 'react';
+import { store } from './store.js';
+import { createDeepProxy } from './proxy.js';
+
+/**
+ * Defines a flow in a centralized manner.
+ * Allows defining the key, initial state, and options in a single reusable object.
+ */
+function defineFlow(key, initial, options) {
+    return { key, initial, options };
+}
+/**
+ * Unique "All-in-One" hook to create or consume a FractoState flow.
+ * - If called with a FlowDefinition or an initial value: initializes the flow if it doesn't exist.
+ * - If called with just a key: connects to the existing flow.
+ *
+ * Returns a 2-element array: [state, toolbox]
+ * where toolbox contains { ops, set, undo, redo, history, ... }
+ */
+function useFlow(keyOrDef, maybeInitialValue, options = {}) {
+    // Argument analysis to unify initialization and consumption
+    const isDef = typeof keyOrDef !== "string";
+    const key = isDef ? keyOrDef.key : keyOrDef;
+    // Initial data comes either from the definition or the direct argument
+    const initialValue = isDef ? keyOrDef.initial : maybeInitialValue;
+    // Merge options
+    const opt = isDef ? { ...keyOrDef.options, ...options } : options;
+    // Store access: store.get handles initialization if initialValue is present
+    const [state, setState] = useState(() => store.get(key, initialValue));
+    useEffect(() => {
+        // Subscribe to store changes
+        const unsub = store.subscribe(key, () => {
+            setState(store.get(key, initialValue));
+        });
+        return unsub;
+    }, [key, initialValue]);
+    const setManual = useCallback((val) => {
+        const current = store.get(key, initialValue);
+        const next = typeof val === "function" ? val(current) : val;
+        store.set(key, next, opt);
+    }, [key, initialValue, opt]);
+    const toolbox = useMemo(() => {
+        return {
+            ops: {
+                get self() {
+                    return createDeepProxy(key, [], store.get(key, initialValue), opt);
+                },
+            },
+            set: setManual,
+            undo: () => store.undo(key),
+            redo: () => store.redo(key),
+            history: store.getHistory(key),
+            canUndo: store.getHistory(key).length > 1,
+            canRedo: store.getRedoStack(key).length > 0,
+            reset: () => store.reset(key),
+            cf: opt,
+        };
+    }, [key, opt, state, initialValue, setManual]);
+    return [state, toolbox];
+}
+
+export { defineFlow, useFlow };
+//# sourceMappingURL=index.js.map

package/dist/esm/src/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../src/index.ts"],"sourcesContent":["import { useState, useEffect, useCallback, useMemo } from \"react\";\nimport type { FlowOptions, FlowOperations, FlowDefinition } from \"./types\";\nimport { store } from \"./store\";\nimport { createDeepProxy } from \"./proxy\";\n\nexport * from \"./types\";\n\n/**\n * Defines a flow in a centralized manner.\n * Allows defining the key, initial state, and options in a single reusable object.\n */\nexport function defineFlow<T>(\n  key: string,\n  initial: T,\n  options?: FlowOptions<T>,\n): FlowDefinition<T> {\n  return { key, initial, options };\n}\n\n/**\n * Unique \"All-in-One\" hook to create or consume a FractoState flow.\n * - If called with a FlowDefinition or an initial value: initializes the flow if it doesn't exist.\n * - If called with just a key: connects to the existing flow.\n *\n * Returns a 2-element array: [state, toolbox]\n * where toolbox contains { ops, set, undo, redo, history, ... }\n */\nexport function useFlow<T>(\n  keyOrDef: string | FlowDefinition<T>,\n  maybeInitialValue?: T,\n  options: FlowOptions<T> = {},\n): [T, FlowOperations<T>] {\n  // Argument analysis to unify initialization and consumption\n  const isDef = typeof keyOrDef !== \"string\";\n  const key = isDef ? keyOrDef.key : keyOrDef;\n\n  // Initial data comes either from the definition or the direct argument\n  const initialValue = isDef ? keyOrDef.initial : maybeInitialValue;\n\n  // Merge options\n  const opt = isDef ? { ...keyOrDef.options, ...options } : options;\n\n  // Store access: store.get handles initialization if initialValue is present\n  const [state, setState] = useState(() => store.get(key, initialValue));\n\n  useEffect(() => {\n    // Subscribe to store changes\n    const unsub = store.subscribe(key, () => {\n      setState(store.get(key, initialValue));\n    });\n    return unsub;\n  }, [key, initialValue]);\n\n  const setManual = useCallback(\n    (val: T | ((prev: T) => T)) => {\n      const current = store.get(key, initialValue);\n      const next = typeof val === \"function\" ? (val as any)(current) : val;\n      store.set(key, next, opt);\n    },\n    [key, initialValue, opt],\n  );\n\n  const toolbox = useMemo((): FlowOperations<T> => {\n    return {\n      ops: {\n        get self() {\n          return createDeepProxy<T>(key, [], store.get(key, initialValue), opt);\n        },\n      },\n      set: setManual,\n      undo: () => store.undo(key),\n      redo: () => store.redo(key),\n      history: store.getHistory(key),\n      canUndo: store.getHistory(key).length > 1,\n      canRedo: store.getRedoStack(key).length > 0,\n      reset: () => store.reset(key),\n      cf: opt,\n    };\n  }, [key, opt, state, initialValue, setManual]);\n\n  return [state, toolbox];\n}\n"],"names":[],"mappings":";;;;AAOA;;;AAGG;SACa,UAAU,CACxB,GAAW,EACX,OAAU,EACV,OAAwB,EAAA;AAExB,IAAA,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE;AAClC;AAEA;;;;;;;AAOG;AACG,SAAU,OAAO,CACrB,QAAoC,EACpC,iBAAqB,EACrB,UAA0B,EAAE,EAAA;;AAG5B,IAAA,MAAM,KAAK,GAAG,OAAO,QAAQ,KAAK,QAAQ;AAC1C,IAAA,MAAM,GAAG,GAAG,KAAK,GAAG,QAAQ,CAAC,GAAG,GAAG,QAAQ;;AAG3C,IAAA,MAAM,YAAY,GAAG,KAAK,GAAG,QAAQ,CAAC,OAAO,GAAG,iBAAiB;;AAGjE,IAAA,MAAM,GAAG,GAAG,KAAK,GAAG,EAAE,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,OAAO,EAAE,GAAG,OAAO;;IAGjE,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,QAAQ,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;IAEtE,SAAS,CAAC,MAAK;;QAEb,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE,MAAK;YACtC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;AACxC,QAAA,CAAC,CAAC;AACF,QAAA,OAAO,KAAK;AACd,IAAA,CAAC,EAAE,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;AAEvB,IAAA,MAAM,SAAS,GAAG,WAAW,CAC3B,CAAC,GAAyB,KAAI;QAC5B,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,YAAY,CAAC;AAC5C,QAAA,MAAM,IAAI,GAAG,OAAO,GAAG,KAAK,UAAU,GAAI,GAAW,CAAC,OAAO,CAAC,GAAG,GAAG;QACpE,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC;IAC3B,CAAC,EACD,CAAC,GAAG,EAAE,YAAY,EAAE,GAAG,CAAC,CACzB;AAED,IAAA,MAAM,OAAO,GAAG,OAAO,CAAC,MAAwB;QAC9C,OAAO;AACL,YAAA,GAAG,EAAE;AACH,gBAAA,IAAI,IAAI,GAAA;AACN,oBAAA,OAAO,eAAe,CAAI,GAAG,EAAE,EAAE,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,YAAY,CAAC,EAAE,GAAG,CAAC;gBACvE,CAAC;AACF,aAAA;AACD,YAAA,GAAG,EAAE,SAAS;YACd,IAAI,EAAE,MAAM,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC;YAC3B,IAAI,EAAE,MAAM,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC;AAC3B,YAAA,OAAO,EAAE,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC;YAC9B,OAAO,EAAE,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC;YACzC,OAAO,EAAE,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC;YAC3C,KAAK,EAAE,MAAM,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC;AAC7B,YAAA,EAAE,EAAE,GAAG;SACR;AACH,IAAA,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;AAE9C,IAAA,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC;AACzB;;;;"}