@pattern-algebra/core 0.0.0

package/dist/compile/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/compile/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAA;AAC3C,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAA;AACjG,OAAO,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAA"}

package/dist/compile/quick-reject.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Quick-reject filter construction.
+ * @packageDocumentation
+ */
+import type { PathPattern, QuickRejectFilter } from '../types';
+/**
+ * Build quick-reject filters for a pattern.
+ *
+ * Quick-reject filters enable fast elimination of non-matching paths
+ * before full automaton simulation.
+ *
+ * @param pattern - Pattern AST
+ * @returns Quick-reject filter configuration
+ *
+ * @public
+ */
+export declare function buildQuickRejectFilter(pattern: PathPattern): QuickRejectFilter;
+/**
+ * Apply quick-reject filter to a path.
+ *
+ * @param path - Normalized path to check
+ * @param filter - Quick-reject filter
+ * @returns false if path definitely doesn't match, true if it might match
+ *
+ * @public
+ */
+export declare function applyQuickReject(path: string, filter: QuickRejectFilter): boolean;
+//# sourceMappingURL=quick-reject.d.ts.map

package/dist/compile/quick-reject.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"quick-reject.d.ts","sourceRoot":"","sources":["../../src/compile/quick-reject.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,WAAW,EAA4B,iBAAiB,EAAE,MAAM,UAAU,CAAA;AAExF;;;;;;;;;;GAUG;AACH,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,WAAW,GAAG,iBAAiB,CAO9E;AAqGD;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,iBAAiB,GAAG,OAAO,CA2BjF"}

package/dist/compile/quick-reject.js

@@ -0,0 +1,147 @@
+/**
+ * Quick-reject filter construction.
+ * @packageDocumentation
+ */
+/**
+ * Build quick-reject filters for a pattern.
+ *
+ * Quick-reject filters enable fast elimination of non-matching paths
+ * before full automaton simulation.
+ *
+ * @param pattern - Pattern AST
+ * @returns Quick-reject filter configuration
+ *
+ * @public
+ */
+export function buildQuickRejectFilter(pattern) {
+    // Extract from sequence (alternations are more complex)
+    if (pattern.root.type === 'sequence') {
+        return extractSequenceFilters(pattern.root);
+    }
+    return {};
+}
+/**
+ * Extract filters from a segment sequence.
+ */
+function extractSequenceFilters(sequence) {
+    const segments = sequence.segments;
+    // Required prefix: leading literal segments before any wildcard
+    const prefixParts = [];
+    for (const segment of segments) {
+        if (segment.type === 'literal') {
+            prefixParts.push(segment.value);
+        }
+        else {
+            break;
+        }
+    }
+    const requiredPrefix = prefixParts.length > 0 ? '/' + prefixParts.join('/') : undefined;
+    // Required suffix: trailing literal segments after last wildcard
+    const suffixParts = [];
+    for (let i = segments.length - 1; i >= 0; i--) {
+        const segment = segments[i];
+        if (segment.type === 'literal') {
+            suffixParts.unshift(segment.value);
+        }
+        else {
+            break;
+        }
+    }
+    // Only use suffix if it doesn't overlap with prefix
+    const requiredSuffix = suffixParts.length > 0 && suffixParts.length < segments.length ? '/' + suffixParts.join('/') : undefined;
+    // Required literals: any literal segment that must appear
+    const literals = [];
+    for (const segment of segments) {
+        if (segment.type === 'literal') {
+            literals.push(segment.value);
+        }
+    }
+    const requiredLiterals = literals.length > 0 ? literals : undefined;
+    // Minimum length: sum of minimum segment lengths
+    let minLengthValue = 0;
+    for (const segment of segments) {
+        minLengthValue += getSegmentMinLength(segment);
+        minLengthValue += 1; // For the separator (/)
+    }
+    const minLength = minLengthValue > 1 ? minLengthValue : undefined;
+    return {
+        requiredPrefix,
+        requiredSuffix,
+        requiredLiterals,
+        minLength,
+    };
+}
+/**
+ * Get minimum character length for a segment.
+ */
+function getSegmentMinLength(segment) {
+    switch (segment.type) {
+        case 'literal':
+            return segment.value.length;
+        case 'globstar':
+            return 0; // Globstar can match zero characters
+        case 'wildcard': {
+            // Count required characters
+            let min = 0;
+            for (const part of segment.parts) {
+                if (part.type === 'literal') {
+                    min += part.value.length;
+                }
+                else if (part.type === 'question') {
+                    min += 1;
+                }
+                // star contributes 0
+            }
+            return min;
+        }
+        case 'charclass':
+            return 1; // Single character
+        case 'composite': {
+            let min = 0;
+            for (const part of segment.parts) {
+                if (part.type === 'literal') {
+                    min += part.value.length;
+                }
+                else if (part.type === 'question' || part.type === 'charclass') {
+                    min += 1;
+                }
+                // star contributes 0
+            }
+            return min;
+        }
+    }
+}
+/**
+ * Apply quick-reject filter to a path.
+ *
+ * @param path - Normalized path to check
+ * @param filter - Quick-reject filter
+ * @returns false if path definitely doesn't match, true if it might match
+ *
+ * @public
+ */
+export function applyQuickReject(path, filter) {
+    // Check minimum length
+    if (filter.minLength !== undefined && path.length < filter.minLength) {
+        return false;
+    }
+    // Check required prefix
+    if (filter.requiredPrefix !== undefined && !path.startsWith(filter.requiredPrefix)) {
+        return false;
+    }
+    // Check required suffix
+    if (filter.requiredSuffix !== undefined && !path.endsWith(filter.requiredSuffix)) {
+        return false;
+    }
+    // Check required literals (must appear as segments)
+    if (filter.requiredLiterals !== undefined) {
+        const segments = path.split('/');
+        for (const required of filter.requiredLiterals) {
+            if (!segments.includes(required)) {
+                return false;
+            }
+        }
+    }
+    return true;
+}
+//# sourceMappingURL=quick-reject.js.map

