@manifesto-ai/core 0.3.0 → 1.3.0

package/package.json

@@ -1,10 +1,26 @@
 {
   "name": "@manifesto-ai/core",
-  "version": "0.3.0",
-  "description": "AI Native Semantic Layer for SaaS Business Logic",
+  "version": "1.3.0",
+  "description": "Manifesto Core - Pure semantic calculator for deterministic state computation",
+  "author": "eggplantiny <eggplantiny@gmail.com>",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/manifesto-ai/core.git",
+    "directory": "packages/core"
+  },
+  "bugs": {
+    "url": "https://github.com/manifesto-ai/core/issues"
+  },
+  "homepage": "https://github.com/manifesto-ai/core/tree/main/packages/core#readme",
+  "keywords": [
+    "manifesto",
+    "state-management",
+    "deterministic",
+    "semantic"
+  ],
   "type": "module",
   "main": "./dist/index.js",
-  "module": "./dist/index.js",
   "types": "./dist/index.d.ts",
   "exports": {
     ".": {
@@ -13,46 +29,17 @@
     }
   },
   "files": [
-    "dist",
-    "README.md",
-    "LICENSE"
-  ],
-  "keywords": [
-    "manifesto",
-    "ai",
-    "semantic",
-    "domain",
-    "dsl"
+    "dist"
   ],
-  "author": "Manifesto Team",
-  "license": "MIT",
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/manifesto-ai/core.git",
-    "directory": "packages/core"
-  },
-  "homepage": "https://github.com/manifesto-ai/core/tree/main/packages/core#readme",
-  "bugs": {
-    "url": "https://github.com/manifesto-ai/core/issues"
-  },
-  "publishConfig": {
-    "access": "public"
-  },
-  "dependencies": {
-    "zod": "^3.24.1"
-  },
-  "devDependencies": {
-    "@types/node": "^22.10.2",
-    "@vitest/coverage-v8": "^2.1.9",
-    "typescript": "^5.7.2",
-    "vitest": "^2.1.9"
-  },
   "scripts": {
     "build": "tsc",
+    "dev": "tsc --watch",
+    "clean": "rm -rf dist",
+    "lint": "echo 'lint not configured'",
     "test": "vitest run",
-    "test:watch": "vitest",
-    "test:coverage": "vitest run --coverage",
-    "typecheck": "tsc --noEmit",
-    "clean": "rm -rf dist"
+    "test:coverage": "vitest run --coverage"
+  },
+  "devDependencies": {
+    "typescript": "^5.7.2"
   }
-}
+}

package/LICENSE

@@ -1,21 +0,0 @@
-MIT License
-
-Copyright (c) 2024 Manifesto AI
-
-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.

package/dist/dag/graph.d.ts

