@smthrs/plan 0.0.0-stage → 1.0.0-rc.13

package/dist/cjs/StepKey.js

@@ -0,0 +1,313 @@
+"use strict";
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var StepKey_exports = {};
+__export(StepKey_exports, {
+  EnvironmentIdentity: () => EnvironmentIdentity,
+  KeyMaterialError: () => KeyMaterialError,
+  content: () => content,
+  digestInput: () => digestInput,
+  dispatchIdentity: () => dispatchIdentity,
+  environmentIdentity: () => environmentIdentity,
+  fromKeyMaterial: () => fromKeyMaterial,
+  isDigestInput: () => isDigestInput,
+  makeDigestMemo: () => makeDigestMemo,
+  ordinal: () => ordinal,
+  planIdentity: () => planIdentity,
+  project: () => project
+});
+module.exports = __toCommonJS(StepKey_exports);
+var import_keys = require("@smthrs/keys");
+var Cause = __toESM(require("effect/Cause"), 1);
+var Deferred = __toESM(require("effect/Deferred"), 1);
+var Effect = __toESM(require("effect/Effect"), 1);
+var Exit = __toESM(require("effect/Exit"), 1);
+var Schema = __toESM(require("effect/Schema"), 1);
+const DigestInputTypeId = /* @__PURE__ */ Symbol.for("@smthrs/plan/StepKey/DigestInput");
+const digestInput = (digest, reference) => ({
+  [DigestInputTypeId]: DigestInputTypeId,
+  digest,
+  ...reference === void 0 ? {} : { reference: reference.reference },
+  ...reference?.path === void 0 ? {} : { path: reference.path }
+});
+const isDigestInput = (value) => typeof value === "object" && value !== null && DigestInputTypeId in value && value[DigestInputTypeId] === DigestInputTypeId;
+const EnvironmentIdentity = Schema.Union([
+  Schema.Struct({
+    declared: Schema.Literal(true),
+    layers: Schema.Array(Schema.String),
+    capabilities: Schema.Record(Schema.String, Schema.Array(Schema.String)),
+    runScope: Schema.optionalKey(Schema.Undefined)
+  }),
+  Schema.Struct({
+    declared: Schema.Literal(false),
+    layers: Schema.Array(Schema.String),
+    capabilities: Schema.Record(Schema.String, Schema.Array(Schema.String)),
+    runScope: Schema.NonEmptyString
+  })
+]);
+const makeDigestMemo = () => {
+  const entries = /* @__PURE__ */ new Map();
+  const digest = (from, path, compute) => Effect.uninterruptibleMask(
+    (restore) => Effect.suspend(() => {
+      const address = JSON.stringify([from, path]);
+      const existing = entries.get(address);
+      if (existing !== void 0) {
+        return restore(Effect.flatMap(Effect.exit(Deferred.await(existing)), (exit) => {
+          if (Exit.isSuccess(exit)) return Effect.succeed(exit.value);
+          return Cause.hasInterrupts(exit.cause) ? digest(from, path, compute) : Effect.failCause(exit.cause);
+        }));
+      }
+      const pending = Deferred.makeUnsafe();
+      entries.set(address, pending);
+      return restore(compute).pipe(
+        Effect.onExit(
+          (exit) => Effect.gen(function* () {
+            if (Exit.isFailure(exit) && entries.get(address) === pending) {
+              entries.delete(address);
+            }
+            yield* Deferred.done(pending, exit);
+          })
+        )
+      );
+    })
+  );
+  return { digest };
+};
+class KeyMaterialError extends Schema.TaggedError()("@smthrs/plan/KeyMaterialError", {
+  code: Schema.Literals(["invalid_environment", "missing_dependency", "non_content_material"]),
+  message: Schema.String
+}) {
+}
+const validateEnvironment = (environment) => {
+  const candidate = environment;
+  if (candidate.declared === false) {
+    if (typeof candidate.runScope !== "string" || candidate.runScope.length === 0) {
+      return new KeyMaterialError({
+        code: "invalid_environment",
+        message: "Undeclared environment identity requires a non-empty runScope"
+      });
+    }
+    return void 0;
+  }
+  if (candidate.declared === true) {
+    return candidate.runScope === void 0 ? void 0 : new KeyMaterialError({
+      code: "invalid_environment",
+      message: "Declared environment identity must not include runScope"
+    });
+  }
+  return new KeyMaterialError({
+    code: "invalid_environment",
+    message: "Environment identity requires a boolean declared field"
+  });
+};
+const decodeEnvironment = (environment) => Effect.try({
+  try: () => {
+    const invalid = validateEnvironment(environment);
+    if (invalid !== void 0) throw invalid;
+    return Schema.decodeUnknownSync(EnvironmentIdentity)(environment, { onExcessProperty: "error" });
+  },
+  catch: (cause) => cause instanceof KeyMaterialError ? cause : new KeyMaterialError({
+    code: "invalid_environment",
+    message: "Environment identity must contain only its declared fields, string layers, and string capability patterns"
+  })
+});
+const sortStrings = (values) => [...new Set(values.map((value) => value.normalize("NFC")))].sort();
+const normalizeInputs = (inputs) => Object.fromEntries(
+  Object.entries(inputs).map(([name, value]) => [
+    name,
+    isDigestInput(value) ? {
+      kind: "digest",
+      digest: value.digest,
+      ...value.reference === void 0 ? {} : { reference: value.reference },
+      ...value.path === void 0 ? {} : { path: value.path }
+    } : { kind: "literal", value }
+  ])
+);
+const normalizeCapabilities = (capabilities) => Object.fromEntries(Object.entries(capabilities).map(([group, patterns]) => [group, sortStrings(patterns)]));
+const normalizeEnvironment = (environment) => ({
+  declared: environment.declared,
+  layers: environment.layers.map((layer) => layer.normalize("NFC")),
+  capabilities: normalizeCapabilities(environment.capabilities),
+  ...environment.runScope === void 0 ? {} : { runScope: environment.runScope }
+});
+const compareCodeUnits = (left, right) => left < right ? -1 : 1;
+const writeEntryKey = (entry) => typeof entry === "string" ? JSON.stringify(["Path", entry]) : entry._tag === "TreeArtifact" ? JSON.stringify([entry._tag, entry.path]) : JSON.stringify([entry._tag, entry.include, entry.exclude ?? null]);
+const normalizeHermetic = (hermetic) => {
+  const readSet = [...hermetic.readSet].map((entry) => ({ path: entry.path.normalize("NFC"), digest: entry.digest })).sort((left, right) => {
+    if (left.path !== right.path) return left.path < right.path ? -1 : 1;
+    return left.digest < right.digest ? -1 : left.digest > right.digest ? 1 : 0;
+  }).filter(
+    (entry, index, entries) => index === 0 || entry.path !== entries[index - 1].path || entry.digest !== entries[index - 1].digest
+  );
+  const normalizedWrites = [...hermetic.writeSet].map((entry) => {
+    if (typeof entry === "string") return entry.normalize("NFC");
+    if (entry._tag === "TreeArtifact") return { ...entry, path: entry.path.normalize("NFC") };
+    return {
+      ...entry,
+      include: sortStrings(entry.include),
+      ...entry.exclude === void 0 ? {} : { exclude: sortStrings(entry.exclude) }
+    };
+  });
+  const writeSet = [...new Map(normalizedWrites.map((entry) => [writeEntryKey(entry), entry])).entries()].sort(([left], [right]) => compareCodeUnits(left, right)).map(([, entry]) => entry);
+  return {
+    readSet,
+    writeSet,
+    ...hermetic.removes === void 0 ? {} : { removes: sortStrings(hermetic.removes) },
+    boundaryMode: hermetic.boundaryMode
+  };
+};
+const decodeKey = Schema.decodeUnknownEffect(import_keys.DerivedKey);
+const environmentIdentity = (environment) => Effect.gen(function* () {
+  const captured = environment === void 0 ? void 0 : yield* decodeEnvironment(environment);
+  return yield* decodeKey({
+    kind: "execution-environment/v1",
+    environment: captured === void 0 ? null : normalizeEnvironment(captured)
+  });
+});
+const content = (identity) => Effect.gen(function* () {
+  const environment = identity.environment === void 0 ? void 0 : yield* decodeEnvironment(identity.environment);
+  return yield* decodeKey({
+    kind: "content",
+    body: identity.body,
+    inputs: normalizeInputs(identity.inputs),
+    layers: sortStrings(identity.layers),
+    capabilities: normalizeCapabilities(identity.capabilities),
+    ...environment === void 0 ? {} : { environment: normalizeEnvironment(environment) },
+    ...identity.hermetic === void 0 ? {} : { hermetic: normalizeHermetic(identity.hermetic) }
+  });
+});
+const ordinal = (identity) => decodeKey({ kind: "ordinal", ...identity });
+const fromKeyMaterial = (material, dependencyDigests) => {
+  if (material.kind !== "sealed") {
+    return Effect.fail(
+      new KeyMaterialError({
+        code: "non_content_material",
+        message: `Cannot create a content key for ${material.kind} material`
+      })
+    );
+  }
+  return materialIdentity(material, dependencyDigests).pipe(Effect.flatMap(content));
+};
+const planIdentity = (material, dependencyDigests) => material.kind === "sealed" ? fromKeyMaterial(material, dependencyDigests) : materialIdentity(material, dependencyDigests).pipe(Effect.flatMap(
+  (identity) => decodeKey({
+    kind: "plan-declaration",
+    tier: material.kind,
+    body: identity.body,
+    inputs: normalizeInputs(identity.inputs),
+    layers: sortStrings(identity.layers),
+    capabilities: normalizeCapabilities(identity.capabilities)
+  })
+));
+const ownDataProperty = (record, from, label) => {
+  const descriptor = Object.getOwnPropertyDescriptor(record, from);
+  if (descriptor === void 0) {
+    return Effect.fail(
+      new KeyMaterialError({
+        code: "missing_dependency",
+        message: `Missing ${label.toLowerCase()} for graph dependency ${from}`
+      })
+    );
+  }
+  if (!("value" in descriptor)) {
+    return Effect.fail(
+      new KeyMaterialError({
+        code: "missing_dependency",
+        message: `${label} for graph dependency ${from} must be a data property`
+      })
+    );
+  }
+  return Effect.succeed(descriptor.value);
+};
+const resolveInputs = (material, resolve) => Effect.gen(function* () {
+  const inputs = {};
+  for (let index = 0; index < material.inputs.length; index++) {
+    const input = material.inputs[index];
+    if (input._tag === "Literal") {
+      inputs[String(index)] = input.value;
+      continue;
+    }
+    const digest = yield* resolve(input);
+    inputs[String(index)] = input._tag === "Pending" ? digestInput(digest, { reference: "pending" }) : input.path.length > 0 ? digestInput(digest, { reference: "ref-projected", path: input.path }) : digestInput(digest, { reference: "ref" });
+  }
+  return inputs;
+});
+const materialIdentity = (material, dependencyDigests) => resolveInputs(
+  material,
+  (reference) => Effect.flatMap(ownDataProperty(dependencyDigests, reference.from, "Digest"), (digest) => typeof digest === "string" ? Effect.succeed(digest) : Effect.fail(
+    new KeyMaterialError({
+      code: "missing_dependency",
+      message: `Digest for graph dependency ${reference.from} must be a string`
+    })
+  ))
+).pipe(Effect.map((inputs) => ({
+  body: materialBody(material),
+  inputs,
+  layers: material.layers,
+  capabilities: { declared: material.capabilities }
+})));
+const materialBody = (material) => ({
+  version: material.version,
+  declaration: material.body,
+  ...material.nondeterministic === void 0 ? {} : { nondeterministic: material.nondeterministic },
+  ...material.effects === void 0 ? {} : { effects: material.effects },
+  ...material.placement === void 0 ? {} : { placement: material.placement }
+});
+const orderingOnly = "ordering-only";
+const project = (value, path) => {
+  let current = value;
+  for (const segment of path) {
+    if (typeof current !== "object" || current === null) return void 0;
+    const descriptor = Object.getOwnPropertyDescriptor(current, segment);
+    if (descriptor === void 0 || !("value" in descriptor)) return void 0;
+    current = descriptor.value;
+  }
+  return current;
+};
+const dispatchIdentity = (options) => Effect.gen(function* () {
+  const material = options.material;
+  if (material.kind !== "sealed") {
+    return yield* new KeyMaterialError({
+      code: "non_content_material",
+      message: `Cannot create a dispatch key for ${material.kind} material`
+    });
+  }
+  const environment = options.environment === void 0 ? void 0 : yield* decodeEnvironment(options.environment);
+  const inputs = yield* resolveInputs(material, (reference) => reference._tag === "Pending" ? Effect.succeed(orderingOnly) : Effect.flatMap(ownDataProperty(options.results, reference.from, "Settled result"), (settled) => {
+    const compute = decodeKey({ kind: "input-value", value: project(settled, reference.path) });
+    return options.digestMemo === void 0 ? compute : options.digestMemo.digest(reference.from, reference.path, compute);
+  }));
+  return yield* content({
+    body: materialBody(material),
+    inputs,
+    layers: material.layers,
+    capabilities: { declared: material.capabilities },
+    environment,
+    hermetic: options.hermetic
+  });
+});
+//# sourceMappingURL=StepKey.js.map

