@workflow/web-shared 5.0.0-beta.4 → 5.0.0-beta.40

package/dist/components/trace-viewer/components/span-segments.js

@@ -1,445 +0,0 @@
-// ──────────────────────────────────────────────────────────────────────────
-// CSS class mapping (segment status → module CSS class name)
-// ──────────────────────────────────────────────────────────────────────────
-/**
- * Maps a SegmentStatus to the CSS module class name to use.
- * These class names must exist in trace-viewer.module.css.
- */
-export const SEGMENT_CLASS_MAP = {
-    queued: 'segQueued',
-    running: 'segRunning',
-    failed: 'segFailed',
-    retrying: 'segRetrying',
-    succeeded: 'segSucceeded',
-    waiting: 'segWaiting',
-    sleeping: 'segSleeping',
-    received: 'segReceived',
-};
-// ──────────────────────────────────────────────────────────────────────────
-// Helpers
-// ──────────────────────────────────────────────────────────────────────────
-function clampFraction(value) {
-    return Math.max(0, Math.min(1, value));
-}
-function timeToFraction(time, spanStart, spanDuration) {
-    if (spanDuration <= 0)
-        return 0;
-    return clampFraction((time - spanStart) / spanDuration);
-}
-/**
- * Sort events by timestamp ascending.
- */
-function sortedEvents(events) {
-    return [...events].sort((a, b) => a.timestamp - b.timestamp);
-}
-// ──────────────────────────────────────────────────────────────────────────
-// Step segments
-// ──────────────────────────────────────────────────────────────────────────
-/**
- * Compute segments for a step span.
- *
- * Timeline: [queued] → [attempt₁ (fail)] → [retry wait] → [attempt₂ (fail)] → ... → [attemptₙ (success)]
- *
- * Events used: step_started, step_retrying, step_failed, step_completed
- * The final segment is 'succeeded' if no trailing step_retrying/step_failed.
- */
-function computeStepSegments(node) {
-    const events = node.events ? sortedEvents(node.events) : [];
-    const { startTime, duration } = node;
-    const segments = [];
-    if (duration <= 0)
-        return segments;
-    const marks = events
-        .filter((e) => [
-        'step_started',
-        'step_retrying',
-        'step_failed',
-        'step_completed',
-    ].includes(e.event.name))
-        .map((e) => ({ time: e.timestamp, type: e.event.name }));
-    if (marks.length === 0) {
-        // No events — show entire span as running
-        segments.push({ startFraction: 0, endFraction: 1, status: 'running' });
-        return segments;
-    }
-    // Queued period: from span start to first event
-    const firstMark = marks[0];
-    const firstFraction = timeToFraction(firstMark.time, startTime, duration);
-    if (firstFraction > 0.001) {
-        segments.push({
-            startFraction: 0,
-            endFraction: firstFraction,
-            status: 'queued',
-        });
-    }
-    // Walk through events to build attempt/retry segments
-    for (let i = 0; i < marks.length; i++) {
-        const mark = marks[i];
-        const markFraction = timeToFraction(mark.time, startTime, duration);
-        const nextMark = marks[i + 1];
-        const nextFraction = nextMark
-            ? timeToFraction(nextMark.time, startTime, duration)
-            : 1;
-        if (mark.type === 'step_started') {
-            // This is the start of an execution attempt.
-            // It runs until the next event (step_retrying or step_failed) or end of span.
-            const isLastMark = i === marks.length - 1;
-            if (isLastMark) {
-                // Last event is step_started — this attempt is either still running or succeeded
-                segments.push({
-                    startFraction: markFraction,
-                    endFraction: 1,
-                    status: 'succeeded',
-                });
-            }
-            else {
-                // Attempt runs until the next event
-                const nextType = nextMark.type;
-                const attemptStatus = nextType === 'step_retrying' || nextType === 'step_failed'
-                    ? 'failed'
-                    : nextType === 'step_completed'
-                        ? 'succeeded'
-                        : 'running';
-                segments.push({
-                    startFraction: markFraction,
-                    endFraction: nextFraction,
-                    status: attemptStatus,
-                });
-            }
-        }
-        else if (mark.type === 'step_retrying') {
-            // Retry wait: from this event to the next step_started (or end)
-            segments.push({
-                startFraction: markFraction,
-                endFraction: nextFraction,
-                status: 'retrying',
-            });
-        }
-        else if (mark.type === 'step_failed') {
-            // Terminal failure: from this event to the end
-            if (markFraction < 0.999) {
-                segments.push({
-                    startFraction: markFraction,
-                    endFraction: 1,
-                    status: 'failed',
-                });
-            }
-        }
-        else if (mark.type === 'step_completed') {
-            // Terminal success: do nothing here since the preceding step_started
-            // segment already terminates at this marker.
-        }
-    }
-    return segments;
-}
-// ──────────────────────────────────────────────────────────────────────────
-// Hook segments
-// ──────────────────────────────────────────────────────────────────────────
-/**
- * Compute segments for a hook span.
- *
- * Timeline: [waiting] → [received] → [disposed]
- */
-function computeHookSegments(node) {
-    const events = node.events ? sortedEvents(node.events) : [];
-    const { startTime, duration } = node;
-    const segments = [];
-    if (duration <= 0)
-        return segments;
-    const receivedEvent = events.find((e) => e.event.name === 'hook_received');
-    const disposedEvent = events.find((e) => e.event.name === 'hook_disposed');
-    if (!receivedEvent && !disposedEvent) {
-        // Still waiting
-        segments.push({ startFraction: 0, endFraction: 1, status: 'waiting' });
-        return segments;
-    }
-    const receivedFraction = receivedEvent
-        ? timeToFraction(receivedEvent.timestamp, startTime, duration)
-        : null;
-    const disposedFraction = disposedEvent
-        ? timeToFraction(disposedEvent.timestamp, startTime, duration)
-        : null;
-    // Waiting period (before received)
-    if (receivedFraction !== null && receivedFraction > 0.001) {
-        segments.push({
-            startFraction: 0,
-            endFraction: receivedFraction,
-            status: 'waiting',
-        });
-    }
-    else if (receivedFraction === null && disposedFraction !== null) {
-        // Disposed without receiving — waiting the whole time
-        segments.push({
-            startFraction: 0,
-            endFraction: disposedFraction,
-            status: 'waiting',
-        });
-    }
-    // Received period
-    if (receivedFraction !== null) {
-        const end = disposedFraction ?? 1;
-        segments.push({
-            startFraction: receivedFraction,
-            endFraction: end,
-            status: 'received',
-        });
-    }
-    // Post-disposed (if there's remaining span after disposal)
-    if (disposedFraction !== null && disposedFraction < 0.999) {
-        segments.push({
-            startFraction: disposedFraction,
-            endFraction: 1,
-            status: 'succeeded',
-        });
-    }
-    return segments;
-}
-// ──────────────────────────────────────────────────────────────────────────
-// Sleep segments
-// ──────────────────────────────────────────────────────────────────────────
-/**
- * Compute segments for a sleep span.
- *
- * Timeline: [sleeping] → [completed]
- */
-function computeSleepSegments(node) {
-    const events = node.events ? sortedEvents(node.events) : [];
-    const { startTime, duration } = node;
-    const segments = [];
-    if (duration <= 0)
-        return segments;
-    const completedEvent = events.find((e) => e.event.name === 'wait_completed');
-    if (!completedEvent) {
-        // Still sleeping
-        segments.push({ startFraction: 0, endFraction: 1, status: 'sleeping' });
-        return segments;
-    }
-    const completedFraction = timeToFraction(completedEvent.timestamp, startTime, duration);
-    if (completedFraction > 0.001) {
-        segments.push({
-            startFraction: 0,
-            endFraction: completedFraction,
-            status: 'sleeping',
-        });
-    }
-    segments.push({
-        startFraction: completedFraction,
-        endFraction: 1,
-        status: 'succeeded',
-    });
-    return segments;
-}
-// ──────────────────────────────────────────────────────────────────────────
-// Run segments
-// ──────────────────────────────────────────────────────────────────────────
-/**
- * Compute segments for a run span.
- *
- * Timeline: [queued] → [running] → [completed/failed]
- *
- * The queued period is derived from activeStartTime (run.startedAt).
- * A synthetic run_started event is injected at that timestamp so
- * the boundary is hoverable in the trace viewer.
- */
-function computeRunSegments(node) {
-    const events = node.events ? sortedEvents(node.events) : [];
-    const { startTime, duration, activeStartTime } = node;
-    const segments = [];
-    if (duration <= 0)
-        return segments;
-    // V1 runs (specVersion 1) don't emit run lifecycle events (run_created,
-    // run_started, run_completed). Detect this by checking for the absence of
-    // run_created — it's always the first event for v2 runs and is always
-    // loaded in the first page, so its absence reliably signals a v1 run.
-    // For v1, fall back to the run entity's status from span.attributes.data.
-    const hasRunCreated = events.some((e) => e.event.name === 'run_created');
-    if (!hasRunCreated) {
-        const runData = node.span.attributes?.data;
-        const runStatus = runData?.status;
-        return computeV1RunSegments(startTime, duration, activeStartTime, runStatus);
-    }
-    const failedEvent = events.find((e) => e.event.name === 'run_failed');
-    const completedEvent = events.find((e) => e.event.name === 'run_completed');
-    // Queued period (from span start to activeStartTime)
-    let cursor = 0;
-    if (activeStartTime && activeStartTime > startTime) {
-        const queuedFraction = timeToFraction(activeStartTime, startTime, duration);
-        if (queuedFraction > 0.001) {
-            segments.push({
-                startFraction: 0,
-                endFraction: queuedFraction,
-                status: 'queued',
-            });
-            cursor = queuedFraction;
-        }
-    }
-    if (failedEvent) {
-        const failedFraction = timeToFraction(failedEvent.timestamp, startTime, duration);
-        // Running until failure
-        if (failedFraction > cursor + 0.001) {
-            segments.push({
-                startFraction: cursor,
-                endFraction: failedFraction,
-                status: 'running',
-            });
-        }
-        segments.push({
-            startFraction: failedFraction,
-            endFraction: 1,
-            status: 'failed',
-        });
-    }
-    else if (completedEvent) {
-        const completedFraction = timeToFraction(completedEvent.timestamp, startTime, duration);
-        if (completedFraction > cursor + 0.001) {
-            segments.push({
-                startFraction: cursor,
-                endFraction: completedFraction,
-                status: 'running',
-            });
-        }
-        segments.push({
-            startFraction: completedFraction,
-            endFraction: 1,
-            status: 'succeeded',
-        });
-    }
-    else {
-        // Running to completion (or terminal events haven't loaded yet)
-        segments.push({
-            startFraction: cursor,
-            endFraction: 1,
-            status: 'running',
-        });
-    }
-    return segments;
-}
-/**
- * Compute segments for a v1 run using only the run entity's status and
- * activeStartTime (derived from run.startedAt). V1 runs have no run
- * lifecycle events, so we infer the visual segments from entity fields.
- */
-function computeV1RunSegments(startTime, duration, activeStartTime, runStatus) {
-    const segments = [];
-    let cursor = 0;
-    if (activeStartTime && activeStartTime > startTime) {
-        const queuedFraction = timeToFraction(activeStartTime, startTime, duration);
-        if (queuedFraction > 0.001) {
-            segments.push({
-                startFraction: 0,
-                endFraction: queuedFraction,
-                status: 'queued',
-            });
-            cursor = queuedFraction;
-        }
-    }
-    if (runStatus === 'failed') {
-        segments.push({
-            startFraction: cursor,
-            endFraction: 1,
-            status: 'failed',
-        });
-    }
-    else if (runStatus === 'completed' || runStatus === 'cancelled') {
-        segments.push({
-            startFraction: cursor,
-            endFraction: 1,
-            status: 'succeeded',
-        });
-    }
-    else {
-        segments.push({
-            startFraction: cursor,
-            endFraction: 1,
-            status: 'running',
-        });
-    }
-    return segments;
-}
-// ──────────────────────────────────────────────────────────────────────────
-// Boundary computation
-// ──────────────────────────────────────────────────────────────────────────
-/** Event names to human-readable labels */
-const EVENT_LABELS = {
-    step_started: 'Started',
-    step_retrying: 'Retrying',
-    step_failed: 'Failed',
-    hook_created: 'Created',
-    hook_received: 'Received',
-    hook_disposed: 'Resolved',
-    wait_created: 'Sleep started',
-    wait_completed: 'Sleep completed',
-    run_completed: 'Completed',
-    run_failed: 'Run failed',
-    step_completed: 'Completed',
-};
-/**
- * Extract boundaries from a span's events. Each boundary sits at the
- * fractional position of a relevant event within the span duration.
- * Only includes events that are used as segment boundaries (not at the
- * very start or very end of the span, to avoid edge clutter).
- */
-function computeBoundaries(node, relevantEventNames) {
-    const events = node.events ? sortedEvents(node.events) : [];
-    const { startTime, duration } = node;
-    if (duration <= 0)
-        return [];
-    const boundaries = [];
-    for (const e of events) {
-        if (!relevantEventNames.includes(e.event.name))
-            continue;
-        const fraction = timeToFraction(e.timestamp, startTime, duration);
-        // Skip boundaries at the very edges (< 1% or > 99%) to avoid clutter
-        if (fraction < 0.01 || fraction > 0.99)
-            continue;
-        boundaries.push({
-            fraction,
-            label: EVENT_LABELS[e.event.name] ?? e.event.name,
-            offsetMs: e.timestamp - startTime,
-        });
-    }
-    return boundaries;
-}
-// ──────────────────────────────────────────────────────────────────────────
-// Dispatcher
-// ──────────────────────────────────────────────────────────────────────────
-/**
- * Compute the event-based segments and boundaries for a span based on its resource type.
- * Returns empty arrays for 'default' (generic OTEL) spans.
- */
-export function computeSegments(resourceType, node) {
-    switch (resourceType) {
-        case 'step':
-            return {
-                segments: computeStepSegments(node),
-                boundaries: computeBoundaries(node, [
-                    'step_started',
-                    'step_retrying',
-                    'step_failed',
-                    'step_completed',
-                ]),
-            };
-        case 'hook':
-            return {
-                segments: computeHookSegments(node),
-                boundaries: computeBoundaries(node, [
-                    'hook_created',
-                    'hook_received',
-                    'hook_disposed',
-                ]),
-            };
-        case 'sleep':
-            return {
-                segments: computeSleepSegments(node),
-                boundaries: computeBoundaries(node, ['wait_created', 'wait_completed']),
-            };
-        case 'run':
-            return {
-                segments: computeRunSegments(node),
-                boundaries: computeBoundaries(node, ['run_completed', 'run_failed']),
-            };
-        default:
-            return { segments: [], boundaries: [] };
-    }
-}
-//# sourceMappingURL=span-segments.js.map

