@tangle-network/charts 0.1.3 → 0.1.4

package/README.md

@@ -18,9 +18,11 @@ 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.
 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.js

@@ -1596,8 +1596,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 +1628,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 +1693,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 +1770,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 +1783,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.4",
   "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",