@tangle-network/agent-eval 0.217.1 → 0.218.1

package/dist/{tree-BGRglkKd.js → tree-B5e1uAeL.js}

@@ -4,8 +4,8 @@ import { t as mulberry32 } from "./random-DDDcC7YU.js";
 import { r as holm } from "./multiplicity-Sg0U7h8j.js";
 import { o as pairedSignTest, r as DECISION_PAIRED_DELTA_STATISTIC, t as mean } from "./mean-BbA_JCzW.js";
 import { i as pairedDeltaTest, r as minimumPairsForPairedDeltaTest } from "./paired-promotion-decision-D0SHb-ZL.js";
-import { A as normalizeSignedZero, D as searchEstimateMethod, O as searchPosterior, b as verifySearchClaim, d as rankingSplit, f as summarizeSamples, k as seedFromDigest, n as paretoFrontier, o as searchPolicyView, u as INSUFFICIENT_FROM, w as estimateNode } from "./pareto-BzsxidFD.js";
-import { l as searchUnitScores } from "./search-ledger-TUvB5gWH.js";
+import { A as normalizeSignedZero, D as searchEstimateMethod, O as searchPosterior, b as verifySearchClaim, d as rankingSplit, f as summarizeSamples, k as seedFromDigest, n as paretoFrontier, o as searchPolicyView, u as INSUFFICIENT_FROM, w as estimateNode } from "./pareto-CTv8vozZ.js";
+import { l as searchUnitScores } from "./search-ledger-ClpN4I3e.js";
 import { t as roundDecimal } from "./round-decimal-COrKglMh.js";
 import { defineInlineResource } from "@tangle-network/agent-interface";
 //#region src/search/lenses/edit-credit-content.ts