package/dist/components/trace-viewer/components/span-segments.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"span-segments.js","sourceRoot":"","sources":["../../../../src/components/trace-viewer/components/span-segments.ts"],"names":[],"mappings":"AAmDA,6EAA6E;AAC7E,6DAA6D;AAC7D,6EAA6E;AAE7E;;;GAGG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAkC;IAC9D,MAAM,EAAE,WAAW;IACnB,OAAO,EAAE,YAAY;IACrB,MAAM,EAAE,WAAW;IACnB,QAAQ,EAAE,aAAa;IACvB,SAAS,EAAE,cAAc;IACzB,OAAO,EAAE,YAAY;IACrB,QAAQ,EAAE,aAAa;IACvB,QAAQ,EAAE,aAAa;CACxB,CAAC;AAEF,6EAA6E;AAC7E,UAAU;AACV,6EAA6E;AAE7E,SAAS,aAAa,CAAC,KAAa;IAClC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,SAAS,cAAc,CACrB,IAAY,EACZ,SAAiB,EACjB,YAAoB;IAEpB,IAAI,YAAY,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAChC,OAAO,aAAa,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC,GAAG,YAAY,CAAC,CAAC;AAC1D,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,MAAuB;IAC3C,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;AAC/D,CAAC;AAED,6EAA6E;AAC7E,gBAAgB;AAChB,6EAA6E;AAE7E;;;;;;;GAOG;AACH,SAAS,mBAAmB,CAAC,IAAc;IACzC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5D,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;IACrC,MAAM,QAAQ,GAAc,EAAE,CAAC;IAE/B,IAAI,QAAQ,IAAI,CAAC;QAAE,OAAO,QAAQ,CAAC;IAOnC,MAAM,KAAK,GAAgB,MAAM;SAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CACZ;QACE,cAAc;QACd,eAAe;QACf,aAAa;QACb,gBAAgB;KACjB,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CACzB;SACA,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAE3D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,0CAA0C;QAC1C,QAAQ,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;QACvE,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,gDAAgD;IAChD,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,aAAa,GAAG,cAAc,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC1E,IAAI,aAAa,GAAG,KAAK,EAAE,CAAC;QAC1B,QAAQ,CAAC,IAAI,CAAC;YACZ,aAAa,EAAE,CAAC;YAChB,WAAW,EAAE,aAAa;YAC1B,MAAM,EAAE,QAAQ;SACjB,CAAC,CAAC;IACL,CAAC;IAED,sDAAsD;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,YAAY,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QACpE,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9B,MAAM,YAAY,GAAG,QAAQ;YAC3B,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,CAAC;YACpD,CAAC,CAAC,CAAC,CAAC;QAEN,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;YACjC,6CAA6C;YAC7C,8EAA8E;YAC9E,MAAM,UAAU,GAAG,CAAC,KAAK,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;YAC1C,IAAI,UAAU,EAAE,CAAC;gBACf,iFAAiF;gBACjF,QAAQ,CAAC,IAAI,CAAC;oBACZ,aAAa,EAAE,YAAY;oBAC3B,WAAW,EAAE,CAAC;oBACd,MAAM,EAAE,WAAW;iBACpB,CAAC,CAAC;YACL,CAAC;iBAAM,CAAC;gBACN,oCAAoC;gBACpC,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC;gBAC/B,MAAM,aAAa,GACjB,QAAQ,KAAK,eAAe,IAAI,QAAQ,KAAK,aAAa;oBACxD,CAAC,CAAC,QAAQ;oBACV,CAAC,CAAC,QAAQ,KAAK,gBAAgB;wBAC7B,CAAC,CAAC,WAAW;wBACb,CAAC,CAAC,SAAS,CAAC;gBAClB,QAAQ,CAAC,IAAI,CAAC;oBACZ,aAAa,EAAE,YAAY;oBAC3B,WAAW,EAAE,YAAY;oBACzB,MAAM,EAAE,aAAa;iBACtB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;YACzC,gEAAgE;YAChE,QAAQ,CAAC,IAAI,CAAC;gBACZ,aAAa,EAAE,YAAY;gBAC3B,WAAW,EAAE,YAAY;gBACzB,MAAM,EAAE,UAAU;aACnB,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;YACvC,+CAA+C;YAC/C,IAAI,YAAY,GAAG,KAAK,EAAE,CAAC;gBACzB,QAAQ,CAAC,IAAI,CAAC;oBACZ,aAAa,EAAE,YAAY;oBAC3B,WAAW,EAAE,CAAC;oBACd,MAAM,EAAE,QAAQ;iBACjB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;YAC1C,qEAAqE;YACrE,6CAA6C;QAC/C,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,6EAA6E;AAC7E,gBAAgB;AAChB,6EAA6E;AAE7E;;;;GAIG;AACH,SAAS,mBAAmB,CAAC,IAAc;IACzC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5D,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;IACrC,MAAM,QAAQ,GAAc,EAAE,CAAC;IAE/B,IAAI,QAAQ,IAAI,CAAC;QAAE,OAAO,QAAQ,CAAC;IAEnC,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,eAAe,CAAC,CAAC;IAC3E,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,eAAe,CAAC,CAAC;IAE3E,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,EAAE,CAAC;QACrC,gBAAgB;QAChB,QAAQ,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;QACvE,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,MAAM,gBAAgB,GAAG,aAAa;QACpC,CAAC,CAAC,cAAc,CAAC,aAAa,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC;QAC9D,CAAC,CAAC,IAAI,CAAC;IACT,MAAM,gBAAgB,GAAG,aAAa;QACpC,CAAC,CAAC,cAAc,CAAC,aAAa,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC;QAC9D,CAAC,CAAC,IAAI,CAAC;IAET,mCAAmC;IACnC,IAAI,gBAAgB,KAAK,IAAI,IAAI,gBAAgB,GAAG,KAAK,EAAE,CAAC;QAC1D,QAAQ,CAAC,IAAI,CAAC;YACZ,aAAa,EAAE,CAAC;YAChB,WAAW,EAAE,gBAAgB;YAC7B,MAAM,EAAE,SAAS;SAClB,CAAC,CAAC;IACL,CAAC;SAAM,IAAI,gBAAgB,KAAK,IAAI,IAAI,gBAAgB,KAAK,IAAI,EAAE,CAAC;QAClE,sDAAsD;QACtD,QAAQ,CAAC,IAAI,CAAC;YACZ,aAAa,EAAE,CAAC;YAChB,WAAW,EAAE,gBAAgB;YAC7B,MAAM,EAAE,SAAS;SAClB,CAAC,CAAC;IACL,CAAC;IAED,kBAAkB;IAClB,IAAI,gBAAgB,KAAK,IAAI,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,gBAAgB,IAAI,CAAC,CAAC;QAClC,QAAQ,CAAC,IAAI,CAAC;YACZ,aAAa,EAAE,gBAAgB;YAC/B,WAAW,EAAE,GAAG;YAChB,MAAM,EAAE,UAAU;SACnB,CAAC,CAAC;IACL,CAAC;IAED,2DAA2D;IAC3D,IAAI,gBAAgB,KAAK,IAAI,IAAI,gBAAgB,GAAG,KAAK,EAAE,CAAC;QAC1D,QAAQ,CAAC,IAAI,CAAC;YACZ,aAAa,EAAE,gBAAgB;YAC/B,WAAW,EAAE,CAAC;YACd,MAAM,EAAE,WAAW;SACpB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,6EAA6E;AAC7E,iBAAiB;AACjB,6EAA6E;AAE7E;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,IAAc;IAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5D,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;IACrC,MAAM,QAAQ,GAAc,EAAE,CAAC;IAE/B,IAAI,QAAQ,IAAI,CAAC;QAAE,OAAO,QAAQ,CAAC;IAEnC,MAAM,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,gBAAgB,CAAC,CAAC;IAE7E,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,iBAAiB;QACjB,QAAQ,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;QACxE,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,MAAM,iBAAiB,GAAG,cAAc,CACtC,cAAc,CAAC,SAAS,EACxB,SAAS,EACT,QAAQ,CACT,CAAC;IAEF,IAAI,iBAAiB,GAAG,KAAK,EAAE,CAAC;QAC9B,QAAQ,CAAC,IAAI,CAAC;YACZ,aAAa,EAAE,CAAC;YAChB,WAAW,EAAE,iBAAiB;YAC9B,MAAM,EAAE,UAAU;SACnB,CAAC,CAAC;IACL,CAAC;IAED,QAAQ,CAAC,IAAI,CAAC;QACZ,aAAa,EAAE,iBAAiB;QAChC,WAAW,EAAE,CAAC;QACd,MAAM,EAAE,WAAW;KACpB,CAAC,CAAC;IAEH,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,6EAA6E;AAC7E,eAAe;AACf,6EAA6E;AAE7E;;;;;;;;GAQG;AACH,SAAS,kBAAkB,CAAC,IAAc;IACxC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5D,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,eAAe,EAAE,GAAG,IAAI,CAAC;IACtD,MAAM,QAAQ,GAAc,EAAE,CAAC;IAE/B,IAAI,QAAQ,IAAI,CAAC;QAAE,OAAO,QAAQ,CAAC;IAEnC,wEAAwE;IACxE,0EAA0E;IAC1E,sEAAsE;IACtE,sEAAsE;IACtE,0EAA0E;IAC1E,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,aAAa,CAAC,CAAC;IAEzE,IAAI,CAAC,aAAa,EAAE,CAAC;QACnB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,IAEzB,CAAC;QACd,MAAM,SAAS,GAAG,OAAO,EAAE,MAA4B,CAAC;QACxD,OAAO,oBAAoB,CACzB,SAAS,EACT,QAAQ,EACR,eAAe,EACf,SAAS,CACV,CAAC;IACJ,CAAC;IAED,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;IACtE,MAAM,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,eAAe,CAAC,CAAC;IAE5E,qDAAqD;IACrD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,eAAe,IAAI,eAAe,GAAG,SAAS,EAAE,CAAC;QACnD,MAAM,cAAc,GAAG,cAAc,CAAC,eAAe,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QAC5E,IAAI,cAAc,GAAG,KAAK,EAAE,CAAC;YAC3B,QAAQ,CAAC,IAAI,CAAC;gBACZ,aAAa,EAAE,CAAC;gBAChB,WAAW,EAAE,cAAc;gBAC3B,MAAM,EAAE,QAAQ;aACjB,CAAC,CAAC;YACH,MAAM,GAAG,cAAc,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,IAAI,WAAW,EAAE,CAAC;QAChB,MAAM,cAAc,GAAG,cAAc,CACnC,WAAW,CAAC,SAAS,EACrB,SAAS,EACT,QAAQ,CACT,CAAC;QACF,wBAAwB;QACxB,IAAI,cAAc,GAAG,MAAM,GAAG,KAAK,EAAE,CAAC;YACpC,QAAQ,CAAC,IAAI,CAAC;gBACZ,aAAa,EAAE,MAAM;gBACrB,WAAW,EAAE,cAAc;gBAC3B,MAAM,EAAE,SAAS;aAClB,CAAC,CAAC;QACL,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC;YACZ,aAAa,EAAE,cAAc;YAC7B,WAAW,EAAE,CAAC;YACd,MAAM,EAAE,QAAQ;SACjB,CAAC,CAAC;IACL,CAAC;SAAM,IAAI,cAAc,EAAE,CAAC;QAC1B,MAAM,iBAAiB,GAAG,cAAc,CACtC,cAAc,CAAC,SAAS,EACxB,SAAS,EACT,QAAQ,CACT,CAAC;QACF,IAAI,iBAAiB,GAAG,MAAM,GAAG,KAAK,EAAE,CAAC;YACvC,QAAQ,CAAC,IAAI,CAAC;gBACZ,aAAa,EAAE,MAAM;gBACrB,WAAW,EAAE,iBAAiB;gBAC9B,MAAM,EAAE,SAAS;aAClB,CAAC,CAAC;QACL,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC;YACZ,aAAa,EAAE,iBAAiB;YAChC,WAAW,EAAE,CAAC;YACd,MAAM,EAAE,WAAW;SACpB,CAAC,CAAC;IACL,CAAC;SAAM,CAAC;QACN,gEAAgE;QAChE,QAAQ,CAAC,IAAI,CAAC;YACZ,aAAa,EAAE,MAAM;YACrB,WAAW,EAAE,CAAC;YACd,MAAM,EAAE,SAAS;SAClB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAC3B,SAAiB,EACjB,QAAgB,EAChB,eAAmC,EACnC,SAA6B;IAE7B,MAAM,QAAQ,GAAc,EAAE,CAAC;IAE/B,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,eAAe,IAAI,eAAe,GAAG,SAAS,EAAE,CAAC;QACnD,MAAM,cAAc,GAAG,cAAc,CAAC,eAAe,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QAC5E,IAAI,cAAc,GAAG,KAAK,EAAE,CAAC;YAC3B,QAAQ,CAAC,IAAI,CAAC;gBACZ,aAAa,EAAE,CAAC;gBAChB,WAAW,EAAE,cAAc;gBAC3B,MAAM,EAAE,QAAQ;aACjB,CAAC,CAAC;YACH,MAAM,GAAG,cAAc,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,IAAI,SAAS,KAAK,QAAQ,EAAE,CAAC;QAC3B,QAAQ,CAAC,IAAI,CAAC;YACZ,aAAa,EAAE,MAAM;YACrB,WAAW,EAAE,CAAC;YACd,MAAM,EAAE,QAAQ;SACjB,CAAC,CAAC;IACL,CAAC;SAAM,IAAI,SAAS,KAAK,WAAW,IAAI,SAAS,KAAK,WAAW,EAAE,CAAC;QAClE,QAAQ,CAAC,IAAI,CAAC;YACZ,aAAa,EAAE,MAAM;YACrB,WAAW,EAAE,CAAC;YACd,MAAM,EAAE,WAAW;SACpB,CAAC,CAAC;IACL,CAAC;SAAM,CAAC;QACN,QAAQ,CAAC,IAAI,CAAC;YACZ,aAAa,EAAE,MAAM;YACrB,WAAW,EAAE,CAAC;YACd,MAAM,EAAE,SAAS;SAClB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAWD,6EAA6E;AAC7E,uBAAuB;AACvB,6EAA6E;AAE7E,2CAA2C;AAC3C,MAAM,YAAY,GAA2B;IAC3C,YAAY,EAAE,SAAS;IACvB,aAAa,EAAE,UAAU;IACzB,WAAW,EAAE,QAAQ;IACrB,YAAY,EAAE,SAAS;IACvB,aAAa,EAAE,UAAU;IACzB,aAAa,EAAE,UAAU;IACzB,YAAY,EAAE,eAAe;IAC7B,cAAc,EAAE,iBAAiB;IACjC,aAAa,EAAE,WAAW;IAC1B,UAAU,EAAE,YAAY;IACxB,cAAc,EAAE,WAAW;CAC5B,CAAC;AAEF;;;;;GAKG;AACH,SAAS,iBAAiB,CACxB,IAAc,EACd,kBAA4B;IAE5B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5D,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;IAErC,IAAI,QAAQ,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAE7B,MAAM,UAAU,GAAsB,EAAE,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC;YAAE,SAAS;QAEzD,MAAM,QAAQ,GAAG,cAAc,CAAC,CAAC,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QAClE,qEAAqE;QACrE,IAAI,QAAQ,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI;YAAE,SAAS;QAEjD,UAAU,CAAC,IAAI,CAAC;YACd,QAAQ;YACR,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI;YACjD,QAAQ,EAAE,CAAC,CAAC,SAAS,GAAG,SAAS;SAClC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,6EAA6E;AAC7E,aAAa;AACb,6EAA6E;AAE7E;;;GAGG;AACH,MAAM,UAAU,eAAe,CAC7B,YAA0B,EAC1B,IAAc;IAEd,QAAQ,YAAY,EAAE,CAAC;QACrB,KAAK,MAAM;YACT,OAAO;gBACL,QAAQ,EAAE,mBAAmB,CAAC,IAAI,CAAC;gBACnC,UAAU,EAAE,iBAAiB,CAAC,IAAI,EAAE;oBAClC,cAAc;oBACd,eAAe;oBACf,aAAa;oBACb,gBAAgB;iBACjB,CAAC;aACH,CAAC;QACJ,KAAK,MAAM;YACT,OAAO;gBACL,QAAQ,EAAE,mBAAmB,CAAC,IAAI,CAAC;gBACnC,UAAU,EAAE,iBAAiB,CAAC,IAAI,EAAE;oBAClC,cAAc;oBACd,eAAe;oBACf,eAAe;iBAChB,CAAC;aACH,CAAC;QACJ,KAAK,OAAO;YACV,OAAO;gBACL,QAAQ,EAAE,oBAAoB,CAAC,IAAI,CAAC;gBACpC,UAAU,EAAE,iBAAiB,CAAC,IAAI,EAAE,CAAC,cAAc,EAAE,gBAAgB,CAAC,CAAC;aACxE,CAAC;QACJ,KAAK,KAAK;YACR,OAAO;gBACL,QAAQ,EAAE,kBAAkB,CAAC,IAAI,CAAC;gBAClC,UAAU,EAAE,iBAAiB,CAAC,IAAI,EAAE,CAAC,eAAe,EAAE,YAAY,CAAC,CAAC;aACrE,CAAC;QACJ;YACE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IAC5C,CAAC;AACH,CAAC","sourcesContent":["import type { SpanNode, SpanNodeEvent } from '../types';\nimport type { ResourceType } from './span-strategies';\n\n// ──────────────────────────────────────────────────────────────────────────\n// Segment types\n// ──────────────────────────────────────────────────────────────────────────\n\n/**\n * Visual status of a segment within a span bar.\n *\n * - queued:     Waiting to start (hatched pattern)\n * - running:    Actively executing (solid blue)\n * - failed:     Attempt that ended in failure (soft red)\n * - retrying:   Waiting between retry attempts (hatched pattern)\n * - succeeded:  Final successful attempt (soft green)\n * - waiting:    Passive waiting, e.g. hook waiting for payload (hatched pattern)\n * - sleeping:   Sleep in progress (soft amber)\n * - received:   Hook received a payload (soft blue)\n */\nexport type SegmentStatus =\n  | 'queued'\n  | 'running'\n  | 'failed'\n  | 'retrying'\n  | 'succeeded'\n  | 'waiting'\n  | 'sleeping'\n  | 'received';\n\nexport interface Segment {\n  /** Fraction of span width where this segment starts (0–1) */\n  startFraction: number;\n  /** Fraction of span width where this segment ends (0–1) */\n  endFraction: number;\n  /** Visual status controlling color/pattern */\n  status: SegmentStatus;\n}\n\n/**\n * A boundary between two segments, representing an event that caused\n * a transition. Rendered as a hoverable divider with a tooltip.\n */\nexport interface SegmentBoundary {\n  /** Fractional position along the span (0–1) */\n  fraction: number;\n  /** Display label for the tooltip (e.g. \"step_started\") */\n  label: string;\n  /** Formatted timestamp relative to span start */\n  offsetMs: number;\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// CSS class mapping (segment status → module CSS class name)\n// ──────────────────────────────────────────────────────────────────────────\n\n/**\n * Maps a SegmentStatus to the CSS module class name to use.\n * These class names must exist in trace-viewer.module.css.\n */\nexport const SEGMENT_CLASS_MAP: Record<SegmentStatus, string> = {\n  queued: 'segQueued',\n  running: 'segRunning',\n  failed: 'segFailed',\n  retrying: 'segRetrying',\n  succeeded: 'segSucceeded',\n  waiting: 'segWaiting',\n  sleeping: 'segSleeping',\n  received: 'segReceived',\n};\n\n// ──────────────────────────────────────────────────────────────────────────\n// Helpers\n// ──────────────────────────────────────────────────────────────────────────\n\nfunction clampFraction(value: number): number {\n  return Math.max(0, Math.min(1, value));\n}\n\nfunction timeToFraction(\n  time: number,\n  spanStart: number,\n  spanDuration: number\n): number {\n  if (spanDuration <= 0) return 0;\n  return clampFraction((time - spanStart) / spanDuration);\n}\n\n/**\n * Sort events by timestamp ascending.\n */\nfunction sortedEvents(events: SpanNodeEvent[]): SpanNodeEvent[] {\n  return [...events].sort((a, b) => a.timestamp - b.timestamp);\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Step segments\n// ──────────────────────────────────────────────────────────────────────────\n\n/**\n * Compute segments for a step span.\n *\n * Timeline: [queued] → [attempt₁ (fail)] → [retry wait] → [attempt₂ (fail)] → ... → [attemptₙ (success)]\n *\n * Events used: step_started, step_retrying, step_failed, step_completed\n * The final segment is 'succeeded' if no trailing step_retrying/step_failed.\n */\nfunction computeStepSegments(node: SpanNode): Segment[] {\n  const events = node.events ? sortedEvents(node.events) : [];\n  const { startTime, duration } = node;\n  const segments: Segment[] = [];\n\n  if (duration <= 0) return segments;\n\n  // Build a timeline of event boundaries\n  interface EventMark {\n    time: number;\n    type: string;\n  }\n  const marks: EventMark[] = events\n    .filter((e) =>\n      [\n        'step_started',\n        'step_retrying',\n        'step_failed',\n        'step_completed',\n      ].includes(e.event.name)\n    )\n    .map((e) => ({ time: e.timestamp, type: e.event.name }));\n\n  if (marks.length === 0) {\n    // No events — show entire span as running\n    segments.push({ startFraction: 0, endFraction: 1, status: 'running' });\n    return segments;\n  }\n\n  // Queued period: from span start to first event\n  const firstMark = marks[0];\n  const firstFraction = timeToFraction(firstMark.time, startTime, duration);\n  if (firstFraction > 0.001) {\n    segments.push({\n      startFraction: 0,\n      endFraction: firstFraction,\n      status: 'queued',\n    });\n  }\n\n  // Walk through events to build attempt/retry segments\n  for (let i = 0; i < marks.length; i++) {\n    const mark = marks[i];\n    const markFraction = timeToFraction(mark.time, startTime, duration);\n    const nextMark = marks[i + 1];\n    const nextFraction = nextMark\n      ? timeToFraction(nextMark.time, startTime, duration)\n      : 1;\n\n    if (mark.type === 'step_started') {\n      // This is the start of an execution attempt.\n      // It runs until the next event (step_retrying or step_failed) or end of span.\n      const isLastMark = i === marks.length - 1;\n      if (isLastMark) {\n        // Last event is step_started — this attempt is either still running or succeeded\n        segments.push({\n          startFraction: markFraction,\n          endFraction: 1,\n          status: 'succeeded',\n        });\n      } else {\n        // Attempt runs until the next event\n        const nextType = nextMark.type;\n        const attemptStatus: SegmentStatus =\n          nextType === 'step_retrying' || nextType === 'step_failed'\n            ? 'failed'\n            : nextType === 'step_completed'\n              ? 'succeeded'\n              : 'running';\n        segments.push({\n          startFraction: markFraction,\n          endFraction: nextFraction,\n          status: attemptStatus,\n        });\n      }\n    } else if (mark.type === 'step_retrying') {\n      // Retry wait: from this event to the next step_started (or end)\n      segments.push({\n        startFraction: markFraction,\n        endFraction: nextFraction,\n        status: 'retrying',\n      });\n    } else if (mark.type === 'step_failed') {\n      // Terminal failure: from this event to the end\n      if (markFraction < 0.999) {\n        segments.push({\n          startFraction: markFraction,\n          endFraction: 1,\n          status: 'failed',\n        });\n      }\n    } else if (mark.type === 'step_completed') {\n      // Terminal success: do nothing here since the preceding step_started\n      // segment already terminates at this marker.\n    }\n  }\n\n  return segments;\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Hook segments\n// ──────────────────────────────────────────────────────────────────────────\n\n/**\n * Compute segments for a hook span.\n *\n * Timeline: [waiting] → [received] → [disposed]\n */\nfunction computeHookSegments(node: SpanNode): Segment[] {\n  const events = node.events ? sortedEvents(node.events) : [];\n  const { startTime, duration } = node;\n  const segments: Segment[] = [];\n\n  if (duration <= 0) return segments;\n\n  const receivedEvent = events.find((e) => e.event.name === 'hook_received');\n  const disposedEvent = events.find((e) => e.event.name === 'hook_disposed');\n\n  if (!receivedEvent && !disposedEvent) {\n    // Still waiting\n    segments.push({ startFraction: 0, endFraction: 1, status: 'waiting' });\n    return segments;\n  }\n\n  const receivedFraction = receivedEvent\n    ? timeToFraction(receivedEvent.timestamp, startTime, duration)\n    : null;\n  const disposedFraction = disposedEvent\n    ? timeToFraction(disposedEvent.timestamp, startTime, duration)\n    : null;\n\n  // Waiting period (before received)\n  if (receivedFraction !== null && receivedFraction > 0.001) {\n    segments.push({\n      startFraction: 0,\n      endFraction: receivedFraction,\n      status: 'waiting',\n    });\n  } else if (receivedFraction === null && disposedFraction !== null) {\n    // Disposed without receiving — waiting the whole time\n    segments.push({\n      startFraction: 0,\n      endFraction: disposedFraction,\n      status: 'waiting',\n    });\n  }\n\n  // Received period\n  if (receivedFraction !== null) {\n    const end = disposedFraction ?? 1;\n    segments.push({\n      startFraction: receivedFraction,\n      endFraction: end,\n      status: 'received',\n    });\n  }\n\n  // Post-disposed (if there's remaining span after disposal)\n  if (disposedFraction !== null && disposedFraction < 0.999) {\n    segments.push({\n      startFraction: disposedFraction,\n      endFraction: 1,\n      status: 'succeeded',\n    });\n  }\n\n  return segments;\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Sleep segments\n// ──────────────────────────────────────────────────────────────────────────\n\n/**\n * Compute segments for a sleep span.\n *\n * Timeline: [sleeping] → [completed]\n */\nfunction computeSleepSegments(node: SpanNode): Segment[] {\n  const events = node.events ? sortedEvents(node.events) : [];\n  const { startTime, duration } = node;\n  const segments: Segment[] = [];\n\n  if (duration <= 0) return segments;\n\n  const completedEvent = events.find((e) => e.event.name === 'wait_completed');\n\n  if (!completedEvent) {\n    // Still sleeping\n    segments.push({ startFraction: 0, endFraction: 1, status: 'sleeping' });\n    return segments;\n  }\n\n  const completedFraction = timeToFraction(\n    completedEvent.timestamp,\n    startTime,\n    duration\n  );\n\n  if (completedFraction > 0.001) {\n    segments.push({\n      startFraction: 0,\n      endFraction: completedFraction,\n      status: 'sleeping',\n    });\n  }\n\n  segments.push({\n    startFraction: completedFraction,\n    endFraction: 1,\n    status: 'succeeded',\n  });\n\n  return segments;\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Run segments\n// ──────────────────────────────────────────────────────────────────────────\n\n/**\n * Compute segments for a run span.\n *\n * Timeline: [queued] → [running] → [completed/failed]\n *\n * The queued period is derived from activeStartTime (run.startedAt).\n * A synthetic run_started event is injected at that timestamp so\n * the boundary is hoverable in the trace viewer.\n */\nfunction computeRunSegments(node: SpanNode): Segment[] {\n  const events = node.events ? sortedEvents(node.events) : [];\n  const { startTime, duration, activeStartTime } = node;\n  const segments: Segment[] = [];\n\n  if (duration <= 0) return segments;\n\n  // V1 runs (specVersion 1) don't emit run lifecycle events (run_created,\n  // run_started, run_completed). Detect this by checking for the absence of\n  // run_created — it's always the first event for v2 runs and is always\n  // loaded in the first page, so its absence reliably signals a v1 run.\n  // For v1, fall back to the run entity's status from span.attributes.data.\n  const hasRunCreated = events.some((e) => e.event.name === 'run_created');\n\n  if (!hasRunCreated) {\n    const runData = node.span.attributes?.data as\n      | Record<string, unknown>\n      | undefined;\n    const runStatus = runData?.status as string | undefined;\n    return computeV1RunSegments(\n      startTime,\n      duration,\n      activeStartTime,\n      runStatus\n    );\n  }\n\n  const failedEvent = events.find((e) => e.event.name === 'run_failed');\n  const completedEvent = events.find((e) => e.event.name === 'run_completed');\n\n  // Queued period (from span start to activeStartTime)\n  let cursor = 0;\n  if (activeStartTime && activeStartTime > startTime) {\n    const queuedFraction = timeToFraction(activeStartTime, startTime, duration);\n    if (queuedFraction > 0.001) {\n      segments.push({\n        startFraction: 0,\n        endFraction: queuedFraction,\n        status: 'queued',\n      });\n      cursor = queuedFraction;\n    }\n  }\n\n  if (failedEvent) {\n    const failedFraction = timeToFraction(\n      failedEvent.timestamp,\n      startTime,\n      duration\n    );\n    // Running until failure\n    if (failedFraction > cursor + 0.001) {\n      segments.push({\n        startFraction: cursor,\n        endFraction: failedFraction,\n        status: 'running',\n      });\n    }\n    segments.push({\n      startFraction: failedFraction,\n      endFraction: 1,\n      status: 'failed',\n    });\n  } else if (completedEvent) {\n    const completedFraction = timeToFraction(\n      completedEvent.timestamp,\n      startTime,\n      duration\n    );\n    if (completedFraction > cursor + 0.001) {\n      segments.push({\n        startFraction: cursor,\n        endFraction: completedFraction,\n        status: 'running',\n      });\n    }\n    segments.push({\n      startFraction: completedFraction,\n      endFraction: 1,\n      status: 'succeeded',\n    });\n  } else {\n    // Running to completion (or terminal events haven't loaded yet)\n    segments.push({\n      startFraction: cursor,\n      endFraction: 1,\n      status: 'running',\n    });\n  }\n\n  return segments;\n}\n\n/**\n * Compute segments for a v1 run using only the run entity's status and\n * activeStartTime (derived from run.startedAt). V1 runs have no run\n * lifecycle events, so we infer the visual segments from entity fields.\n */\nfunction computeV1RunSegments(\n  startTime: number,\n  duration: number,\n  activeStartTime: number | undefined,\n  runStatus: string | undefined\n): Segment[] {\n  const segments: Segment[] = [];\n\n  let cursor = 0;\n  if (activeStartTime && activeStartTime > startTime) {\n    const queuedFraction = timeToFraction(activeStartTime, startTime, duration);\n    if (queuedFraction > 0.001) {\n      segments.push({\n        startFraction: 0,\n        endFraction: queuedFraction,\n        status: 'queued',\n      });\n      cursor = queuedFraction;\n    }\n  }\n\n  if (runStatus === 'failed') {\n    segments.push({\n      startFraction: cursor,\n      endFraction: 1,\n      status: 'failed',\n    });\n  } else if (runStatus === 'completed' || runStatus === 'cancelled') {\n    segments.push({\n      startFraction: cursor,\n      endFraction: 1,\n      status: 'succeeded',\n    });\n  } else {\n    segments.push({\n      startFraction: cursor,\n      endFraction: 1,\n      status: 'running',\n    });\n  }\n\n  return segments;\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Dispatcher\n// ──────────────────────────────────────────────────────────────────────────\n\nexport interface SegmentResult {\n  segments: Segment[];\n  boundaries: SegmentBoundary[];\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Boundary computation\n// ──────────────────────────────────────────────────────────────────────────\n\n/** Event names to human-readable labels */\nconst EVENT_LABELS: Record<string, string> = {\n  step_started: 'Started',\n  step_retrying: 'Retrying',\n  step_failed: 'Failed',\n  hook_created: 'Created',\n  hook_received: 'Received',\n  hook_disposed: 'Resolved',\n  wait_created: 'Sleep started',\n  wait_completed: 'Sleep completed',\n  run_completed: 'Completed',\n  run_failed: 'Run failed',\n  step_completed: 'Completed',\n};\n\n/**\n * Extract boundaries from a span's events. Each boundary sits at the\n * fractional position of a relevant event within the span duration.\n * Only includes events that are used as segment boundaries (not at the\n * very start or very end of the span, to avoid edge clutter).\n */\nfunction computeBoundaries(\n  node: SpanNode,\n  relevantEventNames: string[]\n): SegmentBoundary[] {\n  const events = node.events ? sortedEvents(node.events) : [];\n  const { startTime, duration } = node;\n\n  if (duration <= 0) return [];\n\n  const boundaries: SegmentBoundary[] = [];\n  for (const e of events) {\n    if (!relevantEventNames.includes(e.event.name)) continue;\n\n    const fraction = timeToFraction(e.timestamp, startTime, duration);\n    // Skip boundaries at the very edges (< 1% or > 99%) to avoid clutter\n    if (fraction < 0.01 || fraction > 0.99) continue;\n\n    boundaries.push({\n      fraction,\n      label: EVENT_LABELS[e.event.name] ?? e.event.name,\n      offsetMs: e.timestamp - startTime,\n    });\n  }\n\n  return boundaries;\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Dispatcher\n// ──────────────────────────────────────────────────────────────────────────\n\n/**\n * Compute the event-based segments and boundaries for a span based on its resource type.\n * Returns empty arrays for 'default' (generic OTEL) spans.\n */\nexport function computeSegments(\n  resourceType: ResourceType,\n  node: SpanNode\n): SegmentResult {\n  switch (resourceType) {\n    case 'step':\n      return {\n        segments: computeStepSegments(node),\n        boundaries: computeBoundaries(node, [\n          'step_started',\n          'step_retrying',\n          'step_failed',\n          'step_completed',\n        ]),\n      };\n    case 'hook':\n      return {\n        segments: computeHookSegments(node),\n        boundaries: computeBoundaries(node, [\n          'hook_created',\n          'hook_received',\n          'hook_disposed',\n        ]),\n      };\n    case 'sleep':\n      return {\n        segments: computeSleepSegments(node),\n        boundaries: computeBoundaries(node, ['wait_created', 'wait_completed']),\n      };\n    case 'run':\n      return {\n        segments: computeRunSegments(node),\n        boundaries: computeBoundaries(node, ['run_completed', 'run_failed']),\n      };\n    default:\n      return { segments: [], boundaries: [] };\n  }\n}\n"]}

