@lde/search 0.4.1 → 0.6.0

package/README.md

@@ -3,7 +3,7 @@
 The core of the LDE search family: packages that together act as a **generator
 for search engines**. You write one declarative `SearchSchema`, and everything
 a running search engine needs is derived from it: the document projection, the
-engine collection schema, the query semantics, and the API surface. All these
+engine collection definition, the query semantics, and the API surface. All these
 are kept in sync automatically rather than handwritten per deployment.
 
 The core itself is **engine-, API- and domain-agnostic**: it bakes in no search
@@ -34,7 +34,7 @@ It provides four things:
 
 ```
 SearchSchema ─┬─► projection      (projectGraph → flat documents)        [here]
-              ├─► engine adapter  (collection schema + query compiler)   e.g. @lde/search-typesense
+              ├─► engine adapter  (collection definition + query compiler)   e.g. @lde/search-typesense
               ├─► query semantics (SearchQuery, filter/sort/facet)       [here]
               └─► API surface     (GraphQL / REST)                       e.g. @lde/search-api-graphql
 ```
@@ -50,7 +50,7 @@ results:   engine response ──parse──► SearchResult ──shape──
 ```
 
 Validation happens before the first arrow (SHACL over the RDF) and inside the
-last (the engine enforces its collection schema); between them every stage is
+last (the engine enforces its collection definition); between them every stage is
 a typed, deterministic function — easy to test, and swappable per deployment.
 
 ## Entry points
@@ -72,11 +72,11 @@ 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 `type` IRI and its fields (incl. derived)     | NodeShape      | object type |
-| `SearchSchema` | The whole search declaration: every `SearchType`, keyed by `type` 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 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      |
 
 `projectGraph` and the GraphQL surface consume a `SearchSchema` (projecting
 every type in one pass); the engine port executes one `SearchType` at a time.
@@ -92,7 +92,7 @@ Two conventions hold across the whole family:
   `engine.search(type, query)`.
 - **Factory verbs** — the verb tells you what kind of thing comes back.
   `define*` captures a declaration as a literal (`defineSearchType`);
-  `build*` is a pure data-to-data constructor (`buildCollectionSchema`,
+  `build*` is a pure data-to-data constructor (`buildCollectionDefinition`,
   `buildSearchParams`, `buildGraphQLSchema`); `create*` makes a stateful
   instance (`createTypesenseSearchEngine`). A bare noun (`searchSchema`)
   constructs the trivial container it names.
@@ -104,7 +104,7 @@ read (or a `derive` function for a **derived** field, computed from the framed
 node in declaration order — so it may read fields declared before it), and the
 capabilities it opts into. The physical field names a declaration fans out to
 (per-locale search/sort keys) come from
-`physicalFields`, the single convention projection, the collection schema and the
+`physicalFields`, the single convention projection, the collection definition and the
 query compiler all share.
 
 ```ts
