@faicad/faijs 0.13.0

package/dist/vendored/brepjs/query/finderCore.d.ts

@@ -0,0 +1,49 @@
+/**
+ * Generic, immutable shape finder -- core factory and shared types.
+ *
+ * Every typed finder (edge, face, wire, vertex) is built on top of
+ * `createTypedFinder`, which handles the duplicated builder methods
+ * (`when`, `inList`, `not`, `either`, `findAll`, `findUnique`, `shouldKeep`)
+ * in one place.
+ */
+import type { AnyShape, Dimension } from '../core/shapeTypes.js';
+import { type Result } from '../core/result.js';
+export type Predicate<T> = (element: T) => boolean;
+export type TopoKind = 'edge' | 'face' | 'wire' | 'vertex';
+export interface ShapeFinder<T extends AnyShape<Dimension>> {
+    /** Add a custom predicate filter. Returns new finder. */
+    readonly when: (predicate: Predicate<T>) => ShapeFinder<T>;
+    /** Filter to elements in a list. Returns new finder. */
+    readonly inList: (elements: T[]) => ShapeFinder<T>;
+    /** Invert a filter. Returns new finder. */
+    readonly not: (builderFn: (f: ShapeFinder<T>) => ShapeFinder<T>) => ShapeFinder<T>;
+    /** Combine filters with OR. Returns new finder. */
+    readonly either: (fns: ((f: ShapeFinder<T>) => ShapeFinder<T>)[]) => ShapeFinder<T>;
+    /** Find all matching elements from a shape. */
+    readonly findAll: (shape: AnyShape<Dimension>) => T[];
+    /** Find exactly one matching element. Returns error if 0 or more than 1 match. */
+    readonly findUnique: (shape: AnyShape<Dimension>) => Result<T>;
+    /** Check if an element passes all filters. */
+    readonly shouldKeep: (element: T) => boolean;
+    /** Intersect: element must match both this finder AND other. */
+    readonly and: (other: ShapeFinder<T>) => ShapeFinder<T>;
+    /** Union: element must match this finder OR other. */
+    readonly or: (other: ShapeFinder<T>) => ShapeFinder<T>;
+    /** Negate: invert all filters on this finder. */
+    readonly negate: () => ShapeFinder<T>;
+    readonly _filters: ReadonlyArray<Predicate<T>>;
+    readonly _topoKind: TopoKind;
+}
+/**
+ * Build a typed finder that extends `ShapeFinder<T>` with domain-specific
+ * filter methods. The `rebuild` callback re-creates the full typed finder
+ * whenever a new filter is added, eliminating the per-finder boilerplate
+ * for `when`, `inList`, `not`, `either`, etc.
+ *
+ * @param topoKind  - topology iteration target
+ * @param filters   - accumulated predicates (immutable list)
+ * @param rebuild   - reconstruct the typed finder from a new filter list
+ * @param extend    - attach domain-specific methods onto the base finder
+ */
+export declare function createTypedFinder<T extends AnyShape<Dimension>, F extends ShapeFinder<T>>(topoKind: TopoKind, filters: ReadonlyArray<Predicate<T>>, rebuild: (newFilters: ReadonlyArray<Predicate<T>>) => F, extend: (base: ShapeFinder<T>, withFilter: (pred: Predicate<T>) => F) => Omit<F, keyof ShapeFinder<T>>): F;
+//# sourceMappingURL=finderCore.d.ts.map

package/dist/vendored/brepjs/query/finderCore.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"finderCore.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/query/finderCore.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AACjE,OAAO,EAAE,KAAK,MAAM,EAAW,MAAM,mBAAmB,CAAC;AASzD,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,KAAK,OAAO,CAAC;AAMnD,MAAM,MAAM,QAAQ,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,QAAQ,CAAC;AAM3D,MAAM,WAAW,WAAW,CAAC,CAAC,SAAS,QAAQ,CAAC,SAAS,CAAC;IACxD,yDAAyD;IACzD,QAAQ,CAAC,IAAI,EAAE,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC;IAC3D,wDAAwD;IACxD,QAAQ,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC;IACnD,2CAA2C;IAC3C,QAAQ,CAAC,GAAG,EAAE,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC;IACnF,mDAAmD;IACnD,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC;IACpF,+CAA+C;IAC/C,QAAQ,CAAC,OAAO,EAAE,CAAC,KAAK,EAAE,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;IACtD,kFAAkF;IAClF,QAAQ,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,QAAQ,CAAC,SAAS,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC;IAC/D,8CAA8C;IAC9C,QAAQ,CAAC,UAAU,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,OAAO,CAAC;IAE7C,gEAAgE;IAChE,QAAQ,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC;IACxD,sDAAsD;IACtD,QAAQ,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC;IACvD,iDAAiD;IACjD,QAAQ,CAAC,MAAM,EAAE,MAAM,WAAW,CAAC,CAAC,CAAC,CAAC;IAGtC,QAAQ,CAAC,QAAQ,EAAE,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC;CAC9B;AAuCD;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,SAAS,WAAW,CAAC,CAAC,CAAC,EACvF,QAAQ,EAAE,QAAQ,EAClB,OAAO,EAAE,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EACpC,OAAO,EAAE,CAAC,UAAU,EAAE,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EACvD,MAAM,EAAE,CACN,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,EACpB,UAAU,EAAE,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,KAClC,IAAI,CAAC,CAAC,EAAE,MAAM,WAAW,CAAC,CAAC,CAAC,CAAC,GACjC,CAAC,CAiFH"}

package/dist/vendored/brepjs/query/finderCore.js

