@tangle-network/agent-eval 0.129.0 → 0.130.0

package/dist/task-failure-attributes-CQZlB3et.js

@@ -0,0 +1,311 @@
+import { s as ValidationError } from "./errors-8YnH8WlF.js";
+import { LLM_CACHED_TOKEN_ATTR_KEYS, LLM_CACHE_WRITE_TOKEN_ATTR_KEYS, LLM_COST_ATTR_KEYS, LLM_INPUT_TOKEN_ATTR_KEYS, LLM_OUTPUT_TOKEN_ATTR_KEYS, LLM_REASONING_TOKEN_ATTR_KEYS, RUN_COST_ATTR_KEYS } from "./trace-attributes.js";
+import "./tools-BmuN627J.js";
+import { t as FAILURE_CLASSES } from "./schema-CRhEY1SO.js";
+//#region src/trace/error-classification.ts
+/**
+* Classify errored spans without counting a propagated parent status as a
+* second execution failure.
+*/
+function summarizeTraceErrors(signals) {
+	const byId = /* @__PURE__ */ new Map();
+	for (const signal of signals) {
+		if (byId.has(signal.id)) throw new Error(`summarizeTraceErrors: duplicate span id '${signal.id}'`);
+		byId.set(signal.id, signal);
+	}
+	const propagated = /* @__PURE__ */ new Set();
+	for (const signal of signals) {
+		if (!signal.error) continue;
+		const visited = /* @__PURE__ */ new Set();
+		let parentId = signal.parentId;
+		while (parentId && !visited.has(parentId)) {
+			visited.add(parentId);
+			const parent = byId.get(parentId);
+			if (!parent) break;
+			if (parent.error) propagated.add(parent.id);
+			parentId = parent.parentId;
+		}
+	}
+	const summary = {
+		total: 0,
+		execution: 0,
+		process: 0,
+		guardrail: 0,
+		evaluation: 0,
+		propagated: 0,
+		unclassified: 0
+	};
+	for (const signal of signals) {
+		if (!signal.error) continue;
+		summary.total += 1;
+		if (signal.role === "GUARDRAIL") summary.guardrail += 1;
+		else if (signal.role === "EVALUATOR") summary.evaluation += 1;
+		else if (signal.processRoot) summary.process += 1;
+		else if (propagated.has(signal.id)) summary.propagated += 1;
+		else if (signal.role === "AGENT" || signal.role === "CHAIN" || signal.role === "LLM" || signal.role === "TOOL") summary.execution += 1;
+		else summary.unclassified += 1;
+	}
+	return summary;
+}
+//#endregion
+//#region src/trace/execution-measurements.ts
+const TOKEN_MEASUREMENT_KEY_GROUPS = [
+	LLM_INPUT_TOKEN_ATTR_KEYS,
+	LLM_OUTPUT_TOKEN_ATTR_KEYS,
+	LLM_REASONING_TOKEN_ATTR_KEYS,
+	LLM_CACHED_TOKEN_ATTR_KEYS,
+	LLM_CACHE_WRITE_TOKEN_ATTR_KEYS
+];
+const EXECUTION_MEASUREMENT_KEY_GROUPS = [...TOKEN_MEASUREMENT_KEY_GROUPS, LLM_COST_ATTR_KEYS];
+/**
+* Reconcile execution measurements across nested telemetry wrappers.
+* A measured parent is used only when a descendant call does not report the
+* same field, so aggregate wrappers neither duplicate complete child data nor
+* erase complementary parent fields.
+*/
+function summarizeExecutionMeasurements(spans) {
+	const byId = /* @__PURE__ */ new Map();
+	for (const span of spans) {
+		if (byId.has(span.id)) throw new Error(`summarizeExecutionMeasurements: duplicate span id "${span.id}"`);
+		byId.set(span.id, span);
+	}
+	const tokenMeasurementKeys = TOKEN_MEASUREMENT_KEY_GROUPS.flat();
+	const candidates = spans.filter((span) => span.modelCall || !span.aggregate && readNumber(span.attributes, tokenMeasurementKeys) !== void 0);
+	const candidateIds = new Set(candidates.map((span) => span.id));
+	const candidateChildren = /* @__PURE__ */ new Map();
+	for (const candidate of candidates) {
+		const parentId = nearestCandidateParent(candidate, byId, candidateIds);
+		if (!parentId) continue;
+		const children = candidateChildren.get(parentId) ?? [];
+		children.push(candidate);
+		candidateChildren.set(parentId, children);
+	}
+	const aggregateIds = classifyAggregateSpans(candidates, candidateChildren);
+	const untypedRunCostIds = new Set(spans.filter((span) => !span.modelCall && !span.aggregate && !candidateIds.has(span.id) && readNumber(span.attributes, RUN_COST_ATTR_KEYS) !== void 0).map((span) => span.id));
+	const aggregateSourceIds = new Set(spans.filter((span) => span.aggregate || aggregateIds.has(span.id) || untypedRunCostIds.has(span.id)).map((span) => span.id));
+	const calls = candidates.filter((span) => !aggregateIds.has(span.id));
+	const input = reconcileMeasurement(calls, byId, aggregateSourceIds, LLM_INPUT_TOKEN_ATTR_KEYS);
+	const reasoning = reconcileMeasurement(calls, byId, aggregateSourceIds, LLM_REASONING_TOKEN_ATTR_KEYS);
+	const output = reconcileMeasurement(calls, byId, aggregateSourceIds, LLM_OUTPUT_TOKEN_ATTR_KEYS, LLM_REASONING_TOKEN_ATTR_KEYS);
+	const cached = reconcileMeasurement(calls, byId, aggregateSourceIds, LLM_CACHED_TOKEN_ATTR_KEYS);
+	const cacheWrite = reconcileMeasurement(calls, byId, aggregateSourceIds, LLM_CACHE_WRITE_TOKEN_ATTR_KEYS);
+	const aggregate = summarizeAggregateMeasurements(spans, byId, /* @__PURE__ */ new Set([...aggregateIds, ...untypedRunCostIds]));
+	return {
+		tokenUsage: {
+			input: input.value ?? 0,
+			output: Math.max(output.value ?? 0, reasoning.value ?? 0),
+			...reasoning.value !== void 0 ? { reasoning: reasoning.value } : {},
+			...cached.value !== void 0 ? { cached: cached.value } : {},
+			...cacheWrite.value !== void 0 ? { cacheWrite: cacheWrite.value } : {}
+		},
+		modelCallCount: calls.length,
+		callSpanIds: calls.map((span) => span.id),
+		cost: reconcileMeasurement(calls, byId, aggregateSourceIds, LLM_COST_ATTR_KEYS),
+		...aggregate ? { aggregate } : {}
+	};
+}
+function recordAggregateMeasurements(raw, aggregate) {
+	if (!aggregate) return;
+	raw.aggregate_prompt_tokens = aggregate.tokenUsage.input;
+	raw.aggregate_completion_tokens = aggregate.tokenUsage.output;
+	if (aggregate.tokenUsage.reasoning !== void 0) raw.aggregate_reasoning_tokens = aggregate.tokenUsage.reasoning;
+	if (aggregate.tokenUsage.cached !== void 0) raw.aggregate_cached_tokens = aggregate.tokenUsage.cached;
+	if (aggregate.tokenUsage.cacheWrite !== void 0) raw.aggregate_cache_write_tokens = aggregate.tokenUsage.cacheWrite;
+	if (aggregate.costUsd !== void 0) raw.aggregate_cost_usd = aggregate.costUsd;
+}
+function summarizeAggregateMeasurements(spans, byId, aggregateIds) {
+	const aggregates = spans.filter((span) => span.aggregate || aggregateIds.has(span.id));
+	const input = reconcileTopLevelMeasurement(aggregates, byId, LLM_INPUT_TOKEN_ATTR_KEYS);
+	const output = reconcileTopLevelMeasurement(aggregates, byId, LLM_OUTPUT_TOKEN_ATTR_KEYS);
+	const reasoning = reconcileTopLevelMeasurement(aggregates, byId, LLM_REASONING_TOKEN_ATTR_KEYS);
+	const cached = reconcileTopLevelMeasurement(aggregates, byId, LLM_CACHED_TOKEN_ATTR_KEYS);
+	const cacheWrite = reconcileTopLevelMeasurement(aggregates, byId, LLM_CACHE_WRITE_TOKEN_ATTR_KEYS);
+	const costUsd = reconcileTopLevelMeasurement(aggregates, byId, LLM_COST_ATTR_KEYS);
+	if (input === void 0 && output === void 0 && reasoning === void 0 && cached === void 0 && cacheWrite === void 0 && costUsd === void 0) return void 0;
+	return {
+		tokenUsage: {
+			input: input ?? 0,
+			output: output ?? reasoning ?? 0,
+			...reasoning !== void 0 ? { reasoning } : {},
+			...cached !== void 0 ? { cached } : {},
+			...cacheWrite !== void 0 ? { cacheWrite } : {}
+		},
+		...costUsd !== void 0 ? { costUsd } : {}
+	};
+}
+function reconcileTopLevelMeasurement(spans, byId, keys) {
+	const selected = /* @__PURE__ */ new Map();
+	for (const span of spans) {
+		const value = readNumber(span.attributes, keys);
+		if (value !== void 0) selected.set(span.id, value);
+	}
+	for (const spanId of [...selected.keys()]) {
+		const span = byId.get(spanId);
+		if (!span) continue;
+		if (ancestorIds(span, byId).some((ancestorId) => selected.has(ancestorId))) selected.delete(spanId);
+	}
+	return selected.size > 0 ? [...selected.values()].reduce((total, value) => total + value, 0) : void 0;
+}
+function reconcileMeasurement(calls, byId, aggregateSourceIds, keys, fallbackKeys) {
+	const selected = /* @__PURE__ */ new Map();
+	const callIds = new Set(calls.map((call) => call.id));
+	let reportingCalls = 0;
+	for (const call of calls) {
+		const primary = nearestMeasurement(call, byId, callIds, aggregateSourceIds, keys);
+		const fallback = fallbackKeys ? nearestMeasurement(call, byId, callIds, aggregateSourceIds, fallbackKeys) : void 0;
+		const source = primary && fallback && primary.span.id === fallback.span.id ? {
+			span: primary.span,
+			value: Math.max(primary.value, fallback.value)
+		} : primary ?? fallback;
+		if (!source) continue;
+		reportingCalls += 1;
+		selected.set(source.span.id, source.value);
+	}
+	for (const spanId of [...selected.keys()]) {
+		const span = byId.get(spanId);
+		if (!span) continue;
+		if (ancestorIds(span, byId).some((ancestorId) => selected.has(ancestorId) && !callIds.has(ancestorId))) selected.delete(spanId);
+	}
+	return {
+		...selected.size > 0 ? { value: [...selected.values()].reduce((total, value) => total + value, 0) } : {},
+		reportingCalls,
+		complete: calls.length > 0 && reportingCalls === calls.length
+	};
+}
+function nearestMeasurement(call, byId, callIds, aggregateSourceIds, keys) {
+	let current = call;
+	const seen = /* @__PURE__ */ new Set();
+	while (current && !seen.has(current.id)) {
+		seen.add(current.id);
+		const value = readNumber(current.attributes, keys);
+		if (value !== void 0 && (current.id === call.id || !callIds.has(current.id) && aggregateSourceIds.has(current.id))) return {
+			span: current,
+			value
+		};
+		current = current.parentId ? byId.get(current.parentId) : void 0;
+	}
+}
+function classifyAggregateSpans(candidates, childrenById) {
+	const aggregateIds = /* @__PURE__ */ new Set();
+	const summaries = /* @__PURE__ */ new Map();
+	const visiting = /* @__PURE__ */ new Set();
+	const visit = (span) => {
+		const cached = summaries.get(span.id);
+		if (cached) return cached;
+		if (visiting.has(span.id)) return emptyRetainedCallSummary();
+		visiting.add(span.id);
+		const descendants = emptyRetainedCallSummary();
+		for (const child of childrenById.get(span.id) ?? []) {
+			const childDescendants = visit(child);
+			if (!aggregateIds.has(child.id)) addRetainedCall(descendants, child);
+			addRetainedCallSummary(descendants, childDescendants);
+		}
+		if (descendants.callCount > 0 && (!span.modelCall || hasCompatibleDescendantMeasurements(span, descendants))) aggregateIds.add(span.id);
+		visiting.delete(span.id);
+		summaries.set(span.id, descendants);
+		return descendants;
+	};
+	for (const candidate of candidates) visit(candidate);
+	return aggregateIds;
+}
+function emptyRetainedCallSummary() {
+	return {
+		callCount: 0,
+		measurements: EXECUTION_MEASUREMENT_KEY_GROUPS.map(() => ({
+			total: 0,
+			reportingCalls: 0
+		}))
+	};
+}
+function addRetainedCall(summary, span) {
+	summary.callCount += 1;
+	for (let index = 0; index < EXECUTION_MEASUREMENT_KEY_GROUPS.length; index += 1) {
+		const value = readNumber(span.attributes, EXECUTION_MEASUREMENT_KEY_GROUPS[index]);
+		if (value === void 0) continue;
+		const measurement = summary.measurements[index];
+		measurement.total += value;
+		measurement.reportingCalls += 1;
+	}
+}
+function addRetainedCallSummary(target, source) {
+	target.callCount += source.callCount;
+	for (let index = 0; index < target.measurements.length; index += 1) {
+		const measurement = target.measurements[index];
+		const sourceMeasurement = source.measurements[index];
+		measurement.total += sourceMeasurement.total;
+		measurement.reportingCalls += sourceMeasurement.reportingCalls;
+	}
+}
+function hasCompatibleDescendantMeasurements(span, descendants) {
+	let parentMeasurements = 0;
+	let descendantMeasurements = 0;
+	for (let index = 0; index < EXECUTION_MEASUREMENT_KEY_GROUPS.length; index += 1) {
+		const keys = EXECUTION_MEASUREMENT_KEY_GROUPS[index];
+		const parentValue = readNumber(span.attributes, keys);
+		const measurement = descendants.measurements[index];
+		if (parentValue !== void 0) parentMeasurements += 1;
+		if (measurement.reportingCalls > 0) descendantMeasurements += 1;
+		if (parentValue === void 0 || measurement.reportingCalls === 0) continue;
+		if (measurement.reportingCalls !== descendants.callCount) continue;
+		if (Math.abs(parentValue - measurement.total) > 1e-12) return false;
+	}
+	return parentMeasurements === 0 || descendantMeasurements > 0;
+}
+function ancestorIds(span, byId) {
+	const ids = [];
+	const seen = /* @__PURE__ */ new Set();
+	let parentId = span.parentId;
+	while (parentId && !seen.has(parentId)) {
+		ids.push(parentId);
+		seen.add(parentId);
+		parentId = byId.get(parentId)?.parentId;
+	}
+	return ids;
+}
+function nearestCandidateParent(span, byId, candidateIds) {
+	const seen = /* @__PURE__ */ new Set();
+	let parentId = span.parentId;
+	while (parentId && !seen.has(parentId)) {
+		if (candidateIds.has(parentId)) return parentId;
+		seen.add(parentId);
+		parentId = byId.get(parentId)?.parentId;
+	}
+}
+function readNumber(attributes, keys) {
+	for (const key of keys) {
+		const value = attributes[key];
+		const parsed = typeof value === "number" ? value : typeof value === "string" && value.length > 0 ? Number(value) : NaN;
+		if (Number.isFinite(parsed) && parsed >= 0) return parsed;
+	}
+}
+//#endregion
+//#region src/trace/task-failure-attributes.ts
+const TASK_FAILURE_CLASS_ATTR = "tangle.task.failure_class";
+const TASK_FAILURE_MODE_ATTR = "tangle.task.failure_mode";
+function readTaskFailureLabels(roots, context) {
+	const failureClass = readConsistentRootString(roots, TASK_FAILURE_CLASS_ATTR, context);
+	const failureMode = readConsistentRootString(roots, TASK_FAILURE_MODE_ATTR, context);
+	if (failureClass !== void 0 && !FAILURE_CLASSES.includes(failureClass)) throw new ValidationError(`${context}: ${TASK_FAILURE_CLASS_ATTR} must be one of ${FAILURE_CLASSES.join(", ")}`);
+	if (failureMode !== void 0 && (failureClass === void 0 || failureClass === "success")) throw new ValidationError(`${context}: ${TASK_FAILURE_MODE_ATTR} requires a non-success ${TASK_FAILURE_CLASS_ATTR}`);
+	if (failureClass === void 0) return {};
+	if (failureClass === "success") return { failureClass };
+	return {
+		failureClass,
+		...failureMode ? { failureMode } : {}
+	};
+}
+function readConsistentRootString(roots, key, context) {
+	const values = /* @__PURE__ */ new Set();
+	for (const root of roots) {
+		if (!Object.hasOwn(root.attributes, key)) continue;
+		const value = root.attributes[key];
+		if (typeof value !== "string" || value.trim().length === 0) throw new ValidationError(`${context}: ${key} must be a non-empty string`);
+		values.add(value);
+	}
+	if (values.size > 1) throw new ValidationError(`${context}: conflicting ${key} values: ${[...values].sort().join(", ")}`);
+	return values.values().next().value;
+}
+//#endregion
+export { summarizeTraceErrors as i, recordAggregateMeasurements as n, summarizeExecutionMeasurements as r, readTaskFailureLabels as t };
+
+//# sourceMappingURL=task-failure-attributes-CQZlB3et.js.map