@@ -117,7 +117,7 @@ import {
 
 const DATASET = defineSearchType({
   name: 'Dataset', // logical API name: names the GraphQL type, a REST path, …
-  type: 'http://www.w3.org/ns/dcat#Dataset',
+  class: 'http://www.w3.org/ns/dcat#Dataset',
   fields: [
     // → title_nl, title_en, title_search_nl/_en, title_sort_nl/_en
     {
@@ -150,8 +150,14 @@ const DATASET = defineSearchType({
   ],
 });
 
-for await (const document of projectGraph(quads, searchSchema(DATASET))) {
-  // one flat search document per matching subject, streamed
+for await (const { searchType, document } of projectGraph(
+  quads,
+  searchSchema(DATASET),
+)) {
+  // one flat search document per matching subject, streamed and tagged with the
+  // SearchType it was framed from — so a multi-collection writer can route each
+  // document to the collection for its type. A single-collection consumer just
+  // reads `document`.
 }
 ```
 
@@ -183,7 +189,7 @@ rejects a structurally invalid declaration (duplicate field names, an `output`
 reference without `ref`, `text` without locales, `locales` on a non-text kind,
 `facetRanges` on a non-numeric kind, `searchable`/`transform` on a kind whose
 projection cannot honour it, `filterable`/`facetable` on `text`, two types
-sharing a `type` IRI or `name`) — the declaration-time counterpart of the
+sharing a `class` IRI or `name`) — the declaration-time counterpart of the
 port’s always-on query validation, so a bad schema fails at startup rather
 than per document at index time. `validateSearchType` /
 `assertValidSearchType` are exported for validating a single declaration
@@ -218,6 +224,12 @@ triples are collapsed first, because some SPARQL engines (e.g. QLever) do not
 deduplicate `CONSTRUCT` output. The IR carries no `@context`, so a `derive` function
 reading it sees full predicate IRIs with language tags preserved.
 
+Each yielded value is a `{ searchType, document }` pair: the whole schema
+projects into **one** mixed stream, and every document is tagged with the
+`SearchType` it was framed from. That tag is what lets the write side fan the
+stream out to per-type collections without re-deriving the type from the
+document — see `@lde/search-pipeline`’s multi-collection writer.
+
 `projectGraph` **consumes the quads once** – a single scan builds the subject
 index every type frames off – and so accepts any `Iterable<Quad>`, not just a
 materialized array. A caller merging several sources can pass a chained

package/dist/index.d.ts

@@ -1,5 +1,5 @@
 export { projectGraph, irisOf, literalsOf, firstLiteralOf } from './project.js';
-export type { SearchDocument } from './project.js';
+export type { SearchDocument, TypedSearchDocument } 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 { SearchQuery, Filter, Sort } from './query.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,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAChF,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,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAChF,YAAY,EAAE,cAAc,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AAKxE,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"}

package/dist/project.d.ts

@@ -5,27 +5,40 @@ import { type SearchSchema, type SearchType } from './schema.js';
 export type SearchDocument = {
     id: string;
 } & Record<string, unknown>;
+/**
+ * A projected document tagged with the {@link SearchType} it was projected
+ * from — one element of {@link projectGraph}’s mixed, whole-schema stream. The
+ * tag is what lets a multi-collection writer route each document to the
+ * collection for its type without re-deriving the type from the document.
+ */
+export interface TypedSearchDocument {
+    readonly searchType: SearchType;
+    readonly document: SearchDocument;
+}
 /**
  * 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
  * its value from the node and the document as populated so far (so a derived
  * field may read fields declared before it). The physical field names a field
  * fans out to come from {@link physicalFields}, the single source shared with
- * the engine collection schema and the query compiler.
+ * the engine collection definition and the query compiler.
  */
 export declare function projectDocument(node: FramedNode, searchType: SearchType): SearchDocument;
 /**
  * Frame `quads` for every root type in the schema and project each node with its
- * type’s declaration — the multi-shape pipeline. Streams one document at a time
- * so memory stays flat. The IR maps to a declaration by type, so adding a shape
- * is adding a `SearchType` to the schema (no engine change).
+ * type’s declaration — the multi-shape pipeline. Yields each document tagged
+ * with its {@link SearchType} ({@link TypedSearchDocument}), so a downstream
+ * multi-collection writer can route it to that type’s collection; a
+ * single-collection consumer just reads `.document`. Streams one document at a
+ * time so memory stays flat. The IR maps to a declaration by type, so adding a
+ * shape is adding a `SearchType` to the schema (no engine change).
  *
  * Consumes `quads` once (a single scan builds the shared subject index that
  * every type frames off), so it accepts any `Iterable` – a materialized array or
  * a chained generator merging several sources (`function* () { yield* a; yield* b; }`)
  * with no intermediate copy at the projection peak.
  */
-export declare function projectGraph(quads: Iterable<Quad>, schema: SearchSchema): AsyncIterable<SearchDocument>;
+export declare function projectGraph(quads: Iterable<Quad>, schema: SearchSchema): AsyncIterable<TypedSearchDocument>;
 export declare function literalsOf(node: FramedNode, path: string): string[];
 export declare function firstLiteralOf(node: FramedNode, path: string): string | undefined;
 export declare function irisOf(node: FramedNode, path: string): string[];

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,EAML,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;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,UAAU,EAChB,UAAU,EAAE,UAAU,GACrB,cAAc,CAYhB;AAED;;;;;;;;;;GAUG;AACH,wBAAuB,YAAY,CACjC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,EACrB,MAAM,EAAE,YAAY,GACnB,aAAa,CAAC,cAAc,CAAC,CAW/B;AAsID,wBAAgB,UAAU,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAInE;AAED,wBAAgB,cAAc,CAC5B,IAAI,EAAE,UAAU,EAChB,IAAI,EAAE,MAAM,GACX,MAAM,GAAG,SAAS,CAEpB;AAED,wBAAgB,MAAM,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAI/D"}
+{"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,EAML,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;;;;;GAKG;AACH,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC;IAChC,QAAQ,CAAC,QAAQ,EAAE,cAAc,CAAC;CACnC;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,UAAU,EAChB,UAAU,EAAE,UAAU,GACrB,cAAc,CAYhB;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAuB,YAAY,CACjC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,EACrB,MAAM,EAAE,YAAY,GACnB,aAAa,CAAC,mBAAmB,CAAC,CAWpC;AAsID,wBAAgB,UAAU,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAInE;AAED,wBAAgB,cAAc,CAC5B,IAAI,EAAE,UAAU,EAChB,IAAI,EAAE,MAAM,GACX,MAAM,GAAG,SAAS,CAEpB;AAED,wBAAgB,MAAM,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAI/D"}

package/dist/project.js

@@ -7,12 +7,12 @@ import { isoToUnixSeconds, physicalFields, } from './schema.js';
  * its value from the node and the document as populated so far (so a derived
  * field may read fields declared before it). The physical field names a field
  * fans out to come from {@link physicalFields}, the single source shared with
- * the engine collection schema and the query compiler.
+ * the engine collection definition and the query compiler.
  */
 export function projectDocument(node, searchType) {
     const id = node['@id'];
     if (typeof id !== 'string') {
-        throw new Error(`Cannot project a ${searchType.type} 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.class} 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) {
@@ -22,9 +22,12 @@ export function projectDocument(node, searchType) {
 }
 /**
  * Frame `quads` for every root type in the schema and project each node with its
- * type’s declaration — the multi-shape pipeline. Streams one document at a time
- * so memory stays flat. The IR maps to a declaration by type, so adding a shape
- * is adding a `SearchType` to the schema (no engine change).
+ * type’s declaration — the multi-shape pipeline. Yields each document tagged
+ * with its {@link SearchType} ({@link TypedSearchDocument}), so a downstream
+ * multi-collection writer can route it to that type’s collection; a
+ * single-collection consumer just reads `.document`. Streams one document at a
+ * time so memory stays flat. The IR maps to a declaration by type, so adding a
+ * shape is adding a `SearchType` to the schema (no engine change).
  *
  * Consumes `quads` once (a single scan builds the shared subject index that
  * every type frames off), so it accepts any `Iterable` – a materialized array or
@@ -33,10 +36,10 @@ export function projectDocument(node, searchType) {
  */
 export async function* projectGraph(quads, schema) {
     const types = [...schema.values()];
-    const index = buildSubjectIndex(quads, types.map((searchType) => searchType.type));
+    const index = buildSubjectIndex(quads, types.map((searchType) => searchType.class));
     for (const searchType of types) {
-        for await (const node of frameSubjects(index, searchType.type)) {
-            yield projectDocument(node, searchType);
+        for await (const node of frameSubjects(index, searchType.class)) {
+            yield { searchType, document: projectDocument(node, searchType) };
         }
     }
 }

package/dist/schema.d.ts

@@ -3,7 +3,7 @@ import type { SearchDocument } from './project.js';
 /**
  * The engine-neutral kind of a queryable field. It drives every downstream
  * behavior: which physical fields the projection emits, the engine
- * collection-schema type, the `where`/facet/sort semantics, and the GraphQL
+ * collection-definition type, the `where`/facet/sort semantics, and the GraphQL
  * output/input type. The Typesense-vocabulary types (`string`, `int32`, …) are
  * *derived* from this by the engine adapter, never declared here.
  */
@@ -20,7 +20,7 @@ export type FilterOperator = 'in' | 'range' | 'is';
 export declare function filterOperatorFor(kind: FieldKind): FilterOperator | undefined;
 /**
  * One queryable field — the single declarative source that drives all four
- * consumers (projection, engine collection schema, query semantics, and the
+ * consumers (projection, engine collection definition, query semantics, and the
  * GraphQL surface).
  *
  * A **discriminated union by `kind`**: each kind declares exactly the
@@ -38,7 +38,7 @@ export declare function filterOperatorFor(kind: FieldKind): FilterOperator | und
  *
  * The physical field names a declaration fans out to (per-locale search/sort
  * keys) follow one convention, owned by
- * {@link physicalFields} so projection, collection-schema and query compiler
+ * {@link physicalFields} so projection, collection-definition and query compiler
  * cannot disagree.
  *
  * SHACL is one possible *source*, not a dependency: a generator can emit a
@@ -193,19 +193,22 @@ export interface FacetRange {
 }
 /**
  * One root type’s complete search declaration: its logical API `name`, the
- * `type` IRI its documents are instances of, and the queryable `fields`
- * (including {@link SearchField.derive derived} ones). A SHACL generator can
- * emit one per NodeShape (`name`←`sh:name`/local name, `type`←`sh:targetClass`,
- * `fields`←its property shapes), but that is a source, not a requirement.
+ * `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 {
     /** 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 `type` IRI, so re-modelling the vocabulary cannot
+     *  than derived from the `class` IRI, so re-modelling the vocabulary cannot
      *  silently rename the public contract. */
     readonly name: string;
-    readonly type: string;
+    /** The RDF class IRI its documents are instances of (`sh:targetClass`); the
+     *  key a {@link SearchSchema} maps this type under. */
+    readonly class: string;
     readonly fields: readonly SearchField[];
 }
 /**
@@ -219,7 +222,7 @@ 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 `type` IRI. Build one with {@link searchSchema}, which captures
+ * 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
  * `: SearchSchema` annotation widens gracefully to `SearchType`.
@@ -233,11 +236,11 @@ export interface SearchSchema<Types extends readonly SearchType[] = readonly Sea
     readonly [validSearchSchema]: true;
 }
 /**
- * Build a {@link SearchSchema} from root-type declarations, keyed by `type`.
+ * Build a {@link SearchSchema} from root-type declarations, keyed by `class`.
  *
  * 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 `type` IRI
+ * 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.
@@ -301,7 +304,7 @@ export declare function assertValidSearchType(searchType: SearchType): void;
 /**
  * The physical engine fields one {@link SearchField} fans out into, grouped by
  * the role each plays. The single source of truth for the naming convention, so
- * the projection (writes them), the collection schema (declares them) and the
+ * the projection (writes them), the collection definition (declares them) and the
  * query compiler (reads them) cannot disagree.
  */
 export interface PhysicalFields {

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,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACrD,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;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;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;;;;;;;;;OASG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,cAAc,KAAK,OAAO,CAAC;CAC3E;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;;;;;;GAMG;AACH,MAAM,WAAW,UAAU;IACzB;;;;+CAI2C;IAC3C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,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,aAAa,GACb,iBAAiB,GACjB,uBAAuB,GACvB,qBAAqB,GACrB,0BAA0B,GAC1B,wBAAwB,GACxB,uBAAuB,GACvB,kBAAkB,GAClB,qBAAqB,GACrB,oBAAoB,CAAC;CAC1B;AAQD;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,kBAAkB,CAChC,UAAU,EAAE,UAAU,GACrB,SAAS,eAAe,EAAE,CAkE5B;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,+EAA+E;IAC/E,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC;sEACkE;IAClE,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC;4EACwE;IACxE,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAC;CAClC;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,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,qEAAqE;AACrE,wBAAgB,cAAc,CAAC,KAAK,EAAE,WAAW,GAAG,cAAc,CAoBjE"}
+{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACrD,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;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;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;;;;;;;;;OASG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,cAAc,KAAK,OAAO,CAAC;CAC3E;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,aAAa,GACb,iBAAiB,GACjB,uBAAuB,GACvB,qBAAqB,GACrB,0BAA0B,GAC1B,wBAAwB,GACxB,uBAAuB,GACvB,kBAAkB,GAClB,qBAAqB,GACrB,oBAAoB,CAAC;CAC1B;AAQD;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,kBAAkB,CAChC,UAAU,EAAE,UAAU,GACrB,SAAS,eAAe,EAAE,CAkE5B;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,+EAA+E;IAC/E,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC;sEACkE;IAClE,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC;4EACwE;IACxE,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAC;CAClC;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,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,qEAAqE;AACrE,wBAAgB,cAAc,CAAC,KAAK,EAAE,WAAW,GAAG,cAAc,CAoBjE"}

package/dist/schema.js

@@ -28,11 +28,11 @@ export function defineSearchType(searchType) {
     return searchType;
 }
 /**
- * Build a {@link SearchSchema} from root-type declarations, keyed by `type`.
+ * Build a {@link SearchSchema} from root-type declarations, keyed by `class`.
  *
  * 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 `type` IRI
+ * 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.
@@ -42,18 +42,18 @@ export function searchSchema(...types) {
     const names = new Set();
     for (const searchType of types) {
         assertValidSearchType(searchType);
-        if (typeIris.has(searchType.type)) {
-            throw new Error(`Duplicate search type IRI “${searchType.type}”; each SearchType must declare a distinct type.`);
+        if (typeIris.has(searchType.class)) {
+            throw new Error(`Duplicate search type IRI “${searchType.class}”; each SearchType must declare a distinct 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.type);
+        typeIris.add(searchType.class);
         names.add(searchType.name);
     }
     assertResolvableLabelSources(types);
     // The one blessed cast: only this validated constructor mints the brand.
-    return new Map(types.map((searchType) => [searchType.type, searchType]));
+    return new Map(types.map((searchType) => [searchType.class, searchType]));
 }
 /**
  * The text field a label source serves labels from – the ‘label’ convention
@@ -193,7 +193,7 @@ export function validateSearchType(searchType) {
  * declaration object must be in the schema, not a lookalike.
  */
 export function assertTypeInSchema(schema, searchType) {
-    if (schema.get(searchType.type) !== searchType) {
+    if (schema.get(searchType.class) !== searchType) {
         throw new Error(`Search type “${searchType.name}” is not in this engine’s schema; it serves ${[
             ...schema.values(),
         ]

package/dist/testing.js

@@ -32,13 +32,13 @@ export function describeSearchEngineContract(name, engine) {
             expect(types().length).toBeGreaterThan(0);
             for (const searchType of types()) {
                 expect(typeof searchType.name).toBe('string');
-                expect(typeof searchType.type).toBe('string');
+                expect(typeof searchType.class).toBe('string');
             }
         });
         it('rejects a search type outside its schema', async () => {
             const foreign = {
                 name: 'NotInSchema',
-                type: 'urn:test:not-in-schema',
+                class: 'urn:test:not-in-schema',
                 fields: [],
             };
             await expect(engine().search(foreign, browse(foreign))).rejects.toThrow(/not in this engine/);
@@ -78,7 +78,7 @@ export function describeSearchEngineContract(name, engine) {
         it('rejects a searchFacets batch for a type outside its schema', async () => {
             const foreign = {
                 name: 'NotInSchema',
-                type: 'urn:test:not-in-schema',
+                class: 'urn:test:not-in-schema',
                 fields: [],
             };
             await expect(engine().searchFacets(foreign, [browse(foreign)])).rejects.toThrow(/not in this engine/);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@lde/search",
-  "version": "0.4.1",
+  "version": "0.6.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",