brepjs 18.99.5 → 18.100.1

package/dist/2d.cjs

@@ -1,11 +1,11 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_shapeTypes = require("./shapeTypes-DwNTiXjG.cjs");
+const require_shapeTypes = require("./shapeTypes-DplVM8Fy.cjs");
 const require_errors = require("./errors-CXJtc4I7.cjs");
-const require_topologyQueryFns = require("./topologyQueryFns-a2i0YhGF.cjs");
-const require_blueprintSketcher = require("./blueprintSketcher-B7QRguA5.cjs");
-const require_blueprint = require("./blueprint-BoK8H4Eq.cjs");
-const require_boolean2D = require("./boolean2D-DcowIZPB.cjs");
-const require_blueprintFns = require("./blueprintFns-C3F0jZOe.cjs");
+const require_topologyQueryFns = require("./topologyQueryFns-Dzw_tis6.cjs");
+const require_blueprintSketcher = require("./blueprintSketcher-DwL9iPAG.cjs");
+const require_blueprint = require("./blueprint-BhCha_8H.cjs");
+const require_boolean2D = require("./boolean2D-BJ6MwGgV.cjs");
+const require_blueprintFns = require("./blueprintFns-DKmyNVyL.cjs");
 //#region src/core/curve2dHandle.ts
 /**
 * Wrap a raw kernel 2D curve handle with brand + disposal tracking.

package/dist/2d.js

@@ -1,10 +1,10 @@
-import { B as createKernelHandle, Q as getKernel2D, a as createEdge } from "./shapeTypes-BIcALNFv.js";
+import { B as createKernelHandle, Q as getKernel2D, a as createEdge } from "./shapeTypes-D9XYNPBs.js";
 import { A as ok, b as err, d as validationError, t as BrepErrorCode } from "./errors-DNWJsfVU.js";
-import { w as kernelCallRaw } from "./topologyQueryFns-0BIOC7YH.js";
-import { a as Blueprints, i as CompoundBlueprint, r as organiseBlueprints } from "./blueprintSketcher-CIsOckAh.js";
-import { _ as Curve2D, t as Blueprint, y as BoundingBox2d } from "./blueprint-Dg3dsUal.js";
-import { a as fuseBlueprints, c as roundedRectangleBlueprint, i as cutBlueprints, n as fuse2D, o as intersectBlueprints, r as intersect2D, s as polysidesBlueprint, t as cut2D } from "./boolean2D-CZiGMjEF.js";
-import { S as reverseCurve, _ as curve2dIsOnCurve, a as isInside2D, b as curve2dSplitAt, c as scale2D, d as stretch2D, f as toSVGPathD, g as curve2dFirstPoint, h as curve2dDistanceFrom, i as getOrientation2D, l as sketchOnFace2D, m as curve2dBoundingBox, o as mirror2D, p as translate2D, r as getBounds2D, s as rotate2D, t as createBlueprint, u as sketchOnPlane2D, v as curve2dLastPoint, x as curve2dTangentAt, y as curve2dParameter } from "./blueprintFns-CuZU7Dt6.js";
+import { w as kernelCallRaw } from "./topologyQueryFns-jDWO6A94.js";
+import { a as Blueprints, i as CompoundBlueprint, r as organiseBlueprints } from "./blueprintSketcher-B5XBXgri.js";
+import { _ as Curve2D, t as Blueprint, y as BoundingBox2d } from "./blueprint-Bqmxcyfd.js";
+import { a as fuseBlueprints, c as roundedRectangleBlueprint, i as cutBlueprints, n as fuse2D, o as intersectBlueprints, r as intersect2D, s as polysidesBlueprint, t as cut2D } from "./boolean2D-DiQyJiA-.js";
+import { S as reverseCurve, _ as curve2dIsOnCurve, a as isInside2D, b as curve2dSplitAt, c as scale2D, d as stretch2D, f as toSVGPathD, g as curve2dFirstPoint, h as curve2dDistanceFrom, i as getOrientation2D, l as sketchOnFace2D, m as curve2dBoundingBox, o as mirror2D, p as translate2D, r as getBounds2D, s as rotate2D, t as createBlueprint, u as sketchOnPlane2D, v as curve2dLastPoint, x as curve2dTangentAt, y as curve2dParameter } from "./blueprintFns-_emMJGKf.js";
 //#region src/core/curve2dHandle.ts
 /**
 * Wrap a raw kernel 2D curve handle with brand + disposal tracking.

package/dist/{blueprint-BoK8H4Eq.cjs → blueprint-BhCha_8H.cjs}

@@ -1,14 +1,14 @@
-const require_shapeTypes = require("./shapeTypes-DwNTiXjG.cjs");
+const require_shapeTypes = require("./shapeTypes-DplVM8Fy.cjs");
 const require_vec3 = require("./vec3-CFwOI0ZI.cjs");
 const require_errors = require("./errors-CXJtc4I7.cjs");
 const require_constants = require("./constants-BOVyEYGH.cjs");
 const require_types = require("./types-KjA8tY4Y.cjs");
 const require_planeOps = require("./planeOps-BA4HfgQu.cjs");
-const require_faceFns = require("./faceFns-DSdVqqVP.cjs");
-const require_curveFns = require("./curveFns-D3k8aHIE.cjs");
+const require_faceFns = require("./faceFns-DrBS1FKx.cjs");
+const require_curveFns = require("./curveFns-DwBW-FmM.cjs");
 const require_arrayAccess = require("./arrayAccess-e4H9cBfh.cjs");
-const require_surfaceBuilders = require("./surfaceBuilders-DvpxHHIm.cjs");
-const require_helpers = require("./helpers-Bykw93Yc.cjs");
+const require_surfaceBuilders = require("./surfaceBuilders-CDrFrFBH.cjs");
+const require_helpers = require("./helpers-BVwuuo7f.cjs");
 //#region src/2d/lib/definitions.ts
 /** Type guard that checks whether a value is a `Point2D`. */
 function isPoint2D(point) {

package/dist/{blueprint-Dg3dsUal.js → blueprint-Bqmxcyfd.js}

@@ -1,14 +1,14 @@
-import { G as unregisterFromCleanup, Q as getKernel2D, U as registerForCleanup, Z as getKernel, a as createEdge, u as createWire } from "./shapeTypes-BIcALNFv.js";
+import { G as unregisterFromCleanup, Q as getKernel2D, U as registerForCleanup, Z as getKernel, a as createEdge, u as createWire } from "./shapeTypes-D9XYNPBs.js";
 import { n as wasmIndex } from "./vec3-Dpha8d5k.js";
 import { A as ok, R as unwrap, b as err, d as validationError, h as bug, n as computationError } from "./errors-DNWJsfVU.js";
 import { r as RAD2DEG, t as DEG2RAD } from "./constants-ITRzCnCp.js";
 import { r as toVec3 } from "./types-D24Y27N0.js";
 import { r as makePlane } from "./planeOps-DSjjtrjg.js";
-import { _ as cast, h as uvCoordinates, i as faceGeomType, m as uvBounds, r as faceCenter } from "./faceFns-CmhEEB-L.js";
-import { p as getOrientation } from "./curveFns-DT1yMgBI.js";
+import { _ as cast, h as uvCoordinates, i as faceGeomType, m as uvBounds, r as faceCenter } from "./faceFns-B642NCgD.js";
+import { p as getOrientation } from "./curveFns-BKpLwUdG.js";
 import { n as getAtOrThrow, r as lastOrThrow, t as firstOrThrow } from "./arrayAccess-DrUGPADn.js";
-import { r as makeFace } from "./surfaceBuilders-BQx3TjMH.js";
-import { _ as samePoint, b as subtract2d, l as add2d, o as normalize2d, p as distance2d, t as getSingleFace, v as scalarMultiply2d } from "./helpers-mPnUPOIM.js";
+import { r as makeFace } from "./surfaceBuilders-Cf3c00zK.js";
+import { _ as samePoint, b as subtract2d, l as add2d, o as normalize2d, p as distance2d, t as getSingleFace, v as scalarMultiply2d } from "./helpers-VUDxsMV6.js";
 //#region src/2d/lib/definitions.ts
 /** Type guard that checks whether a value is a `Point2D`. */
 function isPoint2D(point) {

package/dist/{blueprintFns-C3F0jZOe.cjs → blueprintFns-DKmyNVyL.cjs}

@@ -1,6 +1,6 @@
 const require_errors = require("./errors-CXJtc4I7.cjs");
-const require_blueprintSketcher = require("./blueprintSketcher-B7QRguA5.cjs");
-const require_blueprint = require("./blueprint-BoK8H4Eq.cjs");
+const require_blueprintSketcher = require("./blueprintSketcher-DwL9iPAG.cjs");
+const require_blueprint = require("./blueprint-BhCha_8H.cjs");
 //#region src/2d/lib/curve2dFns.ts
 /**
 * Return a reversed copy of the curve (non-mutating).

package/dist/{blueprintFns-CuZU7Dt6.js → blueprintFns-_emMJGKf.js}

@@ -1,6 +1,6 @@
 import { A as ok, b as err, d as validationError, t as BrepErrorCode } from "./errors-DNWJsfVU.js";
-import { i as CompoundBlueprint } from "./blueprintSketcher-CIsOckAh.js";
-import { t as Blueprint } from "./blueprint-Dg3dsUal.js";
+import { i as CompoundBlueprint } from "./blueprintSketcher-B5XBXgri.js";
+import { t as Blueprint } from "./blueprint-Bqmxcyfd.js";
 //#region src/2d/lib/curve2dFns.ts
 /**
 * Return a reversed copy of the curve (non-mutating).

package/dist/{blueprintSketcher-CIsOckAh.js → blueprintSketcher-B5XBXgri.js}

@@ -1,10 +1,10 @@
-import { Q as getKernel2D, Z as getKernel } from "./shapeTypes-BIcALNFv.js";
+import { Q as getKernel2D, Z as getKernel } from "./shapeTypes-D9XYNPBs.js";
 import { n as wasmIndex } from "./vec3-Dpha8d5k.js";
 import { A as ok, R as unwrap, T as isOk, b as err, h as bug, n as computationError, s as safeIndex } from "./errors-DNWJsfVU.js";
 import { r as RAD2DEG, t as DEG2RAD } from "./constants-ITRzCnCp.js";
 import { t as firstOrThrow } from "./arrayAccess-DrUGPADn.js";
-import { _ as samePoint, b as subtract2d, d as cartesianToPolar, f as crossProduct2d, g as rotate2d, h as polarToCartesian, l as add2d, m as polarAngle2d, o as normalize2d, p as distance2d, v as scalarMultiply2d } from "./helpers-mPnUPOIM.js";
-import { _ as Curve2D, c as make2dCircle, f as make2dSegmentCurve, h as approximateAsBSpline, m as make2dThreePointArc, n as asSVG, o as make2dArcFromCenter, p as make2dTangentArc, r as viewbox, s as make2dBezierCurve, t as Blueprint, u as make2dEllipseArc, x as isPoint2D, y as BoundingBox2d } from "./blueprint-Dg3dsUal.js";
+import { _ as samePoint, b as subtract2d, d as cartesianToPolar, f as crossProduct2d, g as rotate2d, h as polarToCartesian, l as add2d, m as polarAngle2d, o as normalize2d, p as distance2d, v as scalarMultiply2d } from "./helpers-VUDxsMV6.js";
+import { _ as Curve2D, c as make2dCircle, f as make2dSegmentCurve, h as approximateAsBSpline, m as make2dThreePointArc, n as asSVG, o as make2dArcFromCenter, p as make2dTangentArc, r as viewbox, s as make2dBezierCurve, t as Blueprint, u as make2dEllipseArc, x as isPoint2D, y as BoundingBox2d } from "./blueprint-Bqmxcyfd.js";
 //#region node_modules/flatqueue/index.js
 /**
 * @typedef {Float64ArrayConstructor | Float32ArrayConstructor |
@@ -214,13 +214,15 @@ var Flatbush = class Flatbush {
 	* @returns {number} A zero-based, incremental number that represents the newly added rectangle.
 	*/
 	add(minX, minY, maxX = minX, maxY = minY) {
-		const index = this._pos >> 2;
+		const pos = this._pos;
+		const index = pos >> 2;
 		const boxes = this._boxes;
 		this._indices[index] = index;
-		boxes[this._pos++] = minX;
-		boxes[this._pos++] = minY;
-		boxes[this._pos++] = maxX;
-		boxes[this._pos++] = maxY;
+		boxes[pos] = minX;
+		boxes[pos + 1] = minY;
+		boxes[pos + 2] = maxX;
+		boxes[pos + 3] = maxY;
+		this._pos = pos + 4;
 		if (minX < this.minX) this.minX = minX;
 		if (minY < this.minY) this.minY = minY;
 		if (maxX > this.maxX) this.maxX = maxX;
@@ -238,39 +240,44 @@ var Flatbush = class Flatbush {
 			boxes[this._pos++] = this.maxY;
 			return;
 		}
-		const width = this.maxX - this.minX || 1;
-		const height = this.maxY - this.minY || 1;
-		const hilbertValues = new Int32Array(this.numItems);
+		const { numItems, minX, minY, nodeSize, _indices: indices, _levelBounds: levelBounds } = this;
+		const width = this.maxX - minX || 1;
+		const height = this.maxY - minY || 1;
+		const hilbertValues = new Int32Array(numItems);
 		const hilbertMax = 65535;
-		for (let i = 0, pos = 0; i < this.numItems; i++) {
-			const minX = boxes[pos++];
-			const minY = boxes[pos++];
-			const maxX = boxes[pos++];
-			const maxY = boxes[pos++];
-			hilbertValues[i] = hilbert(Math.floor(hilbertMax * ((minX + maxX) / 2 - this.minX) / width), Math.floor(hilbertMax * ((minY + maxY) / 2 - this.minY) / height));
+		const sx = hilbertMax / width;
+		const sy = hilbertMax / height;
+		for (let i = 0, pos = 0; i < numItems; i++) {
+			const itemMinX = boxes[pos++];
+			const itemMinY = boxes[pos++];
+			const itemMaxX = boxes[pos++];
+			const itemMaxY = boxes[pos++];
+			hilbertValues[i] = hilbert(sx * ((itemMinX + itemMaxX) / 2 - minX) | 0, sy * ((itemMinY + itemMaxY) / 2 - minY) | 0);
 		}
-		sort(hilbertValues, boxes, this._indices, 0, this.numItems - 1, this.nodeSize);
-		for (let i = 0, pos = 0; i < this._levelBounds.length - 1; i++) {
-			const end = this._levelBounds[i];
-			while (pos < end) {
-				const nodeIndex = pos;
-				let nodeMinX = boxes[pos++];
-				let nodeMinY = boxes[pos++];
-				let nodeMaxX = boxes[pos++];
-				let nodeMaxY = boxes[pos++];
-				for (let j = 1; j < this.nodeSize && pos < end; j++) {
-					nodeMinX = Math.min(nodeMinX, boxes[pos++]);
-					nodeMinY = Math.min(nodeMinY, boxes[pos++]);
-					nodeMaxX = Math.max(nodeMaxX, boxes[pos++]);
-					nodeMaxY = Math.max(nodeMaxY, boxes[pos++]);
+		sort(hilbertValues, boxes, indices, 0, numItems - 1, nodeSize);
+		let pos = numItems * 4;
+		for (let i = 0, readPos = 0; i < levelBounds.length - 1; i++) {
+			const end = levelBounds[i];
+			while (readPos < end) {
+				const nodeIndex = readPos;
+				let nodeMinX = boxes[readPos++];
+				let nodeMinY = boxes[readPos++];
+				let nodeMaxX = boxes[readPos++];
+				let nodeMaxY = boxes[readPos++];
+				for (let j = 1; j < nodeSize && readPos < end; j++) {
+					nodeMinX = Math.min(nodeMinX, boxes[readPos++]);
+					nodeMinY = Math.min(nodeMinY, boxes[readPos++]);
+					nodeMaxX = Math.max(nodeMaxX, boxes[readPos++]);
+					nodeMaxY = Math.max(nodeMaxY, boxes[readPos++]);
 				}
-				this._indices[this._pos >> 2] = nodeIndex;
-				boxes[this._pos++] = nodeMinX;
-				boxes[this._pos++] = nodeMinY;
-				boxes[this._pos++] = nodeMaxX;
-				boxes[this._pos++] = nodeMaxY;
+				indices[pos >> 2] = nodeIndex;
+				boxes[pos++] = nodeMinX;
+				boxes[pos++] = nodeMinY;
+				boxes[pos++] = nodeMaxX;
+				boxes[pos++] = nodeMaxY;
 			}
 		}
+		this._pos = pos;
 	}
 	/**
 	* Search the index by a bounding box.
@@ -294,7 +301,7 @@ var Flatbush = class Flatbush {
 		while (nodeIndex !== void 0) {
 			const end = Math.min(nodeIndex + nodeSize * 4, levelBounds[level]);
 			const isNode = nodeIndex >= numItems4;
-			if (contained) this._collectContained(nodeIndex, end, level, isNode, q, results, filterFn);
+			if (contained) this._collectContained(nodeIndex, end, level, numItems4, results, filterFn);
 			else for (let pos = nodeIndex; pos < end; pos += 4) {
 				const x0 = boxes[pos];
 				if (maxX < x0) continue;
@@ -320,22 +327,26 @@ var Flatbush = class Flatbush {
 		return results;
 	}
 	/**
-	* Collect children of a node whose bbox is fully inside the query, skipping intersection tests.
+	* Collect all leaves of a subtree that's fully inside the query, skipping intersection tests.
+	* Because the tree is packed bottom-up, those leaves occupy one contiguous block of the leaf
+	* level, so we skip traversal entirely: descend to the first leaf, then sweep the flat range.
 	* @param {number} nodeIndex
 	* @param {number} end
 	* @param {number} level
-	* @param {boolean} isNode whether the children are tree nodes (vs leaf items)
-	* @param {number[]} q the traversal queue
+	* @param {number} numItems4
 	* @param {number[]} results
 	* @param {((index: number, x0: number, y0: number, x1: number, y1: number) => boolean) | undefined} filterFn
 	*/
-	_collectContained(nodeIndex, end, level, isNode, q, results, filterFn) {
+	_collectContained(nodeIndex, end, level, numItems4, results, filterFn) {
 		const boxes = this._boxes;
 		const indices = this._indices;
-		if (isNode) for (let pos = nodeIndex; pos < end; pos += 4) q.push(indices[pos >> 2] | 1, level - 1);
-		else for (let pos = nodeIndex; pos < end; pos += 4) {
+		let pos = nodeIndex;
+		for (let l = level; l > 0; l--) pos = indices[pos >> 2];
+		const leafEnd = Math.min(pos + (end - nodeIndex) * this.nodeSize ** level, numItems4);
+		if (filterFn === void 0) for (; pos < leafEnd; pos += 4) results.push(indices[pos >> 2] | 0);
+		else for (; pos < leafEnd; pos += 4) {
 			const index = indices[pos >> 2] | 0;
-			if (filterFn === void 0 || filterFn(index, boxes[pos], boxes[pos + 1], boxes[pos + 2], boxes[pos + 3])) results.push(index);
+			if (filterFn(index, boxes[pos], boxes[pos + 1], boxes[pos + 2], boxes[pos + 3])) results.push(index);
 		}
 	}
 	/**
@@ -354,11 +365,12 @@ var Flatbush = class Flatbush {
 		const nodeSize4 = nodeSize * 4;
 		const results = [];
 		const maxDistSquared = maxDistance * maxDistance;
+		const trackNearest = maxResults === 1;
+		let bound = maxDistSquared;
 		q.push(boxes.length - 4 << 1, 0);
 		while (q.length) {
 			const top = q.ids[0];
 			if (top & 1) {
-				if (q.values[0] > maxDistSquared) break;
 				q.pop();
 				results.push(top >> 1);
 				if (results.length === maxResults) break;
@@ -369,17 +381,20 @@ var Flatbush = class Flatbush {
 			const isLeafLevel = nodeIndex < numItems4;
 			const end = Math.min(nodeIndex + nodeSize4, upperBound(nodeIndex, levelBounds));
 			for (let pos = nodeIndex; pos < end; pos += 4) {
-				const childIndex = indices[pos >> 2] | 0;
 				const minX = boxes[pos];
 				const minY = boxes[pos + 1];
 				const maxX = boxes[pos + 2];
 				const maxY = boxes[pos + 3];
-				const dx = x < minX ? minX - x : x > maxX ? x - maxX : 0;
-				const dy = y < minY ? minY - y : y > maxY ? y - maxY : 0;
+				const dx = Math.max(Math.max(minX - x, x - maxX), 0);
+				const dy = Math.max(Math.max(minY - y, y - maxY), 0);
 				const dist = dx * dx + dy * dy;
-				if (dist > maxDistSquared) continue;
+				if (dist > bound) continue;
+				const childIndex = indices[pos >> 2] | 0;
 				if (isLeafLevel) {
-					if (filterFn === void 0 || filterFn(childIndex)) q.push(childIndex << 1 | 1, dist);
+					if (filterFn === void 0 || filterFn(childIndex)) {
+						q.push(childIndex << 1 | 1, dist);
+						if (trackNearest && dist < bound) bound = dist;
+					}
 				} else q.push(childIndex << 1, dist);
 			}
 		}

package/dist/{blueprintSketcher-B7QRguA5.cjs → blueprintSketcher-DwL9iPAG.cjs}

@@ -1,10 +1,10 @@
-const require_shapeTypes = require("./shapeTypes-DwNTiXjG.cjs");
+const require_shapeTypes = require("./shapeTypes-DplVM8Fy.cjs");
 const require_vec3 = require("./vec3-CFwOI0ZI.cjs");
 const require_errors = require("./errors-CXJtc4I7.cjs");
 const require_constants = require("./constants-BOVyEYGH.cjs");
 const require_arrayAccess = require("./arrayAccess-e4H9cBfh.cjs");
-const require_helpers = require("./helpers-Bykw93Yc.cjs");
-const require_blueprint = require("./blueprint-BoK8H4Eq.cjs");
+const require_helpers = require("./helpers-BVwuuo7f.cjs");
+const require_blueprint = require("./blueprint-BhCha_8H.cjs");
 //#region node_modules/flatqueue/index.js
 /**
 * @typedef {Float64ArrayConstructor | Float32ArrayConstructor |
@@ -214,13 +214,15 @@ var Flatbush = class Flatbush {
 	* @returns {number} A zero-based, incremental number that represents the newly added rectangle.
 	*/
 	add(minX, minY, maxX = minX, maxY = minY) {
-		const index = this._pos >> 2;
+		const pos = this._pos;
+		const index = pos >> 2;
 		const boxes = this._boxes;
 		this._indices[index] = index;
-		boxes[this._pos++] = minX;
-		boxes[this._pos++] = minY;
-		boxes[this._pos++] = maxX;
-		boxes[this._pos++] = maxY;
+		boxes[pos] = minX;
+		boxes[pos + 1] = minY;
+		boxes[pos + 2] = maxX;
+		boxes[pos + 3] = maxY;
+		this._pos = pos + 4;
 		if (minX < this.minX) this.minX = minX;
 		if (minY < this.minY) this.minY = minY;
 		if (maxX > this.maxX) this.maxX = maxX;
@@ -238,39 +240,44 @@ var Flatbush = class Flatbush {
 			boxes[this._pos++] = this.maxY;
 			return;
 		}
-		const width = this.maxX - this.minX || 1;
-		const height = this.maxY - this.minY || 1;
-		const hilbertValues = new Int32Array(this.numItems);
+		const { numItems, minX, minY, nodeSize, _indices: indices, _levelBounds: levelBounds } = this;
+		const width = this.maxX - minX || 1;
+		const height = this.maxY - minY || 1;
+		const hilbertValues = new Int32Array(numItems);
 		const hilbertMax = 65535;
-		for (let i = 0, pos = 0; i < this.numItems; i++) {
-			const minX = boxes[pos++];
-			const minY = boxes[pos++];
-			const maxX = boxes[pos++];
-			const maxY = boxes[pos++];
-			hilbertValues[i] = hilbert(Math.floor(hilbertMax * ((minX + maxX) / 2 - this.minX) / width), Math.floor(hilbertMax * ((minY + maxY) / 2 - this.minY) / height));
+		const sx = hilbertMax / width;
+		const sy = hilbertMax / height;
+		for (let i = 0, pos = 0; i < numItems; i++) {
+			const itemMinX = boxes[pos++];
+			const itemMinY = boxes[pos++];
+			const itemMaxX = boxes[pos++];
+			const itemMaxY = boxes[pos++];
+			hilbertValues[i] = hilbert(sx * ((itemMinX + itemMaxX) / 2 - minX) | 0, sy * ((itemMinY + itemMaxY) / 2 - minY) | 0);
 		}
-		sort(hilbertValues, boxes, this._indices, 0, this.numItems - 1, this.nodeSize);
-		for (let i = 0, pos = 0; i < this._levelBounds.length - 1; i++) {
-			const end = this._levelBounds[i];
-			while (pos < end) {
-				const nodeIndex = pos;
-				let nodeMinX = boxes[pos++];
-				let nodeMinY = boxes[pos++];
-				let nodeMaxX = boxes[pos++];
-				let nodeMaxY = boxes[pos++];
-				for (let j = 1; j < this.nodeSize && pos < end; j++) {
-					nodeMinX = Math.min(nodeMinX, boxes[pos++]);
-					nodeMinY = Math.min(nodeMinY, boxes[pos++]);
-					nodeMaxX = Math.max(nodeMaxX, boxes[pos++]);
-					nodeMaxY = Math.max(nodeMaxY, boxes[pos++]);
+		sort(hilbertValues, boxes, indices, 0, numItems - 1, nodeSize);
+		let pos = numItems * 4;
+		for (let i = 0, readPos = 0; i < levelBounds.length - 1; i++) {
+			const end = levelBounds[i];
+			while (readPos < end) {
+				const nodeIndex = readPos;
+				let nodeMinX = boxes[readPos++];
+				let nodeMinY = boxes[readPos++];
+				let nodeMaxX = boxes[readPos++];
+				let nodeMaxY = boxes[readPos++];
+				for (let j = 1; j < nodeSize && readPos < end; j++) {
+					nodeMinX = Math.min(nodeMinX, boxes[readPos++]);
+					nodeMinY = Math.min(nodeMinY, boxes[readPos++]);
+					nodeMaxX = Math.max(nodeMaxX, boxes[readPos++]);
+					nodeMaxY = Math.max(nodeMaxY, boxes[readPos++]);
 				}
-				this._indices[this._pos >> 2] = nodeIndex;
-				boxes[this._pos++] = nodeMinX;
-				boxes[this._pos++] = nodeMinY;
-				boxes[this._pos++] = nodeMaxX;
-				boxes[this._pos++] = nodeMaxY;
+				indices[pos >> 2] = nodeIndex;
+				boxes[pos++] = nodeMinX;
+				boxes[pos++] = nodeMinY;
+				boxes[pos++] = nodeMaxX;
+				boxes[pos++] = nodeMaxY;
 			}
 		}
+		this._pos = pos;
 	}
 	/**
 	* Search the index by a bounding box.
@@ -294,7 +301,7 @@ var Flatbush = class Flatbush {
 		while (nodeIndex !== void 0) {
 			const end = Math.min(nodeIndex + nodeSize * 4, levelBounds[level]);
 			const isNode = nodeIndex >= numItems4;
-			if (contained) this._collectContained(nodeIndex, end, level, isNode, q, results, filterFn);
+			if (contained) this._collectContained(nodeIndex, end, level, numItems4, results, filterFn);
 			else for (let pos = nodeIndex; pos < end; pos += 4) {
 				const x0 = boxes[pos];
 				if (maxX < x0) continue;
@@ -320,22 +327,26 @@ var Flatbush = class Flatbush {
 		return results;
 	}
 	/**
-	* Collect children of a node whose bbox is fully inside the query, skipping intersection tests.
+	* Collect all leaves of a subtree that's fully inside the query, skipping intersection tests.
+	* Because the tree is packed bottom-up, those leaves occupy one contiguous block of the leaf
+	* level, so we skip traversal entirely: descend to the first leaf, then sweep the flat range.
 	* @param {number} nodeIndex
 	* @param {number} end
 	* @param {number} level
-	* @param {boolean} isNode whether the children are tree nodes (vs leaf items)
-	* @param {number[]} q the traversal queue
+	* @param {number} numItems4
 	* @param {number[]} results
 	* @param {((index: number, x0: number, y0: number, x1: number, y1: number) => boolean) | undefined} filterFn
 	*/
-	_collectContained(nodeIndex, end, level, isNode, q, results, filterFn) {
+	_collectContained(nodeIndex, end, level, numItems4, results, filterFn) {
 		const boxes = this._boxes;
 		const indices = this._indices;
-		if (isNode) for (let pos = nodeIndex; pos < end; pos += 4) q.push(indices[pos >> 2] | 1, level - 1);
-		else for (let pos = nodeIndex; pos < end; pos += 4) {
+		let pos = nodeIndex;
+		for (let l = level; l > 0; l--) pos = indices[pos >> 2];
+		const leafEnd = Math.min(pos + (end - nodeIndex) * this.nodeSize ** level, numItems4);
+		if (filterFn === void 0) for (; pos < leafEnd; pos += 4) results.push(indices[pos >> 2] | 0);
+		else for (; pos < leafEnd; pos += 4) {
 			const index = indices[pos >> 2] | 0;
-			if (filterFn === void 0 || filterFn(index, boxes[pos], boxes[pos + 1], boxes[pos + 2], boxes[pos + 3])) results.push(index);
+			if (filterFn(index, boxes[pos], boxes[pos + 1], boxes[pos + 2], boxes[pos + 3])) results.push(index);
 		}
 	}
 	/**
@@ -354,11 +365,12 @@ var Flatbush = class Flatbush {
 		const nodeSize4 = nodeSize * 4;
 		const results = [];
 		const maxDistSquared = maxDistance * maxDistance;
+		const trackNearest = maxResults === 1;
+		let bound = maxDistSquared;
 		q.push(boxes.length - 4 << 1, 0);
 		while (q.length) {
 			const top = q.ids[0];
 			if (top & 1) {
-				if (q.values[0] > maxDistSquared) break;
 				q.pop();
 				results.push(top >> 1);
 				if (results.length === maxResults) break;
@@ -369,17 +381,20 @@ var Flatbush = class Flatbush {
 			const isLeafLevel = nodeIndex < numItems4;
 			const end = Math.min(nodeIndex + nodeSize4, upperBound(nodeIndex, levelBounds));
 			for (let pos = nodeIndex; pos < end; pos += 4) {
-				const childIndex = indices[pos >> 2] | 0;
 				const minX = boxes[pos];
 				const minY = boxes[pos + 1];
 				const maxX = boxes[pos + 2];
 				const maxY = boxes[pos + 3];
-				const dx = x < minX ? minX - x : x > maxX ? x - maxX : 0;
-				const dy = y < minY ? minY - y : y > maxY ? y - maxY : 0;
+				const dx = Math.max(Math.max(minX - x, x - maxX), 0);
+				const dy = Math.max(Math.max(minY - y, y - maxY), 0);
 				const dist = dx * dx + dy * dy;
-				if (dist > maxDistSquared) continue;
+				if (dist > bound) continue;
+				const childIndex = indices[pos >> 2] | 0;
 				if (isLeafLevel) {
-					if (filterFn === void 0 || filterFn(childIndex)) q.push(childIndex << 1 | 1, dist);
+					if (filterFn === void 0 || filterFn(childIndex)) {
+						q.push(childIndex << 1 | 1, dist);
+						if (trackNearest && dist < bound) bound = dist;
+					}
 				} else q.push(childIndex << 1, dist);
 			}
 		}

package/dist/{boolean2D-DcowIZPB.cjs → boolean2D-BJ6MwGgV.cjs}

@@ -1,10 +1,10 @@
 const require_vec3 = require("./vec3-CFwOI0ZI.cjs");
 const require_errors = require("./errors-CXJtc4I7.cjs");
 const require_arrayAccess = require("./arrayAccess-e4H9cBfh.cjs");
-const require_surfaceBuilders = require("./surfaceBuilders-DvpxHHIm.cjs");
-const require_blueprintSketcher = require("./blueprintSketcher-B7QRguA5.cjs");
-const require_helpers = require("./helpers-Bykw93Yc.cjs");
-const require_blueprint = require("./blueprint-BoK8H4Eq.cjs");
+const require_surfaceBuilders = require("./surfaceBuilders-CDrFrFBH.cjs");
+const require_blueprintSketcher = require("./blueprintSketcher-DwL9iPAG.cjs");
+const require_helpers = require("./helpers-BVwuuo7f.cjs");
+const require_blueprint = require("./blueprint-BhCha_8H.cjs");
 //#region src/2d/blueprints/cannedBlueprints.ts
 /**
 * Create a regular polygon blueprint inscribed in a circle of the given radius.

package/dist/{boolean2D-CZiGMjEF.js → boolean2D-DiQyJiA-.js}

@@ -1,10 +1,10 @@
 import { n as wasmIndex } from "./vec3-Dpha8d5k.js";
 import { R as unwrap, h as bug, s as safeIndex } from "./errors-DNWJsfVU.js";
 import { r as lastOrThrow } from "./arrayAccess-DrUGPADn.js";
-import { v as zip } from "./surfaceBuilders-BQx3TjMH.js";
-import { a as Blueprints, i as CompoundBlueprint, l as intersectCurves, r as organiseBlueprints, t as BlueprintSketcher, u as Flatbush } from "./blueprintSketcher-CIsOckAh.js";
-import { _ as samePoint$1, b as subtract2d, f as crossProduct2d, s as PRECISION_INTERSECTION } from "./helpers-mPnUPOIM.js";
-import { b as removeDuplicatePoints, f as make2dSegmentCurve, t as Blueprint } from "./blueprint-Dg3dsUal.js";
+import { v as zip } from "./surfaceBuilders-Cf3c00zK.js";
+import { a as Blueprints, i as CompoundBlueprint, l as intersectCurves, r as organiseBlueprints, t as BlueprintSketcher, u as Flatbush } from "./blueprintSketcher-B5XBXgri.js";
+import { _ as samePoint$1, b as subtract2d, f as crossProduct2d, s as PRECISION_INTERSECTION } from "./helpers-VUDxsMV6.js";
+import { b as removeDuplicatePoints, f as make2dSegmentCurve, t as Blueprint } from "./blueprint-Bqmxcyfd.js";
 //#region src/2d/blueprints/cannedBlueprints.ts
 /**
 * Create a regular polygon blueprint inscribed in a circle of the given radius.

package/dist/brepjs.cjs

@@ -1,37 +1,37 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_textBlueprints = require("./textBlueprints-BXfjcyoe.cjs");
-const require_shapeTypes = require("./shapeTypes-DwNTiXjG.cjs");
+const require_textBlueprints = require("./textBlueprints-ypK-L96F.cjs");
+const require_shapeTypes = require("./shapeTypes-DplVM8Fy.cjs");
 const require_occtWasmAdapter = require("./occtWasmAdapter-Bv2OTOX9.cjs");
 const require_vec3 = require("./vec3-CFwOI0ZI.cjs");
 const require_errors = require("./errors-CXJtc4I7.cjs");
-const require_topologyQueryFns = require("./topologyQueryFns-a2i0YhGF.cjs");
+const require_topologyQueryFns = require("./topologyQueryFns-Dzw_tis6.cjs");
 const require_constants = require("./constants-BOVyEYGH.cjs");
 const require_types = require("./types-KjA8tY4Y.cjs");
 const require_vecOps = require("./vecOps-CCnJt-yH.cjs");
 const require_planeOps = require("./planeOps-BA4HfgQu.cjs");
-const require_faceFns = require("./faceFns-DSdVqqVP.cjs");
-const require_shapeFns = require("./shapeFns-CqYYHFqr.cjs");
-const require_curveFns = require("./curveFns-D3k8aHIE.cjs");
-const require_meshFns = require("./meshFns-Cv-_-nIL.cjs");
+const require_faceFns = require("./faceFns-DrBS1FKx.cjs");
+const require_shapeFns = require("./shapeFns-eQx9e6lo.cjs");
+const require_curveFns = require("./curveFns-DwBW-FmM.cjs");
+const require_meshFns = require("./meshFns-DoqRG8XQ.cjs");
 const require_arrayAccess = require("./arrayAccess-e4H9cBfh.cjs");
-const require_surfaceBuilders = require("./surfaceBuilders-DvpxHHIm.cjs");
-const require_solidBuilders = require("./solidBuilders-DtK5cc9v.cjs");
-const require_healingFns = require("./healingFns-CRH5H0ik.cjs");
-const require_threadFns = require("./threadFns-p7X2MRCA.cjs");
-const require_blueprintSketcher = require("./blueprintSketcher-B7QRguA5.cjs");
-const require_helpers = require("./helpers-Bykw93Yc.cjs");
-const require_drawFns = require("./drawFns-C6K03snv.cjs");
-const require_measureFns = require("./measureFns-BtPAmRfH.cjs");
-const require_cornerFinder = require("./cornerFinder-C83MpPRk.cjs");
-const require_boolean2D = require("./boolean2D-DcowIZPB.cjs");
-const require_blueprintFns = require("./blueprintFns-C3F0jZOe.cjs");
-const require_importFns = require("./importFns-Nlx1v8IF.cjs");
-const require_loftFns = require("./loftFns-CyrWJCXb.cjs");
-const require_cameraFns = require("./cameraFns-IL7qYFaG.cjs");
-const require_textMetrics = require("./textMetrics-DRo8iTiW.cjs");
-const require_shapeRefFns = require("./shapeRefFns-9Fexl5XC.cjs");
+const require_surfaceBuilders = require("./surfaceBuilders-CDrFrFBH.cjs");
+const require_solidBuilders = require("./solidBuilders-DI4CSKe-.cjs");
+const require_healingFns = require("./healingFns-CA_Pxs_R.cjs");
+const require_threadFns = require("./threadFns-CvjUrsgG.cjs");
+const require_blueprintSketcher = require("./blueprintSketcher-DwL9iPAG.cjs");
+const require_helpers = require("./helpers-BVwuuo7f.cjs");
+const require_drawFns = require("./drawFns-BDPAuKxN.cjs");
+const require_measureFns = require("./measureFns-CMzOaAYQ.cjs");
+const require_cornerFinder = require("./cornerFinder-DyYE74wI.cjs");
+const require_boolean2D = require("./boolean2D-BJ6MwGgV.cjs");
+const require_blueprintFns = require("./blueprintFns-DKmyNVyL.cjs");
+const require_importFns = require("./importFns-D7CBrzdj.cjs");
+const require_loftFns = require("./loftFns-BG5aCsSy.cjs");
+const require_cameraFns = require("./cameraFns-BjcKjYpw.cjs");
+const require_textMetrics = require("./textMetrics-CMXyoBtR.cjs");
+const require_shapeRefFns = require("./shapeRefFns-D1WVYLvG.cjs");
 const require_workerHandler = require("./workerHandler-CdlOTwJg.cjs");
-const require_primitiveFns = require("./primitiveFns-BDQodKI0.cjs");
+const require_primitiveFns = require("./primitiveFns-jeA2auqw.cjs");
 //#region src/topology/shapeBooleans.ts
 var BOPAlgo_GlueShift = 1;
 var BOPAlgo_GlueFull = 2;