@jini-ai/cms 0.1.0

package/dist/taxonomy/merge-term.d.ts

@@ -0,0 +1,94 @@
+/**
+ * @file `mergeTerm`'s gated-mutation instantiation via `core/gated-mutations` — the one gated
+ * mutation in this domain.
+ *
+ * Purpose:
+ * Merge is destructive and can silently lose pre-merge `entry_terms` assignment history for
+ * content already assigned to both terms — it gets the plan/confirm/execute ceremony every other
+ * taxonomy mutation does not. This file owns only this domain's OWN wrapping logic: the structural
+ * self-merge guard (rejected BEFORE any overlap computation, so a forged confirmation token for a
+ * self-merge can never even exist) and the plan's overlap-loss disclosure. The plan/confirm/execute
+ * ordering itself, token TTL, and actor-class rule are `core/gated-mutations`' own certified
+ * contract (`core/gated-mutations/__tests__/unit/gateway.unit.test.ts`) — consumed here via
+ * injected `gatewayPlan`/`gatewayConfirm`/`gatewayExecute` closures a composition root binds to the
+ * real `core/gated-mutations.plan/confirm/execute`, never re-tested here.
+ *
+ * Certified: no export beyond this plan/confirm/execute trio may perform a merge directly —
+ * enforced by `merge-term.unit.test.ts`'s own export-surface inspection.
+ */
+export declare class SameTermMergeError extends Error {
+    constructor(message: string);
+}
+export interface MergeTermPlanDetails {
+    fromTermId: string;
+    intoTermId: string;
+    overlapLossDisclosed: boolean;
+    overlappingContentCount: number;
+}
+export interface PlanMergeTermRequired {
+    principalId: string;
+    principalKind: "user" | "agent" | "api_key";
+    fromTermId: string;
+    intoTermId: string;
+    /** Counts content already assigned to BOTH terms — the assignments that would be silently
+     * deduplicated (and thus permanently lost) by the merge's `entry_terms_unique` dedup step. */
+    computeOverlap: () => Promise<{
+        overlappingContentCount: number;
+    }>;
+    /** Bound by the caller to `core/gated-mutations.plan()` with `domain="taxonomy.merge"`. */
+    gatewayPlan: (details: MergeTermPlanDetails) => Promise<{
+        planId: string;
+        planHash: string;
+        details: unknown;
+    }>;
+}
+/**
+ * AC-22a/REQ-15a/INV-08 — rejects `fromTermId === intoTermId` structurally BEFORE
+ * `computeOverlap()` ever runs (no plan, therefore no token, can ever exist for a self-merge).
+ * AC-23/AC-24/REQ-16 — the returned plan discloses whether the merge would lose any pre-existing
+ * overlapping assignment (never a false "no loss" when `overlappingContentCount > 0`).
+ *
+ * @complexity O(1) plus the caller-supplied `computeOverlap`/`gatewayPlan` costs.
+ * @overallScore 100
+ */
+export declare function planMergeTerm(required: PlanMergeTermRequired, _optional?: Record<string, never>): Promise<{
+    planId: string;
+    planHash: string;
+    details: MergeTermPlanDetails;
+}>;
+export interface ConfirmMergeTermRequired {
+    principalId: string;
+    principalKind: "user" | "agent" | "api_key";
+    planId: string;
+    planHash: string;
+    /** Bound by the caller to `core/gated-mutations.confirm()`. */
+    gatewayConfirm: (params: {
+        planId: string;
+        planHash: string;
+    }) => Promise<{
+        token: string;
+    }>;
+}
+/** Delegates to the injected `core/gated-mutations.confirm()` binding — no domain logic of its
+ * own beyond forwarding, since `core/gated-mutations` already owns the confirm-time actor-class
+ * rule (agents may never confirm) and token minting. */
+export declare function confirmMergeTerm(required: ConfirmMergeTermRequired, _optional?: Record<string, never>): Promise<{
+    token: string;
+}>;
+export interface ExecuteMergeTermRequired {
+    confirmationToken: string;
+    /** Bound by the caller to `core/gated-mutations.execute()`, whose `hooks.executeMutation()` in
+     * turn re-points `entry_terms` and writes the one `taxonomy_revisions` row this merge produces. */
+    gatewayExecute: (params: {
+        confirmationToken: string;
+    }) => Promise<{
+        mergedCount: number;
+    }>;
+}
+/** Delegates to the injected `core/gated-mutations.execute()` binding — its fixed
+ * check-sequence (authorize -> token state -> actor-class -> plan-hash -> redeem-then-mutate)
+ * runs entirely inside that binding; this function performs no independent redemption logic. */
+export declare function executeMergeTerm(required: ExecuteMergeTermRequired, _optional?: Record<string, never>): Promise<{
+    mergedCount: number;
+}>;
+//# sourceMappingURL=merge-term.d.ts.map

