@es-joy/jsoe 0.28.1 → 0.29.0

package/dist/search/index.d.ts

@@ -0,0 +1,60 @@
+/**
+ * @typedef {{
+ *   container: HTMLDivElement,
+ *   $getQuery: () => import('./queryTree.js').QueryAnd,
+ *   whenReady: Promise<void>
+ * }} SearchChoicesControl
+ */
+/**
+ * The top-level entry point (search plan §5): builds the whole recursive
+ * search widget tree for `schemaContent` via `buildSearchWidget`
+ * (`searchDispatch.js`), starting at `path = '#/'`. Does not route through
+ * `getTypesForSchema` for the general case - that function flattens union
+ * members into one flat `Set` of leaf types for a type-choice pull-down,
+ * whereas search needs union branches to stay distinguishable nested
+ * sub-widgets for the "has type" affordance (`unionSearchType.js` et al.) -
+ * `getTypesForSchema` is only reused narrowly, for intersection resolution,
+ * inside `buildSearchWidget`/`resolveIntersection` - which run at *every*
+ * recursive call site (every composite module's own child recursion uses
+ * `buildSearchWidget` too), not just here at the root, so an intersection
+ * schema nested anywhere in the tree resolves the same way a top-level one
+ * does rather than falling through to the `noneditableSearchType` escape
+ * hatch.
+ *
+ * `resolveIntersection` is called here too (redundantly, but cheaply, since
+ * it's a no-op for anything that isn't itself an `intersection`) purely so
+ * `$getQuery()` below dispatches through the *same* resolved schema
+ * `buildSearchWidget` actually built the UI for, rather than the original
+ * (possibly-`intersection`) one.
+ *
+ * Mirrors `buildTypeChoices`'s (`src/typeChoices.js`) `whenReady`/
+ * pull-based convention rather than inventing a push/callback API:
+ * `$getQuery()` reads the live DOM into a `QueryAnd` on demand (`{$and:
+ * []}` when nothing has been entered anywhere, matching the empty-`$and`
+ * convention of "no constraint"), and a host that wants live updates wraps
+ * it in its own `container.addEventListener('input', ...)` since
+ * `container` is a plain `HTMLDivElement`. Every widget built so far is
+ * synchronous, so `whenReady` (unlike `buildTypeChoices`'s) has no deferred
+ * work to wait on and settles immediately - it's still returned, so a
+ * caller can `await` either function uniformly without checking which one
+ * it has.
+ * @param {{
+ *   schemaContent: import('../formats/schema.js').ZodexSchema,
+ *   typeNamespace?: string,
+ *   topRoot?: import('../types.js').RootElement,
+ *   types?: import('../types.js').default
+ * }} cfg
+ * @returns {SearchChoicesControl}
+ */
+export function buildSearchChoices({ schemaContent, typeNamespace, topRoot, types }: {
+    schemaContent: import("../formats/schema.js").ZodexSchema;
+    typeNamespace?: string;
+    topRoot?: import("../types.js").RootElement;
+    types?: import("../types.js").default;
+}): SearchChoicesControl;
+export type SearchChoicesControl = {
+    container: HTMLDivElement;
+    $getQuery: () => import("./queryTree.js").QueryAnd;
+    whenReady: Promise<void>;
+};
+//# sourceMappingURL=index.d.ts.map

package/dist/search/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/search/index.js"],"names":[],"mappings":"AAGA;;;;;;GAMG;AAEH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AACH,qFARW;IACN,aAAa,EAAE,OAAO,sBAAsB,EAAE,WAAW,CAAC;IAC1D,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,OAAO,CAAC,EAAE,OAAO,aAAa,EAAE,WAAW,CAAC;IAC5C,KAAK,CAAC,EAAE,OAAO,aAAa,EAAE,OAAO,CAAA;CACtC,GACS,oBAAoB,CA4BhC;mCA1EY;IACR,SAAS,EAAE,cAAc,CAAC;IAC1B,SAAS,EAAE,MAAM,OAAO,gBAAgB,EAAE,QAAQ,CAAC;IACnD,SAAS,EAAE,OAAO,CAAC,IAAI,CAAC,CAAA;CACzB"}

package/dist/search/queryTree.d.ts