package/dist/task-failure-attributes-CQZlB3et.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-failure-attributes-CQZlB3et.js","names":[],"sources":["../src/trace/error-classification.ts","../src/trace/execution-measurements.ts","../src/trace/task-failure-attributes.ts"],"sourcesContent":["import type { OtlpSpanRole } from './otlp-attributes'\n\nexport type TraceErrorRole = OtlpSpanRole\n\nexport interface TraceErrorSignal {\n  id: string\n  parentId?: string\n  role: TraceErrorRole\n  error: boolean\n  processRoot: boolean\n}\n\nexport interface TraceErrorSummary {\n  total: number\n  execution: number\n  process: number\n  guardrail: number\n  evaluation: number\n  propagated: number\n  unclassified: number\n}\n\n/**\n * Classify errored spans without counting a propagated parent status as a\n * second execution failure.\n */\nexport function summarizeTraceErrors(signals: readonly TraceErrorSignal[]): TraceErrorSummary {\n  const byId = new Map<string, TraceErrorSignal>()\n  for (const signal of signals) {\n    if (byId.has(signal.id)) {\n      throw new Error(`summarizeTraceErrors: duplicate span id '${signal.id}'`)\n    }\n    byId.set(signal.id, signal)\n  }\n\n  const propagated = new Set<string>()\n  for (const signal of signals) {\n    if (!signal.error) continue\n    const visited = new Set<string>()\n    let parentId = signal.parentId\n    while (parentId && !visited.has(parentId)) {\n      visited.add(parentId)\n      const parent = byId.get(parentId)\n      if (!parent) break\n      if (parent.error) propagated.add(parent.id)\n      parentId = parent.parentId\n    }\n  }\n\n  const summary: TraceErrorSummary = {\n    total: 0,\n    execution: 0,\n    process: 0,\n    guardrail: 0,\n    evaluation: 0,\n    propagated: 0,\n    unclassified: 0,\n  }\n\n  for (const signal of signals) {\n    if (!signal.error) continue\n    summary.total += 1\n    if (signal.role === 'GUARDRAIL') {\n      summary.guardrail += 1\n    } else if (signal.role === 'EVALUATOR') {\n      summary.evaluation += 1\n    } else if (signal.processRoot) {\n      summary.process += 1\n    } else if (propagated.has(signal.id)) {\n      summary.propagated += 1\n    } else if (\n      signal.role === 'AGENT' ||\n      signal.role === 'CHAIN' ||\n      signal.role === 'LLM' ||\n      signal.role === 'TOOL'\n    ) {\n      summary.execution += 1\n    } else {\n      summary.unclassified += 1\n    }\n  }\n\n  return summary\n}\n","import type { RunTokenUsage } from '../run-record'\nimport {\n  LLM_CACHE_WRITE_TOKEN_ATTR_KEYS,\n  LLM_CACHED_TOKEN_ATTR_KEYS,\n  LLM_COST_ATTR_KEYS,\n  LLM_INPUT_TOKEN_ATTR_KEYS,\n  LLM_OUTPUT_TOKEN_ATTR_KEYS,\n  LLM_REASONING_TOKEN_ATTR_KEYS,\n  RUN_COST_ATTR_KEYS,\n} from './otlp-attributes'\n\nexport interface ExecutionMeasurementSpan {\n  id: string\n  parentId?: string\n  attributes: Record<string, unknown>\n  modelCall: boolean\n  aggregate: boolean\n}\n\nexport interface MeasurementCoverage {\n  value?: number\n  reportingCalls: number\n  complete: boolean\n}\n\nexport interface ExecutionMeasurements {\n  tokenUsage: RunTokenUsage\n  modelCallCount: number\n  callSpanIds: string[]\n  cost: MeasurementCoverage\n  aggregate?: {\n    tokenUsage: RunTokenUsage\n    costUsd?: number\n  }\n}\n\nconst TOKEN_MEASUREMENT_KEY_GROUPS = [\n  LLM_INPUT_TOKEN_ATTR_KEYS,\n  LLM_OUTPUT_TOKEN_ATTR_KEYS,\n  LLM_REASONING_TOKEN_ATTR_KEYS,\n  LLM_CACHED_TOKEN_ATTR_KEYS,\n  LLM_CACHE_WRITE_TOKEN_ATTR_KEYS,\n] as const\n\nconst EXECUTION_MEASUREMENT_KEY_GROUPS = [\n  ...TOKEN_MEASUREMENT_KEY_GROUPS,\n  LLM_COST_ATTR_KEYS,\n] as const\n\ninterface RetainedCallSummary {\n  callCount: number\n  measurements: Array<{\n    total: number\n    reportingCalls: number\n  }>\n}\n\n/**\n * Reconcile execution measurements across nested telemetry wrappers.\n * A measured parent is used only when a descendant call does not report the\n * same field, so aggregate wrappers neither duplicate complete child data nor\n * erase complementary parent fields.\n */\nexport function summarizeExecutionMeasurements(\n  spans: ExecutionMeasurementSpan[],\n): ExecutionMeasurements {\n  const byId = new Map<string, ExecutionMeasurementSpan>()\n  for (const span of spans) {\n    if (byId.has(span.id)) {\n      throw new Error(`summarizeExecutionMeasurements: duplicate span id \"${span.id}\"`)\n    }\n    byId.set(span.id, span)\n  }\n  const tokenMeasurementKeys = TOKEN_MEASUREMENT_KEY_GROUPS.flat()\n  const candidates = spans.filter(\n    (span) =>\n      span.modelCall ||\n      (!span.aggregate && readNumber(span.attributes, tokenMeasurementKeys) !== undefined),\n  )\n  const candidateIds = new Set(candidates.map((span) => span.id))\n  const candidateChildren = new Map<string, ExecutionMeasurementSpan[]>()\n  for (const candidate of candidates) {\n    const parentId = nearestCandidateParent(candidate, byId, candidateIds)\n    if (!parentId) continue\n    const children = candidateChildren.get(parentId) ?? []\n    children.push(candidate)\n    candidateChildren.set(parentId, children)\n  }\n  const aggregateIds = classifyAggregateSpans(candidates, candidateChildren)\n  const untypedRunCostIds = new Set(\n    spans\n      .filter(\n        (span) =>\n          !span.modelCall &&\n          !span.aggregate &&\n          !candidateIds.has(span.id) &&\n          readNumber(span.attributes, RUN_COST_ATTR_KEYS) !== undefined,\n      )\n      .map((span) => span.id),\n  )\n  const aggregateSourceIds = new Set(\n    spans\n      .filter(\n        (span) => span.aggregate || aggregateIds.has(span.id) || untypedRunCostIds.has(span.id),\n      )\n      .map((span) => span.id),\n  )\n\n  const calls = candidates.filter((span) => !aggregateIds.has(span.id))\n  const input = reconcileMeasurement(calls, byId, aggregateSourceIds, LLM_INPUT_TOKEN_ATTR_KEYS)\n  const reasoning = reconcileMeasurement(\n    calls,\n    byId,\n    aggregateSourceIds,\n    LLM_REASONING_TOKEN_ATTR_KEYS,\n  )\n  const output = reconcileMeasurement(\n    calls,\n    byId,\n    aggregateSourceIds,\n    LLM_OUTPUT_TOKEN_ATTR_KEYS,\n    LLM_REASONING_TOKEN_ATTR_KEYS,\n  )\n  const cached = reconcileMeasurement(calls, byId, aggregateSourceIds, LLM_CACHED_TOKEN_ATTR_KEYS)\n  const cacheWrite = reconcileMeasurement(\n    calls,\n    byId,\n    aggregateSourceIds,\n    LLM_CACHE_WRITE_TOKEN_ATTR_KEYS,\n  )\n  const aggregate = summarizeAggregateMeasurements(\n    spans,\n    byId,\n    new Set([...aggregateIds, ...untypedRunCostIds]),\n  )\n\n  return {\n    tokenUsage: {\n      input: input.value ?? 0,\n      output: Math.max(output.value ?? 0, reasoning.value ?? 0),\n      ...(reasoning.value !== undefined ? { reasoning: reasoning.value } : {}),\n      ...(cached.value !== undefined ? { cached: cached.value } : {}),\n      ...(cacheWrite.value !== undefined ? { cacheWrite: cacheWrite.value } : {}),\n    },\n    modelCallCount: calls.length,\n    callSpanIds: calls.map((span) => span.id),\n    cost: reconcileMeasurement(calls, byId, aggregateSourceIds, LLM_COST_ATTR_KEYS),\n    ...(aggregate ? { aggregate } : {}),\n  }\n}\n\nexport function recordAggregateMeasurements(\n  raw: Record<string, number>,\n  aggregate: ExecutionMeasurements['aggregate'],\n): void {\n  if (!aggregate) return\n  raw.aggregate_prompt_tokens = aggregate.tokenUsage.input\n  raw.aggregate_completion_tokens = aggregate.tokenUsage.output\n  if (aggregate.tokenUsage.reasoning !== undefined)\n    raw.aggregate_reasoning_tokens = aggregate.tokenUsage.reasoning\n  if (aggregate.tokenUsage.cached !== undefined)\n    raw.aggregate_cached_tokens = aggregate.tokenUsage.cached\n  if (aggregate.tokenUsage.cacheWrite !== undefined)\n    raw.aggregate_cache_write_tokens = aggregate.tokenUsage.cacheWrite\n  if (aggregate.costUsd !== undefined) raw.aggregate_cost_usd = aggregate.costUsd\n}\n\nfunction summarizeAggregateMeasurements(\n  spans: ExecutionMeasurementSpan[],\n  byId: Map<string, ExecutionMeasurementSpan>,\n  aggregateIds: Set<string>,\n): ExecutionMeasurements['aggregate'] {\n  const aggregates = spans.filter((span) => span.aggregate || aggregateIds.has(span.id))\n  const input = reconcileTopLevelMeasurement(aggregates, byId, LLM_INPUT_TOKEN_ATTR_KEYS)\n  const output = reconcileTopLevelMeasurement(aggregates, byId, LLM_OUTPUT_TOKEN_ATTR_KEYS)\n  const reasoning = reconcileTopLevelMeasurement(aggregates, byId, LLM_REASONING_TOKEN_ATTR_KEYS)\n  const cached = reconcileTopLevelMeasurement(aggregates, byId, LLM_CACHED_TOKEN_ATTR_KEYS)\n  const cacheWrite = reconcileTopLevelMeasurement(aggregates, byId, LLM_CACHE_WRITE_TOKEN_ATTR_KEYS)\n  const costUsd = reconcileTopLevelMeasurement(aggregates, byId, LLM_COST_ATTR_KEYS)\n  if (\n    input === undefined &&\n    output === undefined &&\n    reasoning === undefined &&\n    cached === undefined &&\n    cacheWrite === undefined &&\n    costUsd === undefined\n  )\n    return undefined\n  return {\n    tokenUsage: {\n      input: input ?? 0,\n      output: output ?? reasoning ?? 0,\n      ...(reasoning !== undefined ? { reasoning } : {}),\n      ...(cached !== undefined ? { cached } : {}),\n      ...(cacheWrite !== undefined ? { cacheWrite } : {}),\n    },\n    ...(costUsd !== undefined ? { costUsd } : {}),\n  }\n}\n\nfunction reconcileTopLevelMeasurement(\n  spans: ExecutionMeasurementSpan[],\n  byId: Map<string, ExecutionMeasurementSpan>,\n  keys: readonly string[],\n): number | undefined {\n  const selected = new Map<string, number>()\n  for (const span of spans) {\n    const value = readNumber(span.attributes, keys)\n    if (value !== undefined) selected.set(span.id, value)\n  }\n  for (const spanId of [...selected.keys()]) {\n    const span = byId.get(spanId)\n    if (!span) continue\n    if (ancestorIds(span, byId).some((ancestorId) => selected.has(ancestorId))) {\n      selected.delete(spanId)\n    }\n  }\n  return selected.size > 0\n    ? [...selected.values()].reduce((total, value) => total + value, 0)\n    : undefined\n}\n\nfunction reconcileMeasurement(\n  calls: ExecutionMeasurementSpan[],\n  byId: Map<string, ExecutionMeasurementSpan>,\n  aggregateSourceIds: Set<string>,\n  keys: readonly string[],\n  fallbackKeys?: readonly string[],\n): MeasurementCoverage {\n  const selected = new Map<string, number>()\n  const callIds = new Set(calls.map((call) => call.id))\n  let reportingCalls = 0\n\n  for (const call of calls) {\n    const primary = nearestMeasurement(call, byId, callIds, aggregateSourceIds, keys)\n    const fallback = fallbackKeys\n      ? nearestMeasurement(call, byId, callIds, aggregateSourceIds, fallbackKeys)\n      : undefined\n    const source =\n      primary && fallback && primary.span.id === fallback.span.id\n        ? { span: primary.span, value: Math.max(primary.value, fallback.value) }\n        : (primary ?? fallback)\n    if (!source) continue\n    reportingCalls += 1\n    selected.set(source.span.id, source.value)\n  }\n\n  for (const spanId of [...selected.keys()]) {\n    const span = byId.get(spanId)\n    if (!span) continue\n    if (\n      ancestorIds(span, byId).some(\n        (ancestorId) => selected.has(ancestorId) && !callIds.has(ancestorId),\n      )\n    ) {\n      selected.delete(spanId)\n    }\n  }\n\n  return {\n    ...(selected.size > 0\n      ? { value: [...selected.values()].reduce((total, value) => total + value, 0) }\n      : {}),\n    reportingCalls,\n    complete: calls.length > 0 && reportingCalls === calls.length,\n  }\n}\n\nfunction nearestMeasurement(\n  call: ExecutionMeasurementSpan,\n  byId: Map<string, ExecutionMeasurementSpan>,\n  callIds: Set<string>,\n  aggregateSourceIds: Set<string>,\n  keys: readonly string[],\n): { span: ExecutionMeasurementSpan; value: number } | undefined {\n  let current: ExecutionMeasurementSpan | undefined = call\n  const seen = new Set<string>()\n  while (current && !seen.has(current.id)) {\n    seen.add(current.id)\n    const value = readNumber(current.attributes, keys)\n    if (\n      value !== undefined &&\n      (current.id === call.id || (!callIds.has(current.id) && aggregateSourceIds.has(current.id)))\n    ) {\n      return { span: current, value }\n    }\n    current = current.parentId ? byId.get(current.parentId) : undefined\n  }\n  return undefined\n}\n\nfunction classifyAggregateSpans(\n  candidates: ExecutionMeasurementSpan[],\n  childrenById: Map<string, ExecutionMeasurementSpan[]>,\n): Set<string> {\n  const aggregateIds = new Set<string>()\n  const summaries = new Map<string, RetainedCallSummary>()\n  const visiting = new Set<string>()\n\n  const visit = (span: ExecutionMeasurementSpan): RetainedCallSummary => {\n    const cached = summaries.get(span.id)\n    if (cached) return cached\n    if (visiting.has(span.id)) return emptyRetainedCallSummary()\n    visiting.add(span.id)\n\n    const descendants = emptyRetainedCallSummary()\n    for (const child of childrenById.get(span.id) ?? []) {\n      const childDescendants = visit(child)\n      if (!aggregateIds.has(child.id)) addRetainedCall(descendants, child)\n      addRetainedCallSummary(descendants, childDescendants)\n    }\n\n    if (\n      descendants.callCount > 0 &&\n      (!span.modelCall || hasCompatibleDescendantMeasurements(span, descendants))\n    ) {\n      aggregateIds.add(span.id)\n    }\n\n    visiting.delete(span.id)\n    summaries.set(span.id, descendants)\n    return descendants\n  }\n\n  for (const candidate of candidates) visit(candidate)\n  return aggregateIds\n}\n\nfunction emptyRetainedCallSummary(): RetainedCallSummary {\n  return {\n    callCount: 0,\n    measurements: EXECUTION_MEASUREMENT_KEY_GROUPS.map(() => ({\n      total: 0,\n      reportingCalls: 0,\n    })),\n  }\n}\n\nfunction addRetainedCall(summary: RetainedCallSummary, span: ExecutionMeasurementSpan): void {\n  summary.callCount += 1\n  for (let index = 0; index < EXECUTION_MEASUREMENT_KEY_GROUPS.length; index += 1) {\n    const value = readNumber(span.attributes, EXECUTION_MEASUREMENT_KEY_GROUPS[index]!)\n    if (value === undefined) continue\n    const measurement = summary.measurements[index]!\n    measurement.total += value\n    measurement.reportingCalls += 1\n  }\n}\n\nfunction addRetainedCallSummary(target: RetainedCallSummary, source: RetainedCallSummary): void {\n  target.callCount += source.callCount\n  for (let index = 0; index < target.measurements.length; index += 1) {\n    const measurement = target.measurements[index]!\n    const sourceMeasurement = source.measurements[index]!\n    measurement.total += sourceMeasurement.total\n    measurement.reportingCalls += sourceMeasurement.reportingCalls\n  }\n}\n\nfunction hasCompatibleDescendantMeasurements(\n  span: ExecutionMeasurementSpan,\n  descendants: RetainedCallSummary,\n): boolean {\n  let parentMeasurements = 0\n  let descendantMeasurements = 0\n  for (let index = 0; index < EXECUTION_MEASUREMENT_KEY_GROUPS.length; index += 1) {\n    const keys = EXECUTION_MEASUREMENT_KEY_GROUPS[index]!\n    const parentValue = readNumber(span.attributes, keys)\n    const measurement = descendants.measurements[index]!\n    if (parentValue !== undefined) parentMeasurements += 1\n    if (measurement.reportingCalls > 0) descendantMeasurements += 1\n    if (parentValue === undefined || measurement.reportingCalls === 0) continue\n    if (measurement.reportingCalls !== descendants.callCount) continue\n    if (Math.abs(parentValue - measurement.total) > 1e-12) return false\n  }\n  return parentMeasurements === 0 || descendantMeasurements > 0\n}\n\nfunction ancestorIds(\n  span: ExecutionMeasurementSpan,\n  byId: Map<string, ExecutionMeasurementSpan>,\n): string[] {\n  const ids: string[] = []\n  const seen = new Set<string>()\n  let parentId = span.parentId\n  while (parentId && !seen.has(parentId)) {\n    ids.push(parentId)\n    seen.add(parentId)\n    parentId = byId.get(parentId)?.parentId\n  }\n  return ids\n}\n\nfunction nearestCandidateParent(\n  span: ExecutionMeasurementSpan,\n  byId: Map<string, ExecutionMeasurementSpan>,\n  candidateIds: Set<string>,\n): string | undefined {\n  const seen = new Set<string>()\n  let parentId = span.parentId\n  while (parentId && !seen.has(parentId)) {\n    if (candidateIds.has(parentId)) return parentId\n    seen.add(parentId)\n    parentId = byId.get(parentId)?.parentId\n  }\n  return undefined\n}\n\nfunction readNumber(\n  attributes: Record<string, unknown>,\n  keys: readonly string[],\n): number | undefined {\n  for (const key of keys) {\n    const value = attributes[key]\n    const parsed =\n      typeof value === 'number'\n        ? value\n        : typeof value === 'string' && value.length > 0\n          ? Number(value)\n          : Number.NaN\n    if (Number.isFinite(parsed) && parsed >= 0) return parsed\n  }\n  return undefined\n}\n","import { ValidationError } from '../errors'\nimport { FAILURE_CLASSES, type FailureClass } from './schema'\n\nconst TASK_FAILURE_CLASS_ATTR = 'tangle.task.failure_class'\nconst TASK_FAILURE_MODE_ATTR = 'tangle.task.failure_mode'\n\ninterface AttributeCarrier {\n  attributes: Record<string, unknown>\n}\n\nexport type TaskFailureLabels =\n  | { failureClass?: undefined; failureMode?: undefined }\n  | { failureClass: 'success'; failureMode?: undefined }\n  | { failureClass: Exclude<FailureClass, 'success'>; failureMode?: string }\n\nexport function readTaskFailureLabels(\n  roots: readonly AttributeCarrier[],\n  context: string,\n): TaskFailureLabels {\n  const failureClass = readConsistentRootString(roots, TASK_FAILURE_CLASS_ATTR, context)\n  const failureMode = readConsistentRootString(roots, TASK_FAILURE_MODE_ATTR, context)\n\n  if (failureClass !== undefined && !FAILURE_CLASSES.includes(failureClass as FailureClass)) {\n    throw new ValidationError(\n      `${context}: ${TASK_FAILURE_CLASS_ATTR} must be one of ${FAILURE_CLASSES.join(', ')}`,\n    )\n  }\n  if (failureMode !== undefined && (failureClass === undefined || failureClass === 'success')) {\n    throw new ValidationError(\n      `${context}: ${TASK_FAILURE_MODE_ATTR} requires a non-success ${TASK_FAILURE_CLASS_ATTR}`,\n    )\n  }\n\n  if (failureClass === undefined) return {}\n  if (failureClass === 'success') return { failureClass }\n  return {\n    failureClass: failureClass as Exclude<FailureClass, 'success'>,\n    ...(failureMode ? { failureMode } : {}),\n  }\n}\n\nfunction readConsistentRootString(\n  roots: readonly AttributeCarrier[],\n  key: string,\n  context: string,\n): string | undefined {\n  const values = new Set<string>()\n  for (const root of roots) {\n    if (!Object.hasOwn(root.attributes, key)) continue\n    const value = root.attributes[key]\n    if (typeof value !== 'string' || value.trim().length === 0) {\n      throw new ValidationError(`${context}: ${key} must be a non-empty string`)\n    }\n    values.add(value)\n  }\n\n  if (values.size > 1) {\n    throw new ValidationError(\n      `${context}: conflicting ${key} values: ${[...values].sort().join(', ')}`,\n    )\n  }\n  return values.values().next().value\n}\n"],"mappings":";;;;;;;;;AA0BA,SAAgB,qBAAqB,SAAyD;CAC5F,MAAM,uBAAO,IAAI,IAA8B;CAC/C,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI,KAAK,IAAI,OAAO,EAAE,GACpB,MAAM,IAAI,MAAM,4CAA4C,OAAO,GAAG,EAAE;EAE1E,KAAK,IAAI,OAAO,IAAI,MAAM;CAC5B;CAEA,MAAM,6BAAa,IAAI,IAAY;CACnC,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI,CAAC,OAAO,OAAO;EACnB,MAAM,0BAAU,IAAI,IAAY;EAChC,IAAI,WAAW,OAAO;EACtB,OAAO,YAAY,CAAC,QAAQ,IAAI,QAAQ,GAAG;GACzC,QAAQ,IAAI,QAAQ;GACpB,MAAM,SAAS,KAAK,IAAI,QAAQ;GAChC,IAAI,CAAC,QAAQ;GACb,IAAI,OAAO,OAAO,WAAW,IAAI,OAAO,EAAE;GAC1C,WAAW,OAAO;EACpB;CACF;CAEA,MAAM,UAA6B;EACjC,OAAO;EACP,WAAW;EACX,SAAS;EACT,WAAW;EACX,YAAY;EACZ,YAAY;EACZ,cAAc;CAChB;CAEA,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI,CAAC,OAAO,OAAO;EACnB,QAAQ,SAAS;EACjB,IAAI,OAAO,SAAS,aAClB,QAAQ,aAAa;OAChB,IAAI,OAAO,SAAS,aACzB,QAAQ,cAAc;OACjB,IAAI,OAAO,aAChB,QAAQ,WAAW;OACd,IAAI,WAAW,IAAI,OAAO,EAAE,GACjC,QAAQ,cAAc;OACjB,IACL,OAAO,SAAS,WAChB,OAAO,SAAS,WAChB,OAAO,SAAS,SAChB,OAAO,SAAS,QAEhB,QAAQ,aAAa;OAErB,QAAQ,gBAAgB;CAE5B;CAEA,OAAO;AACT;;;AC/CA,MAAM,+BAA+B;CACnC;CACA;CACA;CACA;CACA;AACF;AAEA,MAAM,mCAAmC,CACvC,GAAG,8BACH,kBACF;;;;;;;AAgBA,SAAgB,+BACd,OACuB;CACvB,MAAM,uBAAO,IAAI,IAAsC;CACvD,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,IAAI,KAAK,EAAE,GAClB,MAAM,IAAI,MAAM,sDAAsD,KAAK,GAAG,EAAE;EAElF,KAAK,IAAI,KAAK,IAAI,IAAI;CACxB;CACA,MAAM,uBAAuB,6BAA6B,KAAK;CAC/D,MAAM,aAAa,MAAM,QACtB,SACC,KAAK,aACJ,CAAC,KAAK,aAAa,WAAW,KAAK,YAAY,oBAAoB,MAAM,KAAA,CAC9E;CACA,MAAM,eAAe,IAAI,IAAI,WAAW,KAAK,SAAS,KAAK,EAAE,CAAC;CAC9D,MAAM,oCAAoB,IAAI,IAAwC;CACtE,KAAK,MAAM,aAAa,YAAY;EAClC,MAAM,WAAW,uBAAuB,WAAW,MAAM,YAAY;EACrE,IAAI,CAAC,UAAU;EACf,MAAM,WAAW,kBAAkB,IAAI,QAAQ,KAAK,CAAC;EACrD,SAAS,KAAK,SAAS;EACvB,kBAAkB,IAAI,UAAU,QAAQ;CAC1C;CACA,MAAM,eAAe,uBAAuB,YAAY,iBAAiB;CACzE,MAAM,oBAAoB,IAAI,IAC5B,MACG,QACE,SACC,CAAC,KAAK,aACN,CAAC,KAAK,aACN,CAAC,aAAa,IAAI,KAAK,EAAE,KACzB,WAAW,KAAK,YAAY,kBAAkB,MAAM,KAAA,CACxD,CAAC,CACA,KAAK,SAAS,KAAK,EAAE,CAC1B;CACA,MAAM,qBAAqB,IAAI,IAC7B,MACG,QACE,SAAS,KAAK,aAAa,aAAa,IAAI,KAAK,EAAE,KAAK,kBAAkB,IAAI,KAAK,EAAE,CACxF,CAAC,CACA,KAAK,SAAS,KAAK,EAAE,CAC1B;CAEA,MAAM,QAAQ,WAAW,QAAQ,SAAS,CAAC,aAAa,IAAI,KAAK,EAAE,CAAC;CACpE,MAAM,QAAQ,qBAAqB,OAAO,MAAM,oBAAoB,yBAAyB;CAC7F,MAAM,YAAY,qBAChB,OACA,MACA,oBACA,6BACF;CACA,MAAM,SAAS,qBACb,OACA,MACA,oBACA,4BACA,6BACF;CACA,MAAM,SAAS,qBAAqB,OAAO,MAAM,oBAAoB,0BAA0B;CAC/F,MAAM,aAAa,qBACjB,OACA,MACA,oBACA,+BACF;CACA,MAAM,YAAY,+BAChB,OACA,sBACA,IAAI,IAAI,CAAC,GAAG,cAAc,GAAG,iBAAiB,CAAC,CACjD;CAEA,OAAO;EACL,YAAY;GACV,OAAO,MAAM,SAAS;GACtB,QAAQ,KAAK,IAAI,OAAO,SAAS,GAAG,UAAU,SAAS,CAAC;GACxD,GAAI,UAAU,UAAU,KAAA,IAAY,EAAE,WAAW,UAAU,MAAM,IAAI,CAAC;GACtE,GAAI,OAAO,UAAU,KAAA,IAAY,EAAE,QAAQ,OAAO,MAAM,IAAI,CAAC;GAC7D,GAAI,WAAW,UAAU,KAAA,IAAY,EAAE,YAAY,WAAW,MAAM,IAAI,CAAC;EAC3E;EACA,gBAAgB,MAAM;EACtB,aAAa,MAAM,KAAK,SAAS,KAAK,EAAE;EACxC,MAAM,qBAAqB,OAAO,MAAM,oBAAoB,kBAAkB;EAC9E,GAAI,YAAY,EAAE,UAAU,IAAI,CAAC;CACnC;AACF;AAEA,SAAgB,4BACd,KACA,WACM;CACN,IAAI,CAAC,WAAW;CAChB,IAAI,0BAA0B,UAAU,WAAW;CACnD,IAAI,8BAA8B,UAAU,WAAW;CACvD,IAAI,UAAU,WAAW,cAAc,KAAA,GACrC,IAAI,6BAA6B,UAAU,WAAW;CACxD,IAAI,UAAU,WAAW,WAAW,KAAA,GAClC,IAAI,0BAA0B,UAAU,WAAW;CACrD,IAAI,UAAU,WAAW,eAAe,KAAA,GACtC,IAAI,+BAA+B,UAAU,WAAW;CAC1D,IAAI,UAAU,YAAY,KAAA,GAAW,IAAI,qBAAqB,UAAU;AAC1E;AAEA,SAAS,+BACP,OACA,MACA,cACoC;CACpC,MAAM,aAAa,MAAM,QAAQ,SAAS,KAAK,aAAa,aAAa,IAAI,KAAK,EAAE,CAAC;CACrF,MAAM,QAAQ,6BAA6B,YAAY,MAAM,yBAAyB;CACtF,MAAM,SAAS,6BAA6B,YAAY,MAAM,0BAA0B;CACxF,MAAM,YAAY,6BAA6B,YAAY,MAAM,6BAA6B;CAC9F,MAAM,SAAS,6BAA6B,YAAY,MAAM,0BAA0B;CACxF,MAAM,aAAa,6BAA6B,YAAY,MAAM,+BAA+B;CACjG,MAAM,UAAU,6BAA6B,YAAY,MAAM,kBAAkB;CACjF,IACE,UAAU,KAAA,KACV,WAAW,KAAA,KACX,cAAc,KAAA,KACd,WAAW,KAAA,KACX,eAAe,KAAA,KACf,YAAY,KAAA,GAEZ,OAAO,KAAA;CACT,OAAO;EACL,YAAY;GACV,OAAO,SAAS;GAChB,QAAQ,UAAU,aAAa;GAC/B,GAAI,cAAc,KAAA,IAAY,EAAE,UAAU,IAAI,CAAC;GAC/C,GAAI,WAAW,KAAA,IAAY,EAAE,OAAO,IAAI,CAAC;GACzC,GAAI,eAAe,KAAA,IAAY,EAAE,WAAW,IAAI,CAAC;EACnD;EACA,GAAI,YAAY,KAAA,IAAY,EAAE,QAAQ,IAAI,CAAC;CAC7C;AACF;AAEA,SAAS,6BACP,OACA,MACA,MACoB;CACpB,MAAM,2BAAW,IAAI,IAAoB;CACzC,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,QAAQ,WAAW,KAAK,YAAY,IAAI;EAC9C,IAAI,UAAU,KAAA,GAAW,SAAS,IAAI,KAAK,IAAI,KAAK;CACtD;CACA,KAAK,MAAM,UAAU,CAAC,GAAG,SAAS,KAAK,CAAC,GAAG;EACzC,MAAM,OAAO,KAAK,IAAI,MAAM;EAC5B,IAAI,CAAC,MAAM;EACX,IAAI,YAAY,MAAM,IAAI,CAAC,CAAC,MAAM,eAAe,SAAS,IAAI,UAAU,CAAC,GACvE,SAAS,OAAO,MAAM;CAE1B;CACA,OAAO,SAAS,OAAO,IACnB,CAAC,GAAG,SAAS,OAAO,CAAC,CAAC,CAAC,QAAQ,OAAO,UAAU,QAAQ,OAAO,CAAC,IAChE,KAAA;AACN;AAEA,SAAS,qBACP,OACA,MACA,oBACA,MACA,cACqB;CACrB,MAAM,2BAAW,IAAI,IAAoB;CACzC,MAAM,UAAU,IAAI,IAAI,MAAM,KAAK,SAAS,KAAK,EAAE,CAAC;CACpD,IAAI,iBAAiB;CAErB,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,UAAU,mBAAmB,MAAM,MAAM,SAAS,oBAAoB,IAAI;EAChF,MAAM,WAAW,eACb,mBAAmB,MAAM,MAAM,SAAS,oBAAoB,YAAY,IACxE,KAAA;EACJ,MAAM,SACJ,WAAW,YAAY,QAAQ,KAAK,OAAO,SAAS,KAAK,KACrD;GAAE,MAAM,QAAQ;GAAM,OAAO,KAAK,IAAI,QAAQ,OAAO,SAAS,KAAK;EAAE,IACpE,WAAW;EAClB,IAAI,CAAC,QAAQ;EACb,kBAAkB;EAClB,SAAS,IAAI,OAAO,KAAK,IAAI,OAAO,KAAK;CAC3C;CAEA,KAAK,MAAM,UAAU,CAAC,GAAG,SAAS,KAAK,CAAC,GAAG;EACzC,MAAM,OAAO,KAAK,IAAI,MAAM;EAC5B,IAAI,CAAC,MAAM;EACX,IACE,YAAY,MAAM,IAAI,CAAC,CAAC,MACrB,eAAe,SAAS,IAAI,UAAU,KAAK,CAAC,QAAQ,IAAI,UAAU,CACrE,GAEA,SAAS,OAAO,MAAM;CAE1B;CAEA,OAAO;EACL,GAAI,SAAS,OAAO,IAChB,EAAE,OAAO,CAAC,GAAG,SAAS,OAAO,CAAC,CAAC,CAAC,QAAQ,OAAO,UAAU,QAAQ,OAAO,CAAC,EAAE,IAC3E,CAAC;EACL;EACA,UAAU,MAAM,SAAS,KAAK,mBAAmB,MAAM;CACzD;AACF;AAEA,SAAS,mBACP,MACA,MACA,SACA,oBACA,MAC+D;CAC/D,IAAI,UAAgD;CACpD,MAAM,uBAAO,IAAI,IAAY;CAC7B,OAAO,WAAW,CAAC,KAAK,IAAI,QAAQ,EAAE,GAAG;EACvC,KAAK,IAAI,QAAQ,EAAE;EACnB,MAAM,QAAQ,WAAW,QAAQ,YAAY,IAAI;EACjD,IACE,UAAU,KAAA,MACT,QAAQ,OAAO,KAAK,MAAO,CAAC,QAAQ,IAAI,QAAQ,EAAE,KAAK,mBAAmB,IAAI,QAAQ,EAAE,IAEzF,OAAO;GAAE,MAAM;GAAS;EAAM;EAEhC,UAAU,QAAQ,WAAW,KAAK,IAAI,QAAQ,QAAQ,IAAI,KAAA;CAC5D;AAEF;AAEA,SAAS,uBACP,YACA,cACa;CACb,MAAM,+BAAe,IAAI,IAAY;CACrC,MAAM,4BAAY,IAAI,IAAiC;CACvD,MAAM,2BAAW,IAAI,IAAY;CAEjC,MAAM,SAAS,SAAwD;EACrE,MAAM,SAAS,UAAU,IAAI,KAAK,EAAE;EACpC,IAAI,QAAQ,OAAO;EACnB,IAAI,SAAS,IAAI,KAAK,EAAE,GAAG,OAAO,yBAAyB;EAC3D,SAAS,IAAI,KAAK,EAAE;EAEpB,MAAM,cAAc,yBAAyB;EAC7C,KAAK,MAAM,SAAS,aAAa,IAAI,KAAK,EAAE,KAAK,CAAC,GAAG;GACnD,MAAM,mBAAmB,MAAM,KAAK;GACpC,IAAI,CAAC,aAAa,IAAI,MAAM,EAAE,GAAG,gBAAgB,aAAa,KAAK;GACnE,uBAAuB,aAAa,gBAAgB;EACtD;EAEA,IACE,YAAY,YAAY,MACvB,CAAC,KAAK,aAAa,oCAAoC,MAAM,WAAW,IAEzE,aAAa,IAAI,KAAK,EAAE;EAG1B,SAAS,OAAO,KAAK,EAAE;EACvB,UAAU,IAAI,KAAK,IAAI,WAAW;EAClC,OAAO;CACT;CAEA,KAAK,MAAM,aAAa,YAAY,MAAM,SAAS;CACnD,OAAO;AACT;AAEA,SAAS,2BAAgD;CACvD,OAAO;EACL,WAAW;EACX,cAAc,iCAAiC,WAAW;GACxD,OAAO;GACP,gBAAgB;EAClB,EAAE;CACJ;AACF;AAEA,SAAS,gBAAgB,SAA8B,MAAsC;CAC3F,QAAQ,aAAa;CACrB,KAAK,IAAI,QAAQ,GAAG,QAAQ,iCAAiC,QAAQ,SAAS,GAAG;EAC/E,MAAM,QAAQ,WAAW,KAAK,YAAY,iCAAiC,MAAO;EAClF,IAAI,UAAU,KAAA,GAAW;EACzB,MAAM,cAAc,QAAQ,aAAa;EACzC,YAAY,SAAS;EACrB,YAAY,kBAAkB;CAChC;AACF;AAEA,SAAS,uBAAuB,QAA6B,QAAmC;CAC9F,OAAO,aAAa,OAAO;CAC3B,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,aAAa,QAAQ,SAAS,GAAG;EAClE,MAAM,cAAc,OAAO,aAAa;EACxC,MAAM,oBAAoB,OAAO,aAAa;EAC9C,YAAY,SAAS,kBAAkB;EACvC,YAAY,kBAAkB,kBAAkB;CAClD;AACF;AAEA,SAAS,oCACP,MACA,aACS;CACT,IAAI,qBAAqB;CACzB,IAAI,yBAAyB;CAC7B,KAAK,IAAI,QAAQ,GAAG,QAAQ,iCAAiC,QAAQ,SAAS,GAAG;EAC/E,MAAM,OAAO,iCAAiC;EAC9C,MAAM,cAAc,WAAW,KAAK,YAAY,IAAI;EACpD,MAAM,cAAc,YAAY,aAAa;EAC7C,IAAI,gBAAgB,KAAA,GAAW,sBAAsB;EACrD,IAAI,YAAY,iBAAiB,GAAG,0BAA0B;EAC9D,IAAI,gBAAgB,KAAA,KAAa,YAAY,mBAAmB,GAAG;EACnE,IAAI,YAAY,mBAAmB,YAAY,WAAW;EAC1D,IAAI,KAAK,IAAI,cAAc,YAAY,KAAK,IAAI,OAAO,OAAO;CAChE;CACA,OAAO,uBAAuB,KAAK,yBAAyB;AAC9D;AAEA,SAAS,YACP,MACA,MACU;CACV,MAAM,MAAgB,CAAC;CACvB,MAAM,uBAAO,IAAI,IAAY;CAC7B,IAAI,WAAW,KAAK;CACpB,OAAO,YAAY,CAAC,KAAK,IAAI,QAAQ,GAAG;EACtC,IAAI,KAAK,QAAQ;EACjB,KAAK,IAAI,QAAQ;EACjB,WAAW,KAAK,IAAI,QAAQ,CAAC,EAAE;CACjC;CACA,OAAO;AACT;AAEA,SAAS,uBACP,MACA,MACA,cACoB;CACpB,MAAM,uBAAO,IAAI,IAAY;CAC7B,IAAI,WAAW,KAAK;CACpB,OAAO,YAAY,CAAC,KAAK,IAAI,QAAQ,GAAG;EACtC,IAAI,aAAa,IAAI,QAAQ,GAAG,OAAO;EACvC,KAAK,IAAI,QAAQ;EACjB,WAAW,KAAK,IAAI,QAAQ,CAAC,EAAE;CACjC;AAEF;AAEA,SAAS,WACP,YACA,MACoB;CACpB,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,QAAQ,WAAW;EACzB,MAAM,SACJ,OAAO,UAAU,WACb,QACA,OAAO,UAAU,YAAY,MAAM,SAAS,IAC1C,OAAO,KAAK,IACZ;EACR,IAAI,OAAO,SAAS,MAAM,KAAK,UAAU,GAAG,OAAO;CACrD;AAEF;;;ACpaA,MAAM,0BAA0B;AAChC,MAAM,yBAAyB;AAW/B,SAAgB,sBACd,OACA,SACmB;CACnB,MAAM,eAAe,yBAAyB,OAAO,yBAAyB,OAAO;CACrF,MAAM,cAAc,yBAAyB,OAAO,wBAAwB,OAAO;CAEnF,IAAI,iBAAiB,KAAA,KAAa,CAAC,gBAAgB,SAAS,YAA4B,GACtF,MAAM,IAAI,gBACR,GAAG,QAAQ,IAAI,wBAAwB,kBAAkB,gBAAgB,KAAK,IAAI,GACpF;CAEF,IAAI,gBAAgB,KAAA,MAAc,iBAAiB,KAAA,KAAa,iBAAiB,YAC/E,MAAM,IAAI,gBACR,GAAG,QAAQ,IAAI,uBAAuB,0BAA0B,yBAClE;CAGF,IAAI,iBAAiB,KAAA,GAAW,OAAO,CAAC;CACxC,IAAI,iBAAiB,WAAW,OAAO,EAAE,aAAa;CACtD,OAAO;EACS;EACd,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;CACvC;AACF;AAEA,SAAS,yBACP,OACA,KACA,SACoB;CACpB,MAAM,yBAAS,IAAI,IAAY;CAC/B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,CAAC,OAAO,OAAO,KAAK,YAAY,GAAG,GAAG;EAC1C,MAAM,QAAQ,KAAK,WAAW;EAC9B,IAAI,OAAO,UAAU,YAAY,MAAM,KAAK,CAAC,CAAC,WAAW,GACvD,MAAM,IAAI,gBAAgB,GAAG,QAAQ,IAAI,IAAI,4BAA4B;EAE3E,OAAO,IAAI,KAAK;CAClB;CAEA,IAAI,OAAO,OAAO,GAChB,MAAM,IAAI,gBACR,GAAG,QAAQ,gBAAgB,IAAI,WAAW,CAAC,GAAG,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI,GACxE;CAEF,OAAO,OAAO,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC;AAChC"}