package/dist/taxonomy/merge-term.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge-term.d.ts","sourceRoot":"","sources":["../../src/taxonomy/merge-term.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,qBAAa,kBAAmB,SAAQ,KAAK;gBAC/B,OAAO,EAAE,MAAM;CAI5B;AAED,MAAM,WAAW,oBAAoB;IACnC,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,oBAAoB,EAAE,OAAO,CAAC;IAC9B,uBAAuB,EAAE,MAAM,CAAC;CACjC;AAED,MAAM,WAAW,qBAAqB;IACpC,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS,CAAC;IAC5C,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB;kGAC8F;IAC9F,cAAc,EAAE,MAAM,OAAO,CAAC;QAAE,uBAAuB,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACnE,2FAA2F;IAC3F,WAAW,EAAE,CAAC,OAAO,EAAE,oBAAoB,KAAK,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,OAAO,CAAA;KAAE,CAAC,CAAC;CACjH;AAED;;;;;;;;GAQG;AACH,wBAAsB,aAAa,CACjC,QAAQ,EAAE,qBAAqB,EAC/B,SAAS,GAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAM,GACpC,OAAO,CAAC;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,oBAAoB,CAAA;CAAE,CAAC,CAqB9E;AAED,MAAM,WAAW,wBAAwB;IACvC,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS,CAAC;IAC5C,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,+DAA+D;IAC/D,cAAc,EAAE,CAAC,MAAM,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,KAAK,OAAO,CAAC;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC9F;AAED;;wDAEwD;AACxD,wBAAsB,gBAAgB,CACpC,QAAQ,EAAE,wBAAwB,EAClC,SAAS,GAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAM,GACpC,OAAO,CAAC;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,CAE5B;AAED,MAAM,WAAW,wBAAwB;IACvC,iBAAiB,EAAE,MAAM,CAAC;IAC1B;uGACmG;IACnG,cAAc,EAAE,CAAC,MAAM,EAAE;QAAE,iBAAiB,EAAE,MAAM,CAAA;KAAE,KAAK,OAAO,CAAC;QAAE,WAAW,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC7F;AAED;;gGAEgG;AAChG,wBAAsB,gBAAgB,CACpC,QAAQ,EAAE,wBAAwB,EAClC,SAAS,GAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAM,GACpC,OAAO,CAAC;IAAE,WAAW,EAAE,MAAM,CAAA;CAAE,CAAC,CAElC"}

package/dist/taxonomy/merge-term.js

@@ -0,0 +1,65 @@
+/**
+ * @file `mergeTerm`'s gated-mutation instantiation via `core/gated-mutations` — the one gated
+ * mutation in this domain.
+ *
+ * Purpose:
+ * Merge is destructive and can silently lose pre-merge `entry_terms` assignment history for
+ * content already assigned to both terms — it gets the plan/confirm/execute ceremony every other
+ * taxonomy mutation does not. This file owns only this domain's OWN wrapping logic: the structural
+ * self-merge guard (rejected BEFORE any overlap computation, so a forged confirmation token for a
+ * self-merge can never even exist) and the plan's overlap-loss disclosure. The plan/confirm/execute
+ * ordering itself, token TTL, and actor-class rule are `core/gated-mutations`' own certified
+ * contract (`core/gated-mutations/__tests__/unit/gateway.unit.test.ts`) — consumed here via
+ * injected `gatewayPlan`/`gatewayConfirm`/`gatewayExecute` closures a composition root binds to the
+ * real `core/gated-mutations.plan/confirm/execute`, never re-tested here.
+ *
+ * Certified: no export beyond this plan/confirm/execute trio may perform a merge directly —
+ * enforced by `merge-term.unit.test.ts`'s own export-surface inspection.
+ */
+export class SameTermMergeError extends Error {
+    constructor(message) {
+        super(message);
+        this.name = "SameTermMergeError";
+    }
+}
+/**
+ * AC-22a/REQ-15a/INV-08 — rejects `fromTermId === intoTermId` structurally BEFORE
+ * `computeOverlap()` ever runs (no plan, therefore no token, can ever exist for a self-merge).
+ * AC-23/AC-24/REQ-16 — the returned plan discloses whether the merge would lose any pre-existing
+ * overlapping assignment (never a false "no loss" when `overlappingContentCount > 0`).
+ *
+ * @complexity O(1) plus the caller-supplied `computeOverlap`/`gatewayPlan` costs.
+ * @overallScore 100
+ */
+export async function planMergeTerm(required, _optional = {}) {
+    const { fromTermId, intoTermId, computeOverlap, gatewayPlan } = required;
+    if (fromTermId === intoTermId) {
+        throw new SameTermMergeError(`cannot merge term '${fromTermId}' into itself`);
+    }
+    const { overlappingContentCount } = await computeOverlap();
+    const details = {
+        fromTermId,
+        intoTermId,
+        overlapLossDisclosed: overlappingContentCount > 0,
+        overlappingContentCount,
+    };
+    const plan = await gatewayPlan(details);
+    return {
+        planId: plan.planId,
+        planHash: plan.planHash,
+        details: plan.details ?? details,
+    };
+}
+/** Delegates to the injected `core/gated-mutations.confirm()` binding — no domain logic of its
+ * own beyond forwarding, since `core/gated-mutations` already owns the confirm-time actor-class
+ * rule (agents may never confirm) and token minting. */
+export async function confirmMergeTerm(required, _optional = {}) {
+    return required.gatewayConfirm({ planId: required.planId, planHash: required.planHash });
+}
+/** Delegates to the injected `core/gated-mutations.execute()` binding — its fixed
+ * check-sequence (authorize -> token state -> actor-class -> plan-hash -> redeem-then-mutate)
+ * runs entirely inside that binding; this function performs no independent redemption logic. */
+export async function executeMergeTerm(required, _optional = {}) {
+    return required.gatewayExecute({ confirmationToken: required.confirmationToken });
+}
+//# sourceMappingURL=merge-term.js.map