@@ -1,62 +0,0 @@
-import type { SemanticPath, ManifestoDomain, SourceDefinition, DerivedDefinition, AsyncDefinition } from '../domain/types.js';
-/**
- * DagNode: 그래프 노드
- */
-export type DagNode = SourceNode | DerivedNode | AsyncNode;
-export type SourceNode = {
-    kind: 'source';
-    path: SemanticPath;
-    definition: SourceDefinition;
-};
-export type DerivedNode = {
-    kind: 'derived';
-    path: SemanticPath;
-    definition: DerivedDefinition;
-};
-export type AsyncNode = {
-    kind: 'async';
-    path: SemanticPath;
-    definition: AsyncDefinition;
-};
-/**
- * DependencyGraph: Semantic Path 간 의존 관계 그래프
- */
-export type DependencyGraph = {
-    /** 모든 노드 */
-    nodes: Map<SemanticPath, DagNode>;
-    /** 정방향 엣지: path → 이 path가 의존하는 것들 */
-    dependencies: Map<SemanticPath, Set<SemanticPath>>;
-    /** 역방향 엣지: path → 이 path를 의존하는 것들 */
-    dependents: Map<SemanticPath, Set<SemanticPath>>;
-    /** 위상 정렬된 순서 */
-    topologicalOrder: SemanticPath[];
-};
-/**
- * 도메인에서 의존성 그래프 구축
- */
-export declare function buildDependencyGraph<TData, TState>(domain: ManifestoDomain<TData, TState>): DependencyGraph;
-/**
- * 특정 경로의 직접 의존성 조회
- */
-export declare function getDirectDependencies(graph: DependencyGraph, path: SemanticPath): SemanticPath[];
-/**
- * 특정 경로를 직접 의존하는 경로들 조회
- */
-export declare function getDirectDependents(graph: DependencyGraph, path: SemanticPath): SemanticPath[];
-/**
- * 특정 경로의 모든 의존성 조회 (전이적)
- */
-export declare function getAllDependencies(graph: DependencyGraph, path: SemanticPath): SemanticPath[];
-/**
- * 특정 경로를 의존하는 모든 경로 조회 (전이적)
- */
-export declare function getAllDependents(graph: DependencyGraph, path: SemanticPath): SemanticPath[];
-/**
- * 순환 의존성이 있는지 확인
- */
-export declare function hasCycle(graph: DependencyGraph): boolean;
-/**
- * 두 경로 사이의 경로 찾기 (BFS)
- */
-export declare function findPath(graph: DependencyGraph, from: SemanticPath, to: SemanticPath): SemanticPath[] | null;
-//# sourceMappingURL=graph.d.ts.map

package/dist/dag/graph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/dag/graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,YAAY,EACZ,eAAe,EACf,gBAAgB,EAChB,iBAAiB,EACjB,eAAe,EAChB,MAAM,oBAAoB,CAAC;AAG5B;;GAEG;AACH,MAAM,MAAM,OAAO,GAAG,UAAU,GAAG,WAAW,GAAG,SAAS,CAAC;AAE3D,MAAM,MAAM,UAAU,GAAG;IACvB,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,EAAE,YAAY,CAAC;IACnB,UAAU,EAAE,gBAAgB,CAAC;CAC9B,CAAC;AAEF,MAAM,MAAM,WAAW,GAAG;IACxB,IAAI,EAAE,SAAS,CAAC;IAChB,IAAI,EAAE,YAAY,CAAC;IACnB,UAAU,EAAE,iBAAiB,CAAC;CAC/B,CAAC;AAEF,MAAM,MAAM,SAAS,GAAG;IACtB,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,YAAY,CAAC;IACnB,UAAU,EAAE,eAAe,CAAC;CAC7B,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,eAAe,GAAG;IAC5B,YAAY;IACZ,KAAK,EAAE,GAAG,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;IAElC,qCAAqC;IACrC,YAAY,EAAE,GAAG,CAAC,YAAY,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;IAEnD,qCAAqC;IACrC,UAAU,EAAE,GAAG,CAAC,YAAY,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;IAEjD,gBAAgB;IAChB,gBAAgB,EAAE,YAAY,EAAE,CAAC;CAClC,CAAC;AAEF;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,MAAM,EAChD,MAAM,EAAE,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,GACrC,eAAe,CAiGjB;AAoDD;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,eAAe,EACtB,IAAI,EAAE,YAAY,GACjB,YAAY,EAAE,CAEhB;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,eAAe,EACtB,IAAI,EAAE,YAAY,GACjB,YAAY,EAAE,CAEhB;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,eAAe,EACtB,IAAI,EAAE,YAAY,GACjB,YAAY,EAAE,CAmBhB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,eAAe,EACtB,IAAI,EAAE,YAAY,GACjB,YAAY,EAAE,CAmBhB;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CA8BxD;AAED;;GAEG;AACH,wBAAgB,QAAQ,CACtB,KAAK,EAAE,eAAe,EACtB,IAAI,EAAE,YAAY,EAClB,EAAE,EAAE,YAAY,GACf,YAAY,EAAE,GAAG,IAAI,CA4BvB"}

package/dist/dag/graph.js