@@ -0,0 +1,180 @@
+export type QueryAnd = {
+    $and: QueryNode[];
+};
+export type QueryOr = {
+    $or: QueryNode[];
+};
+/**
+ * `object` (via `$exists: true/false`).
+ */
+export type QueryHasPropertyLeaf = {
+    kind: "hasProperty";
+    path: string;
+    $exists: boolean;
+};
+/**
+ * `array`/`set`/tuple-with-rest/`filelist` (via `$size`, or a range of
+ * operators when the schema doesn't pin an exact length), +`sparseCheck`
+ * for array sparse/not-sparse.
+ */
+export type QueryLengthSizeLeaf = {
+    kind: "lengthSize";
+    path: string;
+    $size?: number;
+    $gt?: number;
+    $gte?: number;
+    $lt?: number;
+    $lte?: number;
+    sparseCheck?: boolean;
+};
+/**
+ * `number`/`NumberObject`/`bigint`/`date`/`buffersource`, with `valueType`
+ * distinguishing them. Bounds are Mongo-style `$gt`/`$gte`/`$lt`/`$lte`
+ * rather than a `min`/`max` pair plus an inclusive boolean - inclusivity is
+ * simply which operator is present. The README's "Is Not Range" variant
+ * wraps the same leaf in `$not` rather than being a separate kind.
+ */
+export type QueryRangeLeaf = {
+    kind: "range";
+    path: string;
+    valueType: "number" | "NumberObject" | "bigint" | "date" | "buffersource";
+    $gt?: number | bigint | string;
+    $gte?: number | bigint | string;
+    $lt?: number | bigint | string;
+    $lte?: number | bigint | string;
+};
+export type QueryNotLeaf = {
+    kind: "not";
+    query: QueryNode;
+};
+/**
+ * `number`/`NumberObject`: is/is-not an integer.
+ */
+export type QueryIntegerCheckLeaf = {
+    kind: "integerCheck";
+    path: string;
+    isInteger: boolean;
+};
+/**
+ * `string`/`StringObject`/`Blob`/`File`/regexp-source/symbol-description
+ * (via `$in`/`$nin`).
+ */
+export type QueryLiteralSetLeaf = {
+    kind: "literalSet";
+    path: string;
+    $in?: unknown[];
+    $nin?: unknown[];
+};
+/**
+ * `string`/`StringObject`/`Blob`/`File`/regexp-source/symbol-description
+ * (via `$regex`/`$options`, matching Mongo's own field names).
+ */
+export type QueryRegexLeaf = {
+    kind: "regex";
+    path: string;
+    $regex: string;
+    $options?: string;
+};
+/**
+ * `string`/`StringObject`/`Blob`/`File`/regexp-source/symbol-description:
+ * a substring the value must not contain.
+ */
+export type QueryNotContainsLeaf = {
+    kind: "notContains";
+    path: string;
+    value: string;
+};
+/**
+ * `enum`, SpecialNumber's `Infinity`/`-Infinity`/`NaN`/`-0` (via
+ * `$in`/`$nin`).
+ */
+export type QueryMultiSelectLeaf = {
+    kind: "multiSelect";
+    path: string;
+    $in?: unknown[];
+    $nin?: unknown[];
+};
+/**
+ * Native enum key-vs-value; no Mongo equivalent, stays custom.
+ */
+export type QueryKeyValueEnumLeaf = {
+    kind: "keyValueEnum";
+    path: string;
+    matchKeys: boolean;
+    values: unknown[];
+};
+/**
+ * Union/xor/discriminatedUnion "has type", carrying `discriminatorValue`
+ * when applicable, including when nested under a Map/Record key or value;
+ * no Mongo equivalent, stays custom.
+ */
+export type QueryTypeOfLeaf = {
+    kind: "typeOf";
+    path: string;
+    searchType: string;
+    discriminatorValue?: unknown;
+};
+/**
+ * XPath/CSS-selector/full-text/raw-HTML-regex; no Mongo equivalent.
+ */
+export type QueryBlobHTMLLeaf = {
+    kind: "blobHTML";
+    path: string;
+    mode: "xpath" | "cssSelector" | "fullText" | "rawHTMLRegex";
+    value: string;
+};
+/**
+ * Per-dimension ranges for DOMRect/Point/Matrix, each dimension itself a
+ * `range` leaf, + `readonlyCheck`/`dimensionCheck` (is/is-not readonly,
+ * is/is-not 3d); no Mongo equivalent.
+ */
+export type QueryDomShapeLeaf = {
+    kind: "domShape";
+    path: string;
+    dimensions: {
+        [dimension: string]: QueryRangeLeaf;
+    };
+    readonlyCheck?: boolean;
+    dimensionCheck?: 2 | 3;
+};
+/**
+ * Paired key+value leaves with a joint-match flag; no Mongo equivalent.
+ */
+export type QueryMapRecordJointLeaf = {
+    kind: "mapRecordJoint";
+    path: string;
+    keyQuery?: QueryNode;
+    valueQuery?: QueryNode;
+    joint: boolean;
+};
+/**
+ * Promise/literal/catch/function: forwards to a nested `QueryNode` for the
+ * child schema so the tree stays uniform even where a type adds no
+ * constraint of its own; purely structural, no Mongo equivalent.
+ */
+export type QueryPassThroughLeaf = {
+    kind: "passThrough";
+    path: string;
+    query?: QueryNode;
+};
+/**
+ * Undefined/void/null (via `$exists`).
+ */
+export type QueryPresenceLeaf = {
+    kind: "presence";
+    path: string;
+    $exists: boolean;
+};
+/**
+ * Boolean/BooleanObject - Mongo would normally express this as a bare
+ * `{field: true}` shorthand, which doesn't fit our path-carrying leaf
+ * shape, so this stays a custom kind.
+ */
+export type QueryBooleanEqualsLeaf = {
+    kind: "booleanEquals";
+    path: string;
+    value: boolean;
+};
+export type QueryLeaf = QueryHasPropertyLeaf | QueryLengthSizeLeaf | QueryRangeLeaf | QueryNotLeaf | QueryIntegerCheckLeaf | QueryLiteralSetLeaf | QueryRegexLeaf | QueryNotContainsLeaf | QueryMultiSelectLeaf | QueryKeyValueEnumLeaf | QueryTypeOfLeaf | QueryBlobHTMLLeaf | QueryDomShapeLeaf | QueryMapRecordJointLeaf | QueryPassThroughLeaf | QueryPresenceLeaf | QueryBooleanEqualsLeaf;
+export type QueryNode = QueryAnd | QueryOr | QueryLeaf;
+//# sourceMappingURL=queryTree.d.ts.map

