brepjs 18.82.5 → 18.82.7

package/dist/2d.cjs

@@ -1,11 +1,11 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_shapeTypes = require("./shapeTypes-D1eUDuzl.cjs");
+const require_shapeTypes = require("./shapeTypes-DpDcMU0a.cjs");
 const require_errors = require("./errors-CXJtc4I7.cjs");
-const require_topologyQueryFns = require("./topologyQueryFns-Nnu56Ke2.cjs");
-const require_blueprintSketcher = require("./blueprintSketcher-CFa32JZU.cjs");
-const require_blueprint = require("./blueprint-BBUOweQy.cjs");
-const require_boolean2D = require("./boolean2D-Z0KE98a4.cjs");
-const require_blueprintFns = require("./blueprintFns-CRES_5vP.cjs");
+const require_topologyQueryFns = require("./topologyQueryFns-imRz9gK2.cjs");
+const require_blueprintSketcher = require("./blueprintSketcher-NDZKJGYh.cjs");
+const require_blueprint = require("./blueprint-lbpshPPC.cjs");
+const require_boolean2D = require("./boolean2D-Dzs9Vkjv.cjs");
+const require_blueprintFns = require("./blueprintFns-Nl1hnrJX.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-D4Evnmz_.js";
+import { B as createKernelHandle, Q as getKernel2D, a as createEdge } from "./shapeTypes-Caa9T1VR.js";
 import { A as ok, b as err, d as validationError, t as BrepErrorCode } from "./errors-DNWJsfVU.js";
-import { w as kernelCallRaw } from "./topologyQueryFns-5EeBz6_7.js";
-import { a as Blueprints, i as CompoundBlueprint, r as organiseBlueprints } from "./blueprintSketcher-CIydRzRr.js";
-import { _ as Curve2D, t as Blueprint, y as BoundingBox2d } from "./blueprint-DjzevNhB.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-BRWPIJhe.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-CxSMnMfl.js";
+import { w as kernelCallRaw } from "./topologyQueryFns-CR7zQvDK.js";
+import { a as Blueprints, i as CompoundBlueprint, r as organiseBlueprints } from "./blueprintSketcher-DzCTWt_f.js";
+import { _ as Curve2D, t as Blueprint, y as BoundingBox2d } from "./blueprint-DmvnSTKs.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-DGtpfl2g.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-Bhmqz0_E.js";
 //#region src/core/curve2dHandle.ts
 /**
 * Wrap a raw kernel 2D curve handle with brand + disposal tracking.

package/dist/{blueprint-DjzevNhB.js → blueprint-DmvnSTKs.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-D4Evnmz_.js";
+import { G as unregisterFromCleanup, Q as getKernel2D, U as registerForCleanup, Z as getKernel, a as createEdge, u as createWire } from "./shapeTypes-Caa9T1VR.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-BO8IXhhf.js";
-import { p as getOrientation } from "./curveFns-XSz4F9j3.js";
+import { _ as cast, h as uvCoordinates, i as faceGeomType, m as uvBounds, r as faceCenter } from "./faceFns-hGTQhRXB.js";
+import { p as getOrientation } from "./curveFns-XRM_FMU4.js";
 import { n as getAtOrThrow, r as lastOrThrow, t as firstOrThrow } from "./arrayAccess-DrUGPADn.js";
-import { r as makeFace } from "./surfaceBuilders-CLMyFimy.js";
-import { _ as samePoint, b as subtract2d, l as add2d, o as normalize2d, p as distance2d, t as getSingleFace, v as scalarMultiply2d } from "./helpers-CTc8ZbY8.js";
+import { r as makeFace } from "./surfaceBuilders-BDEc8WSE.js";
+import { _ as samePoint, b as subtract2d, l as add2d, o as normalize2d, p as distance2d, t as getSingleFace, v as scalarMultiply2d } from "./helpers-DOE4GlZ0.js";
 //#region src/2d/lib/definitions.ts
 /** Type guard that checks whether a value is a `Point2D`. */
 function isPoint2D(point) {
@@ -587,7 +587,7 @@ var transformCurves = (curves, transformation) => {
 };
 /** Create a 2D affinity (non-uniform scale) transformation along a direction. */
 var stretchTransform2d = (ratio, direction, origin = [0, 0]) => {
-	return getKernel().createAffinityGTrsf2d(origin[0], origin[1], direction[0], direction[1], ratio);
+	return getKernel().createAffinityGTrsf2d(origin[0], origin[1], -direction[1], direction[0], ratio);
 };
 /** Create a 2D translation transformation. */
 var translationTransform2d = (translation) => {
@@ -626,7 +626,7 @@ function curvesAsEdgesOnFace(curves, face, scale = "original") {
 		const cylData = kernel.getSurfaceCylinderData(geomSurf);
 		if (!cylData) return err(validationError("UNSUPPORTED_FACE_TYPE", "Could not extract cylinder data from face surface"));
 		if (!cylData.isDirect) geomSurf = kernel.reverseSurfaceU(geomSurf);
-		transformation = stretchTransform2d(1 / cylData.radius, [0, 1]);
+		transformation = stretchTransform2d(1 / cylData.radius, [1, 0]);
 	}
 	if (scale === "bounds") {
 		transformation = kernel.createIdentityGTrsf2d();

package/dist/{blueprint-BBUOweQy.cjs → blueprint-lbpshPPC.cjs}

@@ -1,14 +1,14 @@
-const require_shapeTypes = require("./shapeTypes-D1eUDuzl.cjs");
+const require_shapeTypes = require("./shapeTypes-DpDcMU0a.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-6AarivqH.cjs");
-const require_curveFns = require("./curveFns-BA5zsoce.cjs");
+const require_faceFns = require("./faceFns-B3bYfnGX.cjs");
+const require_curveFns = require("./curveFns-CJWxgcHu.cjs");
 const require_arrayAccess = require("./arrayAccess-e4H9cBfh.cjs");
-const require_surfaceBuilders = require("./surfaceBuilders-R4DKNFkI.cjs");
-const require_helpers = require("./helpers-DN6s-TLC.cjs");
+const require_surfaceBuilders = require("./surfaceBuilders-5hLC_QeE.cjs");
+const require_helpers = require("./helpers-D6yNdVOO.cjs");
 //#region src/2d/lib/definitions.ts
 /** Type guard that checks whether a value is a `Point2D`. */
 function isPoint2D(point) {
@@ -587,7 +587,7 @@ var transformCurves = (curves, transformation) => {
 };
 /** Create a 2D affinity (non-uniform scale) transformation along a direction. */
 var stretchTransform2d = (ratio, direction, origin = [0, 0]) => {
-	return require_shapeTypes.getKernel().createAffinityGTrsf2d(origin[0], origin[1], direction[0], direction[1], ratio);
+	return require_shapeTypes.getKernel().createAffinityGTrsf2d(origin[0], origin[1], -direction[1], direction[0], ratio);
 };
 /** Create a 2D translation transformation. */
 var translationTransform2d = (translation) => {
@@ -626,7 +626,7 @@ function curvesAsEdgesOnFace(curves, face, scale = "original") {
 		const cylData = kernel.getSurfaceCylinderData(geomSurf);
 		if (!cylData) return require_errors.err(require_errors.validationError("UNSUPPORTED_FACE_TYPE", "Could not extract cylinder data from face surface"));
 		if (!cylData.isDirect) geomSurf = kernel.reverseSurfaceU(geomSurf);
-		transformation = stretchTransform2d(1 / cylData.radius, [0, 1]);
+		transformation = stretchTransform2d(1 / cylData.radius, [1, 0]);
 	}
 	if (scale === "bounds") {
 		transformation = kernel.createIdentityGTrsf2d();

package/dist/{blueprintFns-CxSMnMfl.js → blueprintFns-Bhmqz0_E.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-CIydRzRr.js";
-import { t as Blueprint } from "./blueprint-DjzevNhB.js";
+import { i as CompoundBlueprint } from "./blueprintSketcher-DzCTWt_f.js";
+import { t as Blueprint } from "./blueprint-DmvnSTKs.js";
 //#region src/2d/lib/curve2dFns.ts
 /**
 * Return a reversed copy of the curve (non-mutating).

package/dist/{blueprintFns-CRES_5vP.cjs → blueprintFns-Nl1hnrJX.cjs}

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

package/dist/{blueprintSketcher-CIydRzRr.js → blueprintSketcher-DzCTWt_f.js}

@@ -1,18 +1,36 @@
-import { Q as getKernel2D, Z as getKernel } from "./shapeTypes-D4Evnmz_.js";
+import { Q as getKernel2D, Z as getKernel } from "./shapeTypes-Caa9T1VR.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-CTc8ZbY8.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-DjzevNhB.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-DOE4GlZ0.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-DmvnSTKs.js";
 //#region node_modules/flatqueue/index.js
-/** @template T */
+/**
+* @typedef {Float64ArrayConstructor | Float32ArrayConstructor |
+*   Uint32ArrayConstructor | Int32ArrayConstructor | Uint16ArrayConstructor |
+*   Int16ArrayConstructor | Uint8ArrayConstructor | Int8ArrayConstructor} TypedArrayConstructor
+*/
+/** @template [T=number] */
 var FlatQueue = class {
-	constructor() {
-		/** @type T[] */
-		this.ids = [];
-		/** @type number[] */
-		this.values = [];
+	/**
+	* Creates an empty queue. If `capacity` is provided, the queue is backed by fixed-size typed
+	* arrays for better performance and memory use, but can't grow beyond `capacity`. `values` uses
+	* `ValuesArray` (default `Float64Array`) and `ids` uses `IdsArray` (default `Uint32Array`); pass
+	* narrower constructors like `Uint16Array` if your values or ids are known to fit them.
+	*
+	* @param {number} [capacity]
+	* @param {TypedArrayConstructor} [ValuesArray]
+	* @param {TypedArrayConstructor} [IdsArray]
+	*/
+	constructor(capacity = Infinity, ValuesArray = Float64Array, IdsArray = Uint32Array) {
+		const fixed = capacity !== Infinity;
+		/** @type {T[]} */
+		this.ids = fixed ? new IdsArray(capacity) : [];
+		/** @type {number[]} */
+		this.values = fixed ? new ValuesArray(capacity) : [];
+		/** Maximum number of items the queue can hold; `Infinity` for regular-array queues, which grow on demand. */
+		this.capacity = capacity;
 		/** Number of items in the queue. */
 		this.length = 0;
 	}
@@ -26,10 +44,13 @@ var FlatQueue = class {
 	* `priority` must be a number. Items are sorted and returned from low to high priority. Multiple items
 	* with the same priority value can be added to the queue, but there is no guaranteed order between these items.
 	*
+	* For fixed-capacity queues, throws a `RangeError` if the queue is already full.
+	*
 	* @param {T} item
 	* @param {number} priority
 	*/
 	push(item, priority) {
+		if (this.length === this.capacity) throw new RangeError("Queue is at capacity.");
 		let pos = this.length++;
 		while (pos > 0) {
 			const parent = pos - 1 >> 1;
@@ -80,14 +101,15 @@ var FlatQueue = class {
 		return this.length > 0 ? this.values[0] : void 0;
 	}
 	/**
-	* Shrinks the internal arrays to `this.length`.
+	* Shrinks the internal arrays to `this.length`. No-op for queues with fixed capacity.
 	*
 	* `pop()` and `clear()` calls don't free memory automatically to avoid unnecessary resize operations.
 	* This also means that items that have been added to the queue can't be garbage collected until
 	* a new item is pushed in their place, or this method is called.
 	*/
 	shrink() {
-		this.ids.length = this.values.length = this.length;
+		if (Array.isArray(this.ids)) this.ids.length = this.length;
+		if (Array.isArray(this.values)) this.values.length = this.length;
 	}
 };
 //#endregion
@@ -105,6 +127,7 @@ var ARRAY_TYPES = [
 ];
 var VERSION = 3;
 /** @typedef {Int8ArrayConstructor | Uint8ArrayConstructor | Uint8ClampedArrayConstructor | Int16ArrayConstructor | Uint16ArrayConstructor | Int32ArrayConstructor | Uint32ArrayConstructor | Float32ArrayConstructor | Float64ArrayConstructor} TypedArrayConstructor */
+/** @typedef {Int8Array | Uint8Array | Uint8ClampedArray | Int16Array | Uint16Array | Int32Array | Uint32Array | Float32Array | Float64Array} TypedArray */
 var Flatbush = class Flatbush {
 	/**
 	* Recreate a Flatbush index from raw `ArrayBuffer` or `SharedArrayBuffer` data.
@@ -114,7 +137,7 @@ var Flatbush = class Flatbush {
 	*/
 	static from(data, byteOffset = 0) {
 		if (byteOffset % 8 !== 0) throw new Error("byteOffset must be 8-byte aligned.");
-		if (!data || data.byteLength === void 0 || data.buffer) throw new Error("Data must be an instance of ArrayBuffer or SharedArrayBuffer.");
+		if (!data || data.byteLength === void 0 || "buffer" in data) throw new Error("Data must be an instance of ArrayBuffer or SharedArrayBuffer.");
 		const [magic, versionAndType] = new Uint8Array(data, byteOffset + 0, 2);
 		if (magic !== 251) throw new Error("Data does not appear to be in a Flatbush format.");
 		const version = versionAndType >> 4;
@@ -153,10 +176,14 @@ var Flatbush = class Flatbush {
 		const arrayTypeIndex = ARRAY_TYPES.indexOf(ArrayType);
 		const nodesByteSize = numNodes * 4 * ArrayType.BYTES_PER_ELEMENT;
 		if (arrayTypeIndex < 0) throw new Error(`Unexpected typed array class: ${ArrayType}.`);
+		/** @type {new(b: ArrayBufferLike, o: number, l: number) => TypedArray} */
+		const BoxCtor = ArrayType;
+		/** @type {new(b: ArrayBufferLike, o: number, l: number) => Uint16Array | Uint32Array} */
+		const IdxCtor = this.IndexArrayType;
 		if (data) {
 			this.data = data;
-			this._boxes = new ArrayType(data, byteOffset + 8, numNodes * 4);
-			this._indices = new this.IndexArrayType(data, byteOffset + 8 + nodesByteSize, numNodes);
+			this._boxes = new BoxCtor(data, byteOffset + 8, numNodes * 4);
+			this._indices = new IdxCtor(data, byteOffset + 8 + nodesByteSize, numNodes);
 			this._pos = numNodes * 4;
 			this.minX = this._boxes[this._pos - 4];
 			this.minY = this._boxes[this._pos - 3];
@@ -164,8 +191,8 @@ var Flatbush = class Flatbush {
 			this.maxY = this._boxes[this._pos - 1];
 		} else {
 			const data = this.data = new ArrayBufferType(8 + nodesByteSize + numNodes * this.IndexArrayType.BYTES_PER_ELEMENT);
-			this._boxes = new ArrayType(data, 8, numNodes * 4);
-			this._indices = new this.IndexArrayType(data, 8 + nodesByteSize, numNodes);
+			this._boxes = new BoxCtor(data, 8, numNodes * 4);
+			this._indices = new IdxCtor(data, 8 + nodesByteSize, numNodes);
 			this._pos = 0;
 			this.minX = Infinity;
 			this.minY = Infinity;
@@ -213,7 +240,7 @@ var Flatbush = class Flatbush {
 		}
 		const width = this.maxX - this.minX || 1;
 		const height = this.maxY - this.minY || 1;
-		const hilbertValues = new Uint32Array(this.numItems);
+		const hilbertValues = new Int32Array(this.numItems);
 		const hilbertMax = 65535;
 		for (let i = 0, pos = 0; i < this.numItems; i++) {
 			const minX = boxes[pos++];
@@ -256,30 +283,62 @@ var Flatbush = class Flatbush {
 	*/
 	search(minX, minY, maxX, maxY, filterFn) {
 		if (this._pos !== this._boxes.length) throw new Error("Data not yet indexed - call index.finish().");
+		const { _boxes: boxes, _levelBounds: levelBounds, _indices: indices, nodeSize } = this;
+		const numItems4 = this.numItems * 4;
 		/** @type number | undefined */
-		let nodeIndex = this._boxes.length - 4;
-		const queue = [];
+		let nodeIndex = boxes.length - 4;
+		let level = levelBounds.length - 1;
+		const q = [];
 		const results = [];
+		let contained = false;
 		while (nodeIndex !== void 0) {
-			const end = Math.min(nodeIndex + this.nodeSize * 4, upperBound(nodeIndex, this._levelBounds));
-			for (let pos = nodeIndex; pos < end; pos += 4) {
-				const x0 = this._boxes[pos];
+			const end = Math.min(nodeIndex + nodeSize * 4, levelBounds[level]);
+			const isNode = nodeIndex >= numItems4;
+			if (contained) this._collectContained(nodeIndex, end, level, isNode, q, results, filterFn);
+			else for (let pos = nodeIndex; pos < end; pos += 4) {
+				const x0 = boxes[pos];
 				if (maxX < x0) continue;
-				const y0 = this._boxes[pos + 1];
+				const y0 = boxes[pos + 1];
 				if (maxY < y0) continue;
-				const x1 = this._boxes[pos + 2];
+				const x1 = boxes[pos + 2];
 				if (minX > x1) continue;
-				const y1 = this._boxes[pos + 3];
+				const y1 = boxes[pos + 3];
 				if (minY > y1) continue;
-				const index = this._indices[pos >> 2] | 0;
-				if (nodeIndex >= this.numItems * 4) queue.push(index);
-				else if (filterFn === void 0 || filterFn(index, x0, y0, x1, y1)) results.push(index);
+				const index = indices[pos >> 2] | 0;
+				if (isNode) {
+					const c = +(minX <= x0 && minY <= y0 && maxX >= x1 && maxY >= y1);
+					q.push(index | c, level - 1);
+				} else if (filterFn === void 0 || filterFn(index, x0, y0, x1, y1)) results.push(index);
+			}
+			level = q.pop();
+			nodeIndex = q.pop();
+			if (nodeIndex !== void 0) {
+				contained = (nodeIndex & 1) === 1;
+				nodeIndex &= -2;
 			}
-			nodeIndex = queue.pop();
 		}
 		return results;
 	}
 	/**
+	* Collect children of a node whose bbox is fully inside the query, skipping intersection tests.
+	* @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[]} results
+	* @param {((index: number, x0: number, y0: number, x1: number, y1: number) => boolean) | undefined} filterFn
+	*/
+	_collectContained(nodeIndex, end, level, isNode, q, 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) {
+			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);
+		}
+	}
+	/**
 	* Search items in order of distance from the given point.
 	* @param {number} x
 	* @param {number} y
@@ -290,32 +349,39 @@ var Flatbush = class Flatbush {
 	*/
 	neighbors(x, y, maxResults = Infinity, maxDistance = Infinity, filterFn) {
 		if (this._pos !== this._boxes.length) throw new Error("Data not yet indexed - call index.finish().");
-		/** @type number | undefined */
-		let nodeIndex = this._boxes.length - 4;
-		const q = this._queue;
+		const { _boxes: boxes, _levelBounds: levelBounds, _indices: indices, _queue: q, nodeSize } = this;
+		const numItems4 = this.numItems * 4;
+		const nodeSize4 = nodeSize * 4;
 		const results = [];
 		const maxDistSquared = maxDistance * maxDistance;
-		outer: while (nodeIndex !== void 0) {
-			const end = Math.min(nodeIndex + this.nodeSize * 4, upperBound(nodeIndex, this._levelBounds));
+		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;
+				continue;
+			}
+			q.pop();
+			const nodeIndex = top >> 1;
+			const isLeafLevel = nodeIndex < numItems4;
+			const end = Math.min(nodeIndex + nodeSize4, upperBound(nodeIndex, levelBounds));
 			for (let pos = nodeIndex; pos < end; pos += 4) {
-				const index = this._indices[pos >> 2] | 0;
-				const minX = this._boxes[pos];
-				const minY = this._boxes[pos + 1];
-				const maxX = this._boxes[pos + 2];
-				const maxY = this._boxes[pos + 3];
+				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 dist = dx * dx + dy * dy;
 				if (dist > maxDistSquared) continue;
-				if (nodeIndex >= this.numItems * 4) q.push(index << 1, dist);
-				else if (filterFn === void 0 || filterFn(index)) q.push((index << 1) + 1, dist);
-			}
-			while (q.length && q.peek() & 1) {
-				if (q.peekValue() > maxDistSquared) break outer;
-				results.push(q.pop() >> 1);
-				if (results.length === maxResults) break outer;
+				if (isLeafLevel) {
+					if (filterFn === void 0 || filterFn(childIndex)) q.push(childIndex << 1 | 1, dist);
+				} else q.push(childIndex << 1, dist);
 			}
-			nodeIndex = q.length ? q.pop() >> 1 : void 0;
 		}
 		q.clear();
 		return results;
@@ -338,8 +404,8 @@ function upperBound(value, arr) {
 }
 /**
 * Custom quicksort that partially sorts bbox data alongside the hilbert values.
-* @param {Uint32Array} values
-* @param {InstanceType<TypedArrayConstructor>} boxes
+* @param {Int32Array} values
+* @param {TypedArray} boxes
 * @param {Uint16Array | Uint32Array} indices
 * @param {number} left
 * @param {number} right
@@ -372,8 +438,8 @@ function sort(values, boxes, indices, left, right, nodeSize) {
 }
 /**
 * Swap two values and two corresponding boxes.
-* @param {Uint32Array} values
-* @param {InstanceType<TypedArrayConstructor>} boxes
+* @param {Int32Array} values
+* @param {TypedArray} boxes
 * @param {Uint16Array | Uint32Array} indices
 * @param {number} i
 * @param {number} j
@@ -413,43 +479,31 @@ function hilbert(x, y) {
 	let d = x & (y ^ 65535);
 	let A = a | b >> 1;
 	let B = a >> 1 ^ a;
-	let C = c >> 1 ^ b & d >> 1 ^ c;
-	let D = a & c >> 1 ^ d >> 1 ^ d;
-	a = A;
-	b = B;
-	c = C;
-	d = D;
-	A = a & a >> 2 ^ b & b >> 2;
-	B = a & b >> 2 ^ b & (a ^ b) >> 2;
-	C ^= a & c >> 2 ^ b & d >> 2;
-	D ^= b & c >> 2 ^ (a ^ b) & d >> 2;
-	a = A;
-	b = B;
-	c = C;
-	d = D;
+	let C = c ^ (c >> 1 ^ b & d >> 1);
+	let D = d ^ (a & c >> 1 ^ d >> 1);
+	a = A & A >> 2 ^ B & B >> 2;
+	b = A & B >> 2 ^ B & (A ^ B) >> 2;
+	c = C ^ (A & C >> 2 ^ B & D >> 2);
+	d = D ^ (B & C >> 2 ^ (A ^ B) & D >> 2);
 	A = a & a >> 4 ^ b & b >> 4;
 	B = a & b >> 4 ^ b & (a ^ b) >> 4;
-	C ^= a & c >> 4 ^ b & d >> 4;
-	D ^= b & c >> 4 ^ (a ^ b) & d >> 4;
-	a = A;
-	b = B;
-	c = C;
-	d = D;
-	C ^= a & c >> 8 ^ b & d >> 8;
-	D ^= b & c >> 8 ^ (a ^ b) & d >> 8;
-	a = C ^ C >> 1;
-	b = D ^ D >> 1;
-	let i0 = x ^ y;
-	let i1 = b | 65535 ^ (i0 | a);
-	i0 = (i0 | i0 << 8) & 16711935;
-	i0 = (i0 | i0 << 4) & 252645135;
-	i0 = (i0 | i0 << 2) & 858993459;
-	i0 = (i0 | i0 << 1) & 1431655765;
-	i1 = (i1 | i1 << 8) & 16711935;
-	i1 = (i1 | i1 << 4) & 252645135;
-	i1 = (i1 | i1 << 2) & 858993459;
-	i1 = (i1 | i1 << 1) & 1431655765;
-	return (i1 << 1 | i0) >>> 0;
+	C = c ^ (a & c >> 4 ^ b & d >> 4);
+	D = d ^ (b & c >> 4 ^ (a ^ b) & d >> 4);
+	c = C ^ (A & C >> 8 ^ B & D >> 8);
+	d = D ^ (B & C >> 8 ^ (A ^ B) & D >> 8);
+	c ^= c >> 1;
+	d ^= d >> 1;
+	a = x ^ y;
+	b = d | 65535 ^ (a | c);
+	a = (a | a << 8) & 16711935;
+	a = (a | a << 4) & 252645135;
+	a = (a | a << 2) & 858993459;
+	a = (a | a << 1) & 1431655765;
+	b = (b | b << 8) & 16711935;
+	b = (b | b << 4) & 252645135;
+	b = (b | b << 2) & 858993459;
+	b = (b | b << 1) & 1431655765;
+	return ((b << 1 | a) >>> 0) - 2147483648;
 }
 //#endregion
 //#region src/2d/lib/intersections.ts