@@ -1,244 +0,0 @@
-import { extractPaths } from '../expression/parser.js';
-/**
- * 도메인에서 의존성 그래프 구축
- */
-export function buildDependencyGraph(domain) {
-    const nodes = new Map();
-    const dependencies = new Map();
-    const dependents = new Map();
-    // 1. Source 노드 추가
-    for (const [path, definition] of Object.entries(domain.paths.sources)) {
-        nodes.set(path, { kind: 'source', path, definition });
-        dependencies.set(path, new Set());
-        if (!dependents.has(path)) {
-            dependents.set(path, new Set());
-        }
-    }
-    // 2. Derived 노드 추가
-    for (const [path, definition] of Object.entries(domain.paths.derived)) {
-        nodes.set(path, { kind: 'derived', path, definition });
-        // Expression에서 의존성 추출
-        const deps = new Set(definition.deps);
-        const exprDeps = extractPaths(definition.expr);
-        for (const dep of exprDeps) {
-            if (!dep.startsWith('$')) {
-                deps.add(dep);
-            }
-        }
-        dependencies.set(path, deps);
-        // 역방향 엣지 추가
-        for (const dep of deps) {
-            if (!dependents.has(dep)) {
-                dependents.set(dep, new Set());
-            }
-            dependents.get(dep).add(path);
-        }
-        if (!dependents.has(path)) {
-            dependents.set(path, new Set());
-        }
-    }
-    // 3. Async 노드 추가
-    for (const [path, definition] of Object.entries(domain.paths.async)) {
-        nodes.set(path, { kind: 'async', path, definition });
-        // Async의 의존성
-        const deps = new Set(definition.deps);
-        if (definition.condition) {
-            const condDeps = extractPaths(definition.condition);
-            for (const dep of condDeps) {
-                if (!dep.startsWith('$')) {
-                    deps.add(dep);
-                }
-            }
-        }
-        dependencies.set(path, deps);
-        // 역방향 엣지 추가
-        for (const dep of deps) {
-            if (!dependents.has(dep)) {
-                dependents.set(dep, new Set());
-            }
-            dependents.get(dep).add(path);
-        }
-        // result, loading, error 경로도 노드로 등록 (source처럼 취급)
-        for (const statePath of [
-            definition.resultPath,
-            definition.loadingPath,
-            definition.errorPath,
-        ]) {
-            if (!nodes.has(statePath)) {
-                // Async 결과 경로는 특별한 source로 취급
-                dependencies.set(statePath, new Set([path]));
-                if (!dependents.has(statePath)) {
-                    dependents.set(statePath, new Set());
-                }
-                dependents.get(path).add(statePath);
-            }
-        }
-        if (!dependents.has(path)) {
-            dependents.set(path, new Set());
-        }
-    }
-    // 4. 위상 정렬
-    const topologicalOrder = topologicalSort(nodes, dependencies);
-    return {
-        nodes,
-        dependencies,
-        dependents,
-        topologicalOrder,
-    };
-}
-/**
- * 위상 정렬 (Kahn's algorithm)
- */
-function topologicalSort(nodes, dependencies) {
-    const inDegree = new Map();
-    const result = [];
-    // 진입 차수 계산
-    for (const path of nodes.keys()) {
-        inDegree.set(path, 0);
-    }
-    for (const [path, deps] of dependencies) {
-        for (const dep of deps) {
-            if (nodes.has(dep)) {
-                inDegree.set(path, (inDegree.get(path) ?? 0) + 1);
-            }
-        }
-    }
-    // 진입 차수가 0인 노드들로 시작
-    const queue = [];
-    for (const [path, degree] of inDegree) {
-        if (degree === 0) {
-            queue.push(path);
-        }
-    }
-    while (queue.length > 0) {
-        const current = queue.shift();
-        result.push(current);
-        // 현재 노드를 의존하는 노드들의 진입 차수 감소
-        for (const [path, deps] of dependencies) {
-            if (deps.has(current)) {
-                const newDegree = (inDegree.get(path) ?? 0) - 1;
-                inDegree.set(path, newDegree);
-                if (newDegree === 0) {
-                    queue.push(path);
-                }
-            }
-        }
-    }
-    return result;
-}
-/**
- * 특정 경로의 직접 의존성 조회
- */
-export function getDirectDependencies(graph, path) {
-    return [...(graph.dependencies.get(path) ?? [])];
-}
-/**
- * 특정 경로를 직접 의존하는 경로들 조회
- */
-export function getDirectDependents(graph, path) {
-    return [...(graph.dependents.get(path) ?? [])];
-}
-/**
- * 특정 경로의 모든 의존성 조회 (전이적)
- */
-export function getAllDependencies(graph, path) {
-    const result = new Set();
-    const visited = new Set();
-    function traverse(current) {
-        if (visited.has(current))
-            return;
-        visited.add(current);
-        const deps = graph.dependencies.get(current);
-        if (deps) {
-            for (const dep of deps) {
-                result.add(dep);
-                traverse(dep);
-            }
-        }
-    }
-    traverse(path);
-    return [...result];
-}
-/**
- * 특정 경로를 의존하는 모든 경로 조회 (전이적)
- */
-export function getAllDependents(graph, path) {
-    const result = new Set();
-    const visited = new Set();
-    function traverse(current) {
-        if (visited.has(current))
-            return;
-        visited.add(current);
-        const deps = graph.dependents.get(current);
-        if (deps) {
-            for (const dep of deps) {
-                result.add(dep);
-                traverse(dep);
-            }
-        }
-    }
-    traverse(path);
-    return [...result];
-}
-/**
- * 순환 의존성이 있는지 확인
- */
-export function hasCycle(graph) {
-    const visited = new Set();
-    const recursionStack = new Set();
-    function dfs(path) {
-        visited.add(path);
-        recursionStack.add(path);
-        const deps = graph.dependencies.get(path);
-        if (deps) {
-            for (const dep of deps) {
-                if (!visited.has(dep)) {
-                    if (dfs(dep))
-                        return true;
-                }
-                else if (recursionStack.has(dep)) {
-                    return true;
-                }
-            }
-        }
-        recursionStack.delete(path);
-        return false;
-    }
-    for (const path of graph.nodes.keys()) {
-        if (!visited.has(path)) {
-            if (dfs(path))
-                return true;
-        }
-    }
-    return false;
-}
-/**
- * 두 경로 사이의 경로 찾기 (BFS)
- */
-export function findPath(graph, from, to) {
-    if (from === to)
-        return [from];
-    const visited = new Set();
-    const queue = [
-        { path: from, trail: [from] },
-    ];
-    while (queue.length > 0) {
-        const { path, trail } = queue.shift();
-        if (visited.has(path))
-            continue;
-        visited.add(path);
-        const deps = graph.dependents.get(path);
-        if (deps) {
-            for (const dep of deps) {
-                if (dep === to) {
-                    return [...trail, dep];
-                }
-                if (!visited.has(dep)) {
-                    queue.push({ path: dep, trail: [...trail, dep] });
-                }
-            }
-        }
-    }
-    return null;
-}
-//# sourceMappingURL=graph.js.map

