@mark1russell7/highways 0.6.0 → 0.8.0

package/build/index.js

@@ -2043,6 +2043,109 @@ function straightCurve(points) {
 		to
 	});
 }
+// src/compare.ts
+/** This function compares two texts by their UTF-16 code units. It gives 0 only for equal texts. */
+const byText = (a, b) => a < b ? -1 : a > b ? 1 : 0;
+/** This function compares two edges by the hash of their ids, and then by their ids. Thus the order of two edges does not depend on the input. */
+function byHash(a, b) {
+	if (a.h !== b.h) return a.h - b.h;
+	return byText(a.e.id, b.e.id);
+}
+// src/lane-order.ts
+/** Two points nearer than this distance are the same point. The value is the same as in `segments.ts`. */
+const SAME$4 = 1e-6;
+/** The angle, from -π to π, of the turn at `base` from the direction `from` → `base` to the point `to`. */
+function turn$1(from, base, to) {
+	const dx = base.x - from.x;
+	const dy = base.y - from.y;
+	const vx = to.x - base.x;
+	const vy = to.y - base.y;
+	return Math.atan2(dx * vy - dy * vx, dx * vx + dy * vy);
+}
+/** This function gives the place where the routes `P` and `Q` part after the last point of the run, or nothing. */
+function partAfter(P, Q) {
+	for (let j = 1;; j++) {
+		const a = P.p[P.e + j];
+		const b = Q.p[Q.e + j];
+		if (a === void 0 || b === void 0) return void 0;
+		if (dist(a, b) > SAME$4) {
+			const from = P.p[P.e + j - 2];
+			const at = P.p[P.e + j - 1];
+			const side = turn$1(from, at, a) - turn$1(from, at, b);
+			return side === 0 ? void 0 : {
+				at,
+				side
+			};
+		}
+	}
+}
+/** This function gives the place where the routes `P` and `Q` part before the first point of the run, or nothing. */
+function partBefore(P, Q) {
+	for (let j = 1;; j++) {
+		const a = P.p[P.s - j];
+		const b = Q.p[Q.s - j];
+		if (a === void 0 || b === void 0) return void 0;
+		if (dist(a, b) > SAME$4) {
+			const from = P.p[P.s - j + 2];
+			const at = P.p[P.s - j + 1];
+			const side = turn$1(from, at, b) - turn$1(from, at, a);
+			return side === 0 ? void 0 : {
+				at,
+				side
+			};
+		}
+	}
+}
+/** This function compares two placed routes by their edge ids. */
+const byEdge$2 = (P, Q) => byText(P.edge, Q.edge);
+/** This function puts the point `a` before the point `b`: the smaller x first, then the smaller y. */
+const firstPoint = (a, b) => a.x < b.x - SAME$4 || Math.abs(a.x - b.x) <= SAME$4 && a.y < b.y;
+/**
+* This function is the relation of the order `run`. The side after the run tells the order first, then the side before the run, then the edges.
+* A value below 0 puts `P` before `Q`. The relation is not transitive: three lanes can make a cycle.
+*/
+const byRun = (P, Q) => partAfter(P, Q)?.side ?? partBefore(P, Q)?.side ?? byEdge$2(P, Q);
+/**
+* This function is the relation of the order `bundle`. When the two ends disagree, the end with the smaller x, then the smaller y, tells the side.
+* A value below 0 puts `P` before `Q`. The relation is not transitive: three lanes can make a cycle.
+*/
+const byBundle = (P, Q) => {
+	const after = partAfter(P, Q);
+	const before = partBefore(P, Q);
+	if (after && before && Math.sign(after.side) !== Math.sign(before.side)) return firstPoint(after.at, before.at) ? after.side : before.side;
+	return after?.side ?? before?.side ?? byEdge$2(P, Q);
+};
+/**
+* This function sorts a list with a stable merge sort of the package, not with `Array.prototype.sort`.
+* The pairs that it gives to `compare` depend only on the list and on the results of `compare`.
+* Thus the result is the same on each JavaScript engine, also when `compare` is not a total order.
+* A value of `compare(a, b)` above 0 puts `b` before `a`. Any other value (below 0, 0 or NaN) keeps `a` first.
+*/
+function mergeSort(list, compare) {
+	if (list.length < 2) return [...list];
+	const mid = list.length >> 1;
+	const left = mergeSort(list.slice(0, mid), compare);
+	const right = mergeSort(list.slice(mid), compare);
+	const out = [];
+	let i = 0;
+	let j = 0;
+	while (i < left.length && j < right.length) if (compare(left[i], right[j]) > 0) out.push(right[j++]);
+	else out.push(left[i++]);
+	while (i < left.length) out.push(left[i++]);
+	while (j < right.length) out.push(right[j++]);
+	return out;
+}
+/** This function gives the lane order of a run: the merge sort of `start` with the relation `compare`. It tells the observer of `observeLanes`. */
+function orderRun(start, compare) {
+	return mergeSort(start, compare);
+}
+/**
+* This function gives the lane order of the placed routes of a run. `order` selects the relation.
+* With `run`, the sort starts from the order of `placed`. With `bundle`, it starts from the order of the edges, so that each run sorts the same edges the same way.
+*/
+function orderPlaced(placed, order) {
+	return order === "run" ? orderRun(placed, byRun) : orderRun([...placed].sort(byEdge$2), byBundle);
+}
 // src/segments.ts
 const SAME$3 = 1e-6;
 /** This function gives the index where `p` holds the points of `part` in a row, from `from` on, or -1. */