package/dist/cjs/StepKey.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/StepKey.ts"],
+  "sourcesContent": ["/**\n * The KeyMaterial \u2192 step-key compiler.\n *\n * Revived from the deleted `packages/smithers/flows/keys/src/StepKey.ts`. Two\n * deliberate deviations from the original:\n *\n * 1. **It lives here, not in `@smthrs/keys`.** That package owns generic\n *    derivation and stored-key validation; a compiler that understands plan\n *    material belongs above it.\n * 2. **It produces `@smthrs/keys` `StoredKey` values, not a second `sk1_` digest\n *    format.** The original minted its own prefix over a private `Digest`\n *    module. The engine dispatches under `StoredKey` (`FlowEngine/ActionKey.ts`),\n *    so a plan whose node keys were a *different* string format could never be\n *    the thing the cache is consulted against, and that is the whole point of\n *    a `Plan`. One key format, one hashing\n *    chokepoint (canonical JSON + injected `Crypto`), one namespace field\n *    (`kind`) distinguishing content keys from ordinal ones.\n *\n * Everything the original earned is kept: nominally branded digest inputs (a\n * literal that merely *looks* like `{digest}` hashes as a literal), set\n * normalization, the separate environment namespace, per-variant tagging of\n * resolved references, and the hashed `version`.\n *\n * Governing contract: the step-key rules at\n * https://github.com/smithersai/smithers/blob/main/packages/smithers/flows/plan/docs/concepts/step-keys.md.\n *\n * @since 0.1.0\n */\n\nimport { DerivedKey, type StoredKey } from \"@smthrs/keys\"\nimport * as Cause from \"effect/Cause\"\nimport type * as Crypto from \"effect/Crypto\"\nimport * as Deferred from \"effect/Deferred\"\nimport * as Effect from \"effect/Effect\"\nimport * as Exit from \"effect/Exit\"\nimport * as Schema from \"effect/Schema\"\nimport type * as FileSet from \"./FileSet.ts\"\nimport type * as KeyMaterial from \"./KeyMaterial.ts\"\n\n/**\n * A computed step key. Identical in representation to any other flow key \u2014\n * `key1_` plus a SHA-256 digest of the canonical serialization of the material.\n *\n * @since 0.1.0\n * @category models\n */\nexport type StepKey = StoredKey\n\n/**\n * The nominal brand carried by every {@link DigestInput}. Kept private: the\n * only way to produce a value bearing it is {@link digestInput}, so a plain\n * value that merely happens to look like `{ digest: \"...\" }` \u2014 actions pass\n * content hashes around as ordinary data \u2014 can never be mistaken for a genuine\n * upstream-result digest reference. This closes a step-key collision where\n * shape-sniffing (`\"digest\" in value`) hashed the two identically.\n *\n * @since 0.1.0\n * @category symbols\n */\nconst DigestInputTypeId: unique symbol = Symbol.for(\"@smthrs/plan/StepKey/DigestInput\")\n\n/**\n * Which kind of graph reference a {@link DigestInput} stands for. Declared\n * once here so the field on `DigestInput` and the parameter of\n * {@link digestInput} name one set and cannot drift apart.\n */\ntype GraphReference = \"ref\" | \"pending\" | \"ref-projected\"\n\n/**\n * A precomputed digest supplied as a step input rather than a literal value.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface DigestInput {\n  readonly [DigestInputTypeId]: typeof DigestInputTypeId\n  readonly digest: string\n  /**\n   * Which kind of graph reference resolved to this digest.\n   *\n   * Carrying the discriminator on the digest input keeps `normalizeInputs` the\n   * single normalizer: it wraps every variant once, and the variants stay\n   * mutually distinct because they differ in this field rather than in a\n   * hand-built object a second wrap would hide.\n   */\n  readonly reference?: GraphReference\n  /** The projection applied to the referenced result, for `ref-projected`. */\n  readonly path?: ReadonlyArray<string>\n}\n\n/**\n * Nominally tags a precomputed digest so it is hashed as a digest reference\n * rather than a literal value.\n *\n * @param digest - The precomputed digest.\n * @param reference - Which graph reference resolved to the digest, and the\n *   projection path for `ref-projected`. Omit for a plain digest.\n * @returns The tagged digest input.\n * @since 0.1.0\n * @category constructors\n */\nexport const digestInput = (\n  digest: string,\n  reference?: {\n    readonly reference: GraphReference\n    readonly path?: ReadonlyArray<string>\n  }\n): DigestInput => ({\n  [DigestInputTypeId]: DigestInputTypeId,\n  digest,\n  ...(reference === undefined ? {} : { reference: reference.reference }),\n  ...(reference?.path === undefined ? {} : { path: reference.path })\n})\n\n/**\n * Type guard for values produced by {@link digestInput}. A plain object\n * shaped like `{ digest: \"...\" }` is not one.\n *\n * @param value - Any value.\n * @returns `true` only for a value carrying the private digest-input brand.\n * @since 0.1.0\n * @category guards\n */\nexport const isDigestInput = (value: unknown): value is DigestInput =>\n  typeof value === \"object\" && value !== null && DigestInputTypeId in value &&\n  (value as Record<PropertyKey, unknown>)[DigestInputTypeId] === DigestInputTypeId\n\n/**\n * The engine-resolved execution environment a content key is computed under,\n * hashed in its OWN namespace rather than merged into the caller's `layers`\n * and `capabilities`.\n *\n * Three properties matter and none survives a merge:\n *\n * 1. **Non-aliasing.** Concatenating environment material onto the caller's\n *    made `caller{fs:[\"a\"]} + env{fs:[\"b\"]}` hash identically to\n *    `caller{fs:[\"a\",\"b\"]} + env{}` \u2014 a cross-run collision in the very\n *    material whose purpose is preventing one.\n * 2. **Declared vs undeclared.** `declared: false` is not the same value as\n *    `declared: true` with empty sets.\n * 3. **Composition order.** Environment layers retain declaration order,\n *    because plugin and service composition order can change behavior. The\n *    caller-owned `ContentIdentity.layers` stays set-normalized.\n *\n * `runScope` is set only when `declared` is `false`: it pins the key to one\n * run, so a step whose environment identity is unknown can never serve a\n * cross-run hit. The union enforces this for typed callers; both\n * {@link content} and {@link dispatchIdentity} validate it at run time.\n *\n * @since 0.1.0\n * @category models\n */\nexport type EnvironmentIdentity = typeof EnvironmentIdentity.Type\n\n/**\n * Validated, copyable runtime environment identity. Layer order matters;\n * capability patterns are set-like. Unknown fields are not identity material.\n * @since 1.0.0\n * @category schemas\n */\nexport const EnvironmentIdentity = Schema.Union([\n  Schema.Struct({\n    declared: Schema.Literal(true),\n    layers: Schema.Array(Schema.String),\n    capabilities: Schema.Record(Schema.String, Schema.Array(Schema.String)),\n    runScope: Schema.optionalKey(Schema.Undefined)\n  }),\n  Schema.Struct({\n    declared: Schema.Literal(false),\n    layers: Schema.Array(Schema.String),\n    capabilities: Schema.Record(Schema.String, Schema.Array(Schema.String)),\n    runScope: Schema.NonEmptyString\n  })\n])\n\n/**\n * Caller-owned memoization context for projected dependency-value digests.\n *\n * This is the flows counterpart of Bazel's `ActionKeyContext`: one context is\n * passed through related key computations so shared input material is hashed\n * once. Concurrent requests for the same projection share the in-flight\n * digest. Entries are sound only while each settled `from` value is immutable;\n * callers must create a fresh memo when those values can change.\n *\n * `digest(from, path, compute)` runs `compute` once per address and shares its\n * result with concurrent callers. A failed or interrupted computation is not\n * kept: the next caller recomputes, and a waiter whose leader was interrupted\n * becomes the new leader instead of inheriting the interrupt.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface DigestMemo {\n  readonly digest: (\n    from: string,\n    path: ReadonlyArray<string>,\n    compute: Effect.Effect<StepKey, Schema.SchemaError, Crypto.Crypto>\n  ) => Effect.Effect<StepKey, Schema.SchemaError, Crypto.Crypto>\n}\n\n/**\n * Creates an empty projected-value digest memo. Projection addresses are\n * JSON-encoded `[from, path]` tuples so segment boundaries are unambiguous.\n *\n * @returns A memo with no entries.\n * @since 0.1.0\n * @category constructors\n */\nexport const makeDigestMemo = (): DigestMemo => {\n  const entries = new Map<string, Deferred.Deferred<StepKey, Schema.SchemaError>>()\n  // Registering the entry and installing its exit handler run uninterruptibly,\n  // so an interrupt can never land between them and strand a Deferred that no\n  // fiber will complete. The wait and the computation stay interruptible.\n  const digest: DigestMemo[\"digest\"] = (from, path, compute) =>\n    Effect.uninterruptibleMask((restore) =>\n      Effect.suspend(() => {\n        const address = JSON.stringify([from, path])\n        const existing = entries.get(address)\n        if (existing !== undefined) {\n          return restore(Effect.flatMap(Effect.exit(Deferred.await(existing)), (exit) => {\n            if (Exit.isSuccess(exit)) return Effect.succeed(exit.value)\n            // A waiter did not request the leader's cancellation. It competes to\n            // become the replacement leader instead of inheriting that interrupt.\n            return Cause.hasInterrupts(exit.cause) ? digest(from, path, compute) : Effect.failCause(exit.cause)\n          }))\n        }\n        const pending = Deferred.makeUnsafe<StepKey, Schema.SchemaError>()\n        entries.set(address, pending)\n        return restore(compute).pipe(\n          Effect.onExit((exit) =>\n            Effect.gen(function*() {\n              if (Exit.isFailure(exit) && entries.get(address) === pending) {\n                entries.delete(address)\n              }\n              yield* Deferred.done(pending, exit)\n            })\n          )\n        )\n      })\n    )\n  return { digest }\n}\n\n/**\n * Material describing a sealed or hermetic content-addressed step.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface ContentIdentity {\n  readonly body: unknown\n  readonly inputs: Readonly<Record<string, unknown | DigestInput>>\n  readonly layers: ReadonlyArray<string>\n  readonly capabilities: Readonly<Record<string, ReadonlyArray<string>>>\n  readonly environment?: EnvironmentIdentity | undefined\n  readonly hermetic?: {\n    readonly readSet: ReadonlyArray<{ readonly path: string; readonly digest: string }>\n    readonly writeSet: ReadonlyArray<FileSet.Entry>\n    readonly removes?: ReadonlyArray<string> | undefined\n    readonly boundaryMode: FileSet.BoundaryMode\n  } | undefined\n}\n\n/**\n * Material describing the run-local identity of a non-cacheable step.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface OrdinalIdentity {\n  readonly runId: string\n  readonly parentScope?: string | undefined\n  readonly ordinal: number\n  readonly tier: \"compensable\" | \"irreversible\" | \"unsealed\"\n}\n\n/**\n * Stable failures while deriving a key. `code` names the rule:\n *\n * - `invalid_environment`: an {@link EnvironmentIdentity} that is neither\n *   declared nor run-scoped.\n * - `missing_dependency`: a `Ref` or `Pending` input names a node with no\n *   recorded digest, or, at dispatch, a `Ref` names one with no settled\n *   result.\n * - `non_content_material`: a content-key constructor received material whose\n *   tier is not `sealed`.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class KeyMaterialError extends Schema.TaggedError<KeyMaterialError>()(\"@smthrs/plan/KeyMaterialError\", {\n  code: Schema.Literals([\"invalid_environment\", \"missing_dependency\", \"non_content_material\"]),\n  message: Schema.String\n}) {}\n\nconst validateEnvironment = (environment: EnvironmentIdentity): KeyMaterialError | undefined => {\n  const candidate = environment as { readonly declared?: unknown; readonly runScope?: unknown }\n  if (candidate.declared === false) {\n    if (typeof candidate.runScope !== \"string\" || candidate.runScope.length === 0) {\n      return new KeyMaterialError({\n        code: \"invalid_environment\",\n        message: \"Undeclared environment identity requires a non-empty runScope\"\n      })\n    }\n    return undefined\n  }\n  if (candidate.declared === true) {\n    return candidate.runScope === undefined\n      ? undefined\n      : new KeyMaterialError({\n        code: \"invalid_environment\",\n        message: \"Declared environment identity must not include runScope\"\n      })\n  }\n  return new KeyMaterialError({\n    code: \"invalid_environment\",\n    message: \"Environment identity requires a boolean declared field\"\n  })\n}\n\nconst decodeEnvironment = (environment: EnvironmentIdentity) =>\n  Effect.try({\n    try: () => {\n      const invalid = validateEnvironment(environment)\n      if (invalid !== undefined) throw invalid\n      return Schema.decodeUnknownSync(EnvironmentIdentity)(environment, { onExcessProperty: \"error\" })\n    },\n    catch: (cause) =>\n      cause instanceof KeyMaterialError ? cause : new KeyMaterialError({\n        code: \"invalid_environment\",\n        message:\n          \"Environment identity must contain only its declared fields, string layers, and string capability patterns\"\n      })\n  })\n\nconst sortStrings = (values: ReadonlyArray<string>): Array<string> =>\n  [...new Set(values.map((value) => value.normalize(\"NFC\")))].sort()\n\nconst normalizeInputs = (inputs: ContentIdentity[\"inputs\"]): Record<string, unknown> =>\n  Object.fromEntries(\n    Object.entries(inputs).map(([name, value]) => [\n      name,\n      isDigestInput(value)\n        ? {\n          kind: \"digest\",\n          digest: value.digest,\n          ...(value.reference === undefined ? {} : { reference: value.reference }),\n          ...(value.path === undefined ? {} : { path: value.path })\n        }\n        : { kind: \"literal\", value }\n    ])\n  )\n\nconst normalizeCapabilities = (capabilities: ContentIdentity[\"capabilities\"]): Record<string, Array<string>> =>\n  Object.fromEntries(Object.entries(capabilities).map(([group, patterns]) => [group, sortStrings(patterns)]))\n\nconst normalizeEnvironment = (environment: EnvironmentIdentity) => ({\n  declared: environment.declared,\n  layers: environment.layers.map((layer) => layer.normalize(\"NFC\")),\n  capabilities: normalizeCapabilities(environment.capabilities),\n  ...(environment.runScope === undefined ? {} : { runScope: environment.runScope })\n})\n\nconst compareCodeUnits = (left: string, right: string): number => left < right ? -1 : 1\n\ntype NormalizedWriteEntry =\n  | string\n  | { readonly _tag: \"TreeArtifact\"; readonly path: string }\n  | {\n    readonly _tag: \"Glob\"\n    readonly include: ReadonlyArray<string>\n    readonly exclude?: ReadonlyArray<string> | undefined\n  }\n\nconst writeEntryKey = (entry: NormalizedWriteEntry): string =>\n  typeof entry === \"string\"\n    ? JSON.stringify([\"Path\", entry])\n    : entry._tag === \"TreeArtifact\"\n    ? JSON.stringify([entry._tag, entry.path])\n    : JSON.stringify([entry._tag, entry.include, entry.exclude ?? null])\n\nconst normalizeHermetic = (hermetic: NonNullable<ContentIdentity[\"hermetic\"]>) => {\n  const readSet = [...hermetic.readSet]\n    .map((entry) => ({ path: entry.path.normalize(\"NFC\"), digest: entry.digest }))\n    .sort((left, right) => {\n      if (left.path !== right.path) return left.path < right.path ? -1 : 1\n      return left.digest < right.digest ? -1 : left.digest > right.digest ? 1 : 0\n    })\n    .filter((entry, index, entries) =>\n      index === 0 || entry.path !== entries[index - 1]!.path || entry.digest !== entries[index - 1]!.digest\n    )\n  const normalizedWrites = [...hermetic.writeSet].map((entry) => {\n    if (typeof entry === \"string\") return entry.normalize(\"NFC\")\n    if (entry._tag === \"TreeArtifact\") return { ...entry, path: entry.path.normalize(\"NFC\") }\n    return {\n      ...entry,\n      include: sortStrings(entry.include),\n      ...(entry.exclude === undefined ? {} : { exclude: sortStrings(entry.exclude) })\n    }\n  })\n  const writeSet = [...new Map(normalizedWrites.map((entry) => [writeEntryKey(entry), entry])).entries()]\n    .sort(([left], [right]) => compareCodeUnits(left, right))\n    .map(([, entry]) => entry)\n  return {\n    readSet,\n    writeSet,\n    ...(hermetic.removes === undefined ? {} : { removes: sortStrings(hermetic.removes) }),\n    boundaryMode: hermetic.boundaryMode\n  }\n}\n\nconst decodeKey = Schema.decodeUnknownEffect(DerivedKey)\n\n/**\n * Fingerprint for binding one execution to its runtime environment, not an\n * action dispatch key. Uses the same normalization as content/dispatch keys.\n * An omitted environment is distinct from declared-empty and run-scoped ones.\n * @since 1.0.0\n * @category constructors\n */\nexport const environmentIdentity = (\n  environment?: EnvironmentIdentity\n): Effect.Effect<StoredKey, KeyMaterialError | Schema.SchemaError, Crypto.Crypto> =>\n  Effect.gen(function*() {\n    const captured = environment === undefined ? undefined : yield* decodeEnvironment(environment)\n    return yield* decodeKey({\n      kind: \"execution-environment/v1\",\n      environment: captured === undefined ? null : normalizeEnvironment(captured)\n    })\n  })\n\n/**\n * Produces a cross-run reusable key for a sealed or hermetic step. Set-like\n * declarations are normalized before serialization; write declarations remain\n * part of the identity even when the step writes nothing.\n *\n * @param identity - The step's content material.\n * @returns The content key. Fails with `invalid_environment` for a malformed\n * environment, or `SchemaError` when the material cannot be serialized.\n * @since 0.1.0\n * @category constructors\n */\nexport const content = (\n  identity: ContentIdentity\n): Effect.Effect<StepKey, KeyMaterialError | Schema.SchemaError, Crypto.Crypto> =>\n  Effect.gen(function*() {\n    const environment = identity.environment === undefined ? undefined : yield* decodeEnvironment(identity.environment)\n    return yield* decodeKey({\n      kind: \"content\",\n      body: identity.body,\n      inputs: normalizeInputs(identity.inputs),\n      layers: sortStrings(identity.layers),\n      capabilities: normalizeCapabilities(identity.capabilities),\n      ...(environment === undefined ? {} : { environment: normalizeEnvironment(environment) }),\n      ...(identity.hermetic === undefined ? {} : { hermetic: normalizeHermetic(identity.hermetic) })\n    })\n  })\n\n/**\n * Produces a run-local ordinal key for compensable, irreversible, or unsealed\n * work. These keys intentionally cannot be reused across runs.\n *\n * @param identity - The run id, optional parent scope, ordinal, and tier.\n * @returns The ordinal key.\n * @since 0.1.0\n * @category constructors\n */\nexport const ordinal = (\n  identity: OrdinalIdentity\n): Effect.Effect<StepKey, Schema.SchemaError, Crypto.Crypto> => decodeKey({ kind: \"ordinal\", ...identity })\n\n/**\n * Resolves graph-local references to dependency digests and constructs a\n * sealed content key. Use {@link planIdentity} to compile any effect tier.\n *\n * This is the handoff the Flow Builder Brief describes: the planner hands over\n * a topologically ordered sequence of `{ nodeId, material }`, and for each one\n * the compiler substitutes every `Ref`/`Pending` with the *already computed\n * key of the referenced node*. Structural node ids are lookup addresses only\n * and never enter the hashed value \u2014 rename a node and nothing re-keys; change\n * what a node consumes and everything downstream of it does.\n *\n * @param material - The node's key material; its tier must be `sealed`.\n * @param dependencyDigests - The key of every node the material references,\n *   by node id.\n * @returns The content key. Fails with `non_content_material` for a\n * non-sealed tier and `missing_dependency` for an unresolved reference.\n * @since 0.1.0\n * @category constructors\n */\nexport const fromKeyMaterial = (\n  material: KeyMaterial.KeyMaterial,\n  dependencyDigests: Readonly<Record<string, string>>\n): Effect.Effect<StepKey, KeyMaterialError | Schema.SchemaError, Crypto.Crypto> => {\n  if (material.kind !== \"sealed\") {\n    return Effect.fail(\n      new KeyMaterialError({\n        code: \"non_content_material\",\n        message: `Cannot create a content key for ${material.kind} material`\n      })\n    )\n  }\n  return materialIdentity(material, dependencyDigests).pipe(Effect.flatMap(content))\n}\n\n/**\n * Identifies a declaration in a plan, independently of whether its execution\n * can be cached. Sealed material retains its existing content-key format;\n * compensable and irreversible material use a distinct, tier-bearing plan\n * namespace. These fingerprints bind approvals, not cross-run result reuse.\n * Dispatch non-cacheable work under a run-local {@link ordinal} instead.\n *\n * @since 1.0.0\n * @category constructors\n */\nexport const planIdentity = (\n  material: KeyMaterial.KeyMaterial,\n  dependencyDigests: Readonly<Record<string, string>>\n): Effect.Effect<StepKey, KeyMaterialError | Schema.SchemaError, Crypto.Crypto> =>\n  material.kind === \"sealed\" ?\n    fromKeyMaterial(material, dependencyDigests) :\n    materialIdentity(material, dependencyDigests).pipe(Effect.flatMap((identity) =>\n      decodeKey({\n        kind: \"plan-declaration\",\n        tier: material.kind,\n        body: identity.body,\n        inputs: normalizeInputs(identity.inputs),\n        layers: sortStrings(identity.layers),\n        capabilities: normalizeCapabilities(identity.capabilities)\n      })\n    ))\n\n/**\n * Reads the entry a graph reference names. Only an own data property counts:\n * an absent name or an accessor is a missing dependency, and no getter runs.\n * `label` names what the record holds, as each refusal says it.\n *\n * @private\n */\nconst ownDataProperty = (\n  record: Readonly<Record<string, unknown>>,\n  from: string,\n  label: \"Digest\" | \"Settled result\"\n): Effect.Effect<unknown, KeyMaterialError> => {\n  const descriptor = Object.getOwnPropertyDescriptor(record, from)\n  if (descriptor === undefined) {\n    return Effect.fail(\n      new KeyMaterialError({\n        code: \"missing_dependency\",\n        message: `Missing ${label.toLowerCase()} for graph dependency ${from}`\n      })\n    )\n  }\n  if (!(\"value\" in descriptor)) {\n    return Effect.fail(\n      new KeyMaterialError({\n        code: \"missing_dependency\",\n        message: `${label} for graph dependency ${from} must be a data property`\n      })\n    )\n  }\n  return Effect.succeed(descriptor.value)\n}\n\n/**\n * The positional inputs both identities hash. A `Literal` contributes its raw\n * value, so `normalizeInputs` applies the one literal wrap; `resolve` supplies\n * the digest for each `Ref` and `Pending`, tagged with the reference variant.\n *\n * @private\n */\nconst resolveInputs = <E, R>(\n  material: KeyMaterial.KeyMaterial,\n  resolve: (reference: Exclude<KeyMaterial.InputRef, { readonly _tag: \"Literal\" }>) => Effect.Effect<string, E, R>\n): Effect.Effect<Record<string, unknown>, E, R> =>\n  Effect.gen(function*() {\n    const inputs: Record<string, unknown> = {}\n    for (let index = 0; index < material.inputs.length; index++) {\n      const input = material.inputs[index]!\n      if (input._tag === \"Literal\") {\n        inputs[String(index)] = input.value\n        continue\n      }\n      const digest = yield* resolve(input)\n      inputs[String(index)] = input._tag === \"Pending\"\n        ? digestInput(digest, { reference: \"pending\" })\n        : input.path.length > 0\n        ? digestInput(digest, { reference: \"ref-projected\", path: input.path })\n        : digestInput(digest, { reference: \"ref\" })\n    }\n    return inputs\n  })\n\n/** Resolves plan references once for both content and non-cacheable declarations. */\nconst materialIdentity = (\n  material: KeyMaterial.KeyMaterial,\n  dependencyDigests: Readonly<Record<string, string>>\n): Effect.Effect<ContentIdentity, KeyMaterialError> =>\n  resolveInputs(\n    material,\n    (reference) =>\n      Effect.flatMap(ownDataProperty(dependencyDigests, reference.from, \"Digest\"), (digest) =>\n        typeof digest === \"string\" ? Effect.succeed(digest) : Effect.fail(\n          new KeyMaterialError({\n            code: \"missing_dependency\",\n            message: `Digest for graph dependency ${reference.from} must be a string`\n          })\n        ))\n  ).pipe(Effect.map((inputs) => ({\n    body: materialBody(material),\n    inputs,\n    layers: material.layers,\n    capabilities: { declared: material.capabilities }\n  })))\n\n/**\n * The node's own declaration, hashed. Shared by {@link planIdentity},\n * {@link fromKeyMaterial}, and {@link dispatchIdentity} so derivations cannot drift about what\n * \"the node itself\" means.\n *\n * @private\n */\nconst materialBody = (material: KeyMaterial.KeyMaterial) => ({\n  version: material.version,\n  declaration: material.body,\n  ...(material.nondeterministic === undefined ? {} : { nondeterministic: material.nondeterministic }),\n  ...(material.effects === undefined ? {} : { effects: material.effects }),\n  ...(material.placement === undefined ? {} : { placement: material.placement })\n})\n\n/**\n * The digest a `Pending` input contributes to a dispatch key. It is a\n * constant, and that is the point: `Pending` is an ordering reference, and\n * ordering does not change what a node consumes, so it must not change what\n * the node caches under. The string is self-describing, so a reader of a\n * hashed payload can see that no upstream value was folded.\n *\n * @private\n */\nconst orderingOnly = \"ordering-only\"\n\n/**\n * Projects a settled result along a `Ref` path. Only own data properties\n * resolve, so a missing, inherited, or accessor segment yields `undefined`\n * without invoking a getter. This is a stable, distinct value: a projection that\n * walks off the end of a result is a fact about the graph, not a failure.\n * `undefined` drops out of the canonical form, so it hashes distinctly from\n * every JSON value including `null`.\n *\n * Exported because it is the ONE projection semantics for the value channel:\n * {@link dispatchIdentity} digests what this returns, so every consumer that\n * resolves a `Ref` at execution time must resolve it the same way, or two\n * inputs that key identically could be consumed differently \u2014 a stale-hit\n * vector.\n *\n * @since 0.1.0\n * @category utilities\n */\nexport const project = (value: unknown, path: ReadonlyArray<string>): unknown => {\n  let current = value\n  for (const segment of path) {\n    if (typeof current !== \"object\" || current === null) return undefined\n    const descriptor = Object.getOwnPropertyDescriptor(current, segment)\n    if (descriptor === undefined || !(\"value\" in descriptor)) return undefined\n    current = descriptor.value\n  }\n  return current\n}\n\n/**\n * The key a dispatch is *cached* under, as distinct from the plan key a node\n * is *identified* by.\n *\n * A plan key folds the resolved keys of every upstream node, transitively, so\n * an edit anywhere upstream re-keys everything below it \u2014 even when the edited\n * node's output value is byte for byte what it was before. Bazel does not work\n * that way: `ActionCacheChecker` keys an action by the *content* of its\n * inputs, so an unchanged output stops invalidation dead. The file channel in\n * flows already had that property through the measured boundary digests; the\n * JSON value channel did not, and this is what gives it one.\n *\n * The derivation folds the node's OWN material \u2014 body, version, effects,\n * placement, layers, capabilities \u2014 and never an upstream key. Each material\n * input contributes content instead: a `Literal` its value, a `Ref` the digest\n * of the settled result of `from` projected along `path`, and a `Pending`\n * nothing beyond its tag. The measured hermetic boundary is folded unchanged.\n *\n * `results` must hold every dependency the material names. The scheduler's\n * halt rule guarantees it: a dependent of failed or skipped work never\n * dispatches, so a `Ref` always resolves against a success.\n *\n * @param options - The material, the dependencies' settled results, the\n *   measured hermetic boundary, and an optional environment and memo.\n * @returns The dispatch key. Fails with `non_content_material` for a\n * non-sealed tier, `missing_dependency` for a `Ref` absent from `results`,\n * or `invalid_environment` for a malformed environment.\n * @since 0.1.0\n * @category constructors\n */\nexport const dispatchIdentity = (options: {\n  readonly material: KeyMaterial.KeyMaterial\n  /** The settled output value of each dependency, by node id. */\n  readonly results: Readonly<Record<string, unknown>>\n  readonly hermetic: NonNullable<ContentIdentity[\"hermetic\"]>\n  /** The engine-resolved execution environment this dispatch runs under. */\n  readonly environment?: EnvironmentIdentity | undefined\n  /** Reuses projected-value digests while the corresponding settled values remain immutable. */\n  readonly digestMemo?: DigestMemo | undefined\n}): Effect.Effect<StepKey, KeyMaterialError | Schema.SchemaError, Crypto.Crypto> =>\n  Effect.gen(function*() {\n    const material = options.material\n    if (material.kind !== \"sealed\") {\n      return yield* new KeyMaterialError({\n        code: \"non_content_material\",\n        message: `Cannot create a dispatch key for ${material.kind} material`\n      })\n    }\n    const environment = options.environment === undefined ? undefined : yield* decodeEnvironment(options.environment)\n    const inputs = yield* resolveInputs(material, (reference) =>\n      reference._tag === \"Pending\"\n        ? Effect.succeed(orderingOnly)\n        : Effect.flatMap(ownDataProperty(options.results, reference.from, \"Settled result\"), (settled) => {\n          const compute = decodeKey({ kind: \"input-value\", value: project(settled, reference.path) })\n          return options.digestMemo === undefined\n            ? compute\n            : options.digestMemo.digest(reference.from, reference.path, compute)\n        }))\n    return yield* content({\n      body: materialBody(material),\n      inputs,\n      layers: material.layers,\n      capabilities: { declared: material.capabilities },\n      environment,\n      hermetic: options.hermetic\n    })\n  })\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA6BA,kBAA2C;AAC3C,YAAuB;AAEvB,eAA0B;AAC1B,aAAwB;AACxB,WAAsB;AACtB,aAAwB;AAwBxB,MAAM,oBAAmC,uBAAO,IAAI,kCAAkC;AA0C/E,MAAM,cAAc,CACzB,QACA,eAIiB;AAAA,EACjB,CAAC,iBAAiB,GAAG;AAAA,EACrB;AAAA,EACA,GAAI,cAAc,SAAY,CAAC,IAAI,EAAE,WAAW,UAAU,UAAU;AAAA,EACpE,GAAI,WAAW,SAAS,SAAY,CAAC,IAAI,EAAE,MAAM,UAAU,KAAK;AAClE;AAWO,MAAM,gBAAgB,CAAC,UAC5B,OAAO,UAAU,YAAY,UAAU,QAAQ,qBAAqB,SACnE,MAAuC,iBAAiB,MAAM;AAmC1D,MAAM,sBAAsB,OAAO,MAAM;AAAA,EAC9C,OAAO,OAAO;AAAA,IACZ,UAAU,OAAO,QAAQ,IAAI;AAAA,IAC7B,QAAQ,OAAO,MAAM,OAAO,MAAM;AAAA,IAClC,cAAc,OAAO,OAAO,OAAO,QAAQ,OAAO,MAAM,OAAO,MAAM,CAAC;AAAA,IACtE,UAAU,OAAO,YAAY,OAAO,SAAS;AAAA,EAC/C,CAAC;AAAA,EACD,OAAO,OAAO;AAAA,IACZ,UAAU,OAAO,QAAQ,KAAK;AAAA,IAC9B,QAAQ,OAAO,MAAM,OAAO,MAAM;AAAA,IAClC,cAAc,OAAO,OAAO,OAAO,QAAQ,OAAO,MAAM,OAAO,MAAM,CAAC;AAAA,IACtE,UAAU,OAAO;AAAA,EACnB,CAAC;AACH,CAAC;AAmCM,MAAM,iBAAiB,MAAkB;AAC9C,QAAM,UAAU,oBAAI,IAA4D;AAIhF,QAAM,SAA+B,CAAC,MAAM,MAAM,YAChD,OAAO;AAAA,IAAoB,CAAC,YAC1B,OAAO,QAAQ,MAAM;AACnB,YAAM,UAAU,KAAK,UAAU,CAAC,MAAM,IAAI,CAAC;AAC3C,YAAM,WAAW,QAAQ,IAAI,OAAO;AACpC,UAAI,aAAa,QAAW;AAC1B,eAAO,QAAQ,OAAO,QAAQ,OAAO,KAAK,SAAS,MAAM,QAAQ,CAAC,GAAG,CAAC,SAAS;AAC7E,cAAI,KAAK,UAAU,IAAI,EAAG,QAAO,OAAO,QAAQ,KAAK,KAAK;AAG1D,iBAAO,MAAM,cAAc,KAAK,KAAK,IAAI,OAAO,MAAM,MAAM,OAAO,IAAI,OAAO,UAAU,KAAK,KAAK;AAAA,QACpG,CAAC,CAAC;AAAA,MACJ;AACA,YAAM,UAAU,SAAS,WAAwC;AACjE,cAAQ,IAAI,SAAS,OAAO;AAC5B,aAAO,QAAQ,OAAO,EAAE;AAAA,QACtB,OAAO;AAAA,UAAO,CAAC,SACb,OAAO,IAAI,aAAY;AACrB,gBAAI,KAAK,UAAU,IAAI,KAAK,QAAQ,IAAI,OAAO,MAAM,SAAS;AAC5D,sBAAQ,OAAO,OAAO;AAAA,YACxB;AACA,mBAAO,SAAS,KAAK,SAAS,IAAI;AAAA,UACpC,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AACF,SAAO,EAAE,OAAO;AAClB;AAiDO,MAAM,yBAAyB,OAAO,YAA8B,EAAE,iCAAiC;AAAA,EAC5G,MAAM,OAAO,SAAS,CAAC,uBAAuB,sBAAsB,sBAAsB,CAAC;AAAA,EAC3F,SAAS,OAAO;AAClB,CAAC,EAAE;AAAC;AAEJ,MAAM,sBAAsB,CAAC,gBAAmE;AAC9F,QAAM,YAAY;AAClB,MAAI,UAAU,aAAa,OAAO;AAChC,QAAI,OAAO,UAAU,aAAa,YAAY,UAAU,SAAS,WAAW,GAAG;AAC7E,aAAO,IAAI,iBAAiB;AAAA,QAC1B,MAAM;AAAA,QACN,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AACA,MAAI,UAAU,aAAa,MAAM;AAC/B,WAAO,UAAU,aAAa,SAC1B,SACA,IAAI,iBAAiB;AAAA,MACrB,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACL;AACA,SAAO,IAAI,iBAAiB;AAAA,IAC1B,MAAM;AAAA,IACN,SAAS;AAAA,EACX,CAAC;AACH;AAEA,MAAM,oBAAoB,CAAC,gBACzB,OAAO,IAAI;AAAA,EACT,KAAK,MAAM;AACT,UAAM,UAAU,oBAAoB,WAAW;AAC/C,QAAI,YAAY,OAAW,OAAM;AACjC,WAAO,OAAO,kBAAkB,mBAAmB,EAAE,aAAa,EAAE,kBAAkB,QAAQ,CAAC;AAAA,EACjG;AAAA,EACA,OAAO,CAAC,UACN,iBAAiB,mBAAmB,QAAQ,IAAI,iBAAiB;AAAA,IAC/D,MAAM;AAAA,IACN,SACE;AAAA,EACJ,CAAC;AACL,CAAC;AAEH,MAAM,cAAc,CAAC,WACnB,CAAC,GAAG,IAAI,IAAI,OAAO,IAAI,CAAC,UAAU,MAAM,UAAU,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK;AAEnE,MAAM,kBAAkB,CAAC,WACvB,OAAO;AAAA,EACL,OAAO,QAAQ,MAAM,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;AAAA,IAC5C;AAAA,IACA,cAAc,KAAK,IACf;AAAA,MACA,MAAM;AAAA,MACN,QAAQ,MAAM;AAAA,MACd,GAAI,MAAM,cAAc,SAAY,CAAC,IAAI,EAAE,WAAW,MAAM,UAAU;AAAA,MACtE,GAAI,MAAM,SAAS,SAAY,CAAC,IAAI,EAAE,MAAM,MAAM,KAAK;AAAA,IACzD,IACE,EAAE,MAAM,WAAW,MAAM;AAAA,EAC/B,CAAC;AACH;AAEF,MAAM,wBAAwB,CAAC,iBAC7B,OAAO,YAAY,OAAO,QAAQ,YAAY,EAAE,IAAI,CAAC,CAAC,OAAO,QAAQ,MAAM,CAAC,OAAO,YAAY,QAAQ,CAAC,CAAC,CAAC;AAE5G,MAAM,uBAAuB,CAAC,iBAAsC;AAAA,EAClE,UAAU,YAAY;AAAA,EACtB,QAAQ,YAAY,OAAO,IAAI,CAAC,UAAU,MAAM,UAAU,KAAK,CAAC;AAAA,EAChE,cAAc,sBAAsB,YAAY,YAAY;AAAA,EAC5D,GAAI,YAAY,aAAa,SAAY,CAAC,IAAI,EAAE,UAAU,YAAY,SAAS;AACjF;AAEA,MAAM,mBAAmB,CAAC,MAAc,UAA0B,OAAO,QAAQ,KAAK;AAWtF,MAAM,gBAAgB,CAAC,UACrB,OAAO,UAAU,WACb,KAAK,UAAU,CAAC,QAAQ,KAAK,CAAC,IAC9B,MAAM,SAAS,iBACf,KAAK,UAAU,CAAC,MAAM,MAAM,MAAM,IAAI,CAAC,IACvC,KAAK,UAAU,CAAC,MAAM,MAAM,MAAM,SAAS,MAAM,WAAW,IAAI,CAAC;AAEvE,MAAM,oBAAoB,CAAC,aAAuD;AAChF,QAAM,UAAU,CAAC,GAAG,SAAS,OAAO,EACjC,IAAI,CAAC,WAAW,EAAE,MAAM,MAAM,KAAK,UAAU,KAAK,GAAG,QAAQ,MAAM,OAAO,EAAE,EAC5E,KAAK,CAAC,MAAM,UAAU;AACrB,QAAI,KAAK,SAAS,MAAM,KAAM,QAAO,KAAK,OAAO,MAAM,OAAO,KAAK;AACnE,WAAO,KAAK,SAAS,MAAM,SAAS,KAAK,KAAK,SAAS,MAAM,SAAS,IAAI;AAAA,EAC5E,CAAC,EACA;AAAA,IAAO,CAAC,OAAO,OAAO,YACrB,UAAU,KAAK,MAAM,SAAS,QAAQ,QAAQ,CAAC,EAAG,QAAQ,MAAM,WAAW,QAAQ,QAAQ,CAAC,EAAG;AAAA,EACjG;AACF,QAAM,mBAAmB,CAAC,GAAG,SAAS,QAAQ,EAAE,IAAI,CAAC,UAAU;AAC7D,QAAI,OAAO,UAAU,SAAU,QAAO,MAAM,UAAU,KAAK;AAC3D,QAAI,MAAM,SAAS,eAAgB,QAAO,EAAE,GAAG,OAAO,MAAM,MAAM,KAAK,UAAU,KAAK,EAAE;AACxF,WAAO;AAAA,MACL,GAAG;AAAA,MACH,SAAS,YAAY,MAAM,OAAO;AAAA,MAClC,GAAI,MAAM,YAAY,SAAY,CAAC,IAAI,EAAE,SAAS,YAAY,MAAM,OAAO,EAAE;AAAA,IAC/E;AAAA,EACF,CAAC;AACD,QAAM,WAAW,CAAC,GAAG,IAAI,IAAI,iBAAiB,IAAI,CAAC,UAAU,CAAC,cAAc,KAAK,GAAG,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,EACnG,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MAAM,iBAAiB,MAAM,KAAK,CAAC,EACvD,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,KAAK;AAC3B,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,GAAI,SAAS,YAAY,SAAY,CAAC,IAAI,EAAE,SAAS,YAAY,SAAS,OAAO,EAAE;AAAA,IACnF,cAAc,SAAS;AAAA,EACzB;AACF;AAEA,MAAM,YAAY,OAAO,oBAAoB,sBAAU;AAShD,MAAM,sBAAsB,CACjC,gBAEA,OAAO,IAAI,aAAY;AACrB,QAAM,WAAW,gBAAgB,SAAY,SAAY,OAAO,kBAAkB,WAAW;AAC7F,SAAO,OAAO,UAAU;AAAA,IACtB,MAAM;AAAA,IACN,aAAa,aAAa,SAAY,OAAO,qBAAqB,QAAQ;AAAA,EAC5E,CAAC;AACH,CAAC;AAaI,MAAM,UAAU,CACrB,aAEA,OAAO,IAAI,aAAY;AACrB,QAAM,cAAc,SAAS,gBAAgB,SAAY,SAAY,OAAO,kBAAkB,SAAS,WAAW;AAClH,SAAO,OAAO,UAAU;AAAA,IACtB,MAAM;AAAA,IACN,MAAM,SAAS;AAAA,IACf,QAAQ,gBAAgB,SAAS,MAAM;AAAA,IACvC,QAAQ,YAAY,SAAS,MAAM;AAAA,IACnC,cAAc,sBAAsB,SAAS,YAAY;AAAA,IACzD,GAAI,gBAAgB,SAAY,CAAC,IAAI,EAAE,aAAa,qBAAqB,WAAW,EAAE;AAAA,IACtF,GAAI,SAAS,aAAa,SAAY,CAAC,IAAI,EAAE,UAAU,kBAAkB,SAAS,QAAQ,EAAE;AAAA,EAC9F,CAAC;AACH,CAAC;AAWI,MAAM,UAAU,CACrB,aAC8D,UAAU,EAAE,MAAM,WAAW,GAAG,SAAS,CAAC;AAqBnG,MAAM,kBAAkB,CAC7B,UACA,sBACiF;AACjF,MAAI,SAAS,SAAS,UAAU;AAC9B,WAAO,OAAO;AAAA,MACZ,IAAI,iBAAiB;AAAA,QACnB,MAAM;AAAA,QACN,SAAS,mCAAmC,SAAS,IAAI;AAAA,MAC3D,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO,iBAAiB,UAAU,iBAAiB,EAAE,KAAK,OAAO,QAAQ,OAAO,CAAC;AACnF;AAYO,MAAM,eAAe,CAC1B,UACA,sBAEA,SAAS,SAAS,WAChB,gBAAgB,UAAU,iBAAiB,IAC3C,iBAAiB,UAAU,iBAAiB,EAAE,KAAK,OAAO;AAAA,EAAQ,CAAC,aACjE,UAAU;AAAA,IACR,MAAM;AAAA,IACN,MAAM,SAAS;AAAA,IACf,MAAM,SAAS;AAAA,IACf,QAAQ,gBAAgB,SAAS,MAAM;AAAA,IACvC,QAAQ,YAAY,SAAS,MAAM;AAAA,IACnC,cAAc,sBAAsB,SAAS,YAAY;AAAA,EAC3D,CAAC;AACH,CAAC;AASL,MAAM,kBAAkB,CACtB,QACA,MACA,UAC6C;AAC7C,QAAM,aAAa,OAAO,yBAAyB,QAAQ,IAAI;AAC/D,MAAI,eAAe,QAAW;AAC5B,WAAO,OAAO;AAAA,MACZ,IAAI,iBAAiB;AAAA,QACnB,MAAM;AAAA,QACN,SAAS,WAAW,MAAM,YAAY,CAAC,yBAAyB,IAAI;AAAA,MACtE,CAAC;AAAA,IACH;AAAA,EACF;AACA,MAAI,EAAE,WAAW,aAAa;AAC5B,WAAO,OAAO;AAAA,MACZ,IAAI,iBAAiB;AAAA,QACnB,MAAM;AAAA,QACN,SAAS,GAAG,KAAK,yBAAyB,IAAI;AAAA,MAChD,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO,OAAO,QAAQ,WAAW,KAAK;AACxC;AASA,MAAM,gBAAgB,CACpB,UACA,YAEA,OAAO,IAAI,aAAY;AACrB,QAAM,SAAkC,CAAC;AACzC,WAAS,QAAQ,GAAG,QAAQ,SAAS,OAAO,QAAQ,SAAS;AAC3D,UAAM,QAAQ,SAAS,OAAO,KAAK;AACnC,QAAI,MAAM,SAAS,WAAW;AAC5B,aAAO,OAAO,KAAK,CAAC,IAAI,MAAM;AAC9B;AAAA,IACF;AACA,UAAM,SAAS,OAAO,QAAQ,KAAK;AACnC,WAAO,OAAO,KAAK,CAAC,IAAI,MAAM,SAAS,YACnC,YAAY,QAAQ,EAAE,WAAW,UAAU,CAAC,IAC5C,MAAM,KAAK,SAAS,IACpB,YAAY,QAAQ,EAAE,WAAW,iBAAiB,MAAM,MAAM,KAAK,CAAC,IACpE,YAAY,QAAQ,EAAE,WAAW,MAAM,CAAC;AAAA,EAC9C;AACA,SAAO;AACT,CAAC;AAGH,MAAM,mBAAmB,CACvB,UACA,sBAEA;AAAA,EACE;AAAA,EACA,CAAC,cACC,OAAO,QAAQ,gBAAgB,mBAAmB,UAAU,MAAM,QAAQ,GAAG,CAAC,WAC5E,OAAO,WAAW,WAAW,OAAO,QAAQ,MAAM,IAAI,OAAO;AAAA,IAC3D,IAAI,iBAAiB;AAAA,MACnB,MAAM;AAAA,MACN,SAAS,+BAA+B,UAAU,IAAI;AAAA,IACxD,CAAC;AAAA,EACH,CAAC;AACP,EAAE,KAAK,OAAO,IAAI,CAAC,YAAY;AAAA,EAC7B,MAAM,aAAa,QAAQ;AAAA,EAC3B;AAAA,EACA,QAAQ,SAAS;AAAA,EACjB,cAAc,EAAE,UAAU,SAAS,aAAa;AAClD,EAAE,CAAC;AASL,MAAM,eAAe,CAAC,cAAuC;AAAA,EAC3D,SAAS,SAAS;AAAA,EAClB,aAAa,SAAS;AAAA,EACtB,GAAI,SAAS,qBAAqB,SAAY,CAAC,IAAI,EAAE,kBAAkB,SAAS,iBAAiB;AAAA,EACjG,GAAI,SAAS,YAAY,SAAY,CAAC,IAAI,EAAE,SAAS,SAAS,QAAQ;AAAA,EACtE,GAAI,SAAS,cAAc,SAAY,CAAC,IAAI,EAAE,WAAW,SAAS,UAAU;AAC9E;AAWA,MAAM,eAAe;AAmBd,MAAM,UAAU,CAAC,OAAgB,SAAyC;AAC/E,MAAI,UAAU;AACd,aAAW,WAAW,MAAM;AAC1B,QAAI,OAAO,YAAY,YAAY,YAAY,KAAM,QAAO;AAC5D,UAAM,aAAa,OAAO,yBAAyB,SAAS,OAAO;AACnE,QAAI,eAAe,UAAa,EAAE,WAAW,YAAa,QAAO;AACjE,cAAU,WAAW;AAAA,EACvB;AACA,SAAO;AACT;AAgCO,MAAM,mBAAmB,CAAC,YAU/B,OAAO,IAAI,aAAY;AACrB,QAAM,WAAW,QAAQ;AACzB,MAAI,SAAS,SAAS,UAAU;AAC9B,WAAO,OAAO,IAAI,iBAAiB;AAAA,MACjC,MAAM;AAAA,MACN,SAAS,oCAAoC,SAAS,IAAI;AAAA,IAC5D,CAAC;AAAA,EACH;AACA,QAAM,cAAc,QAAQ,gBAAgB,SAAY,SAAY,OAAO,kBAAkB,QAAQ,WAAW;AAChH,QAAM,SAAS,OAAO,cAAc,UAAU,CAAC,cAC7C,UAAU,SAAS,YACf,OAAO,QAAQ,YAAY,IAC3B,OAAO,QAAQ,gBAAgB,QAAQ,SAAS,UAAU,MAAM,gBAAgB,GAAG,CAAC,YAAY;AAChG,UAAM,UAAU,UAAU,EAAE,MAAM,eAAe,OAAO,QAAQ,SAAS,UAAU,IAAI,EAAE,CAAC;AAC1F,WAAO,QAAQ,eAAe,SAC1B,UACA,QAAQ,WAAW,OAAO,UAAU,MAAM,UAAU,MAAM,OAAO;AAAA,EACvE,CAAC,CAAC;AACN,SAAO,OAAO,QAAQ;AAAA,IACpB,MAAM,aAAa,QAAQ;AAAA,IAC3B;AAAA,IACA,QAAQ,SAAS;AAAA,IACjB,cAAc,EAAE,UAAU,SAAS,aAAa;AAAA,IAChD;AAAA,IACA,UAAU,QAAQ;AAAA,EACpB,CAAC;AACH,CAAC;",
+  "names": []
+}

