@adobe/data 0.8.6 → 0.9.1

package/dist/debug-type-test.js

@@ -0,0 +1,12 @@
+import { Database } from "./ecs/database/database.js";
+const aSchema = Database.Plugin.create({
+    components: { a: { type: "number" } },
+    archetypes: { one: ["a"] }
+});
+const bSchema = Database.Plugin.create({
+    components: { x: { type: "number" } },
+});
+const cSchema = Database.Plugin.create({
+    components: { m: { type: "number" } },
+}, [aSchema, bSchema]);
+//# sourceMappingURL=debug-type-test.js.map

package/dist/debug-type-test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"debug-type-test.js","sourceRoot":"","sources":["../src/debug-type-test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;IACnC,UAAU,EAAE,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE;IACrC,UAAU,EAAE,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE;CAC7B,CAAC,CAAC;AAEH,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;IACnC,UAAU,EAAE,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE;CACxC,CAAC,CAAC;AAEH,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;IACnC,UAAU,EAAE,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE;CACxC,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC"}

package/dist/ecs/database/archetype-type-safety-test.d.ts

@@ -0,0 +1,21 @@
+declare const plugin1: Required<import("./database.js").Database.Plugin<{
+    readonly position: {
+        readonly type: "number";
+    };
+    readonly velocity: {
+        readonly type: "number";
+    };
+}, import("../resource-schemas.js").ResourceSchemas, {
+    readonly StaticEntity: readonly ["position"];
+    readonly DynamicEntity: readonly ["position", "velocity"];
+}, import("../store/action-functions.js").ActionDeclarations<any, any, any>, string>>;
+declare const plugin2: Required<import("./database.js").Database.Plugin<{
+    readonly position: {
+        readonly type: "number";
+    };
+}, import("../resource-schemas.js").ResourceSchemas, import("../index.js").ArchetypeComponents<import("../../types/types.js").StringKeyof<{
+    readonly position: {
+        readonly type: "number";
+    };
+} & import("../optional-components.js").OptionalComponents>>, import("../store/action-functions.js").ActionDeclarations<any, any, any>, string>>;
+export { plugin1, plugin2 };

package/dist/ecs/database/archetype-type-safety-test.js

@@ -0,0 +1,36 @@
+import { createPlugin } from "./create-plugin.js";
+// Test 1: System should have typed archetype access
+const plugin1 = createPlugin({
+    components: {
+        position: { type: "number" },
+        velocity: { type: "number" }
+    },
+    archetypes: {
+        StaticEntity: ["position"],
+        DynamicEntity: ["position", "velocity"]
+    },
+    systems: {
+        testSystem: {
+            create: (db) => () => {
+                // Should have typed access to archetypes
+                const staticArch = db.archetypes.StaticEntity;
+                const dynamicArch = db.archetypes.DynamicEntity;
+                // @ts-expect-error - NonExistent archetype doesn't exist
+                const invalid = db.archetypes.NonExistent;
+                return { staticArch, dynamicArch, invalid };
+            }
+        }
+    }
+});
+// Test 2: Invalid component reference should be caught
+const plugin2 = createPlugin({
+    components: {
+        position: { type: "number" }
+    },
+    archetypes: {
+        // @ts-expect-error - velocity component doesn't exist
+        Entity: ["position", "velocity"]
+    }
+});
+export { plugin1, plugin2 };
+//# sourceMappingURL=archetype-type-safety-test.js.map

package/dist/ecs/database/archetype-type-safety-test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"archetype-type-safety-test.js","sourceRoot":"","sources":["../../../src/ecs/database/archetype-type-safety-test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD,oDAAoD;AACpD,MAAM,OAAO,GAAG,YAAY,CAAC;IACzB,UAAU,EAAE;QACR,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;QAC5B,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;KAC/B;IACD,UAAU,EAAE;QACR,YAAY,EAAE,CAAC,UAAU,CAAC;QAC1B,aAAa,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;KAC1C;IACD,OAAO,EAAE;QACL,UAAU,EAAE;YACR,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE;gBACjB,yCAAyC;gBACzC,MAAM,UAAU,GAAG,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC;gBAC9C,MAAM,WAAW,GAAG,EAAE,CAAC,UAAU,CAAC,aAAa,CAAC;gBAEhD,yDAAyD;gBACzD,MAAM,OAAO,GAAG,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC;gBAE1C,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;YAChD,CAAC;SACJ;KACJ;CACJ,CAAC,CAAC;AAEH,uDAAuD;AACvD,MAAM,OAAO,GAAG,YAAY,CAAC;IACzB,UAAU,EAAE;QACR,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;KAC/B;IACD,UAAU,EAAE;QACR,sDAAsD;QACtD,MAAM,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;KACnC;CACJ,CAAC,CAAC;AAEH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC"}

