@refrakt-md/runes 0.34.0 → 0.35.0

package/dist/lib/schema-table.d.ts

@@ -0,0 +1,176 @@
+import Markdoc from '@markdoc/markdoc';
+import type { RenderableTreeNode } from '@markdoc/markdoc';
+declare const Tag: typeof Markdoc.Tag;
+/**
+ * The declarative schema.org table, and the applier that realises it
+ * (SPEC-130 / WORK-565).
+ *
+ * ## Why this is data consulted at transform time, not engine config
+ *
+ * The obvious home is the identity transform engine, and it does not work.
+ * `packages/content/src/site.ts` never applies the engine — it runs
+ * `Markdoc.transform`, then `extractSeo`, and `collectJsonLd` *derives* the
+ * JSON-LD by walking that tree for `typeof`. The engine runs later, at render
+ * time, so schema emitted there would reach the HTML and never reach the
+ * JSON-LD.
+ *
+ * So the table is an option to `createContentModelSchema`, sitting beside the
+ * rune's other self-declarations (`sections`, `mediaSlots`, `provides`, `base`),
+ * and the applier runs on the rune's own output.
+ *
+ * ## Three resolution strategies, and why the third exists
+ *
+ * `createComponentRenderable` drops a property `<meta>` that no `schema:` map
+ * names — it is classified pure data and its value is already in the bag. Once
+ * runes stop declaring `schema:` themselves, those nodes are gone by the time
+ * the applier runs. The bag is the recovery:
+ *
+ * 1. **Stamp in place** — a named node that survives into the output.
+ * 2. **Rebuild from the bag** — a value-only source whose carrier was dropped.
+ * 3. **Synthesise an entity** — a nested span built from either of the above.
+ *
+ * That is why `createComponentRenderable` needs no knowledge of schema at all:
+ * it simply always treats property metas as pure data, which is what it already
+ * does when `schema:` is absent.
+ *
+ * ## Name resolution is attribute-agnostic, deliberately
+ *
+ * A source resolves whether it surfaces as `data-name` or `data-field`, and the
+ * applier never branches on which. SPEC-133 moves ~97 nodes between `properties`
+ * and `refs`; under this rule every one of those moves is a no-op for every
+ * table, because the table keys on a name in the rune's flat namespace
+ * (ADR-008), not on the attribute that happens to carry it.
+ */
+/**
+ * Marks a `typeof` the **author** stated, which a parent may not overrule.
+ *
+ * D9's default stands: a parent's `children` row retypes its children, and a
+ * child that says nothing about its type gets the parent's. This is the narrow
+ * opt-out — a `{% track type="song" %}` inside a `{% playlist type="podcast" %}`
+ * stays a song, because saying so and being overruled anyway would make the
+ * attribute a lie.
+ *
+ * It has to be a marker because "no type stated" and "this exact type stated"
+ * are the same value by transform time, and Markdoc transforms bottom-up so a
+ * child cannot ask its parent. An own-property on the Tag rather than an
+ * attribute, so `JSON.parse(JSON.stringify(…))` at the serialize boundary drops
+ * it and it can never reach the HTML; the applier deletes it once read.
+ */
+export declare const SCHEMA_TYPE_EXPLICIT: unique symbol;
+/** A source name in the rune's flat namespace, mapped to a schema.org property. */
+export type PropertyMap = Record<string, string>;
+/** A nested entity: its own type, the property that holds it, its own map. */
+export interface EntityRow {
+    type: string;
+    /** The property on the parent that holds this entity. Required — see below. */
+    property: string;
+    properties?: PropertyMap;
+    /** Properties taking a node's own content, via an RDFa-conformant wrapper. */
+    text?: PropertyMap;
+    /** The wrapper element `text` emits. Defaults to `div`. */
+    textTag?: string;
+    /** Properties whose value is generated rather than read from content. */
+    generated?: Record<string, 'index'>;
+}
+/** One resolvable schema row: a type plus what it maps. */
+export interface SchemaRow {
+    type?: string;
+    properties?: PropertyMap;
+    /**
+     * Properties taking a node's own content. The applier emits the
+     * RDFa-conformant wrapper; no rune hand-writes one.
+     *
+     * The wrapper is conformant, not a workaround. RDFa Core 1.1 §7.5 step 11:
+     * an element carrying both `property` and `typeof` has its object fixed to
+     * the typed resource, so its text is unreachable as a literal. Since
+     * SPEC-082 renders the SEO carriers inline, refrakt publishes RDFa *and*
+     * JSON-LD on the same page — dropping the wrapper would have the two
+     * channels assert different graphs on every accordion, recipe and how-to.
+     */
+    text?: PropertyMap;
+    /**
+     * The wrapper element `text` emits. Defaults to `div`.
+     *
+     * It is a rendering choice, not a schema one — `how-to` and `recipe` wrap an
+     * `<li>`'s content in a `<p>`, and a `<div>` there would change the page's
+     * margins. Declared rather than fixed so the applier can reproduce what each
+     * rune already renders, byte for byte.
+     */
+    textTag?: string;
+    entities?: Record<string, EntityRow>;
+    /** Properties whose value is generated. `index` is the only generator. */
+    generated?: Record<string, 'index'>;
+    /**
+     * Properties that always serialise as an array, however many items (D6).
+     *
+     * `readonly` so a table written the way every other one is — a single
+     * `as const` literal — type-checks; nothing here mutates it.
+     */
+    lists?: readonly string[];
+    /** Per-child-rune type and property remapping. */
+    children?: Record<string, EntityRow>;
+}
+/** A rune's schema table: one row, or a row chosen by an attribute value. */
+export interface SchemaTable extends SchemaRow {
+    /**
+     * Selects a row by the value of the named **attribute**.
+     *
+     * It names an attribute, not a modifier. `modifiers` is read by the engine,
+     * which has no part in this path — the row is picked here, from `attrs`.
+     * `validateSchemaTable` enforces that the named attribute is declared, so
+     * the ambiguity cannot ship silently.
+     */
+    by?: string;
+    /** Rows keyed by attribute value, used with `by`. */
+    rows?: Record<string, SchemaRow>;
+    /** The row for when the `by` attribute is absent or unmatched. */
+    fallback?: SchemaRow;
+}
+/** A problem with a table, found at build time. */
+export interface SchemaTableIssue {
+    path: string;
+    message: string;
+}
+/**
+ * Check a table's internal consistency.
+ *
+ * Curation, not validation: nothing here checks a mapping against schema.org,
+ * because refrakt ships no ontology (D5). What it does check is the structural
+ * rule that cannot be got wrong safely — `collectJsonLd` nests a child entity
+ * only when the same node carries both `typeof` and `property`, so declaring a
+ * child's type without the property that holds it produces a detached
+ * top-level entity related to nothing. The table rejects that rather than
+ * emitting it.
+ */
+export declare function validateSchemaTable(table: SchemaTable, declaredAttributes?: string[]): SchemaTableIssue[];
+/** Pick the row a set of attributes selects. */
+export declare function selectRow(table: SchemaTable, attrs: Record<string, unknown>): SchemaRow;
+type AnyTag = InstanceType<typeof Tag>;
+/**
+ * Find a node by name, whichever attribute carries it.
+ *
+ * `data-name` and `data-field` are the two surfaces a name can appear on today,
+ * and SPEC-133 moves nodes between them. Checking both, in one pass, with no
+ * branch on which matched, is what makes those moves a no-op here.
+ */
+/**
+ * Every node bearing a name, in document order, within one rune.
+ *
+ * **The search stops at another rune's node.** ADR-008's flat namespace is
+ * unique *per rune*, so the same name means different things in a parent and in
+ * a child it contains: `character` names its title span `name`, and so does
+ * every `character-section` inside it. Reaching across that boundary published a
+ * character whose `name` was the character plus each of its section headings.
+ */
+export declare function findAllByName(root: RenderableTreeNode | RenderableTreeNode[], name: string): AnyTag[];
+/** The first node bearing a name, within one rune — see `findAllByName`. */
+export declare function findByName(root: RenderableTreeNode | RenderableTreeNode[], name: string): AnyTag | undefined;
+/**
+ * Apply a rune's schema table to its transform output.
+ *
+ * Runs on the rune's own root, after its transform has built the tree and
+ * `createComponentRenderable` has written the field bag.
+ */
+export declare function applySchemaTable(output: RenderableTreeNode, table: SchemaTable, attrs: Record<string, unknown>): RenderableTreeNode;
+export {};
+//# sourceMappingURL=schema-table.d.ts.map