package/dist/cjs/index.d.ts

@@ -0,0 +1,91 @@
+/**
+ * The plan value: a keyed action graph, its diff, and the step-key compiler
+ * that gives every node its identity.
+ *
+ * A plan is a `Node` graph with every key computed, produced by the plan phase
+ * and inert until run. This package is that value and nothing more: it
+ * performs no I/O at all and never executes anything. Persisting a plan is
+ * `@smthrs/plan-store`; driving one is `@smthrs/engine-store`'s
+ * `PlanScheduler`.
+ *
+ * Above the persisted form sits the authoring AST: `Node` describes a plan as
+ * pure data, and `Planned` is the placeholder a body sees where a step result
+ * will be. Both build plans; neither runs one.
+ *
+ * @since 0.1.0
+ */
+/**
+ * @since 0.1.0
+ * @category errors
+ * @slop
+ */
+export * as GraphBuildError from "./GraphBuildError.ts";
+/**
+ * @since 1.0.0-rc.0
+ * @category models
+ */
+export * as CachePolicy from "./CachePolicy.ts";
+/**
+ * @since 1.0.0-rc.0
+ * @category models
+ */
+export * as Repetition from "./Repetition.ts";
+/**
+ * @since 0.1.0
+ * @category models
+ * @slop
+ */
+export * as KeyMaterial from "./KeyMaterial.ts";
+/**
+ * @since 0.1.0
+ * @category models
+ * @slop
+ */
+export * as FileSet from "./FileSet.ts";
+/**
+ * @since 0.1.0
+ * @category models
+ * @slop
+ */
+export * as Effects from "./Effects.ts";
+/**
+ * @since 0.1.0
+ * @category models
+ * @slop
+ */
+export * as Node from "./Node.ts";
+/**
+ * @since 0.1.0
+ * @category models
+ * @slop
+ */
+export * as Plan from "./Plan.ts";
+/**
+ * @since 0.1.0
+ * @category constructors
+ * @slop
+ */
+export * as PlanDiff from "./PlanDiff.ts";
+/**
+ * @since 1.0.0
+ * @category models
+ */
+export * as Placement from "./Placement.ts";
+/**
+ * @since 0.1.0
+ * @category models
+ * @slop
+ */
+export * as Planned from "./Planned.ts";
+/**
+ * @since 0.1.0
+ * @category constructors
+ * @slop
+ */
+export * as StepKey from "./StepKey.ts";
+/**
+ * @since 1.0.0
+ * @category constructors
+ */
+export * as Scheduling from "./Scheduling.ts";
+//# sourceMappingURL=index.d.ts.map

