@polycode-projects/the-mechanical-code-talker 0.6.0 → 0.7.1

package/src/concept.mjs

@@ -0,0 +1,393 @@
+// concept.mjs — "the concept force": compose a THREE-BAND answer to a vague
+// "what is a X" touch, when tmct KNOWS the concept X (a curated definition) AND
+// HAS instances of it (individuals in the code graph and/or remembered isa facts).
+//
+//   1. THE FACT   — the definition of X (lead clause of the corpus/seon entry).
+//   2. THE EXAMPLES — real instances of X: code-graph individuals whose class maps
+//      to X (capped ~3, stable graph order, each a real node), plus any remembered
+//      "A is a X" facts.
+//   3. THE GUIDED FOLLOW-UP — 2-3 concrete, RUNNABLE next questions built from the
+//      real instances × the query shapes valid for that kind, EACH PRE-CHECKED by
+//      actually running it through ask() so a suggestion can never miss.
+//
+// PURE given (graph, term, {definition, factRows}) — the follow-up validator calls
+// ask() (deterministic, no model), so the whole composition is reproducible. The
+// caller (chat.mjs) owns the async edges: loading corpus/seon/definitions.jsonl and
+// the memory fact rows, and rendering through the response template. This module
+// never fabricates: every example is a real individual/fact and every follow-up is
+// validated against the same graph before it is offered.
+
+import { ask } from "./ask.mjs";
+import { relationKind } from "./codegraph.mjs";
+
+/** A vague concept term (normalized, singular — normFactTerm's output) → the graph
+ *  individual `class` it enumerates. The closed set of code-structure concepts the
+ *  seon lexicon + the graph both understand; anything outside it is not a "concept
+ *  force" touch (a general-vocabulary term like "cache" has a definition but no
+ *  enumerable graph class, so it falls back to the ordinary definition surface). */
+export const CONCEPT_CLASS = Object.freeze({
+  class: "Class",
+  module: "Module",
+  function: "Function",
+  method: "Method",
+  attribute: "Attribute",
+  variable: "GlobalVariable",
+  constant: "GlobalVariable",
+  commit: "Commit",
+});
+
+/** class → [singular, plural] noun for the examples band's count ("(3 classes)"). */
+const CLASS_NOUN = Object.freeze({
+  Class: ["class", "classes"],
+  Module: ["module", "modules"],
+  Function: ["function", "functions"],
+  Method: ["method", "methods"],
+  Attribute: ["attribute", "attributes"],
+  GlobalVariable: ["variable", "variables"],
+  Commit: ["commit", "commits"],
+});
+
+/** The isa-family predicates that make a remembered fact an INSTANCE statement
+ *  ("A is a X" — rdf:type). A subclass relation (rdfs:subClassOf) is not an
+ *  instance, so it never contributes an example. */
+const ISA_INSTANCE_PREDICATES = new Set(["rdf:type"]);
+
+/** Per graph-class, the candidate follow-up shapes in priority order. Each builder
+ *  takes ONE real instance label and returns a query string; the builder is offered
+ *  only after the query VALIDATES against the live graph, so a shape that can't
+ *  resolve for any instance is silently dropped. Shapes are curated to be exactly
+ *  the ones ask.mjs's grammar answers for that kind. */
+const FOLLOWUP_SHAPES = Object.freeze({
+  Class: [
+    (x) => `which classes inherit from ${x}`,
+    (x) => `what does ${x} contain`,
+    (x) => `where is ${x} defined`,
+  ],
+  Module: [
+    (x) => `what does ${x} import`,
+    (x) => `which modules import ${x}`,
+    (x) => `where is ${x} defined`,
+  ],
+  Function: [
+    (x) => `what calls ${x}`,
+    (x) => `what does ${x} call`,
+    (x) => `where is ${x} defined`,
+  ],
+  Method: [
+    (x) => `which class contains ${x}`,
+    (x) => `what calls ${x}`,
+    (x) => `where is ${x} defined`,
+  ],
+  Attribute: [
+    (x) => `which class contains ${x}`,
+    (x) => `where is ${x} defined`,
+  ],
+  GlobalVariable: [
+    (x) => `where is ${x} defined`,
+    (x) => `where is ${x} mentioned`,
+  ],
+  Commit: [
+    (x) => `what did commit ${x} touch`,
+    (x) => `when did ${x} change`,
+  ],
+});
+
+// The examples/instances listing shows up to 32 before truncating (the remainder is
+// paginated by the chat shell's "more" mechanism); the GUIDED follow-ups stay small.
+const MAX_EXAMPLES = 32;
+const MAX_FOLLOWUPS = 3;
+
+/** The lead clause of a curated definition — cut at the first "; " / ": " so the
+ *  FACT band is one crisp sentence ("A class is a template that defines the
+ *  structure and behaviour of objects."), the rest of the entry left implicit. */
+function leadSentence(def) {
+  const s = String(def).trim();
+  const m = s.match(/^(.*?)[;:]\s/);
+  const head = (m ? m[1] : s).replace(/[.;:\s]+$/, "");
+  return `${head}.`;
+}
+
+function listJoin(a) {
+  return a.length > 1 ? `${a.slice(0, -1).join(", ")} and ${a[a.length - 1]}` : a[0];
+}
+
+/** Does a candidate follow-up query actually resolve to a real, non-empty answer?
+ *  Runs it through ask() (deterministic) and checks the honest-miss flag + matches —
+ *  the exact same engine the user would hit, so a validated suggestion is guaranteed
+ *  to land. Failure-tolerant: any throw counts as "does not resolve". */
+function resolves(graph, query) {
+  try {
+    const r = ask(graph, query);
+    return !!(r && r.tmct_ask && r.tmct_ask.miss === false
+      && Array.isArray(r.tmct_ask.matches) && r.tmct_ask.matches.length > 0);
+  } catch {
+    return false;
+  }
+}
+
+/** Build up to MAX_FOLLOWUPS validated follow-ups for a class's instances. For each
+ *  shape in priority order, find the instances whose query resolves and offer it for
+ *  the first such instance NOT already used by an earlier follow-up (so the set
+ *  showcases DIFFERENT real nodes where possible); a shape no instance satisfies is
+ *  dropped entirely. Deterministic (graph order in, first-fit out). */
+function buildFollowups(graph, cls, instanceLabels) {
+  const shapes = FOLLOWUP_SHAPES[cls] || [];
+  const used = new Set();
+  const out = [];
+  for (const shape of shapes) {
+    if (out.length >= MAX_FOLLOWUPS) break;
+    const valid = instanceLabels.filter((x) => resolves(graph, shape(x)));
+    if (!valid.length) continue;
+    const pick = valid.find((x) => !used.has(x)) ?? valid[0];
+    used.add(pick);
+    out.push(shape(pick));
+  }
+  return out;
+}
+
+/** Compose the three bands for a concept term, or null when it is NOT a concept-force
+ *  case — the term is not a known enumerable concept, has no curated definition, or
+ *  has NO instances anywhere (code graph and memory both empty). Returns the pieces as
+ *  strings so the caller can render them through a data template:
+ *    { definition, examples, followups, instances:[{id,label,type,module}] }
+ *  `examples` is always non-empty when non-null (we only fire with real instances);
+ *  `followups` is "" when no validated next-question exists, else a "\nWant to go
+ *  deeper? Try:\n  • …" block. */
+export function composeConcept(graph, term, { definition = null, factRows = [] } = {}) {
+  const cls = CONCEPT_CLASS[term];
+  if (!cls || !definition) return null;
+
+  const individuals = (graph && Array.isArray(graph.individuals)) ? graph.individuals : [];
+  const graphInstances = individuals.filter((i) => i && i.class === cls);
+  const graphLabels = graphInstances.map((i) => i.label);
+  const graphLower = new Set(graphLabels.map((l) => String(l).toLowerCase()));
+
+  // remembered "A is a X" instance facts (rdf:type), objects matching this term —
+  // subjects are the instance names, deduped against graph instances by label.
+  const memoryLabels = [];
+  for (const f of factRows) {
+    if (!ISA_INSTANCE_PREDICATES.has(f.predicate)) continue;
+    if (String(f.object).toLowerCase() !== term) continue;
+    const sub = String(f.subject || "").trim();
+    if (sub && !graphLower.has(sub.toLowerCase()) && !memoryLabels.includes(sub)) memoryLabels.push(sub);
+  }
+
+  if (!graphInstances.length && !memoryLabels.length) return null; // no instances → honest miss stands
+
+  const [sing, plur] = CLASS_NOUN[cls] || [cls.toLowerCase(), `${cls.toLowerCase()}s`];
+
+  // BAND 1 — the fact.
+  const bandDefinition = leadSentence(definition);
+
+  // BAND 2 — the examples. Up to MAX_EXAMPLES individuals are listed; a longer class
+  // holds its remainder for the shell's "more" pagination (say 'more' to see them).
+  const shownGraph = graphLabels.slice(0, MAX_EXAMPLES);
+  const remainderLabels = graphLabels.slice(MAX_EXAMPLES);
+  let bandExamples = "";
+  if (shownGraph.length) {
+    const total = graphInstances.length;
+    const more = remainderLabels.length
+      ? ` …and ${remainderLabels.length} more — say 'more' to see them.`
+      : "";
+    bandExamples = `In this codebase, for example: ${listJoin(shownGraph)} (${total} ${total === 1 ? sing : plur}).${more}`;
+  }
+  const shownMemory = memoryLabels.slice(0, MAX_EXAMPLES);
+  if (shownMemory.length) {
+    const lead = bandExamples ? " " : "";
+    const verb = shownMemory.length === 1 ? "is a" : "are";
+    bandExamples += `${lead}You've also told me ${listJoin(shownMemory)} ${verb} ${sing}.`;
+  }
+
+  // BAND 3 — the guided follow-ups (validated; only real code-graph instances can
+  // seed a runnable graph query, so memory-only concepts simply get no follow-ups).
+  const followupQueries = buildFollowups(graph, cls, graphLabels);
+  const bandFollowups = followupQueries.length
+    ? `\nWant to go deeper? Try:\n${followupQueries.map((q) => `  • ${q}`).join("\n")}`
+    : "";
+
+  return {
+    definition: bandDefinition,
+    examples: bandExamples,
+    followups: bandFollowups,
+    followupQueries,
+    instances: graphInstances.slice(0, MAX_EXAMPLES).map((i) => ({
+      id: i.id, label: i.label, type: i.class,
+    })),
+    // the un-shown instance labels + their plural noun, for the shell's "more"
+    // pagination — empty when nothing was truncated.
+    remainder: remainderLabels,
+    noun: plur,
+  };
+}
+
+// ============================================================================
+// THE RELATION CONCEPT FORCE — the same three-band shape (definition + real
+// example EDGES + validated follow-ups) for a vague touch on a RELATION/edge kind
+// ("what about imports", "what are the calls", "tell me about contains"). Where
+// composeConcept enumerates INDIVIDUALS of a class, composeRelation enumerates the
+// EDGES of a relation kind, and seeds its follow-ups from real edge endpoints.
+// PURE given (graph, relTerm, {definition}); every example is a real edge and every
+// follow-up is validated via resolves() before it is offered. Never fabricates.
+// ============================================================================
+
+/** A vague relation term (lower-cased) → the internal concept key it enumerates.
+ *  The closed set of edge-kind concepts the seon relation table + the graph both
+ *  understand; a term outside it is not a relation-force touch. Nouns, gerunds and
+ *  a couple of synonyms all collapse to one key. */
+export const RELATION_TERM = Object.freeze({
+  import: "imports", imports: "imports", importing: "imports", imported: "imports",
+  call: "calls", calls: "calls", calling: "calls", called: "calls", invoke: "calls", invokes: "calls", invoking: "calls",
+  contain: "contains", contains: "contains", containing: "contains", containment: "contains", member: "contains", members: "contains",
+  inherit: "inherits", inherits: "inherits", inheriting: "inherits", inheritance: "inherits",
+  extend: "inherits", extends: "inherits", extending: "inherits", subclass: "inherits", subclasses: "inherits", subclassing: "inherits",
+  test: "tests", tests: "tests", testing: "tests", tested: "tests", coverage: "tests",
+  define: "defines", defines: "defines", defining: "defines", defined: "defines", definition: "defines", definitions: "defines", declaration: "defines",
+  touch: "touches", touches: "touches", touching: "touches", touched: "touches",
+  cochange: "cochange", "co-change": "cochange", "change-coupling": "cochange", coupled: "cochange",
+});
+
+/** concept key → the relationKind()s whose edges it enumerates. A concept can span
+ *  several graph kinds (calls is both module-coarse and symbol-granular; touches is
+ *  file- and symbol-level) — the force gathers edges across the whole set. */
+const RELATION_KINDS = Object.freeze({
+  imports: ["imports"],
+  calls: ["calls", "callsSymbol"],
+  contains: ["contains"],
+  inherits: ["inherits"],
+  tests: ["tests"],
+  defines: ["defines"],
+  touches: ["touches", "touchesSymbol"],
+  cochange: ["cochange"],
+});
+
+/** concept key → the verb phrase that renders an edge as an English sentence
+ *  ("a imports b"), and the singular edge-noun for the count ("(18 import edges)"). */
+const RELATION_RENDER = Object.freeze({
+  imports: { verb: "imports", edgeNoun: "import" },
+  calls: { verb: "calls", edgeNoun: "call" },
+  contains: { verb: "contains", edgeNoun: "containment" },
+  inherits: { verb: "inherits from", edgeNoun: "inheritance" },
+  tests: { verb: "tests", edgeNoun: "test" },
+  defines: { verb: "defines", edgeNoun: "definition" },
+  touches: { verb: "touches", edgeNoun: "touch" },
+  cochange: { verb: "changes together with", edgeNoun: "change-coupling" },
+});
+
+/** Per concept key, the candidate follow-up shapes in priority order. Each shape
+ *  draws a real endpoint from one SIDE of the edges (subject or object) and builds a
+ *  query; a shape is offered only once the query VALIDATES against the live graph
+ *  (resolves()), so a shape no endpoint satisfies is silently dropped. Curated to be
+ *  exactly the shapes ask.mjs answers for that kind. */
+const RELATION_FOLLOWUP_SHAPES = Object.freeze({
+  imports: [
+    { side: "obj", make: (x) => `which modules import ${x}` },
+    { side: "subj", make: (x) => `what does ${x} import` },
+  ],
+  calls: [
+    { side: "obj", make: (x) => `what calls ${x}` },
+    { side: "subj", make: (x) => `what does ${x} call` },
+  ],
+  contains: [
+    { side: "subj", make: (x) => `what does ${x} contain` },
+    { side: "obj", make: (x) => `which class contains ${x}` },
+  ],
+  inherits: [
+    { side: "obj", make: (x) => `which classes inherit from ${x}` },
+    { side: "subj", make: (x) => `where is ${x} defined` },
+  ],
+  tests: [
+    { side: "obj", make: (x) => `what tests ${x}` },
+    { side: "obj", make: (x) => `where is ${x} defined` },
+  ],
+  defines: [
+    { side: "obj", make: (x) => `where is ${x} defined` },
+    { side: "subj", make: (x) => `what does ${x} contain` },
+  ],
+  touches: [
+    { side: "obj", make: (x) => `when did ${x} change` },
+    { side: "subj", make: (x) => `what did commit ${x} touch` },
+  ],
+  cochange: [
+    { side: "obj", make: (x) => `where is ${x} defined` },
+    { side: "subj", make: (x) => `which modules import ${x}` },
+  ],
+});
+
+/** How many example edges the relation force shows before the remainder is held for
+ *  the shell's "more" pagination (edges render as full sentences, so a much smaller
+ *  page than the noun force's 32 instances reads better). */
+const MAX_EDGE_EXAMPLES = 3;
+
+const edgeSubjectLabel = (e) => String(e.subjectLabel || e.subject);
+const edgeObjectLabel = (e) => String(e.objectLabel || e.object);
+
+/** Build up to MAX_FOLLOWUPS validated follow-ups for a relation's edges. Same
+ *  first-fit discipline as buildFollowups: for each shape in priority order, find the
+ *  endpoints (of that shape's side) whose query resolves and offer it for the first
+ *  such endpoint not already used, so the set showcases DIFFERENT real nodes. */
+function buildRelationFollowups(graph, key, subjLabels, objLabels) {
+  const shapes = RELATION_FOLLOWUP_SHAPES[key] || [];
+  const used = new Set();
+  const out = [];
+  for (const shape of shapes) {
+    if (out.length >= MAX_FOLLOWUPS) break;
+    const pool = shape.side === "subj" ? subjLabels : objLabels;
+    const valid = pool.filter((x) => resolves(graph, shape.make(x)));
+    if (!valid.length) continue;
+    const pick = valid.find((x) => !used.has(x)) ?? valid[0];
+    used.add(pick);
+    out.push(shape.make(pick));
+  }
+  return out;
+}
+
+/** Compose the three bands for a RELATION concept term, or null when it is NOT a
+ *  relation-force case — the term is not a known enumerable relation, has no curated
+ *  definition, or the graph has NO edges of that kind (honest miss stands, never a
+ *  fabricated edge). Returns the same string-band shape composeConcept does:
+ *    { definition, examples, followups, followupQueries, remainder, noun }
+ *  `examples` is always non-empty when non-null (we only fire with real edges);
+ *  `followups` is "" when no validated next-question exists. */
+export function composeRelation(graph, relTerm, { definition = null } = {}) {
+  const key = RELATION_TERM[String(relTerm || "").toLowerCase()];
+  if (!key || !definition) return null;
+  const kinds = RELATION_KINDS[key] || [];
+  const groups = (graph && Array.isArray(graph.relations) ? graph.relations : [])
+    .filter((g) => kinds.includes(relationKind(g)));
+  const edges = groups.flatMap((g) => (Array.isArray(g.edges) ? g.edges : []));
+  if (!edges.length) return null; // no edges of this kind → honest miss stands
+  const total = groups.reduce((s, g) => s + (Number(g.count) || (g.edges || []).length), 0);
+
+  const { verb, edgeNoun } = RELATION_RENDER[key] || { verb: key, edgeNoun: key };
+
+  // BAND 1 — the fact (the relation defined as a verb/relationship).
+  const bandDefinition = leadSentence(definition);
+
+  // BAND 2 — the example edges, rendered as English sentences with a count. The
+  // first MAX_EDGE_EXAMPLES are shown; the remainder is held for "more" pagination.
+  const rendered = edges.map((e) => `${edgeSubjectLabel(e)} ${verb} ${edgeObjectLabel(e)}`);
+  const shown = rendered.slice(0, MAX_EDGE_EXAMPLES);
+  const remainder = rendered.slice(MAX_EDGE_EXAMPLES);
+  const countNoun = `${edgeNoun} edge${total === 1 ? "" : "s"}`;
+  const more = remainder.length ? ` …and ${remainder.length} more — say 'more' to see them.` : "";
+  const bandExamples = `In this codebase, for example: ${listJoin(shown)} (${total} ${countNoun}).${more}`;
+
+  // BAND 3 — the guided follow-ups, seeded from DISTINCT real edge endpoints and
+  // validated against the live graph, so an offered follow-up can never miss.
+  const subjLabels = [...new Set(edges.map(edgeSubjectLabel))];
+  const objLabels = [...new Set(edges.map(edgeObjectLabel))];
+  const followupQueries = buildRelationFollowups(graph, key, subjLabels, objLabels);
+  const bandFollowups = followupQueries.length
+    ? `\nWant to go deeper? Try:\n${followupQueries.map((q) => `  • ${q}`).join("\n")}`
+    : "";
+
+  return {
+    definition: bandDefinition,
+    examples: bandExamples,
+    followups: bandFollowups,
+    followupQueries,
+    relation: key,
+    remainder,
+    noun: countNoun,
+  };
+}