package/dist/lib/schema-table.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema-table.d.ts","sourceRoot":"","sources":["../../src/lib/schema-table.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,kBAAkB,CAAC;AACvC,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAG3D,QAAA,MAAQ,GAAG,oBAAY,CAAC;AAExB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuCG;AAEH;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,oBAAoB,eAA2C,CAAC;AAE7E,mFAAmF;AACnF,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAEjD,8EAA8E;AAC9E,MAAM,WAAW,SAAS;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,+EAA+E;IAC/E,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,CAAC,EAAE,WAAW,CAAC;IACzB,8EAA8E;IAC9E,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,2DAA2D;IAC3D,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,yEAAyE;IACzE,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED,2DAA2D;AAC3D,MAAM,WAAW,SAAS;IACzB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,UAAU,CAAC,EAAE,WAAW,CAAC;IACzB;;;;;;;;;;OAUG;IACH,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB;;;;;;;OAOG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACrC,0EAA0E;IAC1E,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACpC;;;;;OAKG;IACH,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC1B,kDAAkD;IAClD,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;CACrC;AAED,6EAA6E;AAC7E,MAAM,WAAW,WAAY,SAAQ,SAAS;IAC7C;;;;;;;OAOG;IACH,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,qDAAqD;IACrD,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACjC,kEAAkE;IAClE,QAAQ,CAAC,EAAE,SAAS,CAAC;CACrB;AAED,mDAAmD;AACnD,MAAM,WAAW,gBAAgB;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,mBAAmB,CAClC,KAAK,EAAE,WAAW,EAClB,kBAAkB,GAAE,MAAM,EAAO,GAC/B,gBAAgB,EAAE,CA6CpB;AAED,gDAAgD;AAChD,wBAAgB,SAAS,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAKvF;AAID,KAAK,MAAM,GAAG,YAAY,CAAC,OAAO,GAAG,CAAC,CAAC;AAIvC;;;;;;GAMG;AACH;;;;;;;;GAQG;AACH,wBAAgB,aAAa,CAC5B,IAAI,EAAE,kBAAkB,GAAG,kBAAkB,EAAE,EAC/C,IAAI,EAAE,MAAM,GACV,MAAM,EAAE,CA0BV;AAED,4EAA4E;AAC5E,wBAAgB,UAAU,CACzB,IAAI,EAAE,kBAAkB,GAAG,kBAAkB,EAAE,EAC/C,IAAI,EAAE,MAAM,GACV,MAAM,GAAG,SAAS,CAEpB;AAyLD;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC/B,MAAM,EAAE,kBAAkB,EAC1B,KAAK,EAAE,WAAW,EAClB,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC5B,kBAAkB,CAkDpB"}