package/dist/cjs/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH;;;;GAIG;AACH,OAAO,KAAK,eAAe,MAAM,sBAAsB,CAAA;AAEvD;;;GAGG;AACH,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAA;AAE/C;;;GAGG;AACH,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAA;AAE7C;;;;GAIG;AACH,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAA;AAE/C;;;;GAIG;AACH,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AAEvC;;;;GAIG;AACH,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AAEvC;;;;GAIG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC;;;;GAIG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC;;;;GAIG;AACH,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;GAGG;AACH,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAE3C;;;;GAIG;AACH,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AAEvC;;;;GAIG;AACH,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AAEvC;;;GAGG;AACH,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAA"}

package/dist/cjs/index.js

@@ -0,0 +1,59 @@
+"use strict";
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var index_exports = {};
+__export(index_exports, {
+  CachePolicy: () => CachePolicy,
+  Effects: () => Effects,
+  FileSet: () => FileSet,
+  GraphBuildError: () => GraphBuildError,
+  KeyMaterial: () => KeyMaterial,
+  Node: () => Node,
+  Placement: () => Placement,
+  Plan: () => Plan,
+  PlanDiff: () => PlanDiff,
+  Planned: () => Planned,
+  Repetition: () => Repetition,
+  Scheduling: () => Scheduling,
+  StepKey: () => StepKey
+});
+module.exports = __toCommonJS(index_exports);
+var GraphBuildError = __toESM(require("./GraphBuildError.js"), 1);
+var CachePolicy = __toESM(require("./CachePolicy.js"), 1);
+var Repetition = __toESM(require("./Repetition.js"), 1);
+var KeyMaterial = __toESM(require("./KeyMaterial.js"), 1);
+var FileSet = __toESM(require("./FileSet.js"), 1);
+var Effects = __toESM(require("./Effects.js"), 1);
+var Node = __toESM(require("./Node.js"), 1);
+var Plan = __toESM(require("./Plan.js"), 1);
+var PlanDiff = __toESM(require("./PlanDiff.js"), 1);
+var Placement = __toESM(require("./Placement.js"), 1);
+var Planned = __toESM(require("./Planned.js"), 1);
+var StepKey = __toESM(require("./StepKey.js"), 1);
+var Scheduling = __toESM(require("./Scheduling.js"), 1);
+//# sourceMappingURL=index.js.map