package/src/corpus/conceptnet.mjs

@@ -4,7 +4,7 @@
 //   loadSlice(path?)        stream corpus/conceptnet/slice.jsonl → assertions
 //   loadMap(path?)          src/corpus/conceptnet-map.toml → Map(rel → row)
 //   toFacts(assertions,map) assertions → appendFact-shaped triples
-//   seedMemory(dir, opts)   write them into <dir>/.tmct/memory via appendFact
+//   seedMemory(dir, opts)   write them into <dir>/.tmct/memory via appendFacts (one batched write)
 //
 // The slice is committed data (one JSON object per line: {start, rel, end,
 // surfaceText?, weight}; en→en only; CC-BY-SA 4.0 for ConceptNet-derived rows
@@ -13,11 +13,12 @@
 // ace = "none" are deliberate non-emissions. A slice relation MISSING from
 // the table is a drift error — loud, never guessed around.
 //
-// Seeding goes through src/memory/core.mjs appendFact() ONLY (memory is
-// import-only here): fact ids are content-hashed from (s,p,o), so re-seeding
-// is idempotent by construction. seedMemory additionally pre-loads the store
-// once and skips triples already present, so a re-seed is read-mostly instead
-// of N rewrites.
+// Seeding goes through src/memory/core.mjs appendFacts() (memory is import-only
+// here): fact ids are content-hashed from (s,p,o), so re-seeding is idempotent by
+// construction. seedMemory pre-loads the store once and skips triples already
+// present, then hands the survivors to appendFacts as ONE batched read-modify-
+// write — so seeding the whole slice is O(N), not the O(N²) a per-fact appendFact
+// loop would incur (the 6 k-fact slice: ~7 min → a couple of seconds).
 
 import { createReadStream } from "node:fs";
 import { readFile } from "node:fs/promises";