package/dist/ecs/database/calculate-system-order.d.ts

@@ -0,0 +1,28 @@
+type SystemDeclaration = {
+    readonly create: (...args: any[]) => any;
+    /**
+     * Scheduling constraints for system execution order.
+     * - `before`: Hard constraint - this system must run before the listed systems
+     * - `after`: Hard constraint - this system must run after the listed systems
+     * - `during`: Soft constraint - prefer to run in the same tier as the listed systems, if dependencies allow
+     */
+    readonly schedule?: {
+        readonly before?: readonly string[];
+        readonly after?: readonly string[];
+        readonly during?: readonly string[];
+    };
+};
+/**
+ * Calculates the execution order for systems based on their scheduling constraints.
+ * Returns a 2D array where each sub-array represents a tier of systems that can
+ * execute in parallel.
+ *
+ * Hard constraints (before/after) are satisfied first, then soft constraints (during)
+ * are applied to optimize tier placement when possible.
+ *
+ * @param systems - Object mapping system names to their declarations
+ * @returns Array of tiers, where each tier is an array of system names that can run in parallel
+ * @throws Error if circular dependencies are detected
+ */
+export declare const calculateSystemOrder: <S extends string>(systems: { readonly [K in S]: SystemDeclaration; }) => S[][];
+export {};

package/dist/ecs/database/calculate-system-order.js

