@opensearch-project/agent-health 0.3.0 → 0.5.2

package/lib/dist/services/traces/categoryStyles.js

@@ -0,0 +1,56 @@
+/*
+ * Copyright OpenSearch Contributors
+ * SPDX-License-Identifier: Apache-2.0
+ */
+export const CATEGORY_COLORS = {
+    AGENT: {
+        border: 'border-indigo-500/50',
+        bg: 'bg-indigo-500/10',
+        text: 'text-indigo-400',
+        bar: 'bg-indigo-500',
+        chipHover: 'hover:bg-indigo-500/20',
+    },
+    LLM: {
+        border: 'border-purple-500/50',
+        bg: 'bg-purple-500/10',
+        text: 'text-purple-400',
+        bar: 'bg-purple-500',
+        chipHover: 'hover:bg-purple-500/20',
+    },
+    TOOL: {
+        border: 'border-amber-500/50',
+        bg: 'bg-amber-500/10',
+        text: 'text-amber-400',
+        bar: 'bg-amber-500',
+        chipHover: 'hover:bg-amber-500/20',
+    },
+    EVAL: {
+        border: 'border-emerald-500/50',
+        bg: 'bg-emerald-500/10',
+        text: 'text-emerald-400',
+        bar: 'bg-emerald-500',
+        chipHover: 'hover:bg-emerald-500/20',
+    },
+    ERROR: {
+        border: 'border-red-500/50',
+        bg: 'bg-red-500/10',
+        text: 'text-red-400',
+        bar: 'bg-red-500',
+        chipHover: 'hover:bg-red-500/20',
+    },
+    OTHER: {
+        border: 'border-slate-500/50',
+        bg: 'bg-slate-500/10',
+        text: 'text-slate-400',
+        bar: 'bg-slate-500',
+        chipHover: 'hover:bg-slate-500/20',
+    },
+};
+/**
+ * Get category colors for a given category string.
+ * Falls back to OTHER for unknown categories.
+ */
+export function getCategoryColors(category) {
+    return CATEGORY_COLORS[category] || CATEGORY_COLORS.OTHER;
+}
+//# sourceMappingURL=categoryStyles.js.map

package/lib/dist/services/traces/categoryStyles.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"categoryStyles.js","sourceRoot":"","sources":["../../../../services/traces/categoryStyles.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAmBH,MAAM,CAAC,MAAM,eAAe,GAAwD;IAClF,KAAK,EAAE;QACL,MAAM,EAAE,sBAAsB;QAC9B,EAAE,EAAE,kBAAkB;QACtB,IAAI,EAAE,iBAAiB;QACvB,GAAG,EAAE,eAAe;QACpB,SAAS,EAAE,wBAAwB;KACpC;IACD,GAAG,EAAE;QACH,MAAM,EAAE,sBAAsB;QAC9B,EAAE,EAAE,kBAAkB;QACtB,IAAI,EAAE,iBAAiB;QACvB,GAAG,EAAE,eAAe;QACpB,SAAS,EAAE,wBAAwB;KACpC;IACD,IAAI,EAAE;QACJ,MAAM,EAAE,qBAAqB;QAC7B,EAAE,EAAE,iBAAiB;QACrB,IAAI,EAAE,gBAAgB;QACtB,GAAG,EAAE,cAAc;QACnB,SAAS,EAAE,uBAAuB;KACnC;IACD,IAAI,EAAE;QACJ,MAAM,EAAE,uBAAuB;QAC/B,EAAE,EAAE,mBAAmB;QACvB,IAAI,EAAE,kBAAkB;QACxB,GAAG,EAAE,gBAAgB;QACrB,SAAS,EAAE,yBAAyB;KACrC;IACD,KAAK,EAAE;QACL,MAAM,EAAE,mBAAmB;QAC3B,EAAE,EAAE,eAAe;QACnB,IAAI,EAAE,cAAc;QACpB,GAAG,EAAE,YAAY;QACjB,SAAS,EAAE,qBAAqB;KACjC;IACD,KAAK,EAAE;QACL,MAAM,EAAE,qBAAqB;QAC7B,EAAE,EAAE,iBAAiB;QACrB,IAAI,EAAE,gBAAgB;QACtB,GAAG,EAAE,cAAc;QACnB,SAAS,EAAE,uBAAuB;KACnC;CACF,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,QAAgB;IAChD,OAAO,eAAe,CAAC,QAAwB,CAAC,IAAI,eAAe,CAAC,KAAK,CAAC;AAC5E,CAAC"}

package/lib/dist/services/traces/executionOrderTransform.d.ts

@@ -0,0 +1,35 @@
+import { CategorizedSpan, FlowTransformResult, FlowTransformOptions } from '../../types/index.js';
+/**
+ * Detect if a span is a container span (wrapper for entire execution).
+ * Container spans are excluded from flow nodes - only their children are shown.
+ *
+ * Uses multiple heuristics to support different agent implementations:
+ * 1. OTEL GenAI semantic convention (gen_ai.operation.name)
+ * 2. Name-based pattern matching
+ * 3. Duration heuristic (span covers 90%+ of children duration)
+ */
+declare function isContainerSpan(span: CategorizedSpan): boolean;
+/**
+ * Find the main flow spans (entry point for execution flow).
+ * Adapts to different agent span structures.
+ */
+declare function findMainFlowSpans(spanTree: CategorizedSpan[]): CategorizedSpan[];
+/**
+ * Sort spans by startTime for execution order
+ */
+declare function sortByStartTime(spans: CategorizedSpan[]): CategorizedSpan[];
+/**
+ * Main transform function: Convert span tree to execution-order flow.
+ *
+ * Algorithm:
+ * 1. Find main flow spans (skip container root if present)
+ * 2. Process each level: create nodes, sequential edges between siblings
+ * 3. For spans with children: create branch edges, recurse into children
+ * 4. Apply dagre layout for positioning
+ */
+export declare function spansToExecutionFlow(spanTree: CategorizedSpan[], totalDuration: number, options?: FlowTransformOptions): FlowTransformResult;
+/**
+ * Export utility functions for testing
+ */
+export { isContainerSpan, findMainFlowSpans, sortByStartTime };
+//# sourceMappingURL=executionOrderTransform.d.ts.map

