@pennyfarthing/core 11.0.0 → 11.1.0

package/packages/core/dist/workflow/gate-file-validation.d.ts

@@ -0,0 +1,49 @@
+/**
+ * Gate File Validation — Depth Limit and Cycle Detection
+ *
+ * Story 107-2: Validates gate file content (XML-like format) for:
+ * 1. Maximum nesting depth (3 levels)
+ * 2. Cyclic gate name references
+ *
+ * Gate files use nested <gate name="..."> elements.
+ * Depth counted from root (Level 0) to max Level 3.
+ * Cycles detected via DFS on gate name adjacency graph.
+ */
+/**
+ * Error detail for gate file validation failures
+ */
+export interface GateFileValidationError {
+    /** Error category: depth limit, cycle, or schema */
+    type: 'depth' | 'cycle' | 'schema';
+    /** Human-readable error message */
+    message: string;
+}
+/**
+ * Result of gate file validation
+ */
+export interface GateFileValidationResult {
+    /** Whether the gate file is valid */
+    valid: boolean;
+    /** Root gate name (if parseable) */
+    gate?: string;
+    /** Maximum nesting depth found */
+    depth?: number;
+    /** Validation errors (only present if invalid) */
+    errors?: GateFileValidationError[];
+}
+/**
+ * Validate nesting depth of gate elements in a gate file.
+ * Max allowed depth is 3 (Level 0 = root, Level 3 = max).
+ */
+export declare function validateGateDepth(content: string): GateFileValidationResult;
+/**
+ * Detect cycles in gate name references via DFS.
+ * A cycle exists when a gate name appears as both an ancestor
+ * and descendant in the nesting hierarchy.
+ */
+export declare function detectGateCycles(content: string): GateFileValidationResult;
+/**
+ * Full gate file validation — combines depth and cycle checks.
+ */
+export declare function validateGateFile(content: string): GateFileValidationResult;
+//# sourceMappingURL=gate-file-validation.d.ts.map

package/packages/core/dist/workflow/gate-file-validation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"gate-file-validation.d.ts","sourceRoot":"","sources":["../../src/workflow/gate-file-validation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACtC,oDAAoD;IACpD,IAAI,EAAE,OAAO,GAAG,OAAO,GAAG,QAAQ,CAAC;IACnC,mCAAmC;IACnC,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,wBAAwB;IACvC,qCAAqC;IACrC,KAAK,EAAE,OAAO,CAAC;IACf,oCAAoC;IACpC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,kCAAkC;IAClC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,kDAAkD;IAClD,MAAM,CAAC,EAAE,uBAAuB,EAAE,CAAC;CACpC;AAuBD;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,MAAM,GAAG,wBAAwB,CAqC3E;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,wBAAwB,CAkC1E;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,wBAAwB,CAgD1E"}

package/packages/core/dist/workflow/gate-file-validation.js