package/dist/dag/graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/dag/graph.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AA0CvD;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAsC;IAEtC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC/C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAmC,CAAC;IAChE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAmC,CAAC;IAE9D,kBAAkB;IAClB,KAAK,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QACtE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;QACtD,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAClC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,KAAK,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QACtE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;QAEvD,sBAAsB;QACtB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAe,UAAU,CAAC,IAAI,CAAC,CAAC;QACpD,MAAM,QAAQ,GAAG,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC/C,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QAED,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAE7B,YAAY;QACZ,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACjC,CAAC;YACD,UAAU,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC;QAED,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,iBAAiB;IACjB,KAAK,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QACpE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;QAErD,aAAa;QACb,MAAM,IAAI,GAAG,IAAI,GAAG,CAAe,UAAU,CAAC,IAAI,CAAC,CAAC;QACpD,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;YACzB,MAAM,QAAQ,GAAG,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACpD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;gBAC3B,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;oBACzB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QAED,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAE7B,YAAY;QACZ,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACjC,CAAC;YACD,UAAU,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC;QAED,kDAAkD;QAClD,KAAK,MAAM,SAAS,IAAI;YACtB,UAAU,CAAC,UAAU;YACrB,UAAU,CAAC,WAAW;YACtB,UAAU,CAAC,SAAS;SACrB,EAAE,CAAC;YACF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC1B,8BAA8B;gBAC9B,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC7C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC/B,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBACvC,CAAC;gBACD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,WAAW;IACX,MAAM,gBAAgB,GAAG,eAAe,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IAE9D,OAAO;QACL,KAAK;QACL,YAAY;QACZ,UAAU;QACV,gBAAgB;KACjB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CACtB,KAAiC,EACjC,YAAkD;IAElD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAC;IACjD,MAAM,MAAM,GAAmB,EAAE,CAAC;IAElC,WAAW;IACX,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAChC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACxB,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,YAAY,EAAE,CAAC;QACxC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;IACH,CAAC;IAED,oBAAoB;IACpB,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACtC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAErB,4BAA4B;QAC5B,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,YAAY,EAAE,CAAC;YACxC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBACtB,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAChD,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;gBAC9B,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;oBACpB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAsB,EACtB,IAAkB;IAElB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACnD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAsB,EACtB,IAAkB;IAElB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACjD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAChC,KAAsB,EACtB,IAAkB;IAElB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgB,CAAC;IACvC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;IAExC,SAAS,QAAQ,CAAC,OAAqB;QACrC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,OAAO;QACjC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAErB,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAI,IAAI,EAAE,CAAC;YACT,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChB,QAAQ,CAAC,GAAG,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAED,QAAQ,CAAC,IAAI,CAAC,CAAC;IACf,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC;AACrB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAsB,EACtB,IAAkB;IAElB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgB,CAAC;IACvC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;IAExC,SAAS,QAAQ,CAAC,OAAqB;QACrC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,OAAO;QACjC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAErB,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAI,IAAI,EAAE,CAAC;YACT,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChB,QAAQ,CAAC,GAAG,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAED,QAAQ,CAAC,IAAI,CAAC,CAAC;IACf,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC;AACrB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAsB;IAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;IACxC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAgB,CAAC;IAE/C,SAAS,GAAG,CAAC,IAAkB;QAC7B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEzB,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,IAAI,EAAE,CAAC;YACT,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACtB,IAAI,GAAG,CAAC,GAAG,CAAC;wBAAE,OAAO,IAAI,CAAC;gBAC5B,CAAC;qBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACnC,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QAED,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5B,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QACtC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,IAAI,GAAG,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,QAAQ,CACtB,KAAsB,EACtB,IAAkB,EAClB,EAAgB;IAEhB,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAE/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;IACxC,MAAM,KAAK,GAAoD;QAC7D,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE;KAC9B,CAAC;IAEF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAEvC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAElB,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,IAAI,EAAE,CAAC;YACT,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,IAAI,GAAG,KAAK,EAAE,EAAE,CAAC;oBACf,OAAO,CAAC,GAAG,KAAK,EAAE,GAAG,CAAC,CAAC;gBACzB,CAAC;gBACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACtB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;gBACpD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/dag/index.d.ts