package/dist/components/trace-viewer/components/span-strategies.d.ts

@@ -1,46 +0,0 @@
-import type { RefObject } from 'react';
-import type { RootNode, ScrollSnapshot, VisibleSpan } from '../types';
-/**
- * The resource type of a workflow span, read from span.attributes.resource.
- * Falls back to 'default' for non-workflow (generic OTEL) spans.
- */
-export type ResourceType = 'run' | 'step' | 'hook' | 'sleep' | 'default';
-/**
- * Layout result computed by a span strategy. Controls how the span
- * is sized and positioned in the timeline.
- */
-export interface SpanLayout {
-    /** The rendered width in pixels */
-    width: number;
-    /** The actual duration-based width (before min-width clamping) */
-    actualWidth: number;
-    /** The rendered height in pixels */
-    height: number;
-    /** The y position in pixels */
-    top: number;
-    /** The x position in pixels (from left) */
-    left: number;
-    /** Whether the span is considered "small" (< 64px actual width) */
-    isSmall: boolean;
-    /** Whether the span is considered "huge" (>= 500px actual width) */
-    isHuge: boolean;
-    /** Whether the span is currently hovered (with hover eligibility) */
-    isHovered: boolean;
-    /** Whether the span is expanded (hovered or selected) — controls sizing */
-    isExpanded: boolean;
-    /** Whether the span is near the right side of the visible area */
-    isNearRightSide: boolean;
-}
-/**
- * Reads the resource type from a span's attributes.
- */
-export declare function getResourceType(node: VisibleSpan): ResourceType;
-export declare function getRunLayout(node: VisibleSpan, root: RootNode, scale: number, scrollSnapshotRef: RefObject<ScrollSnapshot | undefined>): SpanLayout;
-export declare function getStepLayout(node: VisibleSpan, root: RootNode, scale: number, scrollSnapshotRef: RefObject<ScrollSnapshot | undefined>): SpanLayout;
-export declare function getHookLayout(node: VisibleSpan, root: RootNode, scale: number, scrollSnapshotRef: RefObject<ScrollSnapshot | undefined>): SpanLayout;
-export declare function getSleepLayout(node: VisibleSpan, root: RootNode, scale: number, scrollSnapshotRef: RefObject<ScrollSnapshot | undefined>): SpanLayout;
-/**
- * Computes the layout for a span based on its resource type.
- */
-export declare function getSpanLayout(resourceType: ResourceType, node: VisibleSpan, root: RootNode, scale: number, scrollSnapshotRef: RefObject<ScrollSnapshot | undefined>): SpanLayout;
-//# sourceMappingURL=span-strategies.d.ts.map

