@astrale-os/kernel-dsl 0.2.0-beta.4 → 0.2.0-beta.41

package/dist/v1/schema/policy/validation/context.js

@@ -1,99 +0,0 @@
-import { diagnostic } from '../../diagnostic.js';
-import { schemaRefIndex, formatSchemaRef, } from '../../reference.js';
-export class PolicyValidationContext {
-    environment;
-    analysis;
-    diagnostics = [];
-    normalized = new Map();
-    allNodeClasses;
-    #invalidPolicyRefs = new Set();
-    constructor(environment, analysis) {
-        this.environment = environment;
-        this.analysis = analysis;
-        this.allNodeClasses = [...environment.definitions.values()]
-            .filter((value) => value.ref.kind === 'class' && value.family === 'node')
-            .map((value) => value.ref);
-    }
-    resolveNodeClass(ref, pointer) {
-        const resolved = this.environment.resolve(ref);
-        if (resolved === undefined || resolved.ref.kind !== 'class' || resolved.family !== 'node') {
-            this.add('PL_REF', pointer, `${formatSchemaRef(ref)} does not resolve to an owning/direct-dependency Node Class.`, formatSchemaRef(ref));
-            return undefined;
-        }
-        return resolved;
-    }
-    resolveEdge(ref, pointer) {
-        const resolved = this.environment.resolve(ref);
-        if (resolved === undefined || resolved.ref.kind !== 'class' || resolved.family !== 'edge') {
-            this.add('PL_REF', pointer, `${formatSchemaRef(ref)} does not resolve to an owning/direct-dependency Edge Class.`, formatSchemaRef(ref));
-            return undefined;
-        }
-        return resolved;
-    }
-    resolvePolicy(ref, pointer) {
-        const key = `${pointer}\u0000${schemaRefIndex(ref)}`;
-        if (this.#invalidPolicyRefs.has(key))
-            return false;
-        const declaration = this.environment.resolvePolicy(ref);
-        if (ref.origin !== this.environment.candidate.origin ||
-            ref.kind !== 'policy' ||
-            declaration === undefined) {
-            this.#invalidPolicyRefs.add(key);
-            this.add('PL_REF', pointer, `${formatSchemaRef(ref)} is not an exact local named Policy ref.`, formatSchemaRef(ref));
-            return false;
-        }
-        return true;
-    }
-    isLocalPolicy(ref) {
-        return (ref.origin === this.environment.candidate.origin &&
-            ref.kind === 'policy' &&
-            this.environment.candidate.policies[ref.name] !== undefined);
-    }
-    edgeDeclaration(ref) {
-        const resolved = this.environment.resolve(ref);
-        if (resolved === undefined || resolved.ref.kind !== 'class' || resolved.family !== 'edge') {
-            return undefined;
-        }
-        const declaration = resolved.declaration;
-        return declaration.family === 'edge' ? declaration : undefined;
-    }
-    classImplements(candidate, required) {
-        const resolved = this.environment.resolveAny(candidate);
-        if (resolved === undefined || resolved.ref.kind !== 'class' || resolved.family !== 'node') {
-            return false;
-        }
-        const declaration = resolved.declaration;
-        if (declaration.family !== 'node')
-            return false;
-        return declaration.implements.some((parent) => this.interfaceExtends(parent, required));
-    }
-    interfaceExtends(candidate, required) {
-        if (schemaRefIndex(candidate) === schemaRefIndex(required))
-            return true;
-        const visited = new Set();
-        const visit = (ref) => {
-            const key = schemaRefIndex(ref);
-            if (key === schemaRefIndex(required))
-                return true;
-            if (visited.has(key))
-                return false;
-            visited.add(key);
-            const resolved = this.environment.resolveAny(ref);
-            if (resolved === undefined ||
-                resolved.ref.kind !== 'interface' ||
-                (resolved.family !== 'node' && resolved.family !== 'both')) {
-                return false;
-            }
-            const declaration = resolved.declaration;
-            return declaration.extends.some(visit);
-        };
-        return visit(candidate);
-    }
-    add(code, pointer, message, ref) {
-        this.diagnostics.push(diagnostic(code, pointer, message, ref));
-    }
-}
-export function escapePointer(value) {
-    return value.replaceAll('~', '~0').replaceAll('/', '~1');
-}
-//# sourceMappingURL=context.js.map

package/dist/v1/schema/policy/validation/context.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"context.js","sourceRoot":"","sources":["../../../../../v1/schema/policy/validation/context.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAA;AAChD,OAAO,EACL,cAAc,EACd,eAAe,GAIhB,MAAM,oBAAoB,CAAA;AAE3B,MAAM,OAAO,uBAAuB;IAOvB,WAAW;IACX,QAAQ;IAPV,WAAW,GAAuB,EAAE,CAAA;IACpC,UAAU,GAAG,IAAI,GAAG,EAA6B,CAAA;IACjD,cAAc,CAAqB;IACnC,kBAAkB,GAAG,IAAI,GAAG,EAAU,CAAA;IAE/C,YACW,WAAoC,EACpC,QAAkC;2BADlC,WAAW;wBACX,QAAQ;QAEjB,IAAI,CAAC,cAAc,GAAG,CAAC,GAAG,WAAW,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;aACxD,MAAM,CACL,CAAC,KAAK,EAA4D,EAAE,CAClE,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,CACxD;aACA,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IAC9B,CAAC;IAED,gBAAgB,CAAC,GAAa,EAAE,OAAe;QAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;QAC9C,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,QAAQ,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YAC1F,IAAI,CAAC,GAAG,CACN,QAAQ,EACR,OAAO,EACP,GAAG,eAAe,CAAC,GAAG,CAAC,8DAA8D,EACrF,eAAe,CAAC,GAAG,CAAC,CACrB,CAAA;YACD,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,OAAO,QAAQ,CAAA;IACjB,CAAC;IAED,WAAW,CAAC,GAAa,EAAE,OAAe;QACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;QAC9C,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,QAAQ,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YAC1F,IAAI,CAAC,GAAG,CACN,QAAQ,EACR,OAAO,EACP,GAAG,eAAe,CAAC,GAAG,CAAC,8DAA8D,EACrF,eAAe,CAAC,GAAG,CAAC,CACrB,CAAA;YACD,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,OAAO,QAAQ,CAAA;IACjB,CAAC;IAED,aAAa,CAAC,GAAc,EAAE,OAAe;QAC3C,MAAM,GAAG,GAAG,GAAG,OAAO,SAAS,cAAc,CAAC,GAAG,CAAC,EAAE,CAAA;QACpD,IAAI,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAA;QAClD,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,GAAG,CAAC,CAAA;QACvD,IACE,GAAG,CAAC,MAAM,KAAK,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,MAAM;YAChD,GAAG,CAAC,IAAI,KAAK,QAAQ;YACrB,WAAW,KAAK,SAAS,EACzB,CAAC;YACD,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAChC,IAAI,CAAC,GAAG,CACN,QAAQ,EACR,OAAO,EACP,GAAG,eAAe,CAAC,GAAG,CAAC,0CAA0C,EACjE,eAAe,CAAC,GAAG,CAAC,CACrB,CAAA;YACD,OAAO,KAAK,CAAA;QACd,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,aAAa,CAAC,GAAc;QAC1B,OAAO,CACL,GAAG,CAAC,MAAM,KAAK,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,MAAM;YAChD,GAAG,CAAC,IAAI,KAAK,QAAQ;YACrB,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,SAAS,CAC5D,CAAA;IACH,CAAC;IAED,eAAe,CACb,GAAa;QAEb,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;QAC9C,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,QAAQ,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YAC1F,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,MAAM,WAAW,GAAG,QAAQ,CAAC,WAA+B,CAAA;QAC5D,OAAO,WAAW,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAA;IAChE,CAAC;IAED,eAAe,CAAC,SAAmB,EAAE,QAAsB;QACzD,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,SAAS,CAAC,CAAA;QACvD,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,QAAQ,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YAC1F,OAAO,KAAK,CAAA;QACd,CAAC;QACD,MAAM,WAAW,GAAG,QAAQ,CAAC,WAA+B,CAAA;QAC5D,IAAI,WAAW,CAAC,MAAM,KAAK,MAAM;YAAE,OAAO,KAAK,CAAA;QAC/C,OAAO,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAA;IACzF,CAAC;IAED,gBAAgB,CAAC,SAAuB,EAAE,QAAsB;QAC9D,IAAI,cAAc,CAAC,SAAS,CAAC,KAAK,cAAc,CAAC,QAAQ,CAAC;YAAE,OAAO,IAAI,CAAA;QACvE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;QACjC,MAAM,KAAK,GAAG,CAAC,GAAiB,EAAW,EAAE;YAC3C,MAAM,GAAG,GAAG,cAAc,CAAC,GAAG,CAAC,CAAA;YAC/B,IAAI,GAAG,KAAK,cAAc,CAAC,QAAQ,CAAC;gBAAE,OAAO,IAAI,CAAA;YACjD,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,OAAO,KAAK,CAAA;YAClC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAChB,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;YACjD,IACE,QAAQ,KAAK,SAAS;gBACtB,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,WAAW;gBACjC,CAAC,QAAQ,CAAC,MAAM,KAAK,MAAM,IAAI,QAAQ,CAAC,MAAM,KAAK,MAAM,CAAC,EAC1D,CAAC;gBACD,OAAO,KAAK,CAAA;YACd,CAAC;YACD,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAmC,CAAA;YAChE,OAAO,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACxC,CAAC,CAAA;QACD,OAAO,KAAK,CAAC,SAAS,CAAC,CAAA;IACzB,CAAC;IAED,GAAG,CAAC,IAAY,EAAE,OAAe,EAAE,OAAe,EAAE,GAAY;QAC9D,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC,CAAA;IAChE,CAAC;CACF;AAED,MAAM,UAAU,aAAa,CAAC,KAAa;IACzC,OAAO,KAAK,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;AAC1D,CAAC"}

package/dist/v1/schema/policy/validation/references.d.ts

@@ -1,3 +0,0 @@
-import type { PolicyValidationContext } from './context.js';
-export declare function validatePolicyReferences(context: PolicyValidationContext): void;
-//# sourceMappingURL=references.d.ts.map

package/dist/v1/schema/policy/validation/references.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"references.d.ts","sourceRoot":"","sources":["../../../../../v1/schema/policy/validation/references.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAA;AAO3D,wBAAgB,wBAAwB,CAAC,OAAO,EAAE,uBAAuB,GAAG,IAAI,CAQ/E"}

package/dist/v1/schema/policy/validation/references.js

@@ -1,136 +0,0 @@
-import { normalizePolicyDeclaration, normalizePolicyPattern } from '../normalize.js';
-import { branchesOf, isConnected, targetMode } from './branches.js';
-import { MAX_REPEAT, MAX_VARIABLES } from './budgets.js';
-import { escapePointer } from './context.js';
-export function validatePolicyReferences(context) {
-    for (const [name, declaration] of Object.entries(context.environment.candidate.policies)) {
-        const pointer = `/policies/${escapePointer(name)}`;
-        context.normalized.set(name, normalizePolicyDeclaration(declaration));
-        if ('match' in declaration)
-            validateMatch(context, name, declaration.match, pointer);
-        else
-            validateComposition(context, declaration, pointer);
-    }
-    validateCycles(context);
-}
-function validateMatch(context, name, pattern, pointer) {
-    const declarations = new Map();
-    const uses = new Map();
-    validatePatternNode(context, pattern, `${pointer}/match`, new Set(), declarations, uses);
-    for (const [id, declaration] of declarations) {
-        if ((uses.get(id) ?? 0) === 0) {
-            context.add('PL_VARIABLE_SCOPE', declaration.pointer, `Variable ${id} is declared but never used.`);
-        }
-    }
-    const normalized = normalizePolicyPattern(pattern);
-    const branches = branchesOf(normalized, name);
-    for (const [index, branch] of branches.entries()) {
-        const mode = targetMode(branch);
-        if (mode === undefined) {
-            context.add('PL_TARGET', `${pointer}/match`, `Normalized branch ${index} must use object or both source and target, without mixing target modes.`);
-            continue;
-        }
-        if (!isConnected(branch)) {
-            context.add('PL_CONNECTIVITY', `${pointer}/match`, `Normalized ${mode} branch ${index} does not connect subject, its target terms, and every scoped term.`);
-        }
-    }
-}
-function validatePatternNode(context, pattern, pointer, scope, declarations, uses) {
-    if (isEdge(pattern)) {
-        context.resolveEdge(pattern.class, `${pointer}/class`);
-        validateTerm(context, pattern.source, `${pointer}/source`, scope, uses);
-        validateTerm(context, pattern.target, `${pointer}/target`, scope, uses);
-        if (pattern.repeat !== undefined) {
-            const { min, max } = pattern.repeat;
-            if (!Number.isInteger(min) ||
-                !Number.isInteger(max) ||
-                min < 0 ||
-                max < min ||
-                max > MAX_REPEAT) {
-                context.add('PL_REPEAT', `${pointer}/repeat`, `Repeat requires integral bounds 0 <= min <= max <= ${MAX_REPEAT}.`);
-            }
-        }
-        return;
-    }
-    if ('exists' in pattern) {
-        if (pattern.exists.nodes.length > MAX_VARIABLES) {
-            context.add('PL_BUDGET', `${pointer}/exists/nodes`, `An exists expression declares ${pattern.exists.nodes.length} variables; the maximum is ${MAX_VARIABLES}.`);
-        }
-        const nested = new Set(scope);
-        for (const [index, node] of pattern.exists.nodes.entries()) {
-            const id = node.variable.id;
-            const declarationPointer = `${pointer}/exists/nodes/${index}`;
-            if (declarations.has(id)) {
-                context.add('PL_VARIABLE_SCOPE', `${declarationPointer}/variable/id`, `Variable ${id} is declared more than once; variable IDs are globally unique.`);
-            }
-            else {
-                declarations.set(id, { ref: node.class, pointer: declarationPointer });
-            }
-            if (nested.has(id)) {
-                context.add('PL_VARIABLE_SCOPE', `${declarationPointer}/variable/id`, `Variable ${id} shadows an enclosing variable.`);
-            }
-            nested.add(id);
-            context.resolveNodeClass(node.class, `${declarationPointer}/class`);
-        }
-        validatePatternNode(context, pattern.exists.where, `${pointer}/exists/where`, nested, declarations, uses);
-        return;
-    }
-    const { key, values } = patternOperands(pattern);
-    if (values.length === 0) {
-        context.add('PL_COMPOSITION', `${pointer}/${key}`, `${key} must be non-empty.`);
-    }
-    values.forEach((child, index) => validatePatternNode(context, child, `${pointer}/${key}/${index}`, scope, declarations, uses));
-}
-function validateTerm(context, term, pointer, scope, uses) {
-    if (term.kind === 'variable') {
-        if (!scope.has(term.id)) {
-            context.add('PL_VARIABLE_SCOPE', pointer, `Variable ${term.id} is free, escaped, or outside its defining exists scope.`);
-        }
-        else {
-            uses.set(term.id, (uses.get(term.id) ?? 0) + 1);
-        }
-    }
-}
-function validateComposition(context, declaration, pointer) {
-    const key = 'allOf' in declaration ? 'allOf' : 'anyOf';
-    const refs = 'allOf' in declaration ? declaration.allOf : declaration.anyOf;
-    if (refs.length === 0) {
-        context.add('PL_COMPOSITION', `${pointer}/${key}`, `${key} must be non-empty.`);
-    }
-    refs.forEach((ref, index) => context.resolvePolicy(ref, `${pointer}/${key}/${index}`));
-}
-function validateCycles(context) {
-    const visiting = new Set();
-    const visited = new Set();
-    const visit = (name, stack) => {
-        if (visiting.has(name)) {
-            context.add('PL_COMPOSITION', `/policies/${escapePointer(name)}`, `Named Policy composition cycle: ${[...stack, name].join(' -> ')}.`);
-            return;
-        }
-        if (visited.has(name))
-            return;
-        visiting.add(name);
-        const declaration = context.environment.candidate.policies[name];
-        if (declaration !== undefined && !('match' in declaration)) {
-            const refs = 'allOf' in declaration ? declaration.allOf : declaration.anyOf;
-            for (const ref of refs) {
-                if (ref.origin === context.environment.candidate.origin && ref.kind === 'policy') {
-                    visit(ref.name, [...stack, name]);
-                }
-            }
-        }
-        visiting.delete(name);
-        visited.add(name);
-    };
-    for (const name of Object.keys(context.environment.candidate.policies))
-        visit(name, []);
-}
-function patternOperands(value) {
-    return 'allOf' in value
-        ? { key: 'allOf', values: value.allOf }
-        : { key: 'anyOf', values: value.anyOf };
-}
-function isEdge(value) {
-    return 'source' in value;
-}
-//# sourceMappingURL=references.js.map

package/dist/v1/schema/policy/validation/references.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"references.js","sourceRoot":"","sources":["../../../../../v1/schema/policy/validation/references.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,0BAA0B,EAAE,sBAAsB,EAAE,MAAM,iBAAiB,CAAA;AACpF,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,eAAe,CAAA;AACnE,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,cAAc,CAAA;AACxD,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAA;AAE5C,MAAM,UAAU,wBAAwB,CAAC,OAAgC;IACvE,KAAK,MAAM,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;QACzF,MAAM,OAAO,GAAG,aAAa,aAAa,CAAC,IAAI,CAAC,EAAE,CAAA;QAClD,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,0BAA0B,CAAC,WAAW,CAAC,CAAC,CAAA;QACrE,IAAI,OAAO,IAAI,WAAW;YAAE,aAAa,CAAC,OAAO,EAAE,IAAI,EAAE,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;;YAC/E,mBAAmB,CAAC,OAAO,EAAE,WAAW,EAAE,OAAO,CAAC,CAAA;IACzD,CAAC;IACD,cAAc,CAAC,OAAO,CAAC,CAAA;AACzB,CAAC;AAED,SAAS,aAAa,CACpB,OAAgC,EAChC,IAAY,EACZ,OAAgC,EAChC,OAAe;IAEf,MAAM,YAAY,GAAG,IAAI,GAAG,EAAgE,CAAA;IAC5F,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;IACtC,mBAAmB,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,OAAO,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,YAAY,EAAE,IAAI,CAAC,CAAA;IACxF,KAAK,MAAM,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9B,OAAO,CAAC,GAAG,CACT,mBAAmB,EACnB,WAAW,CAAC,OAAO,EACnB,YAAY,EAAE,8BAA8B,CAC7C,CAAA;QACH,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAG,sBAAsB,CAAC,OAAO,CAAC,CAAA;IAClD,MAAM,QAAQ,GAAG,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC,CAAA;IAC7C,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;QACjD,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,CAAA;QAC/B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,CAAC,GAAG,CACT,WAAW,EACX,GAAG,OAAO,QAAQ,EAClB,qBAAqB,KAAK,0EAA0E,CACrG,CAAA;YACD,SAAQ;QACV,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC;YACzB,OAAO,CAAC,GAAG,CACT,iBAAiB,EACjB,GAAG,OAAO,QAAQ,EAClB,cAAc,IAAI,WAAW,KAAK,qEAAqE,CACxG,CAAA;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAC1B,OAAgC,EAChC,OAAgC,EAChC,OAAe,EACf,KAA0B,EAC1B,YAA+E,EAC/E,IAAyB;IAEzB,IAAI,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;QACpB,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,OAAO,QAAQ,CAAC,CAAA;QACtD,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,MAAM,EAAE,GAAG,OAAO,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,CAAA;QACvE,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,MAAM,EAAE,GAAG,OAAO,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,CAAA;QACvE,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACjC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,OAAO,CAAC,MAAM,CAAA;YACnC,IACE,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC;gBACtB,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC;gBACtB,GAAG,GAAG,CAAC;gBACP,GAAG,GAAG,GAAG;gBACT,GAAG,GAAG,UAAU,EAChB,CAAC;gBACD,OAAO,CAAC,GAAG,CACT,WAAW,EACX,GAAG,OAAO,SAAS,EACnB,sDAAsD,UAAU,GAAG,CACpE,CAAA;YACH,CAAC;QACH,CAAC;QACD,OAAM;IACR,CAAC;IACD,IAAI,QAAQ,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,aAAa,EAAE,CAAC;YAChD,OAAO,CAAC,GAAG,CACT,WAAW,EACX,GAAG,OAAO,eAAe,EACzB,iCAAiC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,8BAA8B,aAAa,GAAG,CAC3G,CAAA;QACH,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAA;QAC7B,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAC3D,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAA;YAC3B,MAAM,kBAAkB,GAAG,GAAG,OAAO,iBAAiB,KAAK,EAAE,CAAA;YAC7D,IAAI,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACzB,OAAO,CAAC,GAAG,CACT,mBAAmB,EACnB,GAAG,kBAAkB,cAAc,EACnC,YAAY,EAAE,gEAAgE,CAC/E,CAAA;YACH,CAAC;iBAAM,CAAC;gBACN,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC,CAAA;YACxE,CAAC;YACD,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACnB,OAAO,CAAC,GAAG,CACT,mBAAmB,EACnB,GAAG,kBAAkB,cAAc,EACnC,YAAY,EAAE,iCAAiC,CAChD,CAAA;YACH,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YACd,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,kBAAkB,QAAQ,CAAC,CAAA;QACrE,CAAC;QACD,mBAAmB,CACjB,OAAO,EACP,OAAO,CAAC,MAAM,CAAC,KAAK,EACpB,GAAG,OAAO,eAAe,EACzB,MAAM,EACN,YAAY,EACZ,IAAI,CACL,CAAA;QACD,OAAM;IACR,CAAC;IACD,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,eAAe,CAAC,OAAO,CAAC,CAAA;IAChD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,CAAC,GAAG,CAAC,gBAAgB,EAAE,GAAG,OAAO,IAAI,GAAG,EAAE,EAAE,GAAG,GAAG,qBAAqB,CAAC,CAAA;IACjF,CAAC;IACD,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAC9B,mBAAmB,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,OAAO,IAAI,GAAG,IAAI,KAAK,EAAE,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,CAAC,CAC7F,CAAA;AACH,CAAC;AAED,SAAS,YAAY,CACnB,OAAgC,EAChC,IAAuB,EACvB,OAAe,EACf,KAA0B,EAC1B,IAAyB;IAEzB,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,OAAO,CAAC,GAAG,CACT,mBAAmB,EACnB,OAAO,EACP,YAAY,IAAI,CAAC,EAAE,0DAA0D,CAC9E,CAAA;QACH,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACjD,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAC1B,OAAgC,EAChC,WAAoE,EACpE,OAAe;IAEf,MAAM,GAAG,GAAG,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAA;IACtD,MAAM,IAAI,GAAG,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAA;IAC3E,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,CAAC,GAAG,CAAC,gBAAgB,EAAE,GAAG,OAAO,IAAI,GAAG,EAAE,EAAE,GAAG,GAAG,qBAAqB,CAAC,CAAA;IACjF,CAAC;IACD,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,OAAO,IAAI,GAAG,IAAI,KAAK,EAAE,CAAC,CAAC,CAAA;AACxF,CAAC;AAED,SAAS,cAAc,CAAC,OAAgC;IACtD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,KAAK,GAAG,CAAC,IAAY,EAAE,KAAwB,EAAQ,EAAE;QAC7D,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,OAAO,CAAC,GAAG,CACT,gBAAgB,EAChB,aAAa,aAAa,CAAC,IAAI,CAAC,EAAE,EAClC,mCAAmC,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CACpE,CAAA;YACD,OAAM;QACR,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAM;QAC7B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAClB,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QAChE,IAAI,WAAW,KAAK,SAAS,IAAI,CAAC,CAAC,OAAO,IAAI,WAAW,CAAC,EAAE,CAAC;YAC3D,MAAM,IAAI,GAAG,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAA;YAC3E,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,IAAI,GAAG,CAAC,MAAM,KAAK,OAAO,CAAC,WAAW,CAAC,SAAS,CAAC,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;oBACjF,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC,CAAA;gBACnC,CAAC;YACH,CAAC;QACH,CAAC;QACD,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACrB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACnB,CAAC,CAAA;IACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC;QAAE,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;AACzF,CAAC;AAED,SAAS,eAAe,CACtB,KAAyF;IAKzF,OAAO,OAAO,IAAI,KAAK;QACrB,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,KAAK,EAAE;QACvC,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,KAAK,EAAE,CAAA;AAC3C,CAAC;AAED,SAAS,MAAM,CAAC,KAA8B;IAC5C,OAAO,QAAQ,IAAI,KAAK,CAAA;AAC1B,CAAC"}

package/dist/v1/schema/policy/validation/typing.d.ts

@@ -1,23 +0,0 @@
-import type { PolicyValidationContext } from './context.js';
-import { type ClassRef, type DefinitionRef, type InterfaceRef } from '../../reference.js';
-export type ObjectContract = {
-    readonly kind: 'default';
-} | {
-    readonly kind: 'exact';
-    readonly ref: ClassRef;
-} | {
-    readonly kind: 'universal-interface';
-    readonly ref: InterfaceRef;
-};
-export declare class PolicyTyping {
-    #private;
-    readonly context: PolicyValidationContext;
-    constructor(context: PolicyValidationContext);
-    validatePolicies(): void;
-    policyAccepts(name: string, object: ObjectContract): boolean;
-    policyAcceptsEdge(name: string, source: ObjectContract, target: ObjectContract): boolean;
-    concreteEndpointClasses(accepts: readonly DefinitionRef[]): readonly ClassRef[];
-    endpointsOverlap(left: readonly DefinitionRef[], right: readonly DefinitionRef[]): boolean;
-}
-export declare function contractOfNodeDefinition(ref: DefinitionRef): ObjectContract;
-//# sourceMappingURL=typing.d.ts.map

package/dist/v1/schema/policy/validation/typing.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"typing.d.ts","sourceRoot":"","sources":["../../../../../v1/schema/policy/validation/typing.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAA;AAE3D,OAAO,EAEL,KAAK,QAAQ,EACb,KAAK,aAAa,EAClB,KAAK,YAAY,EAClB,MAAM,oBAAoB,CAAA;AAmB3B,MAAM,MAAM,cAAc,GACtB;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAA;CAAE,GAC5B;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAA;CAAE,GAClD;IAAE,QAAQ,CAAC,IAAI,EAAE,qBAAqB,CAAC;IAAC,QAAQ,CAAC,GAAG,EAAE,YAAY,CAAA;CAAE,CAAA;AAmBxE,qBAAa,YAAY;;IACX,QAAQ,CAAC,OAAO,EAAE,uBAAuB;IAArD,YAAqB,OAAO,EAAE,uBAAuB,EAAI;IAEzD,gBAAgB,IAAI,IAAI,CAiCvB;IAED,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,GAAG,OAAO,CAI3D;IAED,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,cAAc,GAAG,OAAO,CAIvF;IAED,uBAAuB,CAAC,OAAO,EAAE,SAAS,aAAa,EAAE,GAAG,SAAS,QAAQ,EAAE,CAI9E;IAED,gBAAgB,CAAC,IAAI,EAAE,SAAS,aAAa,EAAE,EAAE,KAAK,EAAE,SAAS,aAAa,EAAE,GAAG,OAAO,CAIzF;CAwNF;AASD,wBAAgB,wBAAwB,CAAC,GAAG,EAAE,aAAa,GAAG,cAAc,CAE3E"}

package/dist/v1/schema/policy/validation/typing.js

@@ -1,360 +0,0 @@
-import { schemaRefIndex, } from '../../reference.js';
-import { branchesOf, branchProduct, capBranches, targetMode, termKey, } from './branches.js';
-import { MAX_REPEAT } from './budgets.js';
-import { escapePointer } from './context.js';
-const IDENTITY_REF = {
-    origin: 'kernel.astrale.ai',
-    kind: 'interface',
-    name: 'Identity',
-};
-export class PolicyTyping {
-    context;
-    constructor(context) {
-        this.context = context;
-    }
-    validatePolicies() {
-        for (const name of Object.keys(this.context.environment.candidate.policies)) {
-            const branches = this.#expandedBranches(name, new Set(), `$${name}`);
-            if (branches === undefined)
-                continue;
-            for (const [index, branch] of branches.entries()) {
-                const mode = targetMode(branch);
-                if (mode === undefined) {
-                    if (!('match' in this.context.environment.candidate.policies[name])) {
-                        this.context.add('PL_TARGET', `/policies/${escapePointer(name)}`, `Expanded normalized branch ${index} must use object or both source and target, without mixing target modes.`);
-                    }
-                    continue;
-                }
-                const use = mode === 'object'
-                    ? { kind: 'object', object: { kind: 'default' } }
-                    : {
-                        kind: 'edge',
-                        source: { kind: 'default' },
-                        target: { kind: 'default' },
-                    };
-                if (!this.#branchIsTyped(branch, use)) {
-                    this.context.add('PL_TYPING', `/policies/${escapePointer(name)}`, `Expanded normalized branch ${index} has contradictory endpoint or repeat contracts.`);
-                }
-            }
-        }
-    }
-    policyAccepts(name, object) {
-        const branches = this.#expandedBranches(name, new Set(), `$use:${name}`);
-        const use = { kind: 'object', object };
-        return branches !== undefined && branches.every((branch) => this.#branchIsTyped(branch, use));
-    }
-    policyAcceptsEdge(name, source, target) {
-        const branches = this.#expandedBranches(name, new Set(), `$edge-use:${name}`);
-        const use = { kind: 'edge', source, target };
-        return branches !== undefined && branches.every((branch) => this.#branchIsTyped(branch, use));
-    }
-    concreteEndpointClasses(accepts) {
-        return this.context.allNodeClasses.filter((candidate) => this.#classSatisfiesEndpoint(candidate, accepts));
-    }
-    endpointsOverlap(left, right) {
-        const seed = [{ kind: 'open', requirements: [] }];
-        const afterLeft = this.#applyEndpoint(seed, left);
-        return this.#applyEndpoint(afterLeft, right).length > 0;
-    }
-    #expandedBranches(name, visiting, namespace) {
-        if (visiting.has(name))
-            return undefined;
-        const declaration = this.context.normalized.get(name);
-        if (declaration === undefined)
-            return undefined;
-        if ('match' in declaration)
-            return branchesOf(declaration.match, namespace);
-        const nested = new Set(visiting);
-        nested.add(name);
-        const refs = 'allOf' in declaration ? declaration.allOf : declaration.anyOf;
-        const children = [];
-        for (const [index, ref] of refs.entries()) {
-            if (!this.context.isLocalPolicy(ref))
-                return undefined;
-            const expanded = this.#expandedBranches(ref.name, nested, `${namespace}/${index}:${ref.name}`);
-            if (expanded === undefined)
-                return undefined;
-            children.push(expanded);
-        }
-        return 'allOf' in declaration ? branchProduct(children) : capBranches(children.flat());
-    }
-    #branchIsTyped(branch, use) {
-        if (targetMode(branch) !== use.kind)
-            return false;
-        const alternatives = edgeAlternatives(branch.edges, this);
-        return alternatives.some((variants) => this.#constraintsAreSatisfiable(branch, variants, use));
-    }
-    #constraintsAreSatisfiable(branch, variants, use) {
-        const terms = new Set(use.kind === 'object' ? ['subject', 'object'] : ['subject', 'source', 'target']);
-        for (const key of branch.variables.keys())
-            terms.add(key);
-        for (const edge of branch.edges) {
-            terms.add(termKey(edge.pattern.source, edge.namespace));
-            terms.add(termKey(edge.pattern.target, edge.namespace));
-        }
-        const union = new UnionFind(terms);
-        for (const variant of variants) {
-            for (const [left, right] of variant.equalities)
-                union.join(left, right);
-        }
-        const constraints = new Map();
-        for (const variant of variants) {
-            for (const [term, accepts] of variant.constraints) {
-                const root = union.find(term);
-                const values = constraints.get(root) ?? [];
-                values.push(accepts);
-                constraints.set(root, values);
-            }
-        }
-        const groups = new Map();
-        for (const term of terms) {
-            const root = union.find(term);
-            const members = groups.get(root) ?? [];
-            members.push(term);
-            groups.set(root, members);
-        }
-        for (const [root, members] of groups) {
-            const endpointConstraints = constraints.get(root) ?? [];
-            const universal = members
-                .map((member) => ({ member, contract: targetContract(member, use) }))
-                .find((entry) => entry.contract?.kind === 'universal-interface');
-            if (universal !== undefined) {
-                if (!this.#universalGroupIsSatisfiable(members, endpointConstraints, universal.member, universal.contract.ref, branch)) {
-                    return false;
-                }
-                continue;
-            }
-            let candidates = [{ kind: 'open', requirements: [] }];
-            for (const member of members) {
-                candidates = this.#applyInitial(candidates, member, branch, use);
-                if (candidates.length === 0)
-                    return false;
-            }
-            for (const endpoint of endpointConstraints) {
-                candidates = this.#applyEndpoint(candidates, endpoint);
-                if (candidates.length === 0)
-                    return false;
-            }
-        }
-        return true;
-    }
-    #universalGroupIsSatisfiable(members, endpoints, target, contract, branch) {
-        for (const member of members) {
-            if (member === target)
-                continue;
-            if (member === 'subject') {
-                if (!this.context.interfaceExtends(contract, IDENTITY_REF))
-                    return false;
-                continue;
-            }
-            const exact = this.#exactInitial(member, branch);
-            if (exact !== undefined)
-                return false;
-        }
-        return endpoints.every((accepts) => accepts.some((accept) => accept.kind === 'interface' && this.context.interfaceExtends(contract, accept)));
-    }
-    #applyInitial(candidates, term, branch, use) {
-        if (term === 'subject')
-            return this.#applyInterface(candidates, IDENTITY_REF);
-        const contract = targetContract(term, use);
-        if (contract !== undefined) {
-            if (contract.kind === 'exact')
-                return this.#applyExact(candidates, contract.ref);
-            if (contract.kind === 'default') {
-                return uniqueCandidates(this.context.allNodeClasses.flatMap((ref) => this.#applyExact(candidates, ref)));
-            }
-            return candidates;
-        }
-        const exact = this.#exactInitial(term, branch);
-        return exact === undefined ? [] : this.#applyExact(candidates, exact);
-    }
-    #exactInitial(term, branch) {
-        return branch.variables.get(term);
-    }
-    #applyExact(candidates, exact) {
-        const result = [];
-        for (const candidate of candidates) {
-            if (candidate.kind === 'exact') {
-                if (schemaRefIndex(candidate.ref) === schemaRefIndex(exact))
-                    result.push(candidate);
-            }
-            else if (candidate.requirements.every((required) => this.context.classImplements(exact, required))) {
-                result.push({ kind: 'exact', ref: exact });
-            }
-        }
-        return uniqueCandidates(result);
-    }
-    #applyInterface(candidates, required) {
-        return uniqueCandidates(candidates.flatMap((candidate) => {
-            if (candidate.kind === 'exact') {
-                return this.context.classImplements(candidate.ref, required) ? [candidate] : [];
-            }
-            return [
-                {
-                    kind: 'open',
-                    requirements: uniqueInterfaces([...candidate.requirements, required]),
-                },
-            ];
-        }));
-    }
-    #applyEndpoint(candidates, accepts) {
-        const result = [];
-        for (const candidate of candidates) {
-            if (candidate.kind === 'exact') {
-                if (this.#classSatisfiesEndpoint(candidate.ref, accepts))
-                    result.push(candidate);
-                continue;
-            }
-            for (const accept of accepts) {
-                if (accept.kind === 'interface') {
-                    result.push({
-                        kind: 'open',
-                        requirements: uniqueInterfaces([...candidate.requirements, accept]),
-                    });
-                }
-                else if (candidate.requirements.every((required) => this.context.classImplements(accept, required))) {
-                    result.push({ kind: 'exact', ref: accept });
-                }
-            }
-        }
-        return uniqueCandidates(result);
-    }
-    #classSatisfiesEndpoint(candidate, accepts) {
-        return accepts.some((accept) => (accept.kind === 'class' && schemaRefIndex(accept) === schemaRefIndex(candidate)) ||
-            (accept.kind === 'interface' && this.context.classImplements(candidate, accept)));
-    }
-}
-function targetContract(term, use) {
-    if (use.kind === 'object')
-        return term === 'object' ? use.object : undefined;
-    if (term === 'source')
-        return use.source;
-    if (term === 'target')
-        return use.target;
-    return undefined;
-}
-export function contractOfNodeDefinition(ref) {
-    return ref.kind === 'class' ? { kind: 'exact', ref } : { kind: 'universal-interface', ref };
-}
-function edgeAlternatives(edges, typing) {
-    let result = [[]];
-    for (const edge of edges) {
-        const variants = variantsForEdge(edge, typing);
-        if (variants.length === 0)
-            return [];
-        const next = [];
-        for (const prefix of result) {
-            for (const variant of variants)
-                next.push([...prefix, variant]);
-        }
-        result = next;
-    }
-    return result;
-}
-function variantsForEdge(use, typing) {
-    const edge = use.pattern;
-    const declaration = typing.context.edgeDeclaration(edge.class);
-    if (declaration === undefined)
-        return [];
-    const endpoints = declaration.orientation === 'directed'
-        ? [declaration.endpoints.source, declaration.endpoints.target]
-        : declaration.endpoints;
-    const bounds = edge.repeat ?? { min: 1, max: 1 };
-    if (!Number.isInteger(bounds.min) ||
-        !Number.isInteger(bounds.max) ||
-        bounds.min < 0 ||
-        bounds.max < bounds.min ||
-        bounds.max > MAX_REPEAT) {
-        return [];
-    }
-    const sourceKey = termKey(edge.source, use.namespace);
-    const targetKey = termKey(edge.target, use.namespace);
-    const variants = [];
-    for (let length = bounds.min; length <= bounds.max; length++) {
-        if (length === 0) {
-            variants.push({ constraints: [], equalities: [[sourceKey, targetKey]] });
-            continue;
-        }
-        const orientationCount = declaration.orientation === 'undirected' ? 2 ** length : 1;
-        for (let mask = 0; mask < orientationCount; mask++) {
-            const orientations = Array.from({ length }, (_, index) => declaration.orientation === 'undirected' && (mask & (1 << index)) !== 0);
-            let transitionsValid = true;
-            for (let index = 0; index + 1 < length; index++) {
-                const incoming = endEndpoint(endpoints, orientations[index] ?? false);
-                const outgoing = startEndpoint(endpoints, orientations[index + 1] ?? false);
-                if (!typing.endpointsOverlap(incoming.accepts, outgoing.accepts)) {
-                    transitionsValid = false;
-                    break;
-                }
-            }
-            if (!transitionsValid)
-                continue;
-            const first = startEndpoint(endpoints, orientations[0] ?? false);
-            const last = endEndpoint(endpoints, orientations[length - 1] ?? false);
-            variants.push({
-                constraints: [
-                    [sourceKey, first.accepts],
-                    [targetKey, last.accepts],
-                ],
-                equalities: [],
-            });
-        }
-    }
-    return uniqueEdgeVariants(variants);
-}
-function startEndpoint(endpoints, reversed) {
-    return reversed ? endpoints[1] : endpoints[0];
-}
-function endEndpoint(endpoints, reversed) {
-    return reversed ? endpoints[0] : endpoints[1];
-}
-function uniqueEdgeVariants(values) {
-    const result = new Map();
-    for (const value of values) {
-        const key = `${value.constraints
-            .map(([term, accepts]) => `${term}:${accepts.map(schemaRefIndex).sort().join(',')}`)
-            .join('|')}=${value.equalities.map(([left, right]) => `${left}:${right}`).join('|')}`;
-        result.set(key, value);
-    }
-    return [...result.values()];
-}
-function uniqueCandidates(values) {
-    const result = new Map();
-    for (const value of values) {
-        const key = value.kind === 'exact'
-            ? `exact:${schemaRefIndex(value.ref)}`
-            : `open:${value.requirements.map(schemaRefIndex).sort().join('|')}`;
-        result.set(key, value);
-    }
-    return [...result.values()];
-}
-function uniqueInterfaces(values) {
-    return [...new Map(values.map((value) => [schemaRefIndex(value), value])).values()];
-}
-class UnionFind {
-    #parents = new Map();
-    constructor(values) {
-        for (const value of values)
-            this.add(value);
-    }
-    add(value) {
-        if (!this.#parents.has(value))
-            this.#parents.set(value, value);
-    }
-    find(value) {
-        this.add(value);
-        const parent = this.#parents.get(value);
-        if (parent === value)
-            return value;
-        const root = this.find(parent);
-        this.#parents.set(value, root);
-        return root;
-    }
-    join(left, right) {
-        const a = this.find(left);
-        const b = this.find(right);
-        if (a !== b)
-            this.#parents.set(b, a);
-    }
-}
-//# sourceMappingURL=typing.js.map