@@ -1,4 +0,0 @@
-export * from './graph.js';
-export * from './topological.js';
-export * from './propagation.js';
-//# sourceMappingURL=index.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/dag/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC"}

package/dist/dag/index.js

@@ -1,4 +0,0 @@
-export * from './graph.js';
-export * from './topological.js';
-export * from './propagation.js';
-//# sourceMappingURL=index.js.map

package/dist/dag/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/dag/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC"}

package/dist/dag/propagation.d.ts

@@ -1,58 +0,0 @@
-import type { SemanticPath } from '../domain/types.js';
-import type { DependencyGraph, DagNode } from './graph.js';
-import type { Effect } from '../effect/types.js';
-/**
- * 전파 결과
- */
-export type PropagationResult = {
-    /** 변경된 경로와 새 값 */
-    changes: Map<SemanticPath, unknown>;
-    /** 트리거된 Async Effect들 */
-    pendingEffects: Array<{
-        path: SemanticPath;
-        effect: Effect;
-    }>;
-    /** 발생한 오류들 */
-    errors: Array<{
-        path: SemanticPath;
-        error: string;
-    }>;
-};
-/**
- * 스냅샷 인터페이스
- */
-export type SnapshotLike = {
-    get: (path: SemanticPath) => unknown;
-    set: (path: SemanticPath, value: unknown) => void;
-};
-/**
- * 변경 전파
- */
-export declare function propagate(graph: DependencyGraph, changedPaths: SemanticPath[], snapshot: SnapshotLike): PropagationResult;
-/**
- * Async Effect 완료 후 결과 전파
- */
-export declare function propagateAsyncResult(graph: DependencyGraph, asyncPath: SemanticPath, result: {
-    ok: true;
-    value: unknown;
-} | {
-    ok: false;
-    error: string;
-}, snapshot: SnapshotLike): PropagationResult;
-/**
- * 특정 경로 변경 시 영향 분석
- */
-export declare function analyzeImpact(graph: DependencyGraph, path: SemanticPath): {
-    affectedPaths: SemanticPath[];
-    affectedNodes: DagNode[];
-    asyncTriggers: SemanticPath[];
-};
-/**
- * 디바운스된 전파를 위한 유틸리티
- */
-export declare function createDebouncedPropagator(graph: DependencyGraph, snapshot: SnapshotLike, debounceMs: number): {
-    queue: (paths: SemanticPath[]) => void;
-    flush: () => PropagationResult;
-    cancel: () => void;
-};
-//# sourceMappingURL=propagation.d.ts.map