package/lib/dist/services/traces/executionOrderTransform.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"executionOrderTransform.d.ts","sourceRoot":"","sources":["../../../../services/traces/executionOrderTransform.ts"],"names":[],"mappings":"AAoBA,OAAO,EACL,eAAe,EAEf,mBAAmB,EACnB,oBAAoB,EACrB,MAAM,SAAS,CAAC;AAqBjB;;;;;;;;GAQG;AACH,iBAAS,eAAe,CAAC,IAAI,EAAE,eAAe,GAAG,OAAO,CAyCvD;AAED;;;GAGG;AACH,iBAAS,iBAAiB,CAAC,QAAQ,EAAE,eAAe,EAAE,GAAG,eAAe,EAAE,CAmBzE;AAED;;GAEG;AACH,iBAAS,eAAe,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG,eAAe,EAAE,CAIpE;AAmJD;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAClC,QAAQ,EAAE,eAAe,EAAE,EAC3B,aAAa,EAAE,MAAM,EACrB,OAAO,GAAE,oBAAyB,GACjC,mBAAmB,CAgDrB;AAwDD;;GAEG;AACH,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,eAAe,EAAE,CAAC"}

package/lib/dist/services/traces/executionOrderTransform.js

@@ -0,0 +1,313 @@
+/*
+ * Copyright OpenSearch Contributors
+ * SPDX-License-Identifier: Apache-2.0
+ */
+/**
+ * Execution Order Transform Service
+ *
+ * Transforms span trees to React Flow format using execution-order linking
+ * (like AWS Step Functions) instead of parent-child hierarchy.
+ *
+ * Key differences from hierarchy mode:
+ * - Siblings at each level linked by execution order (startTime)
+ * - Container spans (like agent.run) excluded from flow nodes
+ * - Parent→child shown as branch edges (detail), not main flow
+ * - Parallel detection only among siblings with overlapping times
+ */
+import { MarkerType } from '@xyflow/react';
+import dagre from 'dagre';
+import { ATTR_GEN_AI_OPERATION_NAME, GEN_AI_OPERATION_NAME_VALUE_INVOKE_AGENT, GEN_AI_OPERATION_NAME_VALUE_CREATE_AGENT, } from '@opentelemetry/semantic-conventions/incubating';
+const DEFAULT_OPTIONS = {
+    direction: 'TB',
+    mode: 'execution-order',
+    nodeWidth: 200,
+    nodeHeight: 70,
+    nodeSpacingX: 50,
+    nodeSpacingY: 80,
+};
+/**
+ * Detect if a span is a container span (wrapper for entire execution).
+ * Container spans are excluded from flow nodes - only their children are shown.
+ *
+ * Uses multiple heuristics to support different agent implementations:
+ * 1. OTEL GenAI semantic convention (gen_ai.operation.name)
+ * 2. Name-based pattern matching
+ * 3. Duration heuristic (span covers 90%+ of children duration)
+ */
+function isContainerSpan(span) {
+    // 1. OTEL GenAI convention: invoke_agent/create_agent are container operations
+    const operationName = span.attributes?.[ATTR_GEN_AI_OPERATION_NAME];
+    if (operationName === GEN_AI_OPERATION_NAME_VALUE_INVOKE_AGENT ||
+        operationName === GEN_AI_OPERATION_NAME_VALUE_CREATE_AGENT) {
+        return true;
+    }
+    // 2. Name-based heuristic for agents that don't use OTEL attributes
+    const name = span.name?.toLowerCase() || '';
+    if (name.includes('agent.run') || name.includes('invoke_agent')) {
+        return true;
+    }
+    // 3. Single root with children that spans entire trace
+    if (!span.parentSpanId && span.children && span.children.length > 1) {
+        const spanStart = new Date(span.startTime).getTime();
+        const spanEnd = new Date(span.endTime).getTime();
+        const spanDuration = spanEnd - spanStart;
+        // Get min start and max end from children
+        const children = span.children;
+        let minChildStart = Infinity;
+        let maxChildEnd = -Infinity;
+        children.forEach(child => {
+            const childStart = new Date(child.startTime).getTime();
+            const childEnd = new Date(child.endTime).getTime();
+            minChildStart = Math.min(minChildStart, childStart);
+            maxChildEnd = Math.max(maxChildEnd, childEnd);
+        });
+        const childrenSpan = maxChildEnd - minChildStart;
+        // If span encompasses children (90%+ coverage), it's likely a container
+        if (childrenSpan > 0 && spanDuration >= childrenSpan * 0.9) {
+            return true;
+        }
+    }
+    return false;
+}
+/**
+ * Find the main flow spans (entry point for execution flow).
+ * Adapts to different agent span structures.
+ */
+function findMainFlowSpans(spanTree) {
+    // spanTree contains top-level spans from processSpansIntoTree().
+    // These are tree roots even if they have a parentSpanId pointing to a span
+    // outside the fetched data (e.g., a parent in a different service/trace context).
+    // Use all top-level spans as roots instead of filtering by !parentSpanId.
+    const roots = spanTree;
+    // Case 1: Single root that's a container → main flow is its children
+    if (roots.length === 1 && isContainerSpan(roots[0])) {
+        const children = roots[0].children || [];
+        if (children.length === 0) {
+            // Fallback: container has no children, show the root itself instead of empty graph
+            return roots;
+        }
+        return children;
+    }
+    // Case 2: Multiple roots OR single non-container root → roots are main flow
+    return roots;
+}
+/**
+ * Sort spans by startTime for execution order
+ */
+function sortByStartTime(spans) {
+    return [...spans].sort((a, b) => new Date(a.startTime).getTime() - new Date(b.startTime).getTime());
+}
+/**
+ * Create a flow node from a categorized span
+ */
+function createNode(span, totalDuration, options) {
+    return {
+        id: span.spanId,
+        type: span.category.toLowerCase(),
+        data: {
+            span,
+            totalDuration,
+        },
+        position: { x: 0, y: 0 }, // Will be set by dagre layout
+        style: {
+            width: options.nodeWidth,
+            height: options.nodeHeight,
+        },
+    };
+}
+/**
+ * Create an edge between two nodes with appropriate styling
+ */
+function createEdge(sourceId, targetId, edgeType) {
+    const baseStyle = {
+        strokeWidth: 2,
+    };
+    switch (edgeType) {
+        case 'sequential':
+            return {
+                id: `${sourceId}-${targetId}`,
+                source: sourceId,
+                target: targetId,
+                type: 'smoothstep',
+                animated: false,
+                style: {
+                    ...baseStyle,
+                    stroke: '#64748b', // slate
+                },
+                markerEnd: {
+                    type: MarkerType.ArrowClosed,
+                    width: 12,
+                    height: 12,
+                    color: '#64748b',
+                },
+            };
+        case 'parallel':
+            return {
+                id: `${sourceId}-${targetId}`,
+                source: sourceId,
+                target: targetId,
+                type: 'smoothstep',
+                animated: true,
+                style: {
+                    ...baseStyle,
+                    stroke: '#f59e0b', // amber
+                    strokeDasharray: '5,5',
+                },
+                markerEnd: {
+                    type: MarkerType.ArrowClosed,
+                    width: 12,
+                    height: 12,
+                    color: '#f59e0b',
+                },
+            };
+        case 'branch':
+            return {
+                id: `${sourceId}-branch-${targetId}`,
+                source: sourceId,
+                target: targetId,
+                type: 'smoothstep',
+                animated: false,
+                style: {
+                    ...baseStyle,
+                    stroke: '#6366f1', // indigo
+                    strokeDasharray: '3,3',
+                    strokeWidth: 1.5,
+                },
+                markerEnd: {
+                    type: MarkerType.ArrowClosed,
+                    width: 10,
+                    height: 10,
+                    color: '#6366f1',
+                },
+            };
+    }
+}
+/**
+ * Create edges between siblings in execution order.
+ * Detects parallel execution when spans overlap in time.
+ */
+function createSiblingEdges(siblings) {
+    if (siblings.length < 2)
+        return [];
+    const edges = [];
+    const sorted = sortByStartTime(siblings);
+    for (let i = 0; i < sorted.length - 1; i++) {
+        const current = sorted[i];
+        const next = sorted[i + 1];
+        // Check for parallel execution (overlapping times)
+        const currentEnd = new Date(current.endTime).getTime();
+        const nextStart = new Date(next.startTime).getTime();
+        // Allow small overlap threshold (10ms) for timing jitter
+        const isParallel = nextStart < currentEnd - 10;
+        edges.push(createEdge(current.spanId, next.spanId, isParallel ? 'parallel' : 'sequential'));
+    }
+    return edges;
+}
+/**
+ * Create branch edges from parent to its first child.
+ * Shows nesting/detail relationship, not main execution flow.
+ */
+function createBranchEdges(span) {
+    if (!span.children || span.children.length === 0)
+        return [];
+    const children = span.children;
+    const sorted = sortByStartTime(children);
+    // Edge from parent to first child only (branch off point)
+    return [createEdge(span.spanId, sorted[0].spanId, 'branch')];
+}
+/**
+ * Main transform function: Convert span tree to execution-order flow.
+ *
+ * Algorithm:
+ * 1. Find main flow spans (skip container root if present)
+ * 2. Process each level: create nodes, sequential edges between siblings
+ * 3. For spans with children: create branch edges, recurse into children
+ * 4. Apply dagre layout for positioning
+ */
+export function spansToExecutionFlow(spanTree, totalDuration, options = {}) {
+    const opts = { ...DEFAULT_OPTIONS, ...options };
+    const nodes = [];
+    const edges = [];
+    // Find the main flow entry point
+    const mainFlowSpans = findMainFlowSpans(spanTree);
+    if (mainFlowSpans.length === 0) {
+        return { nodes: [], edges: [] };
+    }
+    /**
+     * Process a level of siblings in the span hierarchy.
+     * Creates nodes and edges for this level, then recurses into children.
+     */
+    function processLevel(siblings) {
+        if (siblings.length === 0)
+            return;
+        const sorted = sortByStartTime(siblings);
+        // Create nodes for all spans at this level
+        sorted.forEach(span => {
+            nodes.push(createNode(span, totalDuration, opts));
+        });
+        // Create sequential edges between siblings
+        edges.push(...createSiblingEdges(sorted));
+        // Process children for each span
+        sorted.forEach(span => {
+            if (span.children && span.children.length > 0) {
+                const children = span.children;
+                // Create branch edge from parent to children
+                edges.push(...createBranchEdges(span));
+                // Recursively process children
+                processLevel(children);
+            }
+        });
+    }
+    // Start processing from main flow level
+    processLevel(mainFlowSpans);
+    // Apply dagre layout for positioning
+    return applyDagreLayout(nodes, edges, opts);
+}
+/**
+ * Apply dagre layout algorithm to position nodes.
+ * Uses TB (top-to-bottom) direction for vertical flow.
+ */
+function applyDagreLayout(nodes, edges, options) {
+    if (nodes.length === 0) {
+        return { nodes: [], edges: [] };
+    }
+    const dagreGraph = new dagre.graphlib.Graph();
+    dagreGraph.setDefaultEdgeLabel(() => ({}));
+    dagreGraph.setGraph({
+        rankdir: options.direction, // TB for vertical flow
+        nodesep: options.nodeSpacingX,
+        ranksep: options.nodeSpacingY,
+        marginx: 20,
+        marginy: 20,
+    });
+    // Add nodes to dagre
+    nodes.forEach(node => {
+        dagreGraph.setNode(node.id, {
+            width: options.nodeWidth,
+            height: options.nodeHeight,
+        });
+    });
+    // Add edges to dagre
+    edges.forEach(edge => {
+        dagreGraph.setEdge(edge.source, edge.target);
+    });
+    // Run layout algorithm
+    dagre.layout(dagreGraph);
+    // Apply calculated positions to nodes
+    const layoutedNodes = nodes.map(node => {
+        const nodeWithPosition = dagreGraph.node(node.id);
+        return {
+            ...node,
+            position: {
+                x: nodeWithPosition.x - options.nodeWidth / 2,
+                y: nodeWithPosition.y - options.nodeHeight / 2,
+            },
+        };
+    });
+    return { nodes: layoutedNodes, edges };
+}
+/**
+ * Export utility functions for testing
+ */
+export { isContainerSpan, findMainFlowSpans, sortByStartTime };
+//# sourceMappingURL=executionOrderTransform.js.map