@@ -0,0 +1,157 @@
+/**
+ * Gate File Validation — Depth Limit and Cycle Detection
+ *
+ * Story 107-2: Validates gate file content (XML-like format) for:
+ * 1. Maximum nesting depth (3 levels)
+ * 2. Cyclic gate name references
+ *
+ * Gate files use nested <gate name="..."> elements.
+ * Depth counted from root (Level 0) to max Level 3.
+ * Cycles detected via DFS on gate name adjacency graph.
+ */
+const MAX_DEPTH = 3;
+// Matches <gate ... name="X" ...> (double or single quotes) and </gate>
+const GATE_TAG_REGEX = /<gate\s+[^>]*name=["']([^"']+)["'][^>]*>|<\/gate>/g;
+function parseGateTags(content) {
+    const tokens = [];
+    const regex = new RegExp(GATE_TAG_REGEX.source, 'g');
+    let match;
+    while ((match = regex.exec(content)) !== null) {
+        if (match[1]) {
+            tokens.push({ type: 'open', name: match[1] });
+        }
+        else {
+            tokens.push({ type: 'close' });
+        }
+    }
+    return tokens;
+}
+/**
+ * Validate nesting depth of gate elements in a gate file.
+ * Max allowed depth is 3 (Level 0 = root, Level 3 = max).
+ */
+export function validateGateDepth(content) {
+    const tokens = parseGateTags(content);
+    if (tokens.length === 0) {
+        return { valid: false, errors: [{ type: 'schema', message: 'No gate elements found' }] };
+    }
+    const errors = [];
+    let depth = -1;
+    let maxDepth = 0;
+    let rootName;
+    for (const token of tokens) {
+        if (token.type === 'open') {
+            depth++;
+            if (depth === 0) {
+                rootName = token.name;
+            }
+            if (depth > maxDepth) {
+                maxDepth = depth;
+            }
+            if (depth > MAX_DEPTH) {
+                errors.push({
+                    type: 'depth',
+                    message: `Gate depth limit exceeded: ${token.name} at depth ${depth} (max ${MAX_DEPTH})`,
+                });
+            }
+        }
+        else {
+            depth--;
+        }
+    }
+    return {
+        valid: errors.length === 0,
+        gate: rootName,
+        depth: maxDepth,
+        errors: errors.length > 0 ? errors : undefined,
+    };
+}
+/**
+ * Detect cycles in gate name references via DFS.
+ * A cycle exists when a gate name appears as both an ancestor
+ * and descendant in the nesting hierarchy.
+ */
+export function detectGateCycles(content) {
+    const tokens = parseGateTags(content);
+    if (tokens.length === 0) {
+        return { valid: false, errors: [{ type: 'schema', message: 'No gate elements found' }] };
+    }
+    const errors = [];
+    const ancestorStack = [];
+    let rootName;
+    for (const token of tokens) {
+        if (token.type === 'open') {
+            if (ancestorStack.length === 0) {
+                rootName = token.name;
+            }
+            const ancestorIndex = ancestorStack.indexOf(token.name);
+            if (ancestorIndex >= 0) {
+                const cyclePath = [...ancestorStack.slice(ancestorIndex), token.name];
+                errors.push({
+                    type: 'cycle',
+                    message: `Cycle detected: ${cyclePath.join(' \u2192 ')}`,
+                });
+            }
+            ancestorStack.push(token.name);
+        }
+        else {
+            ancestorStack.pop();
+        }
+    }
+    return {
+        valid: errors.length === 0,
+        gate: rootName,
+        errors: errors.length > 0 ? errors : undefined,
+    };
+}
+/**
+ * Full gate file validation — combines depth and cycle checks.
+ */
+export function validateGateFile(content) {
+    const tokens = parseGateTags(content);
+    if (tokens.length === 0) {
+        return { valid: false, errors: [{ type: 'schema', message: 'No gate elements found' }] };
+    }
+    const errors = [];
+    const ancestorStack = [];
+    let depth = -1;
+    let maxDepth = 0;
+    let rootName;
+    for (const token of tokens) {
+        if (token.type === 'open') {
+            depth++;
+            if (depth === 0) {
+                rootName = token.name;
+            }
+            if (depth > maxDepth) {
+                maxDepth = depth;
+            }
+            if (depth > MAX_DEPTH) {
+                errors.push({
+                    type: 'depth',
+                    message: `Gate depth limit exceeded: ${token.name} at depth ${depth} (max ${MAX_DEPTH})`,
+                });
+            }
+            const ancestorIndex = ancestorStack.indexOf(token.name);
+            if (ancestorIndex >= 0) {
+                const cyclePath = [...ancestorStack.slice(ancestorIndex), token.name];
+                errors.push({
+                    type: 'cycle',
+                    message: `Cycle detected: ${cyclePath.join(' \u2192 ')}`,
+                });
+            }
+            ancestorStack.push(token.name);
+        }
+        else {
+            depth--;
+            ancestorStack.pop();
+        }
+    }
+    return {
+        valid: errors.length === 0,
+        gate: rootName,
+        depth: maxDepth,
+        errors: errors.length > 0 ? errors : undefined,
+    };
+}
+//# sourceMappingURL=gate-file-validation.js.map