@@ -2245,51 +2348,6 @@ function lanePaths(graph, spacingOf) {
 	}
 	return routes;
 }
-/** The angle, from -π to π, of the turn at `base` from the direction `from` → `base` to the point `to`. */
-function turn$1(from, base, to) {
-	const dx = base.x - from.x;
-	const dy = base.y - from.y;
-	const vx = to.x - base.x;
-	const vy = to.y - base.y;
-	return Math.atan2(dx * vy - dy * vx, dx * vx + dy * vy);
-}
-/** This function gives the place where the routes `P` and `Q` part after the last point of the run, or nothing. */
-function partAfter(P, Q) {
-	for (let j = 1;; j++) {
-		const a = P.p[P.e + j];
-		const b = Q.p[Q.e + j];
-		if (a === void 0 || b === void 0) return void 0;
-		if (dist(a, b) > SAME$3) {
-			const from = P.p[P.e + j - 2];
-			const at = P.p[P.e + j - 1];
-			const side = turn$1(from, at, a) - turn$1(from, at, b);
-			return side === 0 ? void 0 : {
-				at,
-				side
-			};
-		}
-	}
-}
-/** This function gives the place where the routes `P` and `Q` part before the first point of the run, or nothing. */
-function partBefore(P, Q) {
-	for (let j = 1;; j++) {
-		const a = P.p[P.s - j];
-		const b = Q.p[Q.s - j];
-		if (a === void 0 || b === void 0) return void 0;
-		if (dist(a, b) > SAME$3) {
-			const from = P.p[P.s - j + 2];
-			const at = P.p[P.s - j + 1];
-			const side = turn$1(from, at, b) - turn$1(from, at, a);
-			return side === 0 ? void 0 : {
-				at,
-				side
-			};
-		}
-	}
-}
-const byEdge$2 = (P, Q) => P.edge < Q.edge ? -1 : P.edge > Q.edge ? 1 : 0;
-/** This function puts the point `a` before the point `b`: the smaller x first, then the smaller y. */
-const firstPoint = (a, b) => a.x < b.x - SAME$3 || Math.abs(a.x - b.x) <= SAME$3 && a.y < b.y;
 /**
 * This function gives the lane order of the edges on a shared way `run` (metro-line order).
 * The routes are polylines that hold the points of the run in a row, in either direction. A route that does not hold the run goes last.
@@ -2300,6 +2358,11 @@ const firstPoint = (a, b) => a.x < b.x - SAME$3 || Math.abs(a.x - b.x) <= SAME$3
 * With the order `bundle`, two routes that part on one side at both ends keep that side.
 * When the two ends disagree, the two routes must cross. The end with the smaller x, then the smaller y, tells the side.
 * Thus each shared way of a common stretch gives two routes the same order, and the crossing is where they part.
+*
+* This relation of two lanes is not transitive, so three lanes can make a cycle. The sort of the engine then gives another order on another engine.
+* Thus the function sorts with a merge sort of the package (LANE-ORDER). The order is the same on each JavaScript engine.
+* On a run with no cycle, the order is the order of each correct sort, for each order of `routes`.
+* On a run with a cycle, the order depends on the order of `routes`. The item LANE-STRETCH is to remove the cycles.
 */
 function orderLanes(run, routes, order = "run") {
 	const placed = [];
@@ -2324,17 +2387,7 @@ function orderLanes(run, routes, order = "run") {
 			else lost.push(r.edge);
 		}
 	}