@@ -25,7 +26,7 @@ import { createInterface } from "node:readline";
 import { fileURLToPath } from "node:url";
 import { dirname, join } from "node:path";
 import { parse as parseToml } from "smol-toml";
-import { appendFact, loadMemory, normFactTerm } from "../memory/core.mjs";
+import { appendFacts, loadMemory, normFactTerm } from "../memory/core.mjs";
 
 const PKG_ROOT = join(dirname(fileURLToPath(import.meta.url)), "..", "..");
 export const SLICE_FILE = join(PKG_ROOT, "corpus", "conceptnet", "slice.jsonl");
@@ -140,9 +141,10 @@ export function toFacts(assertions, map, provenancePrefix = "corpus:conceptnet")
  *  location trivia the slice happens to open with; without `prefer` the
  *  behavior is byte-identical to before.
  *
- *  Idempotent twice over: appendFact's content-hashed ids make a blind
+ *  Idempotent twice over: appendFacts' content-hashed ids make a blind
  *  re-append an upsert, and we pre-read the store once to skip triples that
- *  are already there (so re-seeding costs one read, not N rewrites).
+ *  are already there (so re-seeding costs one read, not N rewrites). The
+ *  survivors are written in ONE batched appendFacts call, not a per-fact loop.
  *  Returns { appended, skipped, total }. `provenancePrefix` is threaded through to
  *  toFacts (default "corpus:conceptnet" → byte-identical seed) so a seon/tier-2
  *  corpus can tag its facts "corpus:seon" / "corpus:tier2:<id>". */