@@ -0,0 +1,239 @@
+/*MIT License
+
+© Copyright 2025 Adobe. All rights reserved.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.*/
+/**
+ * Builds a dependency graph from system scheduling constraints.
+ * Returns a map where each system maps to the set of systems that must run before it.
+ */
+const buildDependencyGraph = (systemNames, systems) => {
+    const dependsOn = new Map();
+    // Initialize all systems with empty dependency sets
+    for (const name of systemNames) {
+        dependsOn.set(name, new Set());
+    }
+    // Process scheduling constraints
+    for (const name of systemNames) {
+        const schedule = systems[name].schedule;
+        if (schedule?.after) {
+            for (const dep of schedule.after) {
+                dependsOn.get(name).add(dep);
+            }
+        }
+        if (schedule?.before) {
+            for (const dependent of schedule.before) {
+                dependsOn.get(dependent).add(name);
+            }
+        }
+    }
+    return dependsOn;
+};
+/**
+ * Detects cycles in the dependency graph using DFS.
+ * @throws Error if a circular dependency is detected
+ */
+const detectCycles = (systemNames, dependsOn) => {
+    const visited = new Set();
+    const stack = new Set();
+    const detectCycle = (node) => {
+        if (stack.has(node)) {
+            return true;
+        }
+        if (visited.has(node)) {
+            return false;
+        }
+        visited.add(node);
+        stack.add(node);
+        const deps = dependsOn.get(node);
+        for (const dep of deps) {
+            if (detectCycle(dep)) {
+                return true;
+            }
+        }
+        stack.delete(node);
+        return false;
+    };
+    for (const name of systemNames) {
+        if (detectCycle(name)) {
+            throw new Error("Circular dependency detected in system scheduling");
+        }
+    }
+};
+/**
+ * Builds tiers of systems using topological sort.
+ * Systems in the same tier can run in parallel.
+ */
+const buildTiers = (systemNames, dependsOn) => {
+    const tiers = [];
+    const processed = new Set();
+    while (processed.size < systemNames.length) {
+        const currentTier = [];
+        for (const name of systemNames) {
+            if (processed.has(name)) {
+                continue;
+            }
+            // Check if all dependencies are processed
+            const deps = dependsOn.get(name);
+            const allDepsProcessed = Array.from(deps).every(dep => processed.has(dep));
+            if (allDepsProcessed) {
+                currentTier.push(name);
+            }
+        }
+        if (currentTier.length === 0) {
+            // Should never happen if cycle detection works
+            throw new Error("Unable to resolve system dependencies");
+        }
+        // Sort tier alphabetically for deterministic output
+        currentTier.sort();
+        tiers.push(currentTier);
+        for (const name of currentTier) {
+            processed.add(name);
+        }
+    }
+    return tiers;
+};
+/**
+ * Finds which tier index contains the given system.
+ * Returns -1 if not found.
+ */
+const findSystemTier = (tiers, system) => {
+    for (let i = 0; i < tiers.length; i++) {
+        if (tiers[i].includes(system)) {
+            return i;
+        }
+    }
+    return -1;
+};
+/**
+ * Checks if a system can be moved to a target tier without violating dependencies.
+ */
+const canMoveToTier = (system, targetTierIndex, tiers, dependsOn) => {
+    // Build reverse dependency map on-demand: systems that depend on this system
+    const dependentsOf = new Set();
+    for (const [name, deps] of dependsOn.entries()) {
+        if (deps.has(system)) {
+            dependentsOf.add(name);
+        }
+    }
+    // All dependencies must be in tiers strictly before target tier
+    const deps = dependsOn.get(system);
+    for (const dep of deps) {
+        const depTier = findSystemTier(tiers, dep);
+        if (depTier >= targetTierIndex) {
+            return false;
+        }
+    }
+    // All dependents must be in tiers strictly after target tier
+    for (const dependent of dependentsOf) {
+        const dependentTier = findSystemTier(tiers, dependent);
+        if (dependentTier <= targetTierIndex) {
+            return false;
+        }
+    }
+    return true;
+};
+/**
+ * Finds the best target tier for a system based on its "during" constraints.
+ * Returns the tier index with the most targets, or -1 if no valid target found.
+ */
+const findBestTargetTier = (system, targets, tiers) => {
+    let bestTierIndex = -1;
+    let bestTargetCount = 0;
+    for (const target of targets) {
+        const targetTierIndex = findSystemTier(tiers, target);
+        if (targetTierIndex === -1) {
+            continue; // Target doesn't exist, skip
+        }
+        // Count how many targets are in this tier
+        const targetCount = targets.filter(t => {
+            const tier = findSystemTier(tiers, t);
+            return tier !== -1 && tier === targetTierIndex;
+        }).length;
+        if (targetCount > bestTargetCount) {
+            bestTargetCount = targetCount;
+            bestTierIndex = targetTierIndex;
+        }
+    }
+    return bestTierIndex;
+};
+/**
+ * Optimizes tier placement for systems with "during" constraints.
+ * Attempts to move systems to the same tier as their targets when dependencies allow.
+ */
+const optimizeDuringConstraints = (tiers, systemNames, systems, dependsOn) => {
+    // Collect systems with "during" constraints
+    const systemsWithDuring = [];
+    for (const name of systemNames) {
+        const schedule = systems[name].schedule;
+        if (schedule?.during && schedule.during.length > 0) {
+            systemsWithDuring.push({ system: name, targets: schedule.during });
+        }
+    }
+    // Try to optimize placement for each system with "during" constraints
+    for (const { system, targets } of systemsWithDuring) {
+        const currentTierIndex = findSystemTier(tiers, system);
+        const bestTierIndex = findBestTargetTier(system, targets, tiers);
+        // If we found a valid target tier different from current, try to move
+        if (bestTierIndex !== -1 && bestTierIndex !== currentTierIndex) {
+            if (canMoveToTier(system, bestTierIndex, tiers, dependsOn)) {
+                // Move system to target tier
+                const currentTier = tiers[currentTierIndex];
+                const targetTier = tiers[bestTierIndex];
+                // Remove from current tier
+                const index = currentTier.indexOf(system);
+                if (index !== -1) {
+                    currentTier.splice(index, 1);
+                }
+                // Add to target tier and maintain alphabetical order
+                targetTier.push(system);
+                targetTier.sort();
+            }
+        }
+    }
+};
+/**
+ * Calculates the execution order for systems based on their scheduling constraints.
+ * Returns a 2D array where each sub-array represents a tier of systems that can
+ * execute in parallel.
+ *
+ * Hard constraints (before/after) are satisfied first, then soft constraints (during)
+ * are applied to optimize tier placement when possible.
+ *
+ * @param systems - Object mapping system names to their declarations
+ * @returns Array of tiers, where each tier is an array of system names that can run in parallel
+ * @throws Error if circular dependencies are detected
+ */
+export const calculateSystemOrder = (systems) => {
+    const systemNames = Object.keys(systems);
+    if (systemNames.length === 0) {
+        return [];
+    }
+    // Phase 1: Build dependency graph from hard constraints (before/after)
+    const dependsOn = buildDependencyGraph(systemNames, systems);
+    // Phase 2: Detect cycles
+    detectCycles(systemNames, dependsOn);
+    // Phase 3: Build tiers using topological sort
+    const tiers = buildTiers(systemNames, dependsOn);
+    // Phase 4: Optimize tier placement using soft constraints (during)
+    optimizeDuringConstraints(tiers, systemNames, systems, dependsOn);
+    // Filter out any empty tiers that may have been created during optimization
+    return tiers.filter(tier => tier.length > 0);
+};
+//# sourceMappingURL=calculate-system-order.js.map

