@mohasinac/appkit 4.58.0 → 4.59.0

package/dist/seed/_helpers/category-models.d.ts

@@ -1,12 +0,0 @@
-import type { CategoryTreeNode } from "./category-tree";
-/**
- * Named-model leaves, keyed by the tier-3 line they belong to.
- *
- * 🛑 The spread is safe ONLY because no line spans two chunks — the
- * generator guarantees that. If one ever did, the later spread would
- * REPLACE the earlier array rather than concatenating it, and every leaf
- * in the first half would vanish with no error.
- */
-export declare const MODEL_LEAVES: Record<string, CategoryTreeNode[]>;
-/** Total named-model leaves — asserted by the seed so a silent drop is loud. */
-export declare const MODEL_LEAF_COUNT = 1904;

package/dist/seed/_helpers/category-models.js

@@ -1,45 +0,0 @@
-/*
- * GENERATED by scripts/gen-category-models.mjs — do not edit by hand.
- *
- * WHY: the named-model tier-4 leaves (Lost Longinus, Storm Pegasus, Dran
- *      Sword …). A named model is a PLAIN category leaf with `categoryType`
- *      omitted, so `deriveTaxonomy` derives its full ancestor chain,
- *      `countersReconcile` tallies it and the sitemap includes it — none of
- *      which `categoryType:"sublisting"` does.
- *
- * WHAT: Record<tier-3 line id, CategoryTreeNode[]>, spread into
- *       CATEGORY_FOREST by `category-forest.ts`.
- *
- * 🛑 The prose is ours, generated from facts (name, type, spin, line,
- *    product code, marque) taken from a CC-BY-SA-derived corpus. No corpus
- *    sentence is reproduced. The `aliases` carry the Hasbro name and the
- *    product code because those are what buyers actually type.
- *
- * @tag domain:categories
- * @tag layer:seed
- * @tag pattern:generated
- * @tag access:server-only
- * @tag sideEffects:none
- */
-import { modelChunk0 } from "./category-models/chunk0.js";
-import { modelChunk1 } from "./category-models/chunk1.js";
-import { modelChunk2 } from "./category-models/chunk2.js";
-import { modelChunk3 } from "./category-models/chunk3.js";
-import { modelChunk4 } from "./category-models/chunk4.js";
-/**
- * Named-model leaves, keyed by the tier-3 line they belong to.
- *
- * 🛑 The spread is safe ONLY because no line spans two chunks — the
- * generator guarantees that. If one ever did, the later spread would
- * REPLACE the earlier array rather than concatenating it, and every leaf
- * in the first half would vanish with no error.
- */
-export const MODEL_LEAVES = {
-    ...modelChunk0,
-    ...modelChunk1,
-    ...modelChunk2,
-    ...modelChunk3,
-    ...modelChunk4,
-};
-/** Total named-model leaves — asserted by the seed so a silent drop is loud. */
-export const MODEL_LEAF_COUNT = 1904;

package/dist/seed/_helpers/category-names.d.ts

@@ -1,54 +0,0 @@
-import type { ProductDocument } from "../../features/products/schemas";
-export declare function deriveCategoryNames(slugs: readonly string[] | undefined): string[] | undefined;
-/**
- * Derive the full ancestor closure from the head of an existing chain.
- *
- * ## 🛑 The drift this ends — measured, 6 of 1,039 live products
- *
- * `categorySlugs` is the ancestor closure and it was hand-written per record
- * too, so a chain could SKIP A TIER and nothing noticed:
- *
- *     product-beyblade-original-driger-v
- *       got      driger-v > original-tops > beyblade-original > spinning-tops
- *       expected driger-v > original-magnacore > original-tops > …
- *
- * The category page matches `array-contains-any [its own id]` against this
- * array (CLAUDE.md: "a category page matches on its own id alone"), so a
- * missing intermediate means the product is **absent from that node's page**
- * while appearing correctly on every other node in its chain. Six products were
- * invisible on their own system sub-line.
- *
- * `countersReconcile`'s rollup invariant cannot see this: it computes the counts
- * FROM these closures, so a skipped tier is simply a tier with a lower count,
- * and `own + Σ(children.total) === total` still holds exactly. The only way to
- * find it is to re-derive the chain and compare.
- *
- * ## 🛑 A SECOND ASSIGNMENT IS LEFT ALONE, NOT COLLAPSED
- *
- * This derives from `slugs[0]` — the head, which is what `readAssignments`
- * treats as the assignment. A product filed under two roots would carry two
- * concatenated closures, and deriving from the head alone would silently DELETE
- * the second one, turning a drift-fix into data loss.
- *
- * So the rule is: overwrite only when the existing array is a SUBSET of the
- * derived closure. That is precisely the drift case (ids missing from the
- * middle). An id outside the derived closure means either a second assignment
- * or something this helper cannot safely interpret, and both must survive to be
- * reported rather than be quietly rewritten.
- *
- * Measured when this was written: 0 of 71 seeded products carry `categoryIds`
- * and 0 carry a multi-root closure — so the subset rule fires on all six real
- * cases and guards a case that does not exist yet.
- */
-export declare function deriveCategoryClosure(slugs: readonly string[] | undefined): string[] | undefined;
-/**
- * Pipeline step: replace whatever `categorySlugs` and `categoryNames` a record
- * carries with the derivation. Deliberately an OVERWRITE rather than a
- * fill-if-absent — a hand-written value that disagrees IS the defect, so
- * preferring it would preserve every one of them.
- *
- * Order matters: the closure is derived first, then the names from the derived
- * closure. Deriving names from the stale chain and then fixing the chain would
- * leave the two mirrors disagreeing again, one tier apart.
- */
-export declare function withDerivedCategoryNames(p: Partial<ProductDocument>): Partial<ProductDocument>;