package/dist/lib/schema-table.js

@@ -0,0 +1,427 @@
+import Markdoc from '@markdoc/markdoc';
+import { SCHEMA_LISTS_ATTR } from '../seo.js';
+const { Tag } = Markdoc;
+/**
+ * The declarative schema.org table, and the applier that realises it
+ * (SPEC-130 / WORK-565).
+ *
+ * ## Why this is data consulted at transform time, not engine config
+ *
+ * The obvious home is the identity transform engine, and it does not work.
+ * `packages/content/src/site.ts` never applies the engine — it runs
+ * `Markdoc.transform`, then `extractSeo`, and `collectJsonLd` *derives* the
+ * JSON-LD by walking that tree for `typeof`. The engine runs later, at render
+ * time, so schema emitted there would reach the HTML and never reach the
+ * JSON-LD.
+ *
+ * So the table is an option to `createContentModelSchema`, sitting beside the
+ * rune's other self-declarations (`sections`, `mediaSlots`, `provides`, `base`),
+ * and the applier runs on the rune's own output.
+ *
+ * ## Three resolution strategies, and why the third exists
+ *
+ * `createComponentRenderable` drops a property `<meta>` that no `schema:` map
+ * names — it is classified pure data and its value is already in the bag. Once
+ * runes stop declaring `schema:` themselves, those nodes are gone by the time
+ * the applier runs. The bag is the recovery:
+ *
+ * 1. **Stamp in place** — a named node that survives into the output.
+ * 2. **Rebuild from the bag** — a value-only source whose carrier was dropped.
+ * 3. **Synthesise an entity** — a nested span built from either of the above.
+ *
+ * That is why `createComponentRenderable` needs no knowledge of schema at all:
+ * it simply always treats property metas as pure data, which is what it already
+ * does when `schema:` is absent.
+ *
+ * ## Name resolution is attribute-agnostic, deliberately
+ *
+ * A source resolves whether it surfaces as `data-name` or `data-field`, and the
+ * applier never branches on which. SPEC-133 moves ~97 nodes between `properties`
+ * and `refs`; under this rule every one of those moves is a no-op for every
+ * table, because the table keys on a name in the rune's flat namespace
+ * (ADR-008), not on the attribute that happens to carry it.
+ */
+/**
+ * Marks a `typeof` the **author** stated, which a parent may not overrule.
+ *
+ * D9's default stands: a parent's `children` row retypes its children, and a
+ * child that says nothing about its type gets the parent's. This is the narrow
+ * opt-out — a `{% track type="song" %}` inside a `{% playlist type="podcast" %}`
+ * stays a song, because saying so and being overruled anyway would make the
+ * attribute a lie.
+ *
+ * It has to be a marker because "no type stated" and "this exact type stated"
+ * are the same value by transform time, and Markdoc transforms bottom-up so a
+ * child cannot ask its parent. An own-property on the Tag rather than an
+ * attribute, so `JSON.parse(JSON.stringify(…))` at the serialize boundary drops
+ * it and it can never reach the HTML; the applier deletes it once read.
+ */
+export const SCHEMA_TYPE_EXPLICIT = Symbol.for('refrakt.schemaTypeExplicit');
+/**
+ * Check a table's internal consistency.
+ *
+ * Curation, not validation: nothing here checks a mapping against schema.org,
+ * because refrakt ships no ontology (D5). What it does check is the structural
+ * rule that cannot be got wrong safely — `collectJsonLd` nests a child entity
+ * only when the same node carries both `typeof` and `property`, so declaring a
+ * child's type without the property that holds it produces a detached
+ * top-level entity related to nothing. The table rejects that rather than
+ * emitting it.
+ */
+export function validateSchemaTable(table, declaredAttributes = []) {
+    const issues = [];
+    if (table.by !== undefined) {
+        if (declaredAttributes.length > 0 && !declaredAttributes.includes(table.by)) {
+            issues.push({
+                path: 'by',
+                message: `\`by: '${table.by}'\` names an attribute the rune does not declare. \`by\` selects a row from \`attrs\`, not from a modifier.`,
+            });
+        }
+        if (!table.rows || Object.keys(table.rows).length === 0) {
+            issues.push({ path: 'rows', message: '`by` needs `rows` to select from.' });
+        }
+        if (!table.fallback && !table.type) {
+            issues.push({
+                path: 'fallback',
+                message: '`by` needs an explicit `fallback` row for the absent or unmatched case.',
+            });
+        }
+    }
+    const checkEntities = (rows, path) => {
+        for (const [name, row] of Object.entries(rows ?? {})) {
+            if (!row.property) {
+                issues.push({
+                    path: `${path}.${name}`,
+                    message: `A child entity needs the \`property\` that holds it. Without one it floats up as a detached top-level entity: \`collectJsonLd\` nests a typed node only when it also carries \`property\`.`,
+                });
+            }
+            if (!row.type) {
+                issues.push({ path: `${path}.${name}`, message: 'A child entity needs a `type`.' });
+            }
+        }
+    };
+    const checkRow = (row, path) => {
+        checkEntities(row.entities, `${path}entities`);
+        checkEntities(row.children, `${path}children`);
+    };
+    checkRow(table, '');
+    for (const [value, row] of Object.entries(table.rows ?? {}))
+        checkRow(row, `rows.${value}.`);
+    if (table.fallback)
+        checkRow(table.fallback, 'fallback.');
+    return issues;
+}
+/** Pick the row a set of attributes selects. */
+export function selectRow(table, attrs) {
+    if (!table.by)
+        return table;
+    const value = attrs[table.by];
+    const row = value === undefined ? undefined : table.rows?.[String(value)];
+    return row ?? table.fallback ?? table;
+}
+const isTag = (n) => Markdoc.Tag.isTag(n);
+/**
+ * Find a node by name, whichever attribute carries it.
+ *
+ * `data-name` and `data-field` are the two surfaces a name can appear on today,
+ * and SPEC-133 moves nodes between them. Checking both, in one pass, with no
+ * branch on which matched, is what makes those moves a no-op here.
+ */
+/**
+ * Every node bearing a name, in document order, within one rune.
+ *
+ * **The search stops at another rune's node.** ADR-008's flat namespace is
+ * unique *per rune*, so the same name means different things in a parent and in
+ * a child it contains: `character` names its title span `name`, and so does
+ * every `character-section` inside it. Reaching across that boundary published a
+ * character whose `name` was the character plus each of its section headings.
+ */
+export function findAllByName(root, name) {
+    const kebab = name.replace(/([a-z0-9])([A-Z])/g, '$1-$2').toLowerCase();
+    const out = [];
+    const visit = (node, top) => {
+        if (Array.isArray(node)) {
+            for (const c of node)
+                visit(c, top);
+            return;
+        }
+        if (!isTag(node))
+            return;
+        const attrs = node.attributes ?? {};
+        if (!top && attrs['data-rune'] !== undefined)
+            return;
+        const named = attrs['data-name'] === name ||
+            attrs['data-name'] === kebab ||
+            attrs['data-field'] === name ||
+            attrs['data-field'] === kebab;
+        if (named) {
+            out.push(node);
+            // A name marks one node, not a subtree: descending into a match would
+            // find nothing new and risks a nested re-use of the same name.
+            return;
+        }
+        for (const c of node.children ?? [])
+            visit(c, false);
+    };
+    visit(root, true);
+    return out;
+}
+/** The first node bearing a name, within one rune — see `findAllByName`. */
+export function findByName(root, name) {
+    return findAllByName(root, name)[0];
+}
+/** The rune's field bag, as written by `createComponentRenderable`. */
+function readBag(root) {
+    const raw = root.attributes?.['data-rune-fields'];
+    if (typeof raw !== 'string')
+        return {};
+    try {
+        return JSON.parse(raw);
+    }
+    catch {
+        return {};
+    }
+}
+/**
+ * Resolve one source to a carrier and stamp `property` on it.
+ *
+ * Returns the node that ended up carrying the property, or `undefined` when the
+ * source resolves to nothing — which is not an error: a rune legitimately omits
+ * optional content, and a row for absent content should emit nothing rather
+ * than an empty carrier.
+ */
+function stamp(root, bag, source, property, sink) {
+    // Every node bearing the name, not just the first. A name in the rune's flat
+    // namespace can be worn by a whole collection — `recipe` gives each of its
+    // ingredient `<li>`s `data-name="ingredient"` — and stamping one of six would
+    // publish a single ingredient and silently drop the rest.
+    const nodes = findAllByName(root, source);
+    if (nodes.length > 0) {
+        for (const node of nodes)
+            node.attributes.property = property;
+        return nodes[0];
+    }
+    const value = bag[source];
+    if (value === undefined || value === '')
+        return undefined;
+    const meta = new Tag('meta', { property, content: carry(value) });
+    sink.push(meta);
+    return meta;
+}
+/**
+ * Wrap a node's own content so its text is readable as a literal.
+ *
+ * See the note on `SchemaRow.text` — an element carrying both `property` and
+ * `typeof` cannot also contribute its text, so the value needs its own element.
+ */
+function applyText(root, source, property, tag = 'div') {
+    const node = findByName(root, source);
+    if (!node)
+        return;
+    const wrapper = new Tag(tag, { property }, node.children ?? []);
+    node.children = [wrapper];
+}
+/** Apply a row's own properties, entities and generated values to one node. */
+function applyRow(node, row, bag, index) {
+    if (row.type)
+        node.attributes.typeof = row.type;
+    // D6 — travel the list declaration to `collectJsonLd`, which derives the
+    // graph and has no other way to know a one-item collection is still a list.
+    if (row.lists && row.lists.length > 0) {
+        node.attributes[SCHEMA_LISTS_ATTR] = JSON.stringify(row.lists);
+    }
+    const appended = [];
+    for (const [source, property] of Object.entries(row.properties ?? {})) {
+        stamp(node, bag, source, property, appended);
+    }
+    for (const [source, property] of Object.entries(row.text ?? {})) {
+        applyText(node, source, property, row.textTag);
+    }
+    for (const [property, generator] of Object.entries(row.generated ?? {})) {
+        // `index` is the one generator: a position exists nowhere in the content,
+        // so it cannot be resolved from a node or the bag.
+        if (generator === 'index' && index !== undefined) {
+            appended.push(new Tag('meta', { property, content: String(index + 1) }));
+        }
+    }
+    for (const [name, entity] of Object.entries(row.entities ?? {})) {
+        const span = buildEntity(node, entity, bag);
+        if (span)
+            appended.push(span);
+    }
+    if (appended.length > 0)
+        node.children = [...(node.children ?? []), ...appended];
+}
+/**
+ * Build a nested entity span, or nothing.
+ *
+ * D4 — an entity resolving to a bare `@type` with no properties emits nothing.
+ * Seven runes in the catalog assert a type and describe nothing; the table
+ * makes that a decision rather than an accident.
+ */
+function buildEntity(root, entity, bag) {
+    const carriers = [];
+    for (const [source, property] of Object.entries(entity.properties ?? {})) {
+        const node = findByName(root, source);
+        if (node) {
+            // The source survives in the output, so the entity takes a copy of its
+            // value rather than relocating the node — moving it would change the
+            // rendered HTML, which this mechanism must not do.
+            const text = textOf(node);
+            if (text)
+                carriers.push(new Tag('meta', { property, content: text }));
+            continue;
+        }
+        const value = bag[source];
+        if (value !== undefined && value !== '') {
+            carriers.push(new Tag('meta', { property, content: carry(value) }));
+        }
+    }
+    if (carriers.length === 0)
+        return undefined;
+    return new Tag('span', { typeof: entity.type, property: entity.property }, carriers);
+}
+/**
+ * Carry a bag value onto a `content` attribute without changing its type.
+ *
+ * `data-rune-fields` stores values typed, and `collectJsonLd` reads `content`
+ * straight through — so coercing here would turn a `ratingValue` of `5` into
+ * `"5"` in the published JSON-LD. Caught by the baseline: it was the only
+ * difference between the hand-built spans and the table.
+ */
+function carry(value) {
+    if (typeof value === 'number' || typeof value === 'boolean' || typeof value === 'string') {
+        return value;
+    }
+    return String(value);
+}
+/**
+ * Strip every `property=` stamp inside a child the parent is about to retype.
+ *
+ * Stops at a nested `typeof`: that subtree is its own entity and its properties
+ * belong to it, not to the child being retyped.
+ */
+function clearProperties(node) {
+    const kept = [];
+    for (const child of node.children ?? []) {
+        if (!isTag(child)) {
+            kept.push(child);
+            continue;
+        }
+        const tag = child;
+        const attrs = tag.attributes ?? {};
+        // A rebuilt carrier — a `<meta property=… content=…>` with no name — exists
+        // only to carry a schema value. Stripping its property would leave an inert
+        // `<meta>` in the markup, so it goes with the mapping that created it.
+        const isCarrier = tag.name === 'meta' &&
+            attrs.property !== undefined &&
+            attrs['data-name'] === undefined &&
+            attrs['data-field'] === undefined;
+        if (isCarrier)
+            continue;
+        if (attrs.property !== undefined)
+            delete tag.attributes.property;
+        if (attrs.typeof === undefined)
+            clearProperties(tag);
+        kept.push(child);
+    }
+    node.children = kept;
+}
+function textOf(node) {
+    if (typeof node === 'string')
+        return node;
+    if (Array.isArray(node))
+        return node.map(textOf).join('');
+    if (!isTag(node))
+        return '';
+    const content = node.attributes?.content;
+    if (content !== undefined)
+        return String(content);
+    return (node.children ?? []).map(textOf).join('');
+}
+/**
+ * Apply a rune's schema table to its transform output.
+ *
+ * Runs on the rune's own root, after its transform has built the tree and
+ * `createComponentRenderable` has written the field bag.
+ */
+export function applySchemaTable(output, table, attrs) {
+    if (!isTag(output))
+        return output;
+    // `schema="none"` suppresses the whole subtree, not just the root: a child
+    // rune declares its own type independently, so stripping only the root would
+    // leave orphan typed nodes with no container (WORK-552).
+    if (attrs.schema === 'none')
+        return output;
+    const root = output;
+    const row = selectRow(table, attrs);
+    const bag = readBag(root);
+    applyRow(root, row, bag);
+    // Children are retyped by the parent, never by themselves (D9). Markdoc
+    // transforms bottom-up, so by now the children carry their own `typeof` and
+    // this rewrites them — and only the parent can supply the `property` that
+    // nests them.
+    for (const [childName, childRow] of Object.entries(row.children ?? {})) {
+        const items = findChildren(root, childName);
+        items.forEach((item, i) => {
+            // A type the *author* stated is the child's own and survives: a
+            // `{% track type="song" %}` inside a podcast stays a song, because
+            // saying so and being overruled would make the attribute a lie. A type
+            // that came from the child's fallback row is marked implicit, and the
+            // parent is the better authority on what an unlabelled child is.
+            const marked = item;
+            const ownType = Boolean(marked[SCHEMA_TYPE_EXPLICIT]);
+            delete marked[SCHEMA_TYPE_EXPLICIT];
+            if (ownType) {
+                // A child that kept its own type keeps its own property map with it —
+                // the two are one statement, and re-stamping the parent's over it
+                // would duplicate every value it already carries. What the parent
+                // still supplies is the containing property and anything positional,
+                // which only a parent can know.
+                applyRow(item, { type: undefined, generated: childRow.generated }, readBag(item), i);
+            }
+            else {
+                // The parent retypes, so the parent's map is the whole truth for this
+                // child. Clearing first is what makes a property that does not belong
+                // to the new type disappear rather than linger: `byArtist` on a
+                // `PodcastEpisode` is worse than the `MusicRecording` it replaced,
+                // which was at least coherently wrong.
+                if (childRow.properties)
+                    clearProperties(item);
+                applyRow(item, childRow, readBag(item), i);
+            }
+            item.attributes.property = childRow.property;
+        });
+    }
+    return output;
+}
+/**
+ * Every node the named child occupies, in document order.
+ *
+ * Matched on `data-rune` *or* a name, for the same reason `findByName` is
+ * attribute-agnostic: a parent may build some of a collection itself and receive
+ * the rest as authored child tags — `playlist` does exactly that, with markdown
+ * list items beside `{% track %}` children. Both populations belong to one
+ * collection and must take one row, or half of it would go unmapped.
+ */
+function findChildren(root, name) {
+    const out = [];
+    const visit = (node) => {
+        if (Array.isArray(node)) {
+            for (const c of node)
+                visit(c);
+            return;
+        }
+        if (!isTag(node))
+            return;
+        const attrs = node.attributes ?? {};
+        if (attrs['data-rune'] === name || attrs['data-name'] === name || attrs['data-field'] === name)
+            out.push(node);
+        for (const c of node.children ?? [])
+            visit(c);
+    };
+    for (const c of root.children ?? [])
+        visit(c);
+    return out;
+}
+//# sourceMappingURL=schema-table.js.map

