@tangle-network/charts 0.1.3 → 0.1.5

package/README.md

@@ -18,9 +18,13 @@ A figure function returns a `Refusal` in place of a figure it cannot draw honest
 The producer's `estimate` controls rate marks: `descriptive` draws a rate bar and may show a named Wilson score interval when that estimate meets the producer's unit threshold.
 Task-clustered bootstrap intervals require a `bootstrap` estimate.
 Intervals without support are marked as not drawn in the data table and note.
-A missing, zero, or unproven cost prints `unknown`; zero passes print `no pass`.
+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.
 
 It has no runtime dependencies and uses no DOM, so it runs in a Worker, a build step or a browser.

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

@@ -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))];
@@ -1596,8 +1605,17 @@ function tilesOf(cell) {
 		while (out.length < attempts) out.push("ungraded");
 		return out;
 	}
-	if (cell.solved !== null) return [...Array(cell.solved).fill("solved"), ...Array(attempts - cell.solved).fill("open")];
-	return Array(attempts).fill("ungraded");
+	if (cell.solved !== null) return [
+		...Array(cell.solved).fill("solved"),
+		...Array(attempts - cell.solved - (cell.flagged ?? 0) - (cell.unmeasured ?? 0)).fill("open"),
+		...Array(cell.flagged ?? 0).fill("flagged"),
+		...Array(cell.unmeasured ?? 0).fill("unmeasured")
+	];
+	return [
+		...Array(attempts - (cell.flagged ?? 0) - (cell.unmeasured ?? 0)).fill("ungraded"),
+		...Array(cell.flagged ?? 0).fill("flagged"),
+		...Array(cell.unmeasured ?? 0).fill("unmeasured")
+	];
 }
 function tile(kind, x, y) {
 	switch (kind) {
@@ -1619,7 +1637,7 @@ function cellText(cell, means) {
 	if (cell.attempts === 0) return "none counted";
 	if (cell.solved !== null) return kn(cell.solved, cell.attempts);
 	if (cell.tiers) return tierSummary(cell.tiers, cell.unmeasured, cell.flagged);
-	return `${cell.attempts}`;
+	return tierSummary(null, cell.unmeasured, cell.flagged) ? `${cell.attempts} · ${tierSummary(null, cell.unmeasured, cell.flagged)}` : `${cell.attempts}`;
 }
 function describe(task, setup, cell, means) {
 	if (!cell || (means ? cell.mean === null : cell.attempts === null)) return `${task} · ${setup.label}: not run`;
@@ -1684,7 +1702,7 @@ function taskMatrix(tasks, setupsIn, cells, o = {}) {
 			refused: `${cell.task} × ${cell.setup}: cost is invalid.`
 		};
 		if (!means && cell.attempts !== null) {
-			if (tierTotal(cell.tiers) + (cell.flagged ?? 0) + (cell.unmeasured ?? 0) > cell.attempts || cell.solved !== null && cell.solved > cell.attempts) return {
+			if (tierTotal(cell.tiers) + (cell.flagged ?? 0) + (cell.unmeasured ?? 0) > cell.attempts || cell.solved !== null && cell.solved + (cell.flagged ?? 0) + (cell.unmeasured ?? 0) > cell.attempts) return {
 				id,
 				refused: `${cell.task} × ${cell.setup}: grades or passes exceed its ${cell.attempts} attempts.`
 			};
@@ -1761,7 +1779,7 @@ function taskMatrix(tasks, setupsIn, cells, o = {}) {
 	const kinds = /* @__PURE__ */ new Set();
 	if (!means) for (const cell of cells) for (const k of tilesOf(cell)) kinds.add(k);
 	const tiered = cells.some((c) => c.tiers !== null);
-	const read = means ? `Each cell is one ${noun.setup}'s mean on one ${noun.task}, printed and drawn as a bar on a shared scale; · marks a pair never scored.` : tiered ? `One tile per ${noun.attempt}, best first: tiles fill by App Grade tier and an outline is F${o.passTier ? `; ${o.passTier} or better passes` : ""}. Tile order is not run order.` : `One tile per ${noun.attempt}: a filled tile passed and an outline did not. Tile order is not run order.`;
+	const read = means ? `Each cell is one ${noun.setup}'s mean on one ${noun.task}, printed and drawn as a bar on a shared scale; · marks a pair never scored.` : tiered ? `One tile per ${noun.attempt}, best first: tiles fill by App Grade tier and an outline is F${o.passTier ? `; ${o.passTier} or better passes` : ""}. Tile order is not run order.` : `One tile per ${noun.attempt}: a filled tile passed and a plain outline did not. Dashed, dotted, and struck tiles keep their separate observation states. Tile order is not run order.`;
 	const method = means ? `Each cell is the producer's mean score for one ${noun.setup} on one ${noun.task}.` : [
 		tiered ? `Tiles show the App Grade tier of each ${noun.attempt}${o.passTier ? `, and ${o.passTier} or better counts as a pass` : ""}.` : `Filled tiles are the ${plural(2, noun.attempt)} the producer marks solved.`,
 		kinds.has("unmeasured") ? `U marks ${noun.attempt === "attempt" ? "an attempt" : `a ${noun.attempt}`} the grader could not measure.` : "",
@@ -1774,8 +1792,8 @@ function taskMatrix(tasks, setupsIn, cells, o = {}) {
 	}))], tasks.map((task) => [task, ...setups.map((s) => {
 		const cell = at(task, s);
 		const main = cellText(cell, means);
-		const extra = !means && cell && cell.solved !== null && cell.tiers ? ` · ${tierSummary(cell.tiers, cell.unmeasured, cell.flagged)}` : "";
-		const cost = cell && cell.costUsd !== null ? ` · ${cell.costUsd > 0 ? usd(cell.costUsd) : "cost unknown"}` : "";
+		const extra = !means && cell && cell.solved !== null && (cell.tiers || cell.unmeasured || cell.flagged) ? ` · ${tierSummary(cell.tiers, cell.unmeasured, cell.flagged)}` : "";
+		const cost = cell && cell.costUsd !== null ? ` · ${usd(cell.costUsd)}` : "";
 		return main === "·" ? "not run" : `${main}${extra}${cost}`;
 	})]));
 	const scaleMax = Math.max(1, ...cells.map((c) => c.mean ?? 0));

package/package.json

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