@lde/search 0.28.1 → 0.30.0

package/dist/schema.js

@@ -120,7 +120,7 @@ export function referenceTypeNamed(schema, name) {
 }
 /**
  * The {@link RootType} a declaration names – a `lookup`’s `target`, an
- * `idOnly`’s {@link ReferenceField.labelSource} ({@link labelSourceNameOf}), a
+ * `idOnly`’s {@link ReferenceField.labelSource} ({@link labelSourceNamesOf}), a
  * join edge – or `undefined` when the schema declares no Root Type by that
  * name. The one reading of *which type does this point at*, so the projection
  * (which re-keys a reference through its target’s {@link KeyField}), the
@@ -250,27 +250,34 @@ function framingReach(schema, searchType, visiting = new Set()) {
         // the cut as “reach 0, and nothing else to count” left the innermost
         // referent’s key one hop outside the frame, so it stored a node IRI that
         // matches nothing in the target’s collection.
-        const local = localLookupTypeOf(field, schema);
-        if (local !== undefined && !onPath.has(local.name)) {
-            furthest = Math.max(furthest, hops + framingReach(schema, local, onPath));
-            continue;
+        //
+        // Several targets each contribute their own reach: a referent is framed
+        // once, and the frame has to hold whichever declaration it turns out to
+        // match, so the furthest of them decides.
+        // The field’s own traversal counts whatever it names.
+        furthest = Math.max(furthest, hops);
+        const local = localLookupTargetsOf(field, schema).filter((target) => !onPath.has(target.name));
+        for (const target of local) {
+            furthest = Math.max(furthest, hops + framingReach(schema, target, onPath));
         }
         // A keyed target’s key field is itself path-bearing, so its own traversal
         // counts too – the extraction reads it off the referent with that path.
-        const keyPath = keyedTargetKeyPath(field, schema);
-        furthest = Math.max(furthest, hops + (keyPath === undefined ? 0 : pathHopCount(keyPath)));
+        // Counted for every target that is not locally expanded above, cut ones
+        // included: there the extraction falls back to exactly this hop.
+        for (const target of referencedTargetsOf(field, schema)) {
+            if (local.includes(target)) {
+                continue;
+            }
+            const keyPath = keyPathOf(target);
+            furthest = Math.max(furthest, hops + (keyPath === undefined ? 0 : pathHopCount(keyPath)));
+        }
     }
     return furthest;
 }
-/** The `path` of the key field of the keyed Root Type a reference names, when
- *  it names one that declares a {@link RootType.key}. */
-function keyedTargetKeyPath(field, schema) {
-    if (field.kind !== 'reference') {
-        return undefined;
-    }
-    const targetName = labelSourceNameOf(field);
-    const target = targetName === undefined ? undefined : rootTypeNamed(schema, targetName);
-    if (target?.key === undefined) {
+/** The `path` of a Root Type’s key field, when it declares a
+ *  {@link RootType.key}. */
+function keyPathOf(target) {
+    if (target.key === undefined) {
         return undefined;
     }
     // `searchSchema` guarantees a key field that is declared and path-bearing –
@@ -395,7 +402,7 @@ function assertIdentityCompanion(searchType, field, referenceTypes) {
         throw new Error(`${where} names identity “${identity}”, which “${field.ref.typeName}” does not declare.`);
     }
     if (identityField.kind !== 'reference' ||
-        labelSourceNameOf(identityField) === undefined) {
+        labelSourceNamesOf(identityField).length === 0) {
         throw new Error(`${where} names identity “${identity}”, which names no target: an identity companion holds ids of documents in a collection, so the field it harvests must be a reference declaring a “lookup” target or a label source.`);
     }
 }
@@ -612,15 +619,36 @@ export function labelFieldOf(searchType) {
         : undefined;
 }
 /**
- * The Root Type a reference resolves labels from, by name: a `lookup`’s
- * `target`, an `idOnly`’s {@link ReferenceField.labelSource}, or `undefined`
- * when it resolves none. One reading for the two declarations, so a consumer
- * never branches on the strategy to find the collection.
+ * The Root Types a reference resolves labels from, by name and in order of
+ * precedence: a `lookup`’s `target`, an `idOnly`’s
+ * {@link ReferenceField.labelSource}, or none when it resolves none. One
+ * reading for the two declarations, so a consumer never branches on the
+ * strategy to find the collection – and one **shape** for the one-target and
+ * the several-target declaration, so a consumer never branches on that either:
+ * a single name is the list of one.
  */
-export function labelSourceNameOf(field) {
-    return field.ref?.strategy === 'lookup'
-        ? field.ref.target
-        : field.labelSource;
+export function labelSourceNamesOf(field) {
+    const declared = field.ref?.strategy === 'lookup' ? field.ref.target : field.labelSource;
+    return declared === undefined
+        ? []
+        : typeof declared === 'string'
+            ? [declared]
+            : declared;
+}
+/**
+ * The Root Types a reference resolves against ({@link labelSourceNamesOf}),
+ * resolved in the given schema and in order of precedence. A name the schema
+ * does not declare as a Root Type is skipped – `searchSchema` rejects such a
+ * declaration, so this only happens for a field read against a foreign schema,
+ * where it resolves what it can.
+ */
+export function referencedTargetsOf(field, schema) {
+    if (schema === undefined || field.kind !== 'reference') {
+        return [];
+    }
+    return labelSourceNamesOf(field)
+        .map((name) => rootTypeNamed(schema, name))
+        .filter((target) => target !== undefined);
 }
 /**
  * Every name a reference resolves labels from – a `lookup`’s `target` or an
@@ -655,28 +683,97 @@ function assertResolvableLabelSources(types, schema) {
                     throw new Error(`Reference “${searchType.name}.${field.name}” declares a label source on a ${field.ref.strategy} reference; only an idOnly reference does, for its facet buckets.`);
                 }
             }
-            const sourceName = field.kind === 'reference' && field.ref?.strategy === 'lookup'
-                ? field.ref.target
-                : labelSource;
-            if (sourceName === undefined) {
+            if (field.kind !== 'reference') {
                 continue;
             }
-            const source = rootTypeNamed(schema, sourceName);
-            if (source === undefined) {
-                // A name that IS declared, just not as a Root Type, is the confusing
-                // case: telling the author to declare a type they already declared
-                // would send them looking in the wrong place. Only a Root Type has a
-                // collection to resolve against, so name that instead.
-                throw new Error(referenceTypeNamed(schema, sourceName) === undefined
-                    ? `Reference “${searchType.name}.${field.name}” names unknown label source “${sourceName}”; declare a SearchType with that name.`
-                    : `Reference “${searchType.name}.${field.name}” names label source “${sourceName}”, which is a Reference Type; a label source must be a Root Type, since a resolved label is read from that type’s own collection.`);
+            const sources = [];
+            for (const sourceName of labelSourceNamesOf(field)) {
+                const source = rootTypeNamed(schema, sourceName);
+                if (source === undefined) {
+                    // A name that IS declared, just not as a Root Type, is the confusing
+                    // case: telling the author to declare a type they already declared
+                    // would send them looking in the wrong place. Only a Root Type has a
+                    // collection to resolve against, so name that instead.
+                    throw new Error(referenceTypeNamed(schema, sourceName) === undefined
+                        ? `Reference “${searchType.name}.${field.name}” names unknown label source “${sourceName}”; declare a SearchType with that name.`
+                        : `Reference “${searchType.name}.${field.name}” names label source “${sourceName}”, which is a Reference Type; a label source must be a Root Type, since a resolved label is read from that type’s own collection.`);
+                }
+                if (labelFieldOf(source) === undefined) {
+                    throw new Error(`Reference “${searchType.name}.${field.name}” uses label source “${sourceName}”, which must declare an output, searchable text field “${labelFieldNameOf(source)}”.`);
+                }
+                sources.push(source);
             }
-            if (labelFieldOf(source) === undefined) {
-                throw new Error(`Reference “${searchType.name}.${field.name}” uses label source “${sourceName}”, which must declare an output, searchable text field “${labelFieldNameOf(source)}”.`);
+            assertCompatibleTargets(searchType, field, sources);
+        }
+    }
+}
+/**
+ * The targets of a reference naming **several** may not disagree about a
+ * field they both declare: a stored referent of either kind lands in one
+ * nested object, which an engine declares once, so `birthDate` cannot be a
+ * `date` on one target and a `keyword` on the other, nor a list on one and a
+ * single value on the other – nor an id on one and a nested document on the
+ * other, nor indexed on one and stored only on the other. Everything that
+ * decides a nested field’s physical shape has to agree: kind, arity, the
+ * Roles it opts into, and for a reference the strategy and what it points at.
+ * A field only one target declares is fine – the other simply never fills it
+ * – and so is a `text` field whose locales differ, since display stores every
+ * present language regardless.
+ */
+function assertCompatibleTargets(searchType, field, targets) {
+    const seen = new Map();
+    for (const target of targets) {
+        for (const declared of target.fields) {
+            const earlier = seen.get(declared.name);
+            if (earlier === undefined) {
+                seen.set(declared.name, { target, field: declared });
+                continue;
+            }
+            if (describeShape(earlier.field) !== describeShape(declared)) {
+                throw new Error(`Reference “${searchType.name}.${field.name}” names targets “${earlier.target.name}” and “${target.name}”, which both declare “${declared.name}” but not alike (${describeShape(earlier.field)} vs ${describeShape(declared)}); a referent of either kind is stored in one shape, so a field the targets share must be declared the same on both.`);
             }
         }
     }
 }
+/**
+ * Everything that decides a field’s physical shape, spelled out for a message
+ * comparing two declarations: kind and arity, the Roles it carries, and for a
+ * reference its strategy, what it points at, and whether it stores a copy.
+ */
+function describeShape(field) {
+    const roles = ['filterable', 'facetable', 'sortable'].filter((role) => field[role] === true);
+    if (field.searchable !== undefined) {
+        roles.push('searchable');
+    }
+    const ref = field.kind === 'reference' && field.ref !== undefined
+        ? [
+            field.ref.strategy,
+            ...labelSourceNamesOf(field),
+            ...(field.ref.strategy === 'inline' ? [field.ref.typeName] : []),
+            ...(field.ref.strategy === 'lookup' && field.ref.local === true
+                ? ['local']
+                : []),
+        ]
+        : [];
+    return [
+        field.array === true ? `${field.kind} list` : field.kind,
+        ...(ref.length > 0 ? [`→ ${ref.join(' ')}`] : []),
+        ...(roles.length > 0 ? [`(${roles.join(', ')})`] : []),
+    ].join(' ');
+}
+/**
+ * The Root Type a stored referent was projected through, among the targets
+ * its lookup names: the one its discriminator names ({@link TARGET_FIELD}),
+ * or the first declared where it carries none – a single-target lookup stores
+ * none, and the first target is also what an unmatched referent was projected
+ * through. The one reading of a stored discriminator, so the projection
+ * (which prunes through it) and an engine adapter (which reconstructs through
+ * it) cannot read it differently.
+ */
+export function storedTargetOf(entry, targets) {
+    const name = entry[TARGET_FIELD];
+    return targets.find((target) => target.name === name) ?? targets[0];
+}
 /**
  * The reserved logical name of a document’s IRI – the one field every indexed
  * thing carries, and the only one no {@link SearchType} declares. It is the
@@ -706,9 +803,28 @@ export const ID_FIELD = 'id';
  */
 export const AND_KEY = 'and';
 export const OR_KEY = 'or';
+/**
+ * The physical name under which a stored referent of a lookup naming
+ * **several** targets records which of them it belongs to: the `name` of the
+ * Root Type whose `class` its `rdf:type` matched first, or the first target
+ * declared where none did. Written by the projection, read by an engine
+ * adapter to reconstruct the referent through the right declaration when no
+ * collection answers for it – an unidentified referent, or an identified one
+ * whose document is not indexed. A single-target lookup stores none: there is
+ * nothing to tell apart.
+ *
+ * Reserved schema-wide ({@link validateSearchType} rejects a field of this
+ * name), so it can never shadow a declared field of a stored entry.
+ */
+export const TARGET_FIELD = '_target';
 /** The logical field names no {@link SearchType} may declare, each because a
  *  surface already gives that name a meaning of its own. */
-const RESERVED_FIELD_NAMES = [ID_FIELD, AND_KEY, OR_KEY];
+const RESERVED_FIELD_NAMES = [
+    ID_FIELD,
+    AND_KEY,
+    OR_KEY,
+    TARGET_FIELD,
+];
 /** Kinds that can feed full-text search (project a folded search field). */
 const SEARCHABLE_KINDS = ['text', 'keyword', 'reference'];
 /** Kinds whose projection applies the {@link KeywordField.transform}. */
@@ -833,16 +949,38 @@ export function validateSearchType(searchType) {
             if (field.output === true &&
                 ((field.ref?.strategy === 'inline' &&
                     field.ref.typeName === undefined) ||
-                    (field.ref?.strategy === 'lookup' && field.ref.target === undefined))) {
+                    (field.ref?.strategy === 'lookup' &&
+                        labelSourceNamesOf(field).length === 0))) {
                 issue('missing-ref-type-name');
             }
             // A join addresses the referent's collection – the one a lookup's
             // `target` or an idOnly's `labelSource` names. With neither, the flag
             // states an edge to nowhere.
-            if (field.joinable === true &&
-                labelSourceNameOf(field) === undefined) {
+            const targets = labelSourceNamesOf(field);
+            if (field.joinable === true && targets.length === 0) {
                 issue('joinable-without-label-source');
             }
+            // An engine reference names ONE collection, and ids that live in
+            // several have no single collection to reference – so a reference whose
+            // referent may be any of several types can never be an engine edge. Its
+            // labels, facets and id filters all work from this document; a
+            // condition on the referent’s own fields does not (#717).
+            if (field.joinable === true && targets.length > 1) {
+                issue('joinable-with-several-targets');
+            }
+            // Precedence between targets is declaration order, so a name declared
+            // twice would have to mean two different ranks.
+            if (new Set(targets).size !== targets.length) {
+                issue('duplicate-target');
+            }
+            // A list of targets names at least one: an empty one would silently
+            // read as no target at all – no re-keying, no labels, no facet policy.
+            const declaredTargets = field.ref?.strategy === 'lookup'
+                ? field.ref.target
+                : field.labelSource;
+            if (Array.isArray(declaredTargets) && declaredTargets.length === 0) {
+                issue('empty-target');
+            }
             // An inline reference is stored as a NESTED OBJECT, not as an id an
             // engine can point a reference field at, so the two cannot both hold:
             // the collection definition would emit the nesting and silently drop the
@@ -1040,44 +1178,46 @@ export function identityFieldName(name) {
     return `${name}_id`;
 }
 /**
- * The Root Type whose labels a reference’s **facet buckets** read – its own
- * label source, or, for an inline reference, the one its
- * {@link ReferenceStrategy.identity identity companion} points at.
+ * The Root Types whose labels a reference’s **facet buckets** read, by name and
+ * in order of precedence – its own label sources, or, for an inline reference,
+ * those its {@link ReferenceStrategy.identity identity companion} points at.
+ * Empty for a field that labels no bucket.
  *
- * The same one-level-in reading {@link inheritedFacetKeys} makes, and for the
- * same reason: the companion holds that field’s ids, so the type that names
- * those ids is the type that can label them. Kept together with it so a facet
- * cannot inherit a policy from one type and its labels from another – or, as
- * happened first, inherit the policy and no labels at all.
+ * The same one-level-in reading {@link inheritedFacetPolicies} makes, and for
+ * the same reason: the companion holds that field’s ids, so the types that
+ * name those ids are the types that can label them. Kept together with it so a
+ * facet cannot inherit a policy from one type and its labels from another –
+ * or, as happened first, inherit the policy and no labels at all.
  */
-export function labelTargetNameOf(field, schema) {
+export function labelTargetNamesOf(field, schema) {
     if (field.kind !== 'reference') {
-        return undefined;
+        return [];
     }
-    return labelSourceNameOf(identityFieldOf(field, schema) ?? field);
+    return labelSourceNamesOf(identityFieldOf(field, schema) ?? field);
 }
 /**
- * The Root Type a {@link ReferenceStrategy.local local} lookup projects its
- * referents through, or `undefined` for every other field. Such a reference
- * stores nested documents shaped by the **target’s own declaration** – so it
- * needs no reference type of its own, and reconstructs through the same path a
- * resolved referent does.
+ * The Root Types a {@link ReferenceStrategy.local local} lookup projects its
+ * referents through, in order of precedence – or none for every other field.
+ * Such a reference stores nested documents shaped by the **target’s own
+ * declaration** – so it needs no reference type of its own, and reconstructs
+ * through the same path a resolved referent does. With several targets, each
+ * referent is projected through the one its `rdf:type` matches
+ * ({@link TARGET_FIELD}).
  */
-export function localLookupTypeOf(field, schema) {
-    if (schema === undefined ||
-        field.kind !== 'reference' ||
+export function localLookupTargetsOf(field, schema) {
+    if (field.kind !== 'reference' ||
         field.ref?.strategy !== 'lookup' ||
         field.ref.local !== true) {
-        return undefined;
+        return [];
     }
-    return rootTypeNamed(schema, field.ref.target);
+    return referencedTargetsOf(field, schema);
 }
 /**
  * The nested reference an inline reference’s
  * {@link ReferenceStrategy.identity identity companion} harvests, or
  * `undefined` where the field declares none (or the schema cannot resolve its
  * reference type). The one reading of *which nested field identifies the edge*,
- * so the projection (which harvests it), {@link inheritedFacetKeys} (which
+ * so the projection (which harvests it), {@link inheritedFacetPolicies} (which
  * reads its target’s facet policy) and an adapter’s filter compiler cannot
  * resolve it differently.
  */
@@ -1304,13 +1444,22 @@ 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
- * {@link RangeFacetable.facetRanges}. One predicate for the surface’s facet
- * type, the adapter’s facet clause and the bucket reconstruction, so they
- * cannot disagree.
+ * Whether a facet on this field is a **range facet**: the field is numeric
+ * (`integer`/`number`/`date`), so its facet reports the extent of its values
+ * besides its buckets. One predicate for the surface’s facet type and the
+ * facet reconstruction, so they cannot disagree.
  */
 export function isRangeFacet(field) {
+    return (field.kind === 'integer' || field.kind === 'number' || field.kind === 'date');
+}
+/**
+ * Whether a facet on this field is a **binned range facet**: it buckets into
+ * the fixed bins it declares as non-empty {@link RangeFacetable.facetRanges}
+ * rather than one bucket per distinct value. One predicate for the surface’s
+ * facet type, the adapter’s facet clause and the bucket reconstruction, so
+ * they cannot disagree.
+ */
+export function isBinnedRangeFacet(field) {
     return field.facetRanges !== undefined && field.facetRanges.length > 0;
 }
 /**
@@ -1388,7 +1537,7 @@ export function unixSecondsToIso(seconds) {
  * The facet is the one member that depends on more than the declaration: a
  * facetable reference whose target declares a {@link FacetKeys facet policy}
  * facets a `${name}_facet` companion rather than itself, and only the `schema`
- * can resolve that target ({@link inheritedFacetKeys}). Without one the field
+ * can resolve that target ({@link inheritedFacetPolicies}). Without one the field
  * facets on its own name – the same reading the projection makes without a
  * schema, where it cannot re-key a reference either.
  */
@@ -1414,7 +1563,7 @@ export function physicalFields(field, schema) {
     // reference that names an `identity`, and a `local` lookup, whose own id is
     // otherwise a level further in than an engine can weld a condition to.
     const nestsAnObject = identityFieldOf(field, schema) !== undefined ||
-        (localLookupTypeOf(field, schema) !== undefined &&
+        (localLookupTargetsOf(field, schema).length > 0 &&
             field.filterable === true);
     const identity = nestsAnObject ? identityFieldName(field.name) : undefined;
     const filtered = identity ?? field.name;
@@ -1423,16 +1572,20 @@ export function physicalFields(field, schema) {
         sort: [],
         facet: field.facetable !== true
             ? undefined
-            : inheritedFacetKeys(field, schema) === undefined
+            : inheritedFacetPolicies(field, schema).size === 0
                 ? filtered
                 : `${filtered}_facet`,
         identity,
     };
 }
 /**
- * The {@link FacetKeys facet policy} a field inherits: the `facetKeys` of the
- * Root Type it names ({@link labelSourceNameOf}), when the field is a facetable
- * reference and the schema resolves that type. The boundary is *naming the
+ * The {@link FacetKeys facet policies} a field inherits, keyed by the `name` of
+ * the Root Type declaring each: the `facetKeys` of every type the field names
+ * ({@link labelSourceNamesOf}) that declares one, when the field is a facetable
+ * reference and the schema resolves those types. Empty where nothing is
+ * inherited. With several targets, an id is admitted to a bucket by the policy
+ * of the target it belongs to, and unconditionally where that target declares
+ * none. The boundary is *naming the
  * target* – the same line along which a reference is re-keyed and a join is
  * drawn – so a reference that names no type inherits nothing, whatever type
  * its values happen to point at; and a `derive`d reference, which produces its
@@ -1448,16 +1601,19 @@ export function physicalFields(field, schema) {
  * rather than declaring it twice is what keeps *which of a type’s ids deserve
  * a bucket* a fact about the type.
  */
-export function inheritedFacetKeys(field, schema) {
+export function inheritedFacetPolicies(field, schema) {
+    const policies = new Map();
     if (schema === undefined ||
         field.kind !== 'reference' ||
         field.facetable !== true ||
         field.derive !== undefined) {
-        return undefined;
+        return policies;
     }
     const identity = identityFieldOf(field, schema);
-    const targetName = labelSourceNameOf(identity ?? field);
-    return targetName === undefined
-        ? undefined
-        : rootTypeNamed(schema, targetName)?.facetKeys;
+    for (const target of referencedTargetsOf(identity ?? field, schema)) {
+        if (target.facetKeys !== undefined) {
+            policies.set(target.name, target.facetKeys);
+        }
+    }
+    return policies;
 }

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;AAoBhD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,4BAA4B,CAC1C,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,YAAY,GACzB,IAAI,CAuRN"}
+{"version":3,"file":"testing.d.ts","sourceRoot":"","sources":["../src/testing.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAuBhD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,4BAA4B,CAC1C,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,YAAY,GACzB,IAAI,CAiUN"}

package/dist/testing.js

@@ -1,6 +1,6 @@
 import { describe, expect, it } from 'vitest';
 import { filterOn, filterOperatorFor, } from './query.js';
-import { facetableFields, filterableFields, ID_FIELD, inheritedFacetKeys, nestedReferenceType, outputFields, } from './schema.js';
+import { facetableFields, isRangeFacet, filterableFields, ID_FIELD, identityFieldOf, inheritedFacetPolicies, referencedTargetsOf, nestedReferenceType, outputFields, } from './schema.js';
 /**
  * The executable {@link SearchEngine} port contract (import from
  * `@lde/search/testing`): a vitest suite every engine adapter runs against a
@@ -136,8 +136,8 @@ export function describeSearchEngineContract(name, engine) {
                     const booleanFacets = new Set(facetableFields(searchType)
                         .filter((field) => field.kind === 'boolean')
                         .map((field) => field.name));
-                    for (const [name, buckets] of Object.entries(outcome.facets)) {
-                        for (const bucket of buckets ?? []) {
+                    for (const [name, facet] of Object.entries(outcome.facets)) {
+                        for (const bucket of facet?.buckets ?? []) {
                             expect(typeof bucket.value).toBe('string');
                             expect(typeof bucket.count).toBe('number');
                             // A boolean facet MUST carry `is`: a surface types it non-null
@@ -151,6 +151,34 @@ export function describeSearchEngineContract(name, engine) {
                 }
             }
         });
+        it('reports a range facet’s extent, and no other facet’s', async () => {
+            // A slider is drawn from these bounds.
+            for (const searchType of types()) {
+                const fields = facetableFields(searchType);
+                const [outcome] = await engine().searchFacets(searchType, [
+                    {
+                        ...browse(searchType),
+                        limit: 0,
+                        facets: fields.map((field) => field.name),
+                    },
+                ]);
+                if (outcome === undefined || 'error' in outcome) {
+                    continue; // The batch test above fails on this already.
+                }
+                for (const field of fields) {
+                    const facet = outcome.facets[field.name];
+                    if (!isRangeFacet(field)) {
+                        expect(facet?.extent).toBeUndefined();
+                        continue;
+                    }
+                    const extent = facet?.extent;
+                    if (extent !== undefined) {
+                        expect(typeof extent.min).toBe('number');
+                        expect(extent.min <= extent.max).toBe(true);
+                    }
+                }
+            }
+        });
         it('resolves an empty searchFacets batch to an empty list', async () => {
             for (const searchType of types()) {
                 await expect(engine().searchFacets(searchType, [])).resolves.toEqual([]);
@@ -212,8 +240,16 @@ export function describeSearchEngineContract(name, engine) {
             // second assertion bites.
             for (const searchType of types()) {
                 for (const field of facetableFields(searchType)) {
-                    const policy = inheritedFacetKeys(field, engine().schema);
-                    if (policy === undefined) {
+                    // A bucket keyed on an id of one target is admitted by that
+                    // target’s policy, and a target declaring none admits every one of
+                    // its ids. Which target a bucket belongs to is not visible here, so
+                    // the contract is checked only where every target constrains: then
+                    // a bucket failing every policy belongs to no admitting target.
+                    const policies = [
+                        ...inheritedFacetPolicies(field, engine().schema).values(),
+                    ];
+                    const targets = referencedTargetsOf(identityFieldOf(field, engine().schema) ?? field, engine().schema);
+                    if (policies.length === 0 || policies.length < targets.length) {
                         continue;
                     }
                     const result = await engine().search(searchType, {
@@ -221,9 +257,9 @@ export function describeSearchEngineContract(name, engine) {
                         limit: 20,
                         facets: [field.name],
                     });
-                    const buckets = result.facets[field.name] ?? [];
+                    const buckets = result.facets[field.name]?.buckets ?? [];
                     for (const bucket of buckets) {
-                        expect(policy.only(bucket.value)).toBe(true);
+                        expect(policies.some((policy) => policy.only(bucket.value))).toBe(true);
                         expect(bucket.label).toBeDefined();
                     }
                     if (field.output !== true || field.filterable !== true) {
@@ -231,7 +267,7 @@ export function describeSearchEngineContract(name, engine) {
                     }
                     const excluded = result.hits
                         .flatMap((hit) => referenceIds(hit.document[field.name]))
-                        .find((id) => !policy.only(id));
+                        .find((id) => !policies.some((policy) => policy.only(id)));
                     if (excluded === undefined) {
                         continue;
                     }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@lde/search",
-  "version": "0.28.1",
+  "version": "0.30.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",
@@ -52,7 +52,7 @@
   "devDependencies": {
     "@tpluscode/rdf-ns-builders": "^5.0.0",
     "@types/jsonld": "^1.5.15",
-    "n3": "^2.7.12"
+    "n3": "^2.13.12"
   },
   "peerDependencies": {
     "vitest": ">=4.0.0"