package/lib/dist/services/traces/executionOrderTransform.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"executionOrderTransform.js","sourceRoot":"","sources":["../../../../services/traces/executionOrderTransform.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;GAWG;AAEH,OAAO,EAAc,UAAU,EAAE,MAAM,eAAe,CAAC;AACvD,OAAO,KAAK,MAAM,OAAO,CAAC;AAO1B,OAAO,EACL,0BAA0B,EAC1B,wCAAwC,EACxC,wCAAwC,GACzC,MAAM,gDAAgD,CAAC;AAOxD,MAAM,eAAe,GAAmC;IACtD,SAAS,EAAE,IAAI;IACf,IAAI,EAAE,iBAAiB;IACvB,SAAS,EAAE,GAAG;IACd,UAAU,EAAE,EAAE;IACd,YAAY,EAAE,EAAE;IAChB,YAAY,EAAE,EAAE;CACjB,CAAC;AAEF;;;;;;;;GAQG;AACH,SAAS,eAAe,CAAC,IAAqB;IAC5C,+EAA+E;IAC/E,MAAM,aAAa,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,0BAA0B,CAAC,CAAC;IACpE,IAAI,aAAa,KAAK,wCAAwC;QAC1D,aAAa,KAAK,wCAAwC,EAAE,CAAC;QAC/D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,oEAAoE;IACpE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;IAC5C,IAAI,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;QAChE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,uDAAuD;IACvD,IAAI,CAAC,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpE,MAAM,SAAS,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;QACrD,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC;QACjD,MAAM,YAAY,GAAG,OAAO,GAAG,SAAS,CAAC;QAEzC,0CAA0C;QAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAA6B,CAAC;QACpD,IAAI,aAAa,GAAG,QAAQ,CAAC;QAC7B,IAAI,WAAW,GAAG,CAAC,QAAQ,CAAC;QAE5B,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;YACvB,MAAM,UAAU,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;YACvD,MAAM,QAAQ,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC;YACnD,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;YACpD,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,MAAM,YAAY,GAAG,WAAW,GAAG,aAAa,CAAC;QAEjD,wEAAwE;QACxE,IAAI,YAAY,GAAG,CAAC,IAAI,YAAY,IAAI,YAAY,GAAG,GAAG,EAAE,CAAC;YAC3D,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,QAA2B;IACpD,iEAAiE;IACjE,2EAA2E;IAC3E,kFAAkF;IAClF,0EAA0E;IAC1E,MAAM,KAAK,GAAG,QAAQ,CAAC;IAEvB,qEAAqE;IACrE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACpD,MAAM,QAAQ,GAAI,KAAK,CAAC,CAAC,CAAC,CAAC,QAA8B,IAAI,EAAE,CAAC;QAChE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,mFAAmF;YACnF,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,4EAA4E;IAC5E,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,KAAwB;IAC/C,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CACpB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAC5E,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,UAAU,CACjB,IAAqB,EACrB,aAAqB,EACrB,OAAuC;IAEvC,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,MAAM;QACf,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE;QACjC,IAAI,EAAE;YACJ,IAAI;YACJ,aAAa;SACd;QACD,QAAQ,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,8BAA8B;QACxD,KAAK,EAAE;YACL,KAAK,EAAE,OAAO,CAAC,SAAS;YACxB,MAAM,EAAE,OAAO,CAAC,UAAU;SAC3B;KACF,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,UAAU,CACjB,QAAgB,EAChB,QAAgB,EAChB,QAAkB;IAElB,MAAM,SAAS,GAAG;QAChB,WAAW,EAAE,CAAC;KACf,CAAC;IAEF,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,YAAY;YACf,OAAO;gBACL,EAAE,EAAE,GAAG,QAAQ,IAAI,QAAQ,EAAE;gBAC7B,MAAM,EAAE,QAAQ;gBAChB,MAAM,EAAE,QAAQ;gBAChB,IAAI,EAAE,YAAY;gBAClB,QAAQ,EAAE,KAAK;gBACf,KAAK,EAAE;oBACL,GAAG,SAAS;oBACZ,MAAM,EAAE,SAAS,EAAE,QAAQ;iBAC5B;gBACD,SAAS,EAAE;oBACT,IAAI,EAAE,UAAU,CAAC,WAAW;oBAC5B,KAAK,EAAE,EAAE;oBACT,MAAM,EAAE,EAAE;oBACV,KAAK,EAAE,SAAS;iBACjB;aACF,CAAC;QAEJ,KAAK,UAAU;YACb,OAAO;gBACL,EAAE,EAAE,GAAG,QAAQ,IAAI,QAAQ,EAAE;gBAC7B,MAAM,EAAE,QAAQ;gBAChB,MAAM,EAAE,QAAQ;gBAChB,IAAI,EAAE,YAAY;gBAClB,QAAQ,EAAE,IAAI;gBACd,KAAK,EAAE;oBACL,GAAG,SAAS;oBACZ,MAAM,EAAE,SAAS,EAAE,QAAQ;oBAC3B,eAAe,EAAE,KAAK;iBACvB;gBACD,SAAS,EAAE;oBACT,IAAI,EAAE,UAAU,CAAC,WAAW;oBAC5B,KAAK,EAAE,EAAE;oBACT,MAAM,EAAE,EAAE;oBACV,KAAK,EAAE,SAAS;iBACjB;aACF,CAAC;QAEJ,KAAK,QAAQ;YACX,OAAO;gBACL,EAAE,EAAE,GAAG,QAAQ,WAAW,QAAQ,EAAE;gBACpC,MAAM,EAAE,QAAQ;gBAChB,MAAM,EAAE,QAAQ;gBAChB,IAAI,EAAE,YAAY;gBAClB,QAAQ,EAAE,KAAK;gBACf,KAAK,EAAE;oBACL,GAAG,SAAS;oBACZ,MAAM,EAAE,SAAS,EAAE,SAAS;oBAC5B,eAAe,EAAE,KAAK;oBACtB,WAAW,EAAE,GAAG;iBACjB;gBACD,SAAS,EAAE;oBACT,IAAI,EAAE,UAAU,CAAC,WAAW;oBAC5B,KAAK,EAAE,EAAE;oBACT,MAAM,EAAE,EAAE;oBACV,KAAK,EAAE,SAAS;iBACjB;aACF,CAAC;IACN,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,QAA2B;IACrD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAE3B,mDAAmD;QACnD,MAAM,UAAU,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC;QACvD,MAAM,SAAS,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;QAErD,yDAAyD;QACzD,MAAM,UAAU,GAAG,SAAS,GAAG,UAAU,GAAG,EAAE,CAAC;QAE/C,KAAK,CAAC,IAAI,CACR,UAAU,CACR,OAAO,CAAC,MAAM,EACd,IAAI,CAAC,MAAM,EACX,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY,CACvC,CACF,CAAC;IACJ,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,IAAqB;IAC9C,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAE5D,MAAM,QAAQ,GAAG,IAAI,CAAC,QAA6B,CAAC;IACpD,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IAEzC,0DAA0D;IAC1D,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC;AAC/D,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAClC,QAA2B,EAC3B,aAAqB,EACrB,UAAgC,EAAE;IAElC,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAoC,CAAC;IAClF,MAAM,KAAK,GAAyB,EAAE,CAAC;IACvC,MAAM,KAAK,GAAW,EAAE,CAAC;IAEzB,iCAAiC;IACjC,MAAM,aAAa,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IAElD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAClC,CAAC;IAED;;;OAGG;IACH,SAAS,YAAY,CAAC,QAA2B;QAC/C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAElC,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;QAEzC,2CAA2C;QAC3C,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACpB,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,2CAA2C;QAC3C,KAAK,CAAC,IAAI,CAAC,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC;QAE1C,iCAAiC;QACjC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACpB,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAA6B,CAAC;gBAEpD,6CAA6C;gBAC7C,KAAK,CAAC,IAAI,CAAC,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC;gBAEvC,+BAA+B;gBAC/B,YAAY,CAAC,QAAQ,CAAC,CAAC;YACzB,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,wCAAwC;IACxC,YAAY,CAAC,aAAa,CAAC,CAAC;IAE5B,qCAAqC;IACrC,OAAO,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;AAC9C,CAAC;AAED;;;GAGG;AACH,SAAS,gBAAgB,CACvB,KAA2B,EAC3B,KAAa,EACb,OAAuC;IAEvC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAClC,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IAC9C,UAAU,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3C,UAAU,CAAC,QAAQ,CAAC;QAClB,OAAO,EAAE,OAAO,CAAC,SAAS,EAAE,uBAAuB;QACnD,OAAO,EAAE,OAAO,CAAC,YAAY;QAC7B,OAAO,EAAE,OAAO,CAAC,YAAY;QAC7B,OAAO,EAAE,EAAE;QACX,OAAO,EAAE,EAAE;KACZ,CAAC,CAAC;IAEH,qBAAqB;IACrB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACnB,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE;YAC1B,KAAK,EAAE,OAAO,CAAC,SAAS;YACxB,MAAM,EAAE,OAAO,CAAC,UAAU;SAC3B,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,qBAAqB;IACrB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACnB,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,uBAAuB;IACvB,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAEzB,sCAAsC;IACtC,MAAM,aAAa,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;QACrC,MAAM,gBAAgB,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClD,OAAO;YACL,GAAG,IAAI;YACP,QAAQ,EAAE;gBACR,CAAC,EAAE,gBAAgB,CAAC,CAAC,GAAG,OAAO,CAAC,SAAS,GAAG,CAAC;gBAC7C,CAAC,EAAE,gBAAgB,CAAC,CAAC,GAAG,OAAO,CAAC,UAAU,GAAG,CAAC;aAC/C;SACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC;AACzC,CAAC;AAED;;GAEG;AACH,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,eAAe,EAAE,CAAC"}

