@suss/adapter-ruby 0.18.0 → 0.20.0

package/dist/index.js

@@ -12,6 +12,9 @@ function rangeOf(node) {
     end: node.endPosition.row + 1
   };
 }
+function spanOf(node) {
+  return { start: node.startIndex, end: node.endIndex };
+}
 function field(node, name) {
   return node.childForFieldName(name);
 }
@@ -731,6 +734,9 @@ function invocationEffects(definitionNode) {
   });
 }
 
+// src/storage.ts
+import { deriveOnDemand, evaluate } from "@suss/datalog";
+
 // ../../../node_modules/zod/v4/classic/external.js
 var external_exports = {};
 __export(external_exports, {
@@ -1411,8 +1417,8 @@ function assertNever(_x) {
 function assert(_) {
 }
 function getEnumValues(entries) {
-  const numericValues = Object.values(entries).filter((v) => typeof v === "number");
-  const values = Object.entries(entries).filter(([k, _]) => numericValues.indexOf(+k) === -1).map(([_, v]) => v);
+  const numericValues = Object.values(entries).filter((v2) => typeof v2 === "number");
+  const values = Object.entries(entries).filter(([k, _]) => numericValues.indexOf(+k) === -1).map(([_, v2]) => v2);
   return values;
 }
 function joinValues(array2, separator = "|") {
@@ -1466,9 +1472,9 @@ function defineLazy(object2, key, getter) {
       }
       return value;
     },
-    set(v) {
+    set(v2) {
       Object.defineProperty(object2, key, {
-        value: v
+        value: v2
         // configurable: true,
       });
     },
@@ -3155,10 +3161,10 @@ var $ZodUUID = /* @__PURE__ */ $constructor("$ZodUUID", (inst, def) => {
       v7: 7,
       v8: 8
     };
-    const v = versionMap[def.version];
-    if (v === void 0)
+    const v2 = versionMap[def.version];
+    if (v2 === void 0)
       throw new Error(`Invalid UUID version: "${def.version}"`);
-    def.pattern ?? (def.pattern = uuid(v));
+    def.pattern ?? (def.pattern = uuid(v2));
   } else
     def.pattern ?? (def.pattern = uuid());
   $ZodStringFormat.init(inst, def);
@@ -3763,8 +3769,8 @@ var $ZodObject = /* @__PURE__ */ $constructor("$ZodObject", (inst, def) => {
       const field2 = shape[key]._zod;
       if (field2.values) {
         propValues[key] ?? (propValues[key] = /* @__PURE__ */ new Set());
-        for (const v of field2.values)
-          propValues[key].add(v);
+        for (const v2 of field2.values)
+          propValues[key].add(v2);
       }
     }
     return propValues;
@@ -4059,10 +4065,10 @@ var $ZodDiscriminatedUnion = /* @__PURE__ */ $constructor("$ZodDiscriminatedUnio
       const pv = option._zod.propValues;
       if (!pv || Object.keys(pv).length === 0)
         throw new Error(`Invalid discriminated union option at index "${def.options.indexOf(option)}"`);
-      for (const [k, v] of Object.entries(pv)) {
+      for (const [k, v2] of Object.entries(pv)) {
         if (!propValues[k])
           propValues[k] = /* @__PURE__ */ new Set();
-        for (const val of v) {
+        for (const val of v2) {
           propValues[k].add(val);
         }
       }
@@ -4076,11 +4082,11 @@ var $ZodDiscriminatedUnion = /* @__PURE__ */ $constructor("$ZodDiscriminatedUnio
       const values = o._zod.propValues?.[def.discriminator];
       if (!values || values.size === 0)
         throw new Error(`Invalid discriminated union option at index "${def.options.indexOf(o)}"`);
-      for (const v of values) {
-        if (map2.has(v)) {
-          throw new Error(`Duplicate discriminator value "${String(v)}"`);
+      for (const v2 of values) {
+        if (map2.has(v2)) {
+          throw new Error(`Duplicate discriminator value "${String(v2)}"`);
         }
-        map2.set(v, o);
+        map2.set(v2, o);
       }
     }
     return map2;
@@ -4719,8 +4725,8 @@ var $ZodPrefault = /* @__PURE__ */ $constructor("$ZodPrefault", (inst, def) => {
 var $ZodNonOptional = /* @__PURE__ */ $constructor("$ZodNonOptional", (inst, def) => {
   $ZodType.init(inst, def);
   defineLazy(inst._zod, "values", () => {
-    const v = def.innerType._zod.values;
-    return v ? new Set([...v].filter((x) => x !== void 0)) : void 0;
+    const v2 = def.innerType._zod.values;
+    return v2 ? new Set([...v2].filter((x) => x !== void 0)) : void 0;
   });
   inst._zod.parse = (payload, ctx) => {
     const result = def.innerType._zod.run(payload, ctx);
@@ -7117,7 +7123,7 @@ var error17 = () => {
         if (issue2.values.length === 1) {
           return `\u05E2\u05E8\u05DA \u05DC\u05D0 \u05EA\u05E7\u05D9\u05DF: \u05D4\u05E2\u05E8\u05DA \u05D7\u05D9\u05D9\u05D1 \u05DC\u05D4\u05D9\u05D5\u05EA ${stringifyPrimitive(issue2.values[0])}`;
         }
-        const stringified = issue2.values.map((v) => stringifyPrimitive(v));
+        const stringified = issue2.values.map((v2) => stringifyPrimitive(v2));
         if (issue2.values.length === 2) {
           return `\u05E2\u05E8\u05DA \u05DC\u05D0 \u05EA\u05E7\u05D9\u05DF: \u05D4\u05D0\u05E4\u05E9\u05E8\u05D5\u05D9\u05D5\u05EA \u05D4\u05DE\u05EA\u05D0\u05D9\u05DE\u05D5\u05EA \u05D4\u05DF ${stringified[0]} \u05D0\u05D5 ${stringified[1]}`;
         }
@@ -11872,7 +11878,7 @@ function _set(Class2, valueType, params) {
 }
 // @__NO_SIDE_EFFECTS__
 function _enum(Class2, values, params) {
-  const entries = Array.isArray(values) ? Object.fromEntries(values.map((v) => [v, v])) : values;
+  const entries = Array.isArray(values) ? Object.fromEntries(values.map((v2) => [v2, v2])) : values;
   return new Class2({
     type: "enum",
     entries,
@@ -12077,8 +12083,8 @@ function _stringbool(Classes, _params) {
   let truthyArray = params.truthy ?? ["true", "1", "yes", "on", "y", "enabled"];
   let falsyArray = params.falsy ?? ["false", "0", "no", "off", "n", "disabled"];
   if (params.case !== "sensitive") {
-    truthyArray = truthyArray.map((v) => typeof v === "string" ? v.toLowerCase() : v);
-    falsyArray = falsyArray.map((v) => typeof v === "string" ? v.toLowerCase() : v);
+    truthyArray = truthyArray.map((v2) => typeof v2 === "string" ? v2.toLowerCase() : v2);
+    falsyArray = falsyArray.map((v2) => typeof v2 === "string" ? v2.toLowerCase() : v2);
   }
   const truthySet = new Set(truthyArray);
   const falsySet = new Set(falsyArray);
@@ -12620,9 +12626,9 @@ var dateProcessor = (_schema, ctx, _json, _params) => {
 var enumProcessor = (schema, _ctx, json2, _params) => {
   const def = schema._zod.def;
   const values = getEnumValues(def.entries);
-  if (values.every((v) => typeof v === "number"))
+  if (values.every((v2) => typeof v2 === "number"))
     json2.type = "number";
-  if (values.every((v) => typeof v === "string"))
+  if (values.every((v2) => typeof v2 === "string"))
     json2.type = "string";
   json2.enum = values;
 };
@@ -12655,13 +12661,13 @@ var literalProcessor = (schema, ctx, json2, _params) => {
       json2.const = val;
     }
   } else {
-    if (vals.every((v) => typeof v === "number"))
+    if (vals.every((v2) => typeof v2 === "number"))
       json2.type = "number";
-    if (vals.every((v) => typeof v === "string"))
+    if (vals.every((v2) => typeof v2 === "string"))
       json2.type = "string";
-    if (vals.every((v) => typeof v === "boolean"))
+    if (vals.every((v2) => typeof v2 === "boolean"))
       json2.type = "boolean";
-    if (vals.every((v) => v === null))
+    if (vals.every((v2) => v2 === null))
       json2.type = "null";
     json2.enum = vals;
   }
@@ -12759,11 +12765,11 @@ var objectProcessor = (schema, ctx, _json, params) => {
   }
   const allKeys = new Set(Object.keys(shape));
   const requiredKeys = new Set([...allKeys].filter((key) => {
-    const v = def.shape[key]._zod;
+    const v2 = def.shape[key]._zod;
     if (ctx.io === "input") {
-      return v.optin === void 0;
+      return v2.optin === void 0;
     } else {
-      return v.optout === void 0;
+      return v2.optout === void 0;
     }
   }));
   if (requiredKeys.size > 0) {
@@ -12883,7 +12889,7 @@ var recordProcessor = (schema, ctx, _json, params) => {
   }
   const keyValues = keyType._zod.values;
   if (keyValues) {
-    const validKeyValues = [...keyValues].filter((v) => typeof v === "string" || typeof v === "number");
+    const validKeyValues = [...keyValues].filter((v2) => typeof v2 === "string" || typeof v2 === "number");
     if (validKeyValues.length > 0) {
       json2.required = validKeyValues;
     }
@@ -13448,12 +13454,12 @@ function _installLazyMethods(inst, group, methods) {
         });
         return bound;
       },
-      set(v) {
+      set(v2) {
         Object.defineProperty(this, key, {
           configurable: true,
           writable: true,
           enumerable: true,
-          value: v
+          value: v2
         });
       }
     });
@@ -14341,7 +14347,7 @@ var ZodEnum = /* @__PURE__ */ $constructor("ZodEnum", (inst, def) => {
   };
 });
 function _enum2(values, params) {
-  const entries = Array.isArray(values) ? Object.fromEntries(values.map((v) => [v, v])) : values;
+  const entries = Array.isArray(values) ? Object.fromEntries(values.map((v2) => [v2, v2])) : values;
   return new ZodEnum({
     type: "enum",
     entries,
@@ -14895,10 +14901,10 @@ function convertBaseSchema(schema, ctx) {
     if (enumValues.length === 1) {
       return z.literal(enumValues[0]);
     }
-    if (enumValues.every((v) => typeof v === "string")) {
+    if (enumValues.every((v2) => typeof v2 === "string")) {
       return z.enum(enumValues);
     }
-    const literalSchemas = enumValues.map((v) => z.literal(v));
+    const literalSchemas = enumValues.map((v2) => z.literal(v2));
     if (literalSchemas.length < 2) {
       return literalSchemas[0];
     }
@@ -15245,7 +15251,7 @@ function date4(params) {
 // ../../../node_modules/zod/v4/classic/external.js
 config(en_default());
 
-// ../../ir-core/dist/chunk-HSJYPBJU.js
+// ../../ir-core/dist/chunk-52CH76PE.js
 function gqlIdentityKey(typeName, fieldName) {
   return `gql:${typeName}.${fieldName}`;
 }
@@ -15309,14 +15315,24 @@ var functionCallSemantics = defineBoundarySemantics({
      */
     canPair: () => true,
     /**
-     * `"fn:<package>::<exportPath>"` when both are set. Other in-process
-     * function-call units, such as components and bare handlers inside
-     * one repo, have no key at all.
+     * `"fn:<package>::<exportPath>"` when both are set, and
+     * `"fn:<module>::<exportName>"` for an in-repo unit that states its
+     * module, the way a server action does. Components and bare
+     * handlers state neither and have no key at all.
      */
+    rewritePaths(semantics, rewrite) {
+      if (semantics.module === void 0) {
+        return semantics;
+      }
+      return { ...semantics, module: rewrite(semantics.module) };
+    },
     identityKey(semantics) {
       if (semantics.package !== void 0 && semantics.exportPath !== void 0 && semantics.exportPath.length > 0) {
         return fnIdentityKey(semantics.package, semantics.exportPath);
       }
+      if (semantics.module !== void 0 && semantics.exportName !== void 0) {
+        return fnIdentityKey(semantics.module, [semantics.exportName]);
+      }
       return null;
     }
   }
@@ -15827,7 +15843,16 @@ var ConfidenceInfoSchema = external_exports.object({
 });
 var SourceLocationSchema = external_exports.object({
   file: external_exports.string(),
+  /** Line numbers, for a person reading the summary or an editor link. */
   range: external_exports.object({ start: external_exports.number(), end: external_exports.number() }),
+  /**
+   * Character offsets of the unit in its file. Identity and joins
+   * measure with these, since two functions can share a line and never
+   * an offset range; the line `range` above is the presentation of the
+   * same place. Absent on summaries no source position backs, a
+   * contract artifact's say.
+   */
+  span: external_exports.object({ start: external_exports.number(), end: external_exports.number() }).optional(),
   exportName: external_exports.string().nullable(),
   /**
    * The project the extract was pointed at, by the name that project
@@ -15952,6 +15977,733 @@ function storageBinding(opts) {
   };
 }
 
+// ../../resolution/dist/index.js
+import { ruleLabel } from "@suss/datalog";
+import { constant, lit, rule, variable as v } from "@suss/datalog";
+var VALUE_STEP = constant("value");
+var NAMESPACE_IMPORT_NAME = "*";
+var NAMESPACE_IMPORT = constant(NAMESPACE_IMPORT_NAME);
+var RESULT_STEP = constant("result");
+var RESOLUTION_RULES = [
+  // Aliasing: const x = y, or an identifier referencing a declaration.
+  // A language with a hop of its own, like JavaScript's `.bind`, states
+  // it as a step too, or every question but `comesTo` misses it.
+  rule(
+    "stepsTo",
+    [v("x"), v("y"), VALUE_STEP],
+    [lit("binds", v("x"), v("y"))],
+    "alias"
+  ),
+  // A name written more than once has the value the last write left
+  // there. The adapter works out which write that is and stays quiet
+  // when control flow decides, so such a name steps nowhere at all.
+  rule(
+    "stepsTo",
+    [v("x"), v("y"), VALUE_STEP],
+    [lit("endsHolding", v("x"), v("y"))],
+    "last write"
+  ),
+  // A fallback says the value is one of its branches, so each branch is
+  // a step. A branch that resolves to nothing makes no claim, and two
+  // branches resolving to different things fail the single-answer policy.
+  rule(
+    "stepsTo",
+    [v("x"), v("b"), VALUE_STEP],
+    [lit("fallbackBranch", v("x"), v("b"))],
+    "fallback"
+  ),
+  // An import steps to what the module exports under that name.
+  rule(
+    "stepsTo",
+    [v("x"), v("value"), VALUE_STEP],
+    [
+      lit("imports", v("x"), v("m"), v("n")),
+      lit("moduleExport", v("m"), v("n"), v("value"))
+    ],
+    "import"
+  ),
+  // A parameter steps to what a call passes it. A function called from
+  // several places leaves its parameter with more than one value, and a
+  // caller that needs those apart asks `paramAt`.
+  rule(
+    "stepsTo",
+    [v("p"), v("a"), VALUE_STEP],
+    [lit("passesArgument", v("r"), v("p"), v("a"))],
+    "argument"
+  ),
+  // Reading a property steps to what the object contains under that
+  // name, whichever way the object arrived: `routes.list` off a name,
+  // or `make(body).handle` off a call.
+  rule(
+    "stepsTo",
+    [v("x"), v("held"), VALUE_STEP],
+    [
+      lit("readsProperty", v("x"), v("o"), v("n")),
+      lit("objectOf", v("o"), v("obj")),
+      lit("contains", v("obj"), v("n"), v("held"))
+    ],
+    "property read"
+  ),
+  // Calling a class makes one of it, so the call steps to the class and
+  // a method read off the result is the one the class declares. The
+  // caveat below is about a factory function, and a class is not one.
+  rule(
+    "stepsTo",
+    [v("r"), v("cls"), VALUE_STEP],
+    [
+      lit("call", v("r"), v("c")),
+      lit("comesTo", v("c"), v("cls")),
+      lit("objectValue", v("cls"))
+    ],
+    "class instance"
+  ),
+  // Wrapper transparency, derived: calling a factory that returns a
+  // function which calls its parameter k steps to argument k.
+  rule(
+    "stepsTo",
+    [v("r"), v("a"), VALUE_STEP],
+    [
+      lit("call", v("r"), v("c")),
+      lit("comesTo", v("c"), v("f")),
+      lit("unwraps", v("f"), v("k")),
+      lit("callArg", v("r"), v("k"), v("a"))
+    ],
+    "factory unwrap"
+  ),
+  // Wrapper transparency, declared: a pack says this callee wraps
+  // argument k. The callee has to come from the library the pack said,
+  // so a local object spelled the same way is not mistaken for it.
+  rule(
+    "stepsTo",
+    [v("r"), v("a"), VALUE_STEP],
+    [
+      lit("calleeName", v("r"), v("n")),
+      lit("unwrapsByName", v("n"), v("k")),
+      lit("wrapperModule", v("n"), v("m")),
+      lit("calleeOrigin", v("r"), v("m")),
+      lit("callArg", v("r"), v("k"), v("a"))
+    ],
+    "declared wrapper"
+  ),
+  // The one step that runs a function forwards: a call steps to what
+  // the function it invokes returns.
+  rule(
+    "stepsTo",
+    [v("r"), v("ret"), RESULT_STEP],
+    [lit("invokes", v("r"), v("f")), lit("returnsValue", v("f"), v("ret"))],
+    "call result"
+  ),
+  // Where a walk gets to, and whether it ran a call on the way. A value
+  // step keeps whatever the rest of the walk was, and a result step
+  // makes the whole walk one that ran a call.
+  rule(
+    "reaches",
+    [v("x"), v("z"), v("kind")],
+    [lit("stepsTo", v("x"), v("z"), v("kind"))]
+  ),
+  rule(
+    "reaches",
+    [v("x"), v("z"), v("kind")],
+    [
+      lit("stepsTo", v("x"), v("y"), VALUE_STEP),
+      lit("reaches", v("y"), v("z"), v("kind"))
+    ]
+  ),
+  // Two rules rather than one leaving the rest of the walk's kind free.
+  // A free kind is a second question about the same relation, and a
+  // demand-driven run then derives both to answer either.
+  rule(
+    "reaches",
+    [v("x"), v("z"), RESULT_STEP],
+    [
+      lit("stepsTo", v("x"), v("y"), RESULT_STEP),
+      lit("reaches", v("y"), v("z"), VALUE_STEP)
+    ]
+  ),
+  rule(
+    "reaches",
+    [v("x"), v("z"), RESULT_STEP],
+    [
+      lit("stepsTo", v("x"), v("y"), RESULT_STEP),
+      lit("reaches", v("y"), v("z"), RESULT_STEP)
+    ]
+  ),
+  // What a value comes down to: the walk that never ran a call, stopped
+  // at a function or an object. Something already written out comes to
+  // itself, and every other walk ends at one of those.
+  rule("comesTo", [v("x"), v("x")], [lit("func", v("x"))]),
+  rule("comesTo", [v("x"), v("x")], [lit("objectValue", v("x"))]),
+  rule(
+    "comesTo",
+    [v("x"), v("z")],
+    [lit("reaches", v("x"), v("z"), VALUE_STEP), lit("func", v("z"))]
+  ),
+  rule(
+    "comesTo",
+    [v("x"), v("z")],
+    [lit("reaches", v("x"), v("z"), VALUE_STEP), lit("objectValue", v("z"))]
+  ),
+  // The same stopping condition, for the walk that ran a call. A call
+  // gets no `comesTo` answer on purpose: coming back with what a
+  // factory returned would fight the unwrapping answer.
+  rule(
+    "givesBack",
+    [v("x"), v("z")],
+    [lit("reaches", v("x"), v("z"), RESULT_STEP), lit("func", v("z"))]
+  ),
+  rule(
+    "givesBack",
+    [v("x"), v("z")],
+    [lit("reaches", v("x"), v("z"), RESULT_STEP), lit("objectValue", v("z"))]
+  ),
+  // Following a value to the expression it is written as, whatever kind
+  // that is. A GraphQL document is neither a function nor an object, so
+  // `comesTo` never reaches one.
+  rule("isWrittenAs", [v("x"), v("x")], [lit("writtenValue", v("x"))]),
+  rule("isWrittenAs", [v("x"), v("x")], [lit("objectValue", v("x"))]),
+  rule(
+    "isWrittenAs",
+    [v("x"), v("z")],
+    [lit("reaches", v("x"), v("z"), VALUE_STEP), lit("writtenValue", v("z"))]
+  ),
+  rule(
+    "isWrittenAs",
+    [v("x"), v("z")],
+    [lit("reaches", v("x"), v("z"), VALUE_STEP), lit("objectValue", v("z"))]
+  ),
+  // What one call site put in a parameter, told apart from what the
+  // other callers passed.
+  rule(
+    "paramAt",
+    [v("r"), v("p"), v("z")],
+    [
+      lit("passesArgument", v("r"), v("p"), v("a")),
+      lit("comesTo", v("a"), v("z"))
+    ]
+  ),
+  // An argument arriving at the parameter it is passed to, by position
+  // or by the name the caller wrote, keeping the call it went through
+  // so `paramAt` can tell two call sites apart.
+  rule(
+    "passesArgument",
+    [v("r"), v("p"), v("a")],
+    [
+      lit("paramOf", v("f"), v("k"), v("p")),
+      lit("callsFunction", v("r"), v("f")),
+      lit("callArg", v("r"), v("k"), v("a"))
+    ]
+  ),
+  rule(
+    "passesArgument",
+    [v("r"), v("p"), v("a")],
+    [
+      lit("paramNamed", v("f"), v("n"), v("p")),
+      lit("callsFunction", v("r"), v("f")),
+      lit("callKeywordArg", v("r"), v("n"), v("a"))
+    ]
+  ),
+  // Which module's export a re-exported name forwards to, however
+  // many barrels deep the forwarding runs.
+  rule(
+    "moduleForwards",
+    [v("m"), v("n"), v("m2"), v("n2")],
+    [lit("reExports", v("m"), v("n"), v("m2"), v("n2"))]
+  ),
+  rule(
+    "moduleForwards",
+    [v("m"), v("n"), v("m3"), v("n3")],
+    [
+      lit("reExports", v("m"), v("n"), v("m2"), v("n2")),
+      lit("moduleForwards", v("m2"), v("n2"), v("m3"), v("n3"))
+    ]
+  ),
+  // What a module exports: directly, or through re-export chains.
+  rule(
+    "moduleExport",
+    [v("m"), v("n"), v("value")],
+    [lit("exportsAs", v("m"), v("n"), v("value"))],
+    "export"
+  ),
+  rule(
+    "moduleExport",
+    [v("m"), v("n"), v("value")],
+    [
+      lit("reExports", v("m"), v("n"), v("m2"), v("n2")),
+      lit("moduleExport", v("m2"), v("n2"), v("value"))
+    ],
+    "re-export"
+  ),
+  rule(
+    "moduleExport",
+    [v("m"), v("n"), v("value")],
+    [
+      lit("reExportsAll", v("m"), v("m2")),
+      lit("moduleExport", v("m2"), v("n"), v("value"))
+    ],
+    "re-export all"
+  ),
+  // The function a call runs, written from the call's side because a
+  // caller asking what a call gives back has the call in hand.
+  rule(
+    "invokes",
+    [v("r"), v("f")],
+    [lit("call", v("r"), v("c")), lit("comesTo", v("c"), v("f"))]
+  ),
+  // The callee is itself a call: `daoBuilder()()`.
+  rule(
+    "invokes",
+    [v("r"), v("f")],
+    [lit("call", v("r"), v("c")), lit("givesBack", v("c"), v("f"))]
+  ),
+  // The object an expression refers to: a name through `comesTo`, a
+  // factory call through what it gives back. Naming the step is what
+  // makes `routes.list` and `make(body).handle` one rule.
+  rule(
+    "objectOf",
+    [v("o"), v("obj")],
+    [lit("comesTo", v("o"), v("obj")), lit("objectValue", v("obj"))]
+  ),
+  rule(
+    "objectOf",
+    [v("x"), v("obj")],
+    [lit("givesBack", v("x"), v("obj")), lit("objectValue", v("obj"))]
+  ),
+  // Which calls a function, found by the name the call is written as
+  // rather than by resolving every callee in the project. A caller knows
+  // the function and wants its call sites, so both of these start from
+  // the function. Starting from `call` instead asks what every call in
+  // the project imports, which was 72% of everything derived.
+  rule(
+    "callsFunction",
+    [v("r"), v("f")],
+    [lit("binds", v("c"), v("f")), lit("call", v("r"), v("c"))]
+  ),
+  rule(
+    "callsFunction",
+    [v("r"), v("f")],
+    [
+      lit("moduleExport", v("m"), v("n"), v("f")),
+      lit("imports", v("c"), v("m"), v("n")),
+      lit("call", v("r"), v("c"))
+    ]
+  ),
+  // The same, for a language whose adapter writes the import down as a
+  // declaration and the call's callee as the name referring to it.
+  rule(
+    "callsFunction",
+    [v("r"), v("f")],
+    [
+      lit("moduleExport", v("m"), v("n"), v("f")),
+      lit("imports", v("d"), v("m"), v("n")),
+      lit("binds", v("c"), v("d")),
+      lit("call", v("r"), v("c"))
+    ]
+  ),
+  // What an object contains, its base class included, so a method the base
+  // declares is found on a subclass that never overrode it. A method both
+  // declare gives two, and the caller decides. This is its own relation
+  // rather than more `holdsProperty`, which stays something an adapter
+  // states and the rules only read.
+  rule(
+    "contains",
+    [v("o"), v("n"), v("held")],
+    [lit("holdsProperty", v("o"), v("n"), v("held"))]
+  ),
+  rule(
+    "contains",
+    [v("cls"), v("n"), v("held")],
+    [
+      lit("extends", v("cls"), v("base")),
+      lit("comesTo", v("base"), v("baseCls")),
+      lit("contains", v("baseCls"), v("n"), v("held"))
+    ]
+  ),
+  // Which function a factory returns, and which of its parameters that
+  // function calls: together they are what makes it a wrapper.
+  rule(
+    "returnsFunc",
+    [v("f"), v("g")],
+    [
+      lit("returnsValue", v("f"), v("value")),
+      lit("comesTo", v("value"), v("g")),
+      lit("func", v("g"))
+    ]
+  ),
+  // A call made by a nested closure counts as made by the function
+  // that declares it; the closure runs as part of that function.
+  rule("bodyCallsDeep", [v("f"), v("c")], [lit("bodyCalls", v("f"), v("c"))]),
+  rule(
+    "bodyCallsDeep",
+    [v("f"), v("c")],
+    [lit("containsFn", v("f"), v("g")), lit("bodyCallsDeep", v("g"), v("c"))]
+  ),
+  rule(
+    "unwraps",
+    [v("f"), v("k")],
+    [
+      lit("returnsFunc", v("f"), v("g")),
+      lit("bodyCallsDeep", v("g"), v("c")),
+      lit("binds", v("c"), v("p")),
+      lit("paramOf", v("f"), v("k"), v("p"))
+    ]
+  ),
+  // Argument flow: which parameter a value traces back to. Directly
+  // (an identifier bound to the parameter), or through a call to
+  // another unwrapping factory. This is what lets
+  // `createProtected(h) { return service.withAuth(h); }` unwrap:
+  // the returned call passes h through withAuth, which unwraps.
+  rule(
+    "flowsToParam",
+    [v("x"), v("p")],
+    [
+      lit("binds", v("x"), v("p")),
+      lit("paramOf", v("anyF"), v("anyK"), v("p"))
+    ]
+  ),
+  rule(
+    "flowsToParam",
+    [v("r"), v("p")],
+    [
+      lit("call", v("r"), v("c")),
+      lit("comesTo", v("c"), v("f")),
+      lit("unwraps", v("f"), v("k")),
+      lit("callArg", v("r"), v("k"), v("a")),
+      lit("flowsToParam", v("a"), v("p"))
+    ]
+  ),
+  rule(
+    "unwraps",
+    [v("f"), v("k")],
+    [
+      lit("returnsValue", v("f"), v("value")),
+      lit("flowsToParam", v("value"), v("p")),
+      lit("paramOf", v("f"), v("k"), v("p"))
+    ]
+  ),
+  // Where a name comes from, when what it refers to lives outside the
+  // source being read. A walk ends at something written out in source,
+  // so it never reaches a library's own function.
+  rule(
+    "comesFrom",
+    [v("x"), v("m"), v("n")],
+    [lit("imports", v("x"), v("m"), v("n"))]
+  ),
+  rule(
+    "comesFrom",
+    [v("x"), v("m"), v("n")],
+    [
+      lit("reaches", v("x"), v("y"), VALUE_STEP),
+      lit("imports", v("y"), v("m"), v("n"))
+    ]
+  ),
+  // Calling f ends up calling the name n that module m exports, one
+  // hop through f's own body or deeper through a wrapper of a wrapper.
+  // Several results is normal: a composed decorator applies them all.
+  rule(
+    "callsInto",
+    [v("f"), v("m"), v("n")],
+    [
+      lit("bodyCallsDeep", v("f"), v("c")),
+      lit("comesFrom", v("c"), v("m"), v("n"))
+    ]
+  ),
+  rule(
+    "callsInto",
+    [v("f"), v("m"), v("n")],
+    [
+      lit("bodyCallsDeep", v("f"), v("c")),
+      lit("comesTo", v("c"), v("g")),
+      lit("callsInto", v("g"), v("m"), v("n"))
+    ]
+  ),
+  // The question callers ask: what a value comes to, narrowed to the
+  // functions. Objects appear in the middle of chains and never in an
+  // answer.
+  rule(
+    "resolves",
+    [v("x"), v("z")],
+    [lit("comesTo", v("x"), v("z")), lit("func", v("z"))]
+  )
+];
+var RESOLUTION_QUESTIONS = [
+  rule(
+    "wantedResolves",
+    [v("x"), v("z")],
+    [lit("wanted", v("x")), lit("resolves", v("x"), v("z"))]
+  ),
+  rule(
+    "wantedComesTo",
+    [v("x"), v("z")],
+    [lit("wanted", v("x")), lit("comesTo", v("x"), v("z"))]
+  ),
+  rule(
+    "wantedComesTo",
+    [v("x"), v("z")],
+    [lit("wantedOrigin", v("x")), lit("comesTo", v("x"), v("z"))]
+  ),
+  rule(
+    "wantedIsWrittenAs",
+    [v("x"), v("z")],
+    [lit("wanted", v("x")), lit("isWrittenAs", v("x"), v("z"))]
+  ),
+  // A call is given no `comesTo`, so this is the only way to ask what
+  // object one arrives at, and without it a demand-driven run derives
+  // `objectOf` nowhere.
+  rule(
+    "wantedObjectOf",
+    [v("x"), v("z")],
+    [lit("wanted", v("x")), lit("objectOf", v("x"), v("z"))]
+  ),
+  // Keyed by the parameter, since that is what a caller has in hand
+  // when it wants the call sites told apart.
+  rule(
+    "wantedParamAt",
+    [v("p"), v("r"), v("z")],
+    [lit("wanted", v("p")), lit("paramAt", v("r"), v("p"), v("z"))]
+  ),
+  rule(
+    "wantedComesFrom",
+    [v("x"), v("m"), v("n")],
+    [lit("wantedOrigin", v("x")), lit("comesFrom", v("x"), v("m"), v("n"))]
+  ),
+  // Call-origin questions, for attribution, in their own demand
+  // class. Attribution stops at the import declaration, so nothing
+  // here demands reaches or callsInto. The chains are closures with
+  // no depth bound: an alias run of any length resolves.
+  rule("callOriginChain", [v("x"), v("x")], [lit("wantedCallOrigin", v("x"))]),
+  rule(
+    "callOriginChain",
+    [v("x"), v("z")],
+    [lit("callOriginChain", v("x"), v("y")), lit("binds", v("y"), v("z"))]
+  ),
+  rule(
+    "callOriginChain",
+    [v("x"), v("z")],
+    [
+      lit("callOriginChain", v("x"), v("y")),
+      lit("endsHolding", v("y"), v("z"))
+    ]
+  ),
+  rule(
+    "callOriginChain",
+    [v("x"), v("z")],
+    [
+      lit("callOriginChain", v("x"), v("y")),
+      lit("fallbackBranch", v("y"), v("z"))
+    ]
+  ),
+  // The chain with at least one hop taken, which is what tells a
+  // destructured binding apart from asking about a node directly.
+  rule(
+    "callOriginChainStepped",
+    [v("x"), v("z")],
+    [lit("callOriginChain", v("x"), v("y")), lit("binds", v("y"), v("z"))]
+  ),
+  rule(
+    "callOriginChainStepped",
+    [v("x"), v("z")],
+    [
+      lit("callOriginChain", v("x"), v("y")),
+      lit("endsHolding", v("y"), v("z"))
+    ]
+  ),
+  rule(
+    "callOriginChainStepped",
+    [v("x"), v("z")],
+    [
+      lit("callOriginChain", v("x"), v("y")),
+      lit("fallbackBranch", v("y"), v("z"))
+    ]
+  ),
+  rule(
+    "wantedCallOriginPair",
+    [v("x"), v("m"), v("n")],
+    [
+      lit("callOriginChain", v("x"), v("y")),
+      lit("imports", v("y"), v("m"), v("n"))
+    ]
+  ),
+  // An import of a project barrel is an import of what the barrel
+  // forwards, so the pair surfaces the module behind the chain.
+  rule(
+    "wantedCallOriginPair",
+    [v("x"), v("m2"), v("n2")],
+    [
+      lit("callOriginChain", v("x"), v("y")),
+      lit("imports", v("y"), v("m"), v("n")),
+      lit("moduleForwards", v("m"), v("n"), v("m2"), v("n2"))
+    ]
+  ),
+  // A namespace member: the module's export of the member's own name.
+  // The imports literal leads, since it is the smallest relation.
+  rule(
+    "wantedCallOriginPair",
+    [v("x"), v("m"), v("p")],
+    [
+      lit("imports", v("o"), v("m"), NAMESPACE_IMPORT),
+      lit("readsProperty", v("y"), v("o"), v("p")),
+      lit("callOriginChain", v("x"), v("y"))
+    ]
+  ),
+  rule(
+    "wantedCallOriginPair",
+    [v("x"), v("m"), v("p")],
+    [
+      lit("imports", v("d"), v("m"), NAMESPACE_IMPORT),
+      lit("binds", v("o"), v("d")),
+      lit("readsProperty", v("y"), v("o"), v("p")),
+      lit("callOriginChain", v("x"), v("y"))
+    ]
+  ),
+  // What a call made: through the call to its callee, whose own alias
+  // chain leads to the import.
+  rule(
+    "callMadeChain",
+    [v("x"), v("f")],
+    [lit("callOriginChain", v("x"), v("c")), lit("call", v("c"), v("f"))]
+  ),
+  rule(
+    "callMadeChain",
+    [v("x"), v("z")],
+    [lit("callMadeChain", v("x"), v("y")), lit("binds", v("y"), v("z"))]
+  ),
+  rule(
+    "callMadeChain",
+    [v("x"), v("z")],
+    [lit("callMadeChain", v("x"), v("y")), lit("endsHolding", v("y"), v("z"))]
+  ),
+  rule(
+    "wantedCallOriginPair",
+    [v("x"), v("m"), v("n")],
+    [
+      lit("callMadeChain", v("x"), v("y")),
+      lit("imports", v("y"), v("m"), v("n"))
+    ]
+  ),
+  // A member destructured off what a call made keeps the member name
+  // as one more path segment.
+  rule(
+    "callMemberChain",
+    [v("x"), v("f"), v("p")],
+    [
+      lit("callOriginChainStepped", v("x"), v("e")),
+      lit("readsProperty", v("e"), v("c"), v("p")),
+      lit("call", v("c"), v("f"))
+    ]
+  ),
+  rule(
+    "callMemberChain",
+    [v("x"), v("z"), v("p")],
+    [
+      lit("callMemberChain", v("x"), v("y"), v("p")),
+      lit("binds", v("y"), v("z"))
+    ]
+  ),
+  rule(
+    "callMemberChain",
+    [v("x"), v("z"), v("p")],
+    [
+      lit("callMemberChain", v("x"), v("y"), v("p")),
+      lit("endsHolding", v("y"), v("z"))
+    ]
+  ),
+  rule(
+    "wantedCallOriginMember",
+    [v("x"), v("m"), v("n"), v("p")],
+    [
+      lit("callMemberChain", v("x"), v("y"), v("p")),
+      lit("imports", v("y"), v("m"), v("n"))
+    ]
+  ),
+  rule(
+    "wantedCallsInto",
+    [v("g"), v("m"), v("n")],
+    [
+      lit("wantedOrigin", v("x")),
+      lit("comesTo", v("x"), v("g")),
+      lit("callsInto", v("g"), v("m"), v("n"))
+    ]
+  ),
+  // The export table of one module, keyed by the module asked about.
+  // The moduleExport rules flatten re-export chains of any length, and
+  // the demand cone stays on export facts alone.
+  rule(
+    "wantedModuleExport",
+    [v("m"), v("n"), v("value")],
+    [
+      lit("wantedExportsOf", v("m")),
+      lit("moduleExport", v("m"), v("n"), v("value"))
+    ]
+  ),
+  // The calls behind a receiver, for a pack that wants the anchor a
+  // chain hangs off; the README's anchor section says which hops and
+  // why the asking side applies the single-answer policy.
+  // A class's ancestry, one hop per extends through the binding that
+  // says which class the written base is; the names on the way out
+  // are what a storage pack matches its library's bases against.
+  rule("ancestryChain", [v("c"), v("c")], [lit("wantedAncestry", v("c"))]),
+  rule(
+    "ancestryChain",
+    [v("c"), v("b2")],
+    [
+      lit("ancestryChain", v("c"), v("b")),
+      lit("extends", v("b"), v("x")),
+      lit("binds", v("x"), v("b2"))
+    ]
+  ),
+  rule(
+    "wantedBaseName",
+    [v("c"), v("n")],
+    [lit("ancestryChain", v("c"), v("b")), lit("extendsNamed", v("b"), v("n"))]
+  ),
+  rule("anchorChain", [v("x"), v("x")], [lit("wantedAnchor", v("x"))]),
+  rule(
+    "anchorChain",
+    [v("x"), v("z")],
+    [lit("anchorChain", v("x"), v("y")), lit("binds", v("y"), v("z"))]
+  ),
+  rule(
+    "anchorChain",
+    [v("x"), v("z")],
+    [lit("anchorChain", v("x"), v("y")), lit("endsHolding", v("y"), v("z"))]
+  ),
+  rule(
+    "anchorChain",
+    [v("x"), v("z")],
+    [lit("anchorChain", v("x"), v("y")), lit("fallbackBranch", v("y"), v("z"))]
+  ),
+  rule(
+    "anchorChain",
+    [v("x"), v("z")],
+    [
+      lit("anchorChain", v("x"), v("y")),
+      lit("imports", v("y"), v("m"), v("n")),
+      lit("moduleExport", v("m"), v("n"), v("z"))
+    ]
+  ),
+  rule(
+    "anchorChain",
+    [v("x"), v("c")],
+    [lit("anchorChain", v("x"), v("r")), lit("call", v("r"), v("c"))]
+  ),
+  rule(
+    "anchorChain",
+    [v("x"), v("o")],
+    [
+      lit("anchorChain", v("x"), v("y")),
+      lit("readsProperty", v("y"), v("o"), v("n"))
+    ]
+  ),
+  rule(
+    "wantedAnchorCall",
+    [v("x"), v("r")],
+    [lit("anchorChain", v("x"), v("r")), lit("call", v("r"), v("c"))]
+  )
+];
+var ANSWER_RELATIONS = [
+  ...new Set(RESOLUTION_QUESTIONS.map((r) => r.head.relation))
+];
+
 // src/storage.ts
 function children2(node) {
   return node.namedChildren.filter((child) => child !== null);
@@ -15972,21 +16724,17 @@ function rootConstant(node) {
   }
   return rootConstant(receiver);
 }
-function reachesBase(facts, classKey, bases, seen = /* @__PURE__ */ new Set()) {
-  if (seen.has(classKey)) {
-    return false;
-  }
-  seen.add(classKey);
-  const named = facts.facts("extendsNamed").filter((row) => String(row[0]) === classKey).map((row) => String(row[1]));
-  if (named.some((name) => bases.includes(name))) {
-    return true;
-  }
-  return facts.facts("extends").filter((row) => String(row[0]) === classKey).flatMap(
-    (row) => facts.facts("binds").filter((bound) => String(bound[0]) === String(row[1])).map((bound) => String(bound[1]))
-  ).some((next) => reachesBase(facts, next, bases, seen));
+var ANCESTRY_PROGRAM = deriveOnDemand(
+  [...RESOLUTION_RULES, ...RESOLUTION_QUESTIONS],
+  ANSWER_RELATIONS
+);
+function reachesBase(facts, classKey, bases) {
+  facts.add("wantedAncestry", [classKey]);
+  evaluate(facts, ANCESTRY_PROGRAM.rules);
+  return facts.lookup("wantedBaseName", 0, classKey).some((row) => bases.includes(String(row[1])));
 }
-function classBehind(facts, constant) {
-  const wanted = `#${constant.text}`;
+function classBehind(facts, constant2) {
+  const wanted = `#${constant2.text}`;
   const bound = new Set(
     facts.facts("binds").filter((row) => String(row[0]).endsWith(wanted)).map((row) => String(row[1]))
   );
@@ -16029,11 +16777,11 @@ function storageEffects(calls, options) {
     if (partOfOne.has(call.id)) {
       continue;
     }
-    const constant = rootConstant(call);
-    if (constant === null) {
+    const constant2 = rootConstant(call);
+    if (constant2 === null) {
       continue;
     }
-    const classKey = classBehind(options.facts, constant);
+    const classKey = classBehind(options.facts, constant2);
     if (classKey === void 0) {
       continue;
     }
@@ -16051,7 +16799,7 @@ function storageEffects(calls, options) {
         recognition: "ruby-storage",
         storageSystem: pattern.storageSystem,
         scope: pattern.baseClasses[0] ?? "",
-        container: constant.text
+        container: constant2.text
       }),
       callee: call.text,
       interaction: {
@@ -16538,6 +17286,7 @@ function buildFieldUnit(pack, typeName, decl, filePath) {
       kind: "resolver",
       file: filePath,
       range: rangeOf(decl.node),
+      span: spanOf(decl.node),
       exportName: null,
       exportPath: null
     },