-	if (order === "run") placed.sort((P, Q) => partAfter(P, Q)?.side ?? partBefore(P, Q)?.side ?? byEdge$2(P, Q));
-	else {
-		placed.sort(byEdge$2);
-		placed.sort((P, Q) => {
-			const after = partAfter(P, Q);
-			const before = partBefore(P, Q);
-			if (after && before && Math.sign(after.side) !== Math.sign(before.side)) return firstPoint(after.at, before.at) ? after.side : before.side;
-			return after?.side ?? before?.side ?? byEdge$2(P, Q);
-		});
-	}
-	return [...placed.map((x) => x.edge), ...lost.sort()];
+	return [...orderPlaced(placed, order).map((x) => x.edge), ...lost.sort()];
 }
 // src/curves/highway/index.ts
 /** A turn smaller than this angle, in radians, is no corner. A turn nearer to a half turn than this angle stays sharp. */
@@ -6123,7 +6176,6 @@ function snellMerges(ways, firstId, clear, delta) {
 	}
 }
 // src/routers/shared.ts
-const byText = (a, b) => a < b ? -1 : a > b ? 1 : 0;
 /** The angle, from -π to π, of the turn at `base` from the direction `from` → `base` to the point `to`. */
 function turn(from, base, to) {
 	const dx = base.x - from.x;
@@ -6428,7 +6480,7 @@ function laneOrderOfRun(run) {
 		}
 		return byText(p.edge.id, q.edge.id);
 	};
-	return [...run.ways].sort(compare).map((w) => w.edge.id);
+	return orderRun(run.ways, compare).map((w) => w.edge.id);
 }
 // src/routers/straight.ts
 /** This function gives the point where the ray from the center of the box to `toward` leaves the box. */
@@ -22999,11 +23051,6 @@ function round3(value) {
 	return r === 0 ? 0 : r;
 }
 // src/order/index.ts