package/lib/dist/services/traces/fetchSpansForRun.d.ts

@@ -0,0 +1,86 @@
+/**
+ * Lightweight polling helper used by the SDK runner to pre-load OTel
+ * spans into the `traces` fixture for deterministic test bodies (#230).
+ *
+ * This is a thinner cousin of `tracePollingManager.startPolling`:
+ *   - no judge wiring, no report storage updates, no trajectory rebuild
+ *   - returns a result object that includes the **last error message**
+ *     when polling never produced spans, so the caller can build a
+ *     specific `unavailableTracesAccessor("fetch failed: …")` reason
+ *     instead of a generic "no spans found"
+ *
+ * **Defaults are deliberately faster than the judge poller** in
+ * `services/traces/tracePoller.ts`. The judge runs as a background
+ * task while the user already sees a "pending" badge; ten minutes of
+ * polling there is fine. The SDK fixture pre-load, however, is
+ * synchronous inside the test body — every test waits on it before
+ * its first assertion can run, so we cap the default budget at
+ * ~10 seconds (10 × 1s). Users can still bump this via `tracePolling`
+ * on the agent config or via `TRACE_POLL_INTERVAL_MS` /
+ * `TRACE_POLL_MAX_ATTEMPTS` env vars (the same vars the judge poller
+ * honours), and a hard `MAX_POLL_CEILING` mirrors the one in
+ * `tracePoller.ts` so a misconfigured agent can't block a test for
+ * an unbounded time.
+ */
+import type { Span } from '../../types/index.js';
+/**
+ * Strategy-C correlation input: an agent's OTel `service.name` plus the run's
+ * wall-clock window. Used as a fallback (and union) when the agent's spans are
+ * not tagged with the connector `runId` (Strategy B) — e.g. Claude Code / any
+ * subprocess agent whose OTel SDK emits its own trace and never sees our runId.
+ * Mirrors the `windowAgents` clause the run-report Traces tab already issues.
+ */
+export interface TraceWindowAgent {
+    serviceName: string;
+    startedAt: number;
+    endedAt: number;
+    /** Strategy D: precise per-run correlator (e.g. Claude Code `session.id`). */
+    sessionId?: string;
+}
+/**
+ * Hard ceiling on `maxAttempts`, mirroring the constant in
+ * `services/traces/tracePoller.ts`. Prevents a misconfigured agent
+ * (e.g. `tracePolling.maxAttempts: 10_000`) from blocking a test body
+ * indefinitely.
+ */
+export declare const SDK_TRACE_POLL_CEILING = 60;
+/** Default interval between polling attempts. ~1s for SDK interactivity. */
+export declare const SDK_DEFAULT_POLL_INTERVAL_MS: number;
+/** Default attempt budget. 10 attempts × ~1s ≈ 10s total for SDK pre-load. */
+export declare const SDK_DEFAULT_MAX_ATTEMPTS: number;
+export interface FetchSpansForRunOptions {
+    /** Total number of attempts. Capped at {@link SDK_TRACE_POLL_CEILING}. */
+    maxAttempts?: number;
+    /** Delay between attempts in ms. */
+    intervalMs?: number;
+    /**
+     * Strategy-C fallback: when provided, each poll unions the `runId` clause
+     * with a service-name + time-window clause. This is what lets the SDK
+     * `traces` fixture (and therefore the judge) actually receive spans from
+     * agents like Claude Code whose OTel spans carry their own traceId +
+     * `service.name` but NOT our connector `runId`. Without this, runId-only
+     * correlation returns 0 spans and the judge never sees the trace (#XXX).
+     */
+    windowAgents?: TraceWindowAgent[];
+}
+export interface FetchSpansForRunResult {
+    /** Spans returned on the first non-empty attempt, or `[]` on timeout / error. */
+    spans: Span[];
+    /**
+     * If `spans` is empty, the message of the last error thrown by
+     * `fetchTracesByRunIds` (auth failure, 5xx, network down, etc.).
+     * `undefined` when polling completed without errors but the trace
+     * backend simply had no spans for this `runId` yet — in that case the
+     * caller should report a "no spans found" reason rather than a "fetch
+     * failed" reason.
+     */
+    lastError?: string;
+}
+/**
+ * Poll for spans associated with a single agent runId. Resolves with
+ * the spans on the first non-empty fetch, or with `{ spans: [],
+ * lastError? }` after `maxAttempts` of empty / failing responses.
+ * Never throws.
+ */
+export declare function fetchSpansForRun(runId: string | undefined, options?: FetchSpansForRunOptions): Promise<FetchSpansForRunResult>;
+//# sourceMappingURL=fetchSpansForRun.d.ts.map