@@ -0,0 +1,120 @@
+/**
+ * Generic, immutable shape finder -- core factory and shared types.
+ *
+ * Every typed finder (edge, face, wire, vertex) is built on top of
+ * `createTypedFinder`, which handles the duplicated builder methods
+ * (`when`, `inList`, `not`, `either`, `findAll`, `findUnique`, `shouldKeep`)
+ * in one place.
+ */
+import { ok, err } from '../core/result.js';
+import { queryError } from '../core/errors.js';
+import { getHashCode, isSameShape } from '../topology/shapeFns.js';
+import { getEdges, getFaces, getWires, getVertices } from '../topology/topologyQueryFns.js';
+// ---------------------------------------------------------------------------
+// findUnique helper
+// ---------------------------------------------------------------------------
+/**
+ * Find exactly one element matching all predicates. Returns an error Result
+ * if zero or more than one element matches.
+ */
+function findUniqueIn(elements, shouldKeep) {
+    let match;
+    let count = 0;
+    for (let i = 0; i < elements.length; i++) {
+        const element = elements[i]; // noUncheckedIndexedAccess: i < length guarantees defined
+        if (shouldKeep(element)) {
+            count++;
+            if (count === 1)
+                match = element;
+            else
+                break; // More than 1 match — no need to continue
+        }
+    }
+    if (count !== 1) {
+        return err(queryError('FINDER_NOT_UNIQUE', `Finder expected a unique match but found ${count === 0 ? 0 : '2+'} element(s)`));
+    }
+    return ok(match);
+}
+// ---------------------------------------------------------------------------
+// Generic typed-finder factory
+// ---------------------------------------------------------------------------
+/**
+ * Build a typed finder that extends `ShapeFinder<T>` with domain-specific
+ * filter methods. The `rebuild` callback re-creates the full typed finder
+ * whenever a new filter is added, eliminating the per-finder boilerplate
+ * for `when`, `inList`, `not`, `either`, etc.
+ *
+ * @param topoKind  - topology iteration target
+ * @param filters   - accumulated predicates (immutable list)
+ * @param rebuild   - reconstruct the typed finder from a new filter list
+ * @param extend    - attach domain-specific methods onto the base finder
+ */
+export function createTypedFinder(topoKind, filters, rebuild, extend) {
+    const withFilter = (pred) => rebuild([...filters, pred]);
+    const shouldKeep = (element) => filters.every((f) => f(element));
+    // Use cached topology getters instead of raw iterTopo — avoids redundant
+    // WASM calls and benefits from the castShapeWithKnownType fast path.
+    function getCachedElements(shape) {
+        switch (topoKind) {
+            case 'edge':
+                return getEdges(shape);
+            case 'face':
+                return getFaces(shape);
+            case 'wire':
+                return getWires(shape);
+            case 'vertex':
+                return getVertices(shape);
+        }
+    }
+    const extractElements = (shape) => {
+        const all = getCachedElements(shape);
+        if (filters.length === 0)
+            return all.slice();
+        return all.filter(shouldKeep);
+    };
+    const emptyFinder = () => createTypedFinder(topoKind, [], rebuild, extend);
+    const base = {
+        _filters: filters,
+        _topoKind: topoKind,
+        when: (pred) => withFilter(pred),
+        inList: (elements) => {
+            const hashSet = new Map();
+            for (const e of elements) {
+                const h = getHashCode(e);
+                const bucket = hashSet.get(h);
+                if (bucket)
+                    bucket.push(e);
+                else
+                    hashSet.set(h, [e]);
+            }
+            return withFilter((el) => {
+                const bucket = hashSet.get(getHashCode(el));
+                return !!bucket && bucket.some((e) => isSameShape(e, el));
+            });
+        },
+        not: (builderFn) => {
+            const inner = builderFn(emptyFinder());
+            return withFilter((el) => !inner.shouldKeep(el));
+        },
+        either: (fns) => {
+            const builtFinders = fns.map((fn) => fn(emptyFinder()));
+            return withFilter((el) => builtFinders.some((f) => f.shouldKeep(el)));
+        },
+        findAll: (shape) => extractElements(shape),
+        findUnique: (shape) => findUniqueIn(getCachedElements(shape), shouldKeep),
+        shouldKeep,
+        and: (other) => withFilter((el) => other.shouldKeep(el)),
+        or: (other) => {
+            // Union: element passes if it matches this finder's filters OR the other's
+            const selfKeep = shouldKeep;
+            return rebuild([(el) => selfKeep(el) || other.shouldKeep(el)]);
+        },
+        negate: () => {
+            const selfKeep = shouldKeep;
+            return rebuild([(el) => !selfKeep(el)]);
+        },
+    };
+    const extensions = extend(base, withFilter);
+    return { ...base, ...extensions };
+}
+//# sourceMappingURL=finderCore.js.map