@@ -169,17 +171,20 @@ export async function seedMemory(dir, { limit, slicePath = SLICE_FILE, mapPath =
     existing.add(factKey(get("subject"), get("predicate"), get("object")));
   }
 
-  let appended = 0;
   let skipped = 0;
+  const toWrite = [];
   for (const fact of facts) {
     const key = factKey(fact.subject, fact.predicate, fact.object);
     if (existing.has(key)) {
       skipped += 1;
       continue;
     }
-    await appendFact(dir, fact);
     existing.add(key);
-    appended += 1;
+    toWrite.push(fact);
   }
-  return { appended, skipped, total: facts.length };
+  // ONE read-modify-write for the whole seed (was one per fact — O(N²) I/O, ~7 min
+  // for the 6 k-fact slice). appendFacts also skips any malformed row rather than
+  // throwing, so its skipped count folds into the dedup skips here.
+  const res = await appendFacts(dir, toWrite);
+  return { appended: res.appended, skipped: skipped + res.skipped, total: facts.length };
 }

package/src/init.mjs

@@ -35,12 +35,14 @@ export const MEMORY_DIR_REL = join(".tmct", "memory");
 export const SESSIONS_DIR_REL = join(".tmct", "sessions");
 export const SEED_MARKER_REL = join(".tmct", "memory", "corpus-seed.json");
 