package/lib/dist/services/traces/fetchSpansForRun.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fetchSpansForRun.d.ts","sourceRoot":"","sources":["../../../../services/traces/fetchSpansForRun.ts"],"names":[],"mappings":"AAKA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAIpC;;;;;;GAMG;AACH,MAAM,WAAW,gBAAgB;IAC/B,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,8EAA8E;IAC9E,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;;;GAKG;AACH,eAAO,MAAM,sBAAsB,KAAK,CAAC;AASzC,4EAA4E;AAC5E,eAAO,MAAM,4BAA4B,QAAyC,CAAC;AACnF,8EAA8E;AAC9E,eAAO,MAAM,wBAAwB,QAAwC,CAAC;AAE9E,MAAM,WAAW,uBAAuB;IACtC,0EAA0E;IAC1E,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,oCAAoC;IACpC,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;;;;OAOG;IACH,YAAY,CAAC,EAAE,gBAAgB,EAAE,CAAC;CACnC;AAED,MAAM,WAAW,sBAAsB;IACrC,iFAAiF;IACjF,KAAK,EAAE,IAAI,EAAE,CAAC;IACd;;;;;;;OAOG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;;;GAKG;AACH,wBAAsB,gBAAgB,CACpC,KAAK,EAAE,MAAM,GAAG,SAAS,EACzB,OAAO,GAAE,uBAA4B,GACpC,OAAO,CAAC,sBAAsB,CAAC,CAwCjC"}