package/dist/vendored/brepjs/query/finderCore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"finderCore.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/query/finderCore.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,EAAe,EAAE,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACnE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,iCAAiC,CAAC;AA8C5F,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E;;;GAGG;AACH,SAAS,YAAY,CACnB,QAAa,EACb,UAA8B;IAE9B,IAAI,KAAoB,CAAC;IACzB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAM,CAAC,CAAC,0DAA0D;QAC5F,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YACxB,KAAK,EAAE,CAAC;YACR,IAAI,KAAK,KAAK,CAAC;gBAAE,KAAK,GAAG,OAAO,CAAC;;gBAC5B,MAAM,CAAC,0CAA0C;QACxD,CAAC;IACH,CAAC;IACD,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,OAAO,GAAG,CACR,UAAU,CACR,mBAAmB,EACnB,4CAA4C,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,aAAa,CAChF,CACF,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,CAAC,KAAU,CAAC,CAAC;AACxB,CAAC;AAED,8EAA8E;AAC9E,+BAA+B;AAC/B,8EAA8E;AAE9E;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,QAAkB,EAClB,OAAoC,EACpC,OAAuD,EACvD,MAGkC;IAElC,MAAM,UAAU,GAAG,CAAC,IAAkB,EAAK,EAAE,CAAC,OAAO,CAAC,CAAC,GAAG,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;IAE1E,MAAM,UAAU,GAAG,CAAC,OAAU,EAAW,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IAE7E,yEAAyE;IACzE,qEAAqE;IACrE,SAAS,iBAAiB,CAAC,KAA0B;QACnD,QAAQ,QAAQ,EAAE,CAAC;YACjB,KAAK,MAAM;gBACT,OAAO,QAAQ,CAAC,KAAK,CAAQ,CAAC;YAChC,KAAK,MAAM;gBACT,OAAO,QAAQ,CAAC,KAAK,CAAQ,CAAC;YAChC,KAAK,MAAM;gBACT,OAAO,QAAQ,CAAC,KAAK,CAAQ,CAAC;YAChC,KAAK,QAAQ;gBACX,OAAO,WAAW,CAAC,KAAK,CAAQ,CAAC;QACrC,CAAC;IACH,CAAC;IAED,MAAM,eAAe,GAAG,CAAC,KAA0B,EAAO,EAAE;QAC1D,MAAM,GAAG,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7C,OAAO,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAChC,CAAC,CAAC;IAEF,MAAM,WAAW,GAAG,GAAmB,EAAE,CAAC,iBAAiB,CAAO,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;IAEjG,MAAM,IAAI,GAAmB;QAC3B,QAAQ,EAAE,OAAO;QACjB,SAAS,EAAE,QAAQ;QAEnB,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC;QAEhC,MAAM,EAAE,CAAC,QAAQ,EAAE,EAAE;YACnB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAe,CAAC;YACvC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,MAAM;oBAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;oBACtB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,CAAC;YACD,OAAO,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE;gBACvB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC5C,OAAO,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAC5D,CAAC,CAAC,CAAC;QACL,CAAC;QAED,GAAG,EAAE,CAAC,SAAS,EAAE,EAAE;YACjB,MAAM,KAAK,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC,CAAC;YACvC,OAAO,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,CAAC;QAED,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE;YACd,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACxD,OAAO,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC;QAED,OAAO,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,eAAe,CAAC,KAAK,CAAC;QAE1C,UAAU,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,iBAAiB,CAAC,KAAK,CAAC,EAAE,UAAU,CAAC;QAEzE,UAAU;QAEV,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAExD,EAAE,EAAE,CAAC,KAAK,EAAE,EAAE;YACZ,2EAA2E;YAC3E,MAAM,QAAQ,GAAG,UAAU,CAAC;YAC5B,OAAO,OAAO,CAAC,CAAC,CAAC,EAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACpE,CAAC;QAED,MAAM,EAAE,GAAG,EAAE;YACX,MAAM,QAAQ,GAAG,UAAU,CAAC;YAC5B,OAAO,OAAO,CAAC,CAAC,CAAC,EAAK,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;KACF,CAAC;IAEF,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IAE5C,OAAO,EAAE,GAAG,IAAI,EAAE,GAAG,UAAU,EAAO,CAAC;AACzC,CAAC","sourcesContent":["/**\n * Generic, immutable shape finder -- core factory and shared types.\n *\n * Every typed finder (edge, face, wire, vertex) is built on top of\n * `createTypedFinder`, which handles the duplicated builder methods\n * (`when`, `inList`, `not`, `either`, `findAll`, `findUnique`, `shouldKeep`)\n * in one place.\n */\n\nimport type { AnyShape, Dimension } from '../core/shapeTypes.js';\nimport { type Result, ok, err } from '../core/result.js';\nimport { queryError } from '../core/errors.js';\nimport { getHashCode, isSameShape } from '../topology/shapeFns.js';\nimport { getEdges, getFaces, getWires, getVertices } from '../topology/topologyQueryFns.js';\n\n// ---------------------------------------------------------------------------\n// Predicate type\n// ---------------------------------------------------------------------------\n\nexport type Predicate<T> = (element: T) => boolean;\n\n// ---------------------------------------------------------------------------\n// Topology kind discriminant\n// ---------------------------------------------------------------------------\n\nexport type TopoKind = 'edge' | 'face' | 'wire' | 'vertex';\n\n// ---------------------------------------------------------------------------\n// Base ShapeFinder interface\n// ---------------------------------------------------------------------------\n\nexport interface ShapeFinder<T extends AnyShape<Dimension>> {\n  /** Add a custom predicate filter. Returns new finder. */\n  readonly when: (predicate: Predicate<T>) => ShapeFinder<T>;\n  /** Filter to elements in a list. Returns new finder. */\n  readonly inList: (elements: T[]) => ShapeFinder<T>;\n  /** Invert a filter. Returns new finder. */\n  readonly not: (builderFn: (f: ShapeFinder<T>) => ShapeFinder<T>) => ShapeFinder<T>;\n  /** Combine filters with OR. Returns new finder. */\n  readonly either: (fns: ((f: ShapeFinder<T>) => ShapeFinder<T>)[]) => ShapeFinder<T>;\n  /** Find all matching elements from a shape. */\n  readonly findAll: (shape: AnyShape<Dimension>) => T[];\n  /** Find exactly one matching element. Returns error if 0 or more than 1 match. */\n  readonly findUnique: (shape: AnyShape<Dimension>) => Result<T>;\n  /** Check if an element passes all filters. */\n  readonly shouldKeep: (element: T) => boolean;\n\n  /** Intersect: element must match both this finder AND other. */\n  readonly and: (other: ShapeFinder<T>) => ShapeFinder<T>;\n  /** Union: element must match this finder OR other. */\n  readonly or: (other: ShapeFinder<T>) => ShapeFinder<T>;\n  /** Negate: invert all filters on this finder. */\n  readonly negate: () => ShapeFinder<T>;\n\n  // -- Internal (for composition) --\n  readonly _filters: ReadonlyArray<Predicate<T>>;\n  readonly _topoKind: TopoKind;\n}\n\n// ---------------------------------------------------------------------------\n// findUnique helper\n// ---------------------------------------------------------------------------\n\n/**\n * Find exactly one element matching all predicates. Returns an error Result\n * if zero or more than one element matches.\n */\nfunction findUniqueIn<T extends AnyShape<Dimension>>(\n  elements: T[],\n  shouldKeep: (el: T) => boolean\n): Result<T> {\n  let match: T | undefined;\n  let count = 0;\n  for (let i = 0; i < elements.length; i++) {\n    const element = elements[i] as T; // noUncheckedIndexedAccess: i < length guarantees defined\n    if (shouldKeep(element)) {\n      count++;\n      if (count === 1) match = element;\n      else break; // More than 1 match — no need to continue\n    }\n  }\n  if (count !== 1) {\n    return err(\n      queryError(\n        'FINDER_NOT_UNIQUE',\n        `Finder expected a unique match but found ${count === 0 ? 0 : '2+'} element(s)`\n      )\n    );\n  }\n  return ok(match as T);\n}\n\n// ---------------------------------------------------------------------------\n// Generic typed-finder factory\n// ---------------------------------------------------------------------------\n\n/**\n * Build a typed finder that extends `ShapeFinder<T>` with domain-specific\n * filter methods. The `rebuild` callback re-creates the full typed finder\n * whenever a new filter is added, eliminating the per-finder boilerplate\n * for `when`, `inList`, `not`, `either`, etc.\n *\n * @param topoKind  - topology iteration target\n * @param filters   - accumulated predicates (immutable list)\n * @param rebuild   - reconstruct the typed finder from a new filter list\n * @param extend    - attach domain-specific methods onto the base finder\n */\nexport function createTypedFinder<T extends AnyShape<Dimension>, F extends ShapeFinder<T>>(\n  topoKind: TopoKind,\n  filters: ReadonlyArray<Predicate<T>>,\n  rebuild: (newFilters: ReadonlyArray<Predicate<T>>) => F,\n  extend: (\n    base: ShapeFinder<T>,\n    withFilter: (pred: Predicate<T>) => F\n  ) => Omit<F, keyof ShapeFinder<T>>\n): F {\n  const withFilter = (pred: Predicate<T>): F => rebuild([...filters, pred]);\n\n  const shouldKeep = (element: T): boolean => filters.every((f) => f(element));\n\n  // Use cached topology getters instead of raw iterTopo — avoids redundant\n  // WASM calls and benefits from the castShapeWithKnownType fast path.\n  function getCachedElements(shape: AnyShape<Dimension>): T[] {\n    switch (topoKind) {\n      case 'edge':\n        return getEdges(shape) as T[];\n      case 'face':\n        return getFaces(shape) as T[];\n      case 'wire':\n        return getWires(shape) as T[];\n      case 'vertex':\n        return getVertices(shape) as T[];\n    }\n  }\n\n  const extractElements = (shape: AnyShape<Dimension>): T[] => {\n    const all = getCachedElements(shape);\n    if (filters.length === 0) return all.slice();\n    return all.filter(shouldKeep);\n  };\n\n  const emptyFinder = (): ShapeFinder<T> => createTypedFinder<T, F>(topoKind, [], rebuild, extend);\n\n  const base: ShapeFinder<T> = {\n    _filters: filters,\n    _topoKind: topoKind,\n\n    when: (pred) => withFilter(pred),\n\n    inList: (elements) => {\n      const hashSet = new Map<number, T[]>();\n      for (const e of elements) {\n        const h = getHashCode(e);\n        const bucket = hashSet.get(h);\n        if (bucket) bucket.push(e);\n        else hashSet.set(h, [e]);\n      }\n      return withFilter((el) => {\n        const bucket = hashSet.get(getHashCode(el));\n        return !!bucket && bucket.some((e) => isSameShape(e, el));\n      });\n    },\n\n    not: (builderFn) => {\n      const inner = builderFn(emptyFinder());\n      return withFilter((el) => !inner.shouldKeep(el));\n    },\n\n    either: (fns) => {\n      const builtFinders = fns.map((fn) => fn(emptyFinder()));\n      return withFilter((el) => builtFinders.some((f) => f.shouldKeep(el)));\n    },\n\n    findAll: (shape) => extractElements(shape),\n\n    findUnique: (shape) => findUniqueIn(getCachedElements(shape), shouldKeep),\n\n    shouldKeep,\n\n    and: (other) => withFilter((el) => other.shouldKeep(el)),\n\n    or: (other) => {\n      // Union: element passes if it matches this finder's filters OR the other's\n      const selfKeep = shouldKeep;\n      return rebuild([(el: T) => selfKeep(el) || other.shouldKeep(el)]);\n    },\n\n    negate: () => {\n      const selfKeep = shouldKeep;\n      return rebuild([(el: T) => !selfKeep(el)]);\n    },\n  };\n\n  const extensions = extend(base, withFilter);\n\n  return { ...base, ...extensions } as F;\n}\n"]}

package/dist/vendored/brepjs/query/finderFns.d.ts

@@ -0,0 +1,25 @@
+/**
+ * Functional, immutable finder — filter-based shape querying with branded types.
+ * Each filter method returns a NEW finder (immutable builder pattern).
+ *
+ * Usage:
+ *   const edges = edgeFinder()
+ *     .inDirection('Z')
+ *     .ofLength(10, 0.01)
+ *     .findAll(shape);
+ *
+ * This barrel re-exports everything from the individual finder modules
+ * so that existing imports from `'./finderFns.js'` continue to work.
+ */
+export type { ShapeFinder, Predicate, TopoKind } from './finderCore.js';
+export { edgeFinder } from './edgeFinder.js';
+export type { EdgeFinderFn } from './edgeFinder.js';
+export { faceFinder } from './faceFinder.js';
+export type { FaceFinderFn } from './faceFinder.js';
+export { wireFinder } from './wireFinder.js';
+export type { WireFinderFn } from './wireFinder.js';
+export { vertexFinder } from './vertexFinder.js';
+export type { VertexFinderFn } from './vertexFinder.js';
+export { cornerFinder } from './cornerFinder.js';
+export type { CornerFinderFn, CornerFilter, Corner, BlueprintLike } from './cornerFinder.js';
+//# sourceMappingURL=finderFns.d.ts.map

