@lokascript/planner 2.4.0

package/dist/index.d.ts

@@ -0,0 +1,205 @@
+/**
+ * Type definitions for the BFS planner.
+ *
+ * These are the subset of Siren/GRAIL types that the planner depends on.
+ * Standalone — no external dependencies.
+ */
+interface SirenEntity {
+    class?: string[];
+    properties?: Record<string, unknown>;
+    actions?: SirenAction[];
+    links?: SirenLink[];
+    entities?: SirenSubEntity[];
+}
+interface SirenAction {
+    name: string;
+    title?: string;
+    method?: string;
+    href: string;
+    type?: string;
+    fields?: SirenField[];
+    /** Cooperative affordance: preconditions that must be met */
+    preconditions?: string[];
+    /** Cooperative affordance: effects of this action */
+    effects?: string[];
+    /** Cooperative affordance: relative effort weight for planning */
+    cost?: number;
+}
+interface SirenField {
+    name: string;
+    type?: string;
+    value?: unknown;
+    title?: string;
+    description?: string;
+    options?: unknown[];
+    required?: boolean;
+    min?: number;
+    max?: number;
+    step?: number;
+    minlength?: number;
+    maxlength?: number;
+    pattern?: string;
+}
+interface SirenLink {
+    rel: string[];
+    href: string;
+    title?: string;
+}
+interface SirenSubEntity {
+    class?: string[];
+    rel?: string[];
+    href?: string;
+    properties?: Record<string, unknown>;
+}
+/**
+ * The properties block in a GRAIL 409 Blocked response body.
+ */
+interface BlockedProperties {
+    status: 409;
+    message: string;
+    blockedAction: string;
+    blockedCondition: string;
+    unmetConditions?: string[];
+}
+/**
+ * A 409 Conflict response body from a GRAIL server.
+ * Contains the blocked action info and offered affordances.
+ */
+interface BlockedResponse {
+    class: string[];
+    properties: BlockedProperties;
+    actions?: SirenAction[];
+    /** Active conditions on this entity (also sent as x-conditions header) */
+    'x-conditions'?: string[];
+}
+/** Entry in a condition map from the /conditions endpoint */
+interface ConditionMapEntry {
+    description?: string;
+    producedBy: string[];
+    requiredBy: string[];
+}
+
+/**
+ * BFS planner over the affordance graph.
+ *
+ * Port of siren-grail/packages/siren-agent/planner.js to TypeScript,
+ * extended with cost-aware path selection, preferred tiebreaker (GRAIL spec §5.4),
+ * and a buildDefsFromActions() path for client-side planning without a condition map.
+ *
+ * Pure module — no DOM, no fetch, no side effects.
+ */
+
+interface PlanStep {
+    readonly name: string;
+    readonly params: Readonly<Record<string, string>>;
+    key(): string;
+    label(): string;
+}
+interface AffordanceDef {
+    readonly name: string;
+    readonly preconditions: readonly string[];
+    readonly effects: readonly string[];
+    readonly templateEffect: string | null;
+    readonly paramName: string | null;
+    readonly validValues: readonly string[];
+    readonly cost: number;
+    readonly preferred: boolean;
+}
+interface PlanResult {
+    /** Ordered steps to reach the goal (empty if already satisfied) */
+    steps: PlanStep[];
+    /** Total cost of all steps */
+    totalCost: number;
+    /** Number of alternative equal-length paths found */
+    alternativeCount: number;
+}
+interface PlanOptions {
+    maxDepth?: number;
+    maxQueueSize?: number;
+    blockedSteps?: PlanStep[];
+}
+interface HeuristicMapping {
+    property: string;
+    op: string;
+    value: string | number;
+}
+declare function createPlanStep(name: string, params?: Record<string, string>): PlanStep;
+declare function createAffordanceDef(opts: {
+    name: string;
+    preconditions: string[];
+    effects: string[];
+    templateEffect?: string | null;
+    paramName?: string | null;
+    validValues?: string[];
+    cost?: number;
+    preferred?: boolean;
+}): AffordanceDef;
+/**
+ * Forward simulation: apply affordance effects, return new state.
+ * Handles template effect resolution and mutex prefix clearing.
+ */
+declare function applyEffects(state: Set<string>, affDef: AffordanceDef, params: Record<string, string>, mutexPrefixes: Set<string>): Set<string>;
+/**
+ * Infer heuristic condition mappings from condition name structure.
+ *
+ * - "x.y.z" (3 segments): property=y, op=eq, value=z
+ * - "x.y.z" where z="nonempty": property=yCount (singular), op=gt, value=0
+ * - "x.y" (2 segments): derived from action-presence
+ */
+declare function inferHeuristicMappings(conditionNames: Set<string>): Record<string, HeuristicMapping>;
+/**
+ * Infer active conditions from a Siren entity.
+ * Prefers server-provided x-conditions when available.
+ */
+declare function inferConditions(entity: {
+    properties?: Record<string, unknown>;
+    actions?: unknown[];
+    'x-conditions'?: string[];
+}, conditionNames: Set<string>, mappings?: Record<string, HeuristicMapping>): Set<string>;
+/**
+ * Parse a condition map (from /conditions endpoint) into AffordanceDef objects.
+ * Input shape: { conditionName: { description, producedBy: string[], requiredBy: string[] } }
+ */
+declare function parseConditionMap(conditionMap: Record<string, ConditionMapEntry>): {
+    defs: AffordanceDef[];
+    conditionNames: Set<string>;
+    mutexPrefixes: Set<string>;
+};
+/**
+ * Build AffordanceDefs directly from SirenAction[].
+ * This is the "simple path" — no condition map or server endpoint required.
+ * Reads preconditions, effects, and cost from each action.
+ */
+declare function buildDefsFromActions(actions: SirenAction[]): {
+    defs: AffordanceDef[];
+    conditionNames: Set<string>;
+    mutexPrefixes: Set<string>;
+};
+/**
+ * BFS: find ALL shortest action sequences from start state to goal condition.
+ */
+declare function plan(start: Set<string>, goalCondition: string, defs: AffordanceDef[], mutexPrefixes: Set<string>, opts?: PlanOptions): PlanStep[][];
+/**
+ * Find the lowest-cost shortest path.
+ * Among equal-cost paths, prefer ones with more preferred steps (spec §5.4).
+ */
+declare function planWithCost(start: Set<string>, goalCondition: string, defs: AffordanceDef[], mutexPrefixes: Set<string>, opts?: PlanOptions): PlanResult;
+/**
+ * Plan prerequisite chain for a goal action using a condition map.
+ * Uses BFS for each unmet precondition with forward state simulation.
+ */
+declare function planForAction(entity: {
+    properties?: Record<string, unknown>;
+    actions?: unknown[];
+    'x-conditions'?: string[];
+}, goalActionName: string, conditionMap: Record<string, ConditionMapEntry>, opts?: PlanOptions): PlanStep[] | null;
+/**
+ * Plan from entity actions directly — no condition map required.
+ * Builds AffordanceDefs from the entity's actions, infers current state,
+ * and runs cost-aware BFS for the goal action's unmet preconditions.
+ */
+declare function planFromEntity(entity: SirenEntity & {
+    'x-conditions'?: string[];
+}, goalActionName: string, opts?: PlanOptions): PlanResult | null;
+
+export { type AffordanceDef, type BlockedProperties, type BlockedResponse, type ConditionMapEntry, type PlanOptions, type PlanResult, type PlanStep, type SirenAction, type SirenEntity, type SirenField, type SirenLink, type SirenSubEntity, applyEffects, buildDefsFromActions, createAffordanceDef, createPlanStep, inferConditions, inferHeuristicMappings, parseConditionMap, plan, planForAction, planFromEntity, planWithCost };

package/dist/index.js