package/lib/dist/services/traces/fetchSpansForRun.js

@@ -0,0 +1,69 @@
+/*
+ * Copyright OpenSearch Contributors
+ * SPDX-License-Identifier: Apache-2.0
+ */
+import { debug } from '../../lib/debug.js';
+import { fetchTracesForRun } from './index.js';
+/**
+ * Hard ceiling on `maxAttempts`, mirroring the constant in
+ * `services/traces/tracePoller.ts`. Prevents a misconfigured agent
+ * (e.g. `tracePolling.maxAttempts: 10_000`) from blocking a test body
+ * indefinitely.
+ */
+export const SDK_TRACE_POLL_CEILING = 60;
+const envInt = (name, fallback) => {
+    const raw = process.env?.[name];
+    if (!raw)
+        return fallback;
+    const n = parseInt(raw, 10);
+    return Number.isFinite(n) && n > 0 ? n : fallback;
+};
+/** Default interval between polling attempts. ~1s for SDK interactivity. */
+export const SDK_DEFAULT_POLL_INTERVAL_MS = envInt('TRACE_POLL_INTERVAL_MS', 1000);
+/** Default attempt budget. 10 attempts × ~1s ≈ 10s total for SDK pre-load. */
+export const SDK_DEFAULT_MAX_ATTEMPTS = envInt('TRACE_POLL_MAX_ATTEMPTS', 10);
+/**
+ * Poll for spans associated with a single agent runId. Resolves with
+ * the spans on the first non-empty fetch, or with `{ spans: [],
+ * lastError? }` after `maxAttempts` of empty / failing responses.
+ * Never throws.
+ */
+export async function fetchSpansForRun(runId, options = {}) {
+    const requestedMax = options.maxAttempts ?? SDK_DEFAULT_MAX_ATTEMPTS;
+    const maxAttempts = Math.max(1, Math.min(requestedMax, SDK_TRACE_POLL_CEILING));
+    const intervalMs = Math.max(0, options.intervalMs ?? SDK_DEFAULT_POLL_INTERVAL_MS);
+    const windowAgents = options.windowAgents?.length ? options.windowAgents : undefined;
+    const label = runId ?? `service:${windowAgents?.map(a => a.serviceName).join(',') ?? 'none'}`;
+    let lastError;
+    for (let attempt = 1; attempt <= maxAttempts; attempt++) {
+        try {
+            // Union of Strategy B (runId) and Strategy C (service-name + time window),
+            // matching the run-report Traces tab. Either clause alone can be empty
+            // (e.g. Claude Code never tags spans with our runId), so we need both.
+            const result = await fetchTracesForRun({
+                runId: runId || undefined,
+                includeWindowFallback: !!windowAgents,
+                windowAgents,
+            });
+            if (result?.spans && result.spans.length > 0) {
+                debug('FetchSpansForRun', `${label} attempt=${attempt} found ${result.spans.length} spans`);
+                return { spans: result.spans };
+            }
+            // Successful fetch but no spans yet — clear any previous transient
+            // error so the caller doesn't blame a long-since-recovered hiccup.
+            lastError = undefined;
+            debug('FetchSpansForRun', `${label} attempt=${attempt}/${maxAttempts} empty`);
+        }
+        catch (err) {
+            // Capture the message but keep retrying — the caller decides
+            // whether to surface it as `unavailableTracesAccessor` reason.
+            lastError = err instanceof Error ? err.message : String(err);
+            debug('FetchSpansForRun', `${label} attempt=${attempt} fetch error: ${lastError}`);
+        }
+        if (attempt < maxAttempts && intervalMs > 0) {
+            await new Promise(resolve => setTimeout(resolve, intervalMs));
+        }
+    }
+    return { spans: [], lastError };
+}
+//# sourceMappingURL=fetchSpansForRun.js.map