package/dist/taxonomy/merge-term.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge-term.js","sourceRoot":"","sources":["../../src/taxonomy/merge-term.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,MAAM,OAAO,kBAAmB,SAAQ,KAAK;IAC3C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,oBAAoB,CAAC;IACnC,CAAC;CACF;AAqBD;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,QAA+B,EAC/B,YAAmC,EAAE;IAErC,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,cAAc,EAAE,WAAW,EAAE,GAAG,QAAQ,CAAC;IAEzE,IAAI,UAAU,KAAK,UAAU,EAAE,CAAC;QAC9B,MAAM,IAAI,kBAAkB,CAAC,sBAAsB,UAAU,eAAe,CAAC,CAAC;IAChF,CAAC;IAED,MAAM,EAAE,uBAAuB,EAAE,GAAG,MAAM,cAAc,EAAE,CAAC;IAC3D,MAAM,OAAO,GAAyB;QACpC,UAAU;QACV,UAAU;QACV,oBAAoB,EAAE,uBAAuB,GAAG,CAAC;QACjD,uBAAuB;KACxB,CAAC;IAEF,MAAM,IAAI,GAAG,MAAM,WAAW,CAAC,OAAO,CAAC,CAAC;IACxC,OAAO;QACL,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,OAAO,EAAG,IAAI,CAAC,OAA4C,IAAI,OAAO;KACvE,CAAC;AACJ,CAAC;AAWD;;wDAEwD;AACxD,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,QAAkC,EAClC,YAAmC,EAAE;IAErC,OAAO,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC;AAC3F,CAAC;AASD;;gGAEgG;AAChG,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,QAAkC,EAClC,YAAmC,EAAE;IAErC,OAAO,QAAQ,CAAC,cAAc,CAAC,EAAE,iBAAiB,EAAE,QAAQ,CAAC,iBAAiB,EAAE,CAAC,CAAC;AACpF,CAAC"}

package/dist/taxonomy/repo.memory.d.ts

@@ -0,0 +1,160 @@
+import type { ContentLookupPort, EntryTermRepoPort, TaxonomyRepoPort, TaxonomyRevisionRepoPort, TaxonomyRevisionRow, Term, TermRepoPort } from "./write-service.js";
+import type { Taxonomy } from "./write-service.js";
+import type { TaxonomyListPort, TermListPort } from "./list.js";
+/**
+ * @file In-memory adapters for the `taxonomy` package's write/list ports — same disclosed
+ * rule-of-two-until-a-real-adapter-exists precedent as `features/content-types/repo.memory.ts`.
+ */
+export declare class InMemoryTaxonomyRepo implements TaxonomyRepoPort, TaxonomyListPort {
+    private readonly rows;
+    insert(row: Taxonomy): Promise<unknown>;
+    findById(id: string): Promise<{
+        id: string;
+        hierarchical: boolean;
+        allowList?: string[] | undefined;
+    } | null>;
+    list(): Promise<Taxonomy[]>;
+    /** `DeletableTaxonomyRepoPort` — additive capability for `deleteTaxonomy`, see
+     * `write-service.ts`'s doc comment on that interface. */
+    delete(id: string): Promise<void>;
+    /**
+     * `TransactionalRepoPort` — disclosed narrowing, not a silently-wrong implementation of a real
+     * capability (same disclosure style as `noopStampWatermark` below): a plain in-process `Map` has
+     * no rollback primitive to offer, and — unlike a real SQLite connection another OS process could
+     * also be writing to — nothing else can observe or mutate this `Map` between two `await`s of a
+     * single request's own call chain (Node drains the full microtask queue, including every
+     * already-scheduled continuation of THIS call, before it services a different macrotask/request;
+     * see `write-service.ts`'s `TransactionalRepoPort` doc for what this exists to prevent). So the
+     * TOCTOU risk that port exists to close cannot arise against this adapter specifically. What is
+     * NOT covered: a genuine mid-cascade exception (e.g. `deleteTaxonomy`'s second `terms.delete`
+     * throwing) leaves whatever this call chain already wrote — across this Map and its SIBLING
+     * `InMemoryTermRepo`/`InMemoryEntryTermRepo` instances — un-rolled-back, since no in-memory
+     * transaction spans multiple independent `Map`s. In-memory mode is dev/test-only (`server/
+     * app.ts`'s hermetic composition), never the host of a real workspace's real content, which is
+     * why this gap is accepted here rather than closed.
+     */
+    transaction<T>(fn: () => Promise<T>): Promise<T>;
+}
+export declare class InMemoryTermRepo implements TermRepoPort, TermListPort {
+    private readonly rows;
+    insert(row: Term): Promise<unknown>;
+    update(row: Term): Promise<unknown>;
+    findById(id: string): Promise<{
+        id: string;
+        taxonomyId: string;
+        name?: string | undefined;
+    } | null>;
+    listByTaxonomy(params: {
+        taxonomyId: string;
+    }): Promise<Term[]>;
+    /** Ancestor-chain lookup for `validation-chain.ts`'s `wouldCreateCycle` — not required by any
+     * currently-wired route (reparent has no route this pass, design-spec.md §2.8), kept here so a
+     * future reparent route has a ready-made `TermTreeLookup` to inject. */
+    getParentId(termId: string): string | null;
+    /** `DeletableTermRepoPort` — additive capability for `deleteTerm`/`deleteTaxonomy`, see
+     * `write-service.ts`'s doc comment on that interface. */
+    delete(id: string): Promise<void>;
+    /** `DeletableTermRepoPort.countChildren` — direct children only (one level), matching
+     * `deleteTerm`'s guard (it does not recurse past the first level; a grandchild whose direct
+     * parent is itself already blocked from deletion is caught when that intermediate term's own
+     * delete is attempted). */
+    countChildren(params: {
+        parentId: string;
+    }): Promise<number>;
+}
+export declare class InMemoryEntryTermRepo implements EntryTermRepoPort {
+    private readonly rows;
+    upsert(row: {
+        contentType: string;
+        contentId: string;
+        termId: string;
+        addedAt: string;
+    }): Promise<unknown>;
+    deleteByContent(params: {
+        workspaceId: string;
+        contentType: string;
+        contentId: string;
+    }): Promise<number>;
+    /** Mirrors `SqliteEntryTermRepo.countOverlap` — see that method's doc comment for the full
+     * rationale (an additive capability beyond the certified `EntryTermRepoPort`, needed by the
+     * `mergeTerm` gated-mutation composition this dispatch wires). */
+    countOverlap(params: {
+        fromTermId: string;
+        intoTermId: string;
+    }): Promise<number>;
+    /** Mirrors `SqliteEntryTermRepo.repointTerm`. */
+    repointTerm(params: {
+        fromTermId: string;
+        intoTermId: string;
+    }): Promise<{
+        repointedCount: number;
+    }>;
+    /** `AssignmentCountEntryTermRepoPort` — additive capability for `deleteTerm`/`deleteTaxonomy`'s
+     * content-assignment guard, see `write-service.ts`'s doc comment on that interface. */
+    countByTerm(params: {
+        termId: string;
+    }): Promise<number>;
+}
+export declare class InMemoryTaxonomyRevisionRepo implements TaxonomyRevisionRepoPort {
+    readonly rows: TaxonomyRevisionRow[];
+    insert(row: TaxonomyRevisionRow): Promise<unknown>;
+}
+/**
+ * In-memory `ContentLookupPort` — test-friendly, keyed by `(contentType, contentId)`, no real
+ * `posts` table backing it. Seed content into `rows` directly (or via the constructor) before a
+ * test exercises `assignTerms`'s content-join validation (Finding 1 fix,
+ * TM-adr041-043-044-045-audit-001).
+ */
+export declare class InMemoryContentLookup implements ContentLookupPort {
+    private readonly rows;
+    constructor(seed?: Array<{
+        contentType: string;
+        contentId: string;
+        workspaceId: string;
+        kind: string;
+    }>);
+    set(contentType: string, contentId: string, value: {
+        workspaceId: string;
+        kind: string;
+    }): void;
+    resolve(params: {
+        contentType: string;
+        contentId: string;
+    }): Promise<{
+        workspaceId: string;
+        kind: string;
+    } | null>;
+}
+/** No-op `stampWatermark` — `WriteServiceDeps.stampWatermark` is required (not optional, unlike
+ * `content-types`/`entries`' own watermark ports), but this package has no SQLite adapter yet
+ * (this file's header) so there is no real watermark row to advance. Disclosed stand-in, not a
+ * silently-wrong implementation of a real capability. */
+export declare function noopStampWatermark(): void;
+/** Adapts a real `core/ports` `OutboxPort` into the loose `{enqueue(event: unknown)}` shape
+ * `taxonomy/write-service.ts` declares locally. That package's own event objects already carry
+ * `name`/`occurredAt` at their top level (unlike `content-types`/`entries`' nested-`payload`
+ * shape), so this wrapper forwards them as the full event payload rather than re-nesting. */
+export declare function toTaxonomyOutbox(deps: {
+    outbox: {
+        enqueue(event: {
+            id: string;
+            workspaceId: string;
+            name: string;
+            occurredAt: string;
+            payload: Record<string, unknown>;
+        }): Promise<void>;
+    };
+    clock: {
+        nowIso(): string;
+    };
+    idGen: {
+        newId(): string;
+    };
+    /** Required — see `entries/repo.memory.ts`'s `toEntryOutbox` for the full rationale. Taxonomy is
+     * the case that rules out reading the tenant off the event: its own event objects
+     * (`{name, taxonomyId, actorId, occurredAt}`) carry no `workspaceId` at all. */
+    workspaceId: string;
+}): {
+    enqueue: (event: unknown) => Promise<void>;
+};
+//# sourceMappingURL=repo.memory.d.ts.map