package/dist/lib/schema-table.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema-table.js","sourceRoot":"","sources":["../../src/lib/schema-table.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,kBAAkB,CAAC;AAEvC,OAAO,EAAE,iBAAiB,EAAE,MAAM,WAAW,CAAC;AAE9C,MAAM,EAAE,GAAG,EAAE,GAAG,OAAO,CAAC;AAExB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuCG;AAEH;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAC;AAiF7E;;;;;;;;;;GAUG;AACH,MAAM,UAAU,mBAAmB,CAClC,KAAkB,EAClB,qBAA+B,EAAE;IAEjC,MAAM,MAAM,GAAuB,EAAE,CAAC;IAEtC,IAAI,KAAK,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;QAC5B,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YAC7E,MAAM,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,IAAI;gBACV,OAAO,EAAE,UAAU,KAAK,CAAC,EAAE,6GAA6G;aACxI,CAAC,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzD,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,mCAAmC,EAAE,CAAC,CAAC;QAC7E,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YACpC,MAAM,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,UAAU;gBAChB,OAAO,EAAE,yEAAyE;aAClF,CAAC,CAAC;QACJ,CAAC;IACF,CAAC;IAED,MAAM,aAAa,GAAG,CAAC,IAA2C,EAAE,IAAY,EAAE,EAAE;QACnF,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,CAAC;YACtD,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,GAAG,IAAI,IAAI,IAAI,EAAE;oBACvB,OAAO,EAAE,4LAA4L;iBACrM,CAAC,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,IAAI,IAAI,IAAI,EAAE,EAAE,OAAO,EAAE,gCAAgC,EAAE,CAAC,CAAC;YACrF,CAAC;QACF,CAAC;IACF,CAAC,CAAC;IAEF,MAAM,QAAQ,GAAG,CAAC,GAAc,EAAE,IAAY,EAAE,EAAE;QACjD,aAAa,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,IAAI,UAAU,CAAC,CAAC;QAC/C,aAAa,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,IAAI,UAAU,CAAC,CAAC;IAChD,CAAC,CAAC;IAEF,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACpB,KAAK,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;QAAE,QAAQ,CAAC,GAAG,EAAE,QAAQ,KAAK,GAAG,CAAC,CAAC;IAC7F,IAAI,KAAK,CAAC,QAAQ;QAAE,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;IAE1D,OAAO,MAAM,CAAC;AACf,CAAC;AAED,gDAAgD;AAChD,MAAM,UAAU,SAAS,CAAC,KAAkB,EAAE,KAA8B;IAC3E,IAAI,CAAC,KAAK,CAAC,EAAE;QAAE,OAAO,KAAK,CAAC;IAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IAC1E,OAAO,GAAG,IAAI,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC;AACvC,CAAC;AAMD,MAAM,KAAK,GAAG,CAAC,CAAU,EAAe,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAU,CAAC,CAAC;AAEzE;;;;;;GAMG;AACH;;;;;;;;GAQG;AACH,MAAM,UAAU,aAAa,CAC5B,IAA+C,EAC/C,IAAY;IAEZ,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,oBAAoB,EAAE,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;IACxE,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,KAAK,GAAG,CAAC,IAAa,EAAE,GAAY,EAAQ,EAAE;QACnD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,IAAI;gBAAE,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACpC,OAAO;QACR,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;YAAE,OAAO;QACzB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC;QACpC,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,WAAW,CAAC,KAAK,SAAS;YAAE,OAAO;QACrD,MAAM,KAAK,GACV,KAAK,CAAC,WAAW,CAAC,KAAK,IAAI;YAC3B,KAAK,CAAC,WAAW,CAAC,KAAK,KAAK;YAC5B,KAAK,CAAC,YAAY,CAAC,KAAK,IAAI;YAC5B,KAAK,CAAC,YAAY,CAAC,KAAK,KAAK,CAAC;QAC/B,IAAI,KAAK,EAAE,CAAC;YACX,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACf,sEAAsE;YACtE,+DAA+D;YAC/D,OAAO;QACR,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,IAAI,EAAE;YAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACtD,CAAC,CAAC;IACF,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAClB,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,UAAU,CACzB,IAA+C,EAC/C,IAAY;IAEZ,OAAO,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED,uEAAuE;AACvE,SAAS,OAAO,CAAC,IAAY;IAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,kBAAkB,CAAC,CAAC;IAClD,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,EAAE,CAAC;IACvC,IAAI,CAAC;QACJ,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACxB,CAAC;IAAC,MAAM,CAAC;QACR,OAAO,EAAE,CAAC;IACX,CAAC;AACF,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,KAAK,CACb,IAAY,EACZ,GAA4B,EAC5B,MAAc,EACd,QAAgB,EAChB,IAAc;IAEd,6EAA6E;IAC7E,2EAA2E;IAC3E,8EAA8E;IAC9E,0DAA0D;IAC1D,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC1C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,KAAK;YAAE,IAAI,CAAC,UAAU,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAC9D,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;IAC1B,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,EAAE;QAAE,OAAO,SAAS,CAAC;IAC1D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAClE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChB,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;;GAKG;AACH,SAAS,SAAS,CAAC,IAAY,EAAE,MAAc,EAAE,QAAgB,EAAE,GAAG,GAAG,KAAK;IAC7E,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACtC,IAAI,CAAC,IAAI;QAAE,OAAO;IAClB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;IAChE,IAAI,CAAC,QAAQ,GAAG,CAAC,OAAO,CAAC,CAAC;AAC3B,CAAC;AAED,+EAA+E;AAC/E,SAAS,QAAQ,CAChB,IAAY,EACZ,GAAc,EACd,GAA4B,EAC5B,KAAc;IAEd,IAAI,GAAG,CAAC,IAAI;QAAE,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC;IAEhD,yEAAyE;IACzE,4EAA4E;IAC5E,IAAI,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvC,IAAI,CAAC,UAAU,CAAC,iBAAiB,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAChE,CAAC;IAED,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,IAAI,EAAE,CAAC,EAAE,CAAC;QACvE,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC9C,CAAC;IAED,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,CAAC;QACjE,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;IAChD,CAAC;IAED,KAAK,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,IAAI,EAAE,CAAC,EAAE,CAAC;QACzE,0EAA0E;QAC1E,mDAAmD;QACnD,IAAI,SAAS,KAAK,OAAO,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YAClD,QAAQ,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1E,CAAC;IACF,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,EAAE,CAAC;QACjE,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QAC5C,IAAI,IAAI;YAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC;AAClF,CAAC;AAED;;;;;;GAMG;AACH,SAAS,WAAW,CACnB,IAAY,EACZ,MAAiB,EACjB,GAA4B;IAE5B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC,EAAE,CAAC;QAC1E,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACtC,IAAI,IAAI,EAAE,CAAC;YACV,uEAAuE;YACvE,qEAAqE;YACrE,mDAAmD;YACnD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,IAAI;gBAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;YACtE,SAAS;QACV,CAAC;QACD,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1B,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,EAAE,EAAE,CAAC;YACzC,QAAQ,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;QACrE,CAAC;IACF,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC5C,OAAO,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,EAAE,QAAQ,CAAC,CAAC;AACtF,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,KAAK,CAAC,KAAc;IAC5B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,SAAS,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC1F,OAAO,KAAK,CAAC;IACd,CAAC;IACD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;AACtB,CAAC;AAED;;;;;GAKG;AACH,SAAS,eAAe,CAAC,IAAY;IACpC,MAAM,IAAI,GAAc,EAAE,CAAC;IAC3B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC;QACzC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjB,SAAS;QACV,CAAC;QACD,MAAM,GAAG,GAAG,KAAe,CAAC;QAC5B,MAAM,KAAK,GAAG,GAAG,CAAC,UAAU,IAAI,EAAE,CAAC;QACnC,4EAA4E;QAC5E,4EAA4E;QAC5E,uEAAuE;QACvE,MAAM,SAAS,GACd,GAAG,CAAC,IAAI,KAAK,MAAM;YACnB,KAAK,CAAC,QAAQ,KAAK,SAAS;YAC5B,KAAK,CAAC,WAAW,CAAC,KAAK,SAAS;YAChC,KAAK,CAAC,YAAY,CAAC,KAAK,SAAS,CAAC;QACnC,IAAI,SAAS;YAAE,SAAS;QACxB,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;YAAE,OAAO,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC;QACjE,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS;YAAE,eAAe,CAAC,GAAG,CAAC,CAAC;QACrD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClB,CAAC;IACD,IAAI,CAAC,QAAQ,GAAG,IAA4B,CAAC;AAC9C,CAAC;AAED,SAAS,MAAM,CAAC,IAAa;IAC5B,IAAI,OAAO,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAC1C,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1D,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAC5B,MAAM,OAAO,GAAI,IAAe,CAAC,UAAU,EAAE,OAAO,CAAC;IACrD,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC;IAClD,OAAO,CAAE,IAAe,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC/D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC/B,MAA0B,EAC1B,KAAkB,EAClB,KAA8B;IAE9B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAC;IAClC,2EAA2E;IAC3E,6EAA6E;IAC7E,yDAAyD;IACzD,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM;QAAE,OAAO,MAAM,CAAC;IAE3C,MAAM,IAAI,GAAG,MAAgB,CAAC;IAC9B,MAAM,GAAG,GAAG,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACpC,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAE1B,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAEzB,wEAAwE;IACxE,4EAA4E;IAC5E,0EAA0E;IAC1E,cAAc;IACd,KAAK,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,EAAE,CAAC;QACxE,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAC5C,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACzB,gEAAgE;YAChE,mEAAmE;YACnE,uEAAuE;YACvE,sEAAsE;YACtE,iEAAiE;YACjE,MAAM,MAAM,GAAG,IAA0C,CAAC;YAC1D,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC,CAAC;YACtD,OAAO,MAAM,CAAC,oBAAoB,CAAC,CAAC;YAEpC,IAAI,OAAO,EAAE,CAAC;gBACb,sEAAsE;gBACtE,kEAAkE;gBAClE,kEAAkE;gBAClE,qEAAqE;gBACrE,gCAAgC;gBAChC,QAAQ,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,SAAS,EAAE,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YACtF,CAAC;iBAAM,CAAC;gBACP,sEAAsE;gBACtE,sEAAsE;gBACtE,gEAAgE;gBAChE,mEAAmE;gBACnE,uCAAuC;gBACvC,IAAI,QAAQ,CAAC,UAAU;oBAAE,eAAe,CAAC,IAAI,CAAC,CAAC;gBAC/C,QAAQ,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5C,CAAC;YACD,IAAI,CAAC,UAAU,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;QAC9C,CAAC,CAAC,CAAC;IACJ,CAAC;IAED,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,YAAY,CAAC,IAAY,EAAE,IAAY;IAC/C,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,KAAK,GAAG,CAAC,IAAa,EAAQ,EAAE;QACrC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,IAAI;gBAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/B,OAAO;QACR,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;YAAE,OAAO;QACzB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,WAAW,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,WAAW,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,YAAY,CAAC,KAAK,IAAI;YAC7F,GAAG,CAAC,IAAI,CAAC,IAAc,CAAC,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,IAAI,EAAE;YAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,IAAI,EAAE;QAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAC9C,OAAO,GAAG,CAAC;AACZ,CAAC"}