package/dist/search/queryTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"queryTree.d.ts","sourceRoot":"","sources":["../../src/search/queryTree.js"],"names":[],"mappings":"uBA2Ca;IAAC,IAAI,EAAE,SAAS,EAAE,CAAA;CAAC;sBAInB;IAAC,GAAG,EAAE,SAAS,EAAE,CAAA;CAAC;;;;mCAKlB;IAAC,IAAI,EAAE,aAAa,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAC;;;;;;kCAOrD;IACR,IAAI,EAAE,YAAY,CAAC;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACzD,WAAW,CAAC,EAAE,OAAO,CAAA;CACtB;;;;;;;;6BASS;IACR,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,QAAQ,GAAC,cAAc,GAAC,QAAQ,GAAC,MAAM,GAAC,cAAc,CAAC;IAClE,GAAG,CAAC,EAAE,MAAM,GAAC,MAAM,GAAC,MAAM,CAAC;IAC3B,IAAI,CAAC,EAAE,MAAM,GAAC,MAAM,GAAC,MAAM,CAAC;IAC5B,GAAG,CAAC,EAAE,MAAM,GAAC,MAAM,GAAC,MAAM,CAAC;IAC3B,IAAI,CAAC,EAAE,MAAM,GAAC,MAAM,GAAC,MAAM,CAAA;CAC5B;2BAIS;IAAC,IAAI,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,SAAS,CAAA;CAAC;;;;oCAK/B;IAAC,IAAI,EAAE,cAAc,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,OAAO,CAAA;CAAC;;;;;kCAMxD;IACR,IAAI,EAAE,YAAY,CAAC;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,CAAC,EAAE,OAAO,EAAE,CAAC;IAChB,IAAI,CAAC,EAAE,OAAO,EAAE,CAAA;CACjB;;;;;6BAMS;IACR,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAA;CAClB;;;;;mCAMS;IACR,IAAI,EAAE,aAAa,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAA;CACd;;;;;mCAMS;IACR,IAAI,EAAE,aAAa,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,CAAC,EAAE,OAAO,EAAE,CAAC;IAChB,IAAI,CAAC,EAAE,OAAO,EAAE,CAAA;CACjB;;;;oCAKS;IACR,IAAI,EAAE,cAAc,CAAC;IACrB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,OAAO,CAAC;IACnB,MAAM,EAAE,OAAO,EAAE,CAAA;CAClB;;;;;;8BAOS;IACR,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,kBAAkB,CAAC,EAAE,OAAO,CAAA;CAC7B;;;;gCAKS;IACR,IAAI,EAAE,UAAU,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,OAAO,GAAC,aAAa,GAAC,UAAU,GAAC,cAAc,CAAC;IACtD,KAAK,EAAE,MAAM,CAAA;CACd;;;;;;gCAOS;IACR,IAAI,EAAE,UAAU,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE;QAAC,CAAC,SAAS,EAAE,MAAM,GAAG,cAAc,CAAA;KAAC,CAAC;IAClD,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,cAAc,CAAC,EAAE,CAAC,GAAC,CAAC,CAAA;CACrB;;;;sCAKS;IACR,IAAI,EAAE,gBAAgB,CAAC;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,CAAC,EAAE,SAAS,CAAC;IACrB,UAAU,CAAC,EAAE,SAAS,CAAC;IACvB,KAAK,EAAE,OAAO,CAAA;CACf;;;;;;mCAOS;IACR,IAAI,EAAE,aAAa,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,CAAC,EAAE,SAAS,CAAA;CAClB;;;;gCAKS;IAAC,IAAI,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAC;;;;;;qCAOlD;IACR,IAAI,EAAE,eAAe,CAAC;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,OAAO,CAAA;CACf;wBAIS,oBAAoB,GAAC,mBAAmB,GAAC,cAAc,GAC/D,YAAY,GAAC,qBAAqB,GAAC,mBAAmB,GAAC,cAAc,GACrE,oBAAoB,GAAC,oBAAoB,GAAC,qBAAqB,GAC/D,eAAe,GAAC,iBAAiB,GAAC,iBAAiB,GACnD,uBAAuB,GAAC,oBAAoB,GAAC,iBAAiB,GAC9D,sBAAsB;wBAKd,QAAQ,GAAC,OAAO,GAAC,SAAS"}

package/dist/search/queryTreeBuilders.d.ts