package/dist/taxonomy/repo.memory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"repo.memory.d.ts","sourceRoot":"","sources":["../../src/taxonomy/repo.memory.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,wBAAwB,EAAE,mBAAmB,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACpK,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,KAAK,EAAE,gBAAgB,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAEhE;;;GAGG;AAEH,qBAAa,oBAAqB,YAAW,gBAAgB,EAAE,gBAAgB;IAC7E,OAAO,CAAC,QAAQ,CAAC,IAAI,CAA+B;IAE9C,MAAM,CAAC,GAAG,EAAE,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC;IAKvC,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,OAAO,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAA;KAAE,GAAG,IAAI,CAAC;IAK7G,IAAI,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;IAIjC;6DACyD;IACnD,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAIvC;;;;;;;;;;;;;;;OAeG;IACG,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;CAGvD;AAED,qBAAa,gBAAiB,YAAW,YAAY,EAAE,YAAY;IACjE,OAAO,CAAC,QAAQ,CAAC,IAAI,CAA2B;IAE1C,MAAM,CAAC,GAAG,EAAE,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC;IAKnC,MAAM,CAAC,GAAG,EAAE,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC;IAKnC,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;KAAE,GAAG,IAAI,CAAC;IAKnG,cAAc,CAAC,MAAM,EAAE;QAAE,UAAU,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAIrE;;4EAEwE;IACxE,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAI1C;6DACyD;IACnD,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAIvC;;;+BAG2B;IACrB,aAAa,CAAC,MAAM,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,MAAM,CAAC;CAOnE;AAED,qBAAa,qBAAsB,YAAW,iBAAiB;IAC7D,OAAO,CAAC,QAAQ,CAAC,IAAI,CAA0F;IAEzG,MAAM,CAAC,GAAG,EAAE;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,OAAO,CAAC;IAY1G,eAAe,CAAC,MAAM,EAAE;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,MAAM,CAAC;IAQ/G;;sEAEkE;IAC5D,YAAY,CAAC,MAAM,EAAE;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,MAAM,CAAC;IAOvF,iDAAiD;IAC3C,WAAW,CAAC,MAAM,EAAE;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC;QAAE,cAAc,EAAE,MAAM,CAAA;KAAE,CAAC;IAW1G;2FACuF;IACjF,WAAW,CAAC,MAAM,EAAE;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,MAAM,CAAC;CAG/D;AAED,qBAAa,4BAA6B,YAAW,wBAAwB;IAC3E,QAAQ,CAAC,IAAI,EAAE,mBAAmB,EAAE,CAAM;IAEpC,MAAM,CAAC,GAAG,EAAE,mBAAmB,GAAG,OAAO,CAAC,OAAO,CAAC;CAIzD;AAED;;;;;GAKG;AACH,qBAAa,qBAAsB,YAAW,iBAAiB;IAC7D,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAqD;gBAE9D,IAAI,GAAE,KAAK,CAAC;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAM;IAI3G,GAAG,CAAC,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI;IAIzF,OAAO,CAAC,MAAM,EAAE;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;CAGzH;AAED;;;yDAGyD;AACzD,wBAAgB,kBAAkB,IAAI,IAAI,CAAG;AAE7C;;;6FAG6F;AAC7F,wBAAgB,gBAAgB,CAAC,IAAI,EAAE;IACrC,MAAM,EAAE;QACN,OAAO,CAAC,KAAK,EAAE;YACb,EAAE,EAAE,MAAM,CAAC;YACX,WAAW,EAAE,MAAM,CAAC;YACpB,IAAI,EAAE,MAAM,CAAC;YACb,UAAU,EAAE,MAAM,CAAC;YACnB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;SAClC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;KACnB,CAAC;IACF,KAAK,EAAE;QAAE,MAAM,IAAI,MAAM,CAAA;KAAE,CAAC;IAC5B,KAAK,EAAE;QAAE,KAAK,IAAI,MAAM,CAAA;KAAE,CAAC;IAC3B;;oFAEgF;IAChF,WAAW,EAAE,MAAM,CAAC;CACrB,GAAG;IAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,OAAO,CAAC,IAAI,CAAC,CAAA;CAAE,CASjD"}