package/dist/ecs/database/calculate-system-order.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"calculate-system-order.js","sourceRoot":"","sources":["../../../src/ecs/database/calculate-system-order.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AAiBX;;;GAGG;AACH,MAAM,oBAAoB,GAAG,CACzB,WAAyB,EACzB,OAAiD,EACnC,EAAE;IAChB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAa,CAAC;IAEvC,oDAAoD;IACpD,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC7B,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,iCAAiC;IACjC,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC;QAExC,IAAI,QAAQ,EAAE,KAAK,EAAE,CAAC;YAClB,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;gBAC/B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,GAAQ,CAAC,CAAC;YACvC,CAAC;QACL,CAAC;QAED,IAAI,QAAQ,EAAE,MAAM,EAAE,CAAC;YACnB,KAAK,MAAM,SAAS,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;gBACtC,SAAS,CAAC,GAAG,CAAC,SAAc,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC7C,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,YAAY,GAAG,CACjB,WAAyB,EACzB,SAAyB,EACrB,EAAE;IACN,MAAM,OAAO,GAAG,IAAI,GAAG,EAAK,CAAC;IAC7B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAK,CAAC;IAE3B,MAAM,WAAW,GAAG,CAAC,IAAO,EAAW,EAAE;QACrC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAClB,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEhB,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QAClC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;QAED,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,KAAK,CAAC;IACjB,CAAC,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC7B,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAC;QACzE,CAAC;IACL,CAAC;AACL,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,GAAG,CACf,WAAyB,EACzB,SAAyB,EACpB,EAAE;IACP,MAAM,KAAK,GAAU,EAAE,CAAC;IACxB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAK,CAAC;IAE/B,OAAO,SAAS,CAAC,IAAI,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;QACzC,MAAM,WAAW,GAAQ,EAAE,CAAC;QAE5B,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC7B,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtB,SAAS;YACb,CAAC;YAED,0CAA0C;YAC1C,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;YAClC,MAAM,gBAAgB,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAE3E,IAAI,gBAAgB,EAAE,CAAC;gBACnB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3B,CAAC;QACL,CAAC;QAED,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,+CAA+C;YAC/C,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;QAC7D,CAAC;QAED,oDAAoD;QACpD,WAAW,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAExB,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC7B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,cAAc,GAAG,CACnB,KAAqB,EACrB,MAAS,EACH,EAAE;IACR,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5B,OAAO,CAAC,CAAC;QACb,CAAC;IACL,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACd,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,aAAa,GAAG,CAClB,MAAS,EACT,eAAuB,EACvB,KAAqB,EACrB,SAAyB,EAClB,EAAE;IACT,6EAA6E;IAC7E,MAAM,YAAY,GAAG,IAAI,GAAG,EAAK,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC;QAC7C,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACnB,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;IACL,CAAC;IAED,gEAAgE;IAChE,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;IACpC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC3C,IAAI,OAAO,IAAI,eAAe,EAAE,CAAC;YAC7B,OAAO,KAAK,CAAC;QACjB,CAAC;IACL,CAAC;IAED,6DAA6D;IAC7D,KAAK,MAAM,SAAS,IAAI,YAAY,EAAE,CAAC;QACnC,MAAM,aAAa,GAAG,cAAc,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QACvD,IAAI,aAAa,IAAI,eAAe,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC;QACjB,CAAC;IACL,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,kBAAkB,GAAG,CACvB,MAAS,EACT,OAA0B,EAC1B,KAAqB,EACf,EAAE;IACR,IAAI,aAAa,GAAG,CAAC,CAAC,CAAC;IACvB,IAAI,eAAe,GAAG,CAAC,CAAC;IAExB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC3B,MAAM,eAAe,GAAG,cAAc,CAAC,KAAK,EAAE,MAAW,CAAC,CAAC;QAC3D,IAAI,eAAe,KAAK,CAAC,CAAC,EAAE,CAAC;YACzB,SAAS,CAAC,6BAA6B;QAC3C,CAAC;QAED,0CAA0C;QAC1C,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;YACnC,MAAM,IAAI,GAAG,cAAc,CAAC,KAAK,EAAE,CAAM,CAAC,CAAC;YAC3C,OAAO,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,KAAK,eAAe,CAAC;QACnD,CAAC,CAAC,CAAC,MAAM,CAAC;QAEV,IAAI,WAAW,GAAG,eAAe,EAAE,CAAC;YAChC,eAAe,GAAG,WAAW,CAAC;YAC9B,aAAa,GAAG,eAAe,CAAC;QACpC,CAAC;IACL,CAAC;IAED,OAAO,aAAa,CAAC;AACzB,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,yBAAyB,GAAG,CAC9B,KAAY,EACZ,WAAyB,EACzB,OAAiD,EACjD,SAAyB,EACrB,EAAE;IACN,4CAA4C;IAC5C,MAAM,iBAAiB,GAAqD,EAAE,CAAC;IAC/E,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC;QACxC,IAAI,QAAQ,EAAE,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjD,iBAAiB,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;QACvE,CAAC;IACL,CAAC;IAED,sEAAsE;IACtE,KAAK,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,iBAAiB,EAAE,CAAC;QAClD,MAAM,gBAAgB,GAAG,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACvD,MAAM,aAAa,GAAG,kBAAkB,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QAEjE,sEAAsE;QACtE,IAAI,aAAa,KAAK,CAAC,CAAC,IAAI,aAAa,KAAK,gBAAgB,EAAE,CAAC;YAC7D,IAAI,aAAa,CAAC,MAAM,EAAE,aAAa,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;gBACzD,6BAA6B;gBAC7B,MAAM,WAAW,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC;gBAC5C,MAAM,UAAU,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC;gBAExC,2BAA2B;gBAC3B,MAAM,KAAK,GAAG,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC1C,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;oBACf,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBACjC,CAAC;gBAED,qDAAqD;gBACrD,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACxB,UAAU,CAAC,IAAI,EAAE,CAAC;YACtB,CAAC;QACL,CAAC;IACL,CAAC;AACL,CAAC,CAAC;AAEF;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAChC,OAAiD,EAC5C,EAAE;IACP,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAQ,CAAC;IAEhD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,CAAC;IACd,CAAC;IAED,uEAAuE;IACvE,MAAM,SAAS,GAAG,oBAAoB,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IAE7D,yBAAyB;IACzB,YAAY,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAErC,8CAA8C;IAC9C,MAAM,KAAK,GAAG,UAAU,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAEjD,mEAAmE;IACnE,yBAAyB,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IAElE,4EAA4E;IAC5E,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACjD,CAAC,CAAC"}