package/lib/dist/services/traces/fetchSpansForRun.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fetchSpansForRun.js","sourceRoot":"","sources":["../../../../services/traces/fetchSpansForRun.ts"],"names":[],"mappings":"AAAA;;;GAGG;AA2BH,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AACpC,OAAO,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAiB5C;;;;;GAKG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,EAAE,CAAC;AAEzC,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,QAAgB,EAAU,EAAE;IACxD,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;IAChC,IAAI,CAAC,GAAG;QAAE,OAAO,QAAQ,CAAC;IAC1B,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IAC5B,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;AACpD,CAAC,CAAC;AAEF,4EAA4E;AAC5E,MAAM,CAAC,MAAM,4BAA4B,GAAG,MAAM,CAAC,wBAAwB,EAAE,IAAI,CAAC,CAAC;AACnF,8EAA8E;AAC9E,MAAM,CAAC,MAAM,wBAAwB,GAAG,MAAM,CAAC,yBAAyB,EAAE,EAAE,CAAC,CAAC;AAgC9E;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,KAAyB,EACzB,UAAmC,EAAE;IAErC,MAAM,YAAY,GAAG,OAAO,CAAC,WAAW,IAAI,wBAAwB,CAAC;IACrE,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,sBAAsB,CAAC,CAAC,CAAC;IAChF,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,UAAU,IAAI,4BAA4B,CAAC,CAAC;IACnF,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC;IACrF,MAAM,KAAK,GAAG,KAAK,IAAI,WAAW,YAAY,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;IAE9F,IAAI,SAA6B,CAAC;IAElC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,WAAW,EAAE,OAAO,EAAE,EAAE,CAAC;QACxD,IAAI,CAAC;YACH,2EAA2E;YAC3E,uEAAuE;YACvE,uEAAuE;YACvE,MAAM,MAAM,GAAG,MAAM,iBAAiB,CAAC;gBACrC,KAAK,EAAE,KAAK,IAAI,SAAS;gBACzB,qBAAqB,EAAE,CAAC,CAAC,YAAY;gBACrC,YAAY;aACb,CAAC,CAAC;YACH,IAAI,MAAM,EAAE,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7C,KAAK,CAAC,kBAAkB,EAAE,GAAG,KAAK,YAAY,OAAO,UAAU,MAAM,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,CAAC;gBAC5F,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC;YACjC,CAAC;YACD,mEAAmE;YACnE,mEAAmE;YACnE,SAAS,GAAG,SAAS,CAAC;YACtB,KAAK,CAAC,kBAAkB,EAAE,GAAG,KAAK,YAAY,OAAO,IAAI,WAAW,QAAQ,CAAC,CAAC;QAChF,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,6DAA6D;YAC7D,+DAA+D;YAC/D,SAAS,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC7D,KAAK,CAAC,kBAAkB,EAAE,GAAG,KAAK,YAAY,OAAO,iBAAiB,SAAS,EAAE,CAAC,CAAC;QACrF,CAAC;QAED,IAAI,OAAO,GAAG,WAAW,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YAC5C,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC;AAClC,CAAC"}