package/dist/compile/quick-reject.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quick-reject.js","sourceRoot":"","sources":["../../src/compile/quick-reject.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;;;;;;;;;GAUG;AACH,MAAM,UAAU,sBAAsB,CAAC,OAAoB;IACzD,wDAAwD;IACxD,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QACrC,OAAO,sBAAsB,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;IAC7C,CAAC;IAED,OAAO,EAAE,CAAA;AACX,CAAC;AAED;;GAEG;AACH,SAAS,sBAAsB,CAAC,QAAyB;IACvD,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAA;IAElC,gEAAgE;IAChE,MAAM,WAAW,GAAa,EAAE,CAAA;IAChC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC/B,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACjC,CAAC;aAAM,CAAC;YACN,MAAK;QACP,CAAC;IACH,CAAC;IACD,MAAM,cAAc,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IAEvF,iEAAiE;IACjE,MAAM,WAAW,GAAa,EAAE,CAAA;IAChC,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;QAC3B,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC/B,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACpC,CAAC;aAAM,CAAC;YACN,MAAK;QACP,CAAC;IACH,CAAC;IACD,oDAAoD;IACpD,MAAM,cAAc,GAClB,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,WAAW,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IAE1G,0DAA0D;IAC1D,MAAM,QAAQ,GAAa,EAAE,CAAA;IAC7B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC/B,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QAC9B,CAAC;IACH,CAAC;IACD,MAAM,gBAAgB,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAA;IAEnE,iDAAiD;IACjD,IAAI,cAAc,GAAG,CAAC,CAAA;IACtB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,cAAc,IAAI,mBAAmB,CAAC,OAAO,CAAC,CAAA;QAC9C,cAAc,IAAI,CAAC,CAAA,CAAC,wBAAwB;IAC9C,CAAC;IACD,MAAM,SAAS,GAAG,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAA;IAEjE,OAAO;QACL,cAAc;QACd,cAAc;QACd,gBAAgB;QAChB,SAAS;KACV,CAAA;AACH,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAAC,OAAgB;IAC3C,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;QACrB,KAAK,SAAS;YACZ,OAAO,OAAO,CAAC,KAAK,CAAC,MAAM,CAAA;QAE7B,KAAK,UAAU;YACb,OAAO,CAAC,CAAA,CAAC,qCAAqC;QAEhD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,4BAA4B;YAC5B,IAAI,GAAG,GAAG,CAAC,CAAA;YACX,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBACjC,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;oBAC5B,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAA;gBAC1B,CAAC;qBAAM,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;oBACpC,GAAG,IAAI,CAAC,CAAA;gBACV,CAAC;gBACD,qBAAqB;YACvB,CAAC;YACD,OAAO,GAAG,CAAA;QACZ,CAAC;QAED,KAAK,WAAW;YACd,OAAO,CAAC,CAAA,CAAC,mBAAmB;QAE9B,KAAK,WAAW,CAAC,CAAC,CAAC;YACjB,IAAI,GAAG,GAAG,CAAC,CAAA;YACX,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBACjC,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;oBAC5B,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAA;gBAC1B,CAAC;qBAAM,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;oBACjE,GAAG,IAAI,CAAC,CAAA;gBACV,CAAC;gBACD,qBAAqB;YACvB,CAAC;YACD,OAAO,GAAG,CAAA;QACZ,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY,EAAE,MAAyB;IACtE,uBAAuB;IACvB,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;QACrE,OAAO,KAAK,CAAA;IACd,CAAC;IAED,wBAAwB;IACxB,IAAI,MAAM,CAAC,cAAc,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,CAAC;QACnF,OAAO,KAAK,CAAA;IACd,CAAC;IAED,wBAAwB;IACxB,IAAI,MAAM,CAAC,cAAc,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,CAAC;QACjF,OAAO,KAAK,CAAA;IACd,CAAC;IAED,oDAAoD;IACpD,IAAI,MAAM,CAAC,gBAAgB,KAAK,SAAS,EAAE,CAAC;QAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QAChC,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAC/C,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACjC,OAAO,KAAK,CAAA;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC"}