@@ -0,0 +1,168 @@
+/**
+ * The only runtime pieces for building `queryTree.js` nodes - every search
+ * module builds nodes through these factories rather than hand-rolling leaf
+ * objects, so tests can import the same constructors to build expected-value
+ * fixtures.
+ */
+/**
+ * @param {import('./queryTree.js').QueryNode[]} nodes
+ * @returns {import('./queryTree.js').QueryAnd}
+ */
+export function makeAndNode(nodes: import("./queryTree.js").QueryNode[]): import("./queryTree.js").QueryAnd;
+/**
+ * Combines the leaves a single widget contributes (e.g. a number leaf's
+ * range plus its separate "Is/Is Not Integer" check) into one `QueryNode`:
+ * drops any `undefined` (no constraint entered there), returns `undefined`
+ * if nothing is left, the bare node if only one is left, else an `$and` of
+ * the rest - so a widget with several independent controls still honors
+ * `getQuery`'s "`undefined` means no constraint" convention without every
+ * such widget re-implementing this collapsing logic itself.
+ * @param {(import('./queryTree.js').QueryNode|undefined)[]} nodes
+ * @returns {import('./queryTree.js').QueryNode|undefined}
+ */
+export function combineAnd(nodes: (import("./queryTree.js").QueryNode | undefined)[]): import("./queryTree.js").QueryNode | undefined;
+/**
+ * @param {import('./queryTree.js').QueryNode[]} nodes
+ * @returns {import('./queryTree.js').QueryOr}
+ */
+export function makeOrNode(nodes: import("./queryTree.js").QueryNode[]): import("./queryTree.js").QueryOr;
+/**
+ * @param {string} path
+ * @param {boolean} $exists
+ * @returns {import('./queryTree.js').QueryHasPropertyLeaf}
+ */
+export function makeHasPropertyLeaf(path: string, $exists: boolean): import("./queryTree.js").QueryHasPropertyLeaf;
+/**
+ * @param {string} path
+ * @param {{
+ *   $size?: number,
+ *   $gt?: number, $gte?: number, $lt?: number, $lte?: number,
+ *   sparseCheck?: boolean
+ * }} cfg
+ * @returns {import('./queryTree.js').QueryLengthSizeLeaf}
+ */
+export function makeLengthSizeLeaf(path: string, cfg?: {
+    $size?: number;
+    $gt?: number;
+    $gte?: number;
+    $lt?: number;
+    $lte?: number;
+    sparseCheck?: boolean;
+}): import("./queryTree.js").QueryLengthSizeLeaf;
+/**
+ * @param {string} path
+ * @param {import('./queryTree.js').QueryRangeLeaf['valueType']} valueType
+ * @param {{
+ *   $gt?: number|bigint|string, $gte?: number|bigint|string,
+ *   $lt?: number|bigint|string, $lte?: number|bigint|string
+ * }} cfg
+ * @returns {import('./queryTree.js').QueryRangeLeaf}
+ */
+export function makeRangeLeaf(path: string, valueType: import("./queryTree.js").QueryRangeLeaf["valueType"], cfg?: {
+    $gt?: number | bigint | string;
+    $gte?: number | bigint | string;
+    $lt?: number | bigint | string;
+    $lte?: number | bigint | string;
+}): import("./queryTree.js").QueryRangeLeaf;
+/**
+ * @param {import('./queryTree.js').QueryNode} query
+ * @returns {import('./queryTree.js').QueryNotLeaf}
+ */
+export function makeNotLeaf(query: import("./queryTree.js").QueryNode): import("./queryTree.js").QueryNotLeaf;
+/**
+ * @param {string} path
+ * @param {boolean} isInteger
+ * @returns {import('./queryTree.js').QueryIntegerCheckLeaf}
+ */
+export function makeIntegerCheckLeaf(path: string, isInteger: boolean): import("./queryTree.js").QueryIntegerCheckLeaf;
+/**
+ * @param {string} path
+ * @param {{$in?: unknown[], $nin?: unknown[]}} cfg
+ * @returns {import('./queryTree.js').QueryLiteralSetLeaf}
+ */
+export function makeLiteralSetLeaf(path: string, cfg?: {
+    $in?: unknown[];
+    $nin?: unknown[];
+}): import("./queryTree.js").QueryLiteralSetLeaf;
+/**
+ * @param {string} path
+ * @param {string} $regex
+ * @param {string} [$options]
+ * @returns {import('./queryTree.js').QueryRegexLeaf}
+ */
+export function makeRegexLeaf(path: string, $regex: string, $options?: string): import("./queryTree.js").QueryRegexLeaf;
+/**
+ * @param {string} path
+ * @param {string} value
+ * @returns {import('./queryTree.js').QueryNotContainsLeaf}
+ */
+export function makeNotContainsLeaf(path: string, value: string): import("./queryTree.js").QueryNotContainsLeaf;
+/**
+ * @param {string} path
+ * @param {{$in?: unknown[], $nin?: unknown[]}} cfg
+ * @returns {import('./queryTree.js').QueryMultiSelectLeaf}
+ */
+export function makeMultiSelectLeaf(path: string, cfg?: {
+    $in?: unknown[];
+    $nin?: unknown[];
+}): import("./queryTree.js").QueryMultiSelectLeaf;
+/**
+ * @param {string} path
+ * @param {boolean} matchKeys
+ * @param {unknown[]} values
+ * @returns {import('./queryTree.js').QueryKeyValueEnumLeaf}
+ */
+export function makeKeyValueEnumLeaf(path: string, matchKeys: boolean, values: unknown[]): import("./queryTree.js").QueryKeyValueEnumLeaf;
+/**
+ * @param {string} path
+ * @param {string} searchType
+ * @param {unknown} [discriminatorValue]
+ * @returns {import('./queryTree.js').QueryTypeOfLeaf}
+ */
+export function makeTypeOfLeaf(path: string, searchType: string, discriminatorValue?: unknown): import("./queryTree.js").QueryTypeOfLeaf;
+/**
+ * @param {string} path
+ * @param {import('./queryTree.js').QueryBlobHTMLLeaf['mode']} mode
+ * @param {string} value
+ * @returns {import('./queryTree.js').QueryBlobHTMLLeaf}
+ */
+export function makeBlobHTMLLeaf(path: string, mode: import("./queryTree.js").QueryBlobHTMLLeaf["mode"], value: string): import("./queryTree.js").QueryBlobHTMLLeaf;
+/**
+ * @param {string} path
+ * @param {{[dimension: string]: import('./queryTree.js').QueryRangeLeaf}} dimensions
+ * @param {{readonlyCheck?: boolean, dimensionCheck?: 2|3}} [cfg]
+ * @returns {import('./queryTree.js').QueryDomShapeLeaf}
+ */
+export function makeDomShapeLeaf(path: string, dimensions: {
+    [dimension: string]: import("./queryTree.js").QueryRangeLeaf;
+}, cfg?: {
+    readonlyCheck?: boolean;
+    dimensionCheck?: 2 | 3;
+}): import("./queryTree.js").QueryDomShapeLeaf;
+/**
+ * @param {string} path
+ * @param {boolean} joint
+ * @param {import('./queryTree.js').QueryNode} [keyQuery]
+ * @param {import('./queryTree.js').QueryNode} [valueQuery]
+ * @returns {import('./queryTree.js').QueryMapRecordJointLeaf}
+ */
+export function makeMapRecordJointLeaf(path: string, joint: boolean, keyQuery?: import("./queryTree.js").QueryNode, valueQuery?: import("./queryTree.js").QueryNode): import("./queryTree.js").QueryMapRecordJointLeaf;
+/**
+ * @param {string} path
+ * @param {import('./queryTree.js').QueryNode} [query]
+ * @returns {import('./queryTree.js').QueryPassThroughLeaf}
+ */
+export function makePassThroughLeaf(path: string, query?: import("./queryTree.js").QueryNode): import("./queryTree.js").QueryPassThroughLeaf;
+/**
+ * @param {string} path
+ * @param {boolean} $exists
+ * @returns {import('./queryTree.js').QueryPresenceLeaf}
+ */
+export function makePresenceLeaf(path: string, $exists: boolean): import("./queryTree.js").QueryPresenceLeaf;
+/**
+ * @param {string} path
+ * @param {boolean} value
+ * @returns {import('./queryTree.js').QueryBooleanEqualsLeaf}
+ */
+export function makeBooleanEqualsLeaf(path: string, value: boolean): import("./queryTree.js").QueryBooleanEqualsLeaf;
+//# sourceMappingURL=queryTreeBuilders.d.ts.map

package/dist/search/queryTreeBuilders.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"queryTreeBuilders.d.ts","sourceRoot":"","sources":["../../src/search/queryTreeBuilders.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;GAGG;AACH,mCAHW,OAAO,gBAAgB,EAAE,SAAS,EAAE,GAClC,OAAO,gBAAgB,EAAE,QAAQ,CAI7C;AAED;;;;;;;;;;GAUG;AACH,kCAHW,CAAC,OAAO,gBAAgB,EAAE,SAAS,GAAC,SAAS,CAAC,EAAE,GAC9C,OAAO,gBAAgB,EAAE,SAAS,GAAC,SAAS,CAaxD;AAED;;;GAGG;AACH,kCAHW,OAAO,gBAAgB,EAAE,SAAS,EAAE,GAClC,OAAO,gBAAgB,EAAE,OAAO,CAI5C;AAED;;;;GAIG;AACH,0CAJW,MAAM,WACN,OAAO,GACL,OAAO,gBAAgB,EAAE,oBAAoB,CAIzD;AAED;;;;;;;;GAQG;AACH,yCARW,MAAM,QACN;IACN,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACzD,WAAW,CAAC,EAAE,OAAO,CAAA;CACtB,GACS,OAAO,gBAAgB,EAAE,mBAAmB,CAIxD;AAED;;;;;;;;GAQG;AACH,oCARW,MAAM,aACN,OAAO,gBAAgB,EAAE,cAAc,CAAC,WAAW,CAAC,QACpD;IACN,GAAG,CAAC,EAAE,MAAM,GAAC,MAAM,GAAC,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,GAAC,MAAM,GAAC,MAAM,CAAC;IACxD,GAAG,CAAC,EAAE,MAAM,GAAC,MAAM,GAAC,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,GAAC,MAAM,GAAC,MAAM,CAAA;CACxD,GACS,OAAO,gBAAgB,EAAE,cAAc,CAInD;AAED;;;GAGG;AACH,mCAHW,OAAO,gBAAgB,EAAE,SAAS,GAChC,OAAO,gBAAgB,EAAE,YAAY,CAIjD;AAED;;;;GAIG;AACH,2CAJW,MAAM,aACN,OAAO,GACL,OAAO,gBAAgB,EAAE,qBAAqB,CAI1D;AAED;;;;GAIG;AACH,yCAJW,MAAM,QACN;IAAC,GAAG,CAAC,EAAE,OAAO,EAAE,CAAC;IAAC,IAAI,CAAC,EAAE,OAAO,EAAE,CAAA;CAAC,GACjC,OAAO,gBAAgB,EAAE,mBAAmB,CAIxD;AAED;;;;;GAKG;AACH,oCALW,MAAM,UACN,MAAM,aACN,MAAM,GACJ,OAAO,gBAAgB,EAAE,cAAc,CAInD;AAED;;;;GAIG;AACH,0CAJW,MAAM,SACN,MAAM,GACJ,OAAO,gBAAgB,EAAE,oBAAoB,CAIzD;AAED;;;;GAIG;AACH,0CAJW,MAAM,QACN;IAAC,GAAG,CAAC,EAAE,OAAO,EAAE,CAAC;IAAC,IAAI,CAAC,EAAE,OAAO,EAAE,CAAA;CAAC,GACjC,OAAO,gBAAgB,EAAE,oBAAoB,CAIzD;AAED;;;;;GAKG;AACH,2CALW,MAAM,aACN,OAAO,UACP,OAAO,EAAE,GACP,OAAO,gBAAgB,EAAE,qBAAqB,CAI1D;AAED;;;;;GAKG;AACH,qCALW,MAAM,cACN,MAAM,uBACN,OAAO,GACL,OAAO,gBAAgB,EAAE,eAAe,CASpD;AAED;;;;;GAKG;AACH,uCALW,MAAM,QACN,OAAO,gBAAgB,EAAE,iBAAiB,CAAC,MAAM,CAAC,SAClD,MAAM,GACJ,OAAO,gBAAgB,EAAE,iBAAiB,CAItD;AAED;;;;;GAKG;AACH,uCALW,MAAM,cACN;IAAC,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,gBAAgB,EAAE,cAAc,CAAA;CAAC,QAC9D;IAAC,aAAa,CAAC,EAAE,OAAO,CAAC;IAAC,cAAc,CAAC,EAAE,CAAC,GAAC,CAAC,CAAA;CAAC,GAC7C,OAAO,gBAAgB,EAAE,iBAAiB,CAItD;AAED;;;;;;GAMG;AACH,6CANW,MAAM,SACN,OAAO,aACP,OAAO,gBAAgB,EAAE,SAAS,eAClC,OAAO,gBAAgB,EAAE,SAAS,GAChC,OAAO,gBAAgB,EAAE,uBAAuB,CAU5D;AAED;;;;GAIG;AACH,0CAJW,MAAM,UACN,OAAO,gBAAgB,EAAE,SAAS,GAChC,OAAO,gBAAgB,EAAE,oBAAoB,CAIzD;AAED;;;;GAIG;AACH,uCAJW,MAAM,WACN,OAAO,GACL,OAAO,gBAAgB,EAAE,iBAAiB,CAItD;AAED;;;;GAIG;AACH,4CAJW,MAAM,SACN,OAAO,GACL,OAAO,gBAAgB,EAAE,sBAAsB,CAI3D"}

package/dist/search/searchDispatch.d.ts

@@ -0,0 +1,121 @@
+/**
+ * Schema-only analogue of `getSchemaType` (`src/formats/schema.js:145-166`).
+ * Must not reimplement that function's special-casing (stringbool pipe,
+ * `codec`/filelist, `instanceof`, `literal`, `enum`, `templateLiteral`,
+ * `getCheckedType` fallback) - it calls straight through to it, and only
+ * adds the extra shape distinctions `getSchemaType`'s own
+ * `AvailableArbitraryType` output collapses (tuple, record/looseRecord,
+ * union/xor/discriminatedUnion all currently reduce to `'array'`/`'object'`/
+ * nothing, per `zodexToStructuredCloningTypeMap`,
+ * `src/formats/schema.js:30-56`).
+ *
+ * Intersection schemas are deliberately not a case here - they're resolved
+ * before dispatch, by the search-widget walker calling `getTypesForSchema`
+ * (search plan §3), reusing jsoe's existing intersection-merging machinery
+ * rather than this function reinventing it.
+ * @param {import('../formats/schema.js').ZodexSchema} schemaObject
+ * @returns {string}
+ */
+export function getSearchSchemaType(schemaObject: import("../formats/schema.js").ZodexSchema): string;
+/**
+ * The one exported call site every recursive search widget uses (analogous
+ * to `types.getTypeObject(type)`, `src/types.js:1106-1108`, but schema-in
+ * rather than type-string-in, since there's no value to key off). Falls
+ * back to `noneditableSearchType` for any schema shape `getSearchSchemaType`
+ * reports that isn't (yet) registered, rather than throwing - the same
+ * escape hatch a bare top-level `instanceof` schema falls through to.
+ * @param {import('../formats/schema.js').ZodexSchema} schemaObject
+ * @returns {SearchTypeObject}
+ */
+export function getSearchTypeObject(schemaObject: import("../formats/schema.js").ZodexSchema): SearchTypeObject;
+/**
+ * The call site every *recursive* search widget uses in place of calling
+ * `getSearchTypeObject(...).buildUI(...)` directly - it's the same thing,
+ * plus `resolveIntersection` run first, so an intersection schema at any
+ * depth (not just the one `buildSearchChoices` is called with) still
+ * resolves instead of falling through to the `noneditableSearchType`
+ * escape hatch. `originalJSON` (needed for the `getTypesForSchema` call's
+ * own `$ref` resolution) defaults to `schemaObject` itself only as a last
+ * resort for a call site that has none to pass down - every recursive
+ * caller should be threading the true document root through via its own
+ * `originalJSON` parameter instead.
+ * @param {{
+ *   schemaObject: import('../formats/schema.js').ZodexSchema,
+ *   path: string,
+ *   typeNamespace?: string,
+ *   topRoot?: import('../types.js').RootElement,
+ *   types?: import('../types.js').default,
+ *   originalJSON?: import('../formats/schema.js').ZodexSchema
+ * }} cfg
+ * @returns {import('../types.js').JamilihArray}
+ */
+export function buildSearchWidget({ schemaObject, path, typeNamespace, topRoot, types, originalJSON }: {
+    schemaObject: import("../formats/schema.js").ZodexSchema;
+    path: string;
+    typeNamespace?: string;
+    topRoot?: import("../types.js").RootElement;
+    types?: import("../types.js").default;
+    originalJSON?: import("../formats/schema.js").ZodexSchema;
+}): import("../types.js").JamilihArray;
+export type QueryNode = import("./queryTree.js").QueryNode;
+/**
+ * The search-side analogue of `TypeObject` (`src/types.js:308-408`): two
+ * methods, `buildUI` (a `jml` array) and `getQuery` (reads the built DOM
+ * back into a `QueryNode`, or `undefined` when no constraint was entered).
+ */
+export type SearchTypeObject = {
+    buildUI: (cfg: {
+        schemaObject: import("../formats/schema.js").ZodexSchema;
+        path: string;
+        typeNamespace?: string;
+        topRoot?: import("../types.js").RootElement;
+        types?: import("../types.js").default;
+        originalJSON?: import("../formats/schema.js").ZodexSchema;
+    }) => import("../types.js").JamilihArray;
+    getQuery: (cfg: {
+        root: HTMLElement;
+        path: string;
+    }) => QueryNode | undefined;
+};
+/**
+ * `Record<string, SearchTypeObject>` registry, analogous to
+ * `Types.prototype.availableTypes` (`src/types.js:473-581`). Every entry is
+ * a stub for now (build order step 1); later steps replace individual
+ * entries with their real `*SearchType.js` module, one at a time, without
+ * touching this shape.
+ *
+ * A few keys deliberately share one module reference rather than getting
+ * their own: `BooleanObject`/`NumberObject`/`StringObject`/`bigintObject`
+ * point at their primitive counterpart's module because a search leaf only
+ * cares about the query semantics (e.g. "true or false"), never about how
+ * the value-editing side constructs the boxed wrapper at runtime. Likewise
+ * `arrayNonindexKeys` mirrors `array`, `looseRecord` mirrors `record`, and
+ * `templateLiteral` mirrors `string` (README: a template literal is still
+ * fundamentally a string-shape constraint for this pass; see §3 of the
+ * search plan).
+ * @type {{[key: string]: SearchTypeObject}}
+ */
+export const availableSearchTypes: {
+    [key: string]: SearchTypeObject;
+};
+/**
+ * Escape hatch for `instanceof`-outside-`FileList` and any schema shape not
+ * (yet) recognized: no widget is rendered for it, only this stand-in.
+ * @type {SearchTypeObject}
+ */
+export const noneditableSearchType: SearchTypeObject;
+/**
+ * Intersection schemas are never registered in `availableSearchTypes` -
+ * resolved here instead of in `getSearchSchemaType`, reusing jsoe's
+ * existing intersection-merging machinery (`getTypesForSchema`,
+ * `src/formats/schema.js`) rather than reinventing it (search plan §3/§5).
+ * A single merged result replaces the intersection outright; more than one
+ * (e.g. one side of the intersection is itself a union) is handed to
+ * `unionSearchType.js` unchanged via a synthesized `union` wrapper, the
+ * same way `unionSearchType.js` already treats distinguishable branches.
+ * @param {import('../formats/schema.js').ZodexSchema} schemaObject
+ * @param {import('../formats/schema.js').ZodexSchema} originalJSON
+ * @returns {import('../formats/schema.js').ZodexSchema}
+ */
+export function resolveIntersection(schemaObject: import("../formats/schema.js").ZodexSchema, originalJSON: import("../formats/schema.js").ZodexSchema): import("../formats/schema.js").ZodexSchema;
+//# sourceMappingURL=searchDispatch.d.ts.map

package/dist/search/searchDispatch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"searchDispatch.d.ts","sourceRoot":"","sources":["../../src/search/searchDispatch.js"],"names":[],"mappings":"AAqKA;;;;;;;;;;;;;;;;;GAiBG;AACH,kDAHW,OAAO,sBAAsB,EAAE,WAAW,GACxC,MAAM,CA+BlB;AAED;;;;;;;;;GASG;AACH,kDAHW,OAAO,sBAAsB,EAAE,WAAW,GACxC,gBAAgB,CAK5B;AA2BD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,uGAVW;IACN,YAAY,EAAE,OAAO,sBAAsB,EAAE,WAAW,CAAC;IACzD,IAAI,EAAE,MAAM,CAAC;IACb,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,OAAO,CAAC,EAAE,OAAO,aAAa,EAAE,WAAW,CAAC;IAC5C,KAAK,CAAC,EAAE,OAAO,aAAa,EAAE,OAAO,CAAC;IACtC,YAAY,CAAC,EAAE,OAAO,sBAAsB,EAAE,WAAW,CAAA;CAC1D,GACS,OAAO,aAAa,EAAE,YAAY,CAe9C;wBAzPY,OAAO,gBAAgB,EAAE,SAAS;;;;;;+BAOlC;IACR,OAAO,EAAE,CAAC,GAAG,EAAE;QACb,YAAY,EAAE,OAAO,sBAAsB,EAAE,WAAW,CAAC;QACzD,IAAI,EAAE,MAAM,CAAC;QACb,aAAa,CAAC,EAAE,MAAM,CAAC;QACvB,OAAO,CAAC,EAAE,OAAO,aAAa,EAAE,WAAW,CAAC;QAC5C,KAAK,CAAC,EAAE,OAAO,aAAa,EAAE,OAAO,CAAC;QACtC,YAAY,CAAC,EAAE,OAAO,sBAAsB,EAAE,WAAW,CAAA;KAC1D,KAAK,OAAO,aAAa,EAAE,YAAY,CAAC;IACzC,QAAQ,EAAE,CAAC,GAAG,EAAE;QACd,IAAI,EAAE,WAAW,CAAC;QAClB,IAAI,EAAE,MAAM,CAAA;KACb,KAAK,SAAS,GAAC,SAAS,CAAA;CAC1B;AAyBJ;;;;;;;;;;;;;;;;;GAiBG;AACH,mCAFU;IAAC,CAAC,GAAG,EAAE,MAAM,GAAG,gBAAgB,CAAA;CAAC,CA+DzC;AAtFF;;;;GAIG;AACH,oCAFU,gBAAgB,CAEkC;AAmJ5D;;;;;;;;;;;;GAYG;AACH,kDAJW,OAAO,sBAAsB,EAAE,WAAW,gBAC1C,OAAO,sBAAsB,EAAE,WAAW,GACxC,OAAO,sBAAsB,EAAE,WAAW,CAYtD"}

package/dist/search/searchElementUtils.d.ts

@@ -0,0 +1,97 @@
+/**
+ * Locates a built search element by the JSON-Pointer path it was built for.
+ * Compares `dataset.searchPath` in JS rather than interpolating `path` into
+ * a `querySelector` attribute-value string, since a schema path can embed
+ * arbitrary property-name characters (only `~`/`/` are escaped by
+ * `makeJSONPointer`) that would otherwise need CSS-selector escaping.
+ * @param {ParentNode} root
+ * @param {string} path
+ * @returns {HTMLElement|undefined}
+ */
+export function findSearchElement(root: ParentNode, path: string): HTMLElement | undefined;
+/**
+ * @typedef {HTMLElement & {
+ *   getQuery: () => import('./queryTree.js').QueryNode|undefined
+ * }} SearchElement
+ */
+/**
+ * The `SearchTypeObject.getQuery` every leaf module implements identically:
+ * locate the element it built under `root` and delegate to its own
+ * (per-element, `dataset`-driven) `getQuery()` method.
+ * @param {{root: HTMLElement, path: string}} cfg
+ * @returns {import('./queryTree.js').QueryNode|undefined}
+ */
+export function getQueryViaElement({ root, path }: {
+    root: HTMLElement;
+    path: string;
+}): import("./queryTree.js").QueryNode | undefined;
+/**
+ * Type-predicate guard distinguishing a built search element (leaf or
+ * container, either answers to `.getQuery()`) from a plain DOM node - used
+ * by container elements (e.g. `objectSearchType.js`'s `<jsoe-search-object>`)
+ * that walk `this.children` polymorphically (search plan §8) without
+ * knowing which children are search elements and which are plain layout
+ * (a controls `<div>`, etc.).
+ * @param {Element} el
+ * @returns {el is SearchElement}
+ */
+export function hasGetQuery(el: Element): el is SearchElement;
+/**
+ * Factory for the README's "no variants to allow for distinct search"
+ * leaves (`undefined`/`void`, `null`, `NaN`): the only meaningful question
+ * is whether the path is present at all, which only matters once the path
+ * is optional or nested in a union - so all three share one tiny, single-
+ * checkbox implementation, differing only in tag name/label.
+ * @param {{tagName: string}} cfg
+ * @returns {import('./searchDispatch.js').SearchTypeObject}
+ */
+export function makePresenceOnlySearchType({ tagName }: {
+    tagName: string;
+}): import("./searchDispatch.js").SearchTypeObject;
+/**
+ * Factory for `errorSearchType.js`/`errorsSpecialSearchType.js`, offering
+ * literal/regex search of child string properties, numeric of number
+ * children (README) - one `buildLiteralRegexControls`/`buildRangeInputsPair` pair
+ * per known property (`key`-distinguished so they coexist in one widget;
+ * see those helpers' docs), combined via `$and`. `.cause` (a recursive,
+ * arbitrarily-typed property) and `errorsSpecial`'s `AggregateError.errors`
+ * array are deliberately left out of this pass - the README's bullet asks
+ * only for the flat string/number children, and open-ended recursion into
+ * an arbitrary `cause` chain is a materially bigger feature than "the same
+ * shape, twice more".
+ * @param {{tagName: string}} cfg
+ * @returns {import('./searchDispatch.js').SearchTypeObject}
+ */
+export function makeErrorFamilySearchType({ tagName }: {
+    tagName: string;
+}): import("./searchDispatch.js").SearchTypeObject;
+/**
+ * Factory for `domrectSearchType.js`/`dompointSearchType.js`/
+ * `dommatrixSearchType.js`: numeric search ranges for children; "Is/Is not
+ * Readonly"; DOMMatrix: "Is/Is not 3d" (README) - one `buildRangeInputsPair`
+ * per known dimension (`key`-distinguished so they coexist in one widget;
+ * `dimensionKeys` covers DOMMatrix's 2D (`a`-`f`) *and* 3D (`m11`-`m44`)
+ * shapes at once rather than switching the control set on an "Is/Is not 3d"
+ * answer that's itself just another optional search constraint, not a
+ * schema fact - `domrect`/`dompoint`/`dommatrix` are all "checked" types
+ * with no structural schema to derive dimension names from in the first
+ * place, same reasoning as `makeErrorFamilySearchType`), combined into one
+ * `domShape` leaf (`queryTree.js`) rather than separate leaves via `$and`.
+ * @param {{
+ *   tagName: string,
+ *   dimensionKeys: string[],
+ *   includeReadonly?: boolean,
+ *   includeDimensionCheck?: boolean
+ * }} cfg
+ * @returns {import('./searchDispatch.js').SearchTypeObject}
+ */
+export function makeDomShapeSearchType({ tagName, dimensionKeys, includeReadonly, includeDimensionCheck }: {
+    tagName: string;
+    dimensionKeys: string[];
+    includeReadonly?: boolean;
+    includeDimensionCheck?: boolean;
+}): import("./searchDispatch.js").SearchTypeObject;
+export type SearchElement = HTMLElement & {
+    getQuery: () => import("./queryTree.js").QueryNode | undefined;
+};
+//# sourceMappingURL=searchElementUtils.d.ts.map

package/dist/search/searchElementUtils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"searchElementUtils.d.ts","sourceRoot":"","sources":["../../src/search/searchElementUtils.js"],"names":[],"mappings":"AAQA;;;;;;;;;GASG;AACH,wCAJW,UAAU,QACV,MAAM,GACJ,WAAW,GAAC,SAAS,CAMjC;AAED;;;;GAIG;AAEH;;;;;;GAMG;AACH,mDAHW;IAAC,IAAI,EAAE,WAAW,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAC,GAC/B,OAAO,gBAAgB,EAAE,SAAS,GAAC,SAAS,CAOxD;AAED;;;;;;;;;GASG;AACH,gCAHW,OAAO,GACL,EAAE,IAAI,aAAa,CAK/B;AAED;;;;;;;;GAQG;AACH,wDAHW;IAAC,OAAO,EAAE,MAAM,CAAA;CAAC,GACf,OAAO,qBAAqB,EAAE,gBAAgB,CA0B1D;AAqCD;;;;;;;;;;;;;GAaG;AACH,uDAHW;IAAC,OAAO,EAAE,MAAM,CAAA;CAAC,GACf,OAAO,qBAAqB,EAAE,gBAAgB,CAkC1D;AAyCD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,2GARW;IACN,OAAO,EAAE,MAAM,CAAC;IAChB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,qBAAqB,CAAC,EAAE,OAAO,CAAA;CAChC,GACS,OAAO,qBAAqB,EAAE,gBAAgB,CAsD1D;4BAvQY,WAAW,GAAG;IACtB,QAAQ,EAAE,MAAM,OAAO,gBAAgB,EAAE,SAAS,GAAC,SAAS,CAAA;CAC7D"}