@tangle-network/charts 0.1.4 → 0.1.6

package/README.md

@@ -21,6 +21,8 @@ Intervals without support are marked as not drawn in the data table and note.
 Cost-per-pass figures print `unknown` for missing, zero, or unproven cost; zero passes print `no pass`.
 A matrix preserves an observed zero cost as $0 and omits a null cost.
 Rank numbers require every row to carry both a rank and a `bootstrap` estimate.
+For an unranked descriptive report, `rankedRates` accepts `order: "input"` to retain the producer's row order and make no ranking claim.
+The default keeps supported ranks or sorts unranked rows by observed rate.
 Malformed rates, intervals, matrix counts, and breakdown counts return a refusal instead of a misleading mark.
 Unmeasured and flagged matrix attempts keep distinct marks and table counts, even without tier grades.
 An interval whisker is omitted when its bounds exclude the row's rate.

package/dist/index.d.ts

@@ -180,6 +180,8 @@ export declare function rateOrder<T extends Pick<RateRow, "rank" | "rate" | "est
 interface RankedRatesOptions {
   /** What the rate measures, lower case: "solve rate". */
   measure: string;
+  /** Preserve unranked input order instead of sorting observed rates. */
+  order?: "input";
   /** The App Grade tier a pass needs; marks the tier strip. */
   passTier?: Tier;
   /** Singular, lower-case nouns: what one unit of `attempts` is, and what a row is. */

package/dist/index.js

@@ -999,7 +999,7 @@ function costFrontier(rows, o) {
 		row.label,
 		drawable(row.estimate) ? pct(row.rate) : estimateNote(row.estimate, row.attempts),
 		kn(row.solved, row.attempts),
-		rateIntervalGap(row) === null ? `${pct(row.interval.lower)}–${pct(row.interval.upper)} (${intervalName(row.interval)}, n=${row.attempts})` : `not drawn (${rateIntervalGap(row)})`,
+		rateIntervalGap(row) === null ? `${pct(row.interval.lower)}–${pct(row.interval.upper)} (${intervalName(row.interval)}, ${row.attempts} attempts)` : `not drawn (${rateIntervalGap(row)})`,
 		costText(row.cost, row.solved),
 		row.cost.basis,
 		row.onFront === null ? "not computed" : row.onFront ? "yes" : "no"
@@ -1065,7 +1065,7 @@ function narrowList(rows) {
 		const fact = placed ? `${count} · ${costText(row.cost, row.solved)} per pass${row.onFront ? " · on the frontier" : ""}` : `${count} · ${reason}not plotted`;
 		const facts = fitLines(fact.split(" · "), 358, 12, "mono");
 		marks += textBlock(facts, 0, cy + 12, 16, `class="tgc-ink-muted tgc-num" font-size="12"`);
-		const interval = rateIntervalGap(row) === null ? ` · ${intervalName(row.interval)} interval ${pct(row.interval.lower)}–${pct(row.interval.upper)}, n=${row.attempts}` : "";
+		const interval = rateIntervalGap(row) === null ? ` · ${intervalName(row.interval)} interval ${pct(row.interval.lower)}–${pct(row.interval.upper)}, ${row.attempts} attempts` : "";
 		out += titled(`${row.label} · ${fact}${interval}`, marks);
 		y = cy + 4 + facts.length * 16;
 		if (i < rows.length - 1) out += line(0, y + 2, 358, y + 2, "tgc-rule");
@@ -1228,7 +1228,7 @@ function plot(costed, unplaced, drawLine, o) {
 	}
 	for (const p of placed) {
 		const cls = p.row.onFront ? p.estimated ? "tgc-pt-est" : "tgc-pt-front" : "tgc-pt";
-		out += titled(`${p.row.label} · ${pct(p.row.rate)} ${o.measure} · ${kn(p.row.solved, p.row.attempts)} passed · ${costText(p.row.cost, p.row.solved)} per pass${rateIntervalGap(p.row) === null ? ` · ${intervalName(p.row.interval)} interval ${pct(p.row.interval.lower)}–${pct(p.row.interval.upper)}, n=${p.row.attempts}` : ""}${p.row.onFront ? " · on the frontier" : ""}`, circle(p.x, p.y, 4, cls));
+		out += titled(`${p.row.label} · ${pct(p.row.rate)} ${o.measure} · ${kn(p.row.solved, p.row.attempts)} passed · ${costText(p.row.cost, p.row.solved)} per pass${rateIntervalGap(p.row) === null ? ` · ${intervalName(p.row.interval)} interval ${pct(p.row.interval.lower)}–${pct(p.row.interval.upper)}, ${p.row.attempts} attempts` : ""}${p.row.onFront ? " · on the frontier" : ""}`, circle(p.x, p.y, 4, cls));
 	}
 	out += labels.join("");
 	let h = 320;
@@ -1258,7 +1258,8 @@ const chartTokensCss = ":root{--chart-ink:#2d2d2d;--chart-ink-muted:#686868;--ch
 * cost per pass and median run. An App Grade grader adds a tier strip under
 * the bar with a tick at the pass tier. Bootstrap rows with ranks keep their order;
 * unranked rows sort by rate, rows with too few units last, and the finding
-* says no comparison backs the order.
+* says no comparison backs the order. Explicit input order keeps unranked rows
+* where the producer placed them and makes no ranking claim.
 *
 * Refuses: a bar when the producer labels the estimate `none` or
 * `insufficient` (the row prints its count only); a whisker whose interval
@@ -1282,6 +1283,14 @@ function rankedRates(input, o) {
 		id,
 		refused: `No ${noun.setup} has an ${noun.attempt}.`
 	};
+	if (o.order !== void 0 && o.order !== "input") return {
+		id,
+		refused: "Unknown row order."
+	};
+	if (o.order === "input" && input.some((row) => row.rank !== null)) return {
+		id,
+		refused: "Input order requires unranked rows."
+	};
 	for (const row of input) {
 		const gap = rateDataGap(row);
 		if (gap) return {
@@ -1307,7 +1316,7 @@ function rankedRates(input, o) {
 		}
 	}
 	const ranked = input.every((row) => row.rank !== null && row.estimate === "bootstrap");
-	const rows = rateOrder(input);
+	const rows = o.order === "input" ? [...input] : rateOrder(input);
 	const layout = {
 		ranked,
 		cost: rows.some((r) => perPass(r.cost) !== null || r.cost.basis !== "unknown" || r.cost.receipts !== null),
@@ -1323,8 +1332,8 @@ function rankedRates(input, o) {
 	const setupsN = `${rows.length} ${plural(rows.length, noun.setup)}`;
 	const top = rows[0];
 	const uniqueTop = bars.length === 1 || bars.length > 1 && bars[1].rate < top.rate;
-	const finding = ranked ? `${top.label} ranks first, passing ${pct(top.rate)} of ${plural(2, noun.attempt)}.` : bars.length === 0 ? `No ${noun.setup} has enough units to draw a ${o.measure}.` : rows.length === 1 ? `${top.label} passes ${pct(top.rate)} of ${top.attempts} ${plural(top.attempts, noun.attempt)}.` : uniqueTop ? `${top.label} has the highest ${o.measure}, ${pct(top.rate)} of ${top.attempts} ${plural(top.attempts, noun.attempt)}; no comparison backs the order.` : `Sorted by ${o.measure}; no comparison backs the order.`;
-	const lede = `${passed} of ${attempts} ${plural(attempts, noun.attempt)} passed across ${setupsN}.` + (noBar.length && bars.length ? ` ${noBar.length} of ${setupsN} have too few units to draw a rate; they come last.` : "");
+	const finding = ranked ? `${top.label} ranks first, passing ${pct(top.rate)} of ${plural(2, noun.attempt)}.` : bars.length === 0 ? `No ${noun.setup} has enough units to draw a ${o.measure}.` : o.order === "input" ? `${capitalize(o.measure)} by ${noun.setup}; no ranking is claimed.` : rows.length === 1 ? `${top.label} passes ${pct(top.rate)} of ${top.attempts} ${plural(top.attempts, noun.attempt)}.` : uniqueTop ? `${top.label} has the highest ${o.measure}, ${pct(top.rate)} of ${top.attempts} ${plural(top.attempts, noun.attempt)}; no comparison backs the order.` : `Sorted by ${o.measure}; no comparison backs the order.`;
+	const lede = `${passed} of ${attempts} ${plural(attempts, noun.attempt)} passed across ${setupsN}.` + (noBar.length && bars.length ? ` ${noBar.length} of ${setupsN} have too few units to draw a rate${o.order === "input" ? "." : "; they come last."}` : "");
 	const intervalNames = [...new Set(whiskers.map((row) => intervalName(row.interval)))];
 	const read = bars.length ? [`Bars show the share of ${plural(2, noun.attempt)} that passed${whiskers.length ? `; whiskers show the ${intervalNames.join(" or ")} interval` : ""}.`, tiered ? `The strip under a bar splits ${plural(2, noun.attempt)} by App Grade tier${o.passTier ? `, and the tick marks ${o.passTier} or better` : ""}.` : ""].filter(Boolean).join(" ") : `Counts show ${plural(2, noun.attempt)} passed; no ${noun.setup} has enough units to draw a rate.`;
 	const bases = [...new Set(rows.filter((r) => perPass(r.cost) !== null).map((r) => r.cost.basis))];
@@ -1379,7 +1388,7 @@ function rankedRates(input, o) {
 			String(row.solved),
 			String(row.attempts),
 			drawable(row.estimate) ? pct(row.rate) : estimateNote(row.estimate, row.attempts),
-			rateIntervalGap(row) === null ? `${pct(row.interval.lower)}–${pct(row.interval.upper)} (${intervalName(row.interval)}, n=${row.attempts})` : `not drawn (${rateIntervalGap(row)})`,
+			rateIntervalGap(row) === null ? `${pct(row.interval.lower)}–${pct(row.interval.upper)} (${intervalName(row.interval)}, ${row.attempts} attempts)` : `not drawn (${rateIntervalGap(row)})`,
 			...tiered ? [row.tiers ? [tierSummary(row.tiers), offLadder ? `${offLadder} off the ladder` : ""].filter(Boolean).join(" · ") || "none" : "not graded"] : [],
 			...layout.cost ? [costText(row.cost, row.solved), row.cost.basis + (row.cost.receipts !== null ? `, ${row.cost.receipts} receipts` : "")] : [],
 			...layout.median ? [row.medianWallMs === null ? "unknown" : duration(row.medianWallMs)] : []

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@tangle-network/charts",
-  "version": "0.1.4",
+  "version": "0.1.6",
   "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",