package/dist/containment/analysis.d.ts

@@ -0,0 +1,60 @@
+/**
+ * Pattern analysis utilities.
+ * @packageDocumentation
+ */
+import type { CompiledPattern, PatternAnalysis, PatternRelationship } from '../types';
+/**
+ * Analyze the relationship between two patterns in detail.
+ *
+ * Provides comprehensive information about how patterns relate,
+ * including the intersection and set differences.
+ *
+ * @param a - First compiled pattern
+ * @param b - Second compiled pattern
+ * @returns Full analysis of pattern relationship
+ *
+ * @public
+ */
+export declare function analyzePatterns(a: CompiledPattern, b: CompiledPattern): PatternAnalysis;
+/**
+ * Determine if two patterns are equivalent (match the same set of paths).
+ *
+ * @param a - First pattern
+ * @param b - Second pattern
+ * @returns true if patterns are equivalent
+ *
+ * @public
+ */
+export declare function areEquivalent(a: CompiledPattern, b: CompiledPattern): boolean;
+/**
+ * Determine if two patterns have any overlap.
+ *
+ * @param a - First pattern
+ * @param b - Second pattern
+ * @returns true if there exists a path matching both patterns
+ *
+ * @public
+ */
+export declare function hasOverlap(a: CompiledPattern, b: CompiledPattern): boolean;
+/**
+ * Determine if two patterns are disjoint (no common paths).
+ *
+ * @param a - First pattern
+ * @param b - Second pattern
+ * @returns true if patterns have no paths in common
+ *
+ * @public
+ */
+export declare function areDisjoint(a: CompiledPattern, b: CompiledPattern): boolean;
+/**
+ * Get a human-readable summary of the relationship between patterns.
+ *
+ * @param relationship - The pattern relationship
+ * @param patternA - Source of pattern A
+ * @param patternB - Source of pattern B
+ * @returns Human-readable description
+ *
+ * @public
+ */
+export declare function summarizeRelationship(relationship: PatternRelationship, patternA: string, patternB: string): string;
+//# sourceMappingURL=analysis.d.ts.map

package/dist/containment/analysis.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"analysis.d.ts","sourceRoot":"","sources":["../../src/containment/analysis.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EACV,eAAe,EACf,eAAe,EAEf,mBAAmB,EAGpB,MAAM,UAAU,CAAA;AAIjB;;;;;;;;;;;GAWG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,eAAe,GAAG,eAAe,CAgBvF;AAuHD;;;;;;;;GAQG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,eAAe,GAAG,OAAO,CAG7E;AAED;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,eAAe,GAAG,OAAO,CA0B1E;AAmED;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,eAAe,GAAG,OAAO,CAE3E;AAED;;;;;;;;;GASG;AACH,wBAAgB,qBAAqB,CAAC,YAAY,EAAE,mBAAmB,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAiBnH"}

package/dist/containment/analysis.js