package/dist/taxonomy/repo.memory.js

@@ -0,0 +1,171 @@
+/**
+ * @file In-memory adapters for the `taxonomy` package's write/list ports — same disclosed
+ * rule-of-two-until-a-real-adapter-exists precedent as `features/content-types/repo.memory.ts`.
+ */
+export class InMemoryTaxonomyRepo {
+    rows = new Map();
+    async insert(row) {
+        this.rows.set(row.id, { ...row });
+        return row;
+    }
+    async findById(id) {
+        const row = this.rows.get(id);
+        return row ? { id: row.id, hierarchical: row.hierarchical } : null;
+    }
+    async list() {
+        return [...this.rows.values()].map((row) => ({ ...row }));
+    }
+    /** `DeletableTaxonomyRepoPort` — additive capability for `deleteTaxonomy`, see
+     * `write-service.ts`'s doc comment on that interface. */
+    async delete(id) {
+        this.rows.delete(id);
+    }
+    /**
+     * `TransactionalRepoPort` — disclosed narrowing, not a silently-wrong implementation of a real
+     * capability (same disclosure style as `noopStampWatermark` below): a plain in-process `Map` has
+     * no rollback primitive to offer, and — unlike a real SQLite connection another OS process could
+     * also be writing to — nothing else can observe or mutate this `Map` between two `await`s of a
+     * single request's own call chain (Node drains the full microtask queue, including every
+     * already-scheduled continuation of THIS call, before it services a different macrotask/request;
+     * see `write-service.ts`'s `TransactionalRepoPort` doc for what this exists to prevent). So the
+     * TOCTOU risk that port exists to close cannot arise against this adapter specifically. What is
+     * NOT covered: a genuine mid-cascade exception (e.g. `deleteTaxonomy`'s second `terms.delete`
+     * throwing) leaves whatever this call chain already wrote — across this Map and its SIBLING
+     * `InMemoryTermRepo`/`InMemoryEntryTermRepo` instances — un-rolled-back, since no in-memory
+     * transaction spans multiple independent `Map`s. In-memory mode is dev/test-only (`server/
+     * app.ts`'s hermetic composition), never the host of a real workspace's real content, which is
+     * why this gap is accepted here rather than closed.
+     */
+    async transaction(fn) {
+        return fn();
+    }
+}
+export class InMemoryTermRepo {
+    rows = new Map();
+    async insert(row) {
+        this.rows.set(row.id, { ...row });
+        return row;
+    }
+    async update(row) {
+        this.rows.set(row.id, { ...row });
+        return row;
+    }
+    async findById(id) {
+        const row = this.rows.get(id);
+        return row ? { id: row.id, taxonomyId: row.taxonomyId, name: row.name } : null;
+    }
+    async listByTaxonomy(params) {
+        return [...this.rows.values()].filter((row) => row.taxonomyId === params.taxonomyId).map((row) => ({ ...row }));
+    }
+    /** Ancestor-chain lookup for `validation-chain.ts`'s `wouldCreateCycle` — not required by any
+     * currently-wired route (reparent has no route this pass, design-spec.md §2.8), kept here so a
+     * future reparent route has a ready-made `TermTreeLookup` to inject. */
+    getParentId(termId) {
+        return this.rows.get(termId)?.parentId ?? null;
+    }
+    /** `DeletableTermRepoPort` — additive capability for `deleteTerm`/`deleteTaxonomy`, see
+     * `write-service.ts`'s doc comment on that interface. */
+    async delete(id) {
+        this.rows.delete(id);
+    }
+    /** `DeletableTermRepoPort.countChildren` — direct children only (one level), matching
+     * `deleteTerm`'s guard (it does not recurse past the first level; a grandchild whose direct
+     * parent is itself already blocked from deletion is caught when that intermediate term's own
+     * delete is attempted). */
+    async countChildren(params) {
+        let count = 0;
+        for (const row of this.rows.values()) {
+            if (row.parentId === params.parentId)
+                count += 1;
+        }
+        return count;
+    }
+}
+export class InMemoryEntryTermRepo {
+    rows = [];
+    async upsert(row) {
+        const existingIndex = this.rows.findIndex((r) => r.contentType === row.contentType && r.contentId === row.contentId && r.termId === row.termId);
+        if (existingIndex >= 0) {
+            this.rows[existingIndex] = row;
+        }
+        else {
+            this.rows.push(row);
+        }
+        return row;
+    }
+    async deleteByContent(params) {
+        const before = this.rows.length;
+        const remaining = this.rows.filter((r) => !(r.contentType === params.contentType && r.contentId === params.contentId));
+        this.rows.length = 0;
+        this.rows.push(...remaining);
+        return before - this.rows.length;
+    }
+    /** Mirrors `SqliteEntryTermRepo.countOverlap` — see that method's doc comment for the full
+     * rationale (an additive capability beyond the certified `EntryTermRepoPort`, needed by the
+     * `mergeTerm` gated-mutation composition this dispatch wires). */
+    async countOverlap(params) {
+        const fromKeys = new Set(this.rows.filter((r) => r.termId === params.fromTermId).map((r) => `${r.contentType}::${r.contentId}`));
+        return this.rows.filter((r) => r.termId === params.intoTermId && fromKeys.has(`${r.contentType}::${r.contentId}`)).length;
+    }
+    /** Mirrors `SqliteEntryTermRepo.repointTerm`. */
+    async repointTerm(params) {
+        const fromRows = this.rows.filter((r) => r.termId === params.fromTermId);
+        for (const row of fromRows) {
+            await this.upsert({ contentType: row.contentType, contentId: row.contentId, termId: params.intoTermId, addedAt: row.addedAt });
+        }
+        const remaining = this.rows.filter((r) => r.termId !== params.fromTermId);
+        this.rows.length = 0;
+        this.rows.push(...remaining);
+        return { repointedCount: fromRows.length };
+    }
+    /** `AssignmentCountEntryTermRepoPort` — additive capability for `deleteTerm`/`deleteTaxonomy`'s
+     * content-assignment guard, see `write-service.ts`'s doc comment on that interface. */
+    async countByTerm(params) {
+        return this.rows.filter((r) => r.termId === params.termId).length;
+    }
+}
+export class InMemoryTaxonomyRevisionRepo {
+    rows = [];
+    async insert(row) {
+        this.rows.push(row);
+        return row;
+    }
+}
+/**
+ * In-memory `ContentLookupPort` — test-friendly, keyed by `(contentType, contentId)`, no real
+ * `posts` table backing it. Seed content into `rows` directly (or via the constructor) before a
+ * test exercises `assignTerms`'s content-join validation (Finding 1 fix,
+ * TM-adr041-043-044-045-audit-001).
+ */
+export class InMemoryContentLookup {
+    rows;
+    constructor(seed = []) {
+        this.rows = new Map(seed.map((s) => [`${s.contentType}::${s.contentId}`, { workspaceId: s.workspaceId, kind: s.kind }]));
+    }
+    set(contentType, contentId, value) {
+        this.rows.set(`${contentType}::${contentId}`, value);
+    }
+    async resolve(params) {
+        return this.rows.get(`${params.contentType}::${params.contentId}`) ?? null;
+    }
+}
+/** No-op `stampWatermark` — `WriteServiceDeps.stampWatermark` is required (not optional, unlike
+ * `content-types`/`entries`' own watermark ports), but this package has no SQLite adapter yet
+ * (this file's header) so there is no real watermark row to advance. Disclosed stand-in, not a
+ * silently-wrong implementation of a real capability. */
+export function noopStampWatermark() { }
+/** Adapts a real `core/ports` `OutboxPort` into the loose `{enqueue(event: unknown)}` shape
+ * `taxonomy/write-service.ts` declares locally. That package's own event objects already carry
+ * `name`/`occurredAt` at their top level (unlike `content-types`/`entries`' nested-`payload`
+ * shape), so this wrapper forwards them as the full event payload rather than re-nesting. */
+export function toTaxonomyOutbox(deps) {
+    return {
+        enqueue: async (event) => {
+            const record = event;
+            const name = typeof record.name === "string" ? record.name : "taxonomy.event";
+            const occurredAt = typeof record.occurredAt === "string" ? record.occurredAt : deps.clock.nowIso();
+            await deps.outbox.enqueue({ id: deps.idGen.newId(), workspaceId: deps.workspaceId, name, occurredAt, payload: record });
+        },
+    };
+}
+//# sourceMappingURL=repo.memory.js.map