package/dist/reference.d.ts

@@ -185,12 +185,45 @@ export interface SerializedAttribute {
     matches?: string[];
     description?: string;
 }
+/** A rune's structured-data claims, ordered by schema.org property. */
+export interface SerializedSchemaOrg {
+    type?: string;
+    /** The attribute a multi-row table selects on. */
+    by?: string;
+    /** Every schema.org property, with the source name that supplies it. */
+    properties: Array<{
+        property: string;
+        source: string;
+        kind: string;
+        entity?: string;
+    }>;
+    entities: Array<{
+        name: string;
+        type: string;
+        property: string;
+    }>;
+    children: Array<{
+        rune: string;
+        type: string;
+        property: string;
+    }>;
+    lists: string[];
+    /** Types this rune can emit, when the table selects a row by attribute. */
+    types: string[];
+}
 export interface SerializedRune {
     name: string;
     plugin: string;
     aliases: string[];
     description: string;
     authoringHints?: string;
+    /**
+     * What this rune publishes as structured data — SPEC-130 / WORK-566.
+     *
+     * Nothing validates it against schema.org: refrakt ships no ontology (D5).
+     * Documenting it *is* the control, which is why it is here.
+     */
+    schemaOrg?: SerializedSchemaOrg;
     attributes: {
         own: Record<string, SerializedAttribute>;
         base?: {