@@ -0,0 +1,378 @@
+/**
+ * Pattern analysis utilities.
+ * @packageDocumentation
+ */
+import { checkContainment } from './containment';
+import { matchPath } from '../match/matcher';
+/**
+ * Analyze the relationship between two patterns in detail.
+ *
+ * Provides comprehensive information about how patterns relate,
+ * including the intersection and set differences.
+ *
+ * @param a - First compiled pattern
+ * @param b - Second compiled pattern
+ * @returns Full analysis of pattern relationship
+ *
+ * @public
+ */
+export function analyzePatterns(a, b) {
+    const containment = checkContainment(a, b);
+    const intersection = describeIntersection(a, b);
+    const aMinusB = describeSetDifference(a, b, 'A-B');
+    const bMinusA = describeSetDifference(a, b, 'B-A');
+    return {
+        patternA: a.source,
+        patternB: b.source,
+        relationship: containment.relationship,
+        containment,
+        intersection,
+        aMinusB,
+        bMinusA,
+    };
+}
+/**
+ * Describe the intersection of two patterns.
+ */
+function describeIntersection(a, b) {
+    // Generate test paths from both patterns and find common matches
+    const examples = [];
+    const aPaths = generateTestPaths(a, 15);
+    const bPaths = generateTestPaths(b, 15);
+    // Check A paths that also match B
+    for (const path of aPaths) {
+        if (matchPath(path, b) && !examples.includes(path)) {
+            examples.push(path);
+            if (examples.length >= 3)
+                break;
+        }
+    }
+    // Check B paths that also match A
+    for (const path of bPaths) {
+        if (matchPath(path, a) && !examples.includes(path)) {
+            examples.push(path);
+            if (examples.length >= 3)
+                break;
+        }
+    }
+    // Try combined paths if no overlap found yet
+    if (examples.length === 0) {
+        const combinedPaths = generateCombinedPaths(a, b, 15);
+        for (const path of combinedPaths) {
+            if (matchPath(path, a) && matchPath(path, b) && !examples.includes(path)) {
+                examples.push(path);
+                if (examples.length >= 3)
+                    break;
+            }
+        }
+    }
+    if (examples.length === 0) {
+        return {
+            isEmpty: true,
+            description: 'The patterns have no paths in common',
+        };
+    }
+    // Try to describe the intersection pattern
+    const pattern = describeIntersectionPattern(a, b);
+    return {
+        isEmpty: false,
+        examples,
+        pattern,
+        description: pattern
+            ? `Paths matching both patterns: ${pattern}`
+            : `Paths that match both "${a.source}" and "${b.source}"`,
+    };
+}
+/**
+ * Describe the set difference between patterns.
+ */
+function describeSetDifference(a, b, direction) {
+    const [first, second] = direction === 'A-B' ? [a, b] : [b, a];
+    // Generate paths from the first pattern that don't match the second
+    const examples = [];
+    const firstPaths = generateTestPaths(first, 20);
+    for (const path of firstPaths) {
+        if (!matchPath(path, second) && !examples.includes(path)) {
+            examples.push(path);
+            if (examples.length >= 3)
+                break;
+        }
+    }
+    if (examples.length === 0) {
+        return {
+            isEmpty: true,
+            description: direction === 'A-B'
+                ? `All paths matching "${a.source}" also match "${b.source}"`
+                : `All paths matching "${b.source}" also match "${a.source}"`,
+        };
+    }
+    return {
+        isEmpty: false,
+        examples,
+        description: direction === 'A-B'
+            ? `Paths matching "${a.source}" but not "${b.source}"`
+            : `Paths matching "${b.source}" but not "${a.source}"`,
+    };
+}
+/**
+ * Try to describe the intersection as a pattern.
+ */
+function describeIntersectionPattern(a, b) {
+    // Special cases where we can compute an explicit pattern
+    // If one is a subset of the other, the intersection is the smaller one
+    const aPrefix = a.quickReject.requiredPrefix;
+    const bPrefix = b.quickReject.requiredPrefix;
+    if (aPrefix && bPrefix) {
+        // Both have prefixes - intersection might be expressible
+        if (aPrefix.startsWith(bPrefix)) {
+            return a.source; // A is more specific
+        }
+        if (bPrefix.startsWith(aPrefix)) {
+            return b.source; // B is more specific
+        }
+    }
+    // For simple cases, return undefined (too complex to express)
+    return undefined;
+}
+/**
+ * Determine if two patterns are equivalent (match the same set of paths).
+ *
+ * @param a - First pattern
+ * @param b - Second pattern
+ * @returns true if patterns are equivalent
+ *
+ * @public
+ */
+export function areEquivalent(a, b) {
+    const result = checkContainment(a, b);
+    return result.isEqual;
+}
+/**
+ * Determine if two patterns have any overlap.
+ *
+ * @param a - First pattern
+ * @param b - Second pattern
+ * @returns true if there exists a path matching both patterns
+ *
+ * @public
+ */
+export function hasOverlap(a, b) {
+    // Generate paths from A and check if any match B
+    const aPaths = generateTestPaths(a, 15);
+    for (const path of aPaths) {
+        if (matchPath(path, b)) {
+            return true;
+        }
+    }
+    // Generate paths from B and check if any match A
+    const bPaths = generateTestPaths(b, 15);
+    for (const path of bPaths) {
+        if (matchPath(path, a)) {
+            return true;
+        }
+    }
+    // Try to generate paths that combine constraints from both patterns
+    const combinedPaths = generateCombinedPaths(a, b, 15);
+    for (const path of combinedPaths) {
+        if (matchPath(path, a) && matchPath(path, b)) {
+            return true;
+        }
+    }
+    return false;
+}
+/**
+ * Generate paths that might match both patterns by combining their constraints.
+ */
+function generateCombinedPaths(a, b, count) {
+    const paths = [];
+    // Extract constraints from both patterns, removing leading slashes
+    const aPrefix = a.quickReject.requiredPrefix?.replace(/^\//, '') ?? '';
+    const bPrefix = b.quickReject.requiredPrefix?.replace(/^\//, '') ?? '';
+    const aSuffix = a.quickReject.requiredSuffix?.replace(/^\//, '') ?? '';
+    const bSuffix = b.quickReject.requiredSuffix?.replace(/^\//, '') ?? '';
+    // Extract file extensions and base names from suffixes
+    const extractFileInfo = (suffix) => {
+        if (!suffix)
+            return { basename: '', ext: '' };
+        const lastDot = suffix.lastIndexOf('.');
+        if (lastDot > 0) {
+            return { basename: suffix.slice(0, lastDot), ext: suffix.slice(lastDot) };
+        }
+        return { basename: suffix, ext: '' };
+    };
+    // Build candidate paths
+    const prefixes = [aPrefix, bPrefix].filter(Boolean);
+    if (prefixes.length === 0)
+        prefixes.push('');
+    // If we have suffixes like "index.ts", extract the components
+    const suffixInfoA = extractFileInfo(aSuffix);
+    const suffixInfoB = extractFileInfo(bSuffix);
+    // File basenames to try
+    const basenames = [suffixInfoA.basename || 'index', suffixInfoB.basename || 'index', 'file', 'test'].filter(Boolean);
+    // Extensions to try
+    const extensions = [suffixInfoA.ext, suffixInfoB.ext, '.ts', '.js'].filter(Boolean);
+    for (const prefix of prefixes) {
+        for (const basename of basenames) {
+            for (const ext of extensions) {
+                // Build path: /prefix/basename.ext
+                const filename = basename + ext;
+                const path = prefix ? `/${prefix}/${filename}` : `/${filename}`;
+                if (!paths.includes(path)) {
+                    paths.push(path);
+                }
+                // Also try with subdirectory
+                if (prefix) {
+                    const deepPath = `/${prefix}/sub/${filename}`;
+                    if (!paths.includes(deepPath)) {
+                        paths.push(deepPath);
+                    }
+                }
+                if (paths.length >= count)
+                    break;
+            }
+            if (paths.length >= count)
+                break;
+        }
+        if (paths.length >= count)
+            break;
+    }
+    return paths.slice(0, count);
+}
+/**
+ * Determine if two patterns are disjoint (no common paths).
+ *
+ * @param a - First pattern
+ * @param b - Second pattern
+ * @returns true if patterns have no paths in common
+ *
+ * @public
+ */
+export function areDisjoint(a, b) {
+    return !hasOverlap(a, b);
+}
+/**
+ * Get a human-readable summary of the relationship between patterns.
+ *
+ * @param relationship - The pattern relationship
+ * @param patternA - Source of pattern A
+ * @param patternB - Source of pattern B
+ * @returns Human-readable description
+ *
+ * @public
+ */
+export function summarizeRelationship(relationship, patternA, patternB) {
+    switch (relationship) {
+        case 'equal':
+            return `"${patternA}" and "${patternB}" match exactly the same paths`;
+        case 'subset':
+            return `"${patternA}" is contained within "${patternB}" (every path matching A also matches B)`;
+        case 'superset':
+            return `"${patternA}" contains "${patternB}" (every path matching B also matches A)`;
+        case 'overlapping':
+            return `"${patternA}" and "${patternB}" have some paths in common, but neither contains the other`;
+        case 'disjoint':
+            return `"${patternA}" and "${patternB}" have no paths in common`;
+    }
+}
+/**
+ * Generate test paths that match a pattern.
+ */
+function generateTestPaths(pattern, count) {
+    const paths = [];
+    const ast = pattern.ast;
+    if (ast.root.type === 'alternation') {
+        // Generate paths for each branch
+        for (const branch of ast.root.branches) {
+            paths.push(...generatePathsFromSequence(branch, Math.ceil(count / ast.root.branches.length)));
+        }
+    }
+    else {
+        paths.push(...generatePathsFromSequence(ast.root, count));
+    }
+    return paths.slice(0, count);
+}
+/**
+ * Generate paths from a segment sequence.
+ */
+function generatePathsFromSequence(sequence, count) {
+    const paths = [];
+    // Generate base path
+    const basePath = generateBasePath(sequence.segments);
+    paths.push(basePath);
+    // Generate variations
+    for (let i = 1; i < count && paths.length < count; i++) {
+        const variation = generatePathVariation(sequence.segments, i);
+        if (variation && !paths.includes(variation)) {
+            paths.push(variation);
+        }
+    }
+    return paths;
+}
+/**
+ * Generate a base path from segments.
+ */
+function generateBasePath(segments) {
+    const parts = [];
+    for (const segment of segments) {
+        parts.push(generateSegmentValue(segment, 0));
+    }
+    return '/' + parts.join('/');
+}
+/**
+ * Generate a path variation.
+ */
+function generatePathVariation(segments, variationIndex) {
+    const parts = [];
+    let usedVariation = false;
+    for (let i = 0; i < segments.length; i++) {
+        const segment = segments[i];
+        if (segment.type === 'globstar' && !usedVariation) {
+            // For globstar, always add at least one segment (globstar requires at least 1)
+            // Then optionally add more based on variation
+            const extraCount = 1 + (variationIndex % 3);
+            for (let j = 0; j < extraCount; j++) {
+                parts.push(`dir${j}`);
+            }
+            usedVariation = true;
+        }
+        else {
+            parts.push(generateSegmentValue(segment, usedVariation ? 0 : variationIndex));
+        }
+    }
+    return '/' + parts.join('/');
+}
+/**
+ * Generate a value that matches a segment pattern.
+ */
+function generateSegmentValue(segment, variation) {
+    switch (segment.type) {
+        case 'literal':
+            return segment.value;
+        case 'globstar':
+            return 'subdir';
+        case 'wildcard': {
+            // Generate based on pattern
+            const pattern = segment.pattern;
+            if (pattern.endsWith('.ts')) {
+                return `file${variation}.ts`;
+            }
+            if (pattern.endsWith('.js')) {
+                return `file${variation}.js`;
+            }
+            if (pattern.startsWith('test-')) {
+                return `test-${variation}`;
+            }
+            return `match${variation}`;
+        }
+        case 'charclass':
+            // Pick a character from the class
+            if (segment.ranges.length > 0) {
+                const range = segment.ranges[0];
+                return range.start;
+            }
+            return segment.chars[0] || 'x';
+        case 'composite':
+            return `composite${variation}`;
+    }
+}
+//# sourceMappingURL=analysis.js.map

package/dist/containment/analysis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"analysis.js","sourceRoot":"","sources":["../../src/containment/analysis.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAUH,OAAO,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAA;AAChD,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAA;AAE5C;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,eAAe,CAAC,CAAkB,EAAE,CAAkB;IACpE,MAAM,WAAW,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAE1C,MAAM,YAAY,GAAG,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC/C,MAAM,OAAO,GAAG,qBAAqB,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;IAClD,MAAM,OAAO,GAAG,qBAAqB,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;IAElD,OAAO;QACL,QAAQ,EAAE,CAAC,CAAC,MAAM;QAClB,QAAQ,EAAE,CAAC,CAAC,MAAM;QAClB,YAAY,EAAE,WAAW,CAAC,YAAY;QACtC,WAAW;QACX,YAAY;QACZ,OAAO;QACP,OAAO;KACR,CAAA;AACH,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,CAAkB,EAAE,CAAkB;IAClE,iEAAiE;IACjE,MAAM,QAAQ,GAAa,EAAE,CAAA;IAC7B,MAAM,MAAM,GAAG,iBAAiB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;IACvC,MAAM,MAAM,GAAG,iBAAiB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;IAEvC,kCAAkC;IAClC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACnB,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC;gBAAE,MAAK;QACjC,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACnB,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC;gBAAE,MAAK;QACjC,CAAC;IACH,CAAC;IAED,6CAA6C;IAC7C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,aAAa,GAAG,qBAAqB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAA;QACrD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBACzE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACnB,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC;oBAAE,MAAK;YACjC,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO;YACL,OAAO,EAAE,IAAI;YACb,WAAW,EAAE,sCAAsC;SACpD,CAAA;IACH,CAAC;IAED,2CAA2C;IAC3C,MAAM,OAAO,GAAG,2BAA2B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAEjD,OAAO;QACL,OAAO,EAAE,KAAK;QACd,QAAQ;QACR,OAAO;QACP,WAAW,EAAE,OAAO;YAClB,CAAC,CAAC,iCAAiC,OAAO,EAAE;YAC5C,CAAC,CAAC,0BAA0B,CAAC,CAAC,MAAM,UAAU,CAAC,CAAC,MAAM,GAAG;KAC5D,CAAA;AACH,CAAC;AAED;;GAEG;AACH,SAAS,qBAAqB,CAAC,CAAkB,EAAE,CAAkB,EAAE,SAAwB;IAC7F,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAE7D,oEAAoE;IACpE,MAAM,QAAQ,GAAa,EAAE,CAAA;IAC7B,MAAM,UAAU,GAAG,iBAAiB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;IAE/C,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACzD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACnB,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC;gBAAE,MAAK;QACjC,CAAC;IACH,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO;YACL,OAAO,EAAE,IAAI;YACb,WAAW,EACT,SAAS,KAAK,KAAK;gBACjB,CAAC,CAAC,uBAAuB,CAAC,CAAC,MAAM,iBAAiB,CAAC,CAAC,MAAM,GAAG;gBAC7D,CAAC,CAAC,uBAAuB,CAAC,CAAC,MAAM,iBAAiB,CAAC,CAAC,MAAM,GAAG;SAClE,CAAA;IACH,CAAC;IAED,OAAO;QACL,OAAO,EAAE,KAAK;QACd,QAAQ;QACR,WAAW,EACT,SAAS,KAAK,KAAK;YACjB,CAAC,CAAC,mBAAmB,CAAC,CAAC,MAAM,cAAc,CAAC,CAAC,MAAM,GAAG;YACtD,CAAC,CAAC,mBAAmB,CAAC,CAAC,MAAM,cAAc,CAAC,CAAC,MAAM,GAAG;KAC3D,CAAA;AACH,CAAC;AAED;;GAEG;AACH,SAAS,2BAA2B,CAAC,CAAkB,EAAE,CAAkB;IACzE,yDAAyD;IAEzD,uEAAuE;IACvE,MAAM,OAAO,GAAG,CAAC,CAAC,WAAW,CAAC,cAAc,CAAA;IAC5C,MAAM,OAAO,GAAG,CAAC,CAAC,WAAW,CAAC,cAAc,CAAA;IAE5C,IAAI,OAAO,IAAI,OAAO,EAAE,CAAC;QACvB,yDAAyD;QACzD,IAAI,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YAChC,OAAO,CAAC,CAAC,MAAM,CAAA,CAAC,qBAAqB;QACvC,CAAC;QACD,IAAI,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YAChC,OAAO,CAAC,CAAC,MAAM,CAAA,CAAC,qBAAqB;QACvC,CAAC;IACH,CAAC;IAED,8DAA8D;IAC9D,OAAO,SAAS,CAAA;AAClB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,aAAa,CAAC,CAAkB,EAAE,CAAkB;IAClE,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACrC,OAAO,MAAM,CAAC,OAAO,CAAA;AACvB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,UAAU,CAAC,CAAkB,EAAE,CAAkB;IAC/D,iDAAiD;IACjD,MAAM,MAAM,GAAG,iBAAiB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;IACvC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YACvB,OAAO,IAAI,CAAA;QACb,CAAC;IACH,CAAC;IAED,iDAAiD;IACjD,MAAM,MAAM,GAAG,iBAAiB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;IACvC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YACvB,OAAO,IAAI,CAAA;QACb,CAAC;IACH,CAAC;IAED,oEAAoE;IACpE,MAAM,aAAa,GAAG,qBAAqB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAA;IACrD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YAC7C,OAAO,IAAI,CAAA;QACb,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;GAEG;AACH,SAAS,qBAAqB,CAAC,CAAkB,EAAE,CAAkB,EAAE,KAAa;IAClF,MAAM,KAAK,GAAa,EAAE,CAAA;IAE1B,mEAAmE;IACnE,MAAM,OAAO,GAAG,CAAC,CAAC,WAAW,CAAC,cAAc,EAAE,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,EAAE,CAAA;IACtE,MAAM,OAAO,GAAG,CAAC,CAAC,WAAW,CAAC,cAAc,EAAE,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,EAAE,CAAA;IACtE,MAAM,OAAO,GAAG,CAAC,CAAC,WAAW,CAAC,cAAc,EAAE,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,EAAE,CAAA;IACtE,MAAM,OAAO,GAAG,CAAC,CAAC,WAAW,CAAC,cAAc,EAAE,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,EAAE,CAAA;IAEtE,uDAAuD;IACvD,MAAM,eAAe,GAAG,CAAC,MAAc,EAAqC,EAAE;QAC5E,IAAI,CAAC,MAAM;YAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAA;QAC7C,MAAM,OAAO,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;QACvC,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;YAChB,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAA;QAC3E,CAAC;QACD,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,EAAE,CAAA;IACtC,CAAC,CAAA;IAED,wBAAwB;IACxB,MAAM,QAAQ,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IACnD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAE5C,8DAA8D;IAC9D,MAAM,WAAW,GAAG,eAAe,CAAC,OAAO,CAAC,CAAA;IAC5C,MAAM,WAAW,GAAG,eAAe,CAAC,OAAO,CAAC,CAAA;IAE5C,wBAAwB;IACxB,MAAM,SAAS,GAAG,CAAC,WAAW,CAAC,QAAQ,IAAI,OAAO,EAAE,WAAW,CAAC,QAAQ,IAAI,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IAEpH,oBAAoB;IACpB,MAAM,UAAU,GAAG,CAAC,WAAW,CAAC,GAAG,EAAE,WAAW,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IAEnF,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC9B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;gBAC7B,mCAAmC;gBACnC,MAAM,QAAQ,GAAG,QAAQ,GAAG,GAAG,CAAA;gBAC/B,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,IAAI,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,QAAQ,EAAE,CAAA;gBAE/D,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC1B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAClB,CAAC;gBAED,6BAA6B;gBAC7B,IAAI,MAAM,EAAE,CAAC;oBACX,MAAM,QAAQ,GAAG,IAAI,MAAM,QAAQ,QAAQ,EAAE,CAAA;oBAC7C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC9B,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;oBACtB,CAAC;gBACH,CAAC;gBAED,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK;oBAAE,MAAK;YAClC,CAAC;YACD,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAK;QAClC,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK;YAAE,MAAK;IAClC,CAAC;IAED,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;AAC9B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAAC,CAAkB,EAAE,CAAkB;IAChE,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAC1B,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,qBAAqB,CAAC,YAAiC,EAAE,QAAgB,EAAE,QAAgB;IACzG,QAAQ,YAAY,EAAE,CAAC;QACrB,KAAK,OAAO;YACV,OAAO,IAAI,QAAQ,UAAU,QAAQ,gCAAgC,CAAA;QAEvE,KAAK,QAAQ;YACX,OAAO,IAAI,QAAQ,0BAA0B,QAAQ,0CAA0C,CAAA;QAEjG,KAAK,UAAU;YACb,OAAO,IAAI,QAAQ,eAAe,QAAQ,0CAA0C,CAAA;QAEtF,KAAK,aAAa;YAChB,OAAO,IAAI,QAAQ,UAAU,QAAQ,6DAA6D,CAAA;QAEpG,KAAK,UAAU;YACb,OAAO,IAAI,QAAQ,UAAU,QAAQ,2BAA2B,CAAA;IACpE,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,OAAwB,EAAE,KAAa;IAChE,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAA;IAEvB,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QACpC,iCAAiC;QACjC,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,GAAG,yBAAyB,CAAC,MAAyB,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAClH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,KAAK,CAAC,IAAI,CAAC,GAAG,yBAAyB,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAA;IAC3D,CAAC;IAED,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;AAC9B,CAAC;AAED;;GAEG;AACH,SAAS,yBAAyB,CAAC,QAAyB,EAAE,KAAa;IACzE,MAAM,KAAK,GAAa,EAAE,CAAA;IAE1B,qBAAqB;IACrB,MAAM,QAAQ,GAAG,gBAAgB,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAA;IACpD,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;IAEpB,sBAAsB;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QACvD,MAAM,SAAS,GAAG,qBAAqB,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;QAC7D,IAAI,SAAS,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;YAC5C,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QACvB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,QAA4B;IACpD,MAAM,KAAK,GAAa,EAAE,CAAA;IAE1B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAA;IAC9C,CAAC;IAED,OAAO,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AAC9B,CAAC;AAED;;GAEG;AACH,SAAS,qBAAqB,CAAC,QAA4B,EAAE,cAAsB;IACjF,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,IAAI,aAAa,GAAG,KAAK,CAAA;IAEzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;QAC3B,IAAI,OAAO,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,aAAa,EAAE,CAAC;YAClD,+EAA+E;YAC/E,8CAA8C;YAC9C,MAAM,UAAU,GAAG,CAAC,GAAG,CAAC,cAAc,GAAG,CAAC,CAAC,CAAA;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;YACvB,CAAC;YACD,aAAa,GAAG,IAAI,CAAA;QACtB,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAA;QAC/E,CAAC;IACH,CAAC;IAED,OAAO,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AAC9B,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,OAAgB,EAAE,SAAiB;IAC/D,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;QACrB,KAAK,SAAS;YACZ,OAAO,OAAO,CAAC,KAAK,CAAA;QAEtB,KAAK,UAAU;YACb,OAAO,QAAQ,CAAA;QAEjB,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,4BAA4B;YAC5B,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAA;YAC/B,IAAI,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,OAAO,OAAO,SAAS,KAAK,CAAA;YAC9B,CAAC;YACD,IAAI,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,OAAO,OAAO,SAAS,KAAK,CAAA;YAC9B,CAAC;YACD,IAAI,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;gBAChC,OAAO,QAAQ,SAAS,EAAE,CAAA;YAC5B,CAAC;YACD,OAAO,QAAQ,SAAS,EAAE,CAAA;QAC5B,CAAC;QAED,KAAK,WAAW;YACd,kCAAkC;YAClC,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9B,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;gBAC/B,OAAO,KAAK,CAAC,KAAK,CAAA;YACpB,CAAC;YACD,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAA;QAEhC,KAAK,WAAW;YACd,OAAO,YAAY,SAAS,EAAE,CAAA;IAClC,CAAC;AACH,CAAC"}

package/dist/containment/containment.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Pattern containment checking.
+ * @packageDocumentation
+ */
+import type { CompiledPattern, ContainmentResult } from '../types';
+/**
+ * Check if pattern A is contained within pattern B.
+ *
+ * A ⊆ B means: every path that matches A also matches B.
+ *
+ * Uses a hybrid approach:
+ * 1. Structural analysis for quick checks
+ * 2. Sample-based testing for validation
+ * 3. Automaton operations for complex cases (when available)
+ *
+ * @param a - First compiled pattern
+ * @param b - Second compiled pattern
+ * @returns Containment result with explanation data
+ *
+ * @public
+ */
+export declare function checkContainment(a: CompiledPattern, b: CompiledPattern): ContainmentResult;
+//# sourceMappingURL=containment.d.ts.map

package/dist/containment/containment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"containment.d.ts","sourceRoot":"","sources":["../../src/containment/containment.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EACV,eAAe,EACf,iBAAiB,EAYlB,MAAM,UAAU,CAAA;AAGjB;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,eAAe,GAAG,iBAAiB,CAmC1F"}