@tangle-network/charts 0.1.7 → 0.1.9

package/dist/index.js

@@ -776,12 +776,17 @@ function comparisonIntervals(rows, setups, o) {
 		refused: rows.every((r) => r.interval === null) ? `${rows.length} ${plural(rows.length, "comparison")} listed; none carries an interval.` : `No comparison can be drawn. ${refused.join("; ")}.`
 	};
 	const clears = drawn.filter(({ row }) => row.interval.lower > row.minimumEffect && (intervalGap(row.exactInterval) !== null || row.exactInterval.lower > row.minimumEffect));
-	const finding = clears.length === drawn.length ? drawn.length === 1 ? "The step clears its registered minimum effect." : `Each of the ${drawn.length} steps clears its registered minimum effect.` : clears.length === 0 ? `No step clears its registered minimum effect.` : `${clears.length} of ${drawn.length} steps clear their registered minimum effect.`;
+	const minimum = drawn[0].row.minimumEffect;
+	const sameMinimum = drawn.every(({ row }) => row.minimumEffect === minimum);
+	const pluralSubject = clears.length > 1 && clears.length < drawn.length;
+	const difference = drawn.every(({ row }) => row.minimumEffect >= 0) ? "improvement" : "difference";
+	const requirement = sameMinimum ? `the required ${difference} of more than ${new Intl.NumberFormat("en-US", { maximumFractionDigits: 12 }).format(minimum * 100)} percentage points in ${o.measure}` : `${pluralSubject ? "their" : "its"} required ${difference}${pluralSubject ? "s" : ""}`;
+	const finding = `${clears.length === drawn.length ? drawn.length === 1 ? "The comparison" : "Every comparison" : clears.length === 0 ? "No comparison" : `${clears.length} of ${drawn.length} comparisons`} ${pluralSubject ? "support" : "supports"} ${requirement}.`;
 	const pairs = drawn.reduce((s, d) => s + d.row.pairs, 0);
 	const lede = `${drawn.length} ${plural(drawn.length, "comparison")} over ${pairs} paired ${plural(pairs, "attempt")}${refused.length ? `; ${refused.length} not drawn` : ""}.`;
 	const names = [...new Set(drawn.map((d) => intervalName(d.row.interval)))];
 	const exactNames = [...new Set(drawn.filter((d) => intervalGap(d.row.exactInterval) === null).map((d) => intervalName(d.row.exactInterval)))];
-	const read = `Each bar is the ${names.join(" or ")} interval on the difference in ${o.measure}` + (exactNames.length ? `; the thin bar under it is the ${exactNames.join(" or ")} interval` : "") + ". A step is backed when every bar lies wholly right of the dashed minimum effect.";
+	const read = `Each bar is the ${names.join(" or ")} interval on the difference in ${o.measure}` + (exactNames.length ? `; the thin bar under it is the ${exactNames.join(" or ")} interval` : "") + ". A comparison is supported when every bar lies wholly right of the dashed minimum effect.";
 	const columns = [
 		{ label: "Comparison" },
 		{
@@ -966,12 +971,14 @@ function costFrontier(rows, o) {
 		const cheapest = [...costed].sort((a, b) => cost(a) - cost(b))[0];
 		finding = `${cheapest.label} has the lowest cost per pass, ${usd(cost(cheapest))}${est(cheapest)}.`;
 	}
-	const lede = `${costed.length} of ${rows.length} setups are plotted; ` + (drawLine ? `${front.length} sit on the producer's frontier.` : front.length === 1 ? "1 sits on the producer's frontier." : "the producer computed no frontier.");
+	const lowest = Math.min(...costed.map(cost));
+	const highest = Math.max(...costed.map(cost));
+	const lede = (lowest === highest ? `Cost per pass is ${usd(lowest)}.` : `Cost per pass ranges from ${usd(lowest)} to ${usd(highest)}.`) + (costed.some((row) => row.cost.basis === "estimated") ? " Costs include estimates." : "");
 	const read = `Higher ${o.measure} and lower cost per pass are better; on the wide plot, better is up and right.` + (drawLine ? " Filled points sit on the frontier; the line joins them." : "") + (costed.some((r) => r.onFront && r.cost.basis !== "receipts") ? " A hollow accent ring is a frontier point with an estimated cost." : "");
 	const intervals = [...new Set(costed.filter((r) => rateIntervalGap(r) === null).map((r) => intervalName(r.interval)))];
 	const method = [
 		`Cost per pass is model spend over passed attempts, ${[...new Set(costed.map((r) => r.cost.basis))].map((b) => b === "receipts" ? "from router receipts" : b === "estimated" ? "estimated, not billed" : "from an unrecorded source").join(" or ")}.`,
-		front.length ? "The frontier is the producer's: no setup off it is both cheaper and higher." : "The producer did not compute a frontier.",
+		front.length ? `A frontier setup has no alternative with both lower cost and higher ${o.measure}.` : "",
 		intervals.length ? `Vertical lines: ${intervals.join(", ")} on the ${o.measure}.` : ""
 	].filter(Boolean).join(" ");
 	const columns = [
@@ -1744,7 +1751,7 @@ function taskMatrix(tasks, setupsIn, cells, o = {}) {
 		const most = Math.max(...perSetup.map((x) => x.k));
 		const leaders = perSetup.filter((x) => x.k === most).map((x) => x.s.label);
 		const rest = perSetup.filter((x) => x.k !== most);
-		if (setups.length > 1 && everywhere > 0) finding = `${everywhere} of ${tasksN} passed at least once for every ${noun.setup}.`;
+		if (setups.length > 1 && everywhere > 0) finding = `Every ${noun.setup} passed at least once on ${everywhere} shared ${plural(everywhere, noun.task)} out of ${tasks.length}.`;
 		else if (most === 0) finding = `No ${noun.task} passed for any ${noun.setup}.`;
 		else {
 			const tail = rest.length && rest.every((x) => x.k === 0) ? `; ${rest.length === 1 ? rest[0].s.label : `every other ${noun.setup}`} on none` : "";

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@tangle-network/charts",
-  "version": "0.1.7",
+  "version": "0.1.9",
   "description": "Benchmark figures as static SVG and HTML tables: ranked rates, cost frontier, comparison intervals, task matrix and breakdown. Draws from producer data and refuses what it cannot draw honestly.",
   "type": "module",
   "license": "MIT",