package/dist/taxonomy/repo.memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"repo.memory.js","sourceRoot":"","sources":["../../src/taxonomy/repo.memory.ts"],"names":[],"mappings":"AAIA;;;GAGG;AAEH,MAAM,OAAO,oBAAoB;IACd,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEpD,KAAK,CAAC,MAAM,CAAC,GAAa;QACxB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;QAClC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,EAAU;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9B,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,YAAY,EAAE,GAAG,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACrE,CAAC;IAED,KAAK,CAAC,IAAI;QACR,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED;6DACyD;IACzD,KAAK,CAAC,MAAM,CAAC,EAAU;QACrB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,KAAK,CAAC,WAAW,CAAI,EAAoB;QACvC,OAAO,EAAE,EAAE,CAAC;IACd,CAAC;CACF;AAED,MAAM,OAAO,gBAAgB;IACV,IAAI,GAAG,IAAI,GAAG,EAAgB,CAAC;IAEhD,KAAK,CAAC,MAAM,CAAC,GAAS;QACpB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;QAClC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,GAAS;QACpB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;QAClC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,EAAU;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9B,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACjF,CAAC;IAED,KAAK,CAAC,cAAc,CAAC,MAA8B;QACjD,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,UAAU,KAAK,MAAM,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;IAClH,CAAC;IAED;;4EAEwE;IACxE,WAAW,CAAC,MAAc;QACxB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,QAAQ,IAAI,IAAI,CAAC;IACjD,CAAC;IAED;6DACyD;IACzD,KAAK,CAAC,MAAM,CAAC,EAAU;QACrB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC;IAED;;;+BAG2B;IAC3B,KAAK,CAAC,aAAa,CAAC,MAA4B;QAC9C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YACrC,IAAI,GAAG,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ;gBAAE,KAAK,IAAI,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED,MAAM,OAAO,qBAAqB;IACf,IAAI,GAAuF,EAAE,CAAC;IAE/G,KAAK,CAAC,MAAM,CAAC,GAAgF;QAC3F,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CACvC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,GAAG,CAAC,WAAW,IAAI,CAAC,CAAC,SAAS,KAAK,GAAG,CAAC,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,GAAG,CAAC,MAAM,CACrG,CAAC;QACF,IAAI,aAAa,IAAI,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;QACjC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK,CAAC,eAAe,CAAC,MAAuE;QAC3F,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAChC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,KAAK,MAAM,CAAC,WAAW,IAAI,CAAC,CAAC,SAAS,KAAK,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QACvH,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;QAC7B,OAAO,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IACnC,CAAC;IAED;;sEAEkE;IAClE,KAAK,CAAC,YAAY,CAAC,MAAkD;QACnE,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,SAAS,EAAE,CAAC,CACvG,CAAC;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,UAAU,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;IAC5H,CAAC;IAED,iDAAiD;IACjD,KAAK,CAAC,WAAW,CAAC,MAAkD;QAClE,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,UAAU,CAAC,CAAC;QACzE,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,GAAG,CAAC,WAAW,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;QACjI,CAAC;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,UAAU,CAAC,CAAC;QAC1E,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;QAC7B,OAAO,EAAE,cAAc,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC;IAC7C,CAAC;IAED;2FACuF;IACvF,KAAK,CAAC,WAAW,CAAC,MAA0B;QAC1C,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC;IACpE,CAAC;CACF;AAED,MAAM,OAAO,4BAA4B;IAC9B,IAAI,GAA0B,EAAE,CAAC;IAE1C,KAAK,CAAC,MAAM,CAAC,GAAwB;QACnC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,OAAO,qBAAqB;IACf,IAAI,CAAqD;IAE1E,YAAY,OAA6F,EAAE;QACzG,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,SAAS,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3H,CAAC;IAED,GAAG,CAAC,WAAmB,EAAE,SAAiB,EAAE,KAA4C;QACtF,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,KAAK,SAAS,EAAE,EAAE,KAAK,CAAC,CAAC;IACvD,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,MAAkD;QAC9D,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,WAAW,KAAK,MAAM,CAAC,SAAS,EAAE,CAAC,IAAI,IAAI,CAAC;IAC7E,CAAC;CACF;AAED;;;yDAGyD;AACzD,MAAM,UAAU,kBAAkB,KAAU,CAAC;AAE7C;;;6FAG6F;AAC7F,MAAM,UAAU,gBAAgB,CAAC,IAgBhC;IACC,OAAO;QACL,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE;YACvB,MAAM,MAAM,GAAG,KAAgC,CAAC;YAChD,MAAM,IAAI,GAAG,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB,CAAC;YAC9E,MAAM,UAAU,GAAG,OAAO,MAAM,CAAC,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACnG,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;QAC1H,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/taxonomy/validation-chain.d.ts