@@ -594,6 +594,14 @@ function formatEstimate(estimate) {
 * `readArtifact` returns for its references.
 */
 function editCredit(state, options) {
+	return editCreditResult(chanceSignal(tallyAndLink(rankGenes(geneCredits(cleanSteps(trackCarriers(findGenes(editCreditContext({
+		state,
+		options
+	})))))))));
+}
+/** The search header, split, direction and the content of every node. */
+function editCreditContext(prev) {
+	const { state, options } = prev;
 	const header = state.header;
 	if (!header) throw new Error(`editCredit: search ${state.searchId} has not been opened`);
 	const split = options.split ?? rankingSplit(state);
@@ -607,6 +615,23 @@ function editCredit(state, options) {
 	for (const node of nodes) contents.set(node.nodeId, nodeContent(options, node.artifact));
 	const known = (nodeId) => contents.get(nodeId);
 	const invalid = new Set(nodes.filter((node) => node.status === "invalid").map((n) => n.nodeId));
+	return {
+		...prev,
+		header,
+		split,
+		direction,
+		sign,
+		interactionGenes,
+		nodes,
+		byId,
+		contents,
+		known,
+		invalid
+	};
+}
+/** Genes: every lineage edge in ledger order, with the steps between a node and its parents. */
+function findGenes(prev) {
+	const { state, byId, contents, known } = prev;
 	const genes = /* @__PURE__ */ new Map();
 	const byLocus = /* @__PURE__ */ new Map();
 	const introducedOn = /* @__PURE__ */ new Map();
@@ -689,6 +714,22 @@ function editCredit(state, options) {
 		}
 		introducedOn.set(edge.edgeId, introducedHere);
 	}
+	return {
+		...prev,
+		genes,
+		byLocus,
+		introducedOn,
+		unknownEdges,
+		stepList,
+		stepKeys,
+		lineageEdges,
+		readEdges,
+		edgeOrdinal
+	};
+}
+/** Carrying: every gene against every node whose content is known, and the steps each gene flips. */
+function trackCarriers(prev) {
+	const { nodes, contents, invalid, genes, stepList } = prev;
 	const carriersOf = /* @__PURE__ */ new Map();
 	const carried = /* @__PURE__ */ new Map();
 	for (const record of genes.values()) {
@@ -704,6 +745,16 @@ function editCredit(state, options) {
 	}
 	for (const step of stepList) for (const [geneId, set] of carriersOf) if (set.has(step.parentId) !== set.has(step.childId)) step.flips.add(geneId);
 	const measurable = stepList.filter((step) => !invalid.has(step.parentId) && !invalid.has(step.childId));
+	return {
+		...prev,
+		carriersOf,
+		carried,
+		measurable
+	};
+}
+/** The edits each gene was introduced in, and the clean steps that isolate each gene. */
+function cleanSteps(prev) {
+	const { state, split, genes, introducedOn, carriersOf, measurable } = prev;
 	const editsOf = /* @__PURE__ */ new Map();
 	for (const record of genes.values()) editsOf.set(record.geneId, record.introduced.map((introduction) => new Set(introducedOn.get(introduction.edgeId))));
 	const unitMeansOf = memo((nodeId) => {
@@ -729,6 +780,18 @@ function editCredit(state, options) {
 			lackingId: childCarries ? step.parentId : step.childId
 		});
 	}
+	return {
+		...prev,
+		editsOf,
+		unitMeansOf,
+		cellsDigestOf,
+		cleanOf,
+		flipCount
+	};
+}
+/** Per-gene paired credit over the clean steps. */
+function geneCredits(prev) {
+	const { split, direction, genes, unitMeansOf, cellsDigestOf, cleanOf } = prev;
 	const credits = /* @__PURE__ */ new Map();
 	for (const record of genes.values()) {
 		const steps = cleanOf.get(record.geneId) ?? [];
@@ -771,6 +834,14 @@ function editCredit(state, options) {
 			cellSetDigest
 		}));
 	}
+	return {
+		...prev,
+		credits
+	};
+}
+/** Linkage groups, then the genes in verdict order. */
+function rankGenes(prev) {
+	const { sign, invalid, genes, carriersOf, editsOf, cleanOf, flipCount, credits } = prev;
 	const linkageKey = (geneId) => canonicalString((cleanOf.get(geneId) ?? []).map(({ step, carrierId }) => `${step.key}:${carrierId === step.childId ? "+" : "-"}`).sort(compareCodeUnits));
 	const linkGroups = /* @__PURE__ */ new Map();
 	for (const record of [...genes.values()].sort((a, b) => compareOrder(a.order, b.order))) {
@@ -811,6 +882,17 @@ function editCredit(state, options) {
 		insufficient: 3
 	};
 	geneList.sort((a, b) => verdictRank[a.verdict] - verdictRank[b.verdict] || improvementLow(b.credit, sign) - improvementLow(a.credit, sign) || gain(b.credit, sign) - gain(a.credit, sign) || compareOrder(genes.get(a.geneId).order, genes.get(b.geneId).order));
+	return {
+		...prev,
+		linkageKey,
+		linkGroups,
+		geneList,
+		verdictRank
+	};
+}
+/** Verdict counts, interactions, skill candidates and lineage rows. */
+function tallyAndLink(prev) {
+	const { state, header, split, sign, interactionGenes, nodes, byId, contents, genes, carriersOf, carried, unitMeansOf, cleanOf, geneList } = prev;
 	const counts = emptyCounts();
 	const editCounts = emptyCounts();
 	for (const gene of geneList) {
@@ -827,23 +909,49 @@ function editCredit(state, options) {
 	});
 	const skillCandidates = skills(geneList, genes, header.subject, split);
 	const lineage = lineageRows(state, nodes, byId, contents, carried);
+	return {
+		...prev,
+		counts,
+		editCounts,
+		interactions,
+		skillCandidates,
+		lineage
+	};
+}
+/** How many measured edits the lens calls reusable, and how many it would call so by chance. */
+function chanceSignal(prev) {
+	const { split, measurable, geneList, counts, editCounts } = prev;
 	const isMeasured = (gene) => gene.credit.method === "descriptive" || gene.credit.method === "bootstrap";
 	const measured = geneList.filter(isMeasured).length;
 	const measuredLeads = geneList.filter((gene) => isMeasured(gene) && (gene.linkage ?? gene.geneId) === gene.geneId);
 	const expectedReusable = normalizeSignedZero(Math.round(measuredLeads.reduce((sum, gene) => sum + chanceReusable(gene.credit.pairs), 0) * 1e6) / 1e6);
 	const top = geneList.filter((gene) => gene.verdict === "reusable" && (gene.linkage ?? gene.geneId) === gene.geneId).map((gene) => gene.geneId);
+	const signal = measured === 0 ? {
+		name: EDIT_CREDIT_SIGNAL,
+		value: null,
+		basis: `insufficient: no gene has ${DESCRIPTIVE_FROM} ${split} units on clean steps (${geneList.length} genes, ${measurable.length} measurable steps)`,
+		top: []
+	} : {
+		name: EDIT_CREDIT_SIGNAL,
+		value: editCounts.reusable,
+		basis: `independent edits pairedDeltaTest finds improve the objective on the ${split} split (${counts.reusable} genes), of ${measuredLeads.length} edits (${measured} genes) measured on ${DESCRIPTIVE_FROM} or more units; about ${expectedReusable.toFixed(2)} would be called reusable by chance with no true effect (unadjusted)`,
+		top
+	};
 	return {
-		signal: measured === 0 ? {
-			name: EDIT_CREDIT_SIGNAL,
-			value: null,
-			basis: `insufficient: no gene has ${DESCRIPTIVE_FROM} ${split} units on clean steps (${geneList.length} genes, ${measurable.length} measurable steps)`,
-			top: []
-		} : {
-			name: EDIT_CREDIT_SIGNAL,
-			value: editCounts.reusable,
-			basis: `independent edits pairedDeltaTest finds improve the objective on the ${split} split (${counts.reusable} genes), of ${measuredLeads.length} edits (${measured} genes) measured on ${DESCRIPTIVE_FROM} or more units; about ${expectedReusable.toFixed(2)} would be called reusable by chance with no true effect (unadjusted)`,
-			top
-		},
+		...prev,
+		isMeasured,
+		measured,
+		measuredLeads,
+		expectedReusable,
+		top,
+		signal
+	};
+}
+/** The lens result: the signal and its data. */
+function editCreditResult(prev) {
+	const { split, direction, nodes, contents, invalid, unknownEdges, stepList, lineageEdges, readEdges, measurable, geneList, counts, editCounts, interactions, skillCandidates, lineage, measuredLeads, expectedReusable, signal } = prev;
+	return {
+		signal,
 		data: {
 			split,
 			direction,
@@ -4033,4 +4141,4 @@ function tree(state) {
 //#endregion
 export { vectorEmbedding as _, skillCalibration as a, editCreditText as b, META_SEARCH_SCORE_SOURCE as c, searchPolicyGenome as d, landscape as f, surfaceTextEdits as g, lineageEdits as h, nextUnitExtension as i, metaSearch as l, formatLandscape as m, taskMatrix as n, skillManifold as o, draftOnPlateau as p, formatSkillManifold as r, renderMetaSearchText as s, tree as t, metaSearchScore as u, front as v, editCredit as y };
 
-//# sourceMappingURL=tree-BGRglkKd.js.map
+//# sourceMappingURL=tree-B5e1uAeL.js.map