import type { GraphFactKey, GraphFacts, GraphRuleId } from './graph-types.js'; export interface GraphPlan { readonly ruleIds: readonly GraphRuleId[]; readonly providerKeys: readonly GraphFactKey[]; } /** * Computes the deterministic transitive closure of `keys` under * `dependencies`. Top-level keys are visited in the given order (built-in * rule declaration order in practice); each key's own dependencies are * visited in stable alphabetical order as a tie-break. Repeated calls with * identical input always emit the same provider order. Exported standalone * so unknown-key and cycle rejection can be tested without the built-in * graph-rule registry. */ export declare function orderFactKeys(keys: readonly GraphFactKey[], dependencies: Readonly>): readonly GraphFactKey[]; /** * Selects built-in rules by id in registry declaration order, rejects an * unknown requested id before any document read, and unions/orders their * transitive fact dependencies. The result is a plain, frozen description; * there is no process-global or persisted plan cache. */ export declare function planGraphFacts(ruleIds: readonly string[]): GraphPlan; /** Builds the frozen, declared-keys-only fact slice one rule receives — never the full materialized bag. */ export declare function sliceGraphFacts(facts: GraphFacts, keys: readonly GraphFactKey[]): GraphFacts; //# sourceMappingURL=graph-plan.d.ts.map