@@ -0,0 +1,358 @@
+// src/planner.ts
+function createPlanStep(name, params = {}) {
+  const frozenParams = Object.freeze({ ...params });
+  return Object.freeze({
+    name,
+    params: frozenParams,
+    key() {
+      const entries = Object.entries(frozenParams).sort(([a], [b]) => a < b ? -1 : a > b ? 1 : 0);
+      if (entries.length === 0) return name;
+      return `${name}(${entries.map(([k, v]) => `${k}=${v}`).join(",")})`;
+    },
+    label() {
+      const entries = Object.entries(frozenParams);
+      if (entries.length === 0) return name;
+      const p = entries.map(([k, v]) => `${k}=${v}`).join(", ");
+      return `${name}(${p})`;
+    }
+  });
+}
+function createAffordanceDef(opts) {
+  return Object.freeze({
+    name: opts.name,
+    preconditions: Object.freeze([...opts.preconditions]),
+    effects: Object.freeze([...opts.effects]),
+    templateEffect: opts.templateEffect ?? null,
+    paramName: opts.paramName ?? null,
+    validValues: Object.freeze([...opts.validValues ?? []]),
+    cost: opts.cost ?? 1,
+    preferred: opts.preferred ?? false
+  });
+}
+function stateKey(state) {
+  return [...state].sort().join(",");
+}
+function applyEffects(state, affDef, params, mutexPrefixes) {
+  const next = new Set(state);
+  if (affDef.templateEffect && params && Object.keys(params).length > 0) {
+    let resolved = affDef.templateEffect;
+    for (const [k, v] of Object.entries(params)) {
+      resolved = resolved.replace(`{${k}}`, v);
+    }
+    const prefix = affDef.templateEffect.slice(0, affDef.templateEffect.indexOf("{"));
+    for (const c of next) {
+      if (c.startsWith(prefix)) next.delete(c);
+    }
+    next.add(resolved);
+  } else {
+    for (const effect of affDef.effects) {
+      for (const prefix of mutexPrefixes) {
+        if (effect.startsWith(prefix)) {
+          for (const c of next) {
+            if (c.startsWith(prefix)) next.delete(c);
+          }
+          break;
+        }
+      }
+      next.add(effect);
+    }
+  }
+  return next;
+}
+function inferHeuristicMappings(conditionNames) {
+  const mappings = {};
+  for (const name of conditionNames) {
+    const parts = name.split(".");
+    if (parts.length === 3) {
+      const [, prop, value] = parts;
+      if (value === "nonempty") {
+        const singular = prop.endsWith("s") ? prop.slice(0, -1) : prop;
+        mappings[name] = { property: `${singular}Count`, op: "gt", value: 0 };
+      } else {
+        mappings[name] = { property: prop, op: "eq", value };
+      }
+    } else if (parts.length === 2) {
+      mappings[name] = { property: "_derived", op: "action-presence", value: "" };
+    }
+  }
+  return mappings;
+}
+function inferConditions(entity, conditionNames, mappings) {
+  const xc = entity["x-conditions"];
+  if (Array.isArray(xc)) {
+    return new Set(xc);
+  }
+  if (!mappings) {
+    mappings = inferHeuristicMappings(conditionNames);
+  }
+  const props = entity.properties || {};
+  const actions = entity.actions || [];
+  const conds = /* @__PURE__ */ new Set();
+  for (const name of conditionNames) {
+    const m = mappings[name];
+    if (!m || m.property === "_derived") continue;
+    const val = props[m.property];
+    if (val === void 0 || val === null) continue;
+    if (m.op === "eq" && String(val) === String(m.value)) conds.add(name);
+    else if (m.op === "gt") {
+      try {
+        if (Number(val) > Number(m.value)) conds.add(name);
+      } catch {
+      }
+    }
+  }
+  for (const name of conditionNames) {
+    const m = mappings[name];
+    if (!m || m.property !== "_derived") continue;
+    if (actions.length > 0) conds.add(name);
+  }
+  return conds;
+}
+function detectTemplate(effects) {
+  if (effects.length < 2) return [null, null, effects];
+  let prefix = effects[0];
+  for (let i = 1; i < effects.length; i++) {
+    while (!effects[i].startsWith(prefix)) {
+      const dot = prefix.lastIndexOf(".");
+      if (dot === -1) return [null, null, effects];
+      prefix = prefix.slice(0, dot + 1);
+    }
+  }
+  if (!prefix.endsWith(".")) return [null, null, effects];
+  const values = [];
+  for (const e of effects) {
+    if (!e.startsWith(prefix)) return [null, null, effects];
+    values.push(e.slice(prefix.length));
+  }
+  const parts = prefix.replace(/\.$/, "").split(".");
+  const paramName = parts.length > 0 ? parts[parts.length - 1] : "value";
+  const template = `${prefix}{${paramName}}`;
+  return [template, paramName, values];
+}
+function parseConditionMap(conditionMap) {
+  const conditionNames = new Set(Object.keys(conditionMap));
+  const affNames = /* @__PURE__ */ new Set();
+  for (const info of Object.values(conditionMap)) {
+    for (const a of info.producedBy || []) affNames.add(a);
+    for (const a of info.requiredBy || []) affNames.add(a);
+  }
+  const defs = [];
+  for (const affName of [...affNames].sort()) {
+    const preconditions = [];
+    const effects = [];
+    for (const [condName, info] of Object.entries(conditionMap)) {
+      if ((info.requiredBy || []).includes(affName)) preconditions.push(condName);
+      if ((info.producedBy || []).includes(affName)) effects.push(condName);
+    }
+    preconditions.sort();
+    effects.sort();
+    const [templateEffect, paramName, validValues] = detectTemplate(effects);
+    defs.push(
+      createAffordanceDef({
+        name: affName,
+        preconditions,
+        effects,
+        templateEffect,
+        paramName,
+        validValues
+      })
+    );
+  }
+  const mutexPrefixes = /* @__PURE__ */ new Set();
+  for (const d of defs) {
+    if (d.templateEffect) {
+      mutexPrefixes.add(d.templateEffect.slice(0, d.templateEffect.indexOf("{")));
+    }
+  }
+  return { defs, conditionNames, mutexPrefixes };
+}
+function buildDefsFromActions(actions) {
+  const conditionNames = /* @__PURE__ */ new Set();
+  const defs = [];
+  for (const action of actions) {
+    const preconditions = action.preconditions ?? [];
+    const effects = action.effects ?? [];
+    for (const c of preconditions) conditionNames.add(c);
+    for (const c of effects) conditionNames.add(c);
+    const [templateEffect, paramName, validValues] = detectTemplate([...effects]);
+    defs.push(
+      createAffordanceDef({
+        name: action.name,
+        preconditions: [...preconditions],
+        effects: [...effects],
+        templateEffect,
+        paramName,
+        validValues,
+        cost: action.cost ?? 1
+      })
+    );
+  }
+  const mutexPrefixes = /* @__PURE__ */ new Set();
+  for (const d of defs) {
+    if (d.templateEffect) {
+      mutexPrefixes.add(d.templateEffect.slice(0, d.templateEffect.indexOf("{")));
+    }
+  }
+  return { defs, conditionNames, mutexPrefixes };
+}
+function availableSteps(state, defs, blockedKeys) {
+  const steps = [];
+  for (const d of defs) {
+    if (!d.preconditions.every((p) => state.has(p))) continue;
+    if (d.paramName) {
+      for (const v of d.validValues) {
+        const step = createPlanStep(d.name, { [d.paramName]: v });
+        if (!blockedKeys.has(step.key())) steps.push(step);
+      }
+    } else {
+      const step = createPlanStep(d.name);
+      if (!blockedKeys.has(step.key())) steps.push(step);
+    }
+  }
+  return steps;
+}
+function plan(start, goalCondition, defs, mutexPrefixes, opts = {}) {
+  const { maxDepth = 5, maxQueueSize = 1e4, blockedSteps = [] } = opts;
+  if (start.has(goalCondition)) return [[]];
+  const blockedKeys = new Set(blockedSteps.map((s) => s.key()));
+  const queue = [{ state: start, path: [] }];
+  const visited = /* @__PURE__ */ new Set([stateKey(start)]);
+  const solutions = [];
+  let solutionDepth = null;
+  while (queue.length > 0) {
+    if (queue.length > maxQueueSize) return solutions;
+    const { state, path } = queue.shift();
+    if (solutionDepth !== null && path.length >= solutionDepth) continue;
+    for (const step of availableSteps(state, defs, blockedKeys)) {
+      const affDef = defs.find((d) => d.name === step.name);
+      const newState = applyEffects(state, affDef, step.params, mutexPrefixes);
+      const newPath = [...path, step];
+      if (newState.has(goalCondition)) {
+        solutions.push(newPath);
+        solutionDepth = newPath.length;
+        continue;
+      }
+      const key = stateKey(newState);
+      if (!visited.has(key) && newPath.length < maxDepth) {
+        visited.add(key);
+        queue.push({ state: newState, path: newPath });
+      }
+    }
+  }
+  return solutions;
+}
+function pathCost(path, defs) {
+  return path.reduce((sum, step) => {
+    const def = defs.find((d) => d.name === step.name);
+    return sum + (def?.cost ?? 1);
+  }, 0);
+}
+function pathPreferredCount(path, defs) {
+  return path.reduce((count, step) => {
+    const def = defs.find((d) => d.name === step.name);
+    return count + (def?.preferred ? 1 : 0);
+  }, 0);
+}
+function planWithCost(start, goalCondition, defs, mutexPrefixes, opts = {}) {
+  const paths = plan(start, goalCondition, defs, mutexPrefixes, opts);
+  if (paths.length === 0) {
+    return { steps: [], totalCost: 0, alternativeCount: 0 };
+  }
+  if (paths.length === 1 && paths[0].length === 0) {
+    return { steps: [], totalCost: 0, alternativeCount: 1 };
+  }
+  let bestPath = paths[0];
+  let bestCost = pathCost(bestPath, defs);
+  let bestPreferred = pathPreferredCount(bestPath, defs);
+  for (let i = 1; i < paths.length; i++) {
+    const cost = pathCost(paths[i], defs);
+    const preferred = pathPreferredCount(paths[i], defs);
+    if (cost < bestCost || cost === bestCost && preferred > bestPreferred) {
+      bestPath = paths[i];
+      bestCost = cost;
+      bestPreferred = preferred;
+    }
+  }
+  return {
+    steps: bestPath,
+    totalCost: bestCost,
+    alternativeCount: paths.length
+  };
+}
+function planForAction(entity, goalActionName, conditionMap, opts = {}) {
+  const { defs, conditionNames, mutexPrefixes } = parseConditionMap(conditionMap);
+  const goalDef = defs.find((d) => d.name === goalActionName);
+  if (!goalDef) return null;
+  let state = inferConditions(entity, conditionNames);
+  const unmet = goalDef.preconditions.filter((p) => !state.has(p));
+  if (unmet.length === 0) return [createPlanStep(goalActionName)];
+  const steps = [];
+  const usedKeys = /* @__PURE__ */ new Set();
+  for (const precond of unmet) {
+    if (state.has(precond)) continue;
+    const paths = plan(state, precond, defs, mutexPrefixes, opts);
+    if (paths.length === 0) return null;
+    for (const step of paths[0]) {
+      if (usedKeys.has(step.key())) continue;
+      usedKeys.add(step.key());
+      steps.push(step);
+      const affDef = defs.find((d) => d.name === step.name);
+      if (affDef) state = applyEffects(state, affDef, step.params, mutexPrefixes);
+    }
+  }
+  steps.push(createPlanStep(goalActionName));
+  return steps;
+}
+function planFromEntity(entity, goalActionName, opts = {}) {
+  const actions = entity.actions ?? [];
+  if (actions.length === 0) return null;
+  const goalAction = actions.find((a) => a.name === goalActionName);
+  if (!goalAction) return null;
+  const goalPreconditions = goalAction.preconditions ?? [];
+  const { defs, conditionNames, mutexPrefixes } = buildDefsFromActions(actions);
+  const state = inferConditions(entity, conditionNames);
+  const unmet = goalPreconditions.filter((p) => !state.has(p));
+  if (unmet.length === 0) {
+    return {
+      steps: [createPlanStep(goalActionName)],
+      totalCost: goalAction.cost ?? 1,
+      alternativeCount: 1
+    };
+  }
+  let currentState = state;
+  const steps = [];
+  const usedKeys = /* @__PURE__ */ new Set();
+  let totalCost = 0;
+  for (const precond of unmet) {
+    if (currentState.has(precond)) continue;
+    const result = planWithCost(currentState, precond, defs, mutexPrefixes, opts);
+    if (result.steps.length === 0 && !currentState.has(precond)) return null;
+    for (const step of result.steps) {
+      if (usedKeys.has(step.key())) continue;
+      usedKeys.add(step.key());
+      steps.push(step);
+      const affDef = defs.find((d) => d.name === step.name);
+      if (affDef) {
+        totalCost += affDef.cost;
+        currentState = applyEffects(currentState, affDef, step.params, mutexPrefixes);
+      }
+    }
+  }
+  steps.push(createPlanStep(goalActionName));
+  totalCost += goalAction.cost ?? 1;
+  return { steps, totalCost, alternativeCount: 1 };
+}
+export {
+  applyEffects,
+  buildDefsFromActions,
+  createAffordanceDef,
+  createPlanStep,
+  inferConditions,
+  inferHeuristicMappings,
+  parseConditionMap,
+  plan,
+  planForAction,
+  planFromEntity,
+  planWithCost
+};
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/planner.ts"],"sourcesContent":["/**\n * BFS planner over the affordance graph.\n *\n * Port of siren-grail/packages/siren-agent/planner.js to TypeScript,\n * extended with cost-aware path selection, preferred tiebreaker (GRAIL spec §5.4),\n * and a buildDefsFromActions() path for client-side planning without a condition map.\n *\n * Pure module — no DOM, no fetch, no side effects.\n */\n\nimport type { SirenAction, SirenEntity, ConditionMapEntry } from './types.js';\n\n// ---------- Types ----------\n\nexport interface PlanStep {\n  readonly name: string;\n  readonly params: Readonly<Record<string, string>>;\n  key(): string;\n  label(): string;\n}\n\nexport interface AffordanceDef {\n  readonly name: string;\n  readonly preconditions: readonly string[];\n  readonly effects: readonly string[];\n  readonly templateEffect: string | null;\n  readonly paramName: string | null;\n  readonly validValues: readonly string[];\n  readonly cost: number;\n  readonly preferred: boolean;\n}\n\nexport interface PlanResult {\n  /** Ordered steps to reach the goal (empty if already satisfied) */\n  steps: PlanStep[];\n  /** Total cost of all steps */\n  totalCost: number;\n  /** Number of alternative equal-length paths found */\n  alternativeCount: number;\n}\n\nexport interface PlanOptions {\n  maxDepth?: number;\n  maxQueueSize?: number;\n  blockedSteps?: PlanStep[];\n}\n\ninterface HeuristicMapping {\n  property: string;\n  op: string;\n  value: string | number;\n}\n\n// ---------- Factories ----------\n\nexport function createPlanStep(name: string, params: Record<string, string> = {}): PlanStep {\n  const frozenParams = Object.freeze({ ...params });\n  return Object.freeze({\n    name,\n    params: frozenParams,\n    key() {\n      const entries = Object.entries(frozenParams).sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0));\n      if (entries.length === 0) return name;\n      return `${name}(${entries.map(([k, v]) => `${k}=${v}`).join(',')})`;\n    },\n    label() {\n      const entries = Object.entries(frozenParams);\n      if (entries.length === 0) return name;\n      const p = entries.map(([k, v]) => `${k}=${v}`).join(', ');\n      return `${name}(${p})`;\n    },\n  });\n}\n\nexport function createAffordanceDef(opts: {\n  name: string;\n  preconditions: string[];\n  effects: string[];\n  templateEffect?: string | null;\n  paramName?: string | null;\n  validValues?: string[];\n  cost?: number;\n  preferred?: boolean;\n}): AffordanceDef {\n  return Object.freeze({\n    name: opts.name,\n    preconditions: Object.freeze([...opts.preconditions]),\n    effects: Object.freeze([...opts.effects]),\n    templateEffect: opts.templateEffect ?? null,\n    paramName: opts.paramName ?? null,\n    validValues: Object.freeze([...(opts.validValues ?? [])]),\n    cost: opts.cost ?? 1,\n    preferred: opts.preferred ?? false,\n  });\n}\n\n// ---------- State helpers ----------\n\nfunction stateKey(state: Set<string>): string {\n  return [...state].sort().join(',');\n}\n\n/**\n * Forward simulation: apply affordance effects, return new state.\n * Handles template effect resolution and mutex prefix clearing.\n */\nexport function applyEffects(\n  state: Set<string>,\n  affDef: AffordanceDef,\n  params: Record<string, string>,\n  mutexPrefixes: Set<string>\n): Set<string> {\n  const next = new Set(state);\n\n  if (affDef.templateEffect && params && Object.keys(params).length > 0) {\n    let resolved = affDef.templateEffect;\n    for (const [k, v] of Object.entries(params)) {\n      resolved = resolved.replace(`{${k}}`, v);\n    }\n    const prefix = affDef.templateEffect.slice(0, affDef.templateEffect.indexOf('{'));\n    for (const c of next) {\n      if (c.startsWith(prefix)) next.delete(c);\n    }\n    next.add(resolved);\n  } else {\n    for (const effect of affDef.effects) {\n      for (const prefix of mutexPrefixes) {\n        if (effect.startsWith(prefix)) {\n          for (const c of next) {\n            if (c.startsWith(prefix)) next.delete(c);\n          }\n          break;\n        }\n      }\n      next.add(effect);\n    }\n  }\n\n  return next;\n}\n\n// ---------- Condition inference ----------\n\n/**\n * Infer heuristic condition mappings from condition name structure.\n *\n * - \"x.y.z\" (3 segments): property=y, op=eq, value=z\n * - \"x.y.z\" where z=\"nonempty\": property=yCount (singular), op=gt, value=0\n * - \"x.y\" (2 segments): derived from action-presence\n */\nexport function inferHeuristicMappings(\n  conditionNames: Set<string>\n): Record<string, HeuristicMapping> {\n  const mappings: Record<string, HeuristicMapping> = {};\n  for (const name of conditionNames) {\n    const parts = name.split('.');\n    if (parts.length === 3) {\n      const [, prop, value] = parts;\n      if (value === 'nonempty') {\n        const singular = prop.endsWith('s') ? prop.slice(0, -1) : prop;\n        mappings[name] = { property: `${singular}Count`, op: 'gt', value: 0 };\n      } else {\n        mappings[name] = { property: prop, op: 'eq', value };\n      }\n    } else if (parts.length === 2) {\n      mappings[name] = { property: '_derived', op: 'action-presence', value: '' };\n    }\n  }\n  return mappings;\n}\n\n/**\n * Infer active conditions from a Siren entity.\n * Prefers server-provided x-conditions when available.\n */\nexport function inferConditions(\n  entity: { properties?: Record<string, unknown>; actions?: unknown[]; 'x-conditions'?: string[] },\n  conditionNames: Set<string>,\n  mappings?: Record<string, HeuristicMapping>\n): Set<string> {\n  const xc = entity['x-conditions'];\n  if (Array.isArray(xc)) {\n    return new Set(xc);\n  }\n\n  if (!mappings) {\n    mappings = inferHeuristicMappings(conditionNames);\n  }\n\n  const props = entity.properties || {};\n  const actions = entity.actions || [];\n  const conds = new Set<string>();\n\n  // First pass: non-derived\n  for (const name of conditionNames) {\n    const m = mappings[name];\n    if (!m || m.property === '_derived') continue;\n    const val = props[m.property];\n    if (val === undefined || val === null) continue;\n    if (m.op === 'eq' && String(val) === String(m.value)) conds.add(name);\n    else if (m.op === 'gt') {\n      try {\n        if (Number(val) > Number(m.value)) conds.add(name);\n      } catch {\n        /* skip */\n      }\n    }\n  }\n\n  // Second pass: derived (action-presence)\n  for (const name of conditionNames) {\n    const m = mappings[name];\n    if (!m || m.property !== '_derived') continue;\n    if (actions.length > 0) conds.add(name);\n  }\n\n  return conds;\n}\n\n// ---------- Template detection ----------\n\n/**\n * Detect parameterized template in a list of effect condition names.\n * Returns [template, paramName, validValues] or [null, null, effects].\n */\nfunction detectTemplate(effects: string[]): [string | null, string | null, string[]] {\n  if (effects.length < 2) return [null, null, effects];\n\n  let prefix = effects[0];\n  for (let i = 1; i < effects.length; i++) {\n    while (!effects[i].startsWith(prefix)) {\n      const dot = prefix.lastIndexOf('.');\n      if (dot === -1) return [null, null, effects];\n      prefix = prefix.slice(0, dot + 1);\n    }\n  }\n\n  if (!prefix.endsWith('.')) return [null, null, effects];\n\n  const values: string[] = [];\n  for (const e of effects) {\n    if (!e.startsWith(prefix)) return [null, null, effects];\n    values.push(e.slice(prefix.length));\n  }\n\n  const parts = prefix.replace(/\\.$/, '').split('.');\n  const paramName = parts.length > 0 ? parts[parts.length - 1] : 'value';\n  const template = `${prefix}{${paramName}}`;\n\n  return [template, paramName, values];\n}\n\n// ---------- Condition map parsing ----------\n\n/**\n * Parse a condition map (from /conditions endpoint) into AffordanceDef objects.\n * Input shape: { conditionName: { description, producedBy: string[], requiredBy: string[] } }\n */\nexport function parseConditionMap(conditionMap: Record<string, ConditionMapEntry>): {\n  defs: AffordanceDef[];\n  conditionNames: Set<string>;\n  mutexPrefixes: Set<string>;\n} {\n  const conditionNames = new Set(Object.keys(conditionMap));\n\n  const affNames = new Set<string>();\n  for (const info of Object.values(conditionMap)) {\n    for (const a of info.producedBy || []) affNames.add(a);\n    for (const a of info.requiredBy || []) affNames.add(a);\n  }\n\n  const defs: AffordanceDef[] = [];\n  for (const affName of [...affNames].sort()) {\n    const preconditions: string[] = [];\n    const effects: string[] = [];\n\n    for (const [condName, info] of Object.entries(conditionMap)) {\n      if ((info.requiredBy || []).includes(affName)) preconditions.push(condName);\n      if ((info.producedBy || []).includes(affName)) effects.push(condName);\n    }\n\n    preconditions.sort();\n    effects.sort();\n\n    const [templateEffect, paramName, validValues] = detectTemplate(effects);\n\n    defs.push(\n      createAffordanceDef({\n        name: affName,\n        preconditions,\n        effects,\n        templateEffect,\n        paramName,\n        validValues,\n      })\n    );\n  }\n\n  const mutexPrefixes = new Set<string>();\n  for (const d of defs) {\n    if (d.templateEffect) {\n      mutexPrefixes.add(d.templateEffect.slice(0, d.templateEffect.indexOf('{')));\n    }\n  }\n\n  return { defs, conditionNames, mutexPrefixes };\n}\n\n// ---------- Build defs from entity actions (simple path) ----------\n\n/**\n * Build AffordanceDefs directly from SirenAction[].\n * This is the \"simple path\" — no condition map or server endpoint required.\n * Reads preconditions, effects, and cost from each action.\n */\nexport function buildDefsFromActions(actions: SirenAction[]): {\n  defs: AffordanceDef[];\n  conditionNames: Set<string>;\n  mutexPrefixes: Set<string>;\n} {\n  const conditionNames = new Set<string>();\n  const defs: AffordanceDef[] = [];\n\n  for (const action of actions) {\n    const preconditions = action.preconditions ?? [];\n    const effects = action.effects ?? [];\n\n    for (const c of preconditions) conditionNames.add(c);\n    for (const c of effects) conditionNames.add(c);\n\n    const [templateEffect, paramName, validValues] = detectTemplate([...effects]);\n\n    defs.push(\n      createAffordanceDef({\n        name: action.name,\n        preconditions: [...preconditions],\n        effects: [...effects],\n        templateEffect,\n        paramName,\n        validValues,\n        cost: action.cost ?? 1,\n      })\n    );\n  }\n\n  const mutexPrefixes = new Set<string>();\n  for (const d of defs) {\n    if (d.templateEffect) {\n      mutexPrefixes.add(d.templateEffect.slice(0, d.templateEffect.indexOf('{')));\n    }\n  }\n\n  return { defs, conditionNames, mutexPrefixes };\n}\n\n// ---------- BFS planner ----------\n\nfunction availableSteps(\n  state: Set<string>,\n  defs: AffordanceDef[],\n  blockedKeys: Set<string>\n): PlanStep[] {\n  const steps: PlanStep[] = [];\n  for (const d of defs) {\n    if (!d.preconditions.every(p => state.has(p))) continue;\n    if (d.paramName) {\n      for (const v of d.validValues) {\n        const step = createPlanStep(d.name, { [d.paramName]: v });\n        if (!blockedKeys.has(step.key())) steps.push(step);\n      }\n    } else {\n      const step = createPlanStep(d.name);\n      if (!blockedKeys.has(step.key())) steps.push(step);\n    }\n  }\n  return steps;\n}\n\n/**\n * BFS: find ALL shortest action sequences from start state to goal condition.\n */\nexport function plan(\n  start: Set<string>,\n  goalCondition: string,\n  defs: AffordanceDef[],\n  mutexPrefixes: Set<string>,\n  opts: PlanOptions = {}\n): PlanStep[][] {\n  const { maxDepth = 5, maxQueueSize = 10000, blockedSteps = [] } = opts;\n\n  if (start.has(goalCondition)) return [[]];\n\n  const blockedKeys = new Set(blockedSteps.map(s => s.key()));\n  const queue: Array<{ state: Set<string>; path: PlanStep[] }> = [{ state: start, path: [] }];\n  const visited = new Set([stateKey(start)]);\n  const solutions: PlanStep[][] = [];\n  let solutionDepth: number | null = null;\n\n  while (queue.length > 0) {\n    if (queue.length > maxQueueSize) return solutions;\n\n    const { state, path } = queue.shift()!;\n    if (solutionDepth !== null && path.length >= solutionDepth) continue;\n\n    for (const step of availableSteps(state, defs, blockedKeys)) {\n      const affDef = defs.find(d => d.name === step.name)!;\n      const newState = applyEffects(state, affDef, step.params, mutexPrefixes);\n      const newPath = [...path, step];\n\n      if (newState.has(goalCondition)) {\n        solutions.push(newPath);\n        solutionDepth = newPath.length;\n        continue;\n      }\n\n      const key = stateKey(newState);\n      if (!visited.has(key) && newPath.length < maxDepth) {\n        visited.add(key);\n        queue.push({ state: newState, path: newPath });\n      }\n    }\n  }\n\n  return solutions;\n}\n\n// ---------- Cost-aware planning ----------\n\nfunction pathCost(path: PlanStep[], defs: AffordanceDef[]): number {\n  return path.reduce((sum, step) => {\n    const def = defs.find(d => d.name === step.name);\n    return sum + (def?.cost ?? 1);\n  }, 0);\n}\n\nfunction pathPreferredCount(path: PlanStep[], defs: AffordanceDef[]): number {\n  return path.reduce((count, step) => {\n    const def = defs.find(d => d.name === step.name);\n    return count + (def?.preferred ? 1 : 0);\n  }, 0);\n}\n\n/**\n * Find the lowest-cost shortest path.\n * Among equal-cost paths, prefer ones with more preferred steps (spec §5.4).\n */\nexport function planWithCost(\n  start: Set<string>,\n  goalCondition: string,\n  defs: AffordanceDef[],\n  mutexPrefixes: Set<string>,\n  opts: PlanOptions = {}\n): PlanResult {\n  const paths = plan(start, goalCondition, defs, mutexPrefixes, opts);\n\n  if (paths.length === 0) {\n    return { steps: [], totalCost: 0, alternativeCount: 0 };\n  }\n\n  // Already-satisfied case: plan() returns [[]]\n  if (paths.length === 1 && paths[0].length === 0) {\n    return { steps: [], totalCost: 0, alternativeCount: 1 };\n  }\n\n  let bestPath = paths[0];\n  let bestCost = pathCost(bestPath, defs);\n  let bestPreferred = pathPreferredCount(bestPath, defs);\n\n  for (let i = 1; i < paths.length; i++) {\n    const cost = pathCost(paths[i], defs);\n    const preferred = pathPreferredCount(paths[i], defs);\n    if (cost < bestCost || (cost === bestCost && preferred > bestPreferred)) {\n      bestPath = paths[i];\n      bestCost = cost;\n      bestPreferred = preferred;\n    }\n  }\n\n  return {\n    steps: bestPath,\n    totalCost: bestCost,\n    alternativeCount: paths.length,\n  };\n}\n\n// ---------- Action-level planning ----------\n\n/**\n * Plan prerequisite chain for a goal action using a condition map.\n * Uses BFS for each unmet precondition with forward state simulation.\n */\nexport function planForAction(\n  entity: { properties?: Record<string, unknown>; actions?: unknown[]; 'x-conditions'?: string[] },\n  goalActionName: string,\n  conditionMap: Record<string, ConditionMapEntry>,\n  opts: PlanOptions = {}\n): PlanStep[] | null {\n  const { defs, conditionNames, mutexPrefixes } = parseConditionMap(conditionMap);\n  const goalDef = defs.find(d => d.name === goalActionName);\n  if (!goalDef) return null;\n\n  let state = inferConditions(entity, conditionNames);\n\n  const unmet = goalDef.preconditions.filter(p => !state.has(p));\n  if (unmet.length === 0) return [createPlanStep(goalActionName)];\n\n  const steps: PlanStep[] = [];\n  const usedKeys = new Set<string>();\n\n  for (const precond of unmet) {\n    if (state.has(precond)) continue;\n    const paths = plan(state, precond, defs, mutexPrefixes, opts);\n    if (paths.length === 0) return null;\n    for (const step of paths[0]) {\n      if (usedKeys.has(step.key())) continue;\n      usedKeys.add(step.key());\n      steps.push(step);\n      const affDef = defs.find(d => d.name === step.name);\n      if (affDef) state = applyEffects(state, affDef, step.params, mutexPrefixes);\n    }\n  }\n\n  steps.push(createPlanStep(goalActionName));\n  return steps;\n}\n\n// ---------- Entity-level planning (simple path) ----------\n\n/**\n * Plan from entity actions directly — no condition map required.\n * Builds AffordanceDefs from the entity's actions, infers current state,\n * and runs cost-aware BFS for the goal action's unmet preconditions.\n */\nexport function planFromEntity(\n  entity: SirenEntity & { 'x-conditions'?: string[] },\n  goalActionName: string,\n  opts: PlanOptions = {}\n): PlanResult | null {\n  const actions = entity.actions ?? [];\n  if (actions.length === 0) return null;\n\n  const goalAction = actions.find(a => a.name === goalActionName);\n  if (!goalAction) return null;\n\n  const goalPreconditions = goalAction.preconditions ?? [];\n\n  const { defs, conditionNames, mutexPrefixes } = buildDefsFromActions(actions);\n\n  const state = inferConditions(entity, conditionNames);\n\n  const unmet = goalPreconditions.filter(p => !state.has(p));\n  if (unmet.length === 0) {\n    return {\n      steps: [createPlanStep(goalActionName)],\n      totalCost: goalAction.cost ?? 1,\n      alternativeCount: 1,\n    };\n  }\n\n  // Plan each unmet precondition with cost-aware selection, forward-simulating state\n  let currentState = state;\n  const steps: PlanStep[] = [];\n  const usedKeys = new Set<string>();\n  let totalCost = 0;\n\n  for (const precond of unmet) {\n    if (currentState.has(precond)) continue;\n    const result = planWithCost(currentState, precond, defs, mutexPrefixes, opts);\n    if (result.steps.length === 0 && !currentState.has(precond)) return null;\n    for (const step of result.steps) {\n      if (usedKeys.has(step.key())) continue;\n      usedKeys.add(step.key());\n      steps.push(step);\n      const affDef = defs.find(d => d.name === step.name);\n      if (affDef) {\n        totalCost += affDef.cost;\n        currentState = applyEffects(currentState, affDef, step.params, mutexPrefixes);\n      }\n    }\n  }\n\n  steps.push(createPlanStep(goalActionName));\n  totalCost += goalAction.cost ?? 1;\n\n  return { steps, totalCost, alternativeCount: 1 };\n}\n"],"mappings":";AAuDO,SAAS,eAAe,MAAc,SAAiC,CAAC,GAAa;AAC1F,QAAM,eAAe,OAAO,OAAO,EAAE,GAAG,OAAO,CAAC;AAChD,SAAO,OAAO,OAAO;AAAA,IACnB;AAAA,IACA,QAAQ;AAAA,IACR,MAAM;AACJ,YAAM,UAAU,OAAO,QAAQ,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAE;AAC5F,UAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,aAAO,GAAG,IAAI,IAAI,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC;AAAA,IAClE;AAAA,IACA,QAAQ;AACN,YAAM,UAAU,OAAO,QAAQ,YAAY;AAC3C,UAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,YAAM,IAAI,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,IAAI;AACxD,aAAO,GAAG,IAAI,IAAI,CAAC;AAAA,IACrB;AAAA,EACF,CAAC;AACH;AAEO,SAAS,oBAAoB,MASlB;AAChB,SAAO,OAAO,OAAO;AAAA,IACnB,MAAM,KAAK;AAAA,IACX,eAAe,OAAO,OAAO,CAAC,GAAG,KAAK,aAAa,CAAC;AAAA,IACpD,SAAS,OAAO,OAAO,CAAC,GAAG,KAAK,OAAO,CAAC;AAAA,IACxC,gBAAgB,KAAK,kBAAkB;AAAA,IACvC,WAAW,KAAK,aAAa;AAAA,IAC7B,aAAa,OAAO,OAAO,CAAC,GAAI,KAAK,eAAe,CAAC,CAAE,CAAC;AAAA,IACxD,MAAM,KAAK,QAAQ;AAAA,IACnB,WAAW,KAAK,aAAa;AAAA,EAC/B,CAAC;AACH;AAIA,SAAS,SAAS,OAA4B;AAC5C,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG;AACnC;AAMO,SAAS,aACd,OACA,QACA,QACA,eACa;AACb,QAAM,OAAO,IAAI,IAAI,KAAK;AAE1B,MAAI,OAAO,kBAAkB,UAAU,OAAO,KAAK,MAAM,EAAE,SAAS,GAAG;AACrE,QAAI,WAAW,OAAO;AACtB,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,MAAM,GAAG;AAC3C,iBAAW,SAAS,QAAQ,IAAI,CAAC,KAAK,CAAC;AAAA,IACzC;AACA,UAAM,SAAS,OAAO,eAAe,MAAM,GAAG,OAAO,eAAe,QAAQ,GAAG,CAAC;AAChF,eAAW,KAAK,MAAM;AACpB,UAAI,EAAE,WAAW,MAAM,EAAG,MAAK,OAAO,CAAC;AAAA,IACzC;AACA,SAAK,IAAI,QAAQ;AAAA,EACnB,OAAO;AACL,eAAW,UAAU,OAAO,SAAS;AACnC,iBAAW,UAAU,eAAe;AAClC,YAAI,OAAO,WAAW,MAAM,GAAG;AAC7B,qBAAW,KAAK,MAAM;AACpB,gBAAI,EAAE,WAAW,MAAM,EAAG,MAAK,OAAO,CAAC;AAAA,UACzC;AACA;AAAA,QACF;AAAA,MACF;AACA,WAAK,IAAI,MAAM;AAAA,IACjB;AAAA,EACF;AAEA,SAAO;AACT;AAWO,SAAS,uBACd,gBACkC;AAClC,QAAM,WAA6C,CAAC;AACpD,aAAW,QAAQ,gBAAgB;AACjC,UAAM,QAAQ,KAAK,MAAM,GAAG;AAC5B,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,CAAC,EAAE,MAAM,KAAK,IAAI;AACxB,UAAI,UAAU,YAAY;AACxB,cAAM,WAAW,KAAK,SAAS,GAAG,IAAI,KAAK,MAAM,GAAG,EAAE,IAAI;AAC1D,iBAAS,IAAI,IAAI,EAAE,UAAU,GAAG,QAAQ,SAAS,IAAI,MAAM,OAAO,EAAE;AAAA,MACtE,OAAO;AACL,iBAAS,IAAI,IAAI,EAAE,UAAU,MAAM,IAAI,MAAM,MAAM;AAAA,MACrD;AAAA,IACF,WAAW,MAAM,WAAW,GAAG;AAC7B,eAAS,IAAI,IAAI,EAAE,UAAU,YAAY,IAAI,mBAAmB,OAAO,GAAG;AAAA,IAC5E;AAAA,EACF;AACA,SAAO;AACT;AAMO,SAAS,gBACd,QACA,gBACA,UACa;AACb,QAAM,KAAK,OAAO,cAAc;AAChC,MAAI,MAAM,QAAQ,EAAE,GAAG;AACrB,WAAO,IAAI,IAAI,EAAE;AAAA,EACnB;AAEA,MAAI,CAAC,UAAU;AACb,eAAW,uBAAuB,cAAc;AAAA,EAClD;AAEA,QAAM,QAAQ,OAAO,cAAc,CAAC;AACpC,QAAM,UAAU,OAAO,WAAW,CAAC;AACnC,QAAM,QAAQ,oBAAI,IAAY;AAG9B,aAAW,QAAQ,gBAAgB;AACjC,UAAM,IAAI,SAAS,IAAI;AACvB,QAAI,CAAC,KAAK,EAAE,aAAa,WAAY;AACrC,UAAM,MAAM,MAAM,EAAE,QAAQ;AAC5B,QAAI,QAAQ,UAAa,QAAQ,KAAM;AACvC,QAAI,EAAE,OAAO,QAAQ,OAAO,GAAG,MAAM,OAAO,EAAE,KAAK,EAAG,OAAM,IAAI,IAAI;AAAA,aAC3D,EAAE,OAAO,MAAM;AACtB,UAAI;AACF,YAAI,OAAO,GAAG,IAAI,OAAO,EAAE,KAAK,EAAG,OAAM,IAAI,IAAI;AAAA,MACnD,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AAGA,aAAW,QAAQ,gBAAgB;AACjC,UAAM,IAAI,SAAS,IAAI;AACvB,QAAI,CAAC,KAAK,EAAE,aAAa,WAAY;AACrC,QAAI,QAAQ,SAAS,EAAG,OAAM,IAAI,IAAI;AAAA,EACxC;AAEA,SAAO;AACT;AAQA,SAAS,eAAe,SAA6D;AACnF,MAAI,QAAQ,SAAS,EAAG,QAAO,CAAC,MAAM,MAAM,OAAO;AAEnD,MAAI,SAAS,QAAQ,CAAC;AACtB,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,WAAO,CAAC,QAAQ,CAAC,EAAE,WAAW,MAAM,GAAG;AACrC,YAAM,MAAM,OAAO,YAAY,GAAG;AAClC,UAAI,QAAQ,GAAI,QAAO,CAAC,MAAM,MAAM,OAAO;AAC3C,eAAS,OAAO,MAAM,GAAG,MAAM,CAAC;AAAA,IAClC;AAAA,EACF;AAEA,MAAI,CAAC,OAAO,SAAS,GAAG,EAAG,QAAO,CAAC,MAAM,MAAM,OAAO;AAEtD,QAAM,SAAmB,CAAC;AAC1B,aAAW,KAAK,SAAS;AACvB,QAAI,CAAC,EAAE,WAAW,MAAM,EAAG,QAAO,CAAC,MAAM,MAAM,OAAO;AACtD,WAAO,KAAK,EAAE,MAAM,OAAO,MAAM,CAAC;AAAA,EACpC;AAEA,QAAM,QAAQ,OAAO,QAAQ,OAAO,EAAE,EAAE,MAAM,GAAG;AACjD,QAAM,YAAY,MAAM,SAAS,IAAI,MAAM,MAAM,SAAS,CAAC,IAAI;AAC/D,QAAM,WAAW,GAAG,MAAM,IAAI,SAAS;AAEvC,SAAO,CAAC,UAAU,WAAW,MAAM;AACrC;AAQO,SAAS,kBAAkB,cAIhC;AACA,QAAM,iBAAiB,IAAI,IAAI,OAAO,KAAK,YAAY,CAAC;AAExD,QAAM,WAAW,oBAAI,IAAY;AACjC,aAAW,QAAQ,OAAO,OAAO,YAAY,GAAG;AAC9C,eAAW,KAAK,KAAK,cAAc,CAAC,EAAG,UAAS,IAAI,CAAC;AACrD,eAAW,KAAK,KAAK,cAAc,CAAC,EAAG,UAAS,IAAI,CAAC;AAAA,EACvD;AAEA,QAAM,OAAwB,CAAC;AAC/B,aAAW,WAAW,CAAC,GAAG,QAAQ,EAAE,KAAK,GAAG;AAC1C,UAAM,gBAA0B,CAAC;AACjC,UAAM,UAAoB,CAAC;AAE3B,eAAW,CAAC,UAAU,IAAI,KAAK,OAAO,QAAQ,YAAY,GAAG;AAC3D,WAAK,KAAK,cAAc,CAAC,GAAG,SAAS,OAAO,EAAG,eAAc,KAAK,QAAQ;AAC1E,WAAK,KAAK,cAAc,CAAC,GAAG,SAAS,OAAO,EAAG,SAAQ,KAAK,QAAQ;AAAA,IACtE;AAEA,kBAAc,KAAK;AACnB,YAAQ,KAAK;AAEb,UAAM,CAAC,gBAAgB,WAAW,WAAW,IAAI,eAAe,OAAO;AAEvE,SAAK;AAAA,MACH,oBAAoB;AAAA,QAClB,MAAM;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AACtC,aAAW,KAAK,MAAM;AACpB,QAAI,EAAE,gBAAgB;AACpB,oBAAc,IAAI,EAAE,eAAe,MAAM,GAAG,EAAE,eAAe,QAAQ,GAAG,CAAC,CAAC;AAAA,IAC5E;AAAA,EACF;AAEA,SAAO,EAAE,MAAM,gBAAgB,cAAc;AAC/C;AASO,SAAS,qBAAqB,SAInC;AACA,QAAM,iBAAiB,oBAAI,IAAY;AACvC,QAAM,OAAwB,CAAC;AAE/B,aAAW,UAAU,SAAS;AAC5B,UAAM,gBAAgB,OAAO,iBAAiB,CAAC;AAC/C,UAAM,UAAU,OAAO,WAAW,CAAC;AAEnC,eAAW,KAAK,cAAe,gBAAe,IAAI,CAAC;AACnD,eAAW,KAAK,QAAS,gBAAe,IAAI,CAAC;AAE7C,UAAM,CAAC,gBAAgB,WAAW,WAAW,IAAI,eAAe,CAAC,GAAG,OAAO,CAAC;AAE5E,SAAK;AAAA,MACH,oBAAoB;AAAA,QAClB,MAAM,OAAO;AAAA,QACb,eAAe,CAAC,GAAG,aAAa;AAAA,QAChC,SAAS,CAAC,GAAG,OAAO;AAAA,QACpB;AAAA,QACA;AAAA,QACA;AAAA,QACA,MAAM,OAAO,QAAQ;AAAA,MACvB,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AACtC,aAAW,KAAK,MAAM;AACpB,QAAI,EAAE,gBAAgB;AACpB,oBAAc,IAAI,EAAE,eAAe,MAAM,GAAG,EAAE,eAAe,QAAQ,GAAG,CAAC,CAAC;AAAA,IAC5E;AAAA,EACF;AAEA,SAAO,EAAE,MAAM,gBAAgB,cAAc;AAC/C;AAIA,SAAS,eACP,OACA,MACA,aACY;AACZ,QAAM,QAAoB,CAAC;AAC3B,aAAW,KAAK,MAAM;AACpB,QAAI,CAAC,EAAE,cAAc,MAAM,OAAK,MAAM,IAAI,CAAC,CAAC,EAAG;AAC/C,QAAI,EAAE,WAAW;AACf,iBAAW,KAAK,EAAE,aAAa;AAC7B,cAAM,OAAO,eAAe,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,GAAG,EAAE,CAAC;AACxD,YAAI,CAAC,YAAY,IAAI,KAAK,IAAI,CAAC,EAAG,OAAM,KAAK,IAAI;AAAA,MACnD;AAAA,IACF,OAAO;AACL,YAAM,OAAO,eAAe,EAAE,IAAI;AAClC,UAAI,CAAC,YAAY,IAAI,KAAK,IAAI,CAAC,EAAG,OAAM,KAAK,IAAI;AAAA,IACnD;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,KACd,OACA,eACA,MACA,eACA,OAAoB,CAAC,GACP;AACd,QAAM,EAAE,WAAW,GAAG,eAAe,KAAO,eAAe,CAAC,EAAE,IAAI;AAElE,MAAI,MAAM,IAAI,aAAa,EAAG,QAAO,CAAC,CAAC,CAAC;AAExC,QAAM,cAAc,IAAI,IAAI,aAAa,IAAI,OAAK,EAAE,IAAI,CAAC,CAAC;AAC1D,QAAM,QAAyD,CAAC,EAAE,OAAO,OAAO,MAAM,CAAC,EAAE,CAAC;AAC1F,QAAM,UAAU,oBAAI,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC;AACzC,QAAM,YAA0B,CAAC;AACjC,MAAI,gBAA+B;AAEnC,SAAO,MAAM,SAAS,GAAG;AACvB,QAAI,MAAM,SAAS,aAAc,QAAO;AAExC,UAAM,EAAE,OAAO,KAAK,IAAI,MAAM,MAAM;AACpC,QAAI,kBAAkB,QAAQ,KAAK,UAAU,cAAe;AAE5D,eAAW,QAAQ,eAAe,OAAO,MAAM,WAAW,GAAG;AAC3D,YAAM,SAAS,KAAK,KAAK,OAAK,EAAE,SAAS,KAAK,IAAI;AAClD,YAAM,WAAW,aAAa,OAAO,QAAQ,KAAK,QAAQ,aAAa;AACvE,YAAM,UAAU,CAAC,GAAG,MAAM,IAAI;AAE9B,UAAI,SAAS,IAAI,aAAa,GAAG;AAC/B,kBAAU,KAAK,OAAO;AACtB,wBAAgB,QAAQ;AACxB;AAAA,MACF;AAEA,YAAM,MAAM,SAAS,QAAQ;AAC7B,UAAI,CAAC,QAAQ,IAAI,GAAG,KAAK,QAAQ,SAAS,UAAU;AAClD,gBAAQ,IAAI,GAAG;AACf,cAAM,KAAK,EAAE,OAAO,UAAU,MAAM,QAAQ,CAAC;AAAA,MAC/C;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAIA,SAAS,SAAS,MAAkB,MAA+B;AACjE,SAAO,KAAK,OAAO,CAAC,KAAK,SAAS;AAChC,UAAM,MAAM,KAAK,KAAK,OAAK,EAAE,SAAS,KAAK,IAAI;AAC/C,WAAO,OAAO,KAAK,QAAQ;AAAA,EAC7B,GAAG,CAAC;AACN;AAEA,SAAS,mBAAmB,MAAkB,MAA+B;AAC3E,SAAO,KAAK,OAAO,CAAC,OAAO,SAAS;AAClC,UAAM,MAAM,KAAK,KAAK,OAAK,EAAE,SAAS,KAAK,IAAI;AAC/C,WAAO,SAAS,KAAK,YAAY,IAAI;AAAA,EACvC,GAAG,CAAC;AACN;AAMO,SAAS,aACd,OACA,eACA,MACA,eACA,OAAoB,CAAC,GACT;AACZ,QAAM,QAAQ,KAAK,OAAO,eAAe,MAAM,eAAe,IAAI;AAElE,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,EAAE,OAAO,CAAC,GAAG,WAAW,GAAG,kBAAkB,EAAE;AAAA,EACxD;AAGA,MAAI,MAAM,WAAW,KAAK,MAAM,CAAC,EAAE,WAAW,GAAG;AAC/C,WAAO,EAAE,OAAO,CAAC,GAAG,WAAW,GAAG,kBAAkB,EAAE;AAAA,EACxD;AAEA,MAAI,WAAW,MAAM,CAAC;AACtB,MAAI,WAAW,SAAS,UAAU,IAAI;AACtC,MAAI,gBAAgB,mBAAmB,UAAU,IAAI;AAErD,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,OAAO,SAAS,MAAM,CAAC,GAAG,IAAI;AACpC,UAAM,YAAY,mBAAmB,MAAM,CAAC,GAAG,IAAI;AACnD,QAAI,OAAO,YAAa,SAAS,YAAY,YAAY,eAAgB;AACvE,iBAAW,MAAM,CAAC;AAClB,iBAAW;AACX,sBAAgB;AAAA,IAClB;AAAA,EACF;AAEA,SAAO;AAAA,IACL,OAAO;AAAA,IACP,WAAW;AAAA,IACX,kBAAkB,MAAM;AAAA,EAC1B;AACF;AAQO,SAAS,cACd,QACA,gBACA,cACA,OAAoB,CAAC,GACF;AACnB,QAAM,EAAE,MAAM,gBAAgB,cAAc,IAAI,kBAAkB,YAAY;AAC9E,QAAM,UAAU,KAAK,KAAK,OAAK,EAAE,SAAS,cAAc;AACxD,MAAI,CAAC,QAAS,QAAO;AAErB,MAAI,QAAQ,gBAAgB,QAAQ,cAAc;AAElD,QAAM,QAAQ,QAAQ,cAAc,OAAO,OAAK,CAAC,MAAM,IAAI,CAAC,CAAC;AAC7D,MAAI,MAAM,WAAW,EAAG,QAAO,CAAC,eAAe,cAAc,CAAC;AAE9D,QAAM,QAAoB,CAAC;AAC3B,QAAM,WAAW,oBAAI,IAAY;AAEjC,aAAW,WAAW,OAAO;AAC3B,QAAI,MAAM,IAAI,OAAO,EAAG;AACxB,UAAM,QAAQ,KAAK,OAAO,SAAS,MAAM,eAAe,IAAI;AAC5D,QAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,eAAW,QAAQ,MAAM,CAAC,GAAG;AAC3B,UAAI,SAAS,IAAI,KAAK,IAAI,CAAC,EAAG;AAC9B,eAAS,IAAI,KAAK,IAAI,CAAC;AACvB,YAAM,KAAK,IAAI;AACf,YAAM,SAAS,KAAK,KAAK,OAAK,EAAE,SAAS,KAAK,IAAI;AAClD,UAAI,OAAQ,SAAQ,aAAa,OAAO,QAAQ,KAAK,QAAQ,aAAa;AAAA,IAC5E;AAAA,EACF;AAEA,QAAM,KAAK,eAAe,cAAc,CAAC;AACzC,SAAO;AACT;AASO,SAAS,eACd,QACA,gBACA,OAAoB,CAAC,GACF;AACnB,QAAM,UAAU,OAAO,WAAW,CAAC;AACnC,MAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,QAAM,aAAa,QAAQ,KAAK,OAAK,EAAE,SAAS,cAAc;AAC9D,MAAI,CAAC,WAAY,QAAO;AAExB,QAAM,oBAAoB,WAAW,iBAAiB,CAAC;AAEvD,QAAM,EAAE,MAAM,gBAAgB,cAAc,IAAI,qBAAqB,OAAO;AAE5E,QAAM,QAAQ,gBAAgB,QAAQ,cAAc;AAEpD,QAAM,QAAQ,kBAAkB,OAAO,OAAK,CAAC,MAAM,IAAI,CAAC,CAAC;AACzD,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO;AAAA,MACL,OAAO,CAAC,eAAe,cAAc,CAAC;AAAA,MACtC,WAAW,WAAW,QAAQ;AAAA,MAC9B,kBAAkB;AAAA,IACpB;AAAA,EACF;AAGA,MAAI,eAAe;AACnB,QAAM,QAAoB,CAAC;AAC3B,QAAM,WAAW,oBAAI,IAAY;AACjC,MAAI,YAAY;AAEhB,aAAW,WAAW,OAAO;AAC3B,QAAI,aAAa,IAAI,OAAO,EAAG;AAC/B,UAAM,SAAS,aAAa,cAAc,SAAS,MAAM,eAAe,IAAI;AAC5E,QAAI,OAAO,MAAM,WAAW,KAAK,CAAC,aAAa,IAAI,OAAO,EAAG,QAAO;AACpE,eAAW,QAAQ,OAAO,OAAO;AAC/B,UAAI,SAAS,IAAI,KAAK,IAAI,CAAC,EAAG;AAC9B,eAAS,IAAI,KAAK,IAAI,CAAC;AACvB,YAAM,KAAK,IAAI;AACf,YAAM,SAAS,KAAK,KAAK,OAAK,EAAE,SAAS,KAAK,IAAI;AAClD,UAAI,QAAQ;AACV,qBAAa,OAAO;AACpB,uBAAe,aAAa,cAAc,QAAQ,KAAK,QAAQ,aAAa;AAAA,MAC9E;AAAA,IACF;AAAA,EACF;AAEA,QAAM,KAAK,eAAe,cAAc,CAAC;AACzC,eAAa,WAAW,QAAQ;AAEhC,SAAO,EAAE,OAAO,WAAW,kBAAkB,EAAE;AACjD;","names":[]}

