@shrkcrft/inspector 0.1.0-alpha.30 → 0.1.0-alpha.32

package/dist/knowledge-unverifiable-reason.d.ts

@@ -0,0 +1,12 @@
+/** Why an entry landed in the `unverifiable` bucket. */
+export declare enum KnowledgeUnverifiableReason {
+    /** It declares no `references[]` and no `anchors[]`. */
+    NoReferences = "no-references",
+    /**
+     * It declares some, but none can be checked: every one is a `url`, an
+     * unpinned symbol, a reference missing its required field, or an id whose
+     * registry is empty / was not loaded.
+     */
+    OnlyUnverifiableReferences = "only-unverifiable-references"
+}
+//# sourceMappingURL=knowledge-unverifiable-reason.d.ts.map

package/dist/knowledge-unverifiable-reason.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-unverifiable-reason.d.ts","sourceRoot":"","sources":["../src/knowledge-unverifiable-reason.ts"],"names":[],"mappings":"AAAA,wDAAwD;AACxD,oBAAY,2BAA2B;IACrC,wDAAwD;IACxD,YAAY,kBAAkB;IAC9B;;;;OAIG;IACH,0BAA0B,iCAAiC;CAC5D"}

package/dist/knowledge-unverifiable-reason.js

@@ -0,0 +1,12 @@
+/** Why an entry landed in the `unverifiable` bucket. */
+export var KnowledgeUnverifiableReason;
+(function (KnowledgeUnverifiableReason) {
+    /** It declares no `references[]` and no `anchors[]`. */
+    KnowledgeUnverifiableReason["NoReferences"] = "no-references";
+    /**
+     * It declares some, but none can be checked: every one is a `url`, an
+     * unpinned symbol, a reference missing its required field, or an id whose
+     * registry is empty / was not loaded.
+     */
+    KnowledgeUnverifiableReason["OnlyUnverifiableReferences"] = "only-unverifiable-references";
+})(KnowledgeUnverifiableReason || (KnowledgeUnverifiableReason = {}));

package/dist/knowledge-unverifiable-remedy.d.ts

@@ -0,0 +1,56 @@
+import type { IKnowledgeEntryVerdictRecord } from './knowledge-entry-verdict-record.js';
+import { KnowledgeMinReferencedValve } from './knowledge-min-referenced-valve.js';
+import type { IUnverifiableRemedyGroup } from './i-unverifiable-remedy-group.js';
+/** The channel sentence: both formats can declare references. */
+export declare const DECLARE_REFERENCES_REMEDY = "Declare references[] (TypeScript) or a references: frontmatter list (Markdown)";
+/** The valve a surface names (the verb takes the flag; `quality` refuses it). */
+export declare function minReferencedValveText(valve: KnowledgeMinReferencedValve): string;
+/**
+ * The fix for ONE unverifiable entry — `undefined` only for a local TypeScript
+ * (or other non-Markdown) entry that declares NOTHING (the heading names
+ * `references[]`). It branches on the verdict REASON (round 15 closing, A4): an
+ * entry that declares references, none checkable (a malformed item — a
+ * non-boolean `required`, an unknown kind or `root` — or only `url:`s), is told
+ * to fix what it declared, never to "add a references: frontmatter list" /
+ * "declare references[]" it already has. A pack's entries are fixed upstream;
+ * their `file:` / `directory:` paths resolve against the CONSUMER's root unless
+ * the reference declares `root: pack` (round 15 follow-up, F7 — then against
+ * the pack's own directory), and `package:` reads the consumer's root
+ * package.json plus the pack's own name.
+ */
+export declare function unverifiableFileRemedy(v: Pick<IKnowledgeEntryVerdictRecord, 'sourceFormat' | 'pack' | 'reason'>): string | undefined;
+/**
+ * {@link unverifiableFileRemedy} for EVERY entry — what a per-entry row (the
+ * `--require-references` violation) prints: a local TypeScript entry that
+ * declares nothing is told to declare `references[]`, one whose references are
+ * all uncheckable to fix them (it read "declare references[]").
+ */
+export declare function unverifiableEntryRemedy(v: Pick<IKnowledgeEntryVerdictRecord, 'sourceFormat' | 'pack' | 'reason'>): string;
+/**
+ * The heading of the unverifiable list, after `UNVERIFIABLE (N) — never
+ * checked; ` — by reason (round 15 closing, A4): it told every entry to
+ * "declare references[] …, a references: frontmatter list (Markdown) or
+ * anchors[]", over entries whose references exist and are malformed.
+ */
+export declare function unverifiableListHeading(verdicts: readonly Pick<IKnowledgeEntryVerdictRecord, 'verdict' | 'reason'>[]): string;
+/**
+ * The remedy sentence for a run with unverifiable entries: the channel (or,
+ * for entries that declare references none of which is checkable, the fix to
+ * them — round 15 closing, A4), the valve this surface can name, and — when a
+ * pack contributed any of them — the pack that fixes them upstream.
+ */
+export declare function unverifiableRemedy(verdicts: readonly Pick<IKnowledgeEntryVerdictRecord, 'verdict' | 'pack' | 'reason'>[], valve: KnowledgeMinReferencedValve): string;
+/**
+ * Unverifiable entries grouped by declaring file AND remedy, in report order —
+ * THE grouping the stale-check's per-file lines and `quality`'s notes read. A
+ * file whose entries need different fixes gets one group per fix: the first
+ * entry's remedy used to speak for its whole file (round 15 closing, A4).
+ */
+export declare function unverifiableRemedyGroups(verdicts: readonly Pick<IKnowledgeEntryVerdictRecord, 'entryId' | 'verdict' | 'source' | 'sourceFormat' | 'pack' | 'reason'>[]): IUnverifiableRemedyGroup[];
+/**
+ * `<file>: <remedy>` for each file whose unverifiable entries need more than
+ * `references[]`, capped — `<file> (<ids>): <remedy>` when that file's entries
+ * need different fixes ({@link unverifiableRemedyGroups}).
+ */
+export declare function unverifiableFileRemedies(verdicts: readonly Pick<IKnowledgeEntryVerdictRecord, 'entryId' | 'verdict' | 'source' | 'sourceFormat' | 'pack' | 'reason'>[]): string[];
+//# sourceMappingURL=knowledge-unverifiable-remedy.d.ts.map