package/lib/dist/services/traces/flowTransform.d.ts

@@ -0,0 +1,24 @@
+import { Node, Edge } from '@xyflow/react';
+import { CategorizedSpan, SpanNodeData, FlowTransformResult, FlowTransformOptions, ParallelGroup } from '../../types/index.js';
+/**
+ * Convert a categorized span tree to React Flow nodes and edges.
+ *
+ * @param spanTree - Categorized span tree to transform
+ * @param totalDuration - Total trace duration for relative sizing
+ * @param options - Transform options including mode
+ * @returns Flow nodes and edges for React Flow
+ */
+export declare function spansToFlow(spanTree: CategorizedSpan[], totalDuration: number, options?: FlowTransformOptions): FlowTransformResult;
+/**
+ * Detect parallel execution among sibling spans by checking time overlap
+ */
+export declare function detectParallelExecution(spans: CategorizedSpan[]): ParallelGroup[];
+/**
+ * Apply dagre layout algorithm to position nodes
+ */
+export declare function applyDagreLayout(nodes: Node<SpanNodeData>[], edges: Edge[], options?: FlowTransformOptions): FlowTransformResult;
+/**
+ * Get total span count from a tree (for stats display)
+ */
+export declare function countSpansInTree(spans: CategorizedSpan[]): number;
+//# sourceMappingURL=flowTransform.d.ts.map

package/lib/dist/services/traces/flowTransform.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flowTransform.d.ts","sourceRoot":"","sources":["../../../../services/traces/flowTransform.ts"],"names":[],"mappings":"AAiBA,OAAO,EAAE,IAAI,EAAE,IAAI,EAAc,MAAM,eAAe,CAAC;AACvD,OAAO,EACL,eAAe,EACf,YAAY,EACZ,mBAAmB,EACnB,oBAAoB,EACpB,aAAa,EACd,MAAM,SAAS,CAAC;AAYjB;;;;;;;GAOG;AACH,wBAAgB,WAAW,CACzB,QAAQ,EAAE,eAAe,EAAE,EAC3B,aAAa,EAAE,MAAM,EACrB,OAAO,GAAE,oBAAyB,GACjC,mBAAmB,CAUrB;AAsGD;;GAEG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG,aAAa,EAAE,CAqDjF;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,EAAE,EAC3B,KAAK,EAAE,IAAI,EAAE,EACb,OAAO,GAAE,oBAAyB,GACjC,mBAAmB,CA0CrB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG,MAAM,CAYjE"}