@lde/search 0.10.0 → 0.12.0

package/README.md

@@ -71,11 +71,22 @@ Exports are stratified by audience:
 The model has three levels, with analogues in SHACL ([one possible source](#why-a-declarative-model))
 and GraphQL (one of the surfaces):
 
-| Term           | What it is                                                                                                       | SHACL          | GraphQL     |
-| -------------- | ---------------------------------------------------------------------------------------------------------------- | -------------- | ----------- |
-| `SearchField`  | One queryable field: a `kind`, the IR `path` it projects from, and the capability flags it opts into             | property shape | field       |
-| `SearchType`   | One root type’s complete declaration: its logical API `name`, its `class` IRI and its fields (incl. derived)     | NodeShape      | object type |
-| `SearchSchema` | The whole search declaration: every `SearchType`, keyed by `class` IRI – build one with `searchSchema(...types)` | shapes graph   | schema      |
+| Term           | What it is                                                                                                                                                                                                                       | SHACL          | GraphQL     |
+| -------------- | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | -------------- | ----------- |
+| `SearchField`  | One queryable field: a `kind`, the IR `path` it projects from, and the capability flags it opts into                                                                                                                             | property shape | field       |
+| `SearchType`   | One type’s complete declaration: its logical API `name` and fields (incl. derived). A **Root Type** declares a `class` (indexed, keys the schema); a **Reference Type** declares none (reached only through an inline reference) | NodeShape      | object type |
+| `SearchSchema` | The whole search declaration: every Root Type, keyed by `class` IRI, plus the Reference Types – build one with `searchSchema(...types)`                                                                                          | shapes graph   | schema      |
+
+A `SearchType` is a **Root Type** or a **Reference Type**, told apart by one
+absence: a Root Type declares a `class`, so roots are selected for it and a
+writer opens a collection for it; a Reference Type declares none, so it is
+never selected, framed by type or indexed – its identity is its name, and its
+type comes from the edge that points at it. `searchSchema` partitions its
+arguments accordingly: Root Types key the class map (`schema.values()` yields
+only them, so no writer ever opens a collection for a Reference Type), Reference
+Types go into a name index an inline `ref.typeName` resolves against. The
+absence is load-bearing, and enforced at the type level – an indexed Reference
+Type fails to compile ([ADR 11](../../docs/decisions/0011-decouple-rdf-depth-from-the-api-surface.md)).
 
 `projectRoots` and the engine port each execute one `SearchType` at a time –
 projection over the roots the pipeline selector supplied for that type; the
@@ -208,10 +219,29 @@ directly.
 | `date`               | `range` (inclusive)  | yes   | yes              | ISO 8601 string (surface)       |
 | `boolean`            | `is`                 | yes   | –                | boolean (absent = false)        |
 
-A `reference` carries `labelOnly` today (id + display label); the `idOnly` and
-`inline` strategies are forward declarations. References are object-shaped from
-day one so that `inline` can later **add** fields to a reference type without
-breaking clients.
+A `reference` carries one of two strategies today: `labelOnly` (id + display
+label, resolved at query time from a label source) and `inline` (the referent’s
+own projected fields, carried inline). `idOnly` stays a forward declaration.
+
+An **inline reference** resolves `ref.typeName` to a declared **Reference Type**
+and projects the referent through it – a nested `SearchDocument`, or an array
+for an `array` reference. Roles decide whether the nesting surfaces, so the same
+construct serves two jobs (see
+[ADR 11](../../docs/decisions/0011-decouple-rdf-depth-from-the-api-surface.md)):
+
+- a **reading device** declares no role, so it is an internal field: projected
+  so a later `derive` can select and flatten a value a `path` cannot address (a
+  qualified hop), then pruned before the writer – nothing nested reaches the
+  engine or the API;
+- an **API device** declares `output`, deliberately surfacing the nested
+  Reference Type.
+
+So RDF depth and API shape stay independent: inline as deep as the source
+demands, expose exactly the flat fields you want. Framing follows the inline
+reference graph to the depth the schema declares (`Dataset → Subset →
+Measurement` is two hops), and `searchSchema` rejects inline cycles – the one
+way that depth could be unbounded – so it stays a bounded property of the
+declaration.
 
 A reference resolves its label from a **label source**: `labelSource` names
 the `SearchType` whose collection holds the referenced entities. The named

package/dist/adapter.d.ts

@@ -6,7 +6,7 @@
  * deployment author declaring a schema and running searches needs none of
  * this; the main entry point carries that (small) authoring surface.
  */
-export { assertTypeInSchema, physicalFields, displayFieldName, displayFieldPattern, displayLangOf, searchableFields, facetableFields, filterableFields, sortableFields, outputFields, isInternalField, referenceFields, fieldNamed, labelFieldOf, isRangeFacet, isoToUnixSeconds, unixSecondsToIso, } from './schema.js';
+export { assertTypeInSchema, physicalFields, irAlias, displayFieldName, displayFieldPattern, displayLangOf, searchableFields, facetableFields, filterableFields, sortableFields, outputFields, isInternalField, isInlineReference, referenceFields, referenceTypeNamed, inlineFramingDepth, fieldNamed, labelFieldOf, isRangeFacet, isoToUnixSeconds, unixSecondsToIso, } from './schema.js';
 export type { PhysicalFields } from './schema.js';
 export { physicalNameTokens } from './physical-name.js';
 export { filterOperatorFor, filterOperator, validateQuery, assertValidQuery, pageForOffset, } from './query.js';

package/dist/adapter.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"adapter.d.ts","sourceRoot":"","sources":["../src/adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EACL,kBAAkB,EAClB,cAAc,EACd,gBAAgB,EAChB,mBAAmB,EACnB,aAAa,EACb,gBAAgB,EAChB,eAAe,EACf,gBAAgB,EAChB,cAAc,EACd,YAAY,EACZ,eAAe,EACf,eAAe,EACf,UAAU,EACV,YAAY,EACZ,YAAY,EACZ,gBAAgB,EAChB,gBAAgB,GACjB,MAAM,aAAa,CAAC;AACrB,YAAY,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,EACL,iBAAiB,EACjB,cAAc,EACd,aAAa,EACb,gBAAgB,EAChB,aAAa,GACd,MAAM,YAAY,CAAC;AACpB,YAAY,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}
+{"version":3,"file":"adapter.d.ts","sourceRoot":"","sources":["../src/adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EACL,kBAAkB,EAClB,cAAc,EACd,OAAO,EACP,gBAAgB,EAChB,mBAAmB,EACnB,aAAa,EACb,gBAAgB,EAChB,eAAe,EACf,gBAAgB,EAChB,cAAc,EACd,YAAY,EACZ,eAAe,EACf,iBAAiB,EACjB,eAAe,EACf,kBAAkB,EAClB,kBAAkB,EAClB,UAAU,EACV,YAAY,EACZ,YAAY,EACZ,gBAAgB,EAChB,gBAAgB,GACjB,MAAM,aAAa,CAAC;AACrB,YAAY,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,EACL,iBAAiB,EACjB,cAAc,EACd,aAAa,EACb,gBAAgB,EAChB,aAAa,GACd,MAAM,YAAY,CAAC;AACpB,YAAY,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}

package/dist/adapter.js

@@ -6,6 +6,6 @@
  * deployment author declaring a schema and running searches needs none of
  * this; the main entry point carries that (small) authoring surface.
  */
-export { assertTypeInSchema, physicalFields, displayFieldName, displayFieldPattern, displayLangOf, searchableFields, facetableFields, filterableFields, sortableFields, outputFields, isInternalField, referenceFields, fieldNamed, labelFieldOf, isRangeFacet, isoToUnixSeconds, unixSecondsToIso, } from './schema.js';
+export { assertTypeInSchema, physicalFields, irAlias, displayFieldName, displayFieldPattern, displayLangOf, searchableFields, facetableFields, filterableFields, sortableFields, outputFields, isInternalField, isInlineReference, referenceFields, referenceTypeNamed, inlineFramingDepth, fieldNamed, labelFieldOf, isRangeFacet, isoToUnixSeconds, unixSecondsToIso, } from './schema.js';
 export { physicalNameTokens } from './physical-name.js';
 export { filterOperatorFor, filterOperator, validateQuery, assertValidQuery, pageForOffset, } from './query.js';

package/dist/engine.d.ts

@@ -1,5 +1,5 @@
 import type { SearchQuery } from './query.js';
-import type { SearchSchema, SearchType } from './schema.js';
+import type { RootType, RootTypeOf, SearchSchema, SearchType } from './schema.js';
 /**
  * The engine port: the boundary a concrete engine adapter (e.g. the engine
  * `@lde/search-typesense`’s `createTypesenseSearchEngine` returns) implements.
@@ -34,7 +34,7 @@ export interface SearchEngine<Types extends readonly SearchType[] = readonly Sea
     /** The declaration this engine serves – exposed so a surface can route and
      *  a caller can enumerate the searchable types. */
     readonly schema: SearchSchema<Types>;
-    search<T extends Types[number]>(searchType: T, query: SearchQuery): Promise<SearchResult<FacetFieldsOf<T>, OutputFieldsOf<T>>>;
+    search<T extends RootTypeOf<Types>>(searchType: T, query: SearchQuery): Promise<SearchResult<FacetFieldsOf<T>, OutputFieldsOf<T>>>;
     /**
      * The batch entry point: answer several facet-only queries against one type
      * in a single engine round-trip (where the engine supports one, e.g.
@@ -52,7 +52,7 @@ export interface SearchEngine<Types extends readonly SearchType[] = readonly Sea
      * transport itself). The port contract holds for every query in the batch;
      * an empty `queries` resolves to `[]` without touching the engine.
      */
-    searchFacets<T extends Types[number]>(searchType: T, queries: readonly SearchQuery[]): Promise<readonly FacetsOutcome<FacetFieldsOf<T>>[]>;
+    searchFacets<T extends RootTypeOf<Types>>(searchType: T, queries: readonly SearchQuery[]): Promise<readonly FacetsOutcome<FacetFieldsOf<T>>[]>;
 }
 /**
  * One query’s outcome in a {@link SearchEngine.searchFacets} batch – its
@@ -84,7 +84,7 @@ export type FacetMap<FacetField extends string = string> = Readonly<Partial<Reco
  * `: SearchType` annotation degrades to `string` (its field names are not
  * statically known).
  */
-export type FacetFieldsOf<Type extends SearchType> = SearchType extends Type ? string : Extract<Type['fields'][number], {
+export type FacetFieldsOf<Type extends SearchType> = RootType extends Type ? string : Extract<Type['fields'][number], {
     readonly facetable: true;
 }>['name'];
 /**
@@ -92,7 +92,7 @@ export type FacetFieldsOf<Type extends SearchType> = SearchType extends Type ? s
  * can hold. Like {@link FacetFieldsOf}, degrades to `string` for a widened
  * declaration.
  */
-export type OutputFieldsOf<Type extends SearchType> = SearchType extends Type ? string : Extract<Type['fields'][number], {
+export type OutputFieldsOf<Type extends SearchType> = RootType extends Type ? string : Extract<Type['fields'][number], {
     readonly output: true;
 }>['name'];
 /**

package/dist/engine.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"engine.d.ts","sourceRoot":"","sources":["../src/engine.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAC9C,OAAO,KAAK,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAE5D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,WAAW,YAAY,CAC3B,KAAK,SAAS,SAAS,UAAU,EAAE,GAAG,SAAS,UAAU,EAAE;IAE3D;uDACmD;IACnD,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC;IACrC,MAAM,CAAC,CAAC,SAAS,KAAK,CAAC,MAAM,CAAC,EAC5B,UAAU,EAAE,CAAC,EACb,KAAK,EAAE,WAAW,GACjB,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D;;;;;;;;;;;;;;;;OAgBG;IACH,YAAY,CAAC,CAAC,SAAS,KAAK,CAAC,MAAM,CAAC,EAClC,UAAU,EAAE,CAAC,EACb,OAAO,EAAE,SAAS,WAAW,EAAE,GAC9B,OAAO,CAAC,SAAS,aAAa,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;CACxD;AAED;;;;;;GAMG;AACH,MAAM,MAAM,aAAa,CAAC,UAAU,SAAS,MAAM,GAAG,MAAM,IACxD;IAAE,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAA;CAAE,GACzC;IAAE,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CAAE,CAAC;AAEhC,+EAA+E;AAC/E,MAAM,WAAW,YAAY,CAC3B,UAAU,SAAS,MAAM,GAAG,MAAM,EAClC,WAAW,SAAS,MAAM,GAAG,MAAM;IAEnC,QAAQ,CAAC,IAAI,EAAE,SAAS,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC;IACjD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAC;CACvC;AAED;;;GAGG;AACH,MAAM,MAAM,QAAQ,CAAC,UAAU,SAAS,MAAM,GAAG,MAAM,IAAI,QAAQ,CACjE,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,SAAS,WAAW,EAAE,CAAC,CAAC,CACpD,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,MAAM,aAAa,CAAC,IAAI,SAAS,UAAU,IAAI,UAAU,SAAS,IAAI,GACxE,MAAM,GACN,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE;IAAE,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAA;CAAE,CAAC,CAAC,MAAM,CAAC,CAAC;AAE1E;;;;GAIG;AACH,MAAM,MAAM,cAAc,CAAC,IAAI,SAAS,UAAU,IAAI,UAAU,SAAS,IAAI,GACzE,MAAM,GACN,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE;IAAE,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAA;CAAE,CAAC,CAAC,MAAM,CAAC,CAAC;AAEvE;;;;;;GAMG;AACH,MAAM,WAAW,SAAS,CAAC,WAAW,SAAS,MAAM,GAAG,MAAM;IAC5D,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,QAAQ,EAAE,cAAc,CAAC,WAAW,CAAC,CAAC;CAChD;AAED;;;;;;;GAOG;AACH,MAAM,MAAM,cAAc,CAAC,WAAW,SAAS,MAAM,GAAG,MAAM,IAAI,QAAQ,CACxE,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,CAC1C,CAAC;AAEF,6BAA6B;AAC7B,MAAM,MAAM,WAAW,GACnB,MAAM,GACN,MAAM,GACN,OAAO,GACP,SAAS,MAAM,EAAE,GACjB,cAAc,GACd,SAAS,GACT,SAAS,SAAS,EAAE,CAAC;AAEzB;;;;GAIG;AACH,MAAM,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;AAEzE;;;;GAIG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,CAAC,EAAE,cAAc,CAAC;CACjC;AAED;;;;;GAKG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,CAAC,EAAE,cAAc,CAAC;IAChC;;;;;OAKG;IACH,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;CACvB"}
+{"version":3,"file":"engine.d.ts","sourceRoot":"","sources":["../src/engine.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAC9C,OAAO,KAAK,EACV,QAAQ,EACR,UAAU,EACV,YAAY,EACZ,UAAU,EACX,MAAM,aAAa,CAAC;AAErB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,WAAW,YAAY,CAC3B,KAAK,SAAS,SAAS,UAAU,EAAE,GAAG,SAAS,UAAU,EAAE;IAE3D;uDACmD;IACnD,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC;IACrC,MAAM,CAAC,CAAC,SAAS,UAAU,CAAC,KAAK,CAAC,EAChC,UAAU,EAAE,CAAC,EACb,KAAK,EAAE,WAAW,GACjB,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D;;;;;;;;;;;;;;;;OAgBG;IACH,YAAY,CAAC,CAAC,SAAS,UAAU,CAAC,KAAK,CAAC,EACtC,UAAU,EAAE,CAAC,EACb,OAAO,EAAE,SAAS,WAAW,EAAE,GAC9B,OAAO,CAAC,SAAS,aAAa,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;CACxD;AAED;;;;;;GAMG;AACH,MAAM,MAAM,aAAa,CAAC,UAAU,SAAS,MAAM,GAAG,MAAM,IACxD;IAAE,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAA;CAAE,GACzC;IAAE,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CAAE,CAAC;AAEhC,+EAA+E;AAC/E,MAAM,WAAW,YAAY,CAC3B,UAAU,SAAS,MAAM,GAAG,MAAM,EAClC,WAAW,SAAS,MAAM,GAAG,MAAM;IAEnC,QAAQ,CAAC,IAAI,EAAE,SAAS,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC;IACjD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAC;CACvC;AAED;;;GAGG;AACH,MAAM,MAAM,QAAQ,CAAC,UAAU,SAAS,MAAM,GAAG,MAAM,IAAI,QAAQ,CACjE,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,SAAS,WAAW,EAAE,CAAC,CAAC,CACpD,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,MAAM,aAAa,CAAC,IAAI,SAAS,UAAU,IAAI,QAAQ,SAAS,IAAI,GACtE,MAAM,GACN,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE;IAAE,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAA;CAAE,CAAC,CAAC,MAAM,CAAC,CAAC;AAE1E;;;;GAIG;AACH,MAAM,MAAM,cAAc,CAAC,IAAI,SAAS,UAAU,IAAI,QAAQ,SAAS,IAAI,GACvE,MAAM,GACN,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE;IAAE,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAA;CAAE,CAAC,CAAC,MAAM,CAAC,CAAC;AAEvE;;;;;;GAMG;AACH,MAAM,WAAW,SAAS,CAAC,WAAW,SAAS,MAAM,GAAG,MAAM;IAC5D,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,QAAQ,EAAE,cAAc,CAAC,WAAW,CAAC,CAAC;CAChD;AAED;;;;;;;GAOG;AACH,MAAM,MAAM,cAAc,CAAC,WAAW,SAAS,MAAM,GAAG,MAAM,IAAI,QAAQ,CACxE,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,CAC1C,CAAC;AAEF,6BAA6B;AAC7B,MAAM,MAAM,WAAW,GACnB,MAAM,GACN,MAAM,GACN,OAAO,GACP,SAAS,MAAM,EAAE,GACjB,cAAc,GACd,SAAS,GACT,SAAS,SAAS,EAAE,CAAC;AAEzB;;;;GAIG;AACH,MAAM,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;AAEzE;;;;GAIG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,CAAC,EAAE,cAAc,CAAC;CACjC;AAED;;;;;GAKG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,CAAC,EAAE,cAAc,CAAC;IAChC;;;;;OAKG;IACH,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;CACvB"}

package/dist/frame-by-type.d.ts

@@ -27,15 +27,21 @@ export interface SubjectIndex {
 export declare function buildSubjectIndex(quads: Iterable<Quad>): SubjectIndex;
 /**
  * Frame each of the given `roots` from a prebuilt {@link SubjectIndex} into one
- * JSON-LD node. Each root subject’s own triples plus the one-hop nodes it
- * references (e.g. nested publisher/distribution resources) are framed one
- * subject at a time, so beyond the shared subject index only a single subgraph
- * is held (whole-graph `jsonld.frame()` is ~O(N²)). The frame carries no
- * `@context`, so framed keys are full predicate IRIs.
+ * JSON-LD node. Each root subject’s own triples plus the nodes it references –
+ * to `depth` hops (e.g. nested publisher/distribution resources at one hop, an
+ * inline reference’s referents deeper) – are framed one subject at a time, so
+ * beyond the shared subject index only a single subgraph is held (whole-graph
+ * `jsonld.frame()` is ~O(N²)). The frame carries no `@context`, so framed keys
+ * are full predicate IRIs.
+ *
+ * `depth` is the number of reference hops to embed; it defaults to one (the
+ * long-standing single-hop embed) and comes from the schema for a type with
+ * inline references (`inlineFramingDepth`). Bounded per batch, so the O(N²)
+ * framing cost applies to a batch of roots, not the graph (ADR 12).
  *
  * The roots are supplied explicitly rather than discovered from `rdf:type`: the
  * caller ({@link projectRoots}, from the pipeline selector) already holds them
  * and passes them directly. A root absent from the index simply frames nothing.
  */
-export declare function frameSubjects(index: SubjectIndex, roots: readonly string[]): AsyncIterable<FramedNode>;
+export declare function frameSubjects(index: SubjectIndex, roots: readonly string[], depth?: number): AsyncIterable<FramedNode>;
 //# sourceMappingURL=frame-by-type.d.ts.map

package/dist/frame-by-type.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"frame-by-type.d.ts","sourceRoot":"","sources":["../src/frame-by-type.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AAGzC,4EAA4E;AAC5E,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAIjD;;;;;;GAMG;AACH,MAAM,WAAW,YAAY;IAC3B,4EAA4E;IAC5E,QAAQ,CAAC,SAAS,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,IAAI,EAAE,CAAC,CAAC;CAC1D;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,YAAY,CAkBrE;AAED;;;;;;;;;;;GAWG;AACH,wBAAuB,aAAa,CAClC,KAAK,EAAE,YAAY,EACnB,KAAK,EAAE,SAAS,MAAM,EAAE,GACvB,aAAa,CAAC,UAAU,CAAC,CA6B3B"}
+{"version":3,"file":"frame-by-type.d.ts","sourceRoot":"","sources":["../src/frame-by-type.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AAGzC,4EAA4E;AAC5E,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAIjD;;;;;;GAMG;AACH,MAAM,WAAW,YAAY;IAC3B,4EAA4E;IAC5E,QAAQ,CAAC,SAAS,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,IAAI,EAAE,CAAC,CAAC;CAC1D;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,YAAY,CAkBrE;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAuB,aAAa,CAClC,KAAK,EAAE,YAAY,EACnB,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,KAAK,SAAI,GACR,aAAa,CAAC,UAAU,CAAC,CAqB3B"}

package/dist/frame-by-type.js

@@ -34,25 +34,26 @@ export function buildSubjectIndex(quads) {
 }
 /**
  * Frame each of the given `roots` from a prebuilt {@link SubjectIndex} into one
- * JSON-LD node. Each root subject’s own triples plus the one-hop nodes it
- * references (e.g. nested publisher/distribution resources) are framed one
- * subject at a time, so beyond the shared subject index only a single subgraph
- * is held (whole-graph `jsonld.frame()` is ~O(N²)). The frame carries no
- * `@context`, so framed keys are full predicate IRIs.
+ * JSON-LD node. Each root subject’s own triples plus the nodes it references –
+ * to `depth` hops (e.g. nested publisher/distribution resources at one hop, an
+ * inline reference’s referents deeper) – are framed one subject at a time, so
+ * beyond the shared subject index only a single subgraph is held (whole-graph
+ * `jsonld.frame()` is ~O(N²)). The frame carries no `@context`, so framed keys
+ * are full predicate IRIs.
+ *
+ * `depth` is the number of reference hops to embed; it defaults to one (the
+ * long-standing single-hop embed) and comes from the schema for a type with
+ * inline references (`inlineFramingDepth`). Bounded per batch, so the O(N²)
+ * framing cost applies to a batch of roots, not the graph (ADR 12).
  *
  * The roots are supplied explicitly rather than discovered from `rdf:type`: the
  * caller ({@link projectRoots}, from the pipeline selector) already holds them
  * and passes them directly. A root absent from the index simply frames nothing.
  */
-export async function* frameSubjects(index, roots) {
+export async function* frameSubjects(index, roots, depth = 1) {
     const { bySubject } = index;
     for (const rootIri of roots) {
-        const owned = bySubject.get(rootIri) ?? [];
-        const referenced = owned
-            .filter((quad) => quad.object.termType === 'NamedNode' ||
-            quad.object.termType === 'BlankNode')
-            .flatMap((quad) => bySubject.get(quad.object.value) ?? []);
-        const subgraph = [...owned, ...referenced];
+        const subgraph = collectSubgraph(bySubject, rootIri, depth);
         const expanded = await jsonld.fromRDF(subgraph);
         // Frame for THIS specific root subject by its `@id`. The subgraph embeds the
         // root’s one-hop references, and such a referent can itself be one of the
@@ -67,3 +68,36 @@ export async function* frameSubjects(index, roots) {
         }
     }
 }
+/**
+ * Collect a root subject’s triples plus those of every subject it references
+ * within `depth` hops, breadth-first. Each subject is visited once (so a
+ * reference cycle in the data terminates and no subject’s triples are
+ * duplicated); `jsonld.frame` embeds whatever the subgraph reaches. Bounded by
+ * `depth`, so only the reachable subgraph of one root is materialized at a time.
+ */
+function collectSubgraph(bySubject, rootIri, depth) {
+    const collected = [];
+    const visited = new Set();
+    let frontier = [rootIri];
+    for (let hop = 0; hop <= depth; hop++) {
+        const next = [];
+        for (const subject of frontier) {
+            if (visited.has(subject)) {
+                continue;
+            }
+            visited.add(subject);
+            const owned = bySubject.get(subject) ?? [];
+            collected.push(...owned);
+            if (hop < depth) {
+                for (const quad of owned) {
+                    if (quad.object.termType === 'NamedNode' ||
+                        quad.object.termType === 'BlankNode') {
+                        next.push(quad.object.value);
+                    }
+                }
+            }
+        }
+        frontier = next;
+    }
+    return collected;
+}

package/dist/index.d.ts

@@ -1,7 +1,7 @@
 export { projectRoots } from './project.js';
 export type { SearchDocument } from './project.js';
 export { defineSearchType, searchSchema, validateSearchType, assertValidSearchType, } from './schema.js';
-export type { FieldKind, SearchField, SearchFieldBase, TextField, KeywordField, ReferenceField, NumericField, BooleanField, SearchType, SearchTypeIssue, SearchSchema, FacetRange, } from './schema.js';
+export type { FieldKind, SearchField, SearchFieldBase, TextField, KeywordField, ReferenceField, NumericField, BooleanField, SearchType, SearchTypeBase, RootType, ReferenceType, RootTypeOf, SearchTypeIssue, SearchSchema, FacetRange, } from './schema.js';
 export type { SearchQuery, Filter, Sort } from './query.js';
 export type { SearchEngine, SearchResult, SearchHit, ResultDocument, SearchValue, LocalizedValue, Reference, FacetBucket, FacetMap, FacetsOutcome, FacetFieldsOf, OutputFieldsOf, } from './engine.js';
 export type { FramedNode } from './frame-by-type.js';

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC5C,YAAY,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAKnD,OAAO,EACL,gBAAgB,EAChB,YAAY,EACZ,kBAAkB,EAClB,qBAAqB,GACtB,MAAM,aAAa,CAAC;AACrB,YAAY,EACV,SAAS,EACT,WAAW,EACX,eAAe,EACf,SAAS,EACT,YAAY,EACZ,cAAc,EACd,YAAY,EACZ,YAAY,EACZ,UAAU,EACV,eAAe,EACf,YAAY,EACZ,UAAU,GACX,MAAM,aAAa,CAAC;AAIrB,YAAY,EAAE,WAAW,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAI5D,YAAY,EACV,YAAY,EACZ,YAAY,EACZ,SAAS,EACT,cAAc,EACd,WAAW,EACX,cAAc,EACd,SAAS,EACT,WAAW,EACX,QAAQ,EACR,aAAa,EACb,aAAa,EACb,cAAc,GACf,MAAM,aAAa,CAAC;AAErB,YAAY,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC5C,YAAY,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAKnD,OAAO,EACL,gBAAgB,EAChB,YAAY,EACZ,kBAAkB,EAClB,qBAAqB,GACtB,MAAM,aAAa,CAAC;AACrB,YAAY,EACV,SAAS,EACT,WAAW,EACX,eAAe,EACf,SAAS,EACT,YAAY,EACZ,cAAc,EACd,YAAY,EACZ,YAAY,EACZ,UAAU,EACV,cAAc,EACd,QAAQ,EACR,aAAa,EACb,UAAU,EACV,eAAe,EACf,YAAY,EACZ,UAAU,GACX,MAAM,aAAa,CAAC;AAIrB,YAAY,EAAE,WAAW,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAI5D,YAAY,EACV,YAAY,EACZ,YAAY,EACZ,SAAS,EACT,cAAc,EACd,WAAW,EACX,cAAc,EACd,SAAS,EACT,WAAW,EACX,QAAQ,EACR,aAAa,EACb,aAAa,EACb,cAAc,GACf,MAAM,aAAa,CAAC;AAErB,YAAY,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC"}

package/dist/project.d.ts

@@ -1,6 +1,6 @@
 import type { Quad } from '@rdfjs/types';
 import { type FramedNode } from './frame-by-type.js';
-import { type SearchSchema, type SearchType } from './schema.js';
+import { type RootType, type SearchSchema, type SearchType } from './schema.js';
 /** A flat search document. `id` is the engine document key. */
 export type SearchDocument = {
     id: string;
@@ -13,11 +13,13 @@ export type SearchDocument = {
  * statement of what the projection reads. {@link isInternalField Internal
  * fields} (those declaring no role) are populated so a later derive can read
  * them, then pruned before the document is returned: they must reach neither a
- * writer nor the collection definition. The physical field names a field fans
- * out to come from {@link physicalFields}, the single source shared with the
- * engine collection definition and the query compiler.
+ * writer nor the collection definition. Pruning ({@link pruneInternalFields})
+ * recurses into the referents of surfaced inline references, so that invariant
+ * holds at every depth, not just the root. The physical field names a field
+ * fans out to come from {@link physicalFields}, the single source shared with
+ * the engine collection definition and the query compiler.
  */
-export declare function projectDocument(node: FramedNode, searchType: SearchType): SearchDocument;
+export declare function projectDocument(node: FramedNode, searchType: SearchType, schema?: SearchSchema): SearchDocument;
 /**
  * Project a single type over a known set of `roots` – the per-type, roots-given
  * projection. The roots are supplied by the caller (the pipeline selector)
@@ -31,5 +33,5 @@ export declare function projectDocument(node: FramedNode, searchType: SearchType
  * Consumes `quads` once, so it accepts any `Iterable` – a batch’s materialized
  * array or a chained generator merging several readers.
  */
-export declare function projectRoots(quads: Iterable<Quad>, roots: readonly string[], schema: SearchSchema, searchType: SearchType): AsyncIterable<SearchDocument>;
+export declare function projectRoots(quads: Iterable<Quad>, roots: readonly string[], schema: SearchSchema, searchType: RootType): AsyncIterable<SearchDocument>;
 //# sourceMappingURL=project.d.ts.map

package/dist/project.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"project.d.ts","sourceRoot":"","sources":["../src/project.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AAEzC,OAAO,EAGL,KAAK,UAAU,EAChB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EASL,KAAK,YAAY,EACjB,KAAK,UAAU,EAEhB,MAAM,aAAa,CAAC;AAErB,+DAA+D;AAC/D,MAAM,MAAM,cAAc,GAAG;IAAE,EAAE,EAAE,MAAM,CAAA;CAAE,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAEtE;;;;;;;;;;;GAWG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,UAAU,EAChB,UAAU,EAAE,UAAU,GACrB,cAAc,CAoBhB;AAED;;;;;;;;;;;;GAYG;AACH,wBAAuB,YAAY,CACjC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,EACrB,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,MAAM,EAAE,YAAY,EACpB,UAAU,EAAE,UAAU,GACrB,aAAa,CAAC,cAAc,CAAC,CAU/B"}
+{"version":3,"file":"project.d.ts","sourceRoot":"","sources":["../src/project.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AAEzC,OAAO,EAGL,KAAK,UAAU,EAChB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAYL,KAAK,QAAQ,EAEb,KAAK,YAAY,EACjB,KAAK,UAAU,EAEhB,MAAM,aAAa,CAAC;AAErB,+DAA+D;AAC/D,MAAM,MAAM,cAAc,GAAG;IAAE,EAAE,EAAE,MAAM,CAAA;CAAE,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAEtE;;;;;;;;;;;;;GAaG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,UAAU,EAChB,UAAU,EAAE,UAAU,EACtB,MAAM,CAAC,EAAE,YAAY,GACpB,cAAc,CAIhB;AAiED;;;;;;;;;;;;GAYG;AACH,wBAAuB,YAAY,CACjC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,EACrB,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,MAAM,EAAE,YAAY,EACpB,UAAU,EAAE,QAAQ,GACnB,aAAa,CAAC,cAAc,CAAC,CAW/B"}

package/dist/project.js

@@ -1,6 +1,6 @@
 import { fold } from '@lde/text-normalization';
 import { buildSubjectIndex, frameSubjects, } from './frame-by-type.js';
-import { assertTypeInSchema, displayFieldName, isInternalField, isoToUnixSeconds, physicalFields, } from './schema.js';
+import { assertTypeInSchema, displayFieldName, inlineFramingDepth, irAlias, isInternalField, isInlineReference, isoToUnixSeconds, physicalFields, referenceTypeNamed, } from './schema.js';
 /**
  * Project one framed JSON-LD node into a flat search document: apply each field
  * of the type in declaration order. A field with a `derive` function computes
@@ -9,26 +9,65 @@ import { assertTypeInSchema, displayFieldName, isInternalField, isoToUnixSeconds
  * statement of what the projection reads. {@link isInternalField Internal
  * fields} (those declaring no role) are populated so a later derive can read
  * them, then pruned before the document is returned: they must reach neither a
- * writer nor the collection definition. The physical field names a field fans
- * out to come from {@link physicalFields}, the single source shared with the
- * engine collection definition and the query compiler.
+ * writer nor the collection definition. Pruning ({@link pruneInternalFields})
+ * recurses into the referents of surfaced inline references, so that invariant
+ * holds at every depth, not just the root. The physical field names a field
+ * fans out to come from {@link physicalFields}, the single source shared with
+ * the engine collection definition and the query compiler.
  */
-export function projectDocument(node, searchType) {
+export function projectDocument(node, searchType, schema) {
+    const document = projectFields(node, searchType, schema);
+    pruneInternalFields(document, searchType, schema);
+    return document;
+}
+/**
+ * Prune every internal field from a fully projected document, in place. Runs
+ * only after all projection – so every derive that might read an internal
+ * field, at any depth, has already run – which makes this single post-order
+ * pass safe. A no-role inline reference is itself internal, so it is deleted
+ * whole here; a surfaced (`output`) inline reference survives, but its own
+ * internal helper fields are pruned from the nested document. That keeps the
+ * *a field without a role reaches neither the engine nor the API* invariant
+ * true at every depth of the reference graph, not just at the root.
+ */
+function pruneInternalFields(document, searchType, schema) {
+    for (const field of searchType.fields) {
+        if (isInternalField(field)) {
+            delete document[field.name];
+            continue;
+        }
+        // A surfaced inline reference nests its referent(s) as SearchDocument(s);
+        // prune those too, by their reference type.
+        if (schema === undefined || field.kind !== 'reference') {
+            continue;
+        }
+        const ref = field.ref;
+        if (ref?.strategy !== 'inline') {
+            continue;
+        }
+        const referenceType = referenceTypeNamed(schema, ref.typeName);
+        const nested = document[field.name];
+        if (referenceType === undefined || nested === undefined) {
+            continue;
+        }
+        for (const referent of Array.isArray(nested) ? nested : [nested]) {
+            pruneInternalFields(referent, referenceType, schema);
+        }
+    }
+}
+/** Apply every field of `searchType` to a fresh document, without pruning – the
+ *  shared core of {@link projectDocument} and inline-referent projection.
+ *  Pruning is deferred to a single recursive pass ({@link pruneInternalFields})
+ *  once the whole nested structure is projected, so a derive at any depth can
+ *  still read an internal field before it is removed. */
+function projectFields(node, searchType, schema) {
     const id = node['@id'];
     if (typeof id !== 'string') {
-        throw new Error(`Cannot project a ${searchType.class} node without an @id: every search document needs a stable key, and an empty one would collide with other keyless nodes.`);
+        throw new Error(`Cannot project a “${searchType.name}” node without an @id: every search document needs a stable key, and an empty one would collide with other keyless nodes.`);
     }
     const document = { id };
     for (const field of searchType.fields) {
-        applyField(document, node, field);
-    }
-    // Prune internal fields: they were projected only so the derives above could
-    // read them (a structural memo shared across every derive that needs the
-    // value), and must not reach the writer or the collection definition.
-    for (const field of searchType.fields) {
-        if (isInternalField(field)) {
-            delete document[field.name];
-        }
+        applyField(document, node, field, searchType, schema);
     }
     return document;
 }
@@ -52,11 +91,12 @@ export async function* projectRoots(quads, roots, schema, searchType) {
     // non-`DISTINCT` `SELECT` over a one-to-many join yields the same subject per
     // matched row – and a repeated root would otherwise frame and emit a
     // duplicate document under the same `id`.
-    for await (const node of frameSubjects(index, [...new Set(roots)])) {
-        yield projectDocument(node, searchType);
+    const depth = inlineFramingDepth(schema, searchType);
+    for await (const node of frameSubjects(index, [...new Set(roots)], depth)) {
+        yield projectDocument(node, searchType, schema);
     }
 }
-function applyField(document, node, field) {
+function applyField(document, node, field, searchType, schema) {
     if (field.derive !== undefined) {
         const value = field.derive(document);
         if (value !== undefined) {
@@ -64,29 +104,45 @@ function applyField(document, node, field) {
         }
         return;
     }
-    const path = field.path;
-    if (path === undefined) {
+    if (field.path === undefined) {
         // Neither path nor derive: populated outside the projection, if at all.
         return;
     }
+    // The framed node is keyed by the {@link irAlias IR Alias} the extraction
+    // CONSTRUCT minted, not by the source `path`: `path` states what to read from
+    // the graph (the reader adapter’s grammar), the alias is what the reader
+    // emitted it under. Minting against `searchType` – a root field against the
+    // root type, an inline referent’s field against its reference type – is what
+    // lets one subject be a root of two types without their fields colliding.
+    const alias = irAlias(searchType, field);
+    if (isInlineReference(field)) {
+        // An inline reference is a nested structure, not a bare IRI: it can only be
+        // projected with the schema that declares its reference type. Without one,
+        // project nothing rather than fall through and emit the referent IRIs under
+        // the field name (the wrong shape).
+        if (schema !== undefined) {
+            applyInlineReference(document, node, alias, field, schema);
+        }
+        return;
+    }
     switch (field.kind) {
         case 'text':
-            return applyText(document, langValuesOf(node, path), field);
+            return applyText(document, langValuesOf(node, alias), field);
         case 'keyword':
-            return applyFacet(document, literalsOf(node, path), field);
+            return applyFacet(document, literalsOf(node, alias), field);
         case 'reference':
-            return applyFacet(document, irisOf(node, path), field);
+            return applyFacet(document, irisOf(node, alias), field);
         case 'integer':
-            return setNumber(document, field.name, toInteger(firstLiteralOf(node, path)));
+            return setNumber(document, field.name, toInteger(firstLiteralOf(node, alias)));
         case 'number':
-            return setNumber(document, field.name, toNumber(firstLiteralOf(node, path)));
+            return setNumber(document, field.name, toNumber(firstLiteralOf(node, alias)));
         case 'date': {
-            const literal = firstLiteralOf(node, path);
+            const literal = firstLiteralOf(node, alias);
             return setNumber(document, field.name, literal === undefined ? undefined : isoToUnixSeconds(literal));
         }
         case 'boolean': {
             // The xsd:boolean lexical space: true/false/1/0.
-            const literal = firstLiteralOf(node, path);
+            const literal = firstLiteralOf(node, alias);
             if (literal !== undefined) {
                 document[field.name] = literal === 'true' || literal === '1';
             }
@@ -153,26 +209,57 @@ function applyFacet(document, raw, field) {
         setArray(document, physicalFields(field).search[0], dedupe(values.map((value) => fold(value))));
     }
 }
-function langValuesOf(node, path) {
-    return valuesOf(node, path)
+/**
+ * Project an inline reference: the referent node(s) embedded under the field’s
+ * {@link irAlias IR Alias} are each projected through the reference’s
+ * {@link ReferenceType} (whose own fields read their own aliases, minted against
+ * the reference type) and attached under the field’s name – a nested
+ * {@link SearchDocument} for a single reference, an array for an `array` one.
+ * The referent is projected in full – internal fields included – so the
+ * declaring type’s (or the reference type’s own) derives can read them;
+ * {@link pruneInternalFields} then removes the internal fields from a *surfaced*
+ * referent and deletes an internal inline reference whole. Recurses through
+ * `schema`, so an inline reference may itself carry further inline references to
+ * the schema’s declared depth. The referent type is guaranteed declared by
+ * {@link searchSchema}.
+ */
+function applyInlineReference(document, node, alias, field, schema) {
+    // Resolves for a schema that declares the referent (always so for the schema a
+    // type is projected through); a type framed against a foreign schema that
+    // omits it simply contributes no nesting.
+    const referenceType = referenceTypeNamed(schema, field.ref.typeName);
+    if (referenceType === undefined) {
+        return;
+    }
+    const referents = valuesOf(node, alias)
+        .filter(isObject)
+        .filter((referent) => typeof referent['@id'] === 'string')
+        .map((referent) => projectFields(referent, referenceType, schema));
+    if (referents.length === 0) {
+        return;
+    }
+    document[field.name] = field.array === true ? referents : referents[0];
+}
+function langValuesOf(node, key) {
+    return valuesOf(node, key)
         .map(toLangValue)
         .filter((value) => value !== undefined);
 }
-function literalsOf(node, path) {
-    return valuesOf(node, path)
+function literalsOf(node, key) {
+    return valuesOf(node, key)
         .map(literalString)
         .filter((value) => value !== undefined);
 }
-function firstLiteralOf(node, path) {
-    return literalsOf(node, path)[0];
+function firstLiteralOf(node, key) {
+    return literalsOf(node, key)[0];
 }
-function irisOf(node, path) {
-    return valuesOf(node, path)
+function irisOf(node, key) {
+    return valuesOf(node, key)
         .map(iriString)
         .filter((value) => value !== undefined);
 }
-function valuesOf(node, path) {
-    const value = node[path];
+function valuesOf(node, key) {
+    const value = node[key];
     if (value === undefined) {
         return [];
     }

package/dist/schema.d.ts

@@ -194,26 +194,60 @@ export interface FacetRange {
     readonly min?: number;
     readonly max?: number;
 }
-/**
- * One root type’s complete search declaration: its logical API `name`, the
- * `class` IRI its documents are instances of (the RDF class), and the queryable
- * `fields` (including {@link SearchField.derive derived} ones). A SHACL
- * generator can emit one per NodeShape (`name`←`sh:name`/local name,
- * `class`←`sh:targetClass`, `fields`←its property shapes), but that is a source,
- * not a requirement.
- */
-export interface SearchType {
+/** The declaration members every {@link SearchType} shares. */
+export interface SearchTypeBase {
     /** Logical API name (PascalCase, e.g. `Dataset`) – names the type in the API
      *  surfaces (GraphQL type names, a REST path), the way each field’s
      *  {@link SearchField.name} names that field. Deliberately declared rather
      *  than derived from the `class` IRI, so re-modelling the vocabulary cannot
      *  silently rename the public contract. */
     readonly name: string;
+    readonly fields: readonly SearchField[];
+}
+/**
+ * A **Root Type**: a {@link SearchType} that is indexed. It declares a `class`,
+ * roots are selected for it, a Writer owns a collection for it, and the
+ * {@link SearchSchema} is keyed by it. A SHACL generator can emit one per
+ * NodeShape (`name`←`sh:name`/local name, `class`←`sh:targetClass`,
+ * `fields`←its property shapes), but that is a source, not a requirement.
+ */
+export interface RootType extends SearchTypeBase {
     /** The RDF class IRI its documents are instances of (`sh:targetClass`); the
-     *  key a {@link SearchSchema} maps this type under. */
+     *  key a {@link SearchSchema} maps this type under. Its presence is what makes
+     *  a type a Root Type – and so what gives it a collection. */
     readonly class: string;
-    readonly fields: readonly SearchField[];
 }
+/**
+ * A **Reference Type**: a {@link SearchType} reached only through an
+ * {@link ReferenceField.ref inline reference}. It declares **no `class`** –
+ * never selected, never framed by type, never indexed; its identity is its
+ * `name`, and its type comes from the edge that points at it, not from the node.
+ * The absence is load-bearing, not stylistic: a `class` would put it in the
+ * {@link SearchSchema} map and silently earn it a collection nobody asked for.
+ * The shape an inline reference carries – see
+ * [ADR 11](../../docs/decisions/0011-decouple-rdf-depth-from-the-api-surface.md).
+ */
+export interface ReferenceType extends SearchTypeBase {
+    /** A Reference Type declares no class; declaring one makes it a
+     *  {@link RootType}. Typed as `never` so the two shapes discriminate the way
+     *  {@link SearchField} discriminates by `kind`: an indexed Reference Type
+     *  fails to compile, not at run time. */
+    readonly class?: never;
+}
+/**
+ * One type’s complete search declaration: its logical API `name`, the queryable
+ * `fields` (including {@link SearchField.derive derived} ones), and – for a
+ * {@link RootType} – the RDF `class` its documents are instances of. Either a
+ * Root Type or a {@link ReferenceType}; the absence of a `class` tells them
+ * apart.
+ */
+export type SearchType = RootType | ReferenceType;
+/** The Root Types among a declared tuple – the ones a {@link SearchSchema}
+ *  keys and a Writer opens a collection for. Reference Types are excluded, so
+ *  no consumer that iterates `schema.values()` ever meets one. */
+export type RootTypeOf<Types extends readonly SearchType[]> = Extract<Types[number], {
+    readonly class: string;
+}>;
 /**
  * Declare a {@link SearchType}, capturing it as a literal: the `const` type
  * parameter preserves the field names and capability flags that the type-level
@@ -224,31 +258,67 @@ export interface SearchType {
  */
 export declare function defineSearchType<const Type extends SearchType>(searchType: Type): Type;
 /**
- * The complete search declaration of a deployment: every root {@link SearchType},
- * keyed by its `class` IRI. Build one with {@link searchSchema}, which captures
- * the declared types as a literal tuple (`Types`), so schema-bound consumers
- * (the engine port) can type their per-type behaviour off it. A plain
+ * The complete search declaration of a deployment: every {@link RootType},
+ * keyed by its `class` IRI, plus the {@link ReferenceType}s an inline reference
+ * resolves against. Build one with {@link searchSchema}, which captures the
+ * declared types as a literal tuple (`Types`), so schema-bound consumers (the
+ * engine port) can type their per-type behaviour off it. A plain
  * `: SearchSchema` annotation widens gracefully to `SearchType`.
+ *
+ * `values()` yields only Root Types – Reference Types are held apart in a name
+ * index ({@link referenceTypeNamed}), so a Writer that opens one collection per
+ * `values()` entry can never open one for a Reference Type.
  */
 /** Brand for {@link SearchSchema}: type-only, no runtime existence. Makes the
  *  schema NOMINAL – a hand-built `Map` is not assignable, so `searchSchema()`
  *  (which validates) is the only way to obtain one and downstream consumers
  *  need no defensive re-validation. */
 export declare const validSearchSchema: unique symbol;
-export interface SearchSchema<Types extends readonly SearchType[] = readonly SearchType[]> extends ReadonlyMap<string, Types[number]> {
+export interface SearchSchema<Types extends readonly SearchType[] = readonly SearchType[]> extends ReadonlyMap<string, RootTypeOf<Types>> {
     readonly [validSearchSchema]: true;
 }
 /**
- * Build a {@link SearchSchema} from root-type declarations, keyed by `class`.
+ * Build a {@link SearchSchema} from type declarations. Its arguments are
+ * **partitioned**: {@link RootType}s (those declaring a `class`) key the map –
+ * so a Writer opens exactly one collection per Root Type – and
+ * {@link ReferenceType}s (no `class`) go into a name index that an inline
+ * `ref.typeName` resolves against ({@link referenceTypeNamed}).
  *
  * Every declaration is validated ({@link assertValidSearchType}) – the
  * declaration-time counterpart of the port’s `assertValidQuery` – and the
- * schema-wide invariants are enforced: no two types may share a `class` IRI
- * (they would silently overwrite each other in the map) or a `name` (names
- * key the API surfaces). Throws on the first invalid declaration, so a bad
- * schema fails at startup, not per document at index time or per query.
+ * schema-wide invariants are enforced: no two Root Types may share a `class` IRI
+ * (they would silently overwrite each other in the map) and no two types may
+ * share a `name` (names key the API surfaces, across Root and Reference Types
+ * alike). Every inline reference must resolve to a declared Reference Type, and
+ * the inline reference graph must be acyclic – the only way its depth could be
+ * unbounded. Throws on the first invalid declaration, so a bad schema fails at
+ * startup, not per document at index time or per query.
  */
 export declare function searchSchema<const Types extends readonly SearchType[]>(...types: Types): SearchSchema<Types>;
+/**
+ * The {@link ReferenceType} an inline `ref.typeName` names, or `undefined` when
+ * the schema declares none by that name. The read side of the name index
+ * {@link searchSchema} partitions the Reference Types into – the projection
+ * resolves an inline reference’s referent shape through it.
+ */
+export declare function referenceTypeNamed(schema: SearchSchema, name: string): ReferenceType | undefined;
+/** Whether a field is an inline reference – a {@link ReferenceField} whose
+ *  `ref` carries its referent’s projected fields ({@link ReferenceType}). */
+export declare function isInlineReference(field: SearchField): field is ReferenceField & {
+    readonly ref: {
+        readonly typeName: string;
+        readonly strategy: 'inline';
+    };
+};
+/**
+ * The framing depth a Root Type needs: how many hops the inline reference graph
+ * reaches from it (`Dataset → Subset → Measurement` is two), floored at one so
+ * the existing single-hop embed for non-inline references is preserved. Depth is
+ * a property of the declaration, bounded because {@link searchSchema} rejects
+ * inline cycles – never a knob or a constant. Framing bounded per batch keeps
+ * memory bounded by the unit of work (ADR 12), not the graph.
+ */
+export declare function inlineFramingDepth(schema: SearchSchema, searchType: SearchType): number;
 /**
  * The text field a label source serves labels from – the ‘label’ convention
  * in one place: an `output` (something to reconstruct a label from),
@@ -304,7 +374,7 @@ export declare function validateSearchType(searchType: SearchType): readonly Sea
  * meet an index the deployment did not declare. Identity-based: the exact
  * declaration object must be in the schema, not a lookalike.
  */
-export declare function assertTypeInSchema(schema: SearchSchema, searchType: SearchType): void;
+export declare function assertTypeInSchema(schema: SearchSchema, searchType: RootType): void;
 /** Throw on a structurally invalid {@link SearchType} ({@link validateSearchType}),
  *  naming every issue. Called by {@link searchSchema} for each declaration. */
 export declare function assertValidSearchType(searchType: SearchType): void;
@@ -394,6 +464,24 @@ export declare function isInternalField(field: SearchField): boolean;
 export declare function referenceFields(searchType: SearchType): readonly ReferenceField[];
 /** Look up a field by its logical name. */
 export declare function fieldNamed(searchType: SearchType, name: string): SearchField | undefined;
+/**
+ * The **IR Alias** predicate for a field: `urn:lde:‹SearchType.name›/‹field.name›`.
+ * The extraction CONSTRUCT emits a field’s value under this minted predicate, and
+ * the {@link projectDocument projection} reads it back under the same key – the
+ * two sides agree by calling this one function rather than by a hand-written
+ * convention that can drift (exactly the argument {@link physicalFields}’ JSDoc
+ * makes for the physical fanout).
+ *
+ * A property path cannot be a CONSTRUCT template verb, so flattening a multi-hop
+ * value onto its subject must mint a predicate for it; that predicate is a
+ * mechanical function of the field name, never authored by hand and never a
+ * public vocabulary. Field names are unique per type and restricted to
+ * `[A-Za-z_][A-Za-z0-9_]*` ({@link validateSearchType}), so the alias needs no
+ * escaping; it is qualified by the **type** name because one subject can be a
+ * root of two types (`frame-by-type`), which must not collide on a shared field
+ * name.
+ */
+export declare function irAlias(searchType: SearchType, field: SearchField): string;
 /**
  * Whether a facet on this field returns fixed range bins (a histogram) rather
  * than one bucket per distinct value: it declares non-empty

package/dist/schema.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAEnD;;;;;;GAMG;AACH,MAAM,MAAM,SAAS,GACjB,MAAM,GACN,SAAS,GACT,SAAS,GACT,QAAQ,GACR,SAAS,GACT,MAAM,GACN,WAAW,CAAC;AAEhB;oEACoE;AACpE,MAAM,MAAM,cAAc,GAAG,IAAI,GAAG,OAAO,GAAG,IAAI,CAAC;AAcnD;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,SAAS,GAAG,cAAc,GAAG,SAAS,CAE7E;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,MAAM,WAAW,GACnB,SAAS,GACT,YAAY,GACZ,cAAc,GACd,YAAY,GACZ,YAAY,CAAC;AAEjB,qEAAqE;AACrE,MAAM,WAAW,eAAe;IAC9B;wCACoC;IACpC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB;+EAC2E;IAC3E,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,oBAAoB;IACpB,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;IACzB;;yCAEqC;IACrC,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC;IAC5B,gEAAgE;IAChE,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC;IAC1B,yBAAyB;IACzB,QAAQ,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC;IAC9B,iCAAiC;IACjC,QAAQ,CAAC,SAAS,CAAC,EAAE,OAAO,CAAC;IAC7B,qFAAqF;IACrF,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC;IAC5B;;;;;;;;;;;OAWG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,QAAQ,EAAE,cAAc,KAAK,OAAO,CAAC;CACzD;AAED;kEACkE;AAClE,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,UAAU,CAAC,EAAE;QAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;CACnD;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,SAAU,SAAQ,eAAe,EAAE,UAAU;IAC5D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,+EAA+E;IAC/E,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,UAAU,CAAC,EAAE,KAAK,CAAC;IAC5B,QAAQ,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC;IAC3B,QAAQ,CAAC,WAAW,CAAC,EAAE,KAAK,CAAC;CAC9B;AAED;gCACgC;AAChC,MAAM,WAAW,YAAa,SAAQ,eAAe,EAAE,UAAU;IAC/D,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,wEAAwE;IACxE,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAAC;IAC/C,QAAQ,CAAC,WAAW,CAAC,EAAE,KAAK,CAAC;CAC9B;AAED,gFAAgF;AAChF,MAAM,WAAW,cAAe,SAAQ,eAAe,EAAE,UAAU;IACjE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B,uCAAuC;IACvC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAAC;IAC/C,QAAQ,CAAC,WAAW,CAAC,EAAE,KAAK,CAAC;IAC7B;;;;;;;OAOG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B;;0DAEsD;IACtD,QAAQ,CAAC,GAAG,CAAC,EAAE;QACb;;;;;qCAK6B;QAC7B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;QAC1B;;;;6EAIqE;QACrE,QAAQ,CAAC,QAAQ,EAAE,WAAW,GAAG,QAAQ,GAAG,QAAQ,CAAC;KACtD,CAAC;CACH;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,UAAU,EAAE,CAAC;CAC9C;AAED;;;;;GAKG;AACH,MAAM,WAAW,YAAa,SAAQ,eAAe,EAAE,cAAc;IACnE,QAAQ,CAAC,IAAI,EAAE,SAAS,GAAG,QAAQ,GAAG,MAAM,CAAC;IAC7C,QAAQ,CAAC,UAAU,CAAC,EAAE,KAAK,CAAC;CAC7B;AAED,0DAA0D;AAC1D,MAAM,WAAW,YAAa,SAAQ,eAAe;IACnD,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,QAAQ,CAAC,UAAU,CAAC,EAAE,KAAK,CAAC;IAC5B,QAAQ,CAAC,WAAW,CAAC,EAAE,KAAK,CAAC;CAC9B;AAED;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,UAAU;IACzB;;;;+CAI2C;IAC3C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB;2DACuD;IACvD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,CAAC;CACzC;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,CAAC,IAAI,SAAS,UAAU,EAC5D,UAAU,EAAE,IAAI,GACf,IAAI,CAEN;AAED;;;;;;GAMG;AACH;;;uCAGuC;AACvC,MAAM,CAAC,OAAO,CAAC,MAAM,iBAAiB,EAAE,OAAO,MAAM,CAAC;AAEtD,MAAM,WAAW,YAAY,CAC3B,KAAK,SAAS,SAAS,UAAU,EAAE,GAAG,SAAS,UAAU,EAAE,CAC3D,SAAQ,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1C,QAAQ,CAAC,CAAC,iBAAiB,CAAC,EAAE,IAAI,CAAC;CACpC;AAED;;;;;;;;;GASG;AACH,wBAAgB,YAAY,CAAC,KAAK,CAAC,KAAK,SAAS,SAAS,UAAU,EAAE,EACpE,GAAG,KAAK,EAAE,KAAK,GACd,YAAY,CAAC,KAAK,CAAC,CAuBrB;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,UAAU,EAAE,UAAU,GAAG,SAAS,GAAG,SAAS,CAQ1E;AAsCD;;;;;GAKG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EACX,sBAAsB,GACtB,oBAAoB,GACpB,gBAAgB,GAChB,aAAa,GACb,iBAAiB,GACjB,uBAAuB,GACvB,qBAAqB,GACrB,0BAA0B,GAC1B,wBAAwB,GACxB,uBAAuB,GACvB,kBAAkB,GAClB,qBAAqB,GACrB,oBAAoB,CAAC;CAC1B;AA0BD;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,wBAAgB,kBAAkB,CAChC,UAAU,EAAE,UAAU,GACrB,SAAS,eAAe,EAAE,CA+E5B;AAWD;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,YAAY,EACpB,UAAU,EAAE,UAAU,GACrB,IAAI,CAUN;AAED;+EAC+E;AAC/E,wBAAgB,qBAAqB,CAAC,UAAU,EAAE,UAAU,GAAG,IAAI,CAQlE;AAED;;;;;GAKG;AACH,MAAM,WAAW,cAAc;IAC7B;sEACkE;IAClE,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC;4EACwE;IACxE,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAC;CAClC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAEvE;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,GAAG,SAAS,CAExE;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,SAAS,EAChB,GAAG,EAAE,MAAM,GACV,MAAM,GAAG,SAAS,CAOpB;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAC9B,UAAU,EAAE,UAAU,GACrB,SAAS,CAAC,WAAW,GAAG;IACzB,QAAQ,CAAC,UAAU,EAAE;QAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;CAClD,CAAC,EAAE,CAOH;AAED,8DAA8D;AAC9D,wBAAgB,eAAe,CAC7B,UAAU,EAAE,UAAU,GACrB,SAAS,WAAW,EAAE,CAExB;AAED,sDAAsD;AACtD,wBAAgB,gBAAgB,CAC9B,UAAU,EAAE,UAAU,GACrB,SAAS,WAAW,EAAE,CAExB;AAED,qEAAqE;AACrE,wBAAgB,cAAc,CAAC,UAAU,EAAE,UAAU,GAAG,SAAS,WAAW,EAAE,CAE7E;AAED,uEAAuE;AACvE,wBAAgB,YAAY,CAAC,UAAU,EAAE,UAAU,GAAG,SAAS,WAAW,EAAE,CAE3E;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAQ3D;AAED,qFAAqF;AACrF,wBAAgB,eAAe,CAC7B,UAAU,EAAE,UAAU,GACrB,SAAS,cAAc,EAAE,CAE3B;AAED,2CAA2C;AAC3C,wBAAgB,UAAU,CACxB,UAAU,EAAE,UAAU,EACtB,IAAI,EAAE,MAAM,GACX,WAAW,GAAG,SAAS,CAEzB;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,WAAW,GACjB,KAAK,IAAI,YAAY,GAAG;IAAE,QAAQ,CAAC,WAAW,EAAE,SAAS,UAAU,EAAE,CAAA;CAAE,CAEzE;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAGhE;AAED,+EAA+E;AAC/E,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAExD;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,WAAW,GAAG,cAAc,CAgBjE"}
+{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAEnD;;;;;;GAMG;AACH,MAAM,MAAM,SAAS,GACjB,MAAM,GACN,SAAS,GACT,SAAS,GACT,QAAQ,GACR,SAAS,GACT,MAAM,GACN,WAAW,CAAC;AAEhB;oEACoE;AACpE,MAAM,MAAM,cAAc,GAAG,IAAI,GAAG,OAAO,GAAG,IAAI,CAAC;AAcnD;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,SAAS,GAAG,cAAc,GAAG,SAAS,CAE7E;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,MAAM,WAAW,GACnB,SAAS,GACT,YAAY,GACZ,cAAc,GACd,YAAY,GACZ,YAAY,CAAC;AAEjB,qEAAqE;AACrE,MAAM,WAAW,eAAe;IAC9B;wCACoC;IACpC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB;+EAC2E;IAC3E,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,oBAAoB;IACpB,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;IACzB;;yCAEqC;IACrC,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC;IAC5B,gEAAgE;IAChE,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC;IAC1B,yBAAyB;IACzB,QAAQ,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC;IAC9B,iCAAiC;IACjC,QAAQ,CAAC,SAAS,CAAC,EAAE,OAAO,CAAC;IAC7B,qFAAqF;IACrF,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC;IAC5B;;;;;;;;;;;OAWG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,QAAQ,EAAE,cAAc,KAAK,OAAO,CAAC;CACzD;AAED;kEACkE;AAClE,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,UAAU,CAAC,EAAE;QAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;CACnD;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,SAAU,SAAQ,eAAe,EAAE,UAAU;IAC5D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,+EAA+E;IAC/E,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,UAAU,CAAC,EAAE,KAAK,CAAC;IAC5B,QAAQ,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC;IAC3B,QAAQ,CAAC,WAAW,CAAC,EAAE,KAAK,CAAC;CAC9B;AAED;gCACgC;AAChC,MAAM,WAAW,YAAa,SAAQ,eAAe,EAAE,UAAU;IAC/D,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,wEAAwE;IACxE,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAAC;IAC/C,QAAQ,CAAC,WAAW,CAAC,EAAE,KAAK,CAAC;CAC9B;AAED,gFAAgF;AAChF,MAAM,WAAW,cAAe,SAAQ,eAAe,EAAE,UAAU;IACjE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B,uCAAuC;IACvC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAAC;IAC/C,QAAQ,CAAC,WAAW,CAAC,EAAE,KAAK,CAAC;IAC7B;;;;;;;OAOG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B;;0DAEsD;IACtD,QAAQ,CAAC,GAAG,CAAC,EAAE;QACb;;;;;qCAK6B;QAC7B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;QAC1B;;;;6EAIqE;QACrE,QAAQ,CAAC,QAAQ,EAAE,WAAW,GAAG,QAAQ,GAAG,QAAQ,CAAC;KACtD,CAAC;CACH;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,UAAU,EAAE,CAAC;CAC9C;AAED;;;;;GAKG;AACH,MAAM,WAAW,YAAa,SAAQ,eAAe,EAAE,cAAc;IACnE,QAAQ,CAAC,IAAI,EAAE,SAAS,GAAG,QAAQ,GAAG,MAAM,CAAC;IAC7C,QAAQ,CAAC,UAAU,CAAC,EAAE,KAAK,CAAC;CAC7B;AAED,0DAA0D;AAC1D,MAAM,WAAW,YAAa,SAAQ,eAAe;IACnD,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,QAAQ,CAAC,UAAU,CAAC,EAAE,KAAK,CAAC;IAC5B,QAAQ,CAAC,WAAW,CAAC,EAAE,KAAK,CAAC;CAC9B;AAED;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,+DAA+D;AAC/D,MAAM,WAAW,cAAc;IAC7B;;;;+CAI2C;IAC3C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,CAAC;CACzC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,QAAS,SAAQ,cAAc;IAC9C;;kEAE8D;IAC9D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,aAAc,SAAQ,cAAc;IACnD;;;6CAGyC;IACzC,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC;CACxB;AAED;;;;;;GAMG;AACH,MAAM,MAAM,UAAU,GAAG,QAAQ,GAAG,aAAa,CAAC;AAElD;;kEAEkE;AAClE,MAAM,MAAM,UAAU,CAAC,KAAK,SAAS,SAAS,UAAU,EAAE,IAAI,OAAO,CACnE,KAAK,CAAC,MAAM,CAAC,EACb;IAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAC3B,CAAC;AAEF;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,CAAC,IAAI,SAAS,UAAU,EAC5D,UAAU,EAAE,IAAI,GACf,IAAI,CAEN;AAED;;;;;;;;;;;GAWG;AACH;;;uCAGuC;AACvC,MAAM,CAAC,OAAO,CAAC,MAAM,iBAAiB,EAAE,OAAO,MAAM,CAAC;AAEtD,MAAM,WAAW,YAAY,CAC3B,KAAK,SAAS,SAAS,UAAU,EAAE,GAAG,SAAS,UAAU,EAAE,CAC3D,SAAQ,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;IAC9C,QAAQ,CAAC,CAAC,iBAAiB,CAAC,EAAE,IAAI,CAAC;CACpC;AAoBD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,YAAY,CAAC,KAAK,CAAC,KAAK,SAAS,SAAS,UAAU,EAAE,EACpE,GAAG,KAAK,EAAE,KAAK,GACd,YAAY,CAAC,KAAK,CAAC,CAmCrB;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,YAAY,EACpB,IAAI,EAAE,MAAM,GACX,aAAa,GAAG,SAAS,CAE3B;AAED;6EAC6E;AAC7E,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,WAAW,GACjB,KAAK,IAAI,cAAc,GAAG;IAC3B,QAAQ,CAAC,GAAG,EAAE;QAAE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAA;KAAE,CAAC;CAC1E,CAEA;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,YAAY,EACpB,UAAU,EAAE,UAAU,GACrB,MAAM,CAER;AA2ED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,UAAU,EAAE,UAAU,GAAG,SAAS,GAAG,SAAS,CAQ1E;AAsCD;;;;;GAKG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EACX,sBAAsB,GACtB,oBAAoB,GACpB,gBAAgB,GAChB,aAAa,GACb,iBAAiB,GACjB,uBAAuB,GACvB,qBAAqB,GACrB,0BAA0B,GAC1B,wBAAwB,GACxB,uBAAuB,GACvB,kBAAkB,GAClB,qBAAqB,GACrB,oBAAoB,CAAC;CAC1B;AA0BD;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,wBAAgB,kBAAkB,CAChC,UAAU,EAAE,UAAU,GACrB,SAAS,eAAe,EAAE,CA+E5B;AAWD;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,YAAY,EACpB,UAAU,EAAE,QAAQ,GACnB,IAAI,CAUN;AAED;+EAC+E;AAC/E,wBAAgB,qBAAqB,CAAC,UAAU,EAAE,UAAU,GAAG,IAAI,CAQlE;AAED;;;;;GAKG;AACH,MAAM,WAAW,cAAc;IAC7B;sEACkE;IAClE,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC;4EACwE;IACxE,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAC;CAClC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAEvE;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,GAAG,SAAS,CAExE;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,SAAS,EAChB,GAAG,EAAE,MAAM,GACV,MAAM,GAAG,SAAS,CAOpB;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAC9B,UAAU,EAAE,UAAU,GACrB,SAAS,CAAC,WAAW,GAAG;IACzB,QAAQ,CAAC,UAAU,EAAE;QAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;CAClD,CAAC,EAAE,CAOH;AAED,8DAA8D;AAC9D,wBAAgB,eAAe,CAC7B,UAAU,EAAE,UAAU,GACrB,SAAS,WAAW,EAAE,CAExB;AAED,sDAAsD;AACtD,wBAAgB,gBAAgB,CAC9B,UAAU,EAAE,UAAU,GACrB,SAAS,WAAW,EAAE,CAExB;AAED,qEAAqE;AACrE,wBAAgB,cAAc,CAAC,UAAU,EAAE,UAAU,GAAG,SAAS,WAAW,EAAE,CAE7E;AAED,uEAAuE;AACvE,wBAAgB,YAAY,CAAC,UAAU,EAAE,UAAU,GAAG,SAAS,WAAW,EAAE,CAE3E;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAQ3D;AAED,qFAAqF;AACrF,wBAAgB,eAAe,CAC7B,UAAU,EAAE,UAAU,GACrB,SAAS,cAAc,EAAE,CAE3B;AAED,2CAA2C;AAC3C,wBAAgB,UAAU,CACxB,UAAU,EAAE,UAAU,EACtB,IAAI,EAAE,MAAM,GACX,WAAW,GAAG,SAAS,CAEzB;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,OAAO,CAAC,UAAU,EAAE,UAAU,EAAE,KAAK,EAAE,WAAW,GAAG,MAAM,CAE1E;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,WAAW,GACjB,KAAK,IAAI,YAAY,GAAG;IAAE,QAAQ,CAAC,WAAW,EAAE,SAAS,UAAU,EAAE,CAAA;CAAE,CAEzE;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAGhE;AAED,+EAA+E;AAC/E,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAExD;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,WAAW,GAAG,cAAc,CAgBjE"}

package/dist/schema.js

@@ -28,32 +28,143 @@ export function defineSearchType(searchType) {
     return searchType;
 }
 /**
- * Build a {@link SearchSchema} from root-type declarations, keyed by `class`.
+ * The Reference Type name index each {@link SearchSchema} carries alongside its
+ * class-keyed root map, kept out of the map itself so no consumer iterating
+ * `values()` ever meets a Reference Type. Held in a `WeakMap` rather than a
+ * property, so the schema stays a plain branded `Map` and the index is read only
+ * through {@link referenceTypeNamed}.
+ */
+const referenceTypesBySchema = new WeakMap();
+/** Whether a declared type is a {@link RootType} (declares a `class`) rather
+ *  than a {@link ReferenceType}. */
+function isRootType(searchType) {
+    return searchType.class !== undefined;
+}
+/**
+ * Build a {@link SearchSchema} from type declarations. Its arguments are
+ * **partitioned**: {@link RootType}s (those declaring a `class`) key the map –
+ * so a Writer opens exactly one collection per Root Type – and
+ * {@link ReferenceType}s (no `class`) go into a name index that an inline
+ * `ref.typeName` resolves against ({@link referenceTypeNamed}).
  *
  * Every declaration is validated ({@link assertValidSearchType}) – the
  * declaration-time counterpart of the port’s `assertValidQuery` – and the
- * schema-wide invariants are enforced: no two types may share a `class` IRI
- * (they would silently overwrite each other in the map) or a `name` (names
- * key the API surfaces). Throws on the first invalid declaration, so a bad
- * schema fails at startup, not per document at index time or per query.
+ * schema-wide invariants are enforced: no two Root Types may share a `class` IRI
+ * (they would silently overwrite each other in the map) and no two types may
+ * share a `name` (names key the API surfaces, across Root and Reference Types
+ * alike). Every inline reference must resolve to a declared Reference Type, and
+ * the inline reference graph must be acyclic – the only way its depth could be
+ * unbounded. Throws on the first invalid declaration, so a bad schema fails at
+ * startup, not per document at index time or per query.
  */
 export function searchSchema(...types) {
     const typeIris = new Set();
     const names = new Set();
     for (const searchType of types) {
         assertValidSearchType(searchType);
-        if (typeIris.has(searchType.class)) {
-            throw new Error(`Duplicate search type IRI “${searchType.class}”; each SearchType must declare a distinct class.`);
+        if (isRootType(searchType)) {
+            if (typeIris.has(searchType.class)) {
+                throw new Error(`Duplicate search type IRI “${searchType.class}”; each Root Type must declare a distinct class.`);
+            }
+            typeIris.add(searchType.class);
         }
         if (names.has(searchType.name)) {
             throw new Error(`Duplicate search type name “${searchType.name}”; each SearchType must declare a distinct name.`);
         }
-        typeIris.add(searchType.class);
         names.add(searchType.name);
     }
+    const referenceTypes = new Map(types
+        .filter((searchType) => !isRootType(searchType))
+        .map((searchType) => [searchType.name, searchType]));
+    assertResolvableInlineReferences(types, referenceTypes);
     assertResolvableLabelSources(types);
     // The one blessed cast: only this validated constructor mints the brand.
-    return new Map(types.map((searchType) => [searchType.class, searchType]));
+    const schema = new Map(types
+        .filter(isRootType)
+        .map((searchType) => [searchType.class, searchType]));
+    referenceTypesBySchema.set(schema, referenceTypes);
+    return schema;
+}
+/**
+ * The {@link ReferenceType} an inline `ref.typeName` names, or `undefined` when
+ * the schema declares none by that name. The read side of the name index
+ * {@link searchSchema} partitions the Reference Types into – the projection
+ * resolves an inline reference’s referent shape through it.
+ */
+export function referenceTypeNamed(schema, name) {
+    return referenceTypesBySchema.get(schema)?.get(name);
+}
+/** Whether a field is an inline reference – a {@link ReferenceField} whose
+ *  `ref` carries its referent’s projected fields ({@link ReferenceType}). */
+export function isInlineReference(field) {
+    return field.kind === 'reference' && field.ref?.strategy === 'inline';
+}
+/**
+ * The framing depth a Root Type needs: how many hops the inline reference graph
+ * reaches from it (`Dataset → Subset → Measurement` is two), floored at one so
+ * the existing single-hop embed for non-inline references is preserved. Depth is
+ * a property of the declaration, bounded because {@link searchSchema} rejects
+ * inline cycles – never a knob or a constant. Framing bounded per batch keeps
+ * memory bounded by the unit of work (ADR 12), not the graph.
+ */
+export function inlineFramingDepth(schema, searchType) {
+    return Math.max(1, inlineChainLength(schema, searchType));
+}
+/** The longest inline reference chain reachable from `searchType`. The recursion
+ *  terminates because {@link searchSchema} rejects inline cycles; a reference the
+ *  given schema does not declare (e.g. a type framed against another schema)
+ *  contributes no depth. */
+function inlineChainLength(schema, searchType) {
+    let longest = 0;
+    for (const field of searchType.fields) {
+        if (!isInlineReference(field)) {
+            continue;
+        }
+        const referent = referenceTypeNamed(schema, field.ref.typeName);
+        if (referent === undefined) {
+            continue;
+        }
+        longest = Math.max(longest, 1 + inlineChainLength(schema, referent));
+    }
+    return longest;
+}
+/**
+ * Every inline `ref.typeName` must resolve to a **declared Reference Type**, and
+ * the inline reference graph must be acyclic. Unlike a `labelOnly` reference –
+ * whose `typeName` is just an API name – an inline reference carries its
+ * referent’s fields, so it must know their shape, and an inline cycle is the one
+ * way framing depth could be unbounded. Checked schema-wide, because a single
+ * declaration cannot see its siblings.
+ */
+function assertResolvableInlineReferences(types, referenceTypes) {
+    for (const searchType of types) {
+        for (const field of searchType.fields) {
+            if (!isInlineReference(field)) {
+                continue;
+            }
+            if (!referenceTypes.has(field.ref.typeName)) {
+                throw new Error(`Inline reference “${searchType.name}.${field.name}” names “${field.ref.typeName}”, which is not a declared reference type; declare a reference type (a SearchType with no class) with that name.`);
+            }
+        }
+    }
+    for (const referenceType of referenceTypes.values()) {
+        assertNoInlineCycle(referenceType, referenceTypes, new Set());
+    }
+}
+function assertNoInlineCycle(referenceType, referenceTypes, onPath) {
+    if (onPath.has(referenceType.name)) {
+        throw new Error(`Inline reference cycle through reference type “${referenceType.name}”; an inline reference graph must be acyclic, so its framing depth stays bounded.`);
+    }
+    const extended = new Set([...onPath, referenceType.name]);
+    for (const field of referenceType.fields) {
+        if (!isInlineReference(field)) {
+            continue;
+        }
+        // Resolvability is validated before any cycle check, so every inline
+        // `typeName` here names a declared reference type.
+        const referent = referenceTypes.get(field.ref.typeName);
+        assertNoInlineCycle(referent, referenceTypes, extended);
+    }
 }
 /**
  * The text field a label source serves labels from – the ‘label’ convention
@@ -344,6 +455,26 @@ export function referenceFields(searchType) {
 export function fieldNamed(searchType, name) {
     return searchType.fields.find((field) => field.name === name);
 }
+/**
+ * The **IR Alias** predicate for a field: `urn:lde:‹SearchType.name›/‹field.name›`.
+ * The extraction CONSTRUCT emits a field’s value under this minted predicate, and
+ * the {@link projectDocument projection} reads it back under the same key – the
+ * two sides agree by calling this one function rather than by a hand-written
+ * convention that can drift (exactly the argument {@link physicalFields}’ JSDoc
+ * makes for the physical fanout).
+ *
+ * A property path cannot be a CONSTRUCT template verb, so flattening a multi-hop
+ * value onto its subject must mint a predicate for it; that predicate is a
+ * mechanical function of the field name, never authored by hand and never a
+ * public vocabulary. Field names are unique per type and restricted to
+ * `[A-Za-z_][A-Za-z0-9_]*` ({@link validateSearchType}), so the alias needs no
+ * escaping; it is qualified by the **type** name because one subject can be a
+ * root of two types (`frame-by-type`), which must not collide on a shared field
+ * name.
+ */
+export function irAlias(searchType, field) {
+    return `urn:lde:${searchType.name}/${field.name}`;
+}
 /**
  * Whether a facet on this field returns fixed range bins (a histogram) rather
  * than one bucket per distinct value: it declares non-empty

package/dist/testing.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"testing.d.ts","sourceRoot":"","sources":["../src/testing.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAahD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,4BAA4B,CAC1C,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,YAAY,GACzB,IAAI,CAsJN"}
+{"version":3,"file":"testing.d.ts","sourceRoot":"","sources":["../src/testing.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAShD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,4BAA4B,CAC1C,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,YAAY,GACzB,IAAI,CAsJN"}

package/dist/testing.js

@@ -1,6 +1,6 @@
 import { describe, expect, it } from 'vitest';
 import { filterOperatorFor, } from './query.js';
-import { facetableFields, filterableFields, } from './schema.js';
+import { facetableFields, filterableFields } from './schema.js';
 /**
  * The executable {@link SearchEngine} port contract (import from
  * `@lde/search/testing`): a vitest suite every engine adapter runs against a

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@lde/search",
-  "version": "0.10.0",
+  "version": "0.12.0",
   "description": "Engine- and domain-agnostic core for RDF-backed search: a unified declarative field model (SearchField/SearchType/SearchSchema), a neutral query IR, the SearchEngine port with logical result types, and a streaming CONSTRUCT-to-document projection. Bakes in no engine, protocol, or domain.",
   "repository": {
     "url": "git+https://github.com/ldelements/lde.git",