package/dist/knowledge-unverifiable-remedy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-unverifiable-remedy.d.ts","sourceRoot":"","sources":["../src/knowledge-unverifiable-remedy.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAE,4BAA4B,EAAE,MAAM,qCAAqC,CAAC;AACxF,OAAO,EAAE,2BAA2B,EAAE,MAAM,qCAAqC,CAAC;AAClF,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,kCAAkC,CAAC;AAEjF,iEAAiE;AACjE,eAAO,MAAM,yBAAyB,mFAC4C,CAAC;AAKnF,iFAAiF;AACjF,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,2BAA2B,GAAG,MAAM,CAIjF;AAWD;;;;;;;;;;;;GAYG;AACH,wBAAgB,sBAAsB,CACpC,CAAC,EAAE,IAAI,CAAC,4BAA4B,EAAE,cAAc,GAAG,MAAM,GAAG,QAAQ,CAAC,GACxE,MAAM,GAAG,SAAS,CAyBpB;AAED;;;;;GAKG;AACH,wBAAgB,uBAAuB,CACrC,CAAC,EAAE,IAAI,CAAC,4BAA4B,EAAE,cAAc,GAAG,MAAM,GAAG,QAAQ,CAAC,GACxE,MAAM,CAER;AAiBD;;;;;GAKG;AACH,wBAAgB,uBAAuB,CAAC,QAAQ,EAAE,SAAS,IAAI,CAAC,4BAA4B,EAAE,SAAS,GAAG,QAAQ,CAAC,EAAE,GAAG,MAAM,CAK7H;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,QAAQ,EAAE,SAAS,IAAI,CAAC,4BAA4B,EAAE,SAAS,GAAG,MAAM,GAAG,QAAQ,CAAC,EAAE,EACtF,KAAK,EAAE,2BAA2B,GACjC,MAAM,CAmBR;AAED;;;;;GAKG;AACH,wBAAgB,wBAAwB,CACtC,QAAQ,EAAE,SAAS,IAAI,CAAC,4BAA4B,EAAE,SAAS,GAAG,SAAS,GAAG,QAAQ,GAAG,cAAc,GAAG,MAAM,GAAG,QAAQ,CAAC,EAAE,GAC7H,wBAAwB,EAAE,CAc5B;AAED;;;;GAIG;AACH,wBAAgB,wBAAwB,CACtC,QAAQ,EAAE,SAAS,IAAI,CAAC,4BAA4B,EAAE,SAAS,GAAG,SAAS,GAAG,QAAQ,GAAG,cAAc,GAAG,MAAM,GAAG,QAAQ,CAAC,EAAE,GAC7H,MAAM,EAAE,CAUV"}

package/dist/loader-diagnostics.d.ts