-/** How many corpus facts the seed writes — matches chat.mjs SEED_LIMIT so an
- *  init-seeded repo and a bootstrap-seeded repo carry the identical slice. */
-export const SEED_LIMIT = 500;
+/** `undefined` = seed the WHOLE ConceptNet band (no cap) — matches chat.mjs
+ *  SEED_LIMIT so an init-seeded repo and a bootstrap-seeded repo carry the identical
+ *  slice. A number in `tmct.toml`'s `seed.limit` still caps (explicit user override);
+ *  absent ⇒ all. */
+export const SEED_LIMIT = undefined;
 
-/** Predicate preference for the capped seed (definitional band first) — matches
- *  chat.mjs SEED_PREFER so "what is a cache?" answers land in the first 500. */
+/** Predicate order for the seed (definitional band first) — matches chat.mjs
+ *  SEED_PREFER. With the cap lifted this sets ORDER only; every fact seeds. */
 export const SEED_PREFER = ["rdfs:subClassOf", "rdf:type", "mgx:usedFor", "mgx:partOf", "mgx:capableOf"];
 
 /** The shipped default config — the exact shape written into `tmct.toml` and
@@ -49,7 +51,7 @@ export function defaultConfig() {
   return {
     graphFile: join(".tmct", "graph.json"),
     corpus: { tier: "tier1" },
-    seed: { enabled: true, limit: SEED_LIMIT },
+    seed: { enabled: true },
   };
 }
 
@@ -103,8 +105,9 @@ tier = ${JSON.stringify(corpus.tier)}
 # Offline and deterministic. Set false, or export TMCT_NO_SEED=1, to opt out —
 # the repo still initialises, just empty of corpus facts.
 enabled = ${seed.enabled ? "true" : "false"}
-# How many facts the seed writes (definitional band first).
-limit = ${Number(seed.limit)}
+# By default the WHOLE committed slice seeds (no cap — the operator's "seed all").
+# To cap it, uncomment and set a number (definitional band first):
+${seed.limit != null ? `limit = ${Number(seed.limit)}` : "# limit = 500"}
 `;
 }
 
@@ -183,7 +186,7 @@ export async function initRepo(dir, { force = false, seed, env = process.env } =
   } else {
     try {
       const { seedMemory } = await import("./corpus/conceptnet.mjs");
-      const limit = Number(config.seed?.limit) || SEED_LIMIT;
+      const limit = config.seed?.limit != null ? Number(config.seed.limit) : SEED_LIMIT;
       seedResult = await seedMemory(root, { limit, prefer: SEED_PREFER });
       const markerNew = !(await exists(paths.marker));
       await mkdir(dirname(paths.marker), { recursive: true });

package/src/interpret/normalize.mjs

@@ -90,6 +90,48 @@ export function applyNegationFrames(text) {
   return text;
 }
 
+// ---- phrasing frames (SKILL_CHAT_PLAYTEST drill-down loop) — route the natural
+// ways a developer asks a MEMBERS-of-class or a WHERE-DEFINED question onto the
+// canonical shapes the grammar already answers, so a phrasing miss becomes a real
+// answer (or an honest empty with a receipt) instead of the grammar wall. Same
+// closed-pattern, first-match-wins discipline as the negation/commit frames: each
+// frame REWRITES the whole line to a canonical query BOTH parse strategies then
+// handle for free. Run AFTER applyNegationFrames so a sha "what's in <sha>" is
+// already the commit-subject question before the members frame could see it. ----
+export const PHRASING_FRAMES = Object.freeze([
+  // MEMBERS-of-class → "what does X contain".
+  //   "what functions are in Task", "what methods are inside X", "what attributes are in X"
+  { re: /^what\s+(?:functions?|methods?|members?|attributes?|fields?|properties)\s+(?:are|is)\s+(?:in|inside|within)\s+(?:the\s+)?(.+?)\??$/i, to: (m) => `what does ${m[1]} contain` },
+  //   "what functions does Task have", "what methods does X have"
+  { re: /^what\s+(?:functions?|methods?|members?|attributes?|fields?|properties)\s+(?:does|do)\s+(.+?)\s+have\??$/i, to: (m) => `what does ${m[1]} contain` },
+  //   "what are the members of X", "what are the methods in X"
+  { re: /^what\s+are\s+(?:the\s+)?(?:functions?|methods?|members?|attributes?|fields?|properties)\s+(?:of|in|inside|within)\s+(?:the\s+)?(.+?)\??$/i, to: (m) => `what does ${m[1]} contain` },
+  //   "members of X", "methods of X", "contents of X"
+  { re: /^(?:the\s+)?(?:members?|methods?|attributes?|contents)\s+of\s+(?:the\s+)?(.+?)\??$/i, to: (m) => `what does ${m[1]} contain` },
+  //   "what's in X" / "what is in X" (contraction already expanded; sha handled above)
+  { re: /^what\s+is\s+(?:in|inside)\s+(?:the\s+)?(.+?)\??$/i, to: (m) => `what does ${m[1]} contain` },
+
+  // WHERE-DEFINED → "where is X defined". PAST TENSE ONLY ("what defined X", "what
+  // declared X"): the PRESENT "what defines X" already parses as a reverse-defines
+  // query (the module defining symbol X — test/ask.test.mjs pins that), so rewriting
+  // it would change that receipt. The past-tense form is the one that hit the wall.
+  { re: /^what\s+(?:defined|declared)\s+(?:the\s+)?(?:function\s+|method\s+|class\s+|module\s+|variable\s+|constant\s+)?(.+?)\??$/i, to: (m) => `where is ${m[1]} defined` },
+  //   "where's X defined" (the "where's" contraction is not in the contraction table)
+  { re: /^where'?s\s+(?:the\s+)?(.+?)\s+(defined|declared|located|implemented)\??$/i, to: (m) => `where is ${m[1]} ${m[2]}` },
+]);
+
+/** Apply the phrasing frames (members-of-class + where-defined) — first match wins
+ *  and rewriting stops; unmatched text passes through unchanged. Kept SEPARATE from
+ *  applyNegationFrames so the ordering (negation/commit first, then phrasing) is
+ *  explicit at the call site (normalizeInput). */
+export function applyPhrasingFrames(text) {
+  for (const frame of PHRASING_FRAMES) {
+    const m = text.match(frame.re);
+    if (m) return frame.to(m).replace(/\s+/g, " ").trim();
+  }
+  return text;
+}
+
 // ---- §B1 negation — the SET-COMPLEMENT frame (Cycle 5, PLAN_CYCLE_4.md). Recognizes
 // a BARE set-negation query — "which X do not <verb> Y", "X that don't <verb> Y",
 // "modules not importing Y", "which X are not <qualifier>" — and returns a descriptor

package/src/interpret/pipeline.mjs

@@ -23,7 +23,7 @@
 // normalization changed the input (`normalizationChanged`), so a repaired
 // spelling/contraction is on the record, never silent.
 
-import { normalizeQuery, applyNegationFrames } from "./normalize.mjs";
+import { normalizeQuery, applyNegationFrames, applyPhrasingFrames } from "./normalize.mjs";
 import { grammarStrategy } from "./strategies/grammar.mjs";
 import { keywordSpotStrategy } from "./strategies/keywords.mjs";
 import { noiseStripStrategy } from "./strategies/noise-strip.mjs";
@@ -47,7 +47,7 @@ export const STRATEGIES = [grammarStrategy, keywordSpotStrategy, noiseStripStrat
  *  before any strategy runs. Returns {raw, text, changed}. */
 export function normalizeInput(input) {
   const raw = String(input || "").trim().replace(/\s+/g, " ");
-  const text = raw ? applyNegationFrames(normalizeQuery(raw)) : "";
+  const text = raw ? applyPhrasingFrames(applyNegationFrames(normalizeQuery(raw))) : "";
   return { raw, text, changed: text !== raw };
 }