package/packages/core/dist/workflow/gate-file-validation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gate-file-validation.js","sourceRoot":"","sources":["../../src/workflow/gate-file-validation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AA0BH,MAAM,SAAS,GAAG,CAAC,CAAC;AAEpB,wEAAwE;AACxE,MAAM,cAAc,GAAG,oDAAoD,CAAC;AAI5E,SAAS,aAAa,CAAC,OAAe;IACpC,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACrD,IAAI,KAAK,CAAC;IACV,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAC9C,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAChD,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAAe;IAC/C,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IACtC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,wBAAwB,EAAE,CAAC,EAAE,CAAC;IAC3F,CAAC;IAED,MAAM,MAAM,GAA8B,EAAE,CAAC;IAC7C,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,QAA4B,CAAC;IAEjC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC1B,KAAK,EAAE,CAAC;YACR,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC;YACxB,CAAC;YACD,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACrB,QAAQ,GAAG,KAAK,CAAC;YACnB,CAAC;YACD,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBACtB,MAAM,CAAC,IAAI,CAAC;oBACV,IAAI,EAAE,OAAO;oBACb,OAAO,EAAE,8BAA8B,KAAK,CAAC,IAAI,aAAa,KAAK,SAAS,SAAS,GAAG;iBACzF,CAAC,CAAC;YACL,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,EAAE,CAAC;QACV,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;QAC1B,IAAI,EAAE,QAAQ;QACd,KAAK,EAAE,QAAQ;QACf,MAAM,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;KAC/C,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAe;IAC9C,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IACtC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,wBAAwB,EAAE,CAAC,EAAE,CAAC;IAC3F,CAAC;IAED,MAAM,MAAM,GAA8B,EAAE,CAAC;IAC7C,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,IAAI,QAA4B,CAAC;IAEjC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC1B,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC/B,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC;YACxB,CAAC;YACD,MAAM,aAAa,GAAG,aAAa,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACxD,IAAI,aAAa,IAAI,CAAC,EAAE,CAAC;gBACvB,MAAM,SAAS,GAAG,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;gBACtE,MAAM,CAAC,IAAI,CAAC;oBACV,IAAI,EAAE,OAAO;oBACb,OAAO,EAAE,mBAAmB,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE;iBACzD,CAAC,CAAC;YACL,CAAC;YACD,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC;aAAM,CAAC;YACN,aAAa,CAAC,GAAG,EAAE,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;QAC1B,IAAI,EAAE,QAAQ;QACd,MAAM,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;KAC/C,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAe;IAC9C,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IACtC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,wBAAwB,EAAE,CAAC,EAAE,CAAC;IAC3F,CAAC;IAED,MAAM,MAAM,GAA8B,EAAE,CAAC;IAC7C,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,QAA4B,CAAC;IAEjC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC1B,KAAK,EAAE,CAAC;YACR,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC;YACxB,CAAC;YACD,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACrB,QAAQ,GAAG,KAAK,CAAC;YACnB,CAAC;YACD,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBACtB,MAAM,CAAC,IAAI,CAAC;oBACV,IAAI,EAAE,OAAO;oBACb,OAAO,EAAE,8BAA8B,KAAK,CAAC,IAAI,aAAa,KAAK,SAAS,SAAS,GAAG;iBACzF,CAAC,CAAC;YACL,CAAC;YACD,MAAM,aAAa,GAAG,aAAa,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACxD,IAAI,aAAa,IAAI,CAAC,EAAE,CAAC;gBACvB,MAAM,SAAS,GAAG,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;gBACtE,MAAM,CAAC,IAAI,CAAC;oBACV,IAAI,EAAE,OAAO;oBACb,OAAO,EAAE,mBAAmB,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE;iBACzD,CAAC,CAAC;YACL,CAAC;YACD,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC;aAAM,CAAC;YACN,KAAK,EAAE,CAAC;YACR,aAAa,CAAC,GAAG,EAAE,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;QAC1B,IAAI,EAAE,QAAQ;QACd,KAAK,EAAE,QAAQ;QACf,MAAM,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;KAC/C,CAAC;AACJ,CAAC"}

package/packages/core/dist/workflow/gate-file-validation.test.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Tests for Story 107-2: Acyclic Validation and Depth Limit Enforcement
+ *
+ * Validates that gate files (XML-like format with nested <gate> elements)
+ * are checked for:
+ * 1. Maximum nesting depth (3 levels, where Level 0 = root)
+ * 2. Cyclic gate name references (A → B → A)
+ *
+ * Both checks run at parse time on the gate file content string.
+ *
+ * ACs:
+ * 1. Cycle detection via DFS on directed graph of gate name references
+ * 2. Depth validation with max 3, error includes gate name and actual depth
+ * 3. Validation runs at parse time (on content string, no file I/O)
+ * 4. Specific, actionable error messages for both violation types
+ * 5. Valid gate files continue to pass (no regressions)
+ */
+export {};
+//# sourceMappingURL=gate-file-validation.test.d.ts.map

package/packages/core/dist/workflow/gate-file-validation.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"gate-file-validation.test.d.ts","sourceRoot":"","sources":["../../src/workflow/gate-file-validation.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG"}