package/dist/seed/_helpers/category-names.js

@@ -1,118 +0,0 @@
-import { CATEGORY_FOREST } from "./category-forest.js";
-let nameById = null;
-/** id -> its ancestors, NEAREST FIRST (parent, grandparent, …, root). */
-let ancestorsById = null;
-function build() {
-    const n = new Map();
-    const a = new Map();
-    const walk = (nodes, trail) => {
-        for (const node of nodes ?? []) {
-            if (typeof node.id === "string") {
-                n.set(node.id, node.name);
-                a.set(node.id, [...trail]);
-                walk(node.children, [node.id, ...trail]);
-            }
-            else {
-                // A node with no id contributes no ancestry, but its children still do.
-                walk(node.children, trail);
-            }
-        }
-    };
-    walk(CATEGORY_FOREST, []);
-    nameById = n;
-    ancestorsById = a;
-}
-function names() {
-    if (!nameById)
-        build();
-    return nameById;
-}
-function ancestors() {
-    if (!ancestorsById)
-        build();
-    return ancestorsById;
-}
-export function deriveCategoryNames(slugs) {
-    if (!Array.isArray(slugs) || slugs.length === 0)
-        return undefined;
-    const byId = names();
-    return slugs.map((id) => byId.get(id) ?? id);
-}
-/**
- * Derive the full ancestor closure from the head of an existing chain.
- *
- * ## 🛑 The drift this ends — measured, 6 of 1,039 live products
- *
- * `categorySlugs` is the ancestor closure and it was hand-written per record
- * too, so a chain could SKIP A TIER and nothing noticed:
- *
- *     product-beyblade-original-driger-v
- *       got      driger-v > original-tops > beyblade-original > spinning-tops
- *       expected driger-v > original-magnacore > original-tops > …
- *
- * The category page matches `array-contains-any [its own id]` against this
- * array (CLAUDE.md: "a category page matches on its own id alone"), so a
- * missing intermediate means the product is **absent from that node's page**
- * while appearing correctly on every other node in its chain. Six products were
- * invisible on their own system sub-line.
- *
- * `countersReconcile`'s rollup invariant cannot see this: it computes the counts
- * FROM these closures, so a skipped tier is simply a tier with a lower count,
- * and `own + Σ(children.total) === total` still holds exactly. The only way to
- * find it is to re-derive the chain and compare.
- *
- * ## 🛑 A SECOND ASSIGNMENT IS LEFT ALONE, NOT COLLAPSED
- *
- * This derives from `slugs[0]` — the head, which is what `readAssignments`
- * treats as the assignment. A product filed under two roots would carry two
- * concatenated closures, and deriving from the head alone would silently DELETE
- * the second one, turning a drift-fix into data loss.
- *
- * So the rule is: overwrite only when the existing array is a SUBSET of the
- * derived closure. That is precisely the drift case (ids missing from the
- * middle). An id outside the derived closure means either a second assignment
- * or something this helper cannot safely interpret, and both must survive to be
- * reported rather than be quietly rewritten.
- *
- * Measured when this was written: 0 of 71 seeded products carry `categoryIds`
- * and 0 carry a multi-root closure — so the subset rule fires on all six real
- * cases and guards a case that does not exist yet.
- */
-export function deriveCategoryClosure(slugs) {
-    if (!Array.isArray(slugs) || slugs.length === 0)
-        return undefined;
-    const head = slugs[0];
-    const chain = ancestors().get(head);
-    // An unknown head keeps its hand-written chain: inventing one from a node the
-    // forest does not have would be worse than leaving a visibly wrong value for
-    // the dangling-id sweep to find.
-    if (!chain)
-        return undefined;
-    const derived = [head, ...chain];
-    const outside = slugs.filter((s) => !derived.includes(s));
-    if (outside.length > 0)
-        return undefined;
-    return derived;
-}
-/**
- * Pipeline step: replace whatever `categorySlugs` and `categoryNames` a record
- * carries with the derivation. Deliberately an OVERWRITE rather than a
- * fill-if-absent — a hand-written value that disagrees IS the defect, so
- * preferring it would preserve every one of them.
- *
- * Order matters: the closure is derived first, then the names from the derived
- * closure. Deriving names from the stale chain and then fixing the chain would
- * leave the two mirrors disagreeing again, one tier apart.
- */
-export function withDerivedCategoryNames(p) {
-    const closure = deriveCategoryClosure(p.categorySlugs);
-    const slugs = closure ?? p.categorySlugs;
-    const names = deriveCategoryNames(slugs);
-    if (!closure && !names)
-        return p;
-    return {
-        ...p,
-        ...(closure ? { categorySlugs: closure } : {}),
-        ...(names ? { categoryNames: names } : {}),
-    };
-}

package/dist/seed/_helpers/category-parts-glossary-map.d.ts

@@ -1 +0,0 @@
-export declare const PART_CATEGORY_TO_GLOSSARY_ID: Readonly<Record<string, string>>;