package/dist/cjs/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/index.ts"],
+  "sourcesContent": ["/**\n * The plan value: a keyed action graph, its diff, and the step-key compiler\n * that gives every node its identity.\n *\n * A plan is a `Node` graph with every key computed, produced by the plan phase\n * and inert until run. This package is that value and nothing more: it\n * performs no I/O at all and never executes anything. Persisting a plan is\n * `@smthrs/plan-store`; driving one is `@smthrs/engine-store`'s\n * `PlanScheduler`.\n *\n * Above the persisted form sits the authoring AST: `Node` describes a plan as\n * pure data, and `Planned` is the placeholder a body sees where a step result\n * will be. Both build plans; neither runs one.\n *\n * @since 0.1.0\n */\n\n/**\n * @since 0.1.0\n * @category errors\n * @slop\n */\nexport * as GraphBuildError from \"./GraphBuildError.ts\"\n\n/**\n * @since 1.0.0-rc.0\n * @category models\n */\nexport * as CachePolicy from \"./CachePolicy.ts\"\n\n/**\n * @since 1.0.0-rc.0\n * @category models\n */\nexport * as Repetition from \"./Repetition.ts\"\n\n/**\n * @since 0.1.0\n * @category models\n * @slop\n */\nexport * as KeyMaterial from \"./KeyMaterial.ts\"\n\n/**\n * @since 0.1.0\n * @category models\n * @slop\n */\nexport * as FileSet from \"./FileSet.ts\"\n\n/**\n * @since 0.1.0\n * @category models\n * @slop\n */\nexport * as Effects from \"./Effects.ts\"\n\n/**\n * @since 0.1.0\n * @category models\n * @slop\n */\nexport * as Node from \"./Node.ts\"\n\n/**\n * @since 0.1.0\n * @category models\n * @slop\n */\nexport * as Plan from \"./Plan.ts\"\n\n/**\n * @since 0.1.0\n * @category constructors\n * @slop\n */\nexport * as PlanDiff from \"./PlanDiff.ts\"\n\n/**\n * @since 1.0.0\n * @category models\n */\nexport * as Placement from \"./Placement.ts\"\n\n/**\n * @since 0.1.0\n * @category models\n * @slop\n */\nexport * as Planned from \"./Planned.ts\"\n\n/**\n * @since 0.1.0\n * @category constructors\n * @slop\n */\nexport * as StepKey from \"./StepKey.ts\"\n\n/**\n * @since 1.0.0\n * @category constructors\n */\nexport * as Scheduling from \"./Scheduling.ts\"\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAsBA,sBAAiC;AAMjC,kBAA6B;AAM7B,iBAA4B;AAO5B,kBAA6B;AAO7B,cAAyB;AAOzB,cAAyB;AAOzB,WAAsB;AAOtB,WAAsB;AAOtB,eAA0B;AAM1B,gBAA2B;AAO3B,cAAyB;AAOzB,cAAyB;AAMzB,iBAA4B;",
+  "names": []
+}