package/package.json

@@ -0,0 +1,50 @@
+{
+  "name": "@lokascript/planner",
+  "version": "2.4.0",
+  "description": "BFS planner over affordance graphs — cost-aware planning with preconditions, effects, and template parameters",
+  "type": "module",
+  "main": "dist/index.cjs",
+  "module": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js",
+      "require": "./dist/index.cjs"
+    }
+  },
+  "scripts": {
+    "build": "tsup",
+    "dev": "tsup --watch",
+    "test": "vitest run",
+    "test:watch": "vitest",
+    "test:check": "vitest run --reporter=dot 2>&1 | tail -5",
+    "typecheck": "tsc --noEmit"
+  },
+  "author": "LokaScript Contributors",
+  "license": "MIT",
+  "devDependencies": {
+    "tsup": "^8.0.0",
+    "typescript": "^5.0.0",
+    "vitest": "^4.1.5"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/codetalcott/hyperfixi.git",
+    "directory": "packages/planner"
+  },
+  "bugs": {
+    "url": "https://github.com/codetalcott/hyperfixi/issues"
+  },
+  "engines": {
+    "node": ">=18.0.0"
+  },
+  "sideEffects": false,
+  "files": [
+    "dist",
+    "src"
+  ],
+  "publishConfig": {
+    "access": "public"
+  }
+}