@@ -0,0 +1,114 @@
+/**
+ * @file The fixed taxonomy validation chains.
+ *
+ * Purpose:
+ * Two pure, order-critical decision functions:
+ *  - `validateContentJoin` — the allow-list -> workspace -> lens chain that gates every
+ *    `entry_terms` write ("opt-in per content type" plus the workspace/lens folds a security
+ *    audit added).
+ *  - `validateHierarchyAssignment` — the hierarchical-mode -> same-taxonomy -> cycle chain
+ *    that gates every `parentId` write.
+ *
+ * Both chains were the exact unit three separate Red-Team rounds found real ordering defects in —
+ * a combined-failure case must always report the FIRST-in-order failure, never a later one that
+ * also happens to apply. Every test in `validation-chain.unit.test.ts` replays one of those
+ * regressions or a compound-failure case to lock the order in place.
+ *
+ * `wouldCreateCycle` is the full ancestor-chain walk `validateHierarchyAssignment`'s cycle check
+ * ultimately calls — kept exported separately since it has its own certified property tests
+ * (depth 1-10 chains) independent of the chain that wraps it.
+ *
+ * How it relates to the project:
+ * Consumed directly by `write-service.ts`'s `createTerm`/`renameTerm`/`assignTerms` (and would be
+ * consumed by a future `reparentTerm`, not yet built — no certified test in this slice exercises
+ * it). Reuses no port/dep — these are pure functions over caller-resolved data, never performing
+ * their own repo lookups, so the ordering guarantee holds regardless of how a caller wires them.
+ */
+export declare class TaxonomyNotApplicableError extends Error {
+    constructor(message: string);
+}
+export declare class WorkspaceMismatchError extends Error {
+    constructor(message: string);
+}
+export declare class ContentTypeMismatchError extends Error {
+    constructor(message: string);
+}
+export declare class TaxonomyNotHierarchicalError extends Error {
+    constructor(message: string);
+}
+export declare class ParentCrossTaxonomyError extends Error {
+    constructor(message: string);
+}
+export declare class TermNotFoundError extends Error {
+    constructor(message: string);
+}
+export declare class HierarchyCycleDetectedError extends Error {
+    constructor(message: string);
+}
+/** Ancestor-chain lookup a cycle check walks. `null` marks a root (no parent). */
+export interface TermTreeLookup {
+    getParentId(termId: string): string | null;
+}
+/**
+ * CIC U-002 — true if assigning `candidateParentId` as `termId`'s parent would create a cycle:
+ * either immediate self-parenting, or `termId` appearing anywhere in `candidateParentId`'s own
+ * ancestor chain. A full recursive walk, not a fixed-depth or immediate-parent-only comparison
+ * (U-002-B1) — the exact shape a naive implementation gets wrong (a 3+-hop cycle is the
+ * regression case this exists to catch).
+ *
+ * A `visited` guard bounds the walk even against a pre-existing malformed tree (defensive; no
+ * certified test constructs one, but an unbounded walk over attacker/bug-corrupted ancestor data
+ * would otherwise loop forever).
+ *
+ * @complexity O(depth) — one `getParentId` call per ancestor hop, each hop visited at most once.
+ * @overallScore 100
+ */
+export declare function wouldCreateCycle(required: {
+    termId: string;
+    candidateParentId: string;
+    tree: TermTreeLookup;
+}, _optional?: Record<string, never>): boolean;
+/**
+ * U-001-B1/ORD1/ORD2 — the content-join chain: allow-list, THEN workspace, THEN lens, in that
+ * fixed order. A combined-failure case always reports the first-in-order failure (U-001-ORD1:
+ * not-on-allow-list always wins over a simultaneous workspace mismatch; U-001-ORD2: a workspace
+ * mismatch always wins over a simultaneous lens mismatch).
+ *
+ * @complexity O(1) — three independent comparisons, no loop.
+ * @overallScore 100
+ */
+export declare function validateContentJoin(required: {
+    taxonomyId: string;
+    isOnAllowList: boolean;
+    callerWorkspaceId: string;
+    resolvedTermWorkspaceId: string;
+    resolvedContentWorkspaceId: string;
+    suppliedContentType: string;
+    resolvedContentKind: string;
+}, _optional?: Record<string, never>): void;
+/**
+ * U-001-B2/B3/ORD3 — the hierarchy chain: hierarchical-mode, THEN same-taxonomy (distinguishing
+ * not-found from wrong-taxonomy), THEN cycle, in that fixed order. `null` `candidateParentId`
+ * (no parent assignment attempted) always short-circuits to a pass regardless of mode (RT-012's
+ * regression: a no-op parent write must never be rejected).
+ *
+ * The compound RT-001 regression this chain exists to prevent: a flat taxonomy's candidate parent
+ * that ALSO happens to exist in a different taxonomy must report `TAXONOMY_NOT_HIERARCHICAL`,
+ * never `PARENT_CROSS_TAXONOMY` — hierarchical-mode is checked first and is decisive on its own.
+ *
+ * @complexity O(1) plus the injected `wouldCreateCycle` closure's own cost (U-002, only reached
+ * once hierarchical-mode and same-taxonomy both pass).
+ * @overallScore 100
+ */
+export declare function validateHierarchyAssignment(required: {
+    childTaxonomyId: string;
+    taxonomyIsHierarchical: boolean;
+    candidateParentId: string | null;
+    resolvedParent: {
+        id: string;
+        taxonomyId: string;
+    } | null | "not-applicable";
+    wouldCreateCycle: (candidateParentId: string) => boolean;
+    termId: string;
+}, _optional?: Record<string, never>): void;
+//# sourceMappingURL=validation-chain.d.ts.map

