@mark1russell7/highways 0.5.1 → 0.7.0

package/build/index.js

@@ -26872,19 +26872,6 @@ function formatActivation(report, candidates) {
 	].join("\n") + "\n";
 }
 // src/bench/exact/index.ts
-/** This function gives the shortest distance from `start` to each node, with Dijkstra on an adjacency list. */
-function distances(adj, start) {
-	const d = new Float64Array(adj.length).fill(Infinity);
-	d[start] = 0;
-	const done = new Uint8Array(adj.length);
-	for (;;) {
-		let u = -1;
-		for (let i = 0; i < adj.length; i++) if (!done[i] && d[i] < Infinity && (u < 0 || d[i] < d[u])) u = i;
-		if (u < 0) return d;
-		done[u] = 1;
-		for (const { to, len } of adj[u]) if (d[u] + len < d[to]) d[to] = d[u] + len;
-	}
-}
 /** This function makes the network of the exact model for the edges of a graph. */
 function exactNetwork(graph, o) {
 	const finder = new WayFinder(graph.nodes, {
@@ -26947,33 +26934,155 @@ function exactNetwork(graph, o) {
 		margin: finder.margin
 	};
 }
+/** A binary heap of node indexes by a key, smallest first. A node can be in the heap more than one time. The search skips an old entry. */
+var NodeHeap = class {
+	#key = /* @__PURE__ */ new Float64Array(64);
+	#node = /* @__PURE__ */ new Int32Array(64);
+	size = 0;
+	push(key, node) {
+		if (this.size === this.#key.length) {
+			const k = new Float64Array(2 * this.size);
+			k.set(this.#key);
+			this.#key = k;
+			const n = new Int32Array(2 * this.size);
+			n.set(this.#node);
+			this.#node = n;
+		}
+		const keys = this.#key;
+		const nodes = this.#node;
+		let i = this.size++;
+		while (i > 0) {
+			const up = i - 1 >> 1;
+			if (keys[up] <= key) break;
+			keys[i] = keys[up];
+			nodes[i] = nodes[up];
+			i = up;
+		}
+		keys[i] = key;
+		nodes[i] = node;
+	}
+	/** This method removes the node with the smallest key, and gives it. */
+	pop() {
+		const keys = this.#key;
+		const nodes = this.#node;
+		const top = nodes[0];
+		const n = --this.size;
+		const key = keys[n];
+		const node = nodes[n];
+		let i = 0;
+		for (;;) {
+			let c = 2 * i + 1;
+			if (c >= n) break;
+			if (c + 1 < n && keys[c + 1] < keys[c]) c++;
+			if (keys[c] >= key) break;
+			keys[i] = keys[c];
+			nodes[i] = nodes[c];
+			i = c;
+		}
+		keys[i] = key;
+		nodes[i] = node;
+		return top;
+	}
+};
 /**
-* This function gives the stretch of each route as the exact model counts it, by the edge id.
-* The stretch of a route is its length without its two plug ends, divided by the shortest way in the network of the model.
-* The function builds the network one time. The result function then measures each list of routes of the graph, so a portfolio pays for the network once.
-* An edge without a route or without a way in the network has no value.
+* This function gives the shortest distance from `start` to each node of `targets` (A*). The search stops when it has each target.
+* The guide is the straight distance to the nearest target. Each link is a straight line, so the guide is not above the true distance at any time.
+* Thus the distances are the distances of Dijkstra. Only the order of the search changes.
+* A target that the search cannot reach gets `Infinity`.
 */
-function exactStretches(graph, o = {}) {
-	const { adj, ends, margin } = exactNetwork(graph, o);
-	const best = /* @__PURE__ */ new Map();
-	const from = (a) => {
-		if (!best.has(a)) best.set(a, distances(adj, a));
-		return best.get(a);
-	};
+function distancesTo(points, adj, start, targets) {
+	const d = new Float64Array(adj.length).fill(Infinity);
+	const done = new Uint8Array(adj.length);
+	const goal = new Set(targets);
+	const ends = targets.map((t) => points[t]);
+	const guide = (v) => {
+		let h = Infinity;
+		for (const t of ends) h = Math.min(h, dist(points[v], t));
+		return h;
+	};
+	const heap = new NodeHeap();
+	d[start] = 0;
+	heap.push(guide(start), start);
+	let left = goal.size;
+	while (heap.size > 0 && left > 0) {
+		const u = heap.pop();
+		if (done[u]) continue;
+		done[u] = 1;
+		if (goal.has(u)) left--;
+		for (const { to, len } of adj[u]) {
+			const nd = d[u] + len;
+			if (nd < d[to]) {
+				d[to] = nd;
+				done[to] = 0;
+				heap.push(nd + guide(to), to);
+			}
+		}
+	}
+	return new Map(targets.map((t) => [t, d[t]]));
+}
+/**
+* This function gives the shortest distance in the network between the two end points of each edge, by the pair `a,b` of the end points.
+* The distance does not depend on the direction, so one search serves each edge between the same two points.
+* An end point of many edges starts one search to all its other end points. The function starts the searches from the end points with the most edges first.
+*/
+function pairDistances(network) {
+	const pairKey = (a, b) => a < b ? `${a},${b}` : `${b},${a}`;
+	const partners = /* @__PURE__ */ new Map();
+	const open = /* @__PURE__ */ new Set();
+	for (const e of network.ends) {
+		if (e.a === e.b) continue;
+		const k = pairKey(e.a, e.b);
+		if (open.has(k)) continue;
+		open.add(k);
+		for (const [u, v] of [[e.a, e.b], [e.b, e.a]]) {
+			if (!partners.has(u)) partners.set(u, /* @__PURE__ */ new Set());
+			partners.get(u).add(v);
+		}
+	}
+	const out = /* @__PURE__ */ new Map();
+	const order = [...partners.keys()].sort((u, v) => partners.get(v).size - partners.get(u).size || u - v);
+	for (const u of order) {
+		const targets = [...partners.get(u)].filter((v) => open.has(pairKey(u, v)));
+		if (targets.length === 0) continue;
+		for (const [v, len] of distancesTo(network.points, network.adj, u, targets)) {
+			const k = pairKey(u, v);
+			out.set(k, len);
+			open.delete(k);
+		}
+	}
+	return out;
+}
+/** This function gives the function of the stretch of each route of the graph, from the network and the shortest distance of each edge. */
+function stretchesOf(network, best) {
 	return (routes) => {
 		const byEdge = new Map(routes.map((r) => [r.edge, r]));
 		const out = /* @__PURE__ */ new Map();
-		for (const e of ends) {
+		for (const e of network.ends) {
 			const r = byEdge.get(e.edge.id);
 			if (!r || r.points.length < 2 || e.a === e.b) continue;
-			const b = from(e.a)[e.b];
+			const b = best(e);
 			if (!Number.isFinite(b) || b <= 1) continue;
-			out.set(e.edge.id, (polylineLength(r.points) - 2 * margin) / b);
+			out.set(e.edge.id, (polylineLength(r.points) - 2 * network.margin) / b);
 		}
 		return out;
 	};
 }
 /**
+* This function gives the stretch of each route as the exact model counts it, by the edge id.
+* The stretch of a route is its length without its two plug ends, divided by the shortest way in the network of the model.
+* The function builds the network one time. The result function then measures each list of routes of the graph, so a portfolio pays for the network once.
+* The first call finds the shortest ways with one A* search for each end point with edges (PORTFOLIO-SPEED). The later calls use them again.
+* An edge without a route or without a way in the network has no value.
+*/
+function exactStretches(graph, o = {}) {
+	const network = exactNetwork(graph, o);
+	let best;
+	return stretchesOf(network, (e) => {
+		best ??= pairDistances(network);
+		return best.get(e.a < e.b ? `${e.a},${e.b}` : `${e.b},${e.a}`) ?? Infinity;
+	});
+}
+/**
 * This function gives the largest stretch of routes as the exact model counts it (`exactStretches`).
 * The cap of the model is a limit on this value.
 * An edge without a route or without a way in the network does not count. Without such an edge, the value is 1.
@@ -27774,7 +27883,10 @@ const PORTFOLIO_KS_API = [
 	5,
 	8
 ];
-/** The size bands: up to 12 nodes, 13 to 24 nodes, and 25 to 40 nodes. An input above 40 nodes uses the band `n25-40`. */
+/**
+* The size bands: up to 12 nodes, 13 to 24 nodes, 25 to 40 nodes, 41 to 64 nodes and 65 to 128 nodes. An input above 128 nodes uses the band `n65-128`.
+* The two large bands come from PORTFOLIO-SPEED. Their boards have no optima, so their sets come from the B1 under the guard.
+*/
 const PORTFOLIO_BANDS = [
 	{
 		id: "n1-12",
@@ -27787,6 +27899,14 @@ const PORTFOLIO_BANDS = [
 	{
 		id: "n25-40",
 		maxNodes: 40
+	},
+	{
+		id: "n41-64",
+		maxNodes: 64
+	},
+	{
+		id: "n65-128",
+		maxNodes: 128
 	}
 ];
 /** This function gives the band of a node count: the first band whose `maxNodes` is the count or more, else the last band. */
@@ -27796,7 +27916,7 @@ function portfolioBand(nodes, bands = PORTFOLIO_BANDS) {
 // src/portfolio/fit.ts
 /**
 * The fit of each rule, cap and size band, by the key `<rule>|<cap>|<band>`: the members of the default of the portfolio router, in their order.
-* Each member has a node limit: it runs only on an input with that many nodes or fewer. The limits keep the model time at or below 40 ms.
+* Each member has a node limit: it runs only on an input with that many nodes or fewer. The limits keep the model time at or below 45 ms.
 * The base `shared` is not in a fit: the portfolio always runs it first.
 */
 const PORTFOLIO_FIT = {
@@ -27812,13 +27932,16 @@ const PORTFOLIO_FIT = {
 	],
 	"collection|1.1|n13-24": [
 		["w3e:crossbars+stretch", 24],
+		["trunks-tree-bf08", 24],
 		["corners-side", 24],
 		["shared-p2", 24],
 		["w2c:zipper+stretch-b1.1", 18],
-		["trunks-tree-bf08", 18],
-		["hw:weiszfeld", 18]
+		["hw:weiszfeld", 18],
+		["trunks-gilbert-a07", 18]
 	],
-	"collection|1.1|n25-40": [["w2a:shared-ways+breakeven", 32], ["w2b:weiszfeld-a1", 32]],
+	"collection|1.1|n25-40": [["w2a:shared-ways+breakeven", 40], ["w2b:weiszfeld-a1", 40]],
+	"collection|1.1|n41-64": [],
+	"collection|1.1|n65-128": [],
 	"collection|1.25|n1-12": [
 		["corners-side", 12],
 		["trunks-tree-bf06", 12],
@@ -27834,16 +27957,19 @@ const PORTFOLIO_FIT = {
 		["shared-p3", 24],
 		["trunks-gilbert-a07", 24],
 		["w3e:crossbars+stretch", 24],
-		["trunks-tree-bf06", 18],
+		["trunks-tree-bf06", 24],
 		["w3c:hdbscan+stretch", 18],
 		["shared-wind-p2-r1-e2", 18],
 		["hw:stubs", 18]
 	],
 	"collection|1.25|n25-40": [
-		["w2a:shared-ways+stretch", 32],
-		["shared-p3", 32],
-		["shared-order-shortest", 32]
+		["w2a:shared-ways+stretch", 40],
+		["shared-p3", 40],
+		["shared-order-shortest", 40],
+		["w2b:weiszfeld-a1", 32]
 	],
+	"collection|1.25|n41-64": [],
+	"collection|1.25|n65-128": [],
 	"collection|1.5|n1-12": [
 		["trunks-gilbert-a03", 12],
 		["w3e:areas-keys", 12],
@@ -27860,15 +27986,18 @@ const PORTFOLIO_FIT = {
 		["w3e:crossbars+stretch", 24],
 		["shared-wind-p2-r1-e2", 24],
 		["trunks-tree-bf06", 24],
-		["shared-flow-a06-p3", 18],
-		["shared-wind-p3-r1", 18],
-		["trunks-gilbert-a07", 18]
+		["shared-flow-a06-p3", 24],
+		["shared-wind-p3-r1", 24],
+		["trunks-gilbert-a07", 24]
 	],
 	"collection|1.5|n25-40": [
 		["shared-p3", 40],
-		["hw:lanes", 32],
-		["shared-wind-p2-r1-e2", 32]
+		["hw:lanes", 40],
+		["shared-wind-p2-r1-e2", 40],
+		["hw:crossbars", 32]
 	],
+	"collection|1.5|n41-64": [["shared-flow-a06-p3", 64]],
+	"collection|1.5|n65-128": [],
 	"all|1.1|n1-12": [
 		["w2b:zipper-p2", 12],
 		["hw:cubu", 12],
@@ -27877,39 +28006,51 @@ const PORTFOLIO_FIT = {
 		["w3d:kdeeb-routes", 12],
 		["hw:stubs", 12],
 		["hw:spiral", 12],
-		["w3b:growth-s0.7", 12]
+		["w3b:growth-s0.7", 10]
 	],
 	"all|1.1|n13-24": [
 		["w3e:frechet-e0.5", 24],
 		["w3a:diffusion-wide", 24],
 		["w2c:zipper+stretch-b1.1", 24],
-		["w3d:cubu+stretch", 18]
+		["w3d:cubu+stretch", 18],
+		["w3a:spiral-a15", 18]
 	],
-	"all|1.1|n25-40": [["w2c:zipper+stretch-b1.1", 32], ["w3a:spiral-a15", 32]],
+	"all|1.1|n25-40": [["w2c:zipper+stretch-b1.1", 40], ["w3a:spiral-a15", 32]],
+	"all|1.1|n41-64": [["hw:diffusion", 64]],
+	"all|1.1|n65-128": [],
 	"all|1.25|n1-12": [
 		["w3d:kdeeb-routes", 12],
 		["w3e:mlseb+stretch", 12],
 		["hw:growth", 12],
 		["hw:level-links", 12],
-		["w3b:growth-input", 12],
-		["w3e:confluent+stretch", 12],
-		["w3d:kdeeb-nomask", 10],
-		["w3a:diffusion-g2", 10]
+		["w3b:growth-input", 10],
+		["w3e:confluent+stretch", 10],
+		["w3d:kdeeb-nomask", 10]
+	],
+	"all|1.25|n13-24": [
+		["w3d:kdeeb-routes", 24],
+		["w3f:p-hub-a0.2", 24],
+		["w3d:kdeeb-nomask", 18],
+		["w3a:spiral-n3", 18]
 	],
-	"all|1.25|n13-24": [["w3d:kdeeb-routes", 24], ["w3e:mlseb+stretch", 18]],
 	"all|1.25|n25-40": [["w3d:kdeeb-routes", 32]],
+	"all|1.25|n41-64": [],
+	"all|1.25|n65-128": [],
 	"all|1.5|n1-12": [
 		["w3b:growth-s0.3", 12],
 		["w3e:mlseb-a0", 12],
 		["w3e:mlseb-routes", 10],
-		["w3c:edge-paths-k1.5", 10]
+		["w3c:edge-paths-k1.5", 10],
+		["w3f:territories-r2", 10]
 	],
 	"all|1.5|n13-24": [["hw:growth", 24], ["w3b:growth-input", 24]],
 	"all|1.5|n25-40": [
 		["hw:growth", 40],
-		["w3b:growth-s0.7", 32],
+		["w3b:growth-s0.7", 40],
 		["w3b:growth-s0.3", 32]
-	]
+	],
+	"all|1.5|n41-64": [],
+	"all|1.5|n65-128": []
 };
 // src/portfolio/key.ts
 /** The id of the B1 level of the key of the portfolio router. */
@@ -28398,10 +28539,10 @@ const PORTFOLIO_SETS = {
 	],
 	"collection|1.1|n13-24": [
 		"w3e:crossbars+stretch",
+		"trunks-tree-bf08",
 		"corners-side",
 		"shared-p2",
 		"w2c:zipper+stretch-b1.1",
-		"trunks-tree-bf08",
 		"hw:weiszfeld",
 		"trunks-gilbert-a07",
 		"hw:stubs"
@@ -28411,6 +28552,8 @@ const PORTFOLIO_SETS = {
 		"w2b:weiszfeld-a1",
 		"w2c:level-links+stretch-b1.1"
 	],
+	"collection|1.1|n41-64": [],
+	"collection|1.1|n65-128": [],
 	"collection|1.25|n1-12": [
 		"corners-side",
 		"trunks-tree-bf06",
@@ -28441,6 +28584,13 @@ const PORTFOLIO_SETS = {
 		"w2a:shared-ways+ambiguity",
 		"w2b:weiszfeld-a0"
 	],
+	"collection|1.25|n41-64": [
+		"hw:lanes",
+		"w3e:crossbars+stretch",
+		"w2a:shared-ways+stretch",
+		"shared-flow-a06-p3"
+	],
+	"collection|1.25|n65-128": ["hw:lanes"],
 	"collection|1.5|n1-12": [
 		"trunks-gilbert-a03",
 		"w3e:areas-keys",
@@ -28471,6 +28621,18 @@ const PORTFOLIO_SETS = {
 		"shared-wind-p2-r1",
 		"shared-wind-p2-r2"
 	],
+	"collection|1.5|n41-64": [
+		"shared-flow-a06-p3",
+		"hw:lanes",
+		"shared-p2",
+		"trunks-tree-bf06"
+	],
+	"collection|1.5|n65-128": [
+		"shared-p2",
+		"shared-p3",
+		"shared-flow-a06-p3",
+		"hw:lanes"
+	],
 	"all|1.1|n1-12": [
 		"w2b:zipper-p2",
 		"hw:cubu",
@@ -28500,6 +28662,13 @@ const PORTFOLIO_SETS = {
 		"w2c:road-classes-d0.3",
 		"w3d:kdeeb-routes"
 	],
+	"all|1.1|n41-64": [
+		"hw:diffusion",
+		"w3a:spiral-a15",
+		"w2c:zipper+stretch-b1.1",
+		"w3e:frechet-e0.5"
+	],
+	"all|1.1|n65-128": ["hw:diffusion"],
 	"all|1.25|n1-12": [
 		"w3d:kdeeb-routes",
 		"w3e:mlseb+stretch",
@@ -28512,13 +28681,13 @@ const PORTFOLIO_SETS = {
 	],
 	"all|1.25|n13-24": [
 		"w3d:kdeeb-routes",
-		"w3e:mlseb+stretch",
 		"w3f:p-hub-a0.2",
+		"w3d:kdeeb-nomask",
 		"w3a:spiral-n3",
-		"w3a:diffusion-l3",
-		"trunks-tree-bf06",
-		"hw:cubu",
-		"w3a:spiral-a35"
+		"w3b:growth-input",
+		"w3d:cubu+stretch",
+		"w3a:spiral-a35",
+		"trunks-tree-bf06"
 	],
 	"all|1.25|n25-40": [
 		"w3d:kdeeb-routes",
@@ -28528,6 +28697,18 @@ const PORTFOLIO_SETS = {
 		"w3e:frechet+stretch",
 		"hw:cubu"
 	],
+	"all|1.25|n41-64": [
+		"w3e:frechet+stretch",
+		"hw:cubu",
+		"w3a:diffusion-wide",
+		"w2a:shared-ways+stretch",
+		"w3a:spiral-a35"
+	],
+	"all|1.25|n65-128": [
+		"hw:diffusion",
+		"w3a:diffusion-wide",
+		"w3a:diffusion-l3"
+	],
 	"all|1.5|n1-12": [
 		"w3b:growth-s0.3",
 		"w3e:mlseb-a0",
@@ -28542,7 +28723,6 @@ const PORTFOLIO_SETS = {
 		"hw:growth",
 		"w3b:growth-input",
 		"hw:mlseb",
-		"w3e:mlseb+stretch",
 		"w3b:growth-s0.3"
 	],
 	"all|1.5|n25-40": [
@@ -28551,9 +28731,25 @@ const PORTFOLIO_SETS = {
 		"w3b:growth-s0.3",
 		"w3b:growth-t1.2",
 		"w3b:growth-input"
+	],
+	"all|1.5|n41-64": [
+		"hw:growth",
+		"w3b:growth-s0.3",
+		"w3a:diffusion-g2",
+		"w3b:growth-s0.7",
+		"w3a:diffusion-l3",
+		"w3b:growth-input"
+	],
+	"all|1.5|n65-128": [
+		"hw:growth",
+		"w3b:growth-s0.3",
+		"hw:shared-ways-all",
+		"w3a:diffusion-g2"
 	]
 };
 // src/portfolio/router.ts
+/** The values of the option `hashes`, in order. The default is `pick`. */
+const PORTFOLIO_HASHES = ["pick", "all"];
 /** The base member of each portfolio: the router `shared` with the rule `byCollection`. It is the fallback output above the cap. */
 const PORTFOLIO_BASE_MEMBER = "shared";
 /** This function checks the options of the portfolio router, and gives them with their defaults. It throws a `RangeError` for a bad value. */
@@ -28561,13 +28757,16 @@ function checked(o) {
 	const rule = o.rule ?? "collection";
 	const cap = o.cap ?? 1.5;
 	const k = o.k;
+	const hashes = o.hashes ?? "pick";
 	if (!PORTFOLIO_RULES.includes(rule)) throw new RangeError(`The portfolio router has the rule "${String(rule)}". It must be ${PORTFOLIO_RULES.join(" or ")}.`);
 	if (!PORTFOLIO_CAPS.includes(cap)) throw new RangeError(`The portfolio router has the cap ${String(cap)}. It must be ${PORTFOLIO_CAPS.join(", ")}.`);
 	if (k !== void 0 && !PORTFOLIO_KS_API.includes(k)) throw new RangeError(`The portfolio router has the k ${String(k)}. It must be ${PORTFOLIO_KS_API.join(", ")}.`);
+	if (!PORTFOLIO_HASHES.includes(hashes)) throw new RangeError(`The portfolio router has the hashes "${String(hashes)}". It must be ${PORTFOLIO_HASHES.join(" or ")}.`);
 	return {
 		rule,
 		cap,
-		k
+		k,
+		hashes
 	};
 }
 /** This function gives the name of the portfolio router with the options `options`: `portfolio-<rule>-<cap>-k<k>`, or `portfolio-<rule>-<cap>-fit` without `k`. */
@@ -28592,10 +28791,11 @@ function portfolioMembers(nodes, options = {}) {
 * The key is `portfolioKey`: a member wins only when it passes the guard against the base. Of those members, the winner has the most ink saved.
 * A tie within the `minEffect` of B1 goes to the first member (`selectBest`). A member that throws does not win.
 * The result carries the trace of the pick and the move count `move.pick`.
+* With the option `hashes` "pick" (the default), only the base and the winner get an `outputHash` in the trace. They get it only when the winner is not the base.
 */
 function routePortfolio(graph, options = {}) {
 	const names = portfolioMembers(graph.nodes.length, options).filter((name) => name === "shared" || (portfolioMember(name)?.maxNodes ?? Infinity) >= graph.nodes.length);
-	const { rule, cap } = checked(options);
+	const { rule, cap, hashes } = checked(options);
 	let base;
 	const members = names.map((name) => {
 		const s = portfolioMember(name);
@@ -28614,6 +28814,7 @@ function routePortfolio(graph, options = {}) {
 		};
 	});
 	const pick = portfolio(portfolioName(options), members, portfolioKey(graph, rule, cap, () => base), {
+		hashes,
 		...options.budgetMs === void 0 ? {} : { budgetMs: options.budgetMs },
 		...options.maxMembers === void 0 ? {} : { maxMembers: options.maxMembers },
 		...options.now === void 0 ? {} : { now: options.now }
@@ -28652,6 +28853,6 @@ const portfolioStrategy = defineStrategy({
 	maxNodes: 1e4,
 	run: (graph, options) => routePortfolio(graph, options).result
 });
-export { AMBIGUITY_GUARD_DEFAULTS, ARC_SOURCES, AREA_DEFAULTS, AREA_WIDTHS, BACKTRACK_MIN, BACKTRACK_SHARE, BREAK, BREAK_EVEN, BREAK_EVEN_DEFAULTS, BUILT_IN_STRATEGIES, BoundaryWalk, CANDIDATE_SOURCES, CAP_SWEEP, CASES, CHANNEL_REACH, CLEARANCE_CAP, COMPARE_STEPS, CONFLUENT_DEFAULTS, CONSENSUS_DEFAULTS, CONSENSUS_LINKAGES, CORRIDOR_DEFAULTS, CROSSBAR_DEFAULTS, CUBU_DEFAULTS, CURVE_TYPES, CUT_DEFAULTS, CornerGraph, DENSITY_KERNELS, DIFFUSION_DEFAULTS, DIVIDED_DEFAULTS, EDGE_DISTANCES, EDGE_PATH_DEFAULTS, EXACT_CLASSES, EXACT_EDGES_PER_NODE, EXACT_V1, EXACT_V1_BOUNDS, EXACT_V1_BOUNDS_SIZES, EXACT_V1_SEEDS, EXACT_V1_SIZES, FDEB_DEFAULTS, FIXTURES, FLOW_CLUSTER_DEFAULTS, FLOW_FIELD_DEFAULTS, FRECHET_DEFAULTS, FRONT_OBJECTIVES, GAP_BASELINES, GAP_BOOTSTRAP, GAP_CAPS, GAP_RULES, GAP_VIEWS, GROUP_SCOPES, GROUP_SPINES, GROWTH_DEFAULTS, GROWTH_SWEEP, Grid, HDBSCAN_DEFAULTS, HIERARCHY_DEFAULTS, HIERARCHY_GROUPS, HIGHWAY_BASES, HIGHWAY_BASE_ROUTERS, HOUGH_DEFAULTS, HUB_ALLOCATIONS, HUB_ARC_DEFAULTS, HUB_CANDIDATES, HYSTERESIS_DEFAULTS, KDEEB_DEFAULTS, KD_DEFAULTS, KENDALL_EXACT, LANES_DEFAULTS, LANE_ORDERS, LANE_TRACKS, LEVEL_HIGHWAY_DEFAULTS, LINKAGES, LINK_COMMUNITY_DEFAULTS, MEASURES, MEASURE_LANE_WIDTH, MEET_DEFAULTS, MEMBER_FORMS, MESH_DEFAULTS, MINGLE_DEFAULTS, MIN_EFFECTS, MLSEB_DEFAULTS, MLS_FITS, MODULE_RULES, MOVE_NAMES, NESTED_DEFAULTS, OD_CELL_DEFAULTS, OUTSIDE_SLACK, Obstacles, PICK, PLAN_CHANGERS, PORTFOLIO_B1, PORTFOLIO_BANDS, PORTFOLIO_BASE_MEMBER, PORTFOLIO_CAPS, PORTFOLIO_FIT, PORTFOLIO_KS_API, PORTFOLIO_RULES, PORTFOLIO_SETS, POWER_DEFAULTS, PROPOSED_RULES, P_HUB_DEFAULTS, QUICKBUNDLES_DEFAULTS, RECORD_EPS, RESISTANCE_DEFAULTS, RIDGE_DEFAULTS, ROAD_CLASS_DEFAULTS, ROOM_FAMILIES, ROUTERS, SAME_HIGHWAY, SBEB_DEFAULTS, SCALE_SPACE_DEFAULTS, SCREEN_RULES, SCREEN_SETS, SCREEN_STEPS, SCREEN_V1, SCREEN_WRAPS, SECTION_DEFAULTS, SELECT_DEFAULTS, SIDE_NORMAL, SKELETON_GROUPS, SKELETON_TARGETS, SLACK_SWEEP, SOFT_KEY_DEFAULTS, SPACING_LIMIT, SPECTRAL_DEFAULTS, SPIRAL_DEFAULTS, STABLE_ID_DEFAULTS, STEPS, STRATEGIES, STRETCH_DEFAULTS, STRETCH_SWEEP, STUB_DEFAULTS, SUITE_COLUMNS, SoftGraph, SplitTree, TERRITORY_DEFAULTS, TERRITORY_POINTS, TOLERANCE, TRACLUS_DEFAULTS, TRAFFIC_RULES, WEISZFELD_DEFAULTS, WSPD_DEFAULTS, WayFinder, ZIPPER_DEFAULTS, activationBase, activationReport, adjustedRandIndex, allSections, ambiguity, ambiguityGate, ambiguityPlan, arcCurve, areaPlan, asRouter, backtrackOf, balance, basePlan, benchBendRoom, benchCurveStrategies, benchCurves, benchHighways, benchLevelRoom, benchOne, benchRoom, benchRun, benchTracks, bendCount, bendingEnergy, bicliqueGroups, bigGroups, boardGaps, boardUnit, boardWins, bootstrapMedian, boundsFamilyName, boxExit, boxPush, boxUnit, boxesOverlap, breakEvenGate, breakEvenPlan, buildSections, bundleStretch, bundledShare, byCollection, byDataGroup, candidateArcs, candidatePlan, candidateScore, canonicalJson, capSettings, cellSteps, center, chainClusters, changeGraph, channelOverflows, channelWidth, characteristicPoints, checkLevels, checkOptions, checkPlan, checkProperties, checkSchema, checkSections, clampOptions, clothoidCurve, clusters1d, coAssociation, commonEdges, compareMeasure, compareSpec, compareStep, compatibility, compatibilityMatrix, confluentPlan, consensusGroups, consensusLabels, consensusPlan, controlChain, cornersRouter, corpusManifest, corridorPlan, countCrossings, countOverlaps, createRegistry, crossbarPlan, crossesItself, crossingAngle, crossingAngles, cubicAt, cubuPlan, curveFaults, curveJoints, curveOf, curveRuns, curveSpace, curveStrategies, curvesHash, cutGroups, cutShare, defineStrategy, denseGroupsBoard, densityPlan, densityRidges, detourSpread, diffusionPlan, dist, distinctPoints, divideHighway, dividedPlan, documentHash, dominates, drawnSegments, edgeBlocks, edgeEnds, edgeLengths, edgePathPlan, edgePaths, edgePlugs, edgeResistance, exactBoard, exactFamily, exactGenerator, exactSeed, exercised, familyOf, familySeed, farLevel, fdebLines, fdebPlan, fft, findStrategy, finderOf, firstLines, fixedPortPoint, fixtureGroupOptions, flowClusterPlan, flowClusters, flowDistance, flowFieldPlan, fnv1a32, follow, formatActivation, formatBendRoom, formatCurves, formatFaults, formatFronts, formatGap, formatHighways, formatInput, formatLevelRoom, formatLevels, formatMeasureTime, formatRoom, formatRules, formatScreen, formatSections, formatSummaries, formatTable, formatTracks, frechet, frechetBundles, frechetPlan, g1Defect, g2Defect, gapBaselines, gapCap, gapClosed, gapLaneCounts, gapLanes, gapNames, gapValues, gateStrategy, getStrategy, goesOutAndBack, graphInput, greedyBicliques, greedyCrossbars, groupEdges, groupRun, groupSettings, groupStability, groupStrategies, groupedPlan, growthPlan, growthSettings, guardBreaks, hasCusp, hdbscanClusters, hdbscanLabels, hdbscanPlan, hierarchyPlan, highwayChurn, highwayCurve, highwayCurves, highwayEdits, highwayIdKeep, highwayMoves, highwayRouter, highwayRouterStrategy, highwayStrategies, houghLines, houghPeaks, houghPlan, hubArcPlan, hubCandidates, hubChainBoard, hysteresisGate, hysteresisPlan, inflate, inflectionCount, inflectionCurve, inflectionSector, inkSaved, innerPoints, inputGraph, inputId, itemSizes, jaccard, jaccardIndex, jogPeaks, joinReports, jsonSafe, kMeans, kdGroups, kdeebLines, kdeebPlan, keepMembers, kendallTau, keyGroups, keyedSections, keysPlan, labelGroups, laneArea, laneCrossings, laneFidelity, laneOrder, laneRoutes, laneSeparation, laneSettings, lanesPlan, lanesThrough, leafGroups, lengthBetween, levelCut, levelGrouping, levelHighwayPlan, levelMeasures, levelPairs, levelRoom, lineDensity, linePoint, linkAgreement, linkCommunities, linkCommunityGroups, linkCommunityPlan, linkDensity, listOptions, listStrategies, makeFixture, makeRoom, manyGroupsBoard, matchHighways, maxStretch, mdf, meanLine, measureBoard, measureByKey, measureByName, measureHighways, measureJogs, measureLevel, measureLevelFaults, measureLinks, measureName, measureQuality, measureRouteFaults, measureStability, meetMember, meetPlan, meetingPoints, memberAt, memberStrategy, mergeAngle, meshPlan, meshWaypoints, minEffectOf, minHash, mingleBundles, minglePlan, mixedSegments, mixesCollections, mlsPoint, mlsebLines, mlsebPlan, modularity, modulesOf, mulberry32, namedObjectives, nearestCentre, nearestOnBoundary, nearestOnLine, nearestSide, nearestSkeleton, nestedGridBoard, nestedGroups, nestedPlan, nestingFaults, nestingViolations, nextRow, nodeAmbiguity, nodeIndex, nodeLinks, occupiedArea, odCellPlan, odGroups, offsetLine, offsetPolyline, openGaps, openLanes, optimaFile, optimumKey, optionDefaults, orderChanges, orderFragility, orderLanes, orderRows, orderStability, orderSuiteRows, orthogonality, outOfBoxes, outputGroups, outputHash, pHubPlan, pMedian, packedGridBoard, paretoFront, parseLines, partWithin, passSettings, pathPoints, peakCurvature, pickLevel, pickMoves, placePlug, planMoves, planOfResult, plugSpacing, plugsRouter, pointAt, pointBoxDistance, pointDensity, pointGroups, pointOnSide, pointSegmentDistance, polylineLength, portfolio, portfolioB1Spec, portfolioBand, portfolioFacts, portfolioKey, portfolioMember, portfolioMembers, portfolioName, portfolioRouter, portfolioStrategy, positionStability, powerPlan, pullApart, quadtreeGroups, quantile, quickBundles, quickBundlesPlan, randomInt, rayToBox, recordLines, recordMoves, rectScattered, regionBounds, register, repairResult, repairStrategy, representative, resample, resistanceClusters, resistancePlan, resultForm, resultHash, ridgeLines, ridgePlan, rng, roadClassPlan, roomDemand, roomLinks, roomOrderFaults, roomStrategies, round3, roundCorners, roundedCurve, routeCrossings, routeInStableOrder, routeMeasures, routePortfolio, routeSeparation, routeStability, routerStrategies, routersOf, ruleCounts, runBenchmark, runKey, runProfile, runSuite, sameData, sampleCurve, samplesOf, sbebLines, sbebPlan, scaleClusters, scaleSpaceGroups, scaleSpacePlan, screen, screenInputs, sectionsRouter, segmentBounds, segmentBoxDistance, segmentClusters, segmentDistance, segmentHitsBox, segmentHitsRect, segmentKey, segmentsCross, segmentsOf, selectBest, selectPlan, sha256Hex, shapeSkeleton, sharedRouter, sharedStretches, sharedWaysAll, sharedWaysPlan, shuffleEdges, sideAngle, sideToward, skeletonGroups, skeletonPath, slackSettings, smoothCurve, snapPlan, softDistance, softKeyClusters, softKeyPlan, spectralClusters, spectralLabels, spectralPlan, spinePart, spiralJoin, spiralPlan, spiralTree, splineCurve, splitPoint, stableIdGate, stableIdPlan, stableOrder, stableOrderStrategy, stepSeed, straightCurve, straightRouter, stretchGate, stretchPlan, stretchSettings, stubPlan, suiteFronts, sumFaults, summarize, summarizeGap, summarizeRows, sweepGrid, sweepOf, sweepRoom, sweepSections, sweepValues, symmetricEigen, territoryPlan, toSvgPath, totalTurn, tracePlan, traclusPlan, treeCost, treeDepth, trunksRouter, turns, unwrappedName, utf8, waypointWay, weberPoint, weiszfeldPlan, withBends, withRepair, withStableOrder, wspdGroups, wspdPlan, zipLegs, zipperPlan };
+export { AMBIGUITY_GUARD_DEFAULTS, ARC_SOURCES, AREA_DEFAULTS, AREA_WIDTHS, BACKTRACK_MIN, BACKTRACK_SHARE, BREAK, BREAK_EVEN, BREAK_EVEN_DEFAULTS, BUILT_IN_STRATEGIES, BoundaryWalk, CANDIDATE_SOURCES, CAP_SWEEP, CASES, CHANNEL_REACH, CLEARANCE_CAP, COMPARE_STEPS, CONFLUENT_DEFAULTS, CONSENSUS_DEFAULTS, CONSENSUS_LINKAGES, CORRIDOR_DEFAULTS, CROSSBAR_DEFAULTS, CUBU_DEFAULTS, CURVE_TYPES, CUT_DEFAULTS, CornerGraph, DENSITY_KERNELS, DIFFUSION_DEFAULTS, DIVIDED_DEFAULTS, EDGE_DISTANCES, EDGE_PATH_DEFAULTS, EXACT_CLASSES, EXACT_EDGES_PER_NODE, EXACT_V1, EXACT_V1_BOUNDS, EXACT_V1_BOUNDS_SIZES, EXACT_V1_SEEDS, EXACT_V1_SIZES, FDEB_DEFAULTS, FIXTURES, FLOW_CLUSTER_DEFAULTS, FLOW_FIELD_DEFAULTS, FRECHET_DEFAULTS, FRONT_OBJECTIVES, GAP_BASELINES, GAP_BOOTSTRAP, GAP_CAPS, GAP_RULES, GAP_VIEWS, GROUP_SCOPES, GROUP_SPINES, GROWTH_DEFAULTS, GROWTH_SWEEP, Grid, HDBSCAN_DEFAULTS, HIERARCHY_DEFAULTS, HIERARCHY_GROUPS, HIGHWAY_BASES, HIGHWAY_BASE_ROUTERS, HOUGH_DEFAULTS, HUB_ALLOCATIONS, HUB_ARC_DEFAULTS, HUB_CANDIDATES, HYSTERESIS_DEFAULTS, KDEEB_DEFAULTS, KD_DEFAULTS, KENDALL_EXACT, LANES_DEFAULTS, LANE_ORDERS, LANE_TRACKS, LEVEL_HIGHWAY_DEFAULTS, LINKAGES, LINK_COMMUNITY_DEFAULTS, MEASURES, MEASURE_LANE_WIDTH, MEET_DEFAULTS, MEMBER_FORMS, MESH_DEFAULTS, MINGLE_DEFAULTS, MIN_EFFECTS, MLSEB_DEFAULTS, MLS_FITS, MODULE_RULES, MOVE_NAMES, NESTED_DEFAULTS, OD_CELL_DEFAULTS, OUTSIDE_SLACK, Obstacles, PICK, PLAN_CHANGERS, PORTFOLIO_B1, PORTFOLIO_BANDS, PORTFOLIO_BASE_MEMBER, PORTFOLIO_CAPS, PORTFOLIO_FIT, PORTFOLIO_HASHES, PORTFOLIO_KS_API, PORTFOLIO_RULES, PORTFOLIO_SETS, POWER_DEFAULTS, PROPOSED_RULES, P_HUB_DEFAULTS, QUICKBUNDLES_DEFAULTS, RECORD_EPS, RESISTANCE_DEFAULTS, RIDGE_DEFAULTS, ROAD_CLASS_DEFAULTS, ROOM_FAMILIES, ROUTERS, SAME_HIGHWAY, SBEB_DEFAULTS, SCALE_SPACE_DEFAULTS, SCREEN_RULES, SCREEN_SETS, SCREEN_STEPS, SCREEN_V1, SCREEN_WRAPS, SECTION_DEFAULTS, SELECT_DEFAULTS, SIDE_NORMAL, SKELETON_GROUPS, SKELETON_TARGETS, SLACK_SWEEP, SOFT_KEY_DEFAULTS, SPACING_LIMIT, SPECTRAL_DEFAULTS, SPIRAL_DEFAULTS, STABLE_ID_DEFAULTS, STEPS, STRATEGIES, STRETCH_DEFAULTS, STRETCH_SWEEP, STUB_DEFAULTS, SUITE_COLUMNS, SoftGraph, SplitTree, TERRITORY_DEFAULTS, TERRITORY_POINTS, TOLERANCE, TRACLUS_DEFAULTS, TRAFFIC_RULES, WEISZFELD_DEFAULTS, WSPD_DEFAULTS, WayFinder, ZIPPER_DEFAULTS, activationBase, activationReport, adjustedRandIndex, allSections, ambiguity, ambiguityGate, ambiguityPlan, arcCurve, areaPlan, asRouter, backtrackOf, balance, basePlan, benchBendRoom, benchCurveStrategies, benchCurves, benchHighways, benchLevelRoom, benchOne, benchRoom, benchRun, benchTracks, bendCount, bendingEnergy, bicliqueGroups, bigGroups, boardGaps, boardUnit, boardWins, bootstrapMedian, boundsFamilyName, boxExit, boxPush, boxUnit, boxesOverlap, breakEvenGate, breakEvenPlan, buildSections, bundleStretch, bundledShare, byCollection, byDataGroup, candidateArcs, candidatePlan, candidateScore, canonicalJson, capSettings, cellSteps, center, chainClusters, changeGraph, channelOverflows, channelWidth, characteristicPoints, checkLevels, checkOptions, checkPlan, checkProperties, checkSchema, checkSections, clampOptions, clothoidCurve, clusters1d, coAssociation, commonEdges, compareMeasure, compareSpec, compareStep, compatibility, compatibilityMatrix, confluentPlan, consensusGroups, consensusLabels, consensusPlan, controlChain, cornersRouter, corpusManifest, corridorPlan, countCrossings, countOverlaps, createRegistry, crossbarPlan, crossesItself, crossingAngle, crossingAngles, cubicAt, cubuPlan, curveFaults, curveJoints, curveOf, curveRuns, curveSpace, curveStrategies, curvesHash, cutGroups, cutShare, defineStrategy, denseGroupsBoard, densityPlan, densityRidges, detourSpread, diffusionPlan, dist, distinctPoints, divideHighway, dividedPlan, documentHash, dominates, drawnSegments, edgeBlocks, edgeEnds, edgeLengths, edgePathPlan, edgePaths, edgePlugs, edgeResistance, exactBoard, exactFamily, exactGenerator, exactSeed, exactStretch, exactStretches, exercised, familyOf, familySeed, farLevel, fdebLines, fdebPlan, fft, findStrategy, finderOf, firstLines, fixedPortPoint, fixtureGroupOptions, flowClusterPlan, flowClusters, flowDistance, flowFieldPlan, fnv1a32, follow, formatActivation, formatBendRoom, formatCurves, formatFaults, formatFronts, formatGap, formatHighways, formatInput, formatLevelRoom, formatLevels, formatMeasureTime, formatRoom, formatRules, formatScreen, formatSections, formatSummaries, formatTable, formatTracks, frechet, frechetBundles, frechetPlan, g1Defect, g2Defect, gapBaselines, gapCap, gapClosed, gapLaneCounts, gapLanes, gapNames, gapValues, gateStrategy, getStrategy, goesOutAndBack, graphInput, greedyBicliques, greedyCrossbars, groupEdges, groupRun, groupSettings, groupStability, groupStrategies, groupedPlan, growthPlan, growthSettings, guardBreaks, hasCusp, hdbscanClusters, hdbscanLabels, hdbscanPlan, hierarchyPlan, highwayChurn, highwayCurve, highwayCurves, highwayEdits, highwayIdKeep, highwayMoves, highwayRouter, highwayRouterStrategy, highwayStrategies, houghLines, houghPeaks, houghPlan, hubArcPlan, hubCandidates, hubChainBoard, hysteresisGate, hysteresisPlan, inflate, inflectionCount, inflectionCurve, inflectionSector, inkSaved, innerPoints, inputGraph, inputId, itemSizes, jaccard, jaccardIndex, jogPeaks, joinReports, jsonSafe, kMeans, kdGroups, kdeebLines, kdeebPlan, keepMembers, kendallTau, keyGroups, keyedSections, keysPlan, labelGroups, laneArea, laneCrossings, laneFidelity, laneOrder, laneRoutes, laneSeparation, laneSettings, lanesPlan, lanesThrough, leafGroups, lengthBetween, levelCut, levelGrouping, levelHighwayPlan, levelMeasures, levelPairs, levelRoom, lineDensity, linePoint, linkAgreement, linkCommunities, linkCommunityGroups, linkCommunityPlan, linkDensity, listOptions, listStrategies, makeFixture, makeRoom, manyGroupsBoard, matchHighways, maxStretch, mdf, meanLine, measureBoard, measureByKey, measureByName, measureHighways, measureJogs, measureLevel, measureLevelFaults, measureLinks, measureName, measureQuality, measureRouteFaults, measureStability, meetMember, meetPlan, meetingPoints, memberAt, memberStrategy, mergeAngle, meshPlan, meshWaypoints, minEffectOf, minHash, mingleBundles, minglePlan, mixedSegments, mixesCollections, mlsPoint, mlsebLines, mlsebPlan, modularity, modulesOf, mulberry32, namedObjectives, nearestCentre, nearestOnBoundary, nearestOnLine, nearestSide, nearestSkeleton, nestedGridBoard, nestedGroups, nestedPlan, nestingFaults, nestingViolations, nextRow, nodeAmbiguity, nodeIndex, nodeLinks, occupiedArea, odCellPlan, odGroups, offsetLine, offsetPolyline, openGaps, openLanes, optimaFile, optimumKey, optionDefaults, orderChanges, orderFragility, orderLanes, orderRows, orderStability, orderSuiteRows, orthogonality, outOfBoxes, outputGroups, outputHash, pHubPlan, pMedian, packedGridBoard, paretoFront, parseLines, partWithin, passSettings, pathPoints, peakCurvature, pickLevel, pickMoves, placePlug, planMoves, planOfResult, plugSpacing, plugsRouter, pointAt, pointBoxDistance, pointDensity, pointGroups, pointOnSide, pointSegmentDistance, polylineLength, portfolio, portfolioB1Spec, portfolioBand, portfolioFacts, portfolioKey, portfolioMember, portfolioMembers, portfolioName, portfolioRouter, portfolioStrategy, positionStability, powerPlan, pullApart, quadtreeGroups, quantile, quickBundles, quickBundlesPlan, randomInt, rayToBox, recordLines, recordMoves, rectScattered, regionBounds, register, repairResult, repairStrategy, representative, resample, resistanceClusters, resistancePlan, resultForm, resultHash, ridgeLines, ridgePlan, rng, roadClassPlan, roomDemand, roomLinks, roomOrderFaults, roomStrategies, round3, roundCorners, roundedCurve, routeCrossings, routeInStableOrder, routeMeasures, routePortfolio, routeSeparation, routeStability, routerStrategies, routersOf, ruleCounts, runBenchmark, runKey, runProfile, runSuite, sameData, sampleCurve, samplesOf, sbebLines, sbebPlan, scaleClusters, scaleSpaceGroups, scaleSpacePlan, screen, screenInputs, sectionsRouter, segmentBounds, segmentBoxDistance, segmentClusters, segmentDistance, segmentHitsBox, segmentHitsRect, segmentKey, segmentsCross, segmentsOf, selectBest, selectPlan, sha256Hex, shapeSkeleton, sharedRouter, sharedStretches, sharedWaysAll, sharedWaysPlan, shuffleEdges, sideAngle, sideToward, skeletonGroups, skeletonPath, slackSettings, smoothCurve, snapPlan, softDistance, softKeyClusters, softKeyPlan, spectralClusters, spectralLabels, spectralPlan, spinePart, spiralJoin, spiralPlan, spiralTree, splineCurve, splitPoint, stableIdGate, stableIdPlan, stableOrder, stableOrderStrategy, stepSeed, straightCurve, straightRouter, stretchGate, stretchPlan, stretchSettings, stubPlan, suiteFronts, sumFaults, summarize, summarizeGap, summarizeRows, sweepGrid, sweepOf, sweepRoom, sweepSections, sweepValues, symmetricEigen, territoryPlan, toSvgPath, totalTurn, tracePlan, traclusPlan, treeCost, treeDepth, trunksRouter, turns, unwrappedName, utf8, waypointWay, weberPoint, weiszfeldPlan, withBends, withRepair, withStableOrder, wspdGroups, wspdPlan, zipLegs, zipperPlan };
 
 //# sourceMappingURL=index.js.map