package/dist/dag/propagation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"propagation.d.ts","sourceRoot":"","sources":["../../src/dag/propagation.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,KAAK,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAC3D,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAKjD;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG;IAC9B,kBAAkB;IAClB,OAAO,EAAE,GAAG,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;IAEpC,yBAAyB;IACzB,cAAc,EAAE,KAAK,CAAC;QACpB,IAAI,EAAE,YAAY,CAAC;QACnB,MAAM,EAAE,MAAM,CAAC;KAChB,CAAC,CAAC;IAEH,cAAc;IACd,MAAM,EAAE,KAAK,CAAC;QACZ,IAAI,EAAE,YAAY,CAAC;QACnB,KAAK,EAAE,MAAM,CAAC;KACf,CAAC,CAAC;CACJ,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,YAAY,GAAG;IACzB,GAAG,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,OAAO,CAAC;IACrC,GAAG,EAAE,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,OAAO,KAAK,IAAI,CAAC;CACnD,CAAC;AAEF;;GAEG;AACH,wBAAgB,SAAS,CACvB,KAAK,EAAE,eAAe,EACtB,YAAY,EAAE,YAAY,EAAE,EAC5B,QAAQ,EAAE,YAAY,GACrB,iBAAiB,CAkFnB;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,eAAe,EACtB,SAAS,EAAE,YAAY,EACvB,MAAM,EAAE;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,EACnE,QAAQ,EAAE,YAAY,GACrB,iBAAiB,CAwCnB;AAED;;GAEG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,eAAe,EACtB,IAAI,EAAE,YAAY,GACjB;IACD,aAAa,EAAE,YAAY,EAAE,CAAC;IAC9B,aAAa,EAAE,OAAO,EAAE,CAAC;IACzB,aAAa,EAAE,YAAY,EAAE,CAAC;CAC/B,CAoBA;AAuCD;;GAEG;AACH,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,eAAe,EACtB,QAAQ,EAAE,YAAY,EACtB,UAAU,EAAE,MAAM,GACjB;IACD,KAAK,EAAE,CAAC,KAAK,EAAE,YAAY,EAAE,KAAK,IAAI,CAAC;IACvC,KAAK,EAAE,MAAM,iBAAiB,CAAC;IAC/B,MAAM,EAAE,MAAM,IAAI,CAAC;CACpB,CA+CA"}