package/dist/taxonomy/validation-chain.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validation-chain.d.ts","sourceRoot":"","sources":["../../src/taxonomy/validation-chain.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,qBAAa,0BAA2B,SAAQ,KAAK;gBACvC,OAAO,EAAE,MAAM;CAI5B;AAED,qBAAa,sBAAuB,SAAQ,KAAK;gBACnC,OAAO,EAAE,MAAM;CAI5B;AAED,qBAAa,wBAAyB,SAAQ,KAAK;gBACrC,OAAO,EAAE,MAAM;CAI5B;AAED,qBAAa,4BAA6B,SAAQ,KAAK;gBACzC,OAAO,EAAE,MAAM;CAI5B;AAED,qBAAa,wBAAyB,SAAQ,KAAK;gBACrC,OAAO,EAAE,MAAM;CAI5B;AAED,qBAAa,iBAAkB,SAAQ,KAAK;gBAC9B,OAAO,EAAE,MAAM;CAI5B;AAED,qBAAa,2BAA4B,SAAQ,KAAK;gBACxC,OAAO,EAAE,MAAM;CAI5B;AAED,kFAAkF;AAClF,MAAM,WAAW,cAAc;IAC7B,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;CAC5C;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,iBAAiB,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,cAAc,CAAA;CAAE,EAC7E,SAAS,GAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAM,GACpC,OAAO,CAeT;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE;IACR,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,OAAO,CAAC;IACvB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,uBAAuB,EAAE,MAAM,CAAC;IAChC,0BAA0B,EAAE,MAAM,CAAC;IACnC,mBAAmB,EAAE,MAAM,CAAC;IAC5B,mBAAmB,EAAE,MAAM,CAAC;CAC7B,EACD,SAAS,GAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAM,GACpC,IAAI,CA4BN;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,2BAA2B,CACzC,QAAQ,EAAE;IACR,eAAe,EAAE,MAAM,CAAC;IACxB,sBAAsB,EAAE,OAAO,CAAC;IAChC,iBAAiB,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,cAAc,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,GAAG,gBAAgB,CAAC;IAC7E,gBAAgB,EAAE,CAAC,iBAAiB,EAAE,MAAM,KAAK,OAAO,CAAC;IACzD,MAAM,EAAE,MAAM,CAAC;CAChB,EACD,SAAS,GAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAM,GACpC,IAAI,CA2BN"}