package/dist/cjs/internal/ConflictAnnotation.d.ts

@@ -0,0 +1,59 @@
+/**
+ * The compiler's effect analysis: which writers conflict, and which readers
+ * must wait for a producer. Its vocabulary is pairs of declared effects; it
+ * never re-keys a node, because ordering is not key material.
+ *
+ * @since 0.1.0
+ * @private
+ */
+import * as Effect from "effect/Effect";
+import type * as Plan from "../Plan.ts";
+/**
+ * What {@link annotate} found, by node id and in discovery order: the conflict
+ * annotations a node carries and the ordering edges it gains. A frozen node
+ * never appears, because its row is never rewritten.
+ *
+ * @private
+ */
+interface Annotations {
+    readonly conflicts: ReadonlyMap<string, ReadonlyArray<Plan.ConflictAnnotation>>;
+    readonly ordering: ReadonlyMap<string, ReadonlyArray<string>>;
+}
+/**
+ * A graph the analysis refuses, in the fields a `PlanError` carries.
+ *
+ * @private
+ */
+interface Refusal {
+    readonly code: "cycle" | "graph_too_large" | "overlap_forbidden";
+    readonly message: string;
+}
+/**
+ * Two passes over the graph.
+ *
+ * The first detects write overlaps and annotates the conflicting pair, adding
+ * the ordering edge a `serialize` verdict implies. Nodes already ordered by a
+ * dependency path are not conflicts.
+ *
+ * The second adds reader-after-writer edges: a node that reads a path another
+ * node writes is ordered behind its producer. That pair is not a conflict,
+ * because nothing needs annotating and no strategy applies. It is a missing
+ * edge, so only `dependsOn` grows. When the graph already orders the producer
+ * behind its reader by explicit material dependencies, the reader consumes
+ * the earlier version. An opposing inferred ordering still fails with `cycle`.
+ *
+ * Nodes are visited in plan order, so a `serialize` edge always points from
+ * the earlier declaration to the later one and can never close a cycle. The
+ * first `frozen` nodes were recorded by an earlier generation: append-only
+ * means their rows are never rewritten, so a pair discovered during
+ * elaboration is annotated on the NEW node only — which is also the node the
+ * ordering edge lands on, and the annotation names the other side either way.
+ * `replayGenerations` re-derives a recorded plan one generation at a time
+ * under that same rule.
+ *
+ * @since 0.1.0
+ * @private
+ */
+export declare const annotate: (nodes: ReadonlyArray<Plan.PlanNode>, frozen: number, replayGenerations: boolean) => Effect.Effect<Annotations, Refusal>;
+export {};
+//# sourceMappingURL=ConflictAnnotation.d.ts.map

package/dist/cjs/internal/ConflictAnnotation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ConflictAnnotation.d.ts","sourceRoot":"","sources":["../../../src/internal/ConflictAnnotation.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AAGvC,OAAO,KAAK,KAAK,IAAI,MAAM,YAAY,CAAA;AAGvC;;;;;;GAMG;AACH,UAAU,WAAW;IACnB,QAAQ,CAAC,SAAS,EAAE,WAAW,CAAC,MAAM,EAAE,aAAa,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAA;IAC/E,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAA;CAC9D;AAED;;;;GAIG;AACH,UAAU,OAAO;IACf,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,iBAAiB,GAAG,mBAAmB,CAAA;IAChE,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;CACzB;AAoED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,eAAO,MAAM,QAAQ,GACnB,OAAO,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,EACnC,QAAQ,MAAM,EACd,mBAAmB,OAAO,KACzB,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAgPjC,CAAA"}