package/dist/components/trace-viewer/components/span-strategies.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"span-strategies.d.ts","sourceRoot":"","sources":["../../../../src/components/trace-viewer/components/span-strategies.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,OAAO,CAAC;AACvC,OAAO,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AAGtE;;;GAGG;AACH,MAAM,MAAM,YAAY,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,SAAS,CAAC;AAKzE;;;GAGG;AACH,MAAM,WAAW,UAAU;IACzB,mCAAmC;IACnC,KAAK,EAAE,MAAM,CAAC;IACd,kEAAkE;IAClE,WAAW,EAAE,MAAM,CAAC;IACpB,oCAAoC;IACpC,MAAM,EAAE,MAAM,CAAC;IACf,+BAA+B;IAC/B,GAAG,EAAE,MAAM,CAAC;IACZ,2CAA2C;IAC3C,IAAI,EAAE,MAAM,CAAC;IACb,mEAAmE;IACnE,OAAO,EAAE,OAAO,CAAC;IACjB,oEAAoE;IACpE,MAAM,EAAE,OAAO,CAAC;IAChB,qEAAqE;IACrE,SAAS,EAAE,OAAO,CAAC;IACnB,2EAA2E;IAC3E,UAAU,EAAE,OAAO,CAAC;IACpB,kEAAkE;IAClE,eAAe,EAAE,OAAO,CAAC;CAC1B;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,WAAW,GAAG,YAAY,CAW/D;AAwFD,wBAAgB,YAAY,CAC1B,IAAI,EAAE,WAAW,EACjB,IAAI,EAAE,QAAQ,EACd,KAAK,EAAE,MAAM,EACb,iBAAiB,EAAE,SAAS,CAAC,cAAc,GAAG,SAAS,CAAC,GACvD,UAAU,CAEZ;AAED,wBAAgB,aAAa,CAC3B,IAAI,EAAE,WAAW,EACjB,IAAI,EAAE,QAAQ,EACd,KAAK,EAAE,MAAM,EACb,iBAAiB,EAAE,SAAS,CAAC,cAAc,GAAG,SAAS,CAAC,GACvD,UAAU,CAEZ;AAED,wBAAgB,aAAa,CAC3B,IAAI,EAAE,WAAW,EACjB,IAAI,EAAE,QAAQ,EACd,KAAK,EAAE,MAAM,EACb,iBAAiB,EAAE,SAAS,CAAC,cAAc,GAAG,SAAS,CAAC,GACvD,UAAU,CAEZ;AAED,wBAAgB,cAAc,CAC5B,IAAI,EAAE,WAAW,EACjB,IAAI,EAAE,QAAQ,EACd,KAAK,EAAE,MAAM,EACb,iBAAiB,EAAE,SAAS,CAAC,cAAc,GAAG,SAAS,CAAC,GACvD,UAAU,CAEZ;AAMD;;GAEG;AACH,wBAAgB,aAAa,CAC3B,YAAY,EAAE,YAAY,EAC1B,IAAI,EAAE,WAAW,EACjB,IAAI,EAAE,QAAQ,EACd,KAAK,EAAE,MAAM,EACb,iBAAiB,EAAE,SAAS,CAAC,cAAc,GAAG,SAAS,CAAC,GACvD,UAAU,CAaZ"}