package/dist/vendored/brepjs/query/finderFns.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"finderFns.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/query/finderFns.ts"],"names":[],"mappings":"AACA;;;;;;;;;;;;GAYG;AAGH,YAAY,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAGxE,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,YAAY,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAGpD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,YAAY,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAGpD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,YAAY,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAGpD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,YAAY,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAGxD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,YAAY,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/vendored/brepjs/query/finderFns.js

@@ -0,0 +1,25 @@
+/* v8 ignore file -- barrel re-export, no executable code */
+/**
+ * Functional, immutable finder — filter-based shape querying with branded types.
+ * Each filter method returns a NEW finder (immutable builder pattern).
+ *
+ * Usage:
+ *   const edges = edgeFinder()
+ *     .inDirection('Z')
+ *     .ofLength(10, 0.01)
+ *     .findAll(shape);
+ *
+ * This barrel re-exports everything from the individual finder modules
+ * so that existing imports from `'./finderFns.js'` continue to work.
+ */
+// -- Edge finder --
+export { edgeFinder } from './edgeFinder.js';
+// -- Face finder --
+export { faceFinder } from './faceFinder.js';
+// -- Wire finder --
+export { wireFinder } from './wireFinder.js';
+// -- Vertex finder --
+export { vertexFinder } from './vertexFinder.js';
+// -- Corner finder (2D) --
+export { cornerFinder } from './cornerFinder.js';
+//# sourceMappingURL=finderFns.js.map

package/dist/vendored/brepjs/query/finderFns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"finderFns.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/query/finderFns.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D;;;;;;;;;;;;GAYG;AAKH,oBAAoB;AACpB,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAG7C,oBAAoB;AACpB,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAG7C,oBAAoB;AACpB,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAG7C,sBAAsB;AACtB,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAGjD,2BAA2B;AAC3B,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC","sourcesContent":["/* v8 ignore file -- barrel re-export, no executable code */\n/**\n * Functional, immutable finder — filter-based shape querying with branded types.\n * Each filter method returns a NEW finder (immutable builder pattern).\n *\n * Usage:\n *   const edges = edgeFinder()\n *     .inDirection('Z')\n *     .ofLength(10, 0.01)\n *     .findAll(shape);\n *\n * This barrel re-exports everything from the individual finder modules\n * so that existing imports from `'./finderFns.js'` continue to work.\n */\n\n// -- Core types --\nexport type { ShapeFinder, Predicate, TopoKind } from './finderCore.js';\n\n// -- Edge finder --\nexport { edgeFinder } from './edgeFinder.js';\nexport type { EdgeFinderFn } from './edgeFinder.js';\n\n// -- Face finder --\nexport { faceFinder } from './faceFinder.js';\nexport type { FaceFinderFn } from './faceFinder.js';\n\n// -- Wire finder --\nexport { wireFinder } from './wireFinder.js';\nexport type { WireFinderFn } from './wireFinder.js';\n\n// -- Vertex finder --\nexport { vertexFinder } from './vertexFinder.js';\nexport type { VertexFinderFn } from './vertexFinder.js';\n\n// -- Corner finder (2D) --\nexport { cornerFinder } from './cornerFinder.js';\nexport type { CornerFinderFn, CornerFilter, Corner, BlueprintLike } from './cornerFinder.js';\n"]}

package/dist/vendored/brepjs/query/helpers.d.ts

@@ -0,0 +1,11 @@
+import type { AnyShape, Dimension, Face } from '../core/shapeTypes.js';
+import { type FaceFinderFn } from './finderFns.js';
+import { type Result } from '../core/result.js';
+/**
+ * Input that resolves to a single face — a direct Face, a FaceFinderFn,
+ * or a finder callback.
+ */
+export type SingleFace = Face | FaceFinderFn | ((f: FaceFinderFn) => FaceFinderFn);
+/** Resolve a {@link SingleFace} input to a concrete Face from the given shape. */
+export declare function getSingleFace(f: SingleFace, shape: AnyShape<Dimension>): Result<Face>;
+//# sourceMappingURL=helpers.d.ts.map

package/dist/vendored/brepjs/query/helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/query/helpers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAEvE,OAAO,EAAc,KAAK,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC/D,OAAO,EAAE,KAAK,MAAM,EAAM,MAAM,mBAAmB,CAAC;AAEpD;;;GAGG;AACH,MAAM,MAAM,UAAU,GAAG,IAAI,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,EAAE,YAAY,KAAK,YAAY,CAAC,CAAC;AAEnF,kFAAkF;AAClF,wBAAgB,aAAa,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAYrF"}

package/dist/vendored/brepjs/query/helpers.js

@@ -0,0 +1,17 @@
+import { isFace } from '../core/shapeTypes.js';
+import { faceFinder } from './finderFns.js';
+import { ok } from '../core/result.js';
+/** Resolve a {@link SingleFace} input to a concrete Face from the given shape. */
+export function getSingleFace(f, shape) {
+    // Handle functional finder instance (has _topoKind property)
+    if (typeof f === 'object' && '_topoKind' in f) {
+        return f.findUnique(shape);
+    }
+    // Use isFace type guard for proper type discrimination of Face values
+    if (typeof f !== 'function' && isFace(f))
+        return ok(f);
+    // Handle callback with functional finder
+    const fnResult = f(faceFinder());
+    return fnResult.findUnique(shape);
+}
+//# sourceMappingURL=helpers.js.map

