nx
Nx
GitHub
Nx
Workspace
GitHub
CI Pipeline Executions
Filtered
Runs
Demo
Insights
Compare tasks
Analytics
Sign in
Toggle sidebar
Overview
⌘K
Nx
Loading workspace stats
Loading workspace insights...
Statistics interval
7 days
30 days
Latest CI Pipeline Executions
Status
Fix filter
Filter
Fuzzy
Filter range
Sort by
Sort by
Start time
Sort ascending
Sort descending
Succeeded
36481
f893f115 docs(misc): document NX_INVOCATION_ANCESTOR_PIDS Co-authored-by: AgentEnder <AgentEnder@users.noreply.github.com>
by nx-cloud[bot]
n
Failed
36481
Flaky task
→
f893f115 docs(misc): document NX_INVOCATION_ANCESTOR_PIDS Co-authored-by: AgentEnder <AgentEnder@users.noreply.github.com>
by nx-cloud[bot]
n
Failed
36481
Environment issue
→
bf151511 fix(core): claim continuous tasks before starting them `startContinuousTask` checked `getRunningTasks()` to decide whether another Nx process already owns a continuous task, but only wrote its own claim via `addRunningTask()` after forking the child. A sibling process asking the same question inside that window is told the task is not running and starts a duplicate of it — two `serve-static` servers racing for the same port. Move the claim to immediately after the check so the `SharedRunningTask` path wins reliably. With six siblings this makes the shared wait deterministic instead of dependent on fork timing. This is load-bearing alongside the ancestry fix for recursive task invocation: once siblings are allowed past the loop detector, this claim is what keeps them sharing one server instead of starting several.
by Craigory C...
C
Failed
36481
Fix applied
→
bf151511 fix(core): claim continuous tasks before starting them `startContinuousTask` checked `getRunningTasks()` to decide whether another Nx process already owns a continuous task, but only wrote its own claim via `addRunningTask()` after forking the child. A sibling process asking the same question inside that window is told the task is not running and starts a duplicate of it — two `serve-static` servers racing for the same port. Move the claim to immediately after the check so the `SharedRunningTask` path wins reliably. With six siblings this makes the shared wait deterministic instead of dependent on fork timing. This is load-bearing alongside the ancestry fix for recursive task invocation: once siblings are allowed past the loop detector, this claim is what keeps them sharing one server instead of starting several.
by Craigory C...
C
Previous page
Previous
Next
Next page