@@ -1,3 +1,4 @@
+import type { IRejectedEntry } from '@shrkcrft/core';
 import type { LoaderAssetKind, LoaderAssetStatus } from './inspector-cache.js';
 export type LoaderOrigin = 'local-config' | 'pack-manifest';
 export interface ILoaderDiagnostic {
@@ -6,9 +7,20 @@ export interface ILoaderDiagnostic {
     origin: LoaderOrigin;
     packName?: string;
     elapsedMs: number;
-    status: LoaderAssetStatus | 'cached-skip';
-    /** Number of items extracted (entries/templates/etc). */
+    /**
+     * `missing` — a file the local config DECLARES (e.g. `knowledgeFiles`) does
+     * not exist, so nothing was loaded from it. Recorded so a corpus check can
+     * refuse to pass over a source it was told about and never read.
+     */
+    status: LoaderAssetStatus | 'cached-skip' | 'missing';
+    /** Number of items extracted (entries/templates/etc) — the loader's ACCEPTED count. */
     count: number;
+    /**
+     * Entries the file declared that the loader refused (round 12, 12.1), so
+     * `count + rejected.length === declared`. Absent when none were refused.
+     * Lifted into THE rejection channel by `collectContributionRejections`.
+     */
+    rejected?: readonly IRejectedEntry[];
     warningCount: number;
     errorMessage?: string;
     /** When status === 'cached-skip', this is the cached pre-existing status. */

package/dist/loader-diagnostics.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"loader-diagnostics.d.ts","sourceRoot":"","sources":["../src/loader-diagnostics.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AAE/E,MAAM,MAAM,YAAY,GAAG,cAAc,GAAG,eAAe,CAAC;AAE5D,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,eAAe,CAAC;IACtB,MAAM,EAAE,YAAY,CAAC;IACrB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,iBAAiB,GAAG,aAAa,CAAC;IAC1C,yDAAyD;IACzD,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,6EAA6E;IAC7E,YAAY,CAAC,EAAE,iBAAiB,CAAC;IACjC,wDAAwD;IACxD,OAAO,EAAE,OAAO,CAAC;IACjB,0DAA0D;IAC1D,SAAS,EAAE,OAAO,CAAC;IACnB,sCAAsC;IACtC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,2DAA2D;IAC3D,IAAI,EAAE,OAAO,CAAC;IACd,yDAAyD;IACzD,oBAAoB,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED,eAAO,MAAM,gCAAgC,OAAO,CAAC;AACrD,eAAO,MAAM,0BAA0B,QAAa,CAAC;AAErD,wBAAgB,0BAA0B,CAAC,CAAC,EAAE,iBAAiB,GAAG,MAAM,CAQvE;AAED,wBAAgB,0BAA0B,CAAC,WAAW,EAAE,SAAS,iBAAiB,EAAE,GAAG;IACrF,YAAY,EAAE,MAAM,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;IACvB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;CACrB,CA2BA"}
+{"version":3,"file":"loader-diagnostics.d.ts","sourceRoot":"","sources":["../src/loader-diagnostics.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AACrD,OAAO,KAAK,EAAE,eAAe,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AAE/E,MAAM,MAAM,YAAY,GAAG,cAAc,GAAG,eAAe,CAAC;AAE5D,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,eAAe,CAAC;IACtB,MAAM,EAAE,YAAY,CAAC;IACrB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,MAAM,EAAE,iBAAiB,GAAG,aAAa,GAAG,SAAS,CAAC;IACtD,uFAAuF;IACvF,KAAK,EAAE,MAAM,CAAC;IACd;;;;OAIG;IACH,QAAQ,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;IACrC,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,6EAA6E;IAC7E,YAAY,CAAC,EAAE,iBAAiB,CAAC;IACjC,wDAAwD;IACxD,OAAO,EAAE,OAAO,CAAC;IACjB,0DAA0D;IAC1D,SAAS,EAAE,OAAO,CAAC;IACnB,sCAAsC;IACtC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,2DAA2D;IAC3D,IAAI,EAAE,OAAO,CAAC;IACd,yDAAyD;IACzD,oBAAoB,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED,eAAO,MAAM,gCAAgC,OAAO,CAAC;AACrD,eAAO,MAAM,0BAA0B,QAAa,CAAC;AAErD,wBAAgB,0BAA0B,CAAC,CAAC,EAAE,iBAAiB,GAAG,MAAM,CAQvE;AAED,wBAAgB,0BAA0B,CAAC,WAAW,EAAE,SAAS,iBAAiB,EAAE,GAAG;IACrF,YAAY,EAAE,MAAM,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;IACvB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;CACrB,CA2BA"}

package/dist/match-terms.d.ts

@@ -0,0 +1,48 @@
+/**
+ * THE term matcher — the one answer to "does this trigger word appear in this
+ * task?" for routing hints, playbooks, the recommender's built-in recipes, the
+ * change-intent domain keywords and the ranker's distinct-term evidence.
+ *
+ * Every one of those used raw `task.toLowerCase().includes(needle)`, so a
+ * two-letter keyword fired inside unrelated words (`ci` in `pricing`, `pr` in
+ * `pricing`, `gate` in `investigate`, `pack` in `package`) and a hyphenated
+ * tag could never match the same words typed with spaces (`capability-pack`
+ * vs "capability pack").
+ *
+ * Terms come from THE identifier tokenizer (`split-identifier.ts`) over the
+ * LOWERCASED text — so camelCase splitting is inert and both sides split the
+ * same way on hyphens, underscores, whitespace and punctuation. Never write a
+ * second tokenizer.
+ */
+import { TermMatchMode } from '@shrkcrft/plugin-api';
+import type { ITermQuery } from './term-query.js';
+/** Function words dropped by {@link contentTerms}. Small and fixed on purpose. */
+export declare const TERM_STOPWORDS: ReadonlySet<string>;
+/** Lowercase, then split with THE identifier tokenizer. Order and duplicates are kept. */
+export declare function normaliseTerms(text: string): string[];
+/** {@link normaliseTerms} minus {@link TERM_STOPWORDS}, distinct, first-seen order. */
+export declare function contentTerms(text: string): string[];
+/** Prepare a task once for any number of {@link matchTerm} calls. */
+export declare function prepareTermQuery(text: string): ITermQuery;
+/** Two terms agree when equal, or one plain inflection apart (either direction). */
+export declare function termsAgree(a: string, b: string): boolean;
+/**
+ * Does `needle` occur in the query?
+ *
+ * - {@link TermMatchMode.Tokens} (default): the needle's terms must appear
+ *   contiguously in the query's terms, each agreeing ({@link termsAgree}). A
+ *   needle with no terms (empty, or punctuation only) never matches.
+ * - {@link TermMatchMode.Substring}: the legacy `lower.includes(needle)`,
+ *   reproduced exactly (an empty needle matches everything — the routing-hint
+ *   load lint errors on it).
+ */
+export declare function matchTerm(query: ITermQuery, needle: string, mode?: TermMatchMode | `${TermMatchMode}`): boolean;
+/**
+ * The DISTINCT `queryTerms` that agree with some term of `corpus` — the
+ * evidence count "how many different words of the task does this item
+ * mention?". Repeats inside the corpus never count twice.
+ */
+export declare function matchedQueryTerms(queryTerms: readonly string[], corpus: readonly (string | undefined)[]): string[];
+/** Jaccard similarity of two term lists, as sets (0 when both are empty). */
+export declare function termJaccard(a: readonly string[], b: readonly string[]): number;
+//# sourceMappingURL=match-terms.d.ts.map

package/dist/match-terms.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"match-terms.d.ts","sourceRoot":"","sources":["../src/match-terms.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAErD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAElD,kFAAkF;AAClF,eAAO,MAAM,cAAc,EAAE,WAAW,CAAC,MAAM,CAmB7C,CAAC;AAgBH,0FAA0F;AAC1F,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAErD;AAED,uFAAuF;AACvF,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CASnD;AAED,qEAAqE;AACrE,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,CAEzD;AAaD,oFAAoF;AACpF,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAExD;AAED;;;;;;;;;GASG;AACH,wBAAgB,SAAS,CACvB,KAAK,EAAE,UAAU,EACjB,MAAM,EAAE,MAAM,EACd,IAAI,GAAE,aAAa,GAAG,GAAG,aAAa,EAAyB,GAC9D,OAAO,CAeT;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAC/B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,MAAM,EAAE,SAAS,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,GACtC,MAAM,EAAE,CAcV;AAED,6EAA6E;AAC7E,wBAAgB,WAAW,CAAC,CAAC,EAAE,SAAS,MAAM,EAAE,EAAE,CAAC,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAO9E"}

package/dist/match-terms.js

@@ -0,0 +1,155 @@
+/**
+ * THE term matcher — the one answer to "does this trigger word appear in this
+ * task?" for routing hints, playbooks, the recommender's built-in recipes, the
+ * change-intent domain keywords and the ranker's distinct-term evidence.
+ *
+ * Every one of those used raw `task.toLowerCase().includes(needle)`, so a
+ * two-letter keyword fired inside unrelated words (`ci` in `pricing`, `pr` in
+ * `pricing`, `gate` in `investigate`, `pack` in `package`) and a hyphenated
+ * tag could never match the same words typed with spaces (`capability-pack`
+ * vs "capability pack").
+ *
+ * Terms come from THE identifier tokenizer (`split-identifier.ts`) over the
+ * LOWERCASED text — so camelCase splitting is inert and both sides split the
+ * same way on hyphens, underscores, whitespace and punctuation. Never write a
+ * second tokenizer.
+ */
+import { TermMatchMode } from '@shrkcrft/plugin-api';
+import { splitIdentifierTokens } from "./split-identifier.js";
+/** Function words dropped by {@link contentTerms}. Small and fixed on purpose. */
+export const TERM_STOPWORDS = new Set([
+    'a',
+    'an',
+    'the',
+    'to',
+    'for',
+    'of',
+    'in',
+    'on',
+    'and',
+    'or',
+    'with',
+    'my',
+    'our',
+    'please',
+    'i',
+    'we',
+    'it',
+    'is',
+]);
+/**
+ * Plain inflections one term may differ by. Agent-noun suffixes (`er`, `ers`)
+ * are deliberately absent: `block` → `blocker`, `build` → `builder` change the
+ * meaning, and `block` firing on "the blocker in billing" was one of the
+ * reproduced false positives.
+ */
+const INFLECTION_SUFFIXES = ['s', 'es', 'ed', 'ing'];
+/** A term shorter than this matches only itself — `ci`, `pr`, `go` never inflect. */
+const MIN_INFLECTABLE_LENGTH = 3;
+/** Final consonants that double before `-ing` / `-ed` (`plan` → `planning`). */
+const DOUBLING_CONSONANT = /[bdgklmnprtz]$/;
+/** Lowercase, then split with THE identifier tokenizer. Order and duplicates are kept. */
+export function normaliseTerms(text) {
+    return splitIdentifierTokens(text.toLowerCase());
+}
+/** {@link normaliseTerms} minus {@link TERM_STOPWORDS}, distinct, first-seen order. */
+export function contentTerms(text) {
+    const out = [];
+    const seen = new Set();
+    for (const t of normaliseTerms(text)) {
+        if (TERM_STOPWORDS.has(t) || seen.has(t))
+            continue;
+        seen.add(t);
+        out.push(t);
+    }
+    return out;
+}
+/** Prepare a task once for any number of {@link matchTerm} calls. */
+export function prepareTermQuery(text) {
+    return { lower: text.toLowerCase(), terms: normaliseTerms(text) };
+}
+function inflects(base, word) {
+    if (base.length < MIN_INFLECTABLE_LENGTH || word.length <= base.length)
+        return false;
+    for (const suffix of INFLECTION_SUFFIXES)
+        if (word === base + suffix)
+            return true;
+    const last = base[base.length - 1];
+    const stem = base.slice(0, -1);
+    if (last === 'e' && (word === `${base}d` || word === `${stem}ing`))
+        return true;
+    if (last === 'y' && (word === `${stem}ies` || word === `${stem}ied`))
+        return true;
+    if (DOUBLING_CONSONANT.test(base) && (word === `${base}${last}ing` || word === `${base}${last}ed`))
+        return true;
+    return false;
+}
+/** Two terms agree when equal, or one plain inflection apart (either direction). */
+export function termsAgree(a, b) {
+    return a === b || inflects(a, b) || inflects(b, a);
+}
+/**
+ * Does `needle` occur in the query?
+ *
+ * - {@link TermMatchMode.Tokens} (default): the needle's terms must appear
+ *   contiguously in the query's terms, each agreeing ({@link termsAgree}). A
+ *   needle with no terms (empty, or punctuation only) never matches.
+ * - {@link TermMatchMode.Substring}: the legacy `lower.includes(needle)`,
+ *   reproduced exactly (an empty needle matches everything — the routing-hint
+ *   load lint errors on it).
+ */
+export function matchTerm(query, needle, mode = TermMatchMode.Tokens) {
+    if (mode === TermMatchMode.Substring)
+        return query.lower.includes(needle.toLowerCase());
+    const seq = normaliseTerms(needle);
+    if (seq.length === 0 || seq.length > query.terms.length)
+        return false;
+    for (let i = 0; i + seq.length <= query.terms.length; i++) {
+        let all = true;
+        for (let j = 0; j < seq.length; j++) {
+            if (!termsAgree(seq[j], query.terms[i + j])) {
+                all = false;
+                break;
+            }
+        }
+        if (all)
+            return true;
+    }
+    return false;
+}
+/**
+ * The DISTINCT `queryTerms` that agree with some term of `corpus` — the
+ * evidence count "how many different words of the task does this item
+ * mention?". Repeats inside the corpus never count twice.
+ */
+export function matchedQueryTerms(queryTerms, corpus) {
+    const corpusTerms = new Set();
+    for (const c of corpus)
+        if (c)
+            for (const t of normaliseTerms(c))
+                corpusTerms.add(t);
+    const out = [];
+    for (const q of queryTerms) {
+        if (out.includes(q))
+            continue;
+        for (const t of corpusTerms) {
+            if (termsAgree(q, t)) {
+                out.push(q);
+                break;
+            }
+        }
+    }
+    return out;
+}
+/** Jaccard similarity of two term lists, as sets (0 when both are empty). */
+export function termJaccard(a, b) {
+    const sa = new Set(a);
+    const sb = new Set(b);
+    if (sa.size === 0 && sb.size === 0)
+        return 0;
+    let inter = 0;
+    for (const t of sa)
+        if (sb.has(t))
+            inter += 1;
+    return inter / (sa.size + sb.size - inter);
+}

package/dist/migration-profile-registry.d.ts

@@ -1,5 +1,6 @@
 import { type IMigrationProfile } from './migration-readiness.js';
 import type { ISharkcraftInspection } from './sharkcraft-inspector.js';
+import { type IRejectedEntry } from '@shrkcrft/core';
 export declare const MIGRATION_PROFILE_REGISTRY_SCHEMA = "sharkcraft.migration-profile-registry/v1";
 export declare enum MigrationProfileSource {
     Local = "local",
@@ -18,9 +19,18 @@ export interface IMigrationProfileRegistryIssue {
     readonly profileId?: string;
     readonly source?: string;
 }
+/**
+ * THE migration-profile acceptance predicate (round 12, 12.1): one
+ * `<field>: <message>` per failing field — `[]` means accepted. A refused
+ * profile used to read `Invalid migration profile at <file>; skipped.`
+ * with no id and no field.
+ */
+export declare function migrationProfileRejectionReasons(raw: unknown): readonly string[];
 export declare function loadMigrationProfiles(inspection: ISharkcraftInspection): Promise<{
     entries: readonly IMigrationProfileEntry[];
     issues: readonly IMigrationProfileRegistryIssue[];
+    /** Every declared profile the loader refused — invalid or a duplicate id (round 12, 12.1). */
+    rejected: readonly IRejectedEntry[];
 }>;
 export declare function listMigrationProfilesFromPacks(inspection: ISharkcraftInspection): Promise<readonly IMigrationProfile[]>;
 //# sourceMappingURL=migration-profile-registry.d.ts.map

package/dist/migration-profile-registry.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"migration-profile-registry.d.ts","sourceRoot":"","sources":["../src/migration-profile-registry.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,KAAK,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,2BAA2B,CAAC;AAGvE,eAAO,MAAM,iCAAiC,6CAA6C,CAAC;AAE5F,oBAAY,sBAAsB;IAChC,KAAK,UAAU;IACf,IAAI,SAAS;CACd;AAED,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,OAAO,EAAE,iBAAiB,CAAC;IACpC,QAAQ,CAAC,MAAM,EAAE,sBAAsB,CAAC;IACxC,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,WAAW,8BAA8B;IAC7C,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,GAAG,OAAO,CAAC;IAChD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAkCD,wBAAsB,qBAAqB,CACzC,UAAU,EAAE,qBAAqB,GAChC,OAAO,CAAC;IACT,OAAO,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC3C,MAAM,EAAE,SAAS,8BAA8B,EAAE,CAAC;CACnD,CAAC,CAkFD;AAED,wBAAsB,8BAA8B,CAClD,UAAU,EAAE,qBAAqB,GAChC,OAAO,CAAC,SAAS,iBAAiB,EAAE,CAAC,CAGvC"}
+{"version":3,"file":"migration-profile-registry.d.ts","sourceRoot":"","sources":["../src/migration-profile-registry.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,KAAK,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,2BAA2B,CAAC;AACvE,OAAO,EAKL,KAAK,cAAc,EACpB,MAAM,gBAAgB,CAAC;AAExB,eAAO,MAAM,iCAAiC,6CAA6C,CAAC;AAE5F,oBAAY,sBAAsB;IAChC,KAAK,UAAU;IACf,IAAI,SAAS;CACd;AAED,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,OAAO,EAAE,iBAAiB,CAAC;IACpC,QAAQ,CAAC,MAAM,EAAE,sBAAsB,CAAC;IACxC,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,WAAW,8BAA8B;IAC7C,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,GAAG,OAAO,CAAC;IAChD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAoBD;;;;;GAKG;AACH,wBAAgB,gCAAgC,CAAC,GAAG,EAAE,OAAO,GAAG,SAAS,MAAM,EAAE,CAQhF;AAED,wBAAsB,qBAAqB,CACzC,UAAU,EAAE,qBAAqB,GAChC,OAAO,CAAC;IACT,OAAO,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC3C,MAAM,EAAE,SAAS,8BAA8B,EAAE,CAAC;IAClD,8FAA8F;IAC9F,QAAQ,EAAE,SAAS,cAAc,EAAE,CAAC;CACrC,CAAC,CA+GD;AAED,wBAAsB,8BAA8B,CAClD,UAAU,EAAE,qBAAqB,GAChC,OAAO,CAAC,SAAS,iBAAiB,EAAE,CAAC,CAGvC"}

package/dist/migration-profile-registry.js

@@ -4,22 +4,15 @@
  */
 import { existsSync } from 'node:fs';
 import * as nodePath from 'node:path';
-import { importModuleViaLoader } from '@shrkcrft/core';
+import { importModuleViaLoader, readContributionExport, RejectionCause, } from '@shrkcrft/core';
 export const MIGRATION_PROFILE_REGISTRY_SCHEMA = 'sharkcraft.migration-profile-registry/v1';
 export var MigrationProfileSource;
 (function (MigrationProfileSource) {
     MigrationProfileSource["Local"] = "local";
     MigrationProfileSource["Pack"] = "pack";
 })(MigrationProfileSource || (MigrationProfileSource = {}));
-async function importDefault(file) {
-    const mod = (await importModuleViaLoader(file));
-    if (Array.isArray(mod.default))
-        return mod.default;
-    if (mod.default && typeof mod.default === 'object')
-        return [mod.default];
-    if (Array.isArray(mod.migrationProfiles))
-        return mod.migrationProfiles;
-    return [];
+async function importProfiles(file) {
+    return readContributionExport(await importModuleViaLoader(file), { namedKeys: ['migrationProfiles'] });
 }
 function localFiles(inspection) {
     const out = [];
@@ -31,56 +24,88 @@ function localFiles(inspection) {
         if (existsSync(full))
             out.push(full);
     }
-    const cfg = inspection.config;
-    for (const rel of cfg?.migrationProfileFiles ?? []) {
-        out.push(nodePath.isAbsolute(rel) ? rel : nodePath.join(dir, rel));
-    }
+    // More profile files come from pack manifests (`migrationProfileFiles`,
+    // loaded below) — there is no local-config key for them; the strict config
+    // schema rejects one, so a local read here could never be reached.
     return out;
 }
-function looksValid(raw) {
-    if (!raw || typeof raw !== 'object')
-        return false;
+/**
+ * THE migration-profile acceptance predicate (round 12, 12.1): one
+ * `<field>: <message>` per failing field — `[]` means accepted. A refused
+ * profile used to read `Invalid migration profile at <file>; skipped.`
+ * with no id and no field.
+ */
+export function migrationProfileRejectionReasons(raw) {
+    if (!raw || typeof raw !== 'object' || Array.isArray(raw))
+        return ['(entry): must be an object'];
     const o = raw;
-    return typeof o.id === 'string' && typeof o.title === 'string' && Array.isArray(o.checks);
+    const out = [];
+    if (typeof o.id !== 'string')
+        out.push('id: must be a string');
+    if (typeof o.title !== 'string')
+        out.push('title: must be a string');
+    if (!Array.isArray(o.checks))
+        out.push('checks: must be an array');
+    return out;
 }
 export async function loadMigrationProfiles(inspection) {
     const entries = [];
     const issues = [];
-    const seen = new Set();
-    const ingest = (raw, source, packageName, sourceFile) => {
-        if (!looksValid(raw)) {
+    const rejected = [];
+    const seen = new Map();
+    const ingest = (raw, source, packageName, sourceFile, at) => {
+        const rawId = raw && typeof raw === 'object' ? raw.id : undefined;
+        const id = typeof rawId === 'string' ? rawId : undefined;
+        const reasons = migrationProfileRejectionReasons(raw);
+        if (reasons.length > 0) {
             issues.push({
                 severity: 'warning',
                 code: 'invalid-profile',
-                message: `Invalid migration profile at ${sourceFile}; skipped.`,
+                message: `Invalid migration profile${id ? ` "${id}"` : ''} at ${sourceFile} (${at.exportName ?? 'default'}[${at.index}]); skipped — ${reasons.join('; ')}.`,
+                ...(id ? { profileId: id } : {}),
                 source: sourceFile,
             });
+            rejected.push({ ...at, ...(id ? { entryId: id } : {}), reasons, cause: RejectionCause.Invalid });
             return;
         }
-        if (seen.has(raw.id)) {
+        const profile = raw;
+        const prev = seen.get(profile.id);
+        if (prev !== undefined) {
             issues.push({
                 severity: 'error',
                 code: 'duplicate-id',
-                message: `Migration profile id "${raw.id}" already loaded; skipping ${sourceFile}.`,
-                profileId: raw.id,
+                message: `Migration profile id "${profile.id}" already loaded; skipping ${sourceFile}.`,
+                profileId: profile.id,
                 source: sourceFile,
             });
+            rejected.push({
+                ...at,
+                entryId: profile.id,
+                reasons: [`id: "${profile.id}" is already declared in ${prev}`],
+                cause: RejectionCause.DuplicateId,
+            });
             return;
         }
-        seen.add(raw.id);
+        seen.set(profile.id, sourceFile);
         entries.push({
-            profile: raw,
+            profile,
             source,
             ...(packageName ? { packageName } : {}),
             sourceFile,
         });
     };
+    const ingestAll = (exp, file, source, packageName, sourceFile) => {
+        exp.items.forEach((raw, i) => ingest(raw, source, packageName, sourceFile, {
+            file,
+            index: exp.single ? -1 : i,
+            ...(exp.exportName ? { exportName: exp.exportName } : {}),
+        }));
+    };
     for (const file of localFiles(inspection)) {
         try {
-            const list = await importDefault(file);
+            const exp = await importProfiles(file);
             const rel = nodePath.relative(inspection.projectRoot, file) || file;
-            for (const raw of list)
-                ingest(raw, MigrationProfileSource.Local, undefined, rel);
+            ingestAll(exp, file, MigrationProfileSource.Local, undefined, rel);
         }
         catch (e) {
             issues.push({
@@ -105,9 +130,7 @@ export async function loadMigrationProfiles(inspection) {
                 continue;
             }
             try {
-                const list = await importDefault(file);
-                for (const raw of list)
-                    ingest(raw, MigrationProfileSource.Pack, pack.packageName, rel);
+                ingestAll(await importProfiles(file), file, MigrationProfileSource.Pack, pack.packageName, rel);
             }
             catch (e) {
                 issues.push({
@@ -119,7 +142,7 @@ export async function loadMigrationProfiles(inspection) {
             }
         }
     }
-    return { entries, issues };
+    return { entries, issues, rejected };
 }
 export async function listMigrationProfilesFromPacks(inspection) {
     const { entries } = await loadMigrationProfiles(inspection);

package/dist/migration-readiness.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"migration-readiness.d.ts","sourceRoot":"","sources":["../src/migration-readiness.ts"],"names":[],"mappings":"AAGA;;;;;;;;;GASG;AAEH,oBAAY,oBAAoB;IAC9B,IAAI,SAAS;IACb,IAAI,SAAS;IACb,IAAI,SAAS;IACb,IAAI,SAAS;CACd;AAED,oBAAY,gBAAgB;IAC1B,OAAO,YAAY;IACnB,kBAAkB,yBAAyB;IAC3C,mBAAmB,0BAA0B;IAC7C,iBAAiB,wBAAwB;IACzC,uBAAuB,+BAA+B;IACtD,gBAAgB,uBAAuB;IACvC,aAAa,oBAAoB;CAClC;AAED,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,yFAAyF;IACzF,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAChC,8IAA8I;IAC9I,cAAc,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,UAAU,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC/B,wDAAwD;IACxD,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,sCAAsC;IACtC,QAAQ,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,UAAU,GAAG,QAAQ,GAAG,SAAS,GAAG,QAAQ,GAAG,KAAK,GAAG,UAAU,GAAG,UAAU,CAAC;IAC9G,sDAAsD;IACtD,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,8DAA8D;IAC9D,aAAa,CAAC,EAAE,gBAAgB,CAAC;CAClC;AAED,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,0CAA0C;IAC1C,cAAc,EAAE,gBAAgB,CAAC;IACjC,MAAM,EAAE,SAAS,eAAe,EAAE,CAAC;CACpC;AAED,MAAM,WAAW,qBAAqB;IACpC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,oBAAoB,CAAC;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC;IACvC,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,aAAa,CAAC,EAAE,gBAAgB,CAAC;CAClC;AAED,MAAM,WAAW,yBAAyB;IACxC,MAAM,EAAE,mCAAmC,CAAC;IAC5C,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,gBAAgB,CAAC;IAC1B,KAAK,EAAE,OAAO,CAAC;IACf,QAAQ,EAAE,SAAS,qBAAqB,EAAE,CAAC;IAC3C,QAAQ,EAAE,SAAS,qBAAqB,EAAE,CAAC;IAC3C,MAAM,EAAE,SAAS,qBAAqB,EAAE,CAAC;IACzC,OAAO,EAAE,SAAS,qBAAqB,EAAE,CAAC;IAC1C,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;CAC9B;AAID,MAAM,WAAW,0BAA0B;IACzC,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB;;;;OAIG;IACH,cAAc,CAAC,EAAE,SAAS,iBAAiB,EAAE,CAAC;CAC/C;AAED,MAAM,WAAW,gCAAgC;IAC/C,EAAE,EAAE,OAAO,CAAC;IACZ,OAAO,CAAC,EAAE,iBAAiB,CAAC;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,wBAAgB,uBAAuB,CACrC,SAAS,EAAE,MAAM,EACjB,cAAc,GAAE,SAAS,iBAAiB,EAAO,GAChD,gCAAgC,CAWlC;AAED,wBAAgB,qBAAqB,CACnC,cAAc,GAAE,SAAS,iBAAiB,EAAO,GAChD,SAAS,iBAAiB,EAAE,CAE9B;AAED,iBAAS,QAAQ,CAAC,KAAK,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,GAAG,qBAAqB,CA8CpF;AAED,wBAAgB,uBAAuB,CAAC,OAAO,EAAE,0BAA0B,GAAG,yBAAyB,CAmFtG;AAED,wBAAgB,4BAA4B,CAAC,MAAM,EAAE,yBAAyB,GAAG,MAAM,CA6BtF;AAED,wBAAgB,gCAAgC,CAAC,MAAM,EAAE,yBAAyB,GAAG,MAAM,CA8B1F;AAGD,eAAO,MAAM,SAAS;;;CAGrB,CAAC"}
+{"version":3,"file":"migration-readiness.d.ts","sourceRoot":"","sources":["../src/migration-readiness.ts"],"names":[],"mappings":"AAGA;;;;;;;;;GASG;AAEH,oBAAY,oBAAoB;IAC9B,IAAI,SAAS;IACb,IAAI,SAAS;IACb,IAAI,SAAS;IACb,IAAI,SAAS;CACd;AAED,oBAAY,gBAAgB;IAC1B,OAAO,YAAY;IACnB,kBAAkB,yBAAyB;IAC3C,mBAAmB,0BAA0B;IAC7C,iBAAiB,wBAAwB;IACzC,uBAAuB,+BAA+B;IACtD,gBAAgB,uBAAuB;IACvC,aAAa,oBAAoB;CAClC;AAED,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,yFAAyF;IACzF,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAChC,8IAA8I;IAC9I,cAAc,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,UAAU,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC/B,wDAAwD;IACxD,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,sCAAsC;IACtC,QAAQ,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,UAAU,GAAG,QAAQ,GAAG,SAAS,GAAG,QAAQ,GAAG,KAAK,GAAG,UAAU,GAAG,UAAU,CAAC;IAC9G,sDAAsD;IACtD,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,8DAA8D;IAC9D,aAAa,CAAC,EAAE,gBAAgB,CAAC;CAClC;AAED,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,0CAA0C;IAC1C,cAAc,EAAE,gBAAgB,CAAC;IACjC,MAAM,EAAE,SAAS,eAAe,EAAE,CAAC;CACpC;AAED,MAAM,WAAW,qBAAqB;IACpC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,oBAAoB,CAAC;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC;IACvC,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,aAAa,CAAC,EAAE,gBAAgB,CAAC;CAClC;AAED,MAAM,WAAW,yBAAyB;IACxC,MAAM,EAAE,mCAAmC,CAAC;IAC5C,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,gBAAgB,CAAC;IAC1B,KAAK,EAAE,OAAO,CAAC;IACf,QAAQ,EAAE,SAAS,qBAAqB,EAAE,CAAC;IAC3C,QAAQ,EAAE,SAAS,qBAAqB,EAAE,CAAC;IAC3C,MAAM,EAAE,SAAS,qBAAqB,EAAE,CAAC;IACzC,OAAO,EAAE,SAAS,qBAAqB,EAAE,CAAC;IAC1C,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;CAC9B;AAID,MAAM,WAAW,0BAA0B;IACzC,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB;;;;OAIG;IACH,cAAc,CAAC,EAAE,SAAS,iBAAiB,EAAE,CAAC;CAC/C;AAED,MAAM,WAAW,gCAAgC;IAC/C,EAAE,EAAE,OAAO,CAAC;IACZ,OAAO,CAAC,EAAE,iBAAiB,CAAC;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,wBAAgB,uBAAuB,CACrC,SAAS,EAAE,MAAM,EACjB,cAAc,GAAE,SAAS,iBAAiB,EAAO,GAChD,gCAAgC,CAWlC;AAED,wBAAgB,qBAAqB,CACnC,cAAc,GAAE,SAAS,iBAAiB,EAAO,GAChD,SAAS,iBAAiB,EAAE,CAE9B;AAED,iBAAS,QAAQ,CAAC,KAAK,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,GAAG,qBAAqB,CA8CpF;AAED,wBAAgB,uBAAuB,CAAC,OAAO,EAAE,0BAA0B,GAAG,yBAAyB,CAiFtG;AAED,wBAAgB,4BAA4B,CAAC,MAAM,EAAE,yBAAyB,GAAG,MAAM,CA6BtF;AAED,wBAAgB,gCAAgC,CAAC,MAAM,EAAE,yBAAyB,GAAG,MAAM,CA8B1F;AAGD,eAAO,MAAM,SAAS;;;CAGrB,CAAC"}

package/dist/migration-readiness.js

@@ -159,9 +159,7 @@ export function buildMigrationReadiness(options) {
         `Profile: ${profile.title} (${profile.id})`,
         `Verdict: ${verdict}`,
         `Passed: ${passed.length}, Warnings: ${warnings.length}, Blockers: ${blockers.length}`,
-        'Next: review blockers (if any), then re-run `shrk migration readiness --profile ' +
-            profile.id +
-            '`.',
+        `Next: review blockers (if any), then re-run the readiness check for ${profile.id}.`,
     ];
     return {
         schema: 'sharkcraft.migration-readiness/v1',

package/dist/nearest-id.d.ts

@@ -1,30 +1,14 @@
 /**
- * Nearest-id "did you mean" over an arbitrary id set.
+ * Nearest-id "did you mean" over an arbitrary id set — `levenshtein` (THE edit
+ * distance) and `nearestIds` (the length-scaled, affinity-aware cutoff).
  *
- * The command suggester already had a Levenshtein and a fuzzy ranker, but both
- * were shaped around a command CATALOG (command paths, aliases, descriptions).
- * A stale `nge.angular-renderer` in a doc needs the same help against a flat
- * list of template ids, so the distance function moves here and both consume
- * it — a second implementation would drift, and then two surfaces would
- * disagree about what "close" means.
- *
- * A suggestion is only offered when it is actually close. Printing the
- * alphabetically-first id next to every typo trains people to ignore the line.
- */
-/** Levenshtein edit distance. Iterative, one row of state. */
-export declare function levenshtein(a: string, b: string): number;
-/** One candidate the query might have meant. */
-export interface INearestId {
-    readonly id: string;
-    readonly distance: number;
-}
-/**
- * The closest ids to `query`, nearest first.
- *
- * The cutoff scales with the query's length — one edit is a lot in `foo` and
- * very little in `nge.angular-renderer` — and is capped so a long id cannot
- * drag in something unrelated. Ties break lexically so the output is stable
- * across runs, which matters when it lands in a committed diff.
+ * Round 13: both moved to `@shrkcrft/core` so the lowest layer — the
+ * `expectEmpty` marker parser (`normalizeUnitList`) — can offer a did-you-mean
+ * for a misspelled marker key without importing upward. This module re-exports
+ * them unchanged, so every existing `@shrkcrft/inspector` import keeps working
+ * and there is still ONE scorer: the CLI's `editDistance` IS this `levenshtein`
+ * (r75-did-you-mean-one-scorer), and a second implementation would drift.
  */
-export declare function nearestIds(query: string, candidates: readonly string[], limit?: number): readonly INearestId[];
+export { levenshtein, nearestIds } from '@shrkcrft/core';
+export type { INearestId } from '@shrkcrft/core';
 //# sourceMappingURL=nearest-id.d.ts.map

package/dist/nearest-id.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"nearest-id.d.ts","sourceRoot":"","sources":["../src/nearest-id.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,8DAA8D;AAC9D,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAiBxD;AAED,gDAAgD;AAChD,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CACxB,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,KAAK,SAAI,GACR,SAAS,UAAU,EAAE,CAiBvB"}
+{"version":3,"file":"nearest-id.d.ts","sourceRoot":"","sources":["../src/nearest-id.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AACzD,YAAY,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC"}