-/** This function compares two edges by the hash of their ids, and then by their ids. Thus the order of two edges does not depend on the input. */
-function byHash(a, b) {
-	if (a.h !== b.h) return a.h - b.h;
-	return a.e.id < b.e.id ? -1 : a.e.id > b.e.id ? 1 : 0;
-}
 /**
 * This function gives the graph with its edges in the stable order of WILD-053: by the FNV-1a hash of the id, then by the id.
 * The nodes and the edges do not change. Two orders of the same edges give the same graph.
@@ -27916,7 +27963,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 42 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 = {
@@ -27935,9 +27982,11 @@ const PORTFOLIO_FIT = {
 		["trunks-tree-bf08", 24],
 		["corners-side", 24],
 		["shared-p2", 24],
-		["w2c:zipper+stretch-b1.1", 18]
+		["w2c:zipper+stretch-b1.1", 18],
+		["hw:weiszfeld", 18],
+		["trunks-gilbert-a07", 18]
 	],
-	"collection|1.1|n25-40": [["w2a:shared-ways+breakeven", 40], ["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": [
@@ -27957,12 +28006,14 @@ const PORTFOLIO_FIT = {
 		["w3e:crossbars+stretch", 24],
 		["trunks-tree-bf06", 24],
 		["w3c:hdbscan+stretch", 18],
-		["shared-wind-p2-r1-e2", 18]
+		["shared-wind-p2-r1-e2", 18],
+		["hw:stubs", 18]
 	],
 	"collection|1.25|n25-40": [
 		["w2a:shared-ways+stretch", 40],
 		["shared-p3", 40],
-		["shared-order-shortest", 32]
+		["shared-order-shortest", 40],
+		["w2b:weiszfeld-a1", 32]
 	],
 	"collection|1.25|n41-64": [],
 	"collection|1.25|n65-128": [],
@@ -27983,13 +28034,14 @@ const PORTFOLIO_FIT = {
 		["shared-wind-p2-r1-e2", 24],
 		["trunks-tree-bf06", 24],
 		["shared-flow-a06-p3", 24],
-		["shared-wind-p3-r1", 18],
-		["trunks-gilbert-a07", 18]
+		["shared-wind-p3-r1", 24],
+		["trunks-gilbert-a07", 24]
 	],
 	"collection|1.5|n25-40": [
 		["shared-p3", 40],
 		["hw:lanes", 40],
-		["shared-wind-p2-r1-e2", 32]
+		["shared-wind-p2-r1-e2", 40],
+		["hw:crossbars", 32]
 	],
 	"collection|1.5|n41-64": [["shared-flow-a06-p3", 64]],
 	"collection|1.5|n65-128": [],
@@ -27999,33 +28051,36 @@ const PORTFOLIO_FIT = {
 		["w3d:kdeeb+stretch", 12],
 		["w3c:hough-wide", 12],
 		["w3d:kdeeb-routes", 12],
-		["hw:stubs", 10],
-		["hw:spiral", 10],
+		["hw:stubs", 12],
+		["hw:spiral", 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", 40], ["w3a:spiral-a15", 32]],
-	"all|1.1|n41-64": [],
+	"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", 10],
+		["hw:level-links", 12],
 		["w3b:growth-input", 10],
-		["w3e:confluent+stretch", 10]
+		["w3e:confluent+stretch", 10],
+		["w3d:kdeeb-nomask", 10]
 	],
 	"all|1.25|n13-24": [
 		["w3d:kdeeb-routes", 24],
-		["w3f:p-hub-a0.2", 18],
-		["w3d:kdeeb-nomask", 18]
+		["w3f:p-hub-a0.2", 24],
+		["w3d:kdeeb-nomask", 18],
+		["w3a:spiral-n3", 18]
 	],
-	"all|1.25|n25-40": [],
+	"all|1.25|n25-40": [["w3d:kdeeb-routes", 32]],
 	"all|1.25|n41-64": [],
 	"all|1.25|n65-128": [],
 	"all|1.5|n1-12": [
@@ -28036,7 +28091,11 @@ const PORTFOLIO_FIT = {
 		["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", 40]],
+	"all|1.5|n25-40": [
+		["hw:growth", 40],
+		["w3b:growth-s0.7", 40],
+		["w3b:growth-s0.3", 32]
+	],
 	"all|1.5|n41-64": [],
 	"all|1.5|n65-128": []
 };
@@ -28736,6 +28795,8 @@ const PORTFOLIO_SETS = {
 	]
 };
 // 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. */
@@ -28743,13 +28804,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`. */
@@ -28774,10 +28838,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);
@@ -28796,6 +28861,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 }
@@ -28834,6 +28900,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, 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 };
+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