package/dist/vendored/brepjs/query/helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/query/helpers.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAC/C,OAAO,EAAE,UAAU,EAAqB,MAAM,gBAAgB,CAAC;AAC/D,OAAO,EAAe,EAAE,EAAE,MAAM,mBAAmB,CAAC;AAQpD,kFAAkF;AAClF,MAAM,UAAU,aAAa,CAAC,CAAa,EAAE,KAA0B;IACrE,6DAA6D;IAC7D,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,WAAW,IAAI,CAAC,EAAE,CAAC;QAC9C,OAAO,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;IAED,sEAAsE;IACtE,IAAI,OAAO,CAAC,KAAK,UAAU,IAAI,MAAM,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IAEvD,yCAAyC;IACzC,MAAM,QAAQ,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC;IACjC,OAAO,QAAQ,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;AACpC,CAAC","sourcesContent":["import type { AnyShape, Dimension, Face } from '../core/shapeTypes.js';\nimport { isFace } from '../core/shapeTypes.js';\nimport { faceFinder, type FaceFinderFn } from './finderFns.js';\nimport { type Result, ok } from '../core/result.js';\n\n/**\n * Input that resolves to a single face — a direct Face, a FaceFinderFn,\n * or a finder callback.\n */\nexport type SingleFace = Face | FaceFinderFn | ((f: FaceFinderFn) => FaceFinderFn);\n\n/** Resolve a {@link SingleFace} input to a concrete Face from the given shape. */\nexport function getSingleFace(f: SingleFace, shape: AnyShape<Dimension>): Result<Face> {\n  // Handle functional finder instance (has _topoKind property)\n  if (typeof f === 'object' && '_topoKind' in f) {\n    return f.findUnique(shape);\n  }\n\n  // Use isFace type guard for proper type discrimination of Face values\n  if (typeof f !== 'function' && isFace(f)) return ok(f);\n\n  // Handle callback with functional finder\n  const fnResult = f(faceFinder());\n  return fnResult.findUnique(shape);\n}\n"]}

package/dist/vendored/brepjs/query/shapeDistanceFilter.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Shared distance-from-point filter used by edge, face, and vertex finders.
+ */
+import type { Vec3 } from '../core/types.js';
+import type { AnyShape, Dimension } from '../core/shapeTypes.js';
+import type { Predicate } from './finderCore.js';
+/**
+ * Create a predicate that checks whether a shape element's minimum distance
+ * from `point` equals `distance` (within `tolerance`).
+ *
+ * Uses the kernel's `distance()` method to compute minimum distance,
+ * with a vertex constructed at the reference point.
+ */
+export declare function distanceFromPointFilter<T extends AnyShape<Dimension>>(distance: number, point: Vec3, tolerance: number): Predicate<T>;
+//# sourceMappingURL=shapeDistanceFilter.d.ts.map

package/dist/vendored/brepjs/query/shapeDistanceFilter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shapeDistanceFilter.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/query/shapeDistanceFilter.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAEjE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAEjD;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,SAAS,QAAQ,CAAC,SAAS,CAAC,EACnE,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,IAAI,EACX,SAAS,EAAE,MAAM,GAChB,SAAS,CAAC,CAAC,CAAC,CASd"}

package/dist/vendored/brepjs/query/shapeDistanceFilter.js

@@ -0,0 +1,21 @@
+/**
+ * Shared distance-from-point filter used by edge, face, and vertex finders.
+ */
+import { getKernel } from '../kernel/index.js';
+/**
+ * Create a predicate that checks whether a shape element's minimum distance
+ * from `point` equals `distance` (within `tolerance`).
+ *
+ * Uses the kernel's `distance()` method to compute minimum distance,
+ * with a vertex constructed at the reference point.
+ */
+export function distanceFromPointFilter(distance, point, tolerance) {
+    // Create a vertex at the reference point for distance calculations.
+    const kernel = getKernel();
+    const vtx = kernel.makeVertex(point[0], point[1], point[2]);
+    return (element) => {
+        const d = kernel.distance(vtx, element.wrapped).value;
+        return Math.abs(d - distance) < tolerance;
+    };
+}
+//# sourceMappingURL=shapeDistanceFilter.js.map

package/dist/vendored/brepjs/query/shapeDistanceFilter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shapeDistanceFilter.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/query/shapeDistanceFilter.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAG/C;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CACrC,QAAgB,EAChB,KAAW,EACX,SAAiB;IAEjB,oEAAoE;IACpE,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAE5D,OAAO,CAAC,OAAU,EAAW,EAAE;QAC7B,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC;QACtD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,SAAS,CAAC;IAC5C,CAAC,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Shared distance-from-point filter used by edge, face, and vertex finders.\n */\n\nimport type { Vec3 } from '../core/types.js';\nimport type { AnyShape, Dimension } from '../core/shapeTypes.js';\nimport { getKernel } from '../kernel/index.js';\nimport type { Predicate } from './finderCore.js';\n\n/**\n * Create a predicate that checks whether a shape element's minimum distance\n * from `point` equals `distance` (within `tolerance`).\n *\n * Uses the kernel's `distance()` method to compute minimum distance,\n * with a vertex constructed at the reference point.\n */\nexport function distanceFromPointFilter<T extends AnyShape<Dimension>>(\n  distance: number,\n  point: Vec3,\n  tolerance: number\n): Predicate<T> {\n  // Create a vertex at the reference point for distance calculations.\n  const kernel = getKernel();\n  const vtx = kernel.makeVertex(point[0], point[1], point[2]);\n\n  return (element: T): boolean => {\n    const d = kernel.distance(vtx, element.wrapped).value;\n    return Math.abs(d - distance) < tolerance;\n  };\n}\n"]}

package/dist/vendored/brepjs/query/shapeFinders.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Consolidated shape finders — edge, face, and wire finders in a single file.
+ *
+ * These three finders share the same structure (direction-based filtering,
+ * distance filtering, geometric predicates) and are merged here from the
+ * former edgeFinder.ts, faceFinder.ts, and wireFinder.ts.
+ */
+import type { Vec3 } from '../core/types.js';
+import type { Edge, Face, Wire } from '../core/shapeTypes.js';
+import { type SurfaceType } from '../topology/faceFns.js';
+import type { CurveType } from '../core/typeDiscriminants.js';
+import { type ShapeFinder } from './finderCore.js';
+import { type DirectionInput } from './directionUtils.js';
+export interface EdgeFinderFn extends ShapeFinder<Edge> {
+    readonly inDirection: (dir?: DirectionInput, angle?: number) => EdgeFinderFn;
+    readonly ofLength: (length: number, tolerance?: number) => EdgeFinderFn;
+    readonly ofCurveType: (curveType: CurveType) => EdgeFinderFn;
+    readonly parallelTo: (dir?: DirectionInput) => EdgeFinderFn;
+    readonly atDistance: (distance: number, point?: Vec3) => EdgeFinderFn;
+}
+/** Create an immutable edge finder. */
+export declare function edgeFinder(): EdgeFinderFn;
+export interface FaceFinderFn extends ShapeFinder<Face> {
+    readonly inDirection: (dir?: DirectionInput, angle?: number) => FaceFinderFn;
+    readonly parallelTo: (dir?: DirectionInput) => FaceFinderFn;
+    readonly ofSurfaceType: (surfaceType: SurfaceType) => FaceFinderFn;
+    readonly ofArea: (area: number, tolerance?: number) => FaceFinderFn;
+    readonly atDistance: (distance: number, point?: Vec3) => FaceFinderFn;
+}
+/** Create an immutable face finder. */
+export declare function faceFinder(): FaceFinderFn;
+export interface WireFinderFn extends ShapeFinder<Wire> {
+    readonly isClosed: () => WireFinderFn;
+    readonly isOpen: () => WireFinderFn;
+    readonly ofEdgeCount: (count: number) => WireFinderFn;
+}
+/** Create an immutable wire finder. */
+export declare function wireFinder(): WireFinderFn;
+//# sourceMappingURL=shapeFinders.d.ts.map

package/dist/vendored/brepjs/query/shapeFinders.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shapeFinders.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/query/shapeFinders.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAK9D,OAAO,EAA4C,KAAK,WAAW,EAAE,MAAM,wBAAwB,CAAC;AAIpG,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AAC9D,OAAO,EAAE,KAAK,WAAW,EAAqC,MAAM,iBAAiB,CAAC;AACtF,OAAO,EAAE,KAAK,cAAc,EAAc,MAAM,qBAAqB,CAAC;AAOtE,MAAM,WAAW,YAAa,SAAQ,WAAW,CAAC,IAAI,CAAC;IACrD,QAAQ,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,EAAE,cAAc,EAAE,KAAK,CAAC,EAAE,MAAM,KAAK,YAAY,CAAC;IAC7E,QAAQ,CAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,KAAK,YAAY,CAAC;IACxE,QAAQ,CAAC,WAAW,EAAE,CAAC,SAAS,EAAE,SAAS,KAAK,YAAY,CAAC;IAC7D,QAAQ,CAAC,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,cAAc,KAAK,YAAY,CAAC;IAC5D,QAAQ,CAAC,UAAU,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,IAAI,KAAK,YAAY,CAAC;CACvE;AAqCD,uCAAuC;AACvC,wBAAgB,UAAU,IAAI,YAAY,CAEzC;AAMD,MAAM,WAAW,YAAa,SAAQ,WAAW,CAAC,IAAI,CAAC;IACrD,QAAQ,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,EAAE,cAAc,EAAE,KAAK,CAAC,EAAE,MAAM,KAAK,YAAY,CAAC;IAC7E,QAAQ,CAAC,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,cAAc,KAAK,YAAY,CAAC;IAC5D,QAAQ,CAAC,aAAa,EAAE,CAAC,WAAW,EAAE,WAAW,KAAK,YAAY,CAAC;IACnE,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,KAAK,YAAY,CAAC;IACpE,QAAQ,CAAC,UAAU,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,IAAI,KAAK,YAAY,CAAC;CACvE;AAwCD,uCAAuC;AACvC,wBAAgB,UAAU,IAAI,YAAY,CAEzC;AAMD,MAAM,WAAW,YAAa,SAAQ,WAAW,CAAC,IAAI,CAAC;IACrD,QAAQ,CAAC,QAAQ,EAAE,MAAM,YAAY,CAAC;IACtC,QAAQ,CAAC,MAAM,EAAE,MAAM,YAAY,CAAC;IACpC,QAAQ,CAAC,WAAW,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,YAAY,CAAC;CACvD;AAiBD,uCAAuC;AACvC,wBAAgB,UAAU,IAAI,YAAY,CAEzC"}

package/dist/vendored/brepjs/query/shapeFinders.js

@@ -0,0 +1,82 @@
+/**
+ * Consolidated shape finders — edge, face, and wire finders in a single file.
+ *
+ * These three finders share the same structure (direction-based filtering,
+ * distance filtering, geometric predicates) and are merged here from the
+ * former edgeFinder.ts, faceFinder.ts, and wireFinder.ts.
+ */
+import { getKernel } from '../kernel/index.js';
+import { vecDot, vecNormalize } from '../core/vecOps.js';
+import { DEG2RAD } from '../core/constants.js';
+import { getCurveType, curveLength, curveIsClosed } from '../topology/curveFns.js';
+import { normalAt as faceNormalAt, getSurfaceType } from '../topology/faceFns.js';
+import { measureArea } from '../measurement/measureFns.js';
+import { isOk } from '../core/result.js';
+import { getEdges } from '../topology/topologyQueryFns.js';
+import { createTypedFinder } from './finderCore.js';
+import { resolveDir } from './directionUtils.js';
+import { distanceFromPointFilter } from './shapeDistanceFilter.js';
+function edgeDirectionFilter(dir, angle) {
+    const d = vecNormalize(resolveDir(dir));
+    return (edge) => {
+        const kernel = getKernel();
+        const [firstParam, lastParam] = kernel.curveParameters(edge.wrapped);
+        const midParam = (firstParam + lastParam) / 2;
+        const { tangent: rawTangent } = kernel.curveTangent(edge.wrapped, midParam);
+        const tangent = vecNormalize(rawTangent);
+        const ang = Math.acos(Math.min(1, Math.abs(vecDot(tangent, d))));
+        return Math.abs(ang - DEG2RAD * angle) < 1e-6;
+    };
+}
+function buildEdgeFinder(filters) {
+    return createTypedFinder('edge', filters, buildEdgeFinder, (_base, withFilter) => ({
+        inDirection: (dir = 'Z', angle = 0) => withFilter(edgeDirectionFilter(dir, angle)),
+        ofLength: (length, tolerance = 1e-3) => withFilter((edge) => Math.abs(curveLength(edge) - length) < tolerance),
+        ofCurveType: (curveType) => withFilter((edge) => getCurveType(edge) === curveType),
+        parallelTo: (dir = 'Z') => buildEdgeFinder(filters).inDirection(dir, 0),
+        atDistance: (distance, point = [0, 0, 0]) => withFilter(distanceFromPointFilter(distance, point, 1e-6)),
+    }));
+}
+/** Create an immutable edge finder. */
+export function edgeFinder() {
+    return buildEdgeFinder([]);
+}
+function faceDirectionFilter(dir, angle) {
+    const d = vecNormalize(resolveDir(dir));
+    return (face) => {
+        const n = faceNormalAt(face);
+        const ang = Math.acos(Math.min(1, Math.abs(vecDot(vecNormalize(n), d))));
+        return Math.abs(ang - DEG2RAD * angle) < 1e-6;
+    };
+}
+function buildFaceFinder(filters) {
+    return createTypedFinder('face', filters, buildFaceFinder, (_base, withFilter) => ({
+        inDirection: (dir = 'Z', angle = 0) => withFilter(faceDirectionFilter(dir, angle)),
+        parallelTo: (dir = 'Z') => buildFaceFinder(filters).inDirection(dir, 0),
+        ofSurfaceType: (surfaceType) => withFilter((face) => {
+            const r = getSurfaceType(face);
+            return isOk(r) && r.value === surfaceType;
+        }),
+        ofArea: (area, tolerance = 1e-3) => withFilter((face) => {
+            const r = measureArea(face);
+            return isOk(r) && Math.abs(r.value - area) < tolerance;
+        }),
+        atDistance: (distance, point = [0, 0, 0]) => withFilter(distanceFromPointFilter(distance, point, 1e-6)),
+    }));
+}
+/** Create an immutable face finder. */
+export function faceFinder() {
+    return buildFaceFinder([]);
+}
+function buildWireFinder(filters) {
+    return createTypedFinder('wire', filters, buildWireFinder, (_base, withFilter) => ({
+        isClosed: () => withFilter((wire) => curveIsClosed(wire)),
+        isOpen: () => withFilter((wire) => !curveIsClosed(wire)),
+        ofEdgeCount: (count) => withFilter((wire) => getEdges(wire).length === count),
+    }));
+}
+/** Create an immutable wire finder. */
+export function wireFinder() {
+    return buildWireFinder([]);
+}
+//# sourceMappingURL=shapeFinders.js.map

package/dist/vendored/brepjs/query/shapeFinders.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shapeFinders.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/query/shapeFinders.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACnF,OAAO,EAAE,QAAQ,IAAI,YAAY,EAAE,cAAc,EAAoB,MAAM,wBAAwB,CAAC;AACpG,OAAO,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAC3D,OAAO,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AACzC,OAAO,EAAE,QAAQ,EAAE,MAAM,iCAAiC,CAAC;AAE3D,OAAO,EAAoC,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AACtF,OAAO,EAAuB,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACtE,OAAO,EAAE,uBAAuB,EAAE,MAAM,0BAA0B,CAAC;AAcnE,SAAS,mBAAmB,CAAC,GAAmB,EAAE,KAAa;IAC7D,MAAM,CAAC,GAAG,YAAY,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;IACxC,OAAO,CAAC,IAAU,EAAW,EAAE;QAC7B,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;QAC3B,MAAM,CAAC,UAAU,EAAE,SAAS,CAAC,GAAG,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACrE,MAAM,QAAQ,GAAG,CAAC,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QAC9C,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAC5E,MAAM,OAAO,GAAS,YAAY,CAAC,UAAU,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,OAAO,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC;IAChD,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,OAAuC;IAC9D,OAAO,iBAAiB,CACtB,MAAM,EACN,OAAO,EACP,eAAe,EACf,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;QACtB,WAAW,EAAE,CAAC,MAAsB,GAAG,EAAE,KAAK,GAAG,CAAC,EAAE,EAAE,CACpD,UAAU,CAAC,mBAAmB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAE7C,QAAQ,EAAE,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI,EAAE,EAAE,CACrC,UAAU,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,SAAS,CAAC;QAExE,WAAW,EAAE,CAAC,SAAS,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC;QAElF,UAAU,EAAE,CAAC,MAAsB,GAAG,EAAE,EAAE,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC;QAEvF,UAAU,EAAE,CAAC,QAAQ,EAAE,QAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAChD,UAAU,CAAC,uBAAuB,CAAO,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;KACnE,CAAC,CACH,CAAC;AACJ,CAAC;AAED,uCAAuC;AACvC,MAAM,UAAU,UAAU;IACxB,OAAO,eAAe,CAAC,EAAE,CAAC,CAAC;AAC7B,CAAC;AAcD,SAAS,mBAAmB,CAAC,GAAmB,EAAE,KAAa;IAC7D,MAAM,CAAC,GAAG,YAAY,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;IACxC,OAAO,CAAC,IAAU,EAAW,EAAE;QAC7B,MAAM,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,OAAO,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC;IAChD,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,OAAuC;IAC9D,OAAO,iBAAiB,CACtB,MAAM,EACN,OAAO,EACP,eAAe,EACf,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;QACtB,WAAW,EAAE,CAAC,MAAsB,GAAG,EAAE,KAAK,GAAG,CAAC,EAAE,EAAE,CACpD,UAAU,CAAC,mBAAmB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAE7C,UAAU,EAAE,CAAC,MAAsB,GAAG,EAAE,EAAE,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC;QAEvF,aAAa,EAAE,CAAC,WAAW,EAAE,EAAE,CAC7B,UAAU,CAAC,CAAC,IAAI,EAAE,EAAE;YAClB,MAAM,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;YAC/B,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK,WAAW,CAAC;QAC5C,CAAC,CAAC;QAEJ,MAAM,EAAE,CAAC,IAAI,EAAE,SAAS,GAAG,IAAI,EAAE,EAAE,CACjC,UAAU,CAAC,CAAC,IAAI,EAAE,EAAE;YAClB,MAAM,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,SAAS,CAAC;QACzD,CAAC,CAAC;QAEJ,UAAU,EAAE,CAAC,QAAQ,EAAE,QAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAChD,UAAU,CAAC,uBAAuB,CAAO,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;KACnE,CAAC,CACH,CAAC;AACJ,CAAC;AAED,uCAAuC;AACvC,MAAM,UAAU,UAAU;IACxB,OAAO,eAAe,CAAC,EAAE,CAAC,CAAC;AAC7B,CAAC;AAYD,SAAS,eAAe,CAAC,OAAuC;IAC9D,OAAO,iBAAiB,CACtB,MAAM,EACN,OAAO,EACP,eAAe,EACf,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;QACtB,QAAQ,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAEzD,MAAM,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAExD,WAAW,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,KAAK,CAAC;KAC9E,CAAC,CACH,CAAC;AACJ,CAAC;AAED,uCAAuC;AACvC,MAAM,UAAU,UAAU;IACxB,OAAO,eAAe,CAAC,EAAE,CAAC,CAAC;AAC7B,CAAC","sourcesContent":["/**\n * Consolidated shape finders — edge, face, and wire finders in a single file.\n *\n * These three finders share the same structure (direction-based filtering,\n * distance filtering, geometric predicates) and are merged here from the\n * former edgeFinder.ts, faceFinder.ts, and wireFinder.ts.\n */\n\nimport type { Vec3 } from '../core/types.js';\nimport type { Edge, Face, Wire } from '../core/shapeTypes.js';\nimport { getKernel } from '../kernel/index.js';\nimport { vecDot, vecNormalize } from '../core/vecOps.js';\nimport { DEG2RAD } from '../core/constants.js';\nimport { getCurveType, curveLength, curveIsClosed } from '../topology/curveFns.js';\nimport { normalAt as faceNormalAt, getSurfaceType, type SurfaceType } from '../topology/faceFns.js';\nimport { measureArea } from '../measurement/measureFns.js';\nimport { isOk } from '../core/result.js';\nimport { getEdges } from '../topology/topologyQueryFns.js';\nimport type { CurveType } from '../core/typeDiscriminants.js';\nimport { type ShapeFinder, type Predicate, createTypedFinder } from './finderCore.js';\nimport { type DirectionInput, resolveDir } from './directionUtils.js';\nimport { distanceFromPointFilter } from './shapeDistanceFilter.js';\n\n// ---------------------------------------------------------------------------\n// Edge finder\n// ---------------------------------------------------------------------------\n\nexport interface EdgeFinderFn extends ShapeFinder<Edge> {\n  readonly inDirection: (dir?: DirectionInput, angle?: number) => EdgeFinderFn;\n  readonly ofLength: (length: number, tolerance?: number) => EdgeFinderFn;\n  readonly ofCurveType: (curveType: CurveType) => EdgeFinderFn;\n  readonly parallelTo: (dir?: DirectionInput) => EdgeFinderFn;\n  readonly atDistance: (distance: number, point?: Vec3) => EdgeFinderFn;\n}\n\nfunction edgeDirectionFilter(dir: DirectionInput, angle: number): Predicate<Edge> {\n  const d = vecNormalize(resolveDir(dir));\n  return (edge: Edge): boolean => {\n    const kernel = getKernel();\n    const [firstParam, lastParam] = kernel.curveParameters(edge.wrapped);\n    const midParam = (firstParam + lastParam) / 2;\n    const { tangent: rawTangent } = kernel.curveTangent(edge.wrapped, midParam);\n    const tangent: Vec3 = vecNormalize(rawTangent);\n    const ang = Math.acos(Math.min(1, Math.abs(vecDot(tangent, d))));\n    return Math.abs(ang - DEG2RAD * angle) < 1e-6;\n  };\n}\n\nfunction buildEdgeFinder(filters: ReadonlyArray<Predicate<Edge>>): EdgeFinderFn {\n  return createTypedFinder<Edge, EdgeFinderFn>(\n    'edge',\n    filters,\n    buildEdgeFinder,\n    (_base, withFilter) => ({\n      inDirection: (dir: DirectionInput = 'Z', angle = 0) =>\n        withFilter(edgeDirectionFilter(dir, angle)),\n\n      ofLength: (length, tolerance = 1e-3) =>\n        withFilter((edge) => Math.abs(curveLength(edge) - length) < tolerance),\n\n      ofCurveType: (curveType) => withFilter((edge) => getCurveType(edge) === curveType),\n\n      parallelTo: (dir: DirectionInput = 'Z') => buildEdgeFinder(filters).inDirection(dir, 0),\n\n      atDistance: (distance, point: Vec3 = [0, 0, 0]) =>\n        withFilter(distanceFromPointFilter<Edge>(distance, point, 1e-6)),\n    })\n  );\n}\n\n/** Create an immutable edge finder. */\nexport function edgeFinder(): EdgeFinderFn {\n  return buildEdgeFinder([]);\n}\n\n// ---------------------------------------------------------------------------\n// Face finder\n// ---------------------------------------------------------------------------\n\nexport interface FaceFinderFn extends ShapeFinder<Face> {\n  readonly inDirection: (dir?: DirectionInput, angle?: number) => FaceFinderFn;\n  readonly parallelTo: (dir?: DirectionInput) => FaceFinderFn;\n  readonly ofSurfaceType: (surfaceType: SurfaceType) => FaceFinderFn;\n  readonly ofArea: (area: number, tolerance?: number) => FaceFinderFn;\n  readonly atDistance: (distance: number, point?: Vec3) => FaceFinderFn;\n}\n\nfunction faceDirectionFilter(dir: DirectionInput, angle: number): Predicate<Face> {\n  const d = vecNormalize(resolveDir(dir));\n  return (face: Face): boolean => {\n    const n = faceNormalAt(face);\n    const ang = Math.acos(Math.min(1, Math.abs(vecDot(vecNormalize(n), d))));\n    return Math.abs(ang - DEG2RAD * angle) < 1e-6;\n  };\n}\n\nfunction buildFaceFinder(filters: ReadonlyArray<Predicate<Face>>): FaceFinderFn {\n  return createTypedFinder<Face, FaceFinderFn>(\n    'face',\n    filters,\n    buildFaceFinder,\n    (_base, withFilter) => ({\n      inDirection: (dir: DirectionInput = 'Z', angle = 0) =>\n        withFilter(faceDirectionFilter(dir, angle)),\n\n      parallelTo: (dir: DirectionInput = 'Z') => buildFaceFinder(filters).inDirection(dir, 0),\n\n      ofSurfaceType: (surfaceType) =>\n        withFilter((face) => {\n          const r = getSurfaceType(face);\n          return isOk(r) && r.value === surfaceType;\n        }),\n\n      ofArea: (area, tolerance = 1e-3) =>\n        withFilter((face) => {\n          const r = measureArea(face);\n          return isOk(r) && Math.abs(r.value - area) < tolerance;\n        }),\n\n      atDistance: (distance, point: Vec3 = [0, 0, 0]) =>\n        withFilter(distanceFromPointFilter<Face>(distance, point, 1e-6)),\n    })\n  );\n}\n\n/** Create an immutable face finder. */\nexport function faceFinder(): FaceFinderFn {\n  return buildFaceFinder([]);\n}\n\n// ---------------------------------------------------------------------------\n// Wire finder\n// ---------------------------------------------------------------------------\n\nexport interface WireFinderFn extends ShapeFinder<Wire> {\n  readonly isClosed: () => WireFinderFn;\n  readonly isOpen: () => WireFinderFn;\n  readonly ofEdgeCount: (count: number) => WireFinderFn;\n}\n\nfunction buildWireFinder(filters: ReadonlyArray<Predicate<Wire>>): WireFinderFn {\n  return createTypedFinder<Wire, WireFinderFn>(\n    'wire',\n    filters,\n    buildWireFinder,\n    (_base, withFilter) => ({\n      isClosed: () => withFilter((wire) => curveIsClosed(wire)),\n\n      isOpen: () => withFilter((wire) => !curveIsClosed(wire)),\n\n      ofEdgeCount: (count) => withFilter((wire) => getEdges(wire).length === count),\n    })\n  );\n}\n\n/** Create an immutable wire finder. */\nexport function wireFinder(): WireFinderFn {\n  return buildWireFinder([]);\n}\n"]}

package/dist/vendored/brepjs/query/vertexFinder.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Vertex-specific finder — filters vertices by position, proximity, bounding box, etc.
+ */
+import type { Vec3 } from '../core/types.js';
+import type { Vertex } from '../core/shapeTypes.js';
+import { type ShapeFinder } from './finderCore.js';
+export interface VertexFinderFn extends ShapeFinder<Vertex> {
+    /** Filter vertices nearest to a reference point. Returns a new finder that keeps only the closest vertex. */
+    readonly nearestTo: (point: Vec3) => VertexFinderFn;
+    /** Filter vertices at an exact position (within tolerance). */
+    readonly atPosition: (point: Vec3, tolerance?: number) => VertexFinderFn;
+    /** Filter vertices within an axis-aligned bounding box. */
+    readonly withinBox: (min: Vec3, max: Vec3) => VertexFinderFn;
+    /** Filter vertices at a given distance from a point. */
+    readonly atDistance: (distance: number, point?: Vec3, tolerance?: number) => VertexFinderFn;
+}
+/** Create an immutable vertex finder. */
+export declare function vertexFinder(): VertexFinderFn;
+//# sourceMappingURL=vertexFinder.d.ts.map

package/dist/vendored/brepjs/query/vertexFinder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vertexFinder.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/query/vertexFinder.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,KAAK,EAAuB,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAKzE,OAAO,EAAE,KAAK,WAAW,EAAqC,MAAM,iBAAiB,CAAC;AAOtF,MAAM,WAAW,cAAe,SAAQ,WAAW,CAAC,MAAM,CAAC;IACzD,6GAA6G;IAC7G,QAAQ,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,IAAI,KAAK,cAAc,CAAC;IACpD,+DAA+D;IAC/D,QAAQ,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE,MAAM,KAAK,cAAc,CAAC;IACzE,2DAA2D;IAC3D,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,KAAK,cAAc,CAAC;IAC7D,wDAAwD;IACxD,QAAQ,CAAC,UAAU,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE,MAAM,KAAK,cAAc,CAAC;CAC7F;AAmFD,yCAAyC;AACzC,wBAAgB,YAAY,IAAI,cAAc,CAE7C"}

package/dist/vendored/brepjs/query/vertexFinder.js

@@ -0,0 +1,73 @@
+/**
+ * Vertex-specific finder — filters vertices by position, proximity, bounding box, etc.
+ */
+import { vecDistance } from '../core/vecOps.js';
+import { ok, err } from '../core/result.js';
+import { queryError } from '../core/errors.js';
+import { vertexPosition } from '../topology/shapeFns.js';
+import { createTypedFinder } from './finderCore.js';
+import { firstOrThrow, getAtOrThrow } from '../utils/arrayAccess.js';
+// ---------------------------------------------------------------------------
+// NearestTo post-filter
+// ---------------------------------------------------------------------------
+/**
+ * Wrap a vertex finder so that `findAll` and `findUnique` return only the
+ * single vertex closest to `nearestPoint` among candidates that pass all
+ * other filters.
+ */
+function withNearestPostFilter(baseFinder, nearestPoint) {
+    const findAllNearest = (shape) => {
+        const candidates = baseFinder.findAll(shape);
+        if (candidates.length === 0)
+            return [];
+        let bestIdx = 0;
+        let bestDist = vecDistance(vertexPosition(firstOrThrow(candidates)), nearestPoint);
+        for (let i = 1; i < candidates.length; i++) {
+            const d = vecDistance(vertexPosition(getAtOrThrow(candidates, i)), nearestPoint);
+            if (d < bestDist) {
+                bestDist = d;
+                bestIdx = i;
+            }
+        }
+        return [getAtOrThrow(candidates, bestIdx)];
+    };
+    const findUniqueNearest = (shape) => {
+        const nearest = findAllNearest(shape);
+        if (nearest.length === 0) {
+            return err(queryError('FINDER_NOT_UNIQUE', 'Finder expected a unique match but found 0 element(s)'));
+        }
+        return ok(firstOrThrow(nearest));
+    };
+    return {
+        ...baseFinder,
+        findAll: findAllNearest,
+        findUnique: findUniqueNearest,
+    };
+}
+// ---------------------------------------------------------------------------
+// Factory
+// ---------------------------------------------------------------------------
+function buildVertexFinder(filters) {
+    return createTypedFinder('vertex', filters, buildVertexFinder, (_base, withFilter) => ({
+        nearestTo: (point) => withNearestPostFilter(buildVertexFinder(filters), point),
+        atPosition: (point, tolerance = 1e-4) => withFilter((vertex) => vecDistance(vertexPosition(vertex), point) < tolerance),
+        withinBox: (min, max) => withFilter((vertex) => {
+            const pos = vertexPosition(vertex);
+            return (pos[0] >= min[0] - 1e-6 &&
+                pos[0] <= max[0] + 1e-6 &&
+                pos[1] >= min[1] - 1e-6 &&
+                pos[1] <= max[1] + 1e-6 &&
+                pos[2] >= min[2] - 1e-6 &&
+                pos[2] <= max[2] + 1e-6);
+        }),
+        atDistance: (distance, point = [0, 0, 0], tolerance = 1e-4) => withFilter((vertex) => {
+            const pos = vertexPosition(vertex);
+            return Math.abs(vecDistance(pos, point) - distance) < tolerance;
+        }),
+    }));
+}
+/** Create an immutable vertex finder. */
+export function vertexFinder() {
+    return buildVertexFinder([]);
+}
+//# sourceMappingURL=vertexFinder.js.map