@agent-workspace/utils 0.5.0

package/README.md

@@ -0,0 +1,80 @@
+# @agent-workspace/utils
+
+Shared utilities for the [Agent Workspace Protocol](https://github.com/marcoloco23/awp) packages.
+
+## Installation
+
+```bash
+npm install @agent-workspace/utils
+```
+
+## Usage
+
+### Validation
+
+```typescript
+import { validateSlug, sanitizeSlug, validatePath } from "@agent-workspace/utils";
+
+// Validate a slug
+validateSlug("my-artifact"); // true
+validateSlug("Invalid_Slug"); // false
+
+// Sanitize and validate (throws on invalid)
+const slug = sanitizeSlug("My-Artifact"); // "my-artifact"
+
+// Validate path is within root (prevents traversal)
+const safePath = validatePath("/workspace", "artifacts/doc.md");
+```
+
+### Reputation
+
+```typescript
+import {
+  computeDecayedScore,
+  updateDimension,
+  computeConfidence,
+} from "@agent-workspace/utils";
+
+// Compute decayed score (decays toward 0.5 over time)
+const decayed = computeDecayedScore(dimension, new Date());
+
+// Update dimension with new signal using EWMA
+const updated = updateDimension(existingDimension, 0.9);
+
+// Compute confidence from sample size
+const confidence = computeConfidence(10); // ~0.5
+```
+
+### Frontmatter
+
+```typescript
+import {
+  parseWorkspaceFile,
+  writeWorkspaceFile,
+  serializeWorkspaceFile,
+} from "@agent-workspace/utils";
+import type { IdentityFrontmatter } from "@agent-workspace/core";
+
+// Parse a workspace file
+const identity = await parseWorkspaceFile<IdentityFrontmatter>("IDENTITY.md");
+console.log(identity.frontmatter.name);
+
+// Modify and write back
+identity.frontmatter.lastModified = new Date().toISOString();
+await writeWorkspaceFile(identity);
+```
+
+## Part of AWP
+
+This package is part of the [Agent Workspace Protocol](https://github.com/marcoloco23/awp) monorepo:
+
+| Package | Description |
+|---------|-------------|
+| [@agent-workspace/core](https://www.npmjs.com/package/@agent-workspace/core) | Types, constants, JSON schemas |
+| [@agent-workspace/cli](https://www.npmjs.com/package/@agent-workspace/cli) | CLI tool |
+| [@agent-workspace/mcp-server](https://www.npmjs.com/package/@agent-workspace/mcp-server) | MCP server |
+| **@agent-workspace/utils** | Shared utilities |
+
+## License
+
+Apache-2.0

package/dist/frontmatter.d.ts

@@ -0,0 +1,30 @@
+import type { BaseFrontmatter, WorkspaceFile } from "@agent-workspace/core";
+/**
+ * Parse an AWP workspace file (Markdown with YAML frontmatter).
+ *
+ * @template T - The frontmatter type
+ * @param filePath - Path to the file
+ * @returns Parsed workspace file
+ */
+export declare function parseWorkspaceFile<T extends BaseFrontmatter>(filePath: string): Promise<WorkspaceFile<T>>;
+/**
+ * Serialize a workspace file back to Markdown with YAML frontmatter.
+ *
+ * @param file - The workspace file to serialize
+ * @returns Serialized content string
+ */
+export declare function serializeWorkspaceFile<T extends BaseFrontmatter>(file: WorkspaceFile<T>): string;
+/**
+ * Write a workspace file to disk.
+ *
+ * @param file - The workspace file to write
+ */
+export declare function writeWorkspaceFile<T extends BaseFrontmatter>(file: WorkspaceFile<T>): Promise<void>;
+/**
+ * Extract the type from frontmatter data.
+ *
+ * @param data - The frontmatter data
+ * @returns The type string or undefined
+ */
+export declare function getFrontmatterType(data: Record<string, unknown>): string | undefined;
+//# sourceMappingURL=frontmatter.d.ts.map

package/dist/frontmatter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"frontmatter.d.ts","sourceRoot":"","sources":["../src/frontmatter.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAE5E;;;;;;GAMG;AACH,wBAAsB,kBAAkB,CAAC,CAAC,SAAS,eAAe,EAChE,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAQ3B;AAED;;;;;GAKG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,SAAS,eAAe,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,MAAM,CAEhG;AAED;;;;GAIG;AACH,wBAAsB,kBAAkB,CAAC,CAAC,SAAS,eAAe,EAChE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,GACrB,OAAO,CAAC,IAAI,CAAC,CAGf;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,GAAG,SAAS,CAEpF"}

package/dist/frontmatter.js

@@ -0,0 +1,46 @@
+import { readFile, writeFile } from "node:fs/promises";
+import matter from "gray-matter";
+/**
+ * Parse an AWP workspace file (Markdown with YAML frontmatter).
+ *
+ * @template T - The frontmatter type
+ * @param filePath - Path to the file
+ * @returns Parsed workspace file
+ */
+export async function parseWorkspaceFile(filePath) {
+    const raw = await readFile(filePath, "utf-8");
+    const { data, content } = matter(raw);
+    return {
+        frontmatter: data,
+        body: content,
+        filePath,
+    };
+}
+/**
+ * Serialize a workspace file back to Markdown with YAML frontmatter.
+ *
+ * @param file - The workspace file to serialize
+ * @returns Serialized content string
+ */
+export function serializeWorkspaceFile(file) {
+    return matter.stringify(file.body, file.frontmatter);
+}
+/**
+ * Write a workspace file to disk.
+ *
+ * @param file - The workspace file to write
+ */
+export async function writeWorkspaceFile(file) {
+    const content = serializeWorkspaceFile(file);
+    await writeFile(file.filePath, content, "utf-8");
+}
+/**
+ * Extract the type from frontmatter data.
+ *
+ * @param data - The frontmatter data
+ * @returns The type string or undefined
+ */
+export function getFrontmatterType(data) {
+    return typeof data.type === "string" ? data.type : undefined;
+}
+//# sourceMappingURL=frontmatter.js.map

package/dist/frontmatter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"frontmatter.js","sourceRoot":"","sources":["../src/frontmatter.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AACvD,OAAO,MAAM,MAAM,aAAa,CAAC;AAGjC;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,QAAgB;IAEhB,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC9C,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IACtC,OAAO;QACL,WAAW,EAAE,IAAS;QACtB,IAAI,EAAE,OAAO;QACb,QAAQ;KACT,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CAA4B,IAAsB;IACtF,OAAO,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;AACvD,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,IAAsB;IAEtB,MAAM,OAAO,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC;IAC7C,MAAM,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;AACnD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAA6B;IAC9D,OAAO,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;AAC/D,CAAC"}

package/dist/graph.d.ts

@@ -0,0 +1,109 @@
+/**
+ * Dependency graph algorithms for task ordering and cycle detection.
+ *
+ * Implements:
+ * - Topological sort (Kahn's algorithm)
+ * - Cycle detection (DFS-based)
+ * - Critical path analysis
+ * - Blocked task identification
+ */
+/**
+ * Minimal task node for graph operations.
+ */
+export interface TaskNode {
+    /** Task ID in format task:<project>/<slug> */
+    id: string;
+    /** Task IDs that must complete before this task */
+    blockedBy: string[];
+    /** Task IDs that are waiting on this task */
+    blocks: string[];
+    /** Current task status */
+    status: string;
+}
+/**
+ * Adjacency list representation of a dependency graph.
+ */
+export interface DependencyGraph {
+    /** Map of task ID to task node */
+    nodes: Map<string, TaskNode>;
+    /** Adjacency list: task ID -> IDs of tasks it depends on (blockedBy) */
+    inEdges: Map<string, Set<string>>;
+    /** Reverse adjacency: task ID -> IDs of tasks that depend on it (blocks) */
+    outEdges: Map<string, Set<string>>;
+}
+/**
+ * Result of analyzing a task dependency graph.
+ */
+export interface GraphAnalysis {
+    /** Topologically sorted task IDs (null if cycle exists) */
+    sorted: string[] | null;
+    /** Detected cycles (each cycle is an array of task IDs) */
+    cycles: string[][];
+    /** Critical path (longest dependency chain) */
+    criticalPath: string[];
+    /** Tasks blocked by incomplete dependencies: task ID -> blocking task IDs */
+    blocked: Map<string, string[]>;
+    /** True if the graph is a valid DAG (no cycles) */
+    isValid: boolean;
+}
+/**
+ * Build a dependency graph from a list of task nodes.
+ *
+ * @param tasks - Array of task nodes
+ * @returns Dependency graph with adjacency lists
+ */
+export declare function buildGraph(tasks: TaskNode[]): DependencyGraph;
+/**
+ * Topologically sort tasks using Kahn's algorithm.
+ * Returns null if a cycle is detected.
+ *
+ * @param graph - Dependency graph
+ * @returns Sorted task IDs in execution order, or null if cycle exists
+ */
+export declare function topologicalSort(graph: DependencyGraph): string[] | null;
+/**
+ * Detect all cycles in the dependency graph using DFS.
+ *
+ * @param graph - Dependency graph
+ * @returns Array of cycles, where each cycle is an array of task IDs
+ */
+export declare function detectCycles(graph: DependencyGraph): string[][];
+/**
+ * Find the critical path (longest dependency chain) in the graph.
+ * Uses dynamic programming on the DAG.
+ *
+ * @param graph - Dependency graph
+ * @returns Array of task IDs forming the critical path
+ */
+export declare function findCriticalPath(graph: DependencyGraph): string[];
+/**
+ * Find tasks that are blocked by incomplete dependencies.
+ *
+ * @param graph - Dependency graph
+ * @returns Map of task ID -> array of blocking (incomplete) task IDs
+ */
+export declare function getBlockedTasks(graph: DependencyGraph): Map<string, string[]>;
+/**
+ * Perform a complete analysis of the task dependency graph.
+ *
+ * @param tasks - Array of task nodes
+ * @returns Full graph analysis including sort, cycles, critical path, and blocked tasks
+ */
+export declare function analyzeGraph(tasks: TaskNode[]): GraphAnalysis;
+/**
+ * Extract the task slug from a full task ID.
+ * e.g., "task:q3-launch/research" -> "research"
+ *
+ * @param taskId - Full task ID
+ * @returns Task slug
+ */
+export declare function getTaskSlug(taskId: string): string;
+/**
+ * Extract the project slug from a full task ID.
+ * e.g., "task:q3-launch/research" -> "q3-launch"
+ *
+ * @param taskId - Full task ID
+ * @returns Project slug
+ */
+export declare function getProjectSlug(taskId: string): string;
+//# sourceMappingURL=graph.d.ts.map

package/dist/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,8CAA8C;IAC9C,EAAE,EAAE,MAAM,CAAC;IACX,mDAAmD;IACnD,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,6CAA6C;IAC7C,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,0BAA0B;IAC1B,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,kCAAkC;IAClC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC7B,wEAAwE;IACxE,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAClC,4EAA4E;IAC5E,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;CACpC;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,2DAA2D;IAC3D,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IACxB,2DAA2D;IAC3D,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACnB,+CAA+C;IAC/C,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,6EAA6E;IAC7E,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC/B,mDAAmD;IACnD,OAAO,EAAE,OAAO,CAAC;CAClB;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,eAAe,CAwB7D;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,eAAe,GAAG,MAAM,EAAE,GAAG,IAAI,CAuCvE;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,eAAe,GAAG,MAAM,EAAE,EAAE,CAmD/D;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,eAAe,GAAG,MAAM,EAAE,CAoDjE;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,eAAe,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAwB7E;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,aAAa,CAc7D;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAGlD;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAGrD"}

package/dist/graph.js

@@ -0,0 +1,252 @@
+/**
+ * Dependency graph algorithms for task ordering and cycle detection.
+ *
+ * Implements:
+ * - Topological sort (Kahn's algorithm)
+ * - Cycle detection (DFS-based)
+ * - Critical path analysis
+ * - Blocked task identification
+ */
+/**
+ * Build a dependency graph from a list of task nodes.
+ *
+ * @param tasks - Array of task nodes
+ * @returns Dependency graph with adjacency lists
+ */
+export function buildGraph(tasks) {
+    const nodes = new Map();
+    const inEdges = new Map();
+    const outEdges = new Map();
+    // Initialize all nodes
+    for (const task of tasks) {
+        nodes.set(task.id, task);
+        inEdges.set(task.id, new Set());
+        outEdges.set(task.id, new Set());
+    }
+    // Build adjacency lists from blockedBy relationships
+    for (const task of tasks) {
+        for (const dep of task.blockedBy) {
+            // Only add edge if both nodes exist in the graph
+            if (nodes.has(dep)) {
+                inEdges.get(task.id).add(dep);
+                outEdges.get(dep).add(task.id);
+            }
+        }
+    }
+    return { nodes, inEdges, outEdges };
+}
+/**
+ * Topologically sort tasks using Kahn's algorithm.
+ * Returns null if a cycle is detected.
+ *
+ * @param graph - Dependency graph
+ * @returns Sorted task IDs in execution order, or null if cycle exists
+ */
+export function topologicalSort(graph) {
+    const { nodes, inEdges } = graph;
+    const result = [];
+    // Calculate in-degrees (copy to avoid mutation)
+    const inDegree = new Map();
+    for (const [id, deps] of inEdges) {
+        inDegree.set(id, deps.size);
+    }
+    // Start with nodes that have no dependencies
+    const queue = [];
+    for (const [id, degree] of inDegree) {
+        if (degree === 0) {
+            queue.push(id);
+        }
+    }
+    while (queue.length > 0) {
+        const current = queue.shift();
+        result.push(current);
+        // Reduce in-degree of dependent tasks
+        const dependents = graph.outEdges.get(current) || new Set();
+        for (const dep of dependents) {
+            const newDegree = inDegree.get(dep) - 1;
+            inDegree.set(dep, newDegree);
+            if (newDegree === 0) {
+                queue.push(dep);
+            }
+        }
+    }
+    // If we didn't process all nodes, there's a cycle
+    if (result.length !== nodes.size) {
+        return null;
+    }
+    return result;
+}
+/**
+ * Detect all cycles in the dependency graph using DFS.
+ *
+ * @param graph - Dependency graph
+ * @returns Array of cycles, where each cycle is an array of task IDs
+ */
+export function detectCycles(graph) {
+    const { nodes, inEdges } = graph;
+    const cycles = [];
+    const visited = new Set();
+    const recStack = new Set();
+    const parent = new Map();
+    function dfs(nodeId, path) {
+        visited.add(nodeId);
+        recStack.add(nodeId);
+        path.push(nodeId);
+        const deps = inEdges.get(nodeId) || new Set();
+        for (const dep of deps) {
+            if (!visited.has(dep)) {
+                parent.set(dep, nodeId);
+                dfs(dep, [...path]);
+            }
+            else if (recStack.has(dep)) {
+                // Found a cycle - extract it
+                const cycleStart = path.indexOf(dep);
+                if (cycleStart !== -1) {
+                    const cycle = path.slice(cycleStart);
+                    cycle.push(dep); // Close the cycle
+                    cycles.push(cycle);
+                }
+            }
+        }
+        recStack.delete(nodeId);
+    }
+    for (const nodeId of nodes.keys()) {
+        if (!visited.has(nodeId)) {
+            parent.set(nodeId, null);
+            dfs(nodeId, []);
+        }
+    }
+    // Deduplicate cycles (same cycle can be found from different starting points)
+    const uniqueCycles = new Map();
+    for (const cycle of cycles) {
+        // Normalize: rotate to start with smallest ID
+        const minIdx = cycle.indexOf(cycle.slice(0, -1).reduce((a, b) => (a < b ? a : b)));
+        const normalized = [...cycle.slice(minIdx, -1), ...cycle.slice(0, minIdx), cycle[minIdx]];
+        const key = normalized.join("→");
+        if (!uniqueCycles.has(key)) {
+            uniqueCycles.set(key, normalized);
+        }
+    }
+    return Array.from(uniqueCycles.values());
+}
+/**
+ * Find the critical path (longest dependency chain) in the graph.
+ * Uses dynamic programming on the DAG.
+ *
+ * @param graph - Dependency graph
+ * @returns Array of task IDs forming the critical path
+ */
+export function findCriticalPath(graph) {
+    const sorted = topologicalSort(graph);
+    if (!sorted) {
+        // Graph has cycles, can't compute critical path
+        return [];
+    }
+    const { inEdges } = graph;
+    const dist = new Map();
+    const prev = new Map();
+    // Initialize distances
+    for (const id of sorted) {
+        dist.set(id, 0);
+        prev.set(id, null);
+    }
+    // Process in topological order
+    for (const nodeId of sorted) {
+        const deps = inEdges.get(nodeId) || new Set();
+        for (const dep of deps) {
+            const newDist = dist.get(dep) + 1;
+            if (newDist > dist.get(nodeId)) {
+                dist.set(nodeId, newDist);
+                prev.set(nodeId, dep);
+            }
+        }
+    }
+    // Find the node with maximum distance (end of critical path)
+    let maxDist = 0;
+    let endNode = null;
+    for (const [id, d] of dist) {
+        if (d >= maxDist) {
+            maxDist = d;
+            endNode = id;
+        }
+    }
+    if (!endNode) {
+        return [];
+    }
+    // Reconstruct the critical path
+    const path = [];
+    let current = endNode;
+    while (current !== null) {
+        path.unshift(current);
+        current = prev.get(current) || null;
+    }
+    return path;
+}
+/**
+ * Find tasks that are blocked by incomplete dependencies.
+ *
+ * @param graph - Dependency graph
+ * @returns Map of task ID -> array of blocking (incomplete) task IDs
+ */
+export function getBlockedTasks(graph) {
+    const { nodes, inEdges } = graph;
+    const blocked = new Map();
+    const incompleteTasks = new Set(Array.from(nodes.values())
+        .filter((t) => t.status !== "completed" && t.status !== "cancelled")
+        .map((t) => t.id));
+    for (const [taskId, deps] of inEdges) {
+        const task = nodes.get(taskId);
+        // Skip already completed/cancelled tasks
+        if (task.status === "completed" || task.status === "cancelled") {
+            continue;
+        }
+        const blockingDeps = Array.from(deps).filter((dep) => incompleteTasks.has(dep));
+        if (blockingDeps.length > 0) {
+            blocked.set(taskId, blockingDeps);
+        }
+    }
+    return blocked;
+}
+/**
+ * Perform a complete analysis of the task dependency graph.
+ *
+ * @param tasks - Array of task nodes
+ * @returns Full graph analysis including sort, cycles, critical path, and blocked tasks
+ */
+export function analyzeGraph(tasks) {
+    const graph = buildGraph(tasks);
+    const sorted = topologicalSort(graph);
+    const cycles = detectCycles(graph);
+    const criticalPath = findCriticalPath(graph);
+    const blocked = getBlockedTasks(graph);
+    return {
+        sorted,
+        cycles,
+        criticalPath,
+        blocked,
+        isValid: cycles.length === 0,
+    };
+}
+/**
+ * Extract the task slug from a full task ID.
+ * e.g., "task:q3-launch/research" -> "research"
+ *
+ * @param taskId - Full task ID
+ * @returns Task slug
+ */
+export function getTaskSlug(taskId) {
+    const parts = taskId.split("/");
+    return parts[parts.length - 1];
+}
+/**
+ * Extract the project slug from a full task ID.
+ * e.g., "task:q3-launch/research" -> "q3-launch"
+ *
+ * @param taskId - Full task ID
+ * @returns Project slug
+ */
+export function getProjectSlug(taskId) {
+    const match = taskId.match(/^task:([^/]+)/);
+    return match ? match[1] : "";
+}
+//# sourceMappingURL=graph.js.map

package/dist/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AA4CH;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,KAAiB;IAC1C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC/C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;IAEhD,uBAAuB;IACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAChC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,qDAAqD;IACrD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACjC,iDAAiD;YACjD,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC/B,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;AACtC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,KAAsB;IACpD,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IACjC,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,gDAAgD;IAChD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;QACjC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,6CAA6C;IAC7C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACpC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,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,sCAAsC;QACtC,MAAM,UAAU,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QAC5D,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAE,GAAG,CAAC,CAAC;YACzC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;YAC7B,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IAED,kDAAkD;IAClD,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,KAAsB;IACjD,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IACjC,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEhD,SAAS,GAAG,CAAC,MAAc,EAAE,IAAc;QACzC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAElB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QAC9C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;gBACxB,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YACtB,CAAC;iBAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC7B,6BAA6B;gBAC7B,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBACrC,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;oBACtB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBACrC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,kBAAkB;oBACnC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;QAED,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAED,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACzB,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;IACjD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,8CAA8C;QAC9C,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnF,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QAC1F,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3B,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC;AAC3C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAsB;IACrD,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,gDAAgD;QAChD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IAC1B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAyB,CAAC;IAE9C,uBAAuB;IACvB,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACrB,CAAC;IAED,+BAA+B;IAC/B,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QAC9C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAE,GAAG,CAAC,CAAC;YACnC,IAAI,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,CAAC;gBAChC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;gBAC1B,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,6DAA6D;IAC7D,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,OAAO,GAAkB,IAAI,CAAC;IAClC,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;QAC3B,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;YACjB,OAAO,GAAG,CAAC,CAAC;YACZ,OAAO,GAAG,EAAE,CAAC;QACf,CAAC;IACH,CAAC;IAED,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,gCAAgC;IAChC,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,OAAO,GAAkB,OAAO,CAAC;IACrC,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACtB,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;IACtC,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,KAAsB;IACpD,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE5C,MAAM,eAAe,GAAG,IAAI,GAAG,CAC7B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;SACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC;SACnE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CACpB,CAAC;IAEF,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QAChC,yCAAyC;QACzC,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;YAC/D,SAAS;QACX,CAAC;QAED,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAChF,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,KAAiB;IAC5C,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAChC,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IACtC,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,YAAY,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAC7C,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IAEvC,OAAO;QACL,MAAM;QACN,MAAM;QACN,YAAY;QACZ,OAAO;QACP,OAAO,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;KAC7B,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,MAAc;IACxC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAChC,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACjC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAAC,MAAc;IAC3C,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IAC5C,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC/B,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,13 @@
+/**
+ * @agent-workspace/utils
+ *
+ * Shared utilities for AWP packages including validation,
+ * reputation calculations, frontmatter parsing, and workspace helpers.
+ */
+export { validateSlug, sanitizeSlug, validatePath, isValidDate, isValidTimestamp, } from "./validation.js";
+export { computeConfidence, computeDecayedScore, updateDimension, computeWeightedScore, } from "./reputation.js";
+export { parseWorkspaceFile, serializeWorkspaceFile, writeWorkspaceFile, getFrontmatterType, } from "./frontmatter.js";
+export { findWorkspaceRoot, loadManifest, fileExists, getAgentDid, safeReadFile, getWorkspaceRoot, } from "./workspace.js";
+export { type TaskNode, type DependencyGraph, type GraphAnalysis, buildGraph, topologicalSort, detectCycles, findCriticalPath, getBlockedTasks, analyzeGraph, getTaskSlug, getProjectSlug, } from "./graph.js";
+export { type RecruitmentCandidate, type RecruitmentResult, findCandidatesForRole, autoRecruitSwarm, isSwarmFullyStaffed, getSwarmStaffingSummary, } from "./swarm.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EACL,YAAY,EACZ,YAAY,EACZ,YAAY,EACZ,WAAW,EACX,gBAAgB,GACjB,MAAM,iBAAiB,CAAC;AAGzB,OAAO,EACL,iBAAiB,EACjB,mBAAmB,EACnB,eAAe,EACf,oBAAoB,GACrB,MAAM,iBAAiB,CAAC;AAGzB,OAAO,EACL,kBAAkB,EAClB,sBAAsB,EACtB,kBAAkB,EAClB,kBAAkB,GACnB,MAAM,kBAAkB,CAAC;AAG1B,OAAO,EACL,iBAAiB,EACjB,YAAY,EACZ,UAAU,EACV,WAAW,EACX,YAAY,EACZ,gBAAgB,GACjB,MAAM,gBAAgB,CAAC;AAGxB,OAAO,EACL,KAAK,QAAQ,EACb,KAAK,eAAe,EACpB,KAAK,aAAa,EAClB,UAAU,EACV,eAAe,EACf,YAAY,EACZ,gBAAgB,EAChB,eAAe,EACf,YAAY,EACZ,WAAW,EACX,cAAc,GACf,MAAM,YAAY,CAAC;AAGpB,OAAO,EACL,KAAK,oBAAoB,EACzB,KAAK,iBAAiB,EACtB,qBAAqB,EACrB,gBAAgB,EAChB,mBAAmB,EACnB,uBAAuB,GACxB,MAAM,YAAY,CAAC"}

package/dist/index.js

@@ -0,0 +1,19 @@
+/**
+ * @agent-workspace/utils
+ *
+ * Shared utilities for AWP packages including validation,
+ * reputation calculations, frontmatter parsing, and workspace helpers.
+ */
+// Validation utilities
+export { validateSlug, sanitizeSlug, validatePath, isValidDate, isValidTimestamp, } from "./validation.js";
+// Reputation utilities
+export { computeConfidence, computeDecayedScore, updateDimension, computeWeightedScore, } from "./reputation.js";
+// Frontmatter utilities
+export { parseWorkspaceFile, serializeWorkspaceFile, writeWorkspaceFile, getFrontmatterType, } from "./frontmatter.js";
+// Workspace utilities
+export { findWorkspaceRoot, loadManifest, fileExists, getAgentDid, safeReadFile, getWorkspaceRoot, } from "./workspace.js";
+// Graph utilities (dependency analysis)
+export { buildGraph, topologicalSort, detectCycles, findCriticalPath, getBlockedTasks, analyzeGraph, getTaskSlug, getProjectSlug, } from "./graph.js";
+// Swarm utilities (recruitment)
+export { findCandidatesForRole, autoRecruitSwarm, isSwarmFullyStaffed, getSwarmStaffingSummary, } from "./swarm.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,uBAAuB;AACvB,OAAO,EACL,YAAY,EACZ,YAAY,EACZ,YAAY,EACZ,WAAW,EACX,gBAAgB,GACjB,MAAM,iBAAiB,CAAC;AAEzB,uBAAuB;AACvB,OAAO,EACL,iBAAiB,EACjB,mBAAmB,EACnB,eAAe,EACf,oBAAoB,GACrB,MAAM,iBAAiB,CAAC;AAEzB,wBAAwB;AACxB,OAAO,EACL,kBAAkB,EAClB,sBAAsB,EACtB,kBAAkB,EAClB,kBAAkB,GACnB,MAAM,kBAAkB,CAAC;AAE1B,sBAAsB;AACtB,OAAO,EACL,iBAAiB,EACjB,YAAY,EACZ,UAAU,EACV,WAAW,EACX,YAAY,EACZ,gBAAgB,GACjB,MAAM,gBAAgB,CAAC;AAExB,wCAAwC;AACxC,OAAO,EAIL,UAAU,EACV,eAAe,EACf,YAAY,EACZ,gBAAgB,EAChB,eAAe,EACf,YAAY,EACZ,WAAW,EACX,cAAc,GACf,MAAM,YAAY,CAAC;AAEpB,gCAAgC;AAChC,OAAO,EAGL,qBAAqB,EACrB,gBAAgB,EAChB,mBAAmB,EACnB,uBAAuB,GACxB,MAAM,YAAY,CAAC"}

package/dist/reputation.d.ts

@@ -0,0 +1,37 @@
+import { type ReputationDimension } from "@agent-workspace/core";
+/**
+ * Compute confidence from sample size.
+ * Formula: confidence = 1 - 1/(1 + sampleSize * 0.1)
+ *
+ * @param sampleSize - Number of samples
+ * @returns Confidence value (0.0 to ~1.0)
+ */
+export declare function computeConfidence(sampleSize: number): number;
+/**
+ * Apply time-based decay to a reputation score.
+ * Scores decay toward REPUTATION_BASELINE (0.5) over time.
+ *
+ * @param dim - The reputation dimension to decay
+ * @param now - Current date (defaults to now)
+ * @param decayRate - Monthly decay rate (defaults to REPUTATION_DECAY_RATE)
+ * @returns The decayed score
+ */
+export declare function computeDecayedScore(dim: ReputationDimension, now?: Date, decayRate?: number): number;
+/**
+ * Update a reputation dimension with a new signal using EWMA.
+ *
+ * @param existing - Existing dimension (undefined for first signal)
+ * @param signalScore - The new signal score (0.0 to 1.0)
+ * @param now - Current date (defaults to now)
+ * @param alpha - EWMA learning rate (defaults to REPUTATION_EWMA_ALPHA)
+ * @returns Updated reputation dimension
+ */
+export declare function updateDimension(existing: ReputationDimension | undefined, signalScore: number, now?: Date, alpha?: number): ReputationDimension;
+/**
+ * Compute a weighted average of multiple dimension scores.
+ *
+ * @param scores - Array of [score, weight] tuples
+ * @returns Weighted average score
+ */
+export declare function computeWeightedScore(scores: Array<[number, number]>): number;
+//# sourceMappingURL=reputation.d.ts.map

package/dist/reputation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reputation.d.ts","sourceRoot":"","sources":["../src/reputation.ts"],"names":[],"mappings":"AAAA,OAAO,EAKL,KAAK,mBAAmB,EACzB,MAAM,uBAAuB,CAAC;AAE/B;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM,CAE5D;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CACjC,GAAG,EAAE,mBAAmB,EACxB,GAAG,GAAE,IAAiB,EACtB,SAAS,GAAE,MAA8B,GACxC,MAAM,CAYR;AAED;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAC7B,QAAQ,EAAE,mBAAmB,GAAG,SAAS,EACzC,WAAW,EAAE,MAAM,EACnB,GAAG,GAAE,IAAiB,EACtB,KAAK,GAAE,MAA8B,GACpC,mBAAmB,CAuBrB;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAY5E"}