Public report of santifer/career-ops, published 24 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 24 October 2026, 14:28 UTC · Survey ID cd_5c7a4f9edc764679a816caa540a9754f
santifer/career-ops
Measured 24 October 2026, 14:09 UTC, at code version 1eb5ac3
Regression: 1 dimension fell since the last survey
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Up 1 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A large codebase: 199,581 lines of product code in 4 projects, tests not counted · Estimated rebuild effort: about 2.7 person-years · Weakest lens: Code Health, 45
Findings by how serious they are
84 critical1884 serious111 minor
5 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
24 October 2026, 14:09 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
87of 90 dimensions measured by tools. The other 3 are advisory notes from an AI model, which explain the code but don't count towards the score.
2066of 2079 findings point to an exact file and line, so you can open each one in the code. The other 13 concern the repository as a whole, such as missing documentation.
90dimensions across 7 lenses, read from 199,581 lines of product code in 4 projects.
santifer/career-ops scores 52 out of 100 and is rated Adequate, while five of its seven lenses score higher still: Maturity at 82, rated Strong, and Architecture at 79, Security and Compliance at 77, Performance at 66 and Production Readiness at 58, all rated Adequate.
The score is lower than those five because the weakest lens counts most, and here that is Code Health, which scores 45 and is rated Weak. Its Type Safety dimension scores 1.3 out of 10, and until that reaches 4, Code Health can't be rated higher than Adequate. The first actions are to resolve the 1 Leaked secret finding(s) in Secret Scanning and to migrate the remaining .js/.jsx files to TypeScript, and if Code Health rose to 70, the score would rise from 52 to about 58.
84 findings are critical: 43 in Static Analysis (SAST), 36 in Forms & labels, two in Circular Imports, one in IaC & Container Security, one in Keyboard semantics and one in Secret Scanning.
Watchdog couldn't measure 5 dimensions in this code, among them Internal API Consistency, Navigability and Structured logging, so they are left out of the score. The product code is 199,581 lines, which would take an estimated 2.7 person-years, around €390,000, to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Code Health rose from 45 to 70, the lowest score rated Strong, the score would rise from 52 to about 58.
Code composition: what the lines of code are
Product code 50%Tests 50%
New since the last survey: 641 findings
These 641 critical or serious findings weren't in the previous survey, on 10 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 1036 findings
These 1036 critical or serious findings were in the previous survey, on 10 October 2026, and are gone from this one. The first 100 are listed here.
Cyclomatic Complexity · main (cyclomatic 174) REDACTED
€130,000 to €640,000, for 2,137 to 6,778 hours of work, about 2.7 person-years for 1 to 6 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.7 at a score of 52. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Large: 199,581 lines of product code
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED.
Raises the score by about 2 points · Low effort · Secret Scanning
2
Migrate the remaining .js/.jsx files to TypeScript.
Raises the score by about 4 points · Medium effort · Type Safety
3
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
Raises the score by about 2 points · Medium effort · Large Files
Diagnosis: what the measurements show together
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Files that change often carry extra risk · Combined risk
4 files are changed often and are hard to read, which makes them the likeliest places for a mistake. They also have under half their code tested, or were written almost entirely by one person, so a mistake there is less likely to be caught, or only one person knows the code well enough to avoid it. A change to these files therefore carries more risk than the overall score suggests.
Based on: Churn × Complexity Hotspots (181 files) · Code Coverage (14 files under half tested) · Bus Factor (0 files written almost entirely by one person) · The files: doctor.mjs, liveness-browser.mjs and session.ts
What to do: Add tests to these files and have a second person review every change to them, starting with doctor.mjs, liveness-browser.mjs and session.ts.
Where the investment is most exposed · Value at risk
This code would cost about €390,000 to build again, about 2.7 person-years of work. Its weakest lens is Code Health, at 45 (Weak). Code Health is about how easy the code is to read and change safely, and code that is hard to read is slow and risky to change, so every future change costs more than it should. Because the weakest lens counts most in the score, work on Code Health also moves the score most.
Based on: the rebuild estimate · the Code Health grade · how much each lens counts
What to do: Start with the Code Health actions in Top priorities.
If you do one thing first · First action
Resolve the 1 Leaked secret finding(s) in Secret Scanning. Of all the actions in this report, it raises the score most for the work it takes: about 2 points for low effort, because it clears the 1 Secret Scanning findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.0 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 5% to 11% on every change. The history of the code shows how much it changes: about 479,993 lines over the last 90 days, which is about 1,946,638 lines a year. At that pace, the extra work comes to an estimated 244.8 to 1468.6 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
170 modules, with 14 dependencies between them. Every module uses only modules listed above it, so there are no loops.
The table shows the 40 modules with the most connections; 130 more are left out to keep it readable.
Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
6 pairs of types, where a type in github.com/santifer/career-ops/dashboard/internal/data uses a type in github.com/santifer/career-ops/dashboard/internal/model.
github.com/santifer/career-ops/dashboard/internal/data uses github.com/santifer/career-ops/dashboard/internal/model, so a change to github.com/santifer/career-ops/dashboard/internal/model can break github.com/santifer/career-ops/dashboard/internal/data, while a change to github.com/santifer/career-ops/dashboard/internal/data can't break github.com/santifer/career-ops/dashboard/internal/model.
Position
Below the diagonal: github.com/santifer/career-ops/dashboard/internal/data uses a module listed above it, which is the healthy direction.
16 pairs of types, where a type in github.com/santifer/career-ops/dashboard/internal/ui/screens uses a type in github.com/santifer/career-ops/dashboard/internal/model.
github.com/santifer/career-ops/dashboard/internal/ui/screens uses github.com/santifer/career-ops/dashboard/internal/model, so a change to github.com/santifer/career-ops/dashboard/internal/model can break github.com/santifer/career-ops/dashboard/internal/ui/screens, while a change to github.com/santifer/career-ops/dashboard/internal/ui/screens can't break github.com/santifer/career-ops/dashboard/internal/model.
Position
Below the diagonal: github.com/santifer/career-ops/dashboard/internal/ui/screens uses a module listed above it, which is the healthy direction.
5 pairs of types, where a type in github.com/santifer/career-ops/dashboard/internal/ui/screens uses a type in github.com/santifer/career-ops/dashboard/internal/theme.
github.com/santifer/career-ops/dashboard/internal/ui/screens uses github.com/santifer/career-ops/dashboard/internal/theme, so a change to github.com/santifer/career-ops/dashboard/internal/theme can break github.com/santifer/career-ops/dashboard/internal/ui/screens, while a change to github.com/santifer/career-ops/dashboard/internal/ui/screens can't break github.com/santifer/career-ops/dashboard/internal/theme.
Position
Below the diagonal: github.com/santifer/career-ops/dashboard/internal/ui/screens uses a module listed above it, which is the healthy direction.
web.src.app.actions uses web.src.app.actions.registry, so a change to web.src.app.actions.registry can break web.src.app.actions, while a change to web.src.app.actions can't break web.src.app.actions.registry.
Position
Below the diagonal: web.src.app.actions uses a module listed above it, which is the healthy direction.
web.src.components uses web.src.components.theme-provider, so a change to web.src.components.theme-provider can break web.src.components, while a change to web.src.components can't break web.src.components.theme-provider.
Position
Below the diagonal: web.src.components uses a module listed above it, which is the healthy direction.
web.src.lib uses web.src.components.explore.schedule-job-action, so a change to web.src.components.explore.schedule-job-action can break web.src.lib, while a change to web.src.lib can't break web.src.components.explore.schedule-job-action.
Position
Below the diagonal: web.src.lib uses a module listed above it, which is the healthy direction.
web.src.lib uses web.src.lib.career-ops, so a change to web.src.lib.career-ops can break web.src.lib, while a change to web.src.lib can't break web.src.lib.career-ops.
Position
Below the diagonal: web.src.lib uses a module listed above it, which is the healthy direction.
web.src.lib uses web.src.lib.documents, so a change to web.src.lib.documents can break web.src.lib, while a change to web.src.lib can't break web.src.lib.documents.
Position
Below the diagonal: web.src.lib uses a module listed above it, which is the healthy direction.
web.src.lib uses web.src.lib.scheduled-jobs, so a change to web.src.lib.scheduled-jobs can break web.src.lib, while a change to web.src.lib can't break web.src.lib.scheduled-jobs.
Position
Below the diagonal: web.src.lib uses a module listed above it, which is the healthy direction.
web.src.lib.cv-studio uses web.src.lib.cv-studio.rewrite-run, so a change to web.src.lib.cv-studio.rewrite-run can break web.src.lib.cv-studio, while a change to web.src.lib.cv-studio can't break web.src.lib.cv-studio.rewrite-run.
Position
Below the diagonal: web.src.lib.cv-studio uses a module listed above it, which is the healthy direction.
web.src.lib.cv-studio uses web.src.lib.cv-studio.server, so a change to web.src.lib.cv-studio.server can break web.src.lib.cv-studio, while a change to web.src.lib.cv-studio can't break web.src.lib.cv-studio.server.
Position
Below the diagonal: web.src.lib.cv-studio uses a module listed above it, which is the healthy direction.
github.com/santifer/career-ops/dashboard uses github.com/santifer/career-ops/dashboard/internal/model, so a change to github.com/santifer/career-ops/dashboard/internal/model can break github.com/santifer/career-ops/dashboard, while a change to github.com/santifer/career-ops/dashboard can't break github.com/santifer/career-ops/dashboard/internal/model.
Position
Below the diagonal: github.com/santifer/career-ops/dashboard uses a module listed above it, which is the healthy direction.
github.com/santifer/career-ops/dashboard uses github.com/santifer/career-ops/dashboard/internal/theme, so a change to github.com/santifer/career-ops/dashboard/internal/theme can break github.com/santifer/career-ops/dashboard, while a change to github.com/santifer/career-ops/dashboard can't break github.com/santifer/career-ops/dashboard/internal/theme.
Position
Below the diagonal: github.com/santifer/career-ops/dashboard uses a module listed above it, which is the healthy direction.
6 pairs of types, where a type in github.com/santifer/career-ops/dashboard uses a type in github.com/santifer/career-ops/dashboard/internal/ui/screens.
github.com/santifer/career-ops/dashboard uses github.com/santifer/career-ops/dashboard/internal/ui/screens, so a change to github.com/santifer/career-ops/dashboard/internal/ui/screens can break github.com/santifer/career-ops/dashboard, while a change to github.com/santifer/career-ops/dashboard can't break github.com/santifer/career-ops/dashboard/internal/ui/screens.
Position
Below the diagonal: github.com/santifer/career-ops/dashboard uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 45% · Weak · gated by D1, D2, R1 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
163
High / Critical
A03:2025 — Software Supply Chain Failures
3
Medium
A02:2025 — Security Misconfiguration
2
High / Critical
A07:2025 — Authentication Failures
1
High / Critical
Roadmap
First, migrate the remaining JavaScript files to TypeScript to establish type safety and split the largest files into smaller, focused modules to improve maintainability. Next, immediately resolve the identified secret leak in REDACTED to secure the codebase. Finally, ensure all custom controls are fully keyboard-operable and enforce accessibility standards by integrating linting and automated testing into the CI pipeline.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED.
Enforce accessibility in the toolchain: add eslint-plugin-jsx-a11y, then assert with your test runner's axe binding (jest-axe, vitest-axe, cypress-axe or @axe-core/playwright) in tests, then gate axe/pa11y/Lighthouse in CI.
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Per-file score 0–10 — a quality signature. Of 406 files carrying findings, judged against the Production bar: 0% slop · 85% mixed · 15% near-clean.
File
Score
Band
Worst signal
REDACTED
4.0
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
4.0
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
4.0
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
4.0
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
4.0
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
4.0
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
4.4
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.6
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.6
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
4.6
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
4.8
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.9
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
4.9
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
4.9
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
5.0
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
5.0
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
5.0
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
5.0
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
5.1
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
5.1
Mixed
Static Analysis (SAST): Medium: REDACTED
How the grades work
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 84
A definite problem that already costs you something and drags the score down: a
missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here
tends to cause failures elsewhere.
Serious — 1884
Likely wrong, but not failing yet. It degrades
the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to
carry for two years either.
Minor — 111
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 5
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 87 of 90 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 3 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 1.0 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 90 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 2066 of 2079 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D10 Test Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 4,043 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 56 test source file(s) (.go) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D14 License Compliance — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares a Go module (REDACTED/go.sum), but the licence verdict published here was taken over its npm package dependencies. Nothing was read about its Go dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository publishes a package — a Claude Code plugin, declared by .claude-plugin/plugin.json — so it DOES have an intentionally-exposed surface: the commands, skills, agents and hooks the plugin contributes to its host, which consumers reach by name. D22 collects code-API surfaces (type and member signatures) only, and has no collector for a plugin's contribution surface, so the consistency of that surface was not judged. That is OUR side and it is a COLLECTOR gap, not an environment fault — no change to the scan image can close it.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `.github/scripts/depends-on.mjs`, `.github/scripts/triage.bundle.mjs`, `build-cv-html.mjs`, `check-jd-archive.mjs`, `cv-sections-core.mjs`, … (+17 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DockerCompose (docker-compose.yml). compose up failed (exit 17 — an image could not be built) — 6=\"$GO_SHA256_ARM64\" ;; *) echo \"unsupported arch: $arch\" >&2; exit 1 ;; esac; curl -fsSL \"https://go.dev/dl/go${GO_VERSION}.linux-${go_arch}.tar.gz\" -o /tmp/go.tgz; echo \"${go_sha256} /tmp/go.tgz\" | sha256sum -c -; tar -C /usr/local -xzf /tmp/go.tgz; rm /tmp/go.tgz; apt-get clean; rm -rf /var/lib/apt/lists/*" did not complete successfully: exit code: 100; runtime evidence skipped.
PF3 Async & latency hygiene — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 94 further occurrence(s) are not listed individually; the score already reflects all 134.
R10 Code Duplication — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 526 further occurrence(s) are not listed individually; the score already reflects all 566.
R3 Large Files — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 70 further occurrence(s) are not listed individually; the score already reflects all 110.
R4 Test Coverage — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 199 further occurrence(s) are not listed individually; the score already reflects all 239.
R7 Dead Code — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 74 further occurrence(s) are not listed individually; the score already reflects all 114.
X27 Collection changed while being enumerated — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and Java, Rust, Erlang, F#, Python, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded, no Java, Rust, Erlang, F#, Python, Dart, Ruby, Scala or Kotlin was found, and this repository's Go is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X3 Exception handling — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 400 further occurrence(s) are not listed individually; the score already reflects all 440.
X4 Structured logging — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Python, PHP, Dart, Ruby, Scala and Rust source only, and no C# was loaded, and this repository's JavaScript/TypeScript, Python and PHP make no call through a named logger, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X7 Silent fallback defaults — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 25 further occurrence(s) are not listed individually; the score already reflects all 65.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D8 Code Coverage: Coverage is measured by building and running the test suite inside Watchdog's isolated image — the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D11 Test Reliability: Flakiness is inferred from history/markers — Watchdog runs the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (REDACTED, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
The LLM boundary
LLM-set scores this run (3): D19, D21, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
701 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was main at 195. A further 3 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being latex-escape.escapeLatex at 21 — they are counted neither in the figure above nor in this dimension's score. 1 file carries no cyclomatic complexity row at all for this reason — every one of its over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: lib/latex-escape.mjs (latex-escape.escapeLatex at 21). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 462 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 27 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with main (cyclomatic 195), scan.main (cyclomatic 189), explore-provider.ExploreProvider (cyclomatic 144). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 27 together lifts Cyclomatic Complexity from 2.0 to about 3.2/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 593 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 71 bodies over 60 down to 60 or less in Cognitive Complexity — start with main (cognitive 282), scan.main (cognitive 273), mergeTracker::mergeUnderLock (cognitive 236). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 71 together lifts Cognitive Complexity from 2.0 to about 3.2/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes7.8 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 62 FunctionTooLong finding(s) in God Classes — start with REDACTED (4), analyze-patterns.mjs (2), followups-view.tsx (2). — One of this dimension's main actionable groups (62 warning-level).
Resolve the 29 FileTooLong finding(s) in God Classes — start with REDACTED, REDACTED, pipeline.go. — One of this dimension's main actionable groups (29 warning-level).
Resolve the 2 TooManyFields finding(s) in God Classes — start with catalog.go, pipeline.go. — One of this dimension's main actionable groups (2 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
19 duplicated block group(s) detected. Measured on part of this repository only: .mjs (83% of production source) was not exposed to THIS dimension's token comparison and is not in this count; duplication there is measured by R10 Code Duplication, the frontend lens's card running the same clone algorithm over the JS/TS token stream.
+ 12 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 Duplicated block (16 lines × 2) finding(s) in Code Duplication — start with pipeline.go, progress.go. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with pdf.go, progress.go. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 Duplicated block (30–31 lines × 2) finding(s) in Code Duplication — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
4 production modules (npm+Go), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 0 module(s) off the main sequence, with abstractness counted on 2 of the 4 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
What it measures: How much of the code is actually exercised by tests.
Method: Coverage from coverlet runs or committed reports (Cobertura/OpenCover/lcov), computed per-file with structured exclusions for generated, trivial, and glue code. When the suite can't be built/run in-image AND no report is committed, coverage is reported NOT-MEASURED (excluded from the score) with the precondition to make it measurable — never a LoC-ratio proxy folded in as if measured. Deterministic.
Line coverage 76.4% — 14 file(s) below 50%. Measured from the JavaScript/TypeScript suite (node:test via `npm ci --ignore-scripts` in web/).
Low coverage: doctor.mjs · ×14doctor.mjs:1
What to do
Resolve the 14 Low coverage finding(s) in Code Coverage — start with doctor.mjs, jsonc-parse.mjs, liveness-browser.mjs. — One of this dimension's main actionable groups (14 warning-level).
Enforce Code Coverage in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d8_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
4295 test methods: 4294 unit, 0 integration, 0 BDD, 1 e2e. The JavaScript/TypeScript suite contributes 4043 `it`/`test` case(s) across 478 test file(s) declaring at least one; its tier split is read from package names and paths only. The Go suite contributes 252 test case(s) across 55 `_test.go` file(s) declaring at least one — every `func Test…(t *testing.T)` that `go test` would collect, plus the suite methods a testify-style runner reaches; a table-driven case list counts once, so this is a floor. Its tier split is INFERRED from file names, paths and build constraints, not declared: 0 of those file(s) use Go's external test package (`package x_test`), which is a visibility boundary rather than a pyramid tier and was not read as one.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Stronggated by 6 serious findings✓ Tool-verified
What it measures: Whether the tests truly assert behaviour rather than just running the code.
Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.
23 skipped (23 with a documented reason), 4 zero-assertion, 1 synchronised by a fixed sleep, 1 racing the wall clock, no mocking-framework packages referenced (hand-written doubles or no mocking) across 4043 tests. Measured on the JavaScript/TypeScript suite only — at least 56 test source file(s) (.go) went unread, so its test quality is unmeasured and is not in these counts.
No assertions: acquirePipelineLock: an ownerless lock older than the grace floor is still reclaimable (#2304) · ×4tests/pipeline-lock.test.mjs:252
Fixed-sleep synchronisation: request feedback is transition-only, quiet when closed and user-navigatedweb/tests/lib/assistant-request-feedback.browser.test.mjs:10
Races the wall clock: JD frontmatter round-trips through js-yaml with awkward valuestests/apify-jds-data-root.test.mjs:89
Skipped (documented): rejects a symlink that escapes CAREER_OPS_ROOT · ×23docs/recipes/gojobs/parse-gojobs-html.manual-test.mjs:59
What to do
Resolve the 4 No assertions finding(s) in Test Quality — start with pipeline-lock.test.mjs, tracker-lock.test.mjs, inbox-skip-client.test.mjs. — One of this dimension's main actionable groups (4 warning-level).
Resolve the 1 Fixed-sleep synchronisation finding(s) in Test Quality — start with assistant-request-feedback.browser.test.mjs. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Races the wall clock finding(s) in Test Quality — start with apify-jds-data-root.test.mjs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Test Quality in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d10_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests pass reliably, with no flakiness.
Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.
What it measures: Whether dependencies are current, secure, and not bloated.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.
0 outdated, 0 author-deprecated direct Go module(s), 0 pinning or checksum defect(s). Whether any of these modules is UNMAINTAINED is not graded — proxy.golang.org publishes no maintenance status, and release age does not stand in for one. Whether any is UNUSED is not graded either: that is a source question, not a registry one. Known CVEs in this module graph are D30's question, read from REDACTED and go.sum there.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Enforce Secret Scanning in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d13_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 12 shipped npm package(s) use a banned license. Licences were resolved from registry.npmjs.org over the 12 production dependency(ies) this repository's committed lockfile resolves, across 2 product package.json manifest(s). Its 8 `devDependencies` declaration(s) are excluded: a consumer installs none of them. ★ DEPTH: this is the DIRECT production set the lockfile resolves, NOT the transitive closure — only one of the four lock dialects this pass reads states a full graph, so a banned licence pulled in only by a dependency's OWN dependencies is outside this verdict, exactly as the JVM arm's declaration-site verdict is. ★ Each licence is the one the registry publishes for the package's CURRENT release rather than for the pinned version, which is the same caveat the Hex and RubyGems arms carry. This repository publishes itself under MIT, which is its own choice and is not judged here. ★ COVERAGE OF THIS VERDICT: it grades this repository's npm package dependencies and nothing else. The repository also declares a Go module (REDACTED/go.sum), and the licences of those dependencies were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Top hotspots: REDACTED (84×280=23520); REDACTED (223×104=23192); merge-tracker.mjs (47×370=17390) Repeated repair below the complexity floor: REDACTED (138 of 272 changes were fixes); tracker-utils.mjs (24 of 32 changes were fixes); verify-pipeline.mjs (17 of 25 changes were fixes)
Hotspot: REDACTED · ×136REDACTED:3989
Repeated repair: REDACTED · ×67REDACTED:2735
What to do
Resolve the 136 Hotspot finding(s) in Churn × Complexity Hotspots — start with REDACTED (15), url-key.mjs (2), REDACTED. — One of this dimension's main actionable groups (136 warning-level).
Resolve the 67 Repeated repair finding(s) in Churn × Complexity Hotspots — start with REDACTED (6), page.tsx (2), REDACTED. — One of this dimension's main actionable groups (67 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor9.4 / 10Exemplary✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
34 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is providers/builtin.mjs. Counted over 570 of the 767 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1
Further sole-owners (lower concentration)
✓ On the Gold path — maintain.
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
0 deducted task-comment markers across 34533 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
The repository's READMEs and architecture/Docs markdown files are clear, complete, and well-structured. Each document documents its own directory (e.g., seeds/, templates/) rather than the root project, so only the root README is judged on overview/installation/usage/contributing/license; none of these are missing. The seed-ats-full.mjs README gives a precise usage example for each command in a shell block and explains what the seeds layer does (high-signal startup role coverage). The templates README lists every template file with purpose, and the web README is an alpha experimental UI that describes pipeline, explore, scheduled scans, and safety. All documents are well-organized with headings and the outline present; no unshown section is flagged as missing. The career-ops project's READMEs for the modes/de/, modes/es/, and modes/fr/ directories are clear, complete, and well-structured. Each directory documents itself (the modes it contains), with a focused overview of when to use them, two activation paths (session-specific or permanent profile settings), and an outline that all visible sections appear to cover — this is the standard README for each deploy tier. (11 of 25 sampled documents could not be assessed: 1 of 3 evaluation groups failed.)
What to do
Improve Documentation Quality — currently 8.8/10. — The repository's READMEs and architecture/Docs markdown files are clear, complete, and well-structured. Each document documents its own directory (e.g., seeds/, templates/) rather than the root project, so only the root README is judged on overview/installation/usage/contributing/license; none of these are missing. The seed-ats-full.mjs README gives a precise usage example for each command in a shell block and explains what the seeds layer does (high-signal startup role coverage). The templates README lists every template file with purpose, and the web README is an alpha experimental UI that describes pipeline, explore, scheduled scans, and safety. All documents are well-organized with headings and the outline present; no unshown section is flagged as missing. The career-ops project's READMEs for the modes/de/, modes/es/, and modes/fr/ directories are clear, complete, and well-structured. Each directory documents itself (the modes it contains), with a focused overview of when to use them, two activation paths (session-specific or permanent profile settings), and an outline that all visible sections appear to cover — this is the standard README for each deploy tier. (11 of 25 sampled documents could not be assessed: 1 of 3 evaluation groups failed.)
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
2 of 4 build units (Go, npm) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
167 finding(s): 0 critical, 43 high, 124 medium, 0 low. 42 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 27 file(s) — `.github/scripts/depends-on.mjs` (lines 79–80), `.github/scripts/triage.bundle.mjs` (lines 11–1192), `batch/batch-runner.sh` (line 952, line 960, line 1297, …), `build-cv-html.mjs`, `check-jd-archive.mjs` (line 292), … (+22 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 4 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 49 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (49). — One of this dimension's main actionable groups (49 warning-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
No action in Static Analysis (SAST) — all 42 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (42 issue-level, 0 of them charged here).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
Resolve the 1 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 1 High IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Medium IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 570 of the 767 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 2 Change coupling finding(s) in Change Coupling — start with REDACTED, _types.js. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 5 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
✓ On the Gold path — maintain.
Detailed fixes: d44_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC1 · Text alternatives10.0 / 10Exemplary○ Nothing flagged
Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.
Do you agree with this assessment?
AC2 · Forms & labels5.4 / 10Adequate✓ Tool-verified
Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.
Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label. (×15) — web/src/components/apply-view.tsx:41, web/src/components/beta/beta-banner.tsx:110, web/src/components/config-form.tsx:264, …
This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id. (×11) — web/src/components/config-form.tsx:111, web/src/components/config-form.tsx:238, web/src/components/config-form.tsx:260, …
This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. (×7) — web/src/components/cv/cv-ingest.tsx:292, web/src/components/scheduled-scans/create-job-modal.tsx:94, web/src/components/scheduled-scans/create-job-modal.tsx:112, …
A fieldset groups related controls but has no <legend> to name the group. Add a <legend> as its first child — or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption's id instead, which names the group without rendering a second one. — web/src/components/explore/filter-builder.tsx:128
A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one). (×3) — web/src/components/scheduled-scans/create-job-modal.tsx:65, web/src/components/scheduled-scans/edit-job-modal.tsx:89, web/src/components/scheduled-scans/run-history-drawer.tsx:29
What to do
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.
Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. (×10) — REDACTED:7, templates/cover-letter-template.html:2, REDACTED:6, …
Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one. (×3) — web/src/app/documents/page.tsx:108, web/src/components/home/today-dashboard.tsx:286, web/src/components/scheduled-jobs-view.tsx:300
What to do
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Other · Accessibility — Whether interactive behaviour is keyboard-reachable — no click handler on a non-interactive element lacking a role, tabindex and key handler, no element the repo's own CSS styles `cursor: pointer` without giving it any of the three, no unfocusable element whose only binding is a mouse enter/leave pair or a double-click, no positive tabindex, no href-less anchor, no placeholder-href (#/javascript) link acting as a button. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: click handlers on non-interactive elements lacking role+tabindex+key handler, positive tabindex values, and href-less anchors. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: elements that pose a keyboard-semantics question, in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) — a non-natively-interactive element carrying a click handler, a double-click or hover enter/leave binding, a pointer-only gesture on a tabindex="0" element, or `cursor: pointer` from the repo's own CSS; an href-less or placeholder-href (#, javascript:) anchor; and any element with a positive tabindex. Natively interactive elements used correctly (<button>, <a href>, form controls) are NOT in the population — there is nothing to judge — so a page of nothing but correct controls gives AC4 nothing to measure. Keyboard reachability is judged from the markup, never from a rendered page. ★ An interactive element declared in a tagged-template (html`…`) or hyperscript frontend is NOT in this population — no producer reads either — so an empty population is reported as an analyzer gap, never as "this repository has no interactive elements".
This <div role="dialog"> is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close. — web/src/components/beta/beta-banner.tsx:101
This <div role="dialog"> is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close. (×2) — web/src/components/followups/log-dialog.tsx:84, web/src/components/followups/next-date-dialog.tsx:76
A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler. — web/src/components/mobile-nav.tsx:127
What to do
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.
Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
<input> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2). (×9) — web/src/components/apply-view.tsx:41, web/src/components/config-form.tsx:264, web/src/components/cv-studio/section-card.tsx:255, …
<span> moves — its `animate-ping` utility runs with no motion-safe:/motion-reduce: variant — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:. — web/src/components/apply-view.tsx:468
<textarea> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2). (×4) — web/src/components/cv-editor.tsx:82, web/src/components/cv-studio/section-card.tsx:146, web/src/components/cv/cv-ingest.tsx:200, …
<select> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2). (×4) — web/src/components/scheduled-scans/create-job-modal.tsx:94, web/src/components/scheduled-scans/create-job-modal.tsx:119, web/src/components/scheduled-scans/edit-job-modal.tsx:118, …
`.route-bar[data-state="done"]` moves (`transition: transform 0.2s ease-out, opacity 0.35s ease-out 0.15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — web/src/app/globals.css:176
What to do
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Do you agree with this assessment?
AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified
Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.
Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.
Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.
No accessibility enforcement found — no a11y linter (eslint-plugin-jsx-a11y) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 152 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
What to do
Enforce accessibility in the toolchain: add eslint-plugin-jsx-a11y, then assert with your test runner's axe binding (jest-axe, vitest-axe, cypress-axe or @axe-core/playwright) in tests, then gate axe/pa11y/Lighthouse in CI.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.
Do you agree with this assessment?
C2 · Access Controls7.0 / 10Strong✓ Tool-verified
Other · Security — Whether access is authorized by default — a framework authorization attribute/decorator or policy, or imperative guard methods (throw-on-violation) called from handlers.
Method: Roslyn scan: [Authorize] usage and authorization policies, plus imperative throw-on-violation guard methods detected via syntax. Deterministic.
Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) — this is NOT a claim that endpoints are unprotected. What's missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can't be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect.
What to do
Name the access rules — roles/permissions declared once (a @Roles/@Permissions decorator with its guard, a CASL ability, a casbin model, or Supabase CREATE POLICY) and consulted where access is checked, so the rule set is reviewable and testable on its own.
Other · Code Health — Unreviewed-generation residue in this repository's JavaScript/TypeScript: functions whose whole body still throws a "not implemented" error, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings and JSX of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
A placeholder string ("# Experience
## Instructional Designer …") is still in shipped code — typical of generated boilerplate that was never filled in. — story-provenance-check.mjs:741
A placeholder string ("without tripping the low-text image heur…") is still in shipped code — typical of generated boilerplate that was never filled in. — verify-ats.mjs:880
A placeholder string ("<header><div>jane@example.com | +1 415 5…") is still in shipped code — typical of generated boilerplate that was never filled in. — verify-ats.mjs:1181
What to do
Finish or delete the functions that still throw "not implemented", and replace placeholder text before shipping.
Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's JavaScript/TypeScript: functions that only throw a "not implemented" error, functions that take inputs and return a constant or do nothing, async functions that never await, dead `if (false)` branches, and skeleton classes most of whose methods are holes.
Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.
`main` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work. (×2) — application-answers.mjs:539, application-artifacts.mjs:135
`selfTest` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work. — REDACTED:975
Both arms of this conditional expression are the same, so no input can make the condition matter. Implement the distinction that was intended, or drop the condition. — generate-latex.mjs:434
`cmdAvailable` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work. — plugins.mjs:383
`cmdAdd` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work. — plugins.mjs:494
`onOpen` is wired to an arrow whose body is empty — the markup attaches a listener that does nothing. Implement the handler, or remove the attribute that wires it. — web/src/components/assistant-console.tsx:908
`runSelfTest` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work. — weekly-digest.mjs:393
What to do
Remove the dead code that still moves this score: delete dead if(false) branches and either do the real async work or drop the async keyword from fake-async functions.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
docs/RUNNING_ON_A_BUDGET.md documents the environment variable `OPENAI_API_BASE`, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/RUNNING_ON_A_BUDGET.md:152
docs/RUNNING_ON_A_BUDGET.md documents the environment variable `QWEN_API_BASE`, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/RUNNING_ON_A_BUDGET.md:257
docs/SOURCE_INDEXING_LOG.md names `providers/a16z-speedrun.mjs`, but no file or folder `providers/a16z-speedrun.mjs` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/SOURCE_INDEXING_LOG.md:44
docs/local-parser-cookbook.md runs `npm run test:scan-tokens`, but no package.json declares a `test:scan-tokens` script. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/local-parser-cookbook.md:43
What to do
Reconcile the README with reality: docs/RUNNING_ON_A_BUDGET.md documents the environment variable `OPENAI_API_BASE`, but no code, script or configuration file names it; docs/RUNNING_ON_A_BUDGET.md documents the environment variable `QWEN_API_BASE`, but no code, script or configuration file names it; docs/SOURCE_INDEXING_LOG.md names `providers/a16z-speedrun.mjs`, but no file or folder `providers/a16z-speedrun.mjs` exists; docs/local-parser-cookbook.md runs `npm run test:scan-tokens`, but no package.json declares a `test:scan-tokens` script.
No logging call was found in the 767 JavaScript/TypeScript, Go production file(s) this check read across 4 module(s). Each was searched for its ecosystem's logging libraries (Go: log, log/slog, zap, zerolog, logrus, klog, hclog, logr; JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger) and for a call on a receiver named `log`/`logger` (or ending in `Logger`/`_logger`) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read — this is 'no logging found by this walk', not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose.
What to do
Adopt pino (or winston) and log at meaningful points in the services you run.
Add a health-check endpoint (@godaddy/terminus or a /health route) so orchestrators and load balancers can probe liveness/readiness.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
What to do
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
Do you agree with this assessment?
P5 · DR & Backup4.0 / 10Weak✓ Tool-verified
Readiness · Readiness — Whether disaster recovery is planned and codified — backups, geo-recovery, RTO/RPO, persistence guarantees — from IaC + container manifests + docs, never the live cloud.
Method: Filesystem scan: disaster recovery, backup, geo-recovery, RTO/RPO, persistence guarantees from IaC, manifests, and docs. Exhaustive, deterministic, never a live environment.
What to do
Document RTO/RPO and a tested restore procedure (a backup config alone isn't disaster recovery).
No persistence guard on critical data stores — use Docker named volumes (or your orchestrator's persistent-volume equivalent) so the data store can't be wiped by a container recreate (or, in cloud, set purge-protection / soft-delete / prevent_destroy).
Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
A Go testing.B suite exists but nothing turns on its allocation measurement — allocations (the main way hot code pressures a garbage collector or allocator) aren't being measured. — dashboard/internal/ui/screens/pipeline_window_test.go
What to do
Call b.ReportAllocs() in the benchmarks, or run them with `go test -bench . -benchmem`, so allocation regressions are visible, not just time.
Readiness · Performance — Whether the code is written to minimise allocations so it doesn't pressure its host's memory manager — buffer/slice views over copies, object pooling, stack or value-type allocation, and buffer writers. Reward-only: credited where present, never penalised where a simpler style is fine.
Method: Production-source scan: density (per 1k LoC) of allocation-aware APIs — in .NET Span/Memory, ArrayPool/ObjectPool, stackalloc, ValueTask, value-type structs, IBufferWriter, string.Create, SkipLocalsInit; off .NET, with comments and strings blanked, Go's sync.Pool, preallocated slices/maps, Grow, strconv.Append* and buf[:0] reuse; the JVM's NIO buffer views, MemorySegment, primitive collections, pools and literal presizes (plus Kotlin primitive arrays and value classes, Scala AnyVal and @specialized); Swift's reserveCapacity, ContiguousArray, withUnsafe* access and ~Copyable. Activated off .NET on the same floor (400 lines, and benchmarks or 8 uses); Rust and garbage-collected scripting languages are not applicable. Reward-only. Deterministic, syntax/text detection.
What to do
Raise allocation-aware density on the hot paths — currently 10 use(s) across 9,398 production line(s) (~1.1/1k). More of the idioms below on the allocation-heavy paths climbs this toward 10.
Go: on hot paths, reuse buffers and objects through sync.Pool, preallocate slices and maps with make([]T, 0, n) / make(map[K]V, n), size builders with Grow, append with strconv.Append*, and reslice with buf[:0] instead of allocating anew.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
`existsSync` in `extractPipelineEntries` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — archive-posting.mjs:273
`mkdirSync` in `archiveUrl` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — archive-posting.mjs:414
`mkdirSync` in `processOffer` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — batch-evaluate-gemini.mjs:325, batch-evaluate-gemini.mjs:326
`writeFileSync` in `processOffer` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — batch-evaluate-gemini.mjs:355, batch-evaluate-gemini.mjs:365
`readFileSync` in `callback to withPipelineLock` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — batch-evaluate-gemini.mjs:405, REDACTED:1507
`writeFileSync` in `callback to withPipelineLock` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — batch-evaluate-gemini.mjs:409
`existsSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×6) — batch-evaluate-gemini.mjs:424, generate-cover-letter.mjs:462, generate-cover-letter.mjs:486, …
`readFileSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×3) — batch-evaluate-gemini.mjs:429, generate-cover-letter.mjs:467, intake.mjs:486
`execFileSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — batch-evaluate-gemini.mjs:455
`mkdirSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — generate-cover-letter.mjs:486
`mkdirSync` in `updatePDFManifest` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:1499
`existsSync` in `callback to withPipelineLock` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:1506
`writeFileSync` in `runBatchFromManifest` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:1999
`mkdirSync` in `renderInPage` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:2181
`mkdirSync` in `commitState` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — intake.mjs:365
`existsSync` in `buildTimeoutError` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — lib/dir-lock.mjs:772
`mkdirSync` in `acquireDirLock` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — lib/dir-lock.mjs:789
`fs.existsSync` in `callback to withPipelineLock` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — openrouter-runner.mjs:559
`fs.readFileSync` in `callback to withPipelineLock` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — openrouter-runner.mjs:560
`fs.existsSync` in `exists` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — openrouter-runner.mjs:836
`fs.existsSync` in `list` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — openrouter-runner.mjs:837
`fs.readdirSync` in `list` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — openrouter-runner.mjs:837
`fs.readFileSync` in `cmdApply` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — openrouter-runner.mjs:849
`existsSync` in `loadPluginConfig` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — plugins/_engine.mjs:113
`readFileSync` in `loadPluginConfig` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — plugins/_engine.mjs:116
`existsSync` in `mergeProviderPlugins` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — plugins/_engine.mjs:765
`statSync` in `indexDigest` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — plugins/h1b-sponsor/lib/index.mjs:166
`existsSync` in `applyScriptDirGuard` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — tests/portal-health-guard.mjs:33
`readFileSync` in `applyScriptDirGuard` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — tests/portal-health-guard.mjs:33
`existsSync` in `callback to withPortalHealthLock` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — tests/portal-health-guard.mjs:35
What to do
TypeScript/JavaScript: use the promise APIs (fs/promises, a promisified child_process.execFile, the async zlib/crypto functions) and await them instead of the *Sync variants.
Do you agree with this assessment?
R1 · Type Safety1.3 / 10Critical✓ Tool-verified
React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.
Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.
230 typed · 1592 plain JS — the untyped files are add-entry.mjs, analyze-patterns.mjs, application-answers.mjs, application-artifacts.mjs, apply-scope.mjs, archive-posting.mjs (+1586 more).
What to do
Migrate the remaining .js/.jsx files to TypeScript.
React / JS · Code Health — Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm over JS/TS tokens, D-386): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.
Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Deterministic.
34 duplicated blocks under web/src/app/api/ have copies in at least two of the sibling directories apply, assistant, company-history, cv, cv-studio, explore (+16 more sibling(s) not listed) — 28 of them are reported below, and 6 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 34 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 34 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 34 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — web/src/app/api/assistant/route.ts:91
14 duplicated blocks under web/src/ have copies in at least two of the sibling directories app, components, lib — 7 of them are reported below, and 7 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 14 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 14 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 14 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — web/src/app/api/cover-pdf/route.ts:36
12 duplicated blocks under web/src/components/ have copies in at least two of the sibling directories analytics, apply, cv, explore, followups, home (+2 more sibling(s) not listed) — 6 of them are reported below, and 6 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 12 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 12 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 12 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — web/src/components/followups/log-dialog.tsx:44
11 duplicated blocks under the repository root have copies in at least two of the sibling directories batch, lib, plugins, providers, seeds, utils (+1 more sibling(s) not listed) — 7 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 11 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 11 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 11 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — lib/dir-lock.mjs:42
lib/dir-lock.mjs:42 · web/src/lib/core/dir-lock.mjs:42 — these 2 files are line-for-line copies of one another — 271 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — lib/dir-lock.mjs:42
ollama-eval.mjs:41 · openai-eval.mjs:46 — the two spans are one implementation copied and then locally edited — 1834 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — ollama-eval.mjs:41
REDACTED:52 · providers/platsbanken.mjs:71 — the two spans are one implementation copied and then locally edited — 588 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:52
web/src/lib/cv-envelope.mjs:31 · web/src/lib/report-envelope.mjs:17 — the two spans are one implementation copied and then locally edited — 693 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — web/src/lib/cv-envelope.mjs:31
closing-soon.mjs:332 · reeval-candidates.mjs:332 — the two spans are one implementation copied and then locally edited — 830 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — closing-soon.mjs:332
providers/computrabajo.mjs:51 · providers/magneto.mjs:45 — the two spans are one implementation copied and then locally edited — 689 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — providers/computrabajo.mjs:51
providers/justjoin.mjs:8 · providers/nofluffjobs.mjs:8 — the two spans are one implementation copied and then locally edited — 589 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — providers/justjoin.mjs:8
REDACTED:12 · REDACTED:12 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — REDACTED:12
openai-eval.mjs:191 · openai-tailor.mjs:127 — the two spans are one implementation copied and then locally edited — 486 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — openai-eval.mjs:191
web/src/components/scheduled-scans/create-job-modal.tsx:16 · web/src/components/scheduled-scans/edit-job-modal.tsx:18 — the two spans are one implementation copied and then locally edited — 493 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — web/src/components/scheduled-scans/create-job-modal.tsx:16
providers/alibaba.mjs:69 · providers/tencent.mjs:43 — the two spans are one implementation copied and then locally edited — 540 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — providers/alibaba.mjs:69
web/src/app/api/assistant/route.ts:91 · REDACTED:119 — the two spans are one implementation copied and then locally edited — 421 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — web/src/app/api/assistant/route.ts:91
providers/careerviet.mjs:49 · providers/itviec.mjs:37 — the two spans are one implementation copied and then locally edited — 427 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — providers/careerviet.mjs:49
web/src/components/followups/log-dialog.tsx:25 · web/src/components/followups/next-date-dialog.tsx:32 — the two spans are one implementation copied and then locally edited — 364 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — web/src/components/followups/log-dialog.tsx:25
providers/beesite.mjs:55 · providers/deutschebahn.mjs:58 — the two spans are one implementation copied and then locally edited — 337 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — providers/beesite.mjs:55
build-cv-html.mjs:1448 · build-cv-latex.mjs:385 — the two spans are one implementation copied and then locally edited — 414 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — build-cv-html.mjs:1448
providers/kalibrr.mjs:165 · providers/techinasia.mjs:268 — the two spans are one implementation copied and then locally edited — 387 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — providers/kalibrr.mjs:165
providers/careerviet.mjs:263 · providers/itviec.mjs:227 · providers/senjob.mjs:155 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — providers/careerviet.mjs:263
providers/dover.mjs:126 · providers/rippling.mjs:127 — the two spans are one implementation copied and then locally edited — 379 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — providers/dover.mjs:126
REDACTED:16 · REDACTED:12 · REDACTED:12 — the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — REDACTED:16
analyze-patterns.mjs:807 · upskill.mjs:717 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — analyze-patterns.mjs:807
providers/neogov.mjs:29 · providers/schoolspring.mjs:20 — the two spans are one implementation copied and then locally edited — 295 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — providers/neogov.mjs:29
web/src/components/scheduled-scans/create-job-modal.tsx:106 · web/src/components/scheduled-scans/edit-job-modal.tsx:125 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — web/src/components/scheduled-scans/create-job-modal.tsx:106
providers/hecklerkoch.mjs:24 · providers/softgarden.mjs:27 — the two spans are one implementation copied and then locally edited — 313 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — providers/hecklerkoch.mjs:24
providers/csod.mjs:38 · providers/phenom.mjs:53 — the two spans are one implementation copied and then locally edited — 275 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — providers/csod.mjs:38
REDACTED:245 · openai-eval.mjs:154 — the two spans are one implementation copied and then locally edited — 303 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:245
providers/bamboohr.mjs:55 · providers/breezy.mjs:16 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — providers/bamboohr.mjs:55
build-cv-latex.mjs:214 · build-cv-latex.mjs:500 — the two spans are one implementation copied and then locally edited — 339 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — build-cv-latex.mjs:214
ics-interview.mjs:434 · REDACTED:346 — the two spans are one implementation copied and then locally edited — 313 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — ics-interview.mjs:434
REDACTED:230 · sync-batch-input.mjs:67 — the two spans are one implementation copied and then locally edited — 430 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:230
providers/phenom.mjs:92 · providers/tkms.mjs:55 — the two spans are one implementation copied and then locally edited — 316 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — providers/phenom.mjs:92
REDACTED:492 · web/src/lib/posting-url.mjs:48 — the two spans are one implementation copied and then locally edited — 248 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:492
web/src/components/page-loading-skeletons.tsx:54 · web/src/components/page-loading-skeletons.tsx:113 — the two spans are one implementation copied and then locally edited — 222 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — web/src/components/page-loading-skeletons.tsx:54
lib/cli-launch.mjs:21 · web/src/lib/cli-launch.mjs:21 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — lib/cli-launch.mjs:21
pipeline-lock.mjs:32 · portal-health-lock.mjs:23 — the two spans are one implementation copied and then locally edited — 219 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — pipeline-lock.mjs:32
REDACTED:37 · REDACTED:38 · REDACTED:38 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:37
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Architecture — Conformance to the detected frontend architecture layout (feature-sliced / layered src) plus cross-package deep-import rules (D-386).
Method: Conformance to the detected frontend layout (feature-sliced / layered src) plus cross-package deep-import rules, over the module graph. Deterministic.
doctor.mjs:20 reaches into another package with a relative path (./scaffolder/bin/skill-entrypoints.mjs) — import the package by name instead. — doctor.mjs:20
REDACTED:11 reaches into another package with a relative path (../web/src/lib/bind-host.mjs) — import the package by name instead. — REDACTED:11
REDACTED:71 imports tests/helpers.mjs, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — REDACTED:71
REDACTED:76 imports tests/evaluation-mode-parity-helpers.mjs, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — REDACTED:76
REDACTED:79 imports tests/data-root-guard.mjs, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — REDACTED:79
REDACTED:4031 reaches into another package with a relative path (./scaffolder/bin/skill-entrypoints.mjs) — import the package by name instead. — REDACTED:4031
REDACTED:5150 reaches into another package with a relative path (./scaffolder/bin/skill-entrypoints.mjs) — import the package by name instead. — REDACTED:5150
web/scripts/scheduled-jobs-runner.mjs:15 reaches into another package with a relative path (../../lib/is-main-module.mjs) — import the package by name instead. — web/scripts/scheduled-jobs-runner.mjs:15
web/scripts/scheduled-jobs-runner.mjs:17 reaches into another package with a relative path (../../path-resolver.mjs) — import the package by name instead. — web/scripts/scheduled-jobs-runner.mjs:17
web/src/lib/cv-studio/base-cv.mjs:11 reaches into another package with a relative path (../../../../REDACTED) — import the package by name instead. — web/src/lib/cv-studio/base-cv.mjs:11
What to do
Fix the listed violations: import through the target package's declared public entry rather than a deep path into its internals or a relative path into its directory (7 rows); move the shared test helper into a source directory production code may depend on (3 rows).
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
main has cyclomatic complexity 195 and cognitive complexity 282; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:3989
mergeUnderLock has cyclomatic complexity 133 and cognitive complexity 236; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — merge-tracker.mjs:1334
runSelfTest has cyclomatic complexity 115 and cognitive complexity 139; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — analyze-patterns.mjs:433
main has cyclomatic complexity 108 and cognitive complexity 161; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — scan-ats-full.mjs:1156
apply has cyclomatic complexity 102 and cognitive complexity 164; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:4515
runSelfTest has cyclomatic complexity 80 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — build-cv-html.mjs:1108
selfTest has cyclomatic complexity 77 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:746
(anonymous) has cyclomatic complexity 67 and cognitive complexity 130; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:4349
syncTrackerPdfFlags has cyclomatic complexity 62 and cognitive complexity 148; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — sync-pdf-flags.mjs:56
ExplorerView has cyclomatic complexity 54 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — web/src/components/explore/explorer-view.tsx:33
diagnose has cyclomatic complexity 51 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — coverage-check.mjs:123
validateManifest has cyclomatic complexity 51 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/_engine.mjs:182
parseReport has cyclomatic complexity 50 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — analyze-patterns.mjs:974
canonicalizeArchetype has cyclomatic complexity 50 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — web/src/lib/analytics-metrics.mjs:147
validatePortalsConfig has cyclomatic complexity 49 and cognitive complexity 130; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — validate-portals.mjs:190
buildEvidence has cyclomatic complexity 48 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — github-evidence.mjs:195
locallyModifiedSystemFiles has cyclomatic complexity 47 and cognitive complexity 102; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:2399
main has cyclomatic complexity 47 and cognitive complexity 88; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — check-liveness.mjs:159
main has cyclomatic complexity 46 and cognitive complexity 123; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — batch/aggregate-tokens.mjs:30
fold has cyclomatic complexity 46 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:533
What to do
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
Do you agree with this assessment?
R3 · Large Files4.0 / 10Weak✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
REDACTED has 5610 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
REDACTED has 4786 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
REDACTED has 2896 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
merge-tracker.mjs has 2288 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — merge-tracker.mjs:1
REDACTED has 2193 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
scan-ats-full.mjs has 1834 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — scan-ats-full.mjs:1
analyze-patterns.mjs has 1697 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — analyze-patterns.mjs:1
REDACTED has 1632 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
company-history.mjs has 1618 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — company-history.mjs:1
build-cv-html.mjs has 1430 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — build-cv-html.mjs:1
doctor.mjs has 1422 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — doctor.mjs:1
tracker.mjs has 1268 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — tracker.mjs:1
verify-ats.mjs has 1245 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — verify-ats.mjs:1
discover-ats.mjs has 1200 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — discover-ats.mjs:1
providers/workday.mjs has 1196 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — providers/workday.mjs:1
jd-skill-gap.mjs has 1195 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — jd-skill-gap.mjs:1
REDACTED has 1171 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
web/src/components/assistant-console.tsx has 1089 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — web/src/components/assistant-console.tsx:1
browser-extract.mjs has 1076 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — browser-extract.mjs:1
check-jd-archive.mjs has 1067 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — check-jd-archive.mjs:1
followup-cadence.mjs has 1048 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — followup-cadence.mjs:1
invite-match.mjs has 1029 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — invite-match.mjs:1
set-status.mjs has 977 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — set-status.mjs:1
tracker-utils.mjs has 971 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — tracker-utils.mjs:1
story-provenance-check.mjs has 956 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — story-provenance-check.mjs:1
REDACTED has 955 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
liveness-api.mjs has 948 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — liveness-api.mjs:1
upskill.mjs has 939 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — upskill.mjs:1
lib/dir-lock.mjs has 931 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — lib/dir-lock.mjs:1
web/src/lib/core/dir-lock.mjs has 931 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — web/src/lib/core/dir-lock.mjs:1
REDACTED has 876 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
openrouter-runner.mjs has 866 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — openrouter-runner.mjs:1
linkedin-join.mjs has 859 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — linkedin-join.mjs:1
funnel-velocity.mjs has 835 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — funnel-velocity.mjs:1
REDACTED has 776 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
plugins/_engine.mjs has 763 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — plugins/_engine.mjs:1
liveness-browser.mjs has 759 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — liveness-browser.mjs:1
updater-migration-tests.mjs has 753 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — updater-migration-tests.mjs:1
stats.mjs has 750 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — stats.mjs:1
detect-reposts.mjs has 741 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — detect-reposts.mjs:1
What to do
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
Do you agree with this assessment?
R4 · Test Coverage6.8 / 10Adequate✓ Tool-verified
React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.
Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.
web/tests/lib/json-body.test.mjs:22 imports '../../src/app/api', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — web/tests/lib/json-body.test.mjs:22
web/tests/lib/profile-input-validation.test.mjs:10 imports '../../src/', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — web/tests/lib/profile-input-validation.test.mjs:10
web/tests/lib/profile-write-shape.test.mjs:12 imports '../../src/', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — web/tests/lib/profile-write-shape.test.mjs:12
No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×37) — build-cv-html.mjs:1, jd-skill-gap.mjs:1, REDACTED:1, …
What to do
Add tests that import the unreached modules (directly or through their public entry).
React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).
Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.
What to do
Bump outdated dependencies to current versions to limit upgrade debt.
Do you agree with this assessment?
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
This repository declares test tooling, and the ✓ above records that declaration — but web/tests/lib/json-body.test.mjs and 2 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) — each one is reported with its failing import under Test Coverage — then the declared script exercises what it claims to. — web/tests/lib/json-body.test.mjs:22
Do you agree with this assessment?
R7 · Dead Code6.9 / 10Adequate✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
Unreachable from the 382 application, 163 tooling and 1108 test entry point(s) detected in this repo. Gate removals on `npm run build` — an undetected custom entry would make these reachable.
no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×39) — REDACTED, REDACTED, REDACTED, …
What to do
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.
Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
followup-cadence.mjs → funnel-velocity.mjs → followup-cadence.mjs (one verified cycle inside a mutually-dependent group of 3 files) — followup-cadence.mjs:24
Other · Security — Read from this repository's JavaScript/TypeScript source: cryptographic hygiene (weak hash or cipher, key material fixed in the source) and outbound TLS (certificate validation, protocol version) — facts about code that hold whether or not it serves anything itself. The server controls — HTTPS enforcement, HSTS, cookie flags, input validation — are NOT assessed for JavaScript/TypeScript: each is scored as an absence, an absence is only reportable over the production HTTP server, and in this ecosystem the file that opens the port is build output or a framework launcher rather than a file in the source tree. Their absence here is not a finding about this repository.
Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.
MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`createHash("sha256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call. (×6) — contacts.mjs:217, fingerprint-core.mjs:72, plugins/apify/index.mjs:79, …
What to do
Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (xxhash, murmurhash) where it only derives an identifier such as a cache key. This repository constructs a collision-broken hash (MD5/SHA1) at 6 sites, not one: `contacts.mjs:217` (createHash("sha1")), `fingerprint-core.mjs:72` (createHash("sha1")), `plugins/apify/index.mjs:79` (createHash("sha1")), `plugins/apify/index.mjs:125` (createHash("sha1")), `scan-ats-full.mjs:246` (createHash("sha1")), `session-activity.mjs:62` (createHash("sha1")). Each is a separate decision — fixing only the line this row cites leaves the others in place.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document2.2 / 10Critical✓ Tool-verified
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
`getMessageBody` is exported and takes `payload: object` from its caller, and it calls itself at line 248 (`getMessageBody`) with a piece of `payload` — and nowhere in `getMessageBody` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `getMessageBody` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — plugins/gmail/_helpers.mjs:248
`buildOfficeMap` is exported, takes a document from its caller (line 128) and hands it to `walk`, which calls itself at line 146 (`walk`) with a piece of `offices` — and nowhere in `walk` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `walk` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — providers/greenhouse.mjs:146
`parseEployDetail` is exported, takes a document from its caller (line 181) and hands it to `flattenJsonLd`, which calls itself at line 170 (`flattenJsonLd`) with a piece of `value` (and at line 172) — and nowhere in `flattenJsonLd` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `flattenJsonLd` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — providers/eploy.mjs:170
What to do
Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether async functions that make a cancellable request accept or pass on an AbortSignal (adoption curve).
Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.
Only 20/26 async functions that make a cancellable request (fetch, axios, ky, ofetch) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
`fetchJson` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — scan-hn.mjs:124
`loadFreeModels` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — openrouter-runner.mjs:125
`fetchJobPage` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — openrouter-runner.mjs:453
`cmdScan` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — openrouter-runner.mjs:632
`avatarDataUri` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — hired-wall-build.mjs:131
`collect` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — web/src/lib/report/report.ts:46
What to do
Thread an AbortSignal through async functions that make requests, so the work stops when its caller gives up.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped7.2 / 10Strong✓ Tool-verified
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
`url` is text this program did not author, and it is written into the start of a URL attribute, where it chooses the scheme through markup built here with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML encoding does not help here — a `javascript:` URL contains nothing it changes; allow only http(s) or a relative path. — build-cv-html.mjs:478
`sanitizeImageSrc(photo)` is text this program did not author, and it is written into the start of a URL attribute, where it chooses the scheme through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML encoding does not help here — a `javascript:` URL contains nothing it changes; allow only http(s) or a relative path. — build-cv-html.mjs:726
`escapeHtml(fn.url)` is text this program did not author, and it is written into the start of a URL attribute, where it chooses the scheme through markup built here with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML encoding does not help here — a `javascript:` URL contains nothing it changes; allow only http(s) or a relative path. — generate-cover-letter.mjs:274
What to do
Each finding names the expression, the attribute it lands in and the line. Confirm the value's origin from the read this analyzer traced, then escape it at the sink or validate it against the shape the attribute accepts before interpolating.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
`catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×6) — weekly-digest.mjs:159, validate-untrusted-content-coverage.mjs:126, url-key.mjs:280, …
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×34) — REDACTED:184, verify-pipeline.mjs:296, verify-pipeline.mjs:366, …
What to do
Swallowed exception (caught, then discarded)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether strict null checking is enabled and not undermined by heavy `!` assertion — TypeScript's `strictNullChecks` (which `strict` turns on) is what makes `string` exclude `null` and `undefined`, and the postfix `!` is the operator that silences it.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
~0.5 `!` null assertions per 1k TypeScript source lines — 14 assertion(s) across the 28209 source line(s) of the 230 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: web/src/app/actions/registry.ts (3), web/src/components/inbox/triage-row.tsx (3), web/src/app/api/explore/ai/route.ts (1). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce.
What to do
The findings name the configuration each number was taken from and, for the assertions, the files that hold them. Turn null checking on where it is off — `"strict": true` in the base tsconfig that the others extend switches `strictNullChecks` on with the rest of the family — and then resolve the assertions rather than adding to them. A `!` on a value the checker could show to be null is a promise the author cannot check from where they are standing, and each one is a `TypeError: Cannot read properties of null` waiting for the path that makes it true; where the value genuinely cannot be null, say something the checker can see instead (narrow it with a test, make the property required, drop the `?`).
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 15 of 55 WCAG 2.2 Level A/AA success criteria (27%; ≈30% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 40 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 4 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X6 Hand-rolled structured-format parsing — 4 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X9 Subsumed condition operand — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not included — 37 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AX1 Captive dependencies — Not applicable: this repository's Go imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's TypeScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No Go request handler (a net/http, Gin, Echo, Fiber or fasthttp handler, or a gRPC service method) is declared as a method or function, and no handler function literal writes a value captured from outside it, so no state is shared between request goroutines. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — compose up failed (exit 17 — an image could not be built) — 6=\"$GO_SHA256_ARM64\" ;; *) echo \"unsupported arch: $arch\" >&2; exit 1 ;; esac; curl -fsSL \"https://go.dev/dl/go${GO_VERSION}.linux-${go_arch}.tar.gz\" -o /tmp/go.tgz; echo \"${go_sha256} /tmp/go.tgz\" | sha256sum -c -; tar -C /usr/local -xzf /tmp/go.tgz; rm /tmp/go.tgz; apt-get clean; rm -rf /var/lib/apt/lists/*" did not complete successfully: exit code: 100; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no data at rest for these controls to protect. If it does persist personal data (through a hosted backend configured outside this repository, for instance), the controls belong to wherever that data is stored.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a hosted backend configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound. If it does (through a hosted backend configured outside this repository, for instance), the limit belongs wherever that data is stored.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over. If it does (through a hosted backend configured outside this repository, for instance), the rights are served wherever that data is stored.
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.mjs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — 22 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
DM1 Domain Modelling — not scored — this repository shows none of the 2 signals this lens looks for
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Go, JavaScript/TypeScript source, so there is no service whose uptime a failing dependency could take down
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — coverage data present for 425 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X27 Collection changed while being enumerated — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
AC2 · Forms & labels· <input> without a programmatic label · ×13
<input> without a programmatic label web/src/components/apply-view.tsx:41— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label web/src/components/config-form.tsx:264— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label web/src/components/explore/results-list.tsx:52— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label web/src/components/followups/followups-view.tsx:222— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label web/src/components/inbox/facet-chips.tsx:54— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label web/src/components/inbox/facet-chips.tsx:99— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label web/src/components/pipeline-view.tsx:185— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label web/src/components/quick-evaluate.tsx:31— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label web/src/components/scheduled-jobs-view.tsx:286— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label web/src/components/scheduled-scans/create-job-modal.tsx:80— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label web/src/components/scheduled-scans/create-job-modal.tsx:112— This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label web/src/components/scheduled-scans/edit-job-modal.tsx:104— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label web/src/components/scheduled-scans/edit-job-modal.tsx:131— This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC2 · Forms & labels· <label> that labels no control · ×11
<label> that labels no control web/src/components/config-form.tsx:111— This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control web/src/components/config-form.tsx:238— This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control web/src/components/config-form.tsx:260— This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control web/src/components/config-form.tsx:287— This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control web/src/components/followups/cadence-settings.tsx:117— This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control web/src/components/scheduled-scans/create-job-modal.tsx:79— This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control web/src/components/scheduled-scans/create-job-modal.tsx:93— This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control web/src/components/scheduled-scans/create-job-modal.tsx:110— This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control web/src/components/scheduled-scans/edit-job-modal.tsx:103— This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control web/src/components/scheduled-scans/edit-job-modal.tsx:117— This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control web/src/components/scheduled-scans/edit-job-modal.tsx:129— This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
AC2 · Forms & labels· <textarea> without a programmatic label · ×5
<textarea> without a programmatic label web/src/components/beta/beta-banner.tsx:110— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<textarea> without a programmatic label web/src/components/cv-editor.tsx:82— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<textarea> without a programmatic label web/src/components/cv/cv-ingest.tsx:200— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<textarea> without a programmatic label web/src/components/cv/cv-ingest.tsx:292— This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<textarea> without a programmatic label web/src/components/explore/ai-search-box.tsx:57— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
AC2 · Forms & labels· <select> without a programmatic label · ×4
<select> without a programmatic label web/src/components/scheduled-scans/create-job-modal.tsx:94— This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<select> without a programmatic label web/src/components/scheduled-scans/create-job-modal.tsx:119— This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<select> without a programmatic label web/src/components/scheduled-scans/edit-job-modal.tsx:118— This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<select> without a programmatic label web/src/components/scheduled-scans/edit-job-modal.tsx:138— This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC2 · Forms & labels· <button> with no accessible text · ×3
<button> with no accessible text web/src/components/scheduled-scans/create-job-modal.tsx:65— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text web/src/components/scheduled-scans/edit-job-modal.tsx:89— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text web/src/components/scheduled-scans/run-history-drawer.tsx:29— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
AC4 · Keyboard semantics· Click handler on a non-interactive <div> · ×1
Click handler on a non-interactive <div> web/src/components/mobile-nav.tsx:127— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
Hotspot: REDACTED REDACTED:3989— REDACTED changed 84 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 280 in scan.main at line 3989. 52 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:4515— REDACTED changed 223 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 104 in update-system.apply at line 4515. 89 of those changes were fix/bug commits, and the other 134 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: merge-tracker.mjs merge-tracker.mjs:328— merge-tracker.mjs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 370 in merge-tracker.mergeTracker at line 328. 43 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- merge-tracker.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: scan-ats-full.mjs scan-ats-full.mjs:1156— scan-ats-full.mjs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 165 in scan-ats-full.main at line 1156. 25 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- scan-ats-full.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: web/src/components/assistant-console.tsx web/src/components/assistant-console.tsx:142— web/src/components/assistant-console.tsx changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 243 in assistant-console.AssistantConsole at line 142. 8 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- web/src/components/assistant-console.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: analyze-patterns.mjs analyze-patterns.mjs:433— analyze-patterns.mjs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 111 in analyze-patterns.runSelfTest at line 433. 15 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- analyze-patterns.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: web/src/app/api/run/route.ts web/src/app/api/run/route.ts:33— web/src/app/api/run/route.ts changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 97 in route.POST at line 33. 24 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- web/src/app/api/run/route.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: build-cv-html.mjs build-cv-html.mjs:1108— build-cv-html.mjs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in build-cv-html.runSelfTest at line 1108. 13 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- build-cv-html.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:1577— REDACTED changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in generate-pdf.generatePDF at line 1577. 30 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:683— REDACTED changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in data.NormalizeStatus at line 683. 19 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: followup-cadence.mjs followup-cadence.mjs:704— followup-cadence.mjs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in followup-cadence.extractContacts at line 704. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- followup-cadence.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: validate-portals.mjs validate-portals.mjs:190— validate-portals.mjs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in validate-portals.validatePortalsConfig at line 190. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- validate-portals.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: dashboard/internal/ui/screens/pipeline.go dashboard/internal/ui/screens/pipeline.go:564— dashboard/internal/ui/screens/pipeline.go changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in PipelineModel.handleKey at line 564. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- dashboard/internal/ui/screens/pipeline.go`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: web/src/components/pipeline-view.tsx web/src/components/pipeline-view.tsx:30— web/src/components/pipeline-view.tsx changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in pipeline-view.PipelineView at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- web/src/components/pipeline-view.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:746— REDACTED changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in salary-gap.selfTest at line 746. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: web/src/components/explore/explore-provider.tsx web/src/components/explore/explore-provider.tsx:132— web/src/components/explore/explore-provider.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 144 in explore-provider.ExploreProvider at line 132. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- web/src/components/explore/explore-provider.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: doctor.mjs doctor.mjs:1408— doctor.mjs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in doctor.onboardingState at line 1408. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- doctor.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:2937— REDACTED changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in verify-cv-facts.runCli at line 2937. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: stats.mjs stats.mjs:394— stats.mjs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in stats.computePortalRecommendations at line 394. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- stats.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: liveness-browser.mjs liveness-browser.mjs:469— liveness-browser.mjs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in liveness-browser.checkUrlLiveness at line 469. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- liveness-browser.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: web/src/components/home/today-dashboard.tsx web/src/components/home/today-dashboard.tsx:28— web/src/components/home/today-dashboard.tsx changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in today-dashboard.TodayDashboard at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- web/src/components/home/today-dashboard.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: web/src/components/report-view.tsx web/src/components/report-view.tsx:48— web/src/components/report-view.tsx changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in report-view.ReportView at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- web/src/components/report-view.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: upskill.mjs upskill.mjs:584— upskill.mjs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in upskill.runSelfTest at line 584. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- upskill.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: web/src/app/api/assistant/route.ts web/src/app/api/assistant/route.ts:43— web/src/app/api/assistant/route.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in route.POST at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- web/src/app/api/assistant/route.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: web/src/app/api/explore/ai/route.ts web/src/app/api/explore/ai/route.ts:48— web/src/app/api/explore/ai/route.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in route.POST at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- web/src/app/api/explore/ai/route.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: REDACTED REDACTED:2735— REDACTED changed 272 times in last 90 days and 138 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is test-all.extractRenderHtmlToPdfOptions at line 2735), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(update-system): rebuild the dashboard on REDACTED/go.sum changes, as career-dashboard.exe on Windows (#5637)”; “fix(web): name the resolved profile path in agent prompts under CAREER_OPS_PROFILE (#5588)”; “fix(tests): fail the absolute-path check when git grep itself fails (#5576)”; “fix(tests): read the smoke loop's declared expectExit (#5579)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: tracker-utils.mjs tracker-utils.mjs:76— tracker-utils.mjs changed 32 times in last 90 days and 24 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is tracker-utils.findDeadReportLink at line 76), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(add-entry,fix-slugs): replace cv.md and portals.yml atomically (#5552)”; “fix(status): run set-status's hooks for reply-watch and dedup-tracker status changes (#5536) (#5538)”; “fix(tracker): read report links through the shared parser so parentheses survive (#5482) (#5483)”; “fix: treat comment-only YAML config as empty instead of crashing (#5464)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- tracker-utils.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: verify-pipeline.mjs verify-pipeline.mjs:324— verify-pipeline.mjs changed 25 times in last 90 days and 17 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is verify-pipeline.extractRole at line 324), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(tracker): read report links through the shared parser so parentheses survive (#5482) (#5483)”; “fix: treat comment-only YAML config as empty instead of crashing (#5464)”; “fix(tracker): resolve report links from a symlinked tracker's own folder (#5374) (#5375)”; “fix(tracker): unwrap report URL tokens before trailing punctuation (#5309)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- verify-pipeline.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: set-status.mjs set-status.mjs:448— set-status.mjs changed 30 times in last 90 days and 16 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is set-status.resolveRow at line 448), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(status): run set-status's hooks for reply-watch and dedup-tracker status changes (#5536) (#5538)”; “fix(tracker): read report links through the shared parser so parentheses survive (#5482) (#5483)”; “fix(status): stop web and dashboard Interview moves timing out on the JD archive (#5487)”; “fix(set-status): warn when a row leaves a terminal state (#5211)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- set-status.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: dedup-tracker.mjs dedup-tracker.mjs:282— dedup-tracker.mjs changed 18 times in last 90 days and 15 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is dedup-tracker.roleMatch at line 282), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(status): run set-status's hooks for reply-watch and dedup-tracker status changes (#5536) (#5538)”; “fix(dedup): match corporate-form suffix twins in dedup-tracker.mjs (#4487)”; “fix(tracker): read decimal-comma scores in merge and dedup (#5208)”; “fix(tracker): a language param on one URL is not proof of two postings (#5283)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- dedup-tracker.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: pipeline-lock.mjs pipeline-lock.mjs:59— pipeline-lock.mjs changed 15 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 11 (its worst body is pipeline-lock.acquirePipelineLock at line 59), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(locks): one directory-lock protocol in lib/dir-lock.mjs, used by every core lock (#5389)”; “fix(pipeline-lock): make OWNERLESS_GRACE_MS env-overridable, fixing flaky test 16 (#4557)”; “fix(lock): clamp the retry backoff to the per-holder deadline (#4402)”; “fix(locks): share the waiting half of the protocol with the three lock copies”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- pipeline-lock.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: batch-evaluate-gemini.mjs batch-evaluate-gemini.mjs:262— batch-evaluate-gemini.mjs changed 13 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is batch-evaluate-gemini.processOffer at line 262), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(eval): pass modes/_custom.md to the standalone evaluators (#5754)”; “fix(eval): archive the verbatim JD in gemini, batch-gemini and openrouter reports (#5671)”; “fix(batch): drop stray bot comments from Gemini report headers (#5550)”; “fix(paths): read the profile through one CAREER_OPS_PROFILE-aware helper in the remaining core modules (#5095)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- batch-evaluate-gemini.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: REDACTED REDACTED:302— REDACTED changed 13 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is gemini-eval.validateEvaluationShape at line 302), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(eval): pass modes/_custom.md to the standalone evaluators (#5754)”; “fix(eval): archive the verbatim JD in gemini, batch-gemini and openrouter reports (#5671)”; “fix: treat comment-only YAML config as empty instead of crashing (#5464)”; “fix(paths): read the profile through one CAREER_OPS_PROFILE-aware helper in the remaining core modules (#5095)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: web/src/lib/run-prompts.mjs web/src/lib/run-prompts.mjs:107— web/src/lib/run-prompts.mjs changed 11 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is run-prompts.buildPrompt at line 107), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(web): name the resolved profile path in agent prompts under CAREER_OPS_PROFILE (#5588)”; “fix(web): deny Write/Bash when evaluating untrusted JDs (#3629)”; “fix(web): preserve report identity when generating tailored PDFs (#4104)”; “fix(web): resolve the CV template from cv.template on dashboard runs (#4035)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- web/src/lib/run-prompts.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: openai-eval.mjs openai-eval.mjs:238— openai-eval.mjs changed 12 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is openai-eval.readFile at line 238), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(eval): pass modes/_custom.md to the standalone evaluators (#5754)”; “fix(paths): read the profile through one CAREER_OPS_PROFILE-aware helper in the remaining core modules (#5095)”; “fix(openai-eval): pass modes/_profile.md to buildBudgetedPrompt (#5202)”; “fix: use model-aware MiniMax context budgets (#4650)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- openai-eval.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: outcome.mjs outcome.mjs:604— outcome.mjs changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 5 (its worst body is outcome.archivedCopyVerified at line 604), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(outcome): reject a missing explicitly selected CV artifact (#5273)”; “fix(outcome): journal a status only after tracker confirmation (#5272)”; “fix(outcome,tracker): stamp the local calendar day, not the UTC one (#3989) (#3990)”; “fix(set-status): the canonical tracker write path cannot find a configured tracker (#3987) (#3988)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- outcome.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: ollama-eval.mjs ollama-eval.mjs:181— ollama-eval.mjs changed 8 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is ollama-eval.readFile at line 181), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(eval): pass modes/_custom.md to the standalone evaluators (#5754)”; “fix(paths): read the profile through one CAREER_OPS_PROFILE-aware helper in the remaining core modules (#5095)”; “fix(eval): date reports with the local calendar day, not the UTC one (#4227)”; “refactor(eval): single-source the tracker-addition helpers, and fix the fifth site no copy-scan could find (#3796) (#3906)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- ollama-eval.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: web/src/app/actions/registry.ts web/src/app/actions/registry.ts:76— web/src/app/actions/registry.ts changed 10 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is registry.coerceProfile at line 76), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(web): show when the assistant's profile or scan-target write fails (#5641)”; “fix(web): confirm before remember writes to the profile (#5456)”; “fix(web): preserve failed status confirmations for human retry (#5422)”; “fix(web): label padded application numbers in assistant actions (#5157)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- web/src/app/actions/registry.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: web/src/lib/clis.ts web/src/lib/clis.ts:79— web/src/lib/clis.ts changed 10 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 5 (its worst body is clis.searchDirs at line 79), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(web): fall back from a stale saved cliId on every AI route, not just Run (#4638)”; “fix(web): give grok a parser, and make the token fold per-CLI (#2689)”; “fix(web): find Grok in its default install dirs, not only on PATH”; “fix(web): keep Codex JSONL + exit code authoritative for web scoring (#2102)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- web/src/lib/clis.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: find.mjs find.mjs:161— find.mjs changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is find.findMatches at line 161), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(tracker): read report links through the shared parser so parentheses survive (#5482) (#5483)”; “fix(tracker): keep the pdf check when a re-eval's prior pdf is still on disk (#5128)”; “fix(sync-pdf-flags): set the PDF flag only while the CV PDF is on disk (#4777) (#4565)”; “fix(generate-pdf): key the PDF manifest on report number and artifact kind (#3959)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- find.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: web/src/lib/cli-fencing.mjs web/src/lib/cli-fencing.mjs:239— web/src/lib/cli-fencing.mjs changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 5 (its worst body is cli-fencing.assertCodexArgvUnfenced at line 239), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(web): normalize Codex config keys and stop the probe hanging on a held pipe”; “fix(web): tighten Codex fencing validation”; “fix(web): harden post-merge fencing checks”; “fix(web): make the fencing probe suite portable, and close two scan gaps”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- web/src/lib/cli-fencing.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: theme-style.mjs theme-style.mjs:97— theme-style.mjs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is theme-style.readLockedSections at line 97), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: treat comment-only YAML config as empty instead of crashing (#5464)”; “fix(paths): read the profile through one CAREER_OPS_PROFILE-aware helper in the remaining core modules (#5095)”; “fix(templates): make job_break_inside an opt-in style token (#3789)”; “fix(templates): make the CV template's second hardcoded color themeable (#3699)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- theme-style.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: web/src/app/analytics/page.tsx web/src/app/analytics/page.tsx:13— web/src/app/analytics/page.tsx changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 3 (its worst body is page.Analytics at line 13), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(web): stop the analytics page parsing scan-history it never uses (#5492)”; “fix(funnel): retain replies and historical stages across surfaces (#4374)”; “fix(web): pluralize the Analytics evaluation count (#3161)”; “fix(web): analytics tells an offer-holder they have 0 interviews (and nudges them to try harder) (#2410)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- web/src/app/analytics/page.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: cv-sections-core.mjs cv-sections-core.mjs:160— cv-sections-core.mjs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 5 (its worst body is cv-sections-core.isEmptySection at line 160), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(cv): drop the summary block when the summary is empty (#5021)”; “fix(pdf): drop optional sections that arrive as a bare header (#3997)”; “fix(cv): an empty Skills section no longer deletes the sections after it”; “fix(cv): drop empty Skills section instead of rendering a bare header (#2516)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- cv-sections-core.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: providers/greenhouse.mjs providers/greenhouse.mjs:128— providers/greenhouse.mjs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is greenhouse.buildOfficeMap at line 128), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(greenhouse): resolve legacy boards.greenhouse.io careers_url (#4195)”; “fix(providers): read greenhouse embed slug, support myworkdaysite boards (#4515)”; “fix(scan): opt-in location-aware company+role dedupe (#3751)”; “fix(greenhouse): populate job.description from the boards API content field (#3175)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- providers/greenhouse.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: validate-system-paths-coverage.mjs validate-system-paths-coverage.mjs:116— validate-system-paths-coverage.mjs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 6 (its worst body is validate-system-paths-coverage.covered at line 116), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(updater): ship user-directory scaffolds safely (#4741)”; “fix(updater): drop SIGNATURES.md from SYSTEM_PATHS so a new signature stops reading as system drift (#4074)”; “fix(coverage): exclude the local-paths declaration file so a fork can commit it”; “fix(update): reconcile .gitignore on apply so new ignore rules reach existing installs (#2857)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- validate-system-paths-coverage.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: openai-tailor.mjs openai-tailor.mjs:162— openai-tailor.mjs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 3 (its worst body is openai-tailor.readFile at line 162), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(tailor): keep generated CVs distinct per application report (#5439)”; “fix: treat comment-only YAML config as empty instead of crashing (#5464)”; “fix(paths): read the profile through one CAREER_OPS_PROFILE-aware helper in the remaining core modules (#5095)”; “fix(deps): make js-yaml imports work on both 4.x and 5.x (#2656)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- openai-tailor.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: story-provenance-check.mjs story-provenance-check.mjs:729— story-provenance-check.mjs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 11 (its worst body is story-provenance-check.runSelfTest at line 729), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(story-provenance): check story-bank figures by unit and sentence, and keep user-cannot-confirm figures out of negotiation, ATS and interview output (#5355)”; “fix(cli): --help was discarded, so the script ran instead (#3998)”; “fix(story-bank): stories an evaluation adds aren't invisible to npm run star anymore (#4684)”; “fix(story-provenance): anchor the Provenance marker to the start of its line (#4865)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- story-provenance-check.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: match-star.mjs match-star.mjs:178— match-star.mjs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 11 (its worst body is match-star.formatAts at line 178), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(story-provenance): check story-bank figures by unit and sentence, and keep user-cannot-confirm figures out of negotiation, ATS and interview output (#5355)”; “fix(story-bank): stories an evaluation adds aren't invisible to npm run star anymore (#4684)”; “fix(story-bank): three readers, three roots — and a safety gate split across two (#3985)”; “fix(match-star): score a non-English story bank against a question in its own language (#2848)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- match-star.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: providers/phenom.mjs providers/phenom.mjs:75— providers/phenom.mjs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is phenom.resolveConfig at line 75), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(providers): tag page-cap and failed-page truncation on eightfold, jibeapply, phenom, rippling, pageup, join (#5327)”; “fix(providers): a lone surrogate in one id/slug no longer aborts the whole page”; “fix(providers): decode HTML entities in titles before matching so encoded ampersands stop dropping jobs (#2923)”; “fix(providers): phenom pagination/retry fixes, drop dead auto-detection (#2669)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 11:03:49 +00:00' --until='2026-10-24 11:03:49 +00:00' --full-history --no-merges -- providers/phenom.mjs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
FunctionTooLong: merge-tracker.mergeTracker merge-tracker.mjs:328— FunctionTooLong — mergeTracker runs 831 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 731 over it, 8.31× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: scan-ats-full.main scan-ats-full.mjs:1156— FunctionTooLong — main runs 423 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 323 over it, 4.23× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: explore-provider.ExploreProvider web/src/components/explore/explore-provider.tsx:132— FunctionTooLong — ExploreProvider runs 413 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 313 over it, 4.13× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: company-history.runSelfTest company-history.mjs:992— FunctionTooLong — runSelfTest runs 394 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 294 over it, 3.94× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: check-jd-archive.runSelfTest check-jd-archive.mjs:680— FunctionTooLong — runSelfTest runs 346 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 246 over it, 3.46× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: pipeline-view.PipelineView web/src/components/pipeline-view.tsx:30— FunctionTooLong — PipelineView runs 335 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 235 over it, 3.35× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: route.POST web/src/app/api/run/route.ts:33— FunctionTooLong — POST runs 300 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 200 over it, 3.00× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: apply-provider.ApplyProvider web/src/components/apply/apply-provider.tsx:61— FunctionTooLong — ApplyProvider runs 285 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 185 over it, 2.85× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: build-cv-html.runSelfTest build-cv-html.mjs:1108— FunctionTooLong — runSelfTest runs 279 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 179 over it, 2.79× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: analyze-patterns.runSelfTest analyze-patterns.mjs:433— FunctionTooLong — runSelfTest runs 276 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 176 over it, 2.76× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: scheduled-jobs-view.ScheduledJobsView web/src/components/scheduled-jobs-view.tsx:47— FunctionTooLong — ScheduledJobsView runs 260 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 160 over it, 2.60× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: today-dashboard.TodayDashboard web/src/components/home/today-dashboard.tsx:28— FunctionTooLong — TodayDashboard runs 253 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 153 over it, 2.53× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: funnel-velocity.selfTest funnel-velocity.mjs:527— FunctionTooLong — selfTest runs 249 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 149 over it, 2.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: verify-cv-structure.runSelfTest verify-cv-structure.mjs:300— FunctionTooLong — runSelfTest runs 244 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 144 over it, 2.44× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: cv-ingest.CvIngest web/src/components/cv/cv-ingest.tsx:31— FunctionTooLong — CvIngest runs 243 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 143 over it, 2.43× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: config-form.ConfigForm web/src/components/config-form.tsx:38— FunctionTooLong — ConfigForm runs 241 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 141 over it, 2.41× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: route.POST web/src/app/api/explore/ai/route.ts:48— FunctionTooLong — POST runs 239 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 139 over it, 2.39× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: cv-title-check.runSelfTest cv-title-check.mjs:328— FunctionTooLong — runSelfTest runs 233 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 133 over it, 2.33× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: report-view.ReportView web/src/components/report-view.tsx:48— FunctionTooLong — ReportView runs 204 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 104 over it, 2.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: followups-view.FollowupsView web/src/components/followups/followups-view.tsx:86— FunctionTooLong — FollowupsView runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 101 over it, 2.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: explorer-view.ExplorerView web/src/components/explore/explorer-view.tsx:33— FunctionTooLong — ExplorerView runs 187 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 87 over it, 1.87× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: weekly-digest.runSelfTest weekly-digest.mjs:393— FunctionTooLong — runSelfTest runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: analyze-patterns.analyze analyze-patterns.mjs:1352— FunctionTooLong — analyze runs 176 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 76 over it, 1.76× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: validate-portals.validatePortalsConfig validate-portals.mjs:190— FunctionTooLong — validatePortalsConfig runs 172 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 72 over it, 1.72× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: job-card.JobCard web/src/components/scheduled-scans/job-card.tsx:9— FunctionTooLong — JobCard runs 172 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 72 over it, 1.72× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
Sync-over-async blocking archive-posting.mjs:273— `existsSync` in `extractPipelineEntries` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking archive-posting.mjs:414— `mkdirSync` in `archiveUrl` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking batch-evaluate-gemini.mjs:325— `mkdirSync` in `processOffer` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking batch-evaluate-gemini.mjs:326— `mkdirSync` in `processOffer` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking batch-evaluate-gemini.mjs:355— `writeFileSync` in `processOffer` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking batch-evaluate-gemini.mjs:365— `writeFileSync` in `processOffer` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking batch-evaluate-gemini.mjs:405— `readFileSync` in `callback to withPipelineLock` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking batch-evaluate-gemini.mjs:409— `writeFileSync` in `callback to withPipelineLock` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking batch-evaluate-gemini.mjs:424— `existsSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking batch-evaluate-gemini.mjs:429— `readFileSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking batch-evaluate-gemini.mjs:455— `execFileSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking generate-cover-letter.mjs:462— `existsSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking generate-cover-letter.mjs:467— `readFileSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking generate-cover-letter.mjs:486— `existsSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking generate-cover-letter.mjs:486— `mkdirSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking REDACTED:1499— `mkdirSync` in `updatePDFManifest` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking REDACTED:1506— `existsSync` in `callback to withPipelineLock` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking REDACTED:1507— `readFileSync` in `callback to withPipelineLock` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking REDACTED:1999— `writeFileSync` in `runBatchFromManifest` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking REDACTED:2181— `mkdirSync` in `renderInPage` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking img-to-pdf.mjs:231— `existsSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking img-to-pdf.mjs:236— `existsSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking intake.mjs:365— `mkdirSync` in `commitState` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking intake.mjs:478— `existsSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking intake.mjs:486— `readFileSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
R4 · Test Coverage· No test reaches this file · ×37
No test reaches this file build-cv-html.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file jd-skill-gap.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file REDACTED:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file upskill.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file REDACTED:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file rejection-latency.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file weekly-digest.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file verify-cv-structure.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file REDACTED:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file web/src/app/api/run/route.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file web/src/components/apply-view.tsx:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file closing-soon.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file build-cv-latex.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file openai-eval.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file assessment-log.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file web/src/components/followups/followups-view.tsx:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file ollama-eval.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file intake.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file REDACTED:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file REDACTED:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file reeval-candidates.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file providers/ultipro.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file providers/adp-workforcenow.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file providers/gupy.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file providers/techinasia.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
Swallowed exception (empty catch) REDACTED:184— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) verify-pipeline.mjs:296— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) verify-pipeline.mjs:366— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) upskill.mjs:938— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:787— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:1148— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:1420— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:1560— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:1946— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:2005— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:2353— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:2491— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:2507— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:2535— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:2614— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:2928— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:2929— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:3086— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:3791— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:3835— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:3895— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:3966— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:3974— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:3986— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:4155— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
FileTooLong: ./REDACTED REDACTED— FileTooLong — 2440 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 1940 over it, 4.88× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./REDACTED REDACTED— FileTooLong — 2297 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 1797 over it, 4.59× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: screens/pipeline.go dashboard/internal/ui/screens/pipeline.go— FileTooLong — 1538 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: PipelineModel (58 blocks, 287-2447). The bar is 500 significant lines; this is 1038 over it, 3.08× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: ./REDACTED REDACTED— FileTooLong — 1334 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 834 over it, 2.67× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./analyze-patterns.mjs analyze-patterns.mjs— FileTooLong — 1080 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 580 over it, 2.16× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./REDACTED REDACTED— FileTooLong — 1075 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 575 over it, 2.15× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./REDACTED REDACTED— FileTooLong — 1029 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 529 over it, 2.06× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./scan-ats-full.mjs scan-ats-full.mjs— FileTooLong — 986 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 486 over it, 1.97× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./build-cv-html.mjs build-cv-html.mjs— FileTooLong — 973 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 473 over it, 1.95× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./merge-tracker.mjs merge-tracker.mjs— FileTooLong — 934 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 89% of them inside a single declaration: mergeTracker (328-2367). The bar is 500 significant lines; this is 434 over it, 1.87× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: components/assistant-console.tsx web/src/components/assistant-console.tsx— FileTooLong — 900 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 400 over it, 1.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./company-history.mjs company-history.mjs— FileTooLong — 892 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 392 over it, 1.78× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./doctor.mjs doctor.mjs— FileTooLong — 839 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 339 over it, 1.68× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./REDACTED REDACTED— FileTooLong — 774 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 274 over it, 1.55× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 745 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 245 over it, 1.49× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./verify-ats.mjs verify-ats.mjs— FileTooLong — 703 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 203 over it, 1.41× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./tracker.mjs tracker.mjs— FileTooLong — 698 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 198 over it, 1.40× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: i18n/catalog.go dashboard/internal/i18n/catalog.go— FileTooLong — 677 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 177 over it, 1.35× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./jd-skill-gap.mjs jd-skill-gap.mjs— FileTooLong — 668 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 168 over it, 1.34× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./check-jd-archive.mjs check-jd-archive.mjs— FileTooLong — 658 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 158 over it, 1.32× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./discover-ats.mjs discover-ats.mjs— FileTooLong — 638 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 138 over it, 1.28× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: screens/viewer.go dashboard/internal/ui/screens/viewer.go— FileTooLong — 637 significant lines (blank, comment-only and punctuation-only lines excluded), about 67% of them inside a single declaration: ViewerModel (23 blocks, 35-986). The bar is 500 significant lines; this is 137 over it, 1.27× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: ./funnel-velocity.mjs funnel-velocity.mjs— FileTooLong — 577 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 77 over it, 1.15× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./openrouter-runner.mjs openrouter-runner.mjs— FileTooLong — 572 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 72 over it, 1.14× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ./REDACTED REDACTED— FileTooLong — 549 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 49 over it, 1.10× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
Focus outline removed inline web/src/components/apply-view.tsx:41— <input> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/config-form.tsx:264— <input> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/cv-editor.tsx:82— <textarea> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/cv-studio/section-card.tsx:146— <textarea> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/cv-studio/section-card.tsx:255— <input> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/cv/cv-ingest.tsx:200— <textarea> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/cv/cv-ingest.tsx:292— <textarea> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/explore/results-list.tsx:52— <input> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/inbox/facet-chips.tsx:99— <input> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/quick-evaluate.tsx:31— <input> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/scheduled-jobs-view.tsx:286— <input> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/scheduled-scans/create-job-modal.tsx:94— <select> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/scheduled-scans/create-job-modal.tsx:112— <input> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/scheduled-scans/create-job-modal.tsx:119— <select> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/scheduled-scans/edit-job-modal.tsx:118— <select> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/scheduled-scans/edit-job-modal.tsx:131— <input> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Focus outline removed inline web/src/components/scheduled-scans/edit-job-modal.tsx:138— <select> takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2).
Low coverage: doctor.mjs doctor.mjs:1— 27.9% line coverage (422/1511).
Low coverage: jsonc-parse.mjs jsonc-parse.mjs:1— 39.7% line coverage (46/116).
Low coverage: liveness-browser.mjs liveness-browser.mjs:1— 38.4% line coverage (311/809).
Low coverage: plugins/_engine.mjs plugins/_engine.mjs:1— 39.0% line coverage (317/812).
Low coverage: plugins/_lock.mjs plugins/_lock.mjs:1— 38.5% line coverage (72/187).
Low coverage: plugins/_net.mjs plugins/_net.mjs:1— 36.9% line coverage (41/111).
Low coverage: plugins/_registry.mjs plugins/_registry.mjs:1— 46.6% line coverage (68/146).
Low coverage: web/src/lib/apply/agent-interpret.ts web/src/lib/apply/agent-interpret.ts:1— 26.8% line coverage (53/198).
Low coverage: web/src/lib/apply/diagnose.ts web/src/lib/apply/diagnose.ts:1— 28.7% line coverage (79/275).
Low coverage: web/src/lib/apply/extract.ts web/src/lib/apply/extract.ts:1— 11.5% line coverage (22/191).
Low coverage: web/src/lib/apply/greenhouse.ts web/src/lib/apply/greenhouse.ts:1— 39.1% line coverage (27/69).
Low coverage: web/src/lib/apply/session.ts web/src/lib/apply/session.ts:1— 26.6% line coverage (158/594).
Low coverage: web/src/lib/core/scan.ts web/src/lib/core/scan.ts:1— 25.9% line coverage (115/444).
Low coverage: web/src/lib/cv-studio/server.ts web/src/lib/cv-studio/server.ts:1— 42.0% line coverage (79/188).
AC3 · Page structure· Page without a main landmark · ×10
Page without a main landmark REDACTED:7— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark templates/cover-letter-template.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark REDACTED:6— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark REDACTED:6— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark REDACTED:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark REDACTED:6— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark REDACTED:6— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark REDACTED:6— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark REDACTED:6— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark REDACTED:16— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Boundary violation [package:relative-cross-package] doctor.mjs:20— doctor.mjs:20 reaches into another package with a relative path (./scaffolder/bin/skill-entrypoints.mjs) — import the package by name instead.
Boundary violation [package:relative-cross-package] REDACTED:11— REDACTED:11 reaches into another package with a relative path (../web/src/lib/bind-host.mjs) — import the package by name instead.
Boundary violation [package:test-suite-dependency] REDACTED:71— REDACTED:71 imports tests/helpers.mjs, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
Boundary violation [package:test-suite-dependency] REDACTED:76— REDACTED:76 imports tests/evaluation-mode-parity-helpers.mjs, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
Boundary violation [package:test-suite-dependency] REDACTED:79— REDACTED:79 imports tests/data-root-guard.mjs, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
Boundary violation [package:relative-cross-package] REDACTED:4031— REDACTED:4031 reaches into another package with a relative path (./scaffolder/bin/skill-entrypoints.mjs) — import the package by name instead.
Boundary violation [package:relative-cross-package] REDACTED:5150— REDACTED:5150 reaches into another package with a relative path (./scaffolder/bin/skill-entrypoints.mjs) — import the package by name instead.
Boundary violation [package:relative-cross-package] web/scripts/scheduled-jobs-runner.mjs:15— web/scripts/scheduled-jobs-runner.mjs:15 reaches into another package with a relative path (../../lib/is-main-module.mjs) — import the package by name instead.
Boundary violation [package:relative-cross-package] web/scripts/scheduled-jobs-runner.mjs:17— web/scripts/scheduled-jobs-runner.mjs:17 reaches into another package with a relative path (../../path-resolver.mjs) — import the package by name instead.
Boundary violation [package:relative-cross-package] web/src/lib/cv-studio/base-cv.mjs:11— web/src/lib/cv-studio/base-cv.mjs:11 reaches into another package with a relative path (../../../../REDACTED) — import the package by name instead.
Fake-async — async method never awaits application-answers.mjs:539— `main` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work.
Fake-async — async method never awaits application-artifacts.mjs:135— `main` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work.
Fake-async — async method never awaits REDACTED:975— `selfTest` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work.
Fake-async — async method never awaits plugins.mjs:383— `cmdAvailable` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work.
Fake-async — async method never awaits plugins.mjs:494— `cmdAdd` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work.
Fake-async — async method never awaits weekly-digest.mjs:393— `runSelfTest` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work.
Weak hash algorithm contacts.mjs:217— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`createHash("sha256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm fingerprint-core.mjs:72— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`createHash("sha256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm plugins/apify/index.mjs:79— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`createHash("sha256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm plugins/apify/index.mjs:125— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`createHash("sha256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm scan-ats-full.mjs:246— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`createHash("sha256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Weak hash algorithm session-activity.mjs:62— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`createHash("sha256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
X2 · Cancellation propagation· Async function without AbortSignal · ×6
Async function without AbortSignal: fetchJson scan-hn.mjs:124— `fetchJson` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: loadFreeModels openrouter-runner.mjs:125— `loadFreeModels` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: fetchJobPage openrouter-runner.mjs:453— `fetchJobPage` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: cmdScan openrouter-runner.mjs:632— `cmdScan` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: avatarDataUri hired-wall-build.mjs:131— `avatarDataUri` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: collect web/src/lib/report/report.ts:46— `collect` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Swallowed exception (caught, then discarded) weekly-digest.mjs:159— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) validate-untrusted-content-coverage.mjs:126— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) url-key.mjs:280— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:1546— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:2205— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:4416— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
No assertions: acquirePipelineLock: an ownerless lock older than the grace floor is still reclaimable (#2304) tests/pipeline-lock.test.mjs:252— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: the lock is released on a throwing path, not just the happy one web/tests/lib/tracker-lock.test.mjs:126— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: a slow posting does not block an independent posting web/tests/lib/inbox-skip-client.test.mjs:78— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: assertSafeApplyUrl: allows a public host when DNS is public (mocked) web/tests/lib/apply-url-guard.test.mjs:118— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
AC3 · Page structure· Heading level jumps from h1 to h3 · ×3
Heading level jumps from h1 to h3 web/src/app/documents/page.tsx:108— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
Heading level jumps from h1 to h3 web/src/components/home/today-dashboard.tsx:286— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
Heading level jumps from h1 to h3 web/src/components/scheduled-jobs-view.tsx:300— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
AC4 · Keyboard semantics· Modal dialog does not manage focus · ×3
Modal dialog does not manage focus web/src/components/beta/beta-banner.tsx:101— This <div role="dialog"> is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close.
Modal dialog does not manage focus web/src/components/followups/log-dialog.tsx:84— This <div role="dialog"> is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close.
Modal dialog does not manage focus web/src/components/followups/next-date-dialog.tsx:76— This <div role="dialog"> is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close.
route.POST (cyclomatic 16) REDACTED:18— route.POST has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
route.POST (cyclomatic 16) REDACTED:31— route.POST has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 70). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
route.POST (cyclomatic 16) REDACTED:21— route.POST has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
mergeTracker::mergeUnderLock (cognitive 236) merge-tracker.mjs:1334— mergeTracker::mergeUnderLock has cognitive complexity 236 (threshold 15). Drivers by points: if/else 79 (146 pts), ternaries 16 (42 pts), boolean chains 29, loops 7 (14 pts), error handling 2 (4 pts), other 1 (nesting depth added 102). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mergeTracker::parseTsvContent (cognitive 31) merge-tracker.mjs:1203— mergeTracker::parseTsvContent has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, other 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mergeTracker::buildRow (cognitive 17) merge-tracker.mjs:850— mergeTracker::buildRow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 1 (2 pts), other 2, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
R4 · Test Coverage· This test file cannot be loaded · ×3
This test file cannot be loaded web/tests/lib/json-body.test.mjs:22— web/tests/lib/json-body.test.mjs:22 imports '../../src/app/api', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded web/tests/lib/profile-input-validation.test.mjs:10— web/tests/lib/profile-input-validation.test.mjs:10 imports '../../src/', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded web/tests/lib/profile-write-shape.test.mjs:12— web/tests/lib/profile-write-shape.test.mjs:12 imports '../../src/', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
X17 · Uncapped recursion over a caller-supplied document· Recursive walk over a caller-supplied document has no depth cap · ×3
Recursive walk over a caller-supplied document has no depth cap plugins/gmail/_helpers.mjs:248— `getMessageBody` is exported and takes `payload: object` from its caller, and it calls itself at line 248 (`getMessageBody`) with a piece of `payload` — and nowhere in `getMessageBody` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `getMessageBody` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap providers/greenhouse.mjs:146— `buildOfficeMap` is exported, takes a document from its caller (line 128) and hands it to `walk`, which calls itself at line 146 (`walk`) with a piece of `offices` — and nowhere in `walk` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `walk` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap providers/eploy.mjs:170— `parseEployDetail` is exported, takes a document from its caller (line 181) and hands it to `flattenJsonLd`, which calls itself at line 170 (`flattenJsonLd`) with a piece of `value` (and at line 172) — and nowhere in `flattenJsonLd` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `flattenJsonLd` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
X24 · Document value interpolated into markup unescaped· Untrusted text written into markup unescaped · ×3
Untrusted text written into markup unescaped build-cv-html.mjs:478— `url` is text this program did not author, and it is written into the start of a URL attribute, where it chooses the scheme through markup built here with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML encoding does not help here — a `javascript:` URL contains nothing it changes; allow only http(s) or a relative path.
Untrusted text written into markup unescaped build-cv-html.mjs:726— `sanitizeImageSrc(photo)` is text this program did not author, and it is written into the start of a URL attribute, where it chooses the scheme through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML encoding does not help here — a `javascript:` URL contains nothing it changes; allow only http(s) or a relative path.
Untrusted text written into markup unescaped generate-cover-letter.mjs:274— `escapeHtml(fn.url)` is text this program did not author, and it is written into the start of a URL attribute, where it chooses the scheme through markup built here with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML encoding does not help here — a `javascript:` URL contains nothing it changes; allow only http(s) or a relative path.
AC6 · Visual & motion safety· Animation without a prefers-reduced-motion guard · ×2
Animation without a prefers-reduced-motion guard web/src/components/apply-view.tsx:468— <span> moves — its `animate-ping` utility runs with no motion-safe:/motion-reduce: variant — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:.
Animation without a prefers-reduced-motion guard web/src/app/globals.css:176— `.route-bar[data-state="done"]` moves (`transition: transform 0.2s ease-out, opacity 0.35s ease-out 0.15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
merge-tracker.mergeTracker::mergeUnderLock (cyclomatic 137) merge-tracker.mjs:1334— merge-tracker.mergeTracker::mergeUnderLock has cyclomatic complexity 137 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (merge-tracker.mergeTracker::mergeUnderLock::fuzzyTierMatch) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
merge-tracker.mergeTracker::mergeUnderLock::fuzzyTierMatch (cyclomatic 23) merge-tracker.mjs:2001— merge-tracker.mergeTracker::mergeUnderLock::fuzzyTierMatch has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (merge-tracker.mergeTracker::mergeUnderLock) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
fetch::runQuery (cyclomatic 26) providers/workday.mjs:865— fetch::runQuery has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
fetch::split (cyclomatic 19) providers/workday.mjs:995— fetch::split has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
acquireDirLock (cyclomatic 20) lib/dir-lock.mjs:725— acquireDirLock has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body's own statements and 9 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
acquireDirLock (cyclomatic 20) web/src/lib/core/dir-lock.mjs:725— acquireDirLock has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body's own statements and 9 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
attemptDirLock (cyclomatic 18) lib/dir-lock.mjs:475— attemptDirLock has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
attemptDirLock (cyclomatic 18) web/src/lib/core/dir-lock.mjs:475— attemptDirLock has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
dir-lock.createRelease (cyclomatic 17) lib/dir-lock.mjs:888— dir-lock.createRelease has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 897). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
dir-lock.createRelease (cyclomatic 17) web/src/lib/core/dir-lock.mjs:888— dir-lock.createRelease has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 897). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
createRelease::release (cyclomatic 17) lib/dir-lock.mjs:897— createRelease::release has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
createRelease::release (cyclomatic 17) web/src/lib/core/dir-lock.mjs:897— createRelease::release has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
fetch::runQuery (cognitive 42) providers/workday.mjs:865— fetch::runQuery has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 7 (13 pts), boolean chains 5, error handling 1 (3 pts), loops 1 (2 pts), other 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetch::split (cognitive 30) providers/workday.mjs:995— fetch::split has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 2 (5 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1, other 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetch (cognitive 41) providers/builtin.mjs:452— fetch has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (9 pts), boolean chains 3, error handling 1 (3 pts), ternaries 2 (3 pts), other 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetch (cognitive 41) providers/adp-workforcenow.mjs:359— fetch has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 6, loops 3 (5 pts), error handling 1 (3 pts), ternaries 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
attemptDirLock (cognitive 35) lib/dir-lock.mjs:475— attemptDirLock has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (22 pts), error handling 5 (9 pts), boolean chains 3, other 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
attemptDirLock (cognitive 35) web/src/lib/core/dir-lock.mjs:475— attemptDirLock has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (22 pts), error handling 5 (9 pts), boolean chains 3, other 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dir-lock.createRelease (cognitive 31) lib/dir-lock.mjs:888— dir-lock.createRelease has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (24 pts), error handling 3 (5 pts), boolean chains 2 (nesting depth added 14). None of this is in the body itself: all 31 points belong to one function literal inside it that branches (line 897). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
dir-lock.createRelease (cognitive 31) web/src/lib/core/dir-lock.mjs:888— dir-lock.createRelease has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (24 pts), error handling 3 (5 pts), boolean chains 2 (nesting depth added 14). None of this is in the body itself: all 31 points belong to one function literal inside it that branches (line 897). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
createRelease::release (cognitive 31) lib/dir-lock.mjs:897— createRelease::release has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (24 pts), error handling 3 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
createRelease::release (cognitive 31) web/src/lib/core/dir-lock.mjs:897— createRelease::release has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (24 pts), error handling 3 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
acquireDirLock (cognitive 25) lib/dir-lock.mjs:725— acquireDirLock has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 6, other 2, boolean chains 1, error handling 1, loops 1 (nesting depth added 6). Of this number, 16 points are the body's own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
acquireDirLock (cognitive 25) web/src/lib/core/dir-lock.mjs:725— acquireDirLock has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 6, other 2, boolean chains 1, error handling 1, loops 1 (nesting depth added 6). Of this number, 16 points are the body's own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
url-key.normalizeUrl (cognitive 19) url-key.mjs:297— url-key.normalizeUrl has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 5 (6 pts), boolean chains 2, loops 2, error handling 1 (nesting depth added 5). Of this number, 11 points are the body's own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
url-key.normalizeUrl (cognitive 19) web/src/lib/core/url-key.mjs:76— url-key.normalizeUrl has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 5 (6 pts), boolean chains 2, loops 2, error handling 1 (nesting depth added 5). Of this number, 11 points are the body's own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
route.POST (cognitive 19) REDACTED:14— route.POST has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (5 pts), boolean chains 3, error handling 3 (nesting depth added 3). Of this number, 17 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
route.POST (cognitive 19) REDACTED:31— route.POST has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 3). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 70). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
route.POST (cognitive 17) REDACTED:18— route.POST has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (8 pts), error handling 3 (4 pts), if/else 4, boolean chains 1 (nesting depth added 4). Of this number, 16 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
route.POST (cognitive 17) REDACTED:21— route.POST has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, ternaries 2 (4 pts), boolean chains 2, error handling 2 (nesting depth added 2). Of this number, 13 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
TooManyFields: Catalog dashboard/internal/i18n/catalog.go:12— TooManyFields — 136 stored fields beside 6 methods. The bar is 30 stored fields; this is 106 over it, 4.53× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: PipelineModel dashboard/internal/ui/screens/pipeline.go:298— TooManyFields — 34 stored fields beside 59 methods. The bar is 30 stored fields; this is 4 over it, 1.13× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
ClassTooLong: PipelineModel dashboard/internal/ui/screens/pipeline.go:298— ClassTooLong — 1284 significant lines (blank, comment-only and punctuation-only lines excluded), 59 methods, 58 blocks, lines 287-2447. The bar is 400 significant lines; this is 884 over it, 3.21× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ViewerModel dashboard/internal/ui/screens/viewer.go:35— ClassTooLong — 426 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods, 23 blocks, lines 35-986. The bar is 400 significant lines; this is 26 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
MethodTooLong: PipelineModel.handleKey dashboard/internal/ui/screens/pipeline.go:564— MethodTooLong — handleKey runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: appModel.Update dashboard/main.go:106— MethodTooLong — Update runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
Change coupling: REDACTED ↔ run-prompts.mjs web/src/app/api/run/route.ts:1— `web/src/app/api/run/route.ts` and `web/src/lib/run-prompts.mjs` change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `ec35d1b4` fix(web): name the resolved profile path in agent prompts under CAREE…; `49e14d43` feat(web): draft a cover letter from the report page (#5258); `a98717eb` fix(web): deny Write/Bash when evaluating untrusted JDs (#3629) — run `git show` on any of them.
Change coupling: _types.js ↔ REDACTED providers/_types.js:1— `providers/_types.js` and `REDACTED` change together 58% of the time (11 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `ff092313` feat(scan): preferred_languages picks the language version of a posti…; `66314d3a` feat(scan): language-aware URL dedup for language versions served at …; `f3846b0b` feat(scan): SmartRecruiters requisition ids and opt-in language-aware… — run `git show` on any of them.
Duplicated block (16 lines × 2) dashboard/internal/ui/screens/pipeline.go:847— dashboard/internal/ui/screens/pipeline.go:847-862 | dashboard/internal/ui/screens/viewer.go:920-935 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `dashboard/internal/ui/screens/viewer.go:919` calls `clampScrollOffset` and `dashboard/internal/ui/screens/pipeline.go:846` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (16 lines × 2) dashboard/internal/ui/screens/progress.go:186— dashboard/internal/ui/screens/progress.go:186-201 | dashboard/internal/ui/screens/progress.go:259-274 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) dashboard/internal/data/pdf.go:233— dashboard/internal/data/pdf.go:233-241 | dashboard/internal/data/pdf.go:313-321 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) dashboard/internal/ui/screens/progress.go:409— dashboard/internal/ui/screens/progress.go:409-417 | dashboard/internal/ui/screens/stats.go:672-680 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `dashboard/internal/ui/screens/progress.go:409` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
R10 · Code Duplication· Duplicated block with local edits (99 matched lines × 2 locations) · ×2
Duplicated block with local edits (99 matched lines × 2 locations) REDACTED:52— REDACTED:52 · providers/platsbanken.mjs:71 — the two spans are one implementation copied and then locally edited — 588 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (99 matched lines × 2 locations) web/src/lib/cv-envelope.mjs:31— web/src/lib/cv-envelope.mjs:31 · web/src/lib/report-envelope.mjs:17 — the two spans are one implementation copied and then locally edited — 693 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (74 matched lines × 2 locations) · ×2
Duplicated block with local edits (74 matched lines × 2 locations) openai-eval.mjs:191— openai-eval.mjs:191 · openai-tailor.mjs:127 — the two spans are one implementation copied and then locally edited — 486 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (74 matched lines × 2 locations) web/src/components/scheduled-scans/create-job-modal.tsx:16— web/src/components/scheduled-scans/create-job-modal.tsx:16 · web/src/components/scheduled-scans/edit-job-modal.tsx:18 — the two spans are one implementation copied and then locally edited — 493 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (48 matched lines × 2 locations) · ×2
Duplicated block with local edits (48 matched lines × 2 locations) build-cv-html.mjs:1448— build-cv-html.mjs:1448 · build-cv-latex.mjs:385 — the two spans are one implementation copied and then locally edited — 414 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (48 matched lines × 2 locations) providers/kalibrr.mjs:165— providers/kalibrr.mjs:165 · providers/techinasia.mjs:268 — the two spans are one implementation copied and then locally edited — 387 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (44 lines × 2 locations) analyze-patterns.mjs:807— analyze-patterns.mjs:807 · upskill.mjs:717 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (44 lines × 2 locations) web/src/components/scheduled-scans/create-job-modal.tsx:106— web/src/components/scheduled-scans/create-job-modal.tsx:106 · web/src/components/scheduled-scans/edit-job-modal.tsx:125 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication· Duplicated block with local edits (39 matched lines × 2 locations) · ×2
Duplicated block with local edits (39 matched lines × 2 locations) build-cv-latex.mjs:214— build-cv-latex.mjs:214 · build-cv-latex.mjs:500 — the two spans are one implementation copied and then locally edited — 339 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (39 matched lines × 2 locations) ics-interview.mjs:434— ics-interview.mjs:434 · REDACTED:346 — the two spans are one implementation copied and then locally edited — 313 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (36 matched lines × 2 locations) · ×2
Duplicated block with local edits (36 matched lines × 2 locations) providers/phenom.mjs:92— providers/phenom.mjs:92 · providers/tkms.mjs:55 — the two spans are one implementation copied and then locally edited — 316 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (36 matched lines × 2 locations) REDACTED:492— REDACTED:492 · web/src/lib/posting-url.mjs:48 — the two spans are one implementation copied and then locally edited — 248 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Dead file (~273 LoC) providers/csod.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~273 LoC) providers/oraclecloud.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
AC2 · Forms & labels· <fieldset> without a <legend> · ×1
<fieldset> without a <legend> web/src/components/explore/filter-builder.tsx:128— A fieldset groups related controls but has no <legend> to name the group. Add a <legend> as its first child — or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption's id instead, which names the group without rendering a second one.
AC7 · A11y enforcement· Accessibility enforcement below the top rung · ×1
Accessibility enforcement below the top rung — No accessibility enforcement found — no a11y linter (eslint-plugin-jsx-a11y) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 152 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
D1 · Cyclomatic Complexity· main (cyclomatic 195) · ×1
main (cyclomatic 195) REDACTED:3989— main has cyclomatic complexity 195 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
explore-provider.ExploreProvider (cyclomatic 144) web/src/components/explore/explore-provider.tsx:132— explore-provider.ExploreProvider has cyclomatic complexity 144 (threshold 15). Most of this is not in the body itself: 1 of the 144 points is its own statement and the rest belongs to 19 function literals inside it that branch (lines 175, 213, 466, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
runSelfTest (cyclomatic 115) analyze-patterns.mjs:433— runSelfTest has cyclomatic complexity 115 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
scan-ats-full.main (cyclomatic 109) scan-ats-full.mjs:1156— scan-ats-full.main has cyclomatic complexity 109 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (scan-ats-full.main::processJobs) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
update-system.apply (cyclomatic 104) REDACTED:4515— update-system.apply has cyclomatic complexity 104 (threshold 15). Of this number, 102 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
salary-gap.selfTest (cyclomatic 101) REDACTED:746— salary-gap.selfTest has cyclomatic complexity 101 (threshold 15). Of this number, 78 points are the body's own statements and 23 belong to 11 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
route.POST (cyclomatic 97) web/src/app/api/run/route.ts:33— route.POST has cyclomatic complexity 97 (threshold 15). Of this number, 38 points are the body's own statements and 59 belong to 15 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
inbox-triage.InboxTriage (cyclomatic 87) web/src/components/inbox/inbox-triage.tsx:28— inbox-triage.InboxTriage has cyclomatic complexity 87 (threshold 15). Of this number, 24 points are the body's own statements and 63 belong to 26 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
apply-provider.ApplyProvider (cyclomatic 84) web/src/components/apply/apply-provider.tsx:61— apply-provider.ApplyProvider has cyclomatic complexity 84 (threshold 15). Most of this is not in the body itself: 1 of the 84 points is its own statement and the rest belongs to 12 function literals inside it that branch (lines 223, 107, 316, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
runSelfTest (cyclomatic 84) build-cv-html.mjs:1108— runSelfTest has cyclomatic complexity 84 (threshold 15). Of this number, 80 points are the body's own statements and 4 belong to 10 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
buildEvidence (cyclomatic 76) github-evidence.mjs:195— buildEvidence has cyclomatic complexity 76 (threshold 15). Of this number, 48 points are the body's own statements and 28 belong to 16 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
data.NormalizeStatus (cyclomatic 70) REDACTED:683— data.NormalizeStatus has cyclomatic complexity 70 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
extract.extractForm (cyclomatic 68) web/src/lib/apply/extract.ts:22— extract.extractForm has cyclomatic complexity 68 (threshold 15). Most of this is not in the body itself: 1 of the 68 points is its own statement and the rest belongs to 10 function literals inside it that branch (lines 23, 52, 91, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
explorer-view.ExplorerView (cyclomatic 67) web/src/components/explore/explorer-view.tsx:33— explorer-view.ExplorerView has cyclomatic complexity 67 (threshold 15). Of this number, 53 points are the body's own statements and 14 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
route.POST (cyclomatic 65) web/src/app/api/explore/ai/route.ts:48— route.POST has cyclomatic complexity 65 (threshold 15). Of this number, 22 points are the body's own statements and 43 belong to 11 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
today-dashboard.TodayDashboard (cyclomatic 63) web/src/components/home/today-dashboard.tsx:28— today-dashboard.TodayDashboard has cyclomatic complexity 63 (threshold 15). Of this number, 40 points are the body's own statements and 23 belong to 13 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
sync-pdf-flags.syncTrackerPdfFlags (cyclomatic 62) sync-pdf-flags.mjs:56— sync-pdf-flags.syncTrackerPdfFlags has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pipeline-view.PipelineView (cyclomatic 62) web/src/components/pipeline-view.tsx:30— pipeline-view.PipelineView has cyclomatic complexity 62 (threshold 15). Of this number, 25 points are the body's own statements and 37 belong to 14 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity· main (cyclomatic 59) · ×1
main (cyclomatic 59) check-liveness.mjs:159— main has cyclomatic complexity 59 (threshold 15). Of this number, 47 points are the body's own statements and 12 belong to 12 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PipelineModel.handleKey (cyclomatic 58) dashboard/internal/ui/screens/pipeline.go:564— PipelineModel.handleKey has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
export-ats-text.formatAtsText (cyclomatic 56) scripts/export-ats-text.mjs:277— export-ats-text.formatAtsText has cyclomatic complexity 56 (threshold 15). Of this number, 25 points are the body's own statements and 31 belong to 7 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
followups-view.FollowupsView (cyclomatic 55) web/src/components/followups/followups-view.tsx:86— followups-view.FollowupsView has cyclomatic complexity 55 (threshold 15). Of this number, 22 points are the body's own statements and 33 belong to 14 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
checkUrlLiveness (cyclomatic 55) liveness-browser.mjs:469— checkUrlLiveness has cyclomatic complexity 55 (threshold 15). Of this number, 23 points are the body's own statements and 32 belong to 14 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
update-system.locallyModifiedSystemFiles (cyclomatic 54) REDACTED:2399— update-system.locallyModifiedSystemFiles has cyclomatic complexity 54 (threshold 15). Of this number, 47 points are the body's own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
fetch (cyclomatic 54) providers/arbeitsagentur.mjs:178— fetch has cyclomatic complexity 54 (threshold 15). Of this number, 39 points are the body's own statements and 15 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
data.CanonicalizeArchetype (cyclomatic 53) dashboard/internal/data/stats.go:15— data.CanonicalizeArchetype has cyclomatic complexity 53 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
diagnose (cyclomatic 53) coverage-check.mjs:123— diagnose has cyclomatic complexity 53 (threshold 15). Of this number, 51 points are the body's own statements and 2 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_engine.validateManifest (cyclomatic 51) plugins/_engine.mjs:182— _engine.validateManifest has cyclomatic complexity 51 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
runSelfTest (cyclomatic 51) build-cv-latex.mjs:288— runSelfTest has cyclomatic complexity 51 (threshold 15). Of this number, 45 points are the body's own statements and 6 belong to 13 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
doImport (cyclomatic 51) career-profile.mjs:189— doImport has cyclomatic complexity 51 (threshold 15). Of this number, 27 points are the body's own statements and 24 belong to 12 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
analyze-patterns.parseReport (cyclomatic 50) analyze-patterns.mjs:974— analyze-patterns.parseReport has cyclomatic complexity 50 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
fold (cyclomatic 50) REDACTED:533— fold has cyclomatic complexity 50 (threshold 15). Of this number, 46 points are the body's own statements and 4 belong to 12 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
extractPanelists (cyclomatic 50) REDACTED:177— extractPanelists has cyclomatic complexity 50 (threshold 15). Of this number, 33 points are the body's own statements and 17 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
canonicalizeArchetype (cyclomatic 50) web/src/lib/analytics-metrics.mjs:147— canonicalizeArchetype has cyclomatic complexity 50 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
validate-portals.validatePortalsConfig (cyclomatic 49) validate-portals.mjs:190— validate-portals.validatePortalsConfig has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (validate-portals.validatePortalsConfig::validateEntryList) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
scheduled-jobs-view.ScheduledJobsView (cyclomatic 49) web/src/components/scheduled-jobs-view.tsx:47— scheduled-jobs-view.ScheduledJobsView has cyclomatic complexity 49 (threshold 15). Of this number, 21 points are the body's own statements and 28 belong to 7 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
analyze (cyclomatic 49) analyze-patterns.mjs:1352— analyze has cyclomatic complexity 49 (threshold 15). Of this number, 33 points are the body's own statements and 16 belong to 25 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
assistant-console.AssistantConsole (cyclomatic 48) web/src/components/assistant-console.tsx:142— assistant-console.AssistantConsole has cyclomatic complexity 48 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (assistant-console.AssistantConsole::send) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
aggregate-tokens.main (cyclomatic 47) batch/aggregate-tokens.mjs:30— aggregate-tokens.main has cyclomatic complexity 47 (threshold 15). Of this number, 46 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
reply-watch.main (cyclomatic 47) reply-watch.mjs:276— reply-watch.main has cyclomatic complexity 47 (threshold 15). Of this number, 23 points are the body's own statements and 24 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cv-ingest.CvIngest (cyclomatic 47) web/src/components/cv/cv-ingest.tsx:31— cv-ingest.CvIngest has cyclomatic complexity 47 (threshold 15). Of this number, 16 points are the body's own statements and 31 belong to 8 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
reconcile-pipeline.reconcile (cyclomatic 46) REDACTED:197— reconcile-pipeline.reconcile has cyclomatic complexity 46 (threshold 15). Of this number, 39 points are the body's own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
rollback (cyclomatic 46) REDACTED:5558— rollback has cyclomatic complexity 46 (threshold 15). Of this number, 39 points are the body's own statements and 7 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
parseCompensation (cyclomatic 45) providers/ashby.mjs:57— parseCompensation has cyclomatic complexity 45 (threshold 15). Of this number, 26 points are the body's own statements and 19 belong to 6 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
reply-matcher.matchCandidates (cyclomatic 44) reply-matcher.mjs:468— reply-matcher.matchCandidates has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
route.POST (cyclomatic 44) REDACTED:68— route.POST has cyclomatic complexity 44 (threshold 15). Of this number, 25 points are the body's own statements and 19 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
computePortalRecommendations (cyclomatic 44) stats.mjs:394— computePortalRecommendations has cyclomatic complexity 44 (threshold 15). Of this number, 39 points are the body's own statements and 5 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
fetch (cyclomatic 44) REDACTED:323— fetch has cyclomatic complexity 44 (threshold 15). Of this number, 42 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
generate-pdf.generatePDF (cyclomatic 43) REDACTED:1577— generate-pdf.generatePDF has cyclomatic complexity 43 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
employer-source.scanEmployer (cyclomatic 43) web/src/lib/core/employer-source.mjs:9— employer-source.scanEmployer has cyclomatic complexity 43 (threshold 15). Of this number, 22 points are the body's own statements and 21 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
export-ats-text.normalizeProfile (cyclomatic 42) scripts/export-ats-text.mjs:166— export-ats-text.normalizeProfile has cyclomatic complexity 42 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
data.ComputeStatsMetrics (cyclomatic 42) dashboard/internal/data/stats.go:180— data.ComputeStatsMetrics has cyclomatic complexity 42 (threshold 15). Of this number, 39 points are the body's own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mapTrackerToApps (cyclomatic 42) REDACTED:1362— mapTrackerToApps has cyclomatic complexity 42 (threshold 15). Of this number, 39 points are the body's own statements and 3 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
parseIcs (cyclomatic 42) ics-interview.mjs:274— parseIcs has cyclomatic complexity 42 (threshold 15). Of this number, 39 points are the body's own statements and 3 belong to 5 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
salary-gap.printSummary (cyclomatic 41) REDACTED:1542— salary-gap.printSummary has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
export-ats-text.parseCvMarkdown (cyclomatic 41) scripts/export-ats-text.mjs:34— export-ats-text.parseCvMarkdown has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
upskill.runSelfTest (cyclomatic 41) upskill.mjs:584— upskill.runSelfTest has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
diagnose.verifyFill (cyclomatic 41) web/src/lib/apply/diagnose.ts:213— diagnose.verifyFill has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 7 of the 41 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 218, 214, 219). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
route.POST (cyclomatic 40) web/src/app/api/assistant/route.ts:43— route.POST has cyclomatic complexity 40 (threshold 15). Of this number, 22 points are the body's own statements and 18 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
appModel.Update (cyclomatic 40) dashboard/main.go:106— appModel.Update has cyclomatic complexity 40 (threshold 15). Of this number, 39 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
build-cv-html.renderMarkdown (cyclomatic 39) build-cv-html.mjs:891— build-cv-html.renderMarkdown has cyclomatic complexity 39 (threshold 15). Of this number, 30 points are the body's own statements and 9 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
apply-view.ApplyView (cyclomatic 39) web/src/components/apply-view.tsx:33— apply-view.ApplyView has cyclomatic complexity 39 (threshold 15). Of this number, 35 points are the body's own statements and 4 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
assistant-history.cleanMessages (cyclomatic 39) web/src/lib/assistant-history.mjs:5— assistant-history.cleanMessages has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 3 of the 39 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 11, 7). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
fetch (cyclomatic 39) REDACTED:776— fetch has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
reply-matcher.classifyReply (cyclomatic 38) reply-matcher.mjs:612— reply-matcher.classifyReply has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
discover-ats.resolveCompany (cyclomatic 38) discover-ats.mjs:681— discover-ats.resolveCompany has cyclomatic complexity 38 (threshold 15). Of this number, 37 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
fetch (cyclomatic 38) providers/workday.mjs:807— fetch has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
audit-portals.main (cyclomatic 37) audit-portals.mjs:379— audit-portals.main has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
contact-extract.main (cyclomatic 37) contact-extract.mjs:239— contact-extract.main has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
persist-evaluation-report.writeEvaluationArtifacts (cyclomatic 37) persist-evaluation-report.mjs:44— persist-evaluation-report.writeEvaluationArtifacts has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
runBatchFromManifest (cyclomatic 37) REDACTED:1839— runBatchFromManifest has cyclomatic complexity 37 (threshold 15). Of this number, 36 points are the body's own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
fetch (cyclomatic 37) providers/eightfold.mjs:357— fetch has cyclomatic complexity 37 (threshold 15). Of this number, 35 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
verify-cv-structure.runCli (cyclomatic 36) verify-cv-structure.mjs:614— verify-cv-structure.runCli has cyclomatic complexity 36 (threshold 15). Of this number, 34 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
printSummary (cyclomatic 36) analyze-patterns.mjs:1656— printSummary has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
fetch (cyclomatic 36) providers/gupy.mjs:341— fetch has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
company-history.buildCompanyCards (cyclomatic 35) company-history.mjs:469— company-history.buildCompanyCards has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
verify-ats.cssDeclarations (cyclomatic 35) verify-ats.mjs:350— verify-ats.cssDeclarations has cyclomatic complexity 35 (threshold 15). Of this number, 31 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
data.deriveNoteFields (cyclomatic 35) dashboard/internal/data/derive.go:158— data.deriveNoteFields has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity· main (cyclomatic 35) · ×1
main (cyclomatic 35) rank-pipeline.mjs:408— main has cyclomatic complexity 35 (threshold 15). Of this number, 32 points are the body's own statements and 3 belong to 9 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
build-cv-latex.main (cyclomatic 34) build-cv-latex.mjs:146— build-cv-latex.main has cyclomatic complexity 34 (threshold 15). Of this number, 30 points are the body's own statements and 4 belong to 3 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
wttj.normalizeWttjHit (cyclomatic 34) providers/wttj.mjs:117— wttj.normalizeWttjHit has cyclomatic complexity 34 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
report-view.ReportView (cyclomatic 34) web/src/components/report-view.tsx:48— report-view.ReportView has cyclomatic complexity 34 (threshold 15). Of this number, 22 points are the body's own statements and 12 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
createCachedLookup (cyclomatic 34) providers/_dns-cache.mjs:225— createCachedLookup has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 9 of the 34 points are its own statements and the rest belongs to 8 function items inside it that branch (cachedLookup, a function literal at line 312, a function literal at line 262, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
update-system.checkMainChannel (cyclomatic 33) REDACTED:3943— update-system.checkMainChannel has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
apply-view.FieldRow (cyclomatic 33) web/src/components/apply-view.tsx:533— apply-view.FieldRow has cyclomatic complexity 33 (threshold 15). Of this number, 30 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
fetch (cyclomatic 33) REDACTED:379— fetch has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
normalizeProfile (cyclomatic 33) plugins/h1b-sponsor/lib/api.mjs:475— normalizeProfile has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
verify-ats.auditAts (cyclomatic 32) verify-ats.mjs:464— verify-ats.auditAts has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
section-card.BulletRow (cyclomatic 32) web/src/components/cv-studio/section-card.tsx:121— section-card.BulletRow has cyclomatic complexity 32 (threshold 15). Of this number, 22 points are the body's own statements and 10 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
job-store.JobsProvider (cyclomatic 32) web/src/components/jobs/job-store.tsx:63— job-store.JobsProvider has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 2 of the 32 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 176, 145, 217, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
session.openSession (cyclomatic 32) web/src/lib/apply/session.ts:189— session.openSession has cyclomatic complexity 32 (threshold 15). Of this number, 29 points are the body's own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
extract-json-object.extractJsonObject (cyclomatic 32) web/src/lib/extract-json-object.mjs:24— extract-json-object.extractJsonObject has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
scan.runScanner (cyclomatic 32) web/src/lib/core/scan.ts:189— scan.runScanner has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to 10 function literals inside it that branch (lines 279, 255, 342, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
data.ComputeProgressMetrics (cyclomatic 32) REDACTED:1070— data.ComputeProgressMetrics has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
data.CanonicalizeLocation (cyclomatic 32) dashboard/internal/data/stats.go:86— data.CanonicalizeLocation has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
extractContacts::add (cyclomatic 32) followup-cadence.mjs:710— extractContacts::add has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
fetch (cyclomatic 32) providers/techinasia.mjs:318— fetch has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
parseCv (cyclomatic 32) career-profile.mjs:71— parseCv has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 12 of the 32 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 88, addFact, a function literal at line 130, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
browser-extract.readDom (cyclomatic 31) browser-extract.mjs:965— browser-extract.readDom has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 966, 978, 1002, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
scan.collectSeenUrls (cyclomatic 31) REDACTED:2028— scan.collectSeenUrls has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
validate-portals.validatePortalsConfig::validateEntryList (cyclomatic 31) validate-portals.mjs:407— validate-portals.validatePortalsConfig::validateEntryList has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (validate-portals.validatePortalsConfig) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
cmdRun (cyclomatic 31) plugins.mjs:209— cmdRun has cyclomatic complexity 31 (threshold 15). Of this number, 30 points are the body's own statements and 1 belongs to 6 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
roleFuzzyMatch (cyclomatic 31) role-matcher.mjs:240— roleFuzzyMatch has cyclomatic complexity 31 (threshold 15). Of this number, 28 points are the body's own statements and 3 belong to 16 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
computeStatsMetrics (cyclomatic 31) web/src/lib/analytics-metrics.mjs:232— computeStatsMetrics has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body's own statements and 2 belong to 10 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
normalizeAnswers (cyclomatic 31) onboard-write.mjs:81— normalizeAnswers has cyclomatic complexity 31 (threshold 15). Of this number, 26 points are the body's own statements and 5 belong to 5 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
cv-payload-schema.validatePayload (cyclomatic 30) lib/cv-payload-schema.mjs:166— cv-payload-schema.validatePayload has cyclomatic complexity 30 (threshold 15). Of this number, 22 points are the body's own statements and 8 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
successfactors.fetchCsb (cyclomatic 30) REDACTED:326— successfactors.fetchCsb has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
scan-interamt.main (cyclomatic 30) scan-interamt.mjs:274— scan-interamt.main has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
assistant-console.AssistantConsole::send (cyclomatic 30) web/src/components/assistant-console.tsx:673— assistant-console.AssistantConsole::send has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (assistant-console.AssistantConsole) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
discovery-card.DiscoveryCard (cyclomatic 30) web/src/components/explore/discovery-card.tsx:42— discovery-card.DiscoveryCard has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
session.fillSession (cyclomatic 30) web/src/lib/apply/session.ts:423— session.fillSession has cyclomatic complexity 30 (threshold 15). Of this number, 26 points are the body's own statements and 4 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
buildSalaryFilter (cyclomatic 30) REDACTED:1058— buildSalaryFilter has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 13 of the 30 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 1078, 1059, 1068, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
normalizeTextForATS (cyclomatic 30) REDACTED:217— normalizeTextForATS has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 14 of the 30 points are its own statements and the rest belongs to 26 function items inside it that branch (a function literal at line 283, a function literal at line 321, sanitizeText, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
parseMarkdownRows (cyclomatic 30) tracker.mjs:370— parseMarkdownRows has cyclomatic complexity 30 (threshold 15). Of this number, 28 points are the body's own statements and 2 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
renderSummary (cyclomatic 30) funnel-velocity.mjs:460— renderSummary has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
computePortalStats (cyclomatic 30) stats.mjs:306— computePortalStats has cyclomatic complexity 30 (threshold 15). Of this number, 29 points are the body's own statements and 1 belongs to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity· main (cyclomatic 30) · ×1
main (cyclomatic 30) scan-dayforce.mjs:626— main has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
scan.verifyOffers (cyclomatic 29) REDACTED:3780— scan.verifyOffers has cyclomatic complexity 29 (threshold 15). Of this number, 20 points are the body's own statements and 9 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
i18n-drift.extractHeadings (cyclomatic 29) i18n-drift.mjs:27— i18n-drift.extractHeadings has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
rejection-latency.computeRejectionLatency (cyclomatic 29) rejection-latency.mjs:309— rejection-latency.computeRejectionLatency has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
data.ParseApplications (cyclomatic 29) REDACTED:199— data.ParseApplications has cyclomatic complexity 29 (threshold 15). Of this number, 25 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
computeResponsiveness (cyclomatic 29) company-history.mjs:348— computeResponsiveness has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
scanBoard (cyclomatic 29) scan-dayforce.mjs:464— scanBoard has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
smartrecruiters.parseSmartRecruitersResponse (cyclomatic 28) providers/smartrecruiters.mjs:209— smartrecruiters.parseSmartRecruitersResponse has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 2 of the 28 points are its own statements and the rest belongs to one function literal inside it that branches (line 212). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
discover-ats.runSelfTest (cyclomatic 28) discover-ats.mjs:933— discover-ats.runSelfTest has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
api.requestJson (cyclomatic 28) plugins/h1b-sponsor/lib/api.mjs:245— api.requestJson has cyclomatic complexity 28 (threshold 15). Of this number, 15 points are the body's own statements and 13 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
vc-portfolios.parseA16zPayload (cyclomatic 28) seeds/vc-portfolios.mjs:187— vc-portfolios.parseA16zPayload has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
first-score-view.FirstScoreView (cyclomatic 28) web/src/components/explore/first-score-view.tsx:38— first-score-view.FirstScoreView has cyclomatic complexity 28 (threshold 15). Of this number, 15 points are the body's own statements and 13 belong to 5 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
worker-card.WorkerCard (cyclomatic 28) web/src/components/jobs/worker-card.tsx:79— worker-card.WorkerCard has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
job-card.JobCard (cyclomatic 28) web/src/components/scheduled-scans/job-card.tsx:9— job-card.JobCard has cyclomatic complexity 28 (threshold 15). Of this number, 19 points are the body's own statements and 9 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
agent-interpret.captureCandidates (cyclomatic 28) web/src/lib/apply/agent-interpret.ts:27— agent-interpret.captureCandidates has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 28, 54, 29). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
personalization-file.mergeSections (cyclomatic 28) web/src/lib/personalization-file.mjs:34— personalization-file.mergeSections has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_registry.validateRegistryEntry (cyclomatic 27) plugins/_registry.mjs:116— _registry.validateRegistryEntry has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
status-hooks.archiveJdOnInterview (cyclomatic 27) lib/status-hooks.mjs:212— status-hooks.archiveJdOnInterview has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
callOpenRouter (cyclomatic 27) openrouter-runner.mjs:247— callOpenRouter has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
archiveUrl (cyclomatic 27) archive-posting.mjs:331— archiveUrl has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body's own statements and 1 belongs to 5 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
fetch (cyclomatic 27) providers/adp-workforcenow.mjs:359— fetch has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
classifyRows (cyclomatic 27) close-stale.mjs:192— classifyRows has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body's own statements and 1 belongs to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
computeProgressMetrics (cyclomatic 27) web/src/lib/analytics-metrics.mjs:41— computeProgressMetrics has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body's own statements and 3 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
verify-cv-facts.runCli (cyclomatic 26) REDACTED:2937— verify-cv-facts.runCli has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
company-funded.buildCandidates (cyclomatic 26) REDACTED:679— company-funded.buildCandidates has cyclomatic complexity 26 (threshold 15). Of this number, 18 points are the body's own statements and 8 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
adp-workforcenow.parseListPage (cyclomatic 26) providers/adp-workforcenow.mjs:295— adp-workforcenow.parseListPage has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
techinasia.normalizeTechInAsiaJob (cyclomatic 26) providers/techinasia.mjs:240— techinasia.normalizeTechInAsiaJob has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
config-form.ConfigForm (cyclomatic 26) web/src/components/config-form.tsx:38— config-form.ConfigForm has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 11 of the 26 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 48, 78, 160, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
drive-action.executeAction (cyclomatic 26) web/src/lib/apply/drive-action.mjs:105— drive-action.executeAction has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
renderInPage (cyclomatic 26) REDACTED:2147— renderInPage has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body's own statements and 3 belong to 5 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
buildRow (cyclomatic 26) assessment-log.mjs:160— buildRow has cyclomatic complexity 26 (threshold 15). Of this number, 15 points are the body's own statements and 11 belong to 5 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
fetch (cyclomatic 26) providers/ultipro.mjs:365— fetch has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cli-flags.validateFlags (cyclomatic 25) lib/cli-flags.mjs:106— cli-flags.validateFlags has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 150, a function literal at line 123, a function literal at line 117, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
stats.printSummary (cyclomatic 25) stats.mjs:694— stats.printSummary has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
funnel-velocity.selfTest (cyclomatic 25) funnel-velocity.mjs:527— funnel-velocity.selfTest has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
contact-extract.appendContact (cyclomatic 25) contact-extract.mjs:152— contact-extract.appendContact has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 2 of the 25 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 154, 170, 165, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
ashby.formatLocation (cyclomatic 25) providers/ashby.mjs:334— ashby.formatLocation has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
recruitee.parseRecruiteeResponse (cyclomatic 25) providers/recruitee.mjs:446— recruitee.parseRecruiteeResponse has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
hired-share.main (cyclomatic 25) hired-share.mjs:204— hired-share.main has cyclomatic complexity 25 (threshold 15). Of this number, 22 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
intake.listSourceFiles (cyclomatic 25) intake.mjs:197— intake.listSourceFiles has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 2 of the 25 points are its own statements and the rest belongs to 4 function items inside it that branch (walk, claimRealDirs, a function literal at line 252, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
reply-proposals.readReplyProposals (cyclomatic 25) lib/reply-proposals.mjs:72— reply-proposals.readReplyProposals has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
platsbanken.parsePlatsbankenResponse (cyclomatic 25) providers/platsbanken.mjs:193— platsbanken.parsePlatsbankenResponse has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
remotli.normalizeRemotliJob (cyclomatic 25) providers/remotli.mjs:178— remotli.normalizeRemotliJob has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
route.POST (cyclomatic 25) web/src/app/api/apply/prefill/route.ts:23— route.POST has cyclomatic complexity 25 (threshold 15). Of this number, 22 points are the body's own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
assistant-status-confirmation.StatusConfirmationCard (cyclomatic 25) web/src/components/assistant-status-confirmation.tsx:16— assistant-status-confirmation.StatusConfirmationCard has cyclomatic complexity 25 (threshold 15). Of this number, 16 points are the body's own statements and 9 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
results-list.ResultsList (cyclomatic 25) web/src/components/explore/results-list.tsx:14— results-list.ResultsList has cyclomatic complexity 25 (threshold 15). Of this number, 17 points are the body's own statements and 8 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
portals-view.PortalsView (cyclomatic 25) web/src/components/portals-view.tsx:22— portals-view.PortalsView has cyclomatic complexity 25 (threshold 15). Of this number, 19 points are the body's own statements and 6 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
agent-interpret.interpretFormWithAgent (cyclomatic 25) web/src/lib/apply/agent-interpret.ts:138— agent-interpret.interpretFormWithAgent has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 6 of the 25 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 162, 179, 161, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
fill-stream.readFillResult (cyclomatic 25) web/src/lib/apply/fill-stream.mjs:12— fill-stream.readFillResult has cyclomatic complexity 25 (threshold 15). Of this number, 17 points are the body's own statements and 8 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
data.parseStatusLedger (cyclomatic 25) dashboard/internal/data/funnel_history.go:91— data.parseStatusLedger has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ViewerModel.Update (cyclomatic 25) dashboard/internal/ui/screens/viewer.go:158— ViewerModel.Update has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
clauseBounds (cyclomatic 25) REDACTED:1313— clauseBounds has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 8 of the 25 points are its own statements and the rest belongs to 2 function items inside it that branch (isBoundary, isSentenceEnd). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
query (cyclomatic 25) tracker.mjs:868— query has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body's own statements and 2 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
renderMarkdown (cyclomatic 25) github-evidence.mjs:622— renderMarkdown has cyclomatic complexity 25 (threshold 15). Of this number, 19 points are the body's own statements and 6 belong to 5 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
liveness-api.checkLivenessViaApi (cyclomatic 24) liveness-api.mjs:902— liveness-api.checkLivenessViaApi has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
cv-sync-check.main (cyclomatic 24) cv-sync-check.mjs:62— cv-sync-check.main has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
walk-tree.walkTree::walk (cyclomatic 24) lib/walk-tree.mjs:170— walk-tree.walkTree::walk has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
linkedin-join.renderSummary (cyclomatic 24) linkedin-join.mjs:591— linkedin-join.renderSummary has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
4dayweek.normalize4dwJob (cyclomatic 24) providers/4dayweek.mjs:94— 4dayweek.normalize4dwJob has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
prevueaps.parsePrevueapsResponse (cyclomatic 24) providers/prevueaps.mjs:202— prevueaps.parsePrevueapsResponse has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
update-system.configuredTemplateVariantsFromProfileSource::parseScalar (cyclomatic 24) REDACTED:1755— update-system.configuredTemplateVariantsFromProfileSource::parseScalar has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (update-system.configuredTemplateVariantsFromProfileSource) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
run-cli-support.parseCodexEvent (cyclomatic 24) web/src/lib/run-cli-support.mjs:173— run-cli-support.parseCodexEvent has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
run-cli-support.parseClaudeEvent (cyclomatic 24) web/src/lib/run-cli-support.mjs:246— run-cli-support.parseClaudeEvent has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
documents.discoverDocuments (cyclomatic 24) web/src/lib/documents.ts:25— documents.discoverDocuments has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
report-persist.persistEvaluation (cyclomatic 24) REDACTED:189— report-persist.persistEvaluation has cyclomatic complexity 24 (threshold 15). Of this number, 19 points are the body's own statements and 5 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
weekly-digest.runSelfTest (cyclomatic 24) weekly-digest.mjs:393— weekly-digest.runSelfTest has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
ViewerModel.styleLine (cyclomatic 24) dashboard/internal/ui/screens/viewer.go:772— ViewerModel.styleLine has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
computeRelocationAdjustment (cyclomatic 24) REDACTED:427— computeRelocationAdjustment has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
analyzeFromContent (cyclomatic 24) followup-cadence.mjs:871— analyzeFromContent has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body's own statements and 4 belong to 9 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
writeVcf (cyclomatic 24) contacts.mjs:441— writeVcf has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
languageVersions (cyclomatic 24) providers/recruitee.mjs:143— languageVersions has cyclomatic complexity 24 (threshold 15). Of this number, 17 points are the body's own statements and 7 belong to 8 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
parseCliArgs (cyclomatic 24) archive-posting.mjs:113— parseCliArgs has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
parseEightfoldResponse (cyclomatic 24) providers/eightfold.mjs:263— parseEightfoldResponse has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
verify-cv-facts.factClaims (cyclomatic 23) REDACTED:906— verify-cv-facts.factClaims has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
build-cv-html.buildProjects (cyclomatic 23) build-cv-html.mjs:468— build-cv-html.buildProjects has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 497, 471). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
fingerprint-core.findCrossListings (cyclomatic 23) fingerprint-core.mjs:209— fingerprint-core.findCrossListings has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
company-funded.fetchHnDiscovery (cyclomatic 23) REDACTED:783— company-funded.fetchHnDiscovery has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
reserve-report-num.runCli (cyclomatic 23) reserve-report-num.mjs:426— reserve-report-num.runCli has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
linkedin-join.main (cyclomatic 23) linkedin-join.mjs:830— linkedin-join.main has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
tier.classifyTier (cyclomatic 23) plugins/h1b-sponsor/lib/tier.mjs:6— tier.classifyTier has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
getonbrd.normalizeGetonbrdJob (cyclomatic 23) providers/getonbrd.mjs:116— getonbrd.normalizeGetonbrdJob has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
pageup.parsePageupListing (cyclomatic 23) REDACTED:137— pageup.parsePageupListing has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
paylocity.parsePaylocityBoard (cyclomatic 23) providers/paylocity.mjs:127— paylocity.parsePaylocityBoard has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
torre.normalizeTorreOpportunity (cyclomatic 23) providers/torre.mjs:179— torre.normalizeTorreOpportunity has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
scan-hn.main (cyclomatic 23) scan-hn.mjs:109— scan-hn.main has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cadence-settings.CadenceSettings (cyclomatic 23) web/src/components/followups/cadence-settings.tsx:22— cadence-settings.CadenceSettings has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 5 function items inside it that branch (save, toggle, a function literal at line 38, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
view-model.statsModel (cyclomatic 23) web/src/lib/analytics/view-model.mjs:125— view-model.statsModel has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
personalization.coercePersonalization (cyclomatic 23) web/src/lib/personalization.mjs:47— personalization.coercePersonalization has cyclomatic complexity 23 (threshold 15). Of this number, 16 points are the body's own statements and 7 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
data.runStatusWriter (cyclomatic 23) dashboard/internal/data/status_writer.go:47— data.runStatusWriter has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
seedFollowup (cyclomatic 23) REDACTED:474— seedFollowup has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
seedBackfill (cyclomatic 23) REDACTED:551— seedBackfill has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
application-answers.main (cyclomatic 22) application-answers.mjs:539— application-answers.main has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
check-jd-archive.checkJdArchive (cyclomatic 22) check-jd-archive.mjs:467— check-jd-archive.checkJdArchive has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ats-payload.validatePayloadShape (cyclomatic 22) ats-payload.mjs:177— ats-payload.validatePayloadShape has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_net.isBlockedV4 (cyclomatic 22) plugins/_net.mjs:51— _net.isBlockedV4 has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
company-funded.parseArgs (cyclomatic 22) REDACTED:110— company-funded.parseArgs has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
discover-ats.main (cyclomatic 22) discover-ats.mjs:1182— discover-ats.main has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
personalization.scanHeadings (cyclomatic 22) lib/personalization.mjs:28— personalization.scanHeadings has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
jsonc-parse.stripJsoncSyntax (cyclomatic 22) jsonc-parse.mjs:26— jsonc-parse.stripJsoncSyntax has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
doctor.onboardingState (cyclomatic 22) doctor.mjs:1408— doctor.onboardingState has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
echojobs.normalizeEchojobsJob (cyclomatic 22) providers/echojobs.mjs:71— echojobs.normalizeEchojobsJob has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ultipro.parseListPage (cyclomatic 22) providers/ultipro.mjs:229— ultipro.parseListPage has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
update-system.unsafeManifestPathReason (cyclomatic 22) REDACTED:505— update-system.unsafeManifestPathReason has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
update-system.revertPaths (cyclomatic 22) REDACTED:2889— update-system.revertPaths has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
verify-ats.runSelfTest (cyclomatic 22) verify-ats.mjs:788— verify-ats.runSelfTest has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
data.acquireTrackerLock (cyclomatic 22) dashboard/internal/data/tracker_lock.go:149— data.acquireTrackerLock has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
buildStatusHistory (cyclomatic 22) tracker.mjs:639— buildStatusHistory has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body's own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
joinConnections (cyclomatic 22) linkedin-join.mjs:514— joinConnections has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 572, 567, 523, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
fetch (cyclomatic 22) providers/builtin.mjs:452— fetch has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
computeCalibration (cyclomatic 22) calibrate.mjs:135— computeCalibration has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body's own statements and 3 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
analyze-patterns.buildPatternSignals (cyclomatic 21) analyze-patterns.mjs:1277— analyze-patterns.buildPatternSignals has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
branded-successfactors.classifyUnknownHostSeeds (cyclomatic 21) branded-successfactors.mjs:118— branded-successfactors.classifyUnknownHostSeeds has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body's own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
scan.buildLocationFilter (cyclomatic 21) REDACTED:600— scan.buildLocationFilter has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 620, 628). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
funnel-velocity.computeVelocity (cyclomatic 21) funnel-velocity.mjs:235— funnel-velocity.computeVelocity has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
followup-seed.parseCliArgs (cyclomatic 21) REDACTED:648— followup-seed.parseCliArgs has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
detect-reposts.detectReposts (cyclomatic 21) detect-reposts.mjs:305— detect-reposts.detectReposts has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 308, 344). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
company-history.runSelfTest (cyclomatic 21) company-history.mjs:992— company-history.runSelfTest has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
recruitee.assembleLocation (cyclomatic 21) providers/recruitee.mjs:268— recruitee.assembleLocation has cyclomatic complexity 21 (threshold 15). Of this number, 13 points are the body's own statements and 8 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
panelist-roles.readIcsText (cyclomatic 21) REDACTED:271— panelist-roles.readIcsText has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
dover.parseDoverPage (cyclomatic 21) providers/dover.mjs:125— dover.parseDoverPage has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
landingjobs.normalizeLandingJob (cyclomatic 21) providers/landingjobs.mjs:81— landingjobs.normalizeLandingJob has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
peoplesoft.parseFormState (cyclomatic 21) REDACTED:355— peoplesoft.parseFormState has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
thehub.normalizeHubJob (cyclomatic 21) providers/thehub.mjs:81— thehub.normalizeHubJob has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
cli.main (cyclomatic 21) scaffolder/bin/cli.mjs:75— cli.main has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
scan-ats-full.runSeedScan (cyclomatic 21) scan-ats-full.mjs:858— scan-ats-full.runSeedScan has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 881, 873). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
sync-batch-input.isPrivateOrInternalHostname (cyclomatic 21) sync-batch-input.mjs:120— sync-batch-input.isPrivateOrInternalHostname has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
route.POST (cyclomatic 21) REDACTED:103— route.POST has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
route.GET (cyclomatic 21) REDACTED:21— route.GET has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 42, 62). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
assistant-chat-store.saveChat (cyclomatic 21) web/src/lib/assistant-chat-store.mjs:66— assistant-chat-store.saveChat has cyclomatic complexity 21 (threshold 15). Of this number, 11 points are the body's own statements and 10 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
company-history.factLine (cyclomatic 21) web/src/lib/company-history.mjs:167— company-history.factLine has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
data.loadJobURLs (cyclomatic 21) REDACTED:421— data.loadJobURLs has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
data.enrichAppURLsByCompany (cyclomatic 21) REDACTED:567— data.enrichAppURLsByCompany has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
trackerLock.release (cyclomatic 21) dashboard/internal/data/tracker_lock.go:226— trackerLock.release has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ViewerModel.renderAll (cyclomatic 21) dashboard/internal/ui/screens/viewer.go:335— ViewerModel.renderAll has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mergeTracker::parseTsvContent (cyclomatic 21) merge-tracker.mjs:1203— mergeTracker::parseTsvContent has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
computeScanStats (cyclomatic 21) stats.mjs:246— computeScanStats has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body's own statements and 1 belongs to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
parseSessionFile (cyclomatic 21) weekly-digest.mjs:106— parseSessionFile has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
fetchInContext (cyclomatic 21) providers/_http.mjs:147— fetchInContext has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
assessment-log.printSummary (cyclomatic 20) assessment-log.mjs:445— assessment-log.printSummary has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
assessment-log.main (cyclomatic 20) assessment-log.mjs:504— assessment-log.main has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body's own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
workday.chooseSplitFacet (cyclomatic 20) providers/workday.mjs:279— workday.chooseSplitFacet has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
scan.loadReApplyWindows (cyclomatic 20) REDACTED:1286— scan.loadReApplyWindows has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
contacts.printSummary (cyclomatic 20) contacts.mjs:379— contacts.printSummary has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
hired-wall-build.buildSvg (cyclomatic 20) hired-wall-build.mjs:152— hired-wall-build.buildSvg has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
normalize-statuses.normalizeStatus (cyclomatic 20) normalize-statuses.mjs:58— normalize-statuses.normalizeStatus has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
precheck-duplicate.findDuplicateCandidates (cyclomatic 20) precheck-duplicate.mjs:105— precheck-duplicate.findDuplicateCandidates has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
adp-workforcenow.extractSalary (cyclomatic 20) providers/adp-workforcenow.mjs:222— adp-workforcenow.extractSalary has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
dassault.parseHits (cyclomatic 20) providers/dassault.mjs:113— dassault.parseHits has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
kalibrr.normalizeKalibrrJob (cyclomatic 20) providers/kalibrr.mjs:149— kalibrr.normalizeKalibrrJob has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mycareersfuture.normalizeJob (cyclomatic 20) providers/mycareersfuture.mjs:123— mycareersfuture.normalizeJob has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
vc-portfolios.parseYCPayload (cyclomatic 20) seeds/vc-portfolios.mjs:126— vc-portfolios.parseYCPayload has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
scheduled-jobs-store.validateScheduledStore (cyclomatic 20) web/src/lib/scheduled-jobs-store.mjs:59— scheduled-jobs-store.validateScheduledStore has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
scheduled-jobs-runner.writeJobPortals (cyclomatic 20) web/scripts/scheduled-jobs-runner.mjs:145— scheduled-jobs-runner.writeJobPortals has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
route.GET (cyclomatic 20) web/src/app/api/cv-pdf/route.ts:33— route.GET has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
filter-builder.FilterBuilder (cyclomatic 20) web/src/components/explore/filter-builder.tsx:107— filter-builder.FilterBuilder has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body's own statements and 5 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
mobile-nav.MobileNav (cyclomatic 20) web/src/components/mobile-nav.tsx:37— mobile-nav.MobileNav has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 4 of the 20 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 54, a function literal at line 153, onTouchMove, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
route-progress.RouteProgress (cyclomatic 20) web/src/components/route-progress.tsx:23— route-progress.RouteProgress has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 41, 69, 73). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
data.deriveSeniority (cyclomatic 20) dashboard/internal/data/stats.go:487— data.deriveSeniority has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
PipelineModel.Update (cyclomatic 20) dashboard/internal/ui/screens/pipeline.go:486— PipelineModel.Update has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
snapshotConfiguredTemplateVariants (cyclomatic 20) REDACTED:1933— snapshotConfiguredTemplateVariants has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity· main (cyclomatic 20) · ×1
main (cyclomatic 20) REDACTED:1646— main has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
parseArgs (cyclomatic 20) discover-ats.mjs:1109— parseArgs has cyclomatic complexity 20 (threshold 15). Of this number, 10 points are the body's own statements and 10 belong to 8 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
addEntry (cyclomatic 20) assessment-log.mjs:324— addEntry has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
printSummary (cyclomatic 20) ics-interview.mjs:462— printSummary has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
computeReevalCandidates (cyclomatic 20) reeval-candidates.mjs:329— computeReevalCandidates has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body's own statements and 5 belong to 11 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
searchInteramt (cyclomatic 20) scan-interamt.mjs:159— searchInteramt has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
analyze-patterns.buildPredictedDiscardReasonSignals (cyclomatic 19) analyze-patterns.mjs:1211— analyze-patterns.buildPredictedDiscardReasonSignals has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
liveness-core.classifyLiveness (cyclomatic 19) liveness-core.mjs:271— liveness-core.classifyLiveness has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
audit-portals.auditCompanies (cyclomatic 19) audit-portals.mjs:214— audit-portals.auditCompanies has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (worker, a function literal at line 221, a function literal at line 260). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
history-ats-seeds.atsBoardUrlOf (cyclomatic 19) history-ats-seeds.mjs:22— history-ats-seeds.atsBoardUrlOf has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
generate-pdf.scanNesting (cyclomatic 19) REDACTED:929— generate-pdf.scanNesting has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cv-templates.loadAtsRules (cyclomatic 19) REDACTED:233— cv-templates.loadAtsRules has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
check-table-freshness.runSelfTest (cyclomatic 19) check-table-freshness.mjs:353— check-table-freshness.runSelfTest has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body's own statements and 6 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
debrief-sync.parseArgs (cyclomatic 19) debrief-sync.mjs:273— debrief-sync.parseArgs has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
discover-ats.parseCompanyInput::add (cyclomatic 19) discover-ats.mjs:190— discover-ats.parseCompanyInput::add has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
doctor.main (cyclomatic 19) doctor.mjs:1155— doctor.main has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
generate-cover-letter.main (cyclomatic 19) generate-cover-letter.mjs:420— generate-cover-letter.main has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
garena.parseGarenaResponse (cyclomatic 19) providers/garena.mjs:37— garena.parseGarenaResponse has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
oraclecloud.parseOracleResponse (cyclomatic 19) providers/oraclecloud.mjs:186— oraclecloud.parseOracleResponse has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
redrover.parseRedRoverResponse (cyclomatic 19) providers/redrover.mjs:112— redrover.parseRedRoverResponse has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ultipro.extractCandidateOpportunityDetail (cyclomatic 19) providers/ultipro.mjs:295— ultipro.extractCandidateOpportunityDetail has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
scan-ats-full.main::processJobs (cyclomatic 19) scan-ats-full.mjs:1418— scan-ats-full.main::processJobs has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (scan-ats-full.main) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
export-ats-text.loadProfile (cyclomatic 19) scripts/export-ats-text.mjs:217— export-ats-text.loadProfile has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
tracker.exportMd (cyclomatic 19) tracker.mjs:1066— tracker.exportMd has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
validate-plugin-registry.validateRegistry (cyclomatic 19) validate-plugin-registry.mjs:19— validate-plugin-registry.validateRegistry has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
edit-job-modal.EditJobModal (cyclomatic 19) web/src/components/scheduled-scans/edit-job-modal.tsx:11— edit-job-modal.EditJobModal has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 31, handleSubmit). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
submit-guard.isSubmitControl (cyclomatic 19) web/src/lib/apply/submit-guard.mjs:241— submit-guard.isSubmitControl has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
drive.driveSession (cyclomatic 19) web/src/lib/apply/drive.ts:161— drive.driveSession has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
claude-usage-scan.createUsageScanner.scan (cyclomatic 19) web/src/lib/claude-usage-scan.mjs:99— claude-usage-scan.createUsageScanner.scan has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
pipeline-sort.sortRows (cyclomatic 19) web/src/lib/core/pipeline-sort.mjs:38— pipeline-sort.sortRows has cyclomatic complexity 19 (threshold 15). Of this number, 10 points are the body's own statements and 9 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
portals-config.setListInText (cyclomatic 19) REDACTED:116— portals-config.setListInText has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PipelineModel.renderPreview (cyclomatic 19) dashboard/internal/ui/screens/pipeline.go:1965— PipelineModel.renderPreview has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
requisitionIdsForDedup (cyclomatic 19) REDACTED:2612— requisitionIdsForDedup has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
scanJd (cyclomatic 19) jd-skill-gap.mjs:301— scanJd has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
fetchTextMeta (cyclomatic 19) REDACTED:431— fetchTextMeta has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
parseIcsDate (cyclomatic 19) ics-interview.mjs:123— parseIcsDate has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
fetch (cyclomatic 19) REDACTED:158— fetch has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
compileLatexFile (cyclomatic 19) generate-latex.mjs:180— compileLatexFile has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
archive-posting.main (cyclomatic 18) archive-posting.mjs:463— archive-posting.main has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
ats-payload.lintPayload (cyclomatic 18) ats-payload.mjs:402— ats-payload.lintPayload has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 414, 410). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
jd-rescue.main (cyclomatic 18) batch/jd-rescue.mjs:206— jd-rescue.main has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
build-cv-html.prepareCandidatePhoto (cyclomatic 18) build-cv-html.mjs:149— build-cv-html.prepareCandidatePhoto has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
build-cv-html.buildExperience (cyclomatic 18) build-cv-html.mjs:422— build-cv-html.buildExperience has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 449, 425). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
build-cv-html.main (cyclomatic 18) build-cv-html.mjs:1018— build-cv-html.main has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
cv-templates.atsLint (cyclomatic 18) REDACTED:534— cv-templates.atsLint has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
verify-portals.printResults (cyclomatic 18) REDACTED:948— verify-portals.printResults has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
stats.computeAllStats (cyclomatic 18) stats.mjs:619— stats.computeAllStats has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
followup-cadence.computeUrgency (cyclomatic 18) followup-cadence.mjs:817— followup-cadence.computeUrgency has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
closing-soon.readDate (cyclomatic 18) closing-soon.mjs:120— closing-soon.readDate has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
coverage-check.atsFromUrl (cyclomatic 18) coverage-check.mjs:55— coverage-check.atsFromUrl has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
fix-slugs.appendNote (cyclomatic 18) REDACTED:179— fix-slugs.appendNote has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
generate-latex.validateLatexContent (cyclomatic 18) generate-latex.mjs:104— generate-latex.validateLatexContent has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
hired-wall-build.main (cyclomatic 18) hired-wall-build.mjs:207— hired-wall-build.main has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
reply-proposals.validate (cyclomatic 18) lib/reply-proposals.mjs:45— reply-proposals.validate has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
patch-latex-content.main (cyclomatic 18) patch-latex-content.mjs:22— patch-latex-content.main has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
check.main (cyclomatic 18) plugins/h1b-sponsor/check.mjs:230— check.main has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
a16z-speedrun-talent.normalizeSpeedrunJob (cyclomatic 18) providers/a16z-speedrun-talent.mjs:98— a16z-speedrun-talent.normalizeSpeedrunJob has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
jobicy.parseJobicyResponse (cyclomatic 18) providers/jobicy.mjs:43— jobicy.parseJobicyResponse has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 53, toEpochMs). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
pythonorg.parsePythonOrgFeed (cyclomatic 18) REDACTED:85— pythonorg.parsePythonOrgFeed has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
update-system.worktreeUpdateTarget (cyclomatic 18) REDACTED:1406— update-system.worktreeUpdateTarget has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
update-system.configuredTemplateVariantsFromProfileSource (cyclomatic 18) REDACTED:1751— update-system.configuredTemplateVariantsFromProfileSource has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (update-system.configuredTemplateVariantsFromProfileSource::parseScalar) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
route.POST (cyclomatic 18) REDACTED:14— route.POST has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
page.ApplyPage (cyclomatic 18) web/src/app/pipeline/[id]/apply/page.tsx:19— page.ApplyPage has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
follow-up-card.FollowUpCard (cyclomatic 18) web/src/components/home/follow-up-card.tsx:27— follow-up-card.FollowUpCard has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
analytics-data.normalizeWorkMode (cyclomatic 18) REDACTED:53— analytics-data.normalizeWorkMode has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
profile-patch.profilePatchError (cyclomatic 18) web/src/lib/profile-patch.mjs:5— profile-patch.profilePatchError has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
report.issueBody (cyclomatic 18) web/src/lib/report/report.ts:127— report.issueBody has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
scheduled-jobs.parseScheduledJobInput (cyclomatic 18) web/src/lib/scheduled-jobs.ts:90— scheduled-jobs.parseScheduledJobInput has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
data.parseMarkdownLinks (cyclomatic 18) REDACTED:844— data.parseMarkdownLinks has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
StatsModel.renderPieChart (cyclomatic 18) dashboard/internal/ui/screens/stats.go:335— StatsModel.renderPieChart has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
redirectToMainCheckout (cyclomatic 18) REDACTED:1466— redirectToMainCheckout has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
collectSeenCompanyRoles::add (cyclomatic 18) REDACTED:2836— collectSeenCompanyRoles::add has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
mergeTracker (cyclomatic 18) merge-tracker.mjs:328— mergeTracker has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
matchJurisdiction (cyclomatic 18) REDACTED:351— matchJurisdiction has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
runHistorySeedScan (cyclomatic 18) scan-ats-full.mjs:936— runHistorySeedScan has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body's own statements and 8 belong to 10 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mapTrackerCaptureLinks (cyclomatic 18) check-jd-archive.mjs:410— mapTrackerCaptureLinks has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
findUnarchivedApplications (cyclomatic 18) check-jd-archive.mjs:573— findUnarchivedApplications has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
syncIndex (cyclomatic 18) tracker.mjs:702— syncIndex has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
renderTable (cyclomatic 18) tracker.mjs:1015— renderTable has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body's own statements and 9 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
aggregateGaps (cyclomatic 18) upskill.mjs:346— aggregateGaps has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body's own statements and 7 belong to 8 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
computeTrackerStats (cyclomatic 18) stats.mjs:77— computeTrackerStats has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
checkFreshness (cyclomatic 18) check-table-freshness.mjs:179— checkFreshness has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
planExpiredHistoryRows (cyclomatic 18) liveness-core.mjs:417— planExpiredHistoryRows has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
htmlToText (cyclomatic 18) closing-soon.mjs:254— htmlToText has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body's own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
validateTable (cyclomatic 18) REDACTED:74— validateTable has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body's own statements and 9 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
add-entry.applyAdd (cyclomatic 17) add-entry.mjs:170— add-entry.applyAdd has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
assessment-log.selfTest (cyclomatic 17) assessment-log.mjs:381— assessment-log.selfTest has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
jd-rescue.fromLdJson (cyclomatic 17) batch/jd-rescue.mjs:112— jd-rescue.fromLdJson has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
calibrate.loadLedgerReached (cyclomatic 17) calibrate.mjs:287— calibrate.loadLedgerReached has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
listing-fingerprint.validateListingFingerprint (cyclomatic 17) listing-fingerprint.mjs:111— listing-fingerprint.validateListingFingerprint has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
classify-tier.classifyTier (cyclomatic 17) classify-tier.mjs:30— classify-tier.classifyTier has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
scan.buildContentFilter (cyclomatic 17) REDACTED:836— scan.buildContentFilter has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 852, 862). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
scan.buildCooldownFilter (cyclomatic 17) REDACTED:1314— scan.buildCooldownFilter has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1321, 1352, 1350). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
company-history.loadStatusLogSource (cyclomatic 17) company-history.mjs:269— company-history.loadStatusLogSource has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
contacts.selfTest (cyclomatic 17) contacts.mjs:289— contacts.selfTest has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body's own statements and 3 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
coverage-check.main (cyclomatic 17) coverage-check.mjs:275— coverage-check.main has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
breezy.parseBreezyResponse (cyclomatic 17) providers/breezy.mjs:123— breezy.parseBreezyResponse has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
rippling.parseRipplingPage (cyclomatic 17) providers/rippling.mjs:126— rippling.parseRipplingPage has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 133, 154). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
filter-audit.audit (cyclomatic 17) filter-audit.mjs:125— filter-audit.audit has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
generate-cover-letter.buildRecipientBlock (cyclomatic 17) generate-cover-letter.mjs:170— generate-cover-letter.buildRecipientBlock has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body's own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
i18n-drift.main (cyclomatic 17) i18n-drift.mjs:283— i18n-drift.main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
intake.main (cyclomatic 17) intake.mjs:462— intake.main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
learn.apply (cyclomatic 17) learn.mjs:331— learn.apply has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
install-h1b-index.installIndex (cyclomatic 17) plugins/h1b-sponsor/install-h1b-index.mjs:203— install-h1b-index.installIndex has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
applitrack.parseApplitrackOutput (cyclomatic 17) providers/applitrack.mjs:115— applitrack.parseApplitrackOutput has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
arbeitnow.normalizeArbeitnowJob (cyclomatic 17) providers/arbeitnow.mjs:64— arbeitnow.normalizeArbeitnowJob has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
beesite.parseSearchResult (cyclomatic 17) providers/beesite.mjs:106— beesite.parseSearchResult has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
comeet.parseComeetResponse (cyclomatic 17) providers/comeet.mjs:115— comeet.parseComeetResponse has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 118, 152). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
flowxtra.normalizeFlowxtraJob (cyclomatic 17) providers/flowxtra.mjs:77— flowxtra.normalizeFlowxtraJob has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
generalist-world.stripNonRendered (cyclomatic 17) REDACTED:130— generalist-world.stripNonRendered has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
jobstreet.parseJobstreetItem (cyclomatic 17) providers/jobstreet.mjs:188— jobstreet.parseJobstreetItem has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
neogov.parseNeogovPage (cyclomatic 17) providers/neogov.mjs:157— neogov.parseNeogovPage has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
oraclecloud.resolveSite (cyclomatic 17) providers/oraclecloud.mjs:92— oraclecloud.resolveSite has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
taleo.parseTaleoResponse (cyclomatic 17) providers/taleo.mjs:145— taleo.parseTaleoResponse has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
telegram-channel.classifyLink (cyclomatic 17) REDACTED:200— telegram-channel.classifyLink has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
telegram-channel.parseChannelPage (cyclomatic 17) REDACTED:281— telegram-channel.parseChannelPage has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
tracker-sync-check.runSelfTest (cyclomatic 17) tracker-sync-check.mjs:552— tracker-sync-check.runSelfTest has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
update-system.rejectUserLayerPaths (cyclomatic 17) REDACTED:777— update-system.rejectUserLayerPaths has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body's own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
update-system.loadConfiguredTemplateVariants (cyclomatic 17) REDACTED:1851— update-system.loadConfiguredTemplateVariants has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
validate-portals.validateParser (cyclomatic 17) validate-portals.mjs:129— validate-portals.validateParser has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
beta-banner.BetaBanner (cyclomatic 17) web/src/components/beta/beta-banner.tsx:23— beta-banner.BetaBanner has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body's own statements and 8 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
cv-studio.Studio (cyclomatic 17) web/src/components/cv-studio/cv-studio.tsx:56— cv-studio.Studio has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body's own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
decision-card.DecisionCard (cyclomatic 17) web/src/components/home/decision-card.tsx:25— decision-card.DecisionCard has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
run-history-drawer.RunHistoryDrawer (cyclomatic 17) web/src/components/scheduled-scans/run-history-drawer.tsx:10— run-history-drawer.RunHistoryDrawer has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 45). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
drive.snapshot (cyclomatic 17) web/src/lib/apply/drive.ts:41— drive.snapshot has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
career-ops.readLanguageConfig (cyclomatic 17) web/src/lib/career-ops.ts:588— career-ops.readLanguageConfig has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
states.readCanonicalStates (cyclomatic 17) web/src/lib/core/states.ts:56— states.readCanonicalStates has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
studio.parseEdits (cyclomatic 17) web/src/lib/cv-studio/studio.mjs:139— studio.parseEdits has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 147, record, strings, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
studio.studioReducer (cyclomatic 17) web/src/lib/cv-studio/studio.mjs:184— studio.studioReducer has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PipelineModel.handleDiscardPicker (cyclomatic 17) dashboard/internal/ui/screens/pipeline.go:936— PipelineModel.handleDiscardPicker has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PipelineModel.renderAppLine (cyclomatic 17) dashboard/internal/ui/screens/pipeline.go:1866— PipelineModel.renderAppLine has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
parseArgs (cyclomatic 17) scan-ats-full.mjs:423— parseArgs has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body's own statements and 4 belong to 7 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
isPrivateIpv4 (cyclomatic 17) REDACTED:203— isPrivateIpv4 has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
proxyFor (cyclomatic 17) providers/_http.mjs:65— proxyFor has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
computeClosingSoon (cyclomatic 17) closing-soon.mjs:327— computeClosingSoon has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to 6 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
readBoundedText (cyclomatic 17) plugins/h1b-sponsor/lib/api.mjs:188— readBoundedText has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
add-entry.main (cyclomatic 16) add-entry.mjs:220— add-entry.main has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
liveness-browser.installLivenessRouteGuard (cyclomatic 16) liveness-browser.mjs:349— liveness-browser.installLivenessRouteGuard has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 352). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
audit-portals.findUnclaimedEntries (cyclomatic 16) audit-portals.mjs:290— audit-portals.findUnclaimedEntries has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
build-cv-html.buildEducation (cyclomatic 16) build-cv-html.mjs:537— build-cv-html.buildEducation has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 560, 540). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
career-profile.validateProfile::checkFact (cyclomatic 16) lib/career-profile.mjs:14— career-profile.validateProfile::checkFact has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
verify-portals.verifyOne (cyclomatic 16) REDACTED:875— verify-portals.verifyOne has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
verify-portals.main (cyclomatic 16) REDACTED:1139— verify-portals.main has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
scan.main::resolveEntries (cyclomatic 16) REDACTED:4139— scan.main::resolveEntries has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
check-table-freshness.extractRows (cyclomatic 16) check-table-freshness.mjs:141— check-table-freshness.extractRows has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
clean-markers.processFile (cyclomatic 16) clean-markers.mjs:56— clean-markers.processFile has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
process-quality.aggregateProcessQuality (cyclomatic 16) process-quality.mjs:173— process-quality.aggregateProcessQuality has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
funnel-velocity.parseStatusLog (cyclomatic 16) funnel-velocity.mjs:130— funnel-velocity.parseStatusLog has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
contacts.parseContacts (cyclomatic 16) contacts.mjs:111— contacts.parseContacts has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
debrief-sync.applyDebriefSync (cyclomatic 16) debrief-sync.mjs:209— debrief-sync.applyDebriefSync has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
workable.parseWorkableWidget (cyclomatic 16) providers/workable.mjs:263— workable.parseWorkableWidget has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pinpoint.parsePinpointResponse (cyclomatic 16) providers/pinpoint.mjs:124— pinpoint.parsePinpointResponse has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 128). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
discover-ats.dedupeAgainstPortals (cyclomatic 16) discover-ats.mjs:458— discover-ats.dedupeAgainstPortals has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
doctor.unpersonalizedFiles (cyclomatic 16) doctor.mjs:1281— doctor.unpersonalizedFiles has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
github-evidence.searchAuthoredCommits (cyclomatic 16) github-evidence.mjs:505— github-evidence.searchAuthoredCommits has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
github-evidence.countAuthoredCommits (cyclomatic 16) github-evidence.mjs:544— github-evidence.countAuthoredCommits has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
i18n-drift.compareStructure (cyclomatic 16) i18n-drift.mjs:106— i18n-drift.compareStructure has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
keyword-match.runSelfTest (cyclomatic 16) keyword-match.mjs:464— keyword-match.runSelfTest has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
learn.blockReason (cyclomatic 16) learn.mjs:165— learn.blockReason has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
onboard-write.buildPortals (cyclomatic 16) onboard-write.mjs:234— onboard-write.buildPortals has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
plugin-audit.auditPlugin (cyclomatic 16) plugin-audit.mjs:79— plugin-audit.auditPlugin has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
token.mintToken (cyclomatic 16) plugins/h1b-sponsor/token.mjs:99— token.mintToken has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
careerviet.parseListingPage (cyclomatic 16) providers/careerviet.mjs:207— careerviet.parseListingPage has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
hiringroom.parseJsonLdJobs (cyclomatic 16) providers/hiringroom.mjs:151— hiringroom.parseJsonLdJobs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
jazzhr.parseJazzHRList (cyclomatic 16) providers/jazzhr.mjs:123— jazzhr.parseJazzHRList has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
jibeapply.parseJibeapplyResponse (cyclomatic 16) providers/jibeapply.mjs:52— jibeapply.parseJibeapplyResponse has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 64). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
magneto.parseCards (cyclomatic 16) providers/magneto.mjs:88— magneto.parseCards has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
vdab.normalizeJob (cyclomatic 16) providers/vdab.mjs:126— vdab.normalizeJob has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
origin-guard.checkRequest (cyclomatic 16) web/src/lib/origin-guard.mjs:134— origin-guard.checkRequest has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
tracker.parseTracker (cyclomatic 16) tracker.mjs:532— tracker.parseTracker has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
update-system.reconcileGitignore (cyclomatic 16) REDACTED:4190— update-system.reconcileGitignore has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
route.GET (cyclomatic 16) REDACTED:22— route.GET has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (toOffer). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
triage-row.TriageRow (cyclomatic 16) web/src/components/inbox/triage-row.tsx:28— triage-row.TriageRow has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
status-select.StatusEditor::onChange (cyclomatic 16) web/src/components/status-select.tsx:64— status-select.StatusEditor::onChange has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
job-stream.readJobStream::consume (cyclomatic 16) web/src/lib/job-stream.mjs:21— job-stream.readJobStream::consume has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
data.enrichFromScanHistory (cyclomatic 16) REDACTED:496— data.enrichFromScanHistory has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
data.LoadPDFManifest (cyclomatic 16) dashboard/internal/data/pdf.go:157— data.LoadPDFManifest has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
buildCompanyCanonicalizer (cyclomatic 16) REDACTED:2210— buildCompanyCanonicalizer has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
parseBlacklist (cyclomatic 16) REDACTED:3453— parseBlacklist has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
matchInvite (cyclomatic 16) invite-match.mjs:758— matchInvite has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body's own statements and 5 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
cmdEvaluate (cyclomatic 16) openrouter-runner.mjs:675— cmdEvaluate has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
computeRunStats (cyclomatic 16) stats.mjs:551— computeRunStats has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to 9 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
readConfig (cyclomatic 16) providers/builtin.mjs:412— readConfig has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
parseGrokEvent (cyclomatic 16) web/src/lib/run-cli-support.mjs:326— parseGrokEvent has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D10 · Test Quality· Fixed-sleep synchronisation · ×1
Fixed-sleep synchronisation: request feedback is transition-only, quiet when closed and user-navigated web/tests/lib/assistant-request-feedback.browser.test.mjs:10— This test starts work it did not wait for (`input`, still running when the sleep starts) and then orders itself against it with `new Promise((resolve) => setTimeout(resolve, 500))` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
Races the wall clock: JD frontmatter round-trips through js-yaml with awkward values tests/apify-jds-data-root.test.mjs:89— This test reads `new Date()` and compares it against the value the code under test computed from its own clock read, compared exactly in `assert.equal(parsed.scraped, new Date().toISOString().slice(0, 10))`. Those are two independent clock reads, so the test passes only while no boundary falls between them — a second ticking over between the code's read and the test's, or, for a date, a day that differs between the machine's local zone and UTC. It passes or fails on the time of day and the build agent's time zone, and re-running the suite on one machine cannot reveal it. Read the clock once: give the code under test a clock the test controls (a fake time provider, fake timers with a fixed system time) and build the expectation from that same instant, or assert a range rather than an exact value.
D2 · Cognitive Complexity· main (cognitive 282) · ×1
main (cognitive 282) REDACTED:3989— main has cognitive complexity 282 (threshold 15). Drivers by points: if/else 140 (256 pts), boolean chains 71, loops 31 (57 pts), ternaries 24 (50 pts), other 9, error handling 4 (5 pts) (nesting depth added 169). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
explore-provider.ExploreProvider (cognitive 175) web/src/components/explore/explore-provider.tsx:132— explore-provider.ExploreProvider has cognitive complexity 175 (threshold 15). Drivers by points: if/else 63 (89 pts), ternaries 22 (39 pts), boolean chains 23, error handling 11 (14 pts), loops 6 (9 pts), match/switch 1 (nesting depth added 49). None of this is in the body itself: all 175 points belong to 19 function literals inside it that branch (lines 175, 466, 213, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
apply (cognitive 166) REDACTED:4515— apply has cognitive complexity 166 (threshold 15). Drivers by points: if/else 53 (83 pts), error handling 18 (28 pts), ternaries 14 (23 pts), loops 10 (18 pts), boolean chains 14 (nesting depth added 57). Of this number, 164 points are the body's own statements and 2 belong to 17 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scan-ats-full.main (cognitive 162) scan-ats-full.mjs:1156— scan-ats-full.main has cognitive complexity 162 (threshold 15). Drivers by points: if/else 78 (159 pts), ternaries 28 (51 pts), boolean chains 44, error handling 5 (14 pts), loops 7 (11 pts) (nesting depth added 117). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
sync-pdf-flags.syncTrackerPdfFlags (cognitive 148) sync-pdf-flags.mjs:56— sync-pdf-flags.syncTrackerPdfFlags has cognitive complexity 148 (threshold 15). Drivers by points: if/else 46 (92 pts), ternaries 5 (23 pts), boolean chains 13, error handling 6 (11 pts), loops 4 (9 pts) (nesting depth added 74). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
runSelfTest (cognitive 139) analyze-patterns.mjs:433— runSelfTest has cognitive complexity 139 (threshold 15). Drivers by points: if/else 76 (101 pts), boolean chains 15, loops 9, ternaries 3 (6 pts), error handling 2 (4 pts), other 4 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
validate-portals.validatePortalsConfig (cognitive 130) validate-portals.mjs:190— validate-portals.validatePortalsConfig has cognitive complexity 130 (threshold 15). Drivers by points: if/else 61 (139 pts), loops 8 (26 pts), boolean chains 18, ternaries 5 (17 pts) (nesting depth added 108). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (validate-portals.validatePortalsConfig::validateEntryList) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
aggregate-tokens.main (cognitive 126) batch/aggregate-tokens.mjs:30— aggregate-tokens.main has cognitive complexity 126 (threshold 15). Drivers by points: if/else 36 (106 pts), loops 6 (11 pts), ternaries 3 (5 pts), boolean chains 4 (nesting depth added 77). Of this number, 123 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
apply-provider.ApplyProvider (cognitive 120) web/src/components/apply/apply-provider.tsx:61— apply-provider.ApplyProvider has cognitive complexity 120 (threshold 15). Drivers by points: if/else 49 (73 pts), boolean chains 15, ternaries 5 (14 pts), error handling 7 (11 pts), loops 5 (7 pts) (nesting depth added 39). None of this is in the body itself: all 120 points belong to 12 function literals inside it that branch (lines 223, 107, 316, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
update-system.locallyModifiedSystemFiles (cognitive 119) REDACTED:2399— update-system.locallyModifiedSystemFiles has cognitive complexity 119 (threshold 15). Drivers by points: if/else 18 (55 pts), loops 9 (25 pts), error handling 9 (19 pts), boolean chains 12, ternaries 3 (8 pts) (nesting depth added 68). Of this number, 102 points are the body's own statements and 17 belong to 2 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
route.POST (cognitive 114) web/src/app/api/run/route.ts:33— route.POST has cognitive complexity 114 (threshold 15). Drivers by points: if/else 59 (71 pts), ternaries 15 (20 pts), boolean chains 13, error handling 6 (7 pts), loops 3 (nesting depth added 18). Of this number, 39 points are the body's own statements and 75 belong to 15 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
fetch (cognitive 107) providers/arbeitsagentur.mjs:178— fetch has cognitive complexity 107 (threshold 15). Drivers by points: if/else 18 (51 pts), boolean chains 20, loops 6 (15 pts), error handling 4 (12 pts), ternaries 5 (9 pts) (nesting depth added 54). Of this number, 87 points are the body's own statements and 20 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
doImport (cognitive 99) career-profile.mjs:189— doImport has cognitive complexity 99 (threshold 15). Drivers by points: if/else 23 (44 pts), ternaries 6 (22 pts), loops 9 (17 pts), other 7, boolean chains 6, error handling 2 (3 pts) (nesting depth added 46). Of this number, 45 points are the body's own statements and 54 belong to 12 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity· main (cognitive 96) · ×1
main (cognitive 96) check-liveness.mjs:159— main has cognitive complexity 96 (threshold 15). Drivers by points: if/else 27 (43 pts), ternaries 15 (32 pts), boolean chains 8, error handling 3 (6 pts), loops 3 (6 pts), other 1 (nesting depth added 39). Of this number, 88 points are the body's own statements and 8 belong to 12 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetch (cognitive 95) REDACTED:323— fetch has cognitive complexity 95 (threshold 15). Drivers by points: if/else 20 (56 pts), ternaries 5 (13 pts), loops 4 (9 pts), boolean chains 8, error handling 3 (8 pts), other 1 (nesting depth added 54). Of this number, 88 points are the body's own statements and 7 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
fetchCsb (cognitive 94) REDACTED:326— fetchCsb has cognitive complexity 94 (threshold 15). Drivers by points: if/else 13 (56 pts), ternaries 4 (18 pts), loops 5 (15 pts), boolean chains 4, error handling 1 (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
inbox-triage.InboxTriage (cognitive 90) web/src/components/inbox/inbox-triage.tsx:28— inbox-triage.InboxTriage has cognitive complexity 90 (threshold 15). Drivers by points: boolean chains 28, if/else 23 (28 pts), ternaries 16 (22 pts), error handling 4 (6 pts), loops 6 (nesting depth added 13). Of this number, 18 points are the body's own statements and 72 belong to 26 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
runSelfTest (cognitive 90) build-cv-html.mjs:1108— runSelfTest has cognitive complexity 90 (threshold 15). Drivers by points: if/else 50 (59 pts), boolean chains 16, loops 9, error handling 5, ternaries 1 (nesting depth added 9). Of this number, 86 points are the body's own statements and 4 belong to 10 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
followups-view.FollowupsView (cognitive 86) web/src/components/followups/followups-view.tsx:86— followups-view.FollowupsView has cognitive complexity 86 (threshold 15). Drivers by points: ternaries 23 (55 pts), if/else 16 (17 pts), boolean chains 12, error handling 1, loops 1 (nesting depth added 33). Of this number, 29 points are the body's own statements and 57 belong to 14 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract.extractForm (cognitive 86) web/src/lib/apply/extract.ts:22— extract.extractForm has cognitive complexity 86 (threshold 15). Drivers by points: if/else 27 (49 pts), boolean chains 25, ternaries 4 (8 pts), loops 3 (4 pts) (nesting depth added 27). None of this is in the body itself: all 86 points belong to 10 function literals inside it that branch (lines 23, 52, 91, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
salary-gap.printSummary (cognitive 85) REDACTED:1542— salary-gap.printSummary has cognitive complexity 85 (threshold 15). Drivers by points: ternaries 14 (34 pts), if/else 19 (25 pts), loops 11 (24 pts), boolean chains 2 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
export-ats-text.parseCvMarkdown (cognitive 85) scripts/export-ats-text.mjs:34— export-ats-text.parseCvMarkdown has cognitive complexity 85 (threshold 15). Drivers by points: if/else 19 (39 pts), loops 9 (25 pts), ternaries 4 (14 pts), boolean chains 7 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PipelineModel.handleKey (cognitive 84) dashboard/internal/ui/screens/pipeline.go:564— PipelineModel.handleKey has cognitive complexity 84 (threshold 15). Drivers by points: if/else 30 (73 pts), loops 2 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 47). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
route.POST (cognitive 81) web/src/app/api/explore/ai/route.ts:48— route.POST has cognitive complexity 81 (threshold 15). Drivers by points: if/else 34 (42 pts), error handling 11 (16 pts), boolean chains 11, ternaries 7 (11 pts), loops 1 (nesting depth added 17). Of this number, 25 points are the body's own statements and 56 belong to 11 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
buildEvidence (cognitive 81) github-evidence.mjs:195— buildEvidence has cognitive complexity 81 (threshold 15). Drivers by points: boolean chains 30, if/else 16 (26 pts), other 10, ternaries 6 (8 pts), loops 7 (nesting depth added 12). Of this number, 57 points are the body's own statements and 24 belong to 16 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
coverage-check.diagnose (cognitive 78) coverage-check.mjs:123— coverage-check.diagnose has cognitive complexity 78 (threshold 15). Drivers by points: ternaries 15 (33 pts), if/else 17 (28 pts), boolean chains 17 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extractPanelists (cognitive 78) REDACTED:177— extractPanelists has cognitive complexity 78 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 7 (14 pts), ternaries 7 (13 pts), boolean chains 12, other 1 (nesting depth added 35). Of this number, 56 points are the body's own statements and 22 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
export-ats-text.formatAtsText (cognitive 77) scripts/export-ats-text.mjs:277— export-ats-text.formatAtsText has cognitive complexity 77 (threshold 15). Drivers by points: if/else 22 (37 pts), ternaries 9 (21 pts), boolean chains 19 (nesting depth added 27). Of this number, 31 points are the body's own statements and 46 belong to 7 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetch (cognitive 75) providers/gupy.mjs:341— fetch has cognitive complexity 75 (threshold 15). Drivers by points: if/else 17 (49 pts), boolean chains 8, ternaries 5 (8 pts), loops 3 (6 pts), error handling 1 (3 pts), other 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pipeline-view.PipelineView (cognitive 74) web/src/components/pipeline-view.tsx:30— pipeline-view.PipelineView has cognitive complexity 74 (threshold 15). Drivers by points: ternaries 19 (33 pts), boolean chains 20, if/else 16 (20 pts), loops 1 (nesting depth added 18). Of this number, 21 points are the body's own statements and 53 belong to 14 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rollback (cognitive 73) REDACTED:5558— rollback has cognitive complexity 73 (threshold 15). Drivers by points: if/else 26 (43 pts), error handling 8 (15 pts), loops 6 (8 pts), boolean chains 4, ternaries 2, other 1 (nesting depth added 26). Of this number, 65 points are the body's own statements and 8 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
checkUrlLiveness (cognitive 72) liveness-browser.mjs:469— checkUrlLiveness has cognitive complexity 72 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 15, error handling 7 (14 pts), loops 4 (5 pts), other 5, ternaries 3 (5 pts) (nesting depth added 18). Of this number, 29 points are the body's own statements and 43 belong to 14 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
selfTest (cognitive 71) REDACTED:746— selfTest has cognitive complexity 71 (threshold 15). Drivers by points: boolean chains 67, loops 3, if/else 1. Of this number, 59 points are the body's own statements and 12 belong to 34 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
mapTrackerToApps (cognitive 69) REDACTED:1362— mapTrackerToApps has cognitive complexity 69 (threshold 15). Drivers by points: if/else 15 (43 pts), boolean chains 17, loops 4 (5 pts), ternaries 1 (3 pts), other 1 (nesting depth added 31). Of this number, 68 points are the body's own statements and 1 belongs to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetch (cognitive 69) providers/workday.mjs:807— fetch has cognitive complexity 69 (threshold 15). Drivers by points: if/else 37 (77 pts), ternaries 22 (50 pts), boolean chains 15, loops 5 (11 pts), error handling 4 (10 pts), other 2 (nesting depth added 80). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity· main (cognitive 69) · ×1
main (cognitive 69) audit-portals.mjs:379— main has cognitive complexity 69 (threshold 15). Drivers by points: if/else 20 (40 pts), loops 5 (13 pts), boolean chains 9, ternaries 3 (5 pts), error handling 1 (2 pts) (nesting depth added 31). Of this number, 68 points are the body's own statements and 1 belongs to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
reply-matcher.matchCandidates (cognitive 68) reply-matcher.mjs:468— reply-matcher.matchCandidates has cognitive complexity 68 (threshold 15). Drivers by points: if/else 18 (42 pts), boolean chains 23, loops 2 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
reconcile-pipeline.reconcile (cognitive 67) REDACTED:197— reconcile-pipeline.reconcile has cognitive complexity 67 (threshold 15). Drivers by points: if/else 24 (44 pts), boolean chains 9, loops 8 (9 pts), ternaries 4 (5 pts) (nesting depth added 22). Of this number, 56 points are the body's own statements and 11 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
session.fillSession (cognitive 66) web/src/lib/apply/session.ts:423— session.fillSession has cognitive complexity 66 (threshold 15). Drivers by points: if/else 19 (36 pts), error handling 7 (17 pts), boolean chains 5, ternaries 1 (5 pts), loops 2 (3 pts) (nesting depth added 32). Of this number, 59 points are the body's own statements and 7 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity· main (cognitive 66) · ×1
main (cognitive 66) reply-watch.mjs:276— main has cognitive complexity 66 (threshold 15). Drivers by points: if/else 15 (23 pts), ternaries 10 (20 pts), boolean chains 10, loops 5 (9 pts), error handling 2 (4 pts) (nesting depth added 24). Of this number, 40 points are the body's own statements and 26 belong to 10 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetch (cognitive 65) providers/eightfold.mjs:357— fetch has cognitive complexity 65 (threshold 15). Drivers by points: if/else 14 (30 pts), ternaries 7 (18 pts), boolean chains 10, error handling 2 (6 pts), loops 1 (nesting depth added 31). Of this number, 61 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
discover-ats.resolveCompany (cognitive 64) discover-ats.mjs:681— discover-ats.resolveCompany has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (32 pts), ternaries 7 (22 pts), boolean chains 9, loops 1 (nesting depth added 29). Of this number, 63 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
apply-view.FieldRow (cognitive 64) web/src/components/apply-view.tsx:533— apply-view.FieldRow has cognitive complexity 64 (threshold 15). Drivers by points: ternaries 18 (52 pts), boolean chains 11, if/else 1 (nesting depth added 34). Of this number, 57 points are the body's own statements and 7 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
today-dashboard.TodayDashboard (cognitive 62) web/src/components/home/today-dashboard.tsx:28— today-dashboard.TodayDashboard has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 17 (33 pts), boolean chains 18, if/else 10, error handling 1 (nesting depth added 16). Of this number, 43 points are the body's own statements and 19 belong to 13 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetch (cognitive 62) REDACTED:776— fetch has cognitive complexity 62 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 9, ternaries 4 (9 pts), loops 5 (7 pts), error handling 2 (5 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
validate-portals.validatePortalsConfig::validateEntryList (cognitive 61) validate-portals.mjs:407— validate-portals.validatePortalsConfig::validateEntryList has cognitive complexity 61 (threshold 15). Drivers by points: if/else 18 (39 pts), boolean chains 9, ternaries 3 (9 pts), loops 2 (4 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (validate-portals.validatePortalsConfig) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
fold (cognitive 61) REDACTED:533— fold has cognitive complexity 61 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 9 (17 pts), boolean chains 13, loops 5, other 4 (nesting depth added 19). Of this number, 57 points are the body's own statements and 4 belong to 12 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
analyze (cognitive 59) analyze-patterns.mjs:1352— analyze has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (33 pts), boolean chains 14, loops 5 (6 pts), ternaries 6 (nesting depth added 13). Of this number, 40 points are the body's own statements and 19 belong to 25 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
analyze-patterns.parseReport (cognitive 58) analyze-patterns.mjs:974— analyze-patterns.parseReport has cognitive complexity 58 (threshold 15). Drivers by points: boolean chains 27, if/else 19 (25 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
verify-cv-facts.factClaims (cognitive 58) REDACTED:906— verify-cv-facts.factClaims has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 8 (31 pts), loops 4 (10 pts), if/else 2 (9 pts), boolean chains 8 (nesting depth added 36). Of this number, 57 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
route.POST (cognitive 58) REDACTED:68— route.POST has cognitive complexity 58 (threshold 15). Drivers by points: if/else 26 (38 pts), boolean chains 8, error handling 6 (8 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 15). Of this number, 32 points are the body's own statements and 26 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_engine.validateManifest (cognitive 57) plugins/_engine.mjs:182— _engine.validateManifest has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (32 pts), boolean chains 15, ternaries 7, loops 3 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
data.ComputeProgressMetrics (cognitive 57) REDACTED:1070— data.ComputeProgressMetrics has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (42 pts), loops 8 (11 pts), match/switch 2 (4 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
renderSummary (cognitive 57) funnel-velocity.mjs:460— renderSummary has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (26 pts), ternaries 9 (21 pts), loops 4 (7 pts), other 2, boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
runSelfTest (cognitive 57) build-cv-latex.mjs:288— runSelfTest has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (31 pts), boolean chains 11, loops 8, ternaries 4, error handling 2 (3 pts) (nesting depth added 8). Of this number, 50 points are the body's own statements and 7 belong to 13 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
parseCv (cognitive 57) career-profile.mjs:71— parseCv has cognitive complexity 57 (threshold 15). Drivers by points: if/else 21 (35 pts), loops 8 (18 pts), boolean chains 3, other 1 (nesting depth added 24). Of this number, 30 points are the body's own statements and 27 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
data.ComputeStatsMetrics (cognitive 56) dashboard/internal/data/stats.go:180— data.ComputeStatsMetrics has cognitive complexity 56 (threshold 15). Drivers by points: if/else 20 (36 pts), loops 10 (13 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 22). Of this number, 53 points are the body's own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity· main (cognitive 56) · ×1
main (cognitive 56) scan-interamt.mjs:274— main has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (38 pts), loops 4 (7 pts), ternaries 3 (7 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
printSummary (cognitive 55) analyze-patterns.mjs:1656— printSummary has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (21 pts), loops 11 (20 pts), ternaries 3 (8 pts), boolean chains 5, other 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
computeVelocity (cognitive 55) funnel-velocity.mjs:235— computeVelocity has cognitive complexity 55 (threshold 15). Drivers by points: if/else 8 (34 pts), ternaries 3 (10 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scan.collectSeenUrls (cognitive 54) REDACTED:2028— scan.collectSeenUrls has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 10, loops 5 (8 pts), ternaries 1 (3 pts) (nesting depth added 23). Of this number, 52 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
upskill.runSelfTest (cognitive 54) upskill.mjs:584— upskill.runSelfTest has cognitive complexity 54 (threshold 15). Drivers by points: if/else 33 (44 pts), boolean chains 4, error handling 2 (4 pts), loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
explorer-view.ExplorerView (cognitive 54) web/src/components/explore/explorer-view.tsx:33— explorer-view.ExplorerView has cognitive complexity 54 (threshold 15). Drivers by points: boolean chains 34, ternaries 7 (11 pts), if/else 7 (8 pts), error handling 1 (nesting depth added 5). Of this number, 37 points are the body's own statements and 17 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
cv-ingest.CvIngest (cognitive 53) web/src/components/cv/cv-ingest.tsx:31— cv-ingest.CvIngest has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (27 pts), boolean chains 12, ternaries 7 (11 pts), error handling 2, loops 1 (nesting depth added 12). Most of this is not in the body itself: 11 of the 53 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 45, save, a function literal at line 203, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
computePortalStats (cognitive 53) stats.mjs:306— computePortalStats has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (33 pts), boolean chains 9, loops 4 (7 pts), ternaries 2, error handling 1, other 1 (nesting depth added 24). Of this number, 52 points are the body's own statements and 1 belongs to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity· main (cognitive 53) · ×1
main (cognitive 53) scan-dayforce.mjs:626— main has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (29 pts), loops 9 (17 pts), ternaries 2 (5 pts), boolean chains 1, other 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
build-cv-html.renderMarkdown (cognitive 52) build-cv-html.mjs:891— build-cv-html.renderMarkdown has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (23 pts), ternaries 10 (15 pts), boolean chains 7, loops 6 (7 pts) (nesting depth added 14). Of this number, 41 points are the body's own statements and 11 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cv-sync-check.main (cognitive 52) cv-sync-check.mjs:62— cv-sync-check.main has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (23 pts), ternaries 5 (18 pts), loops 3 (6 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
i18n-drift.extractHeadings (cognitive 52) i18n-drift.mjs:27— i18n-drift.extractHeadings has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 8, ternaries 2 (8 pts), loops 2 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cssDeclarations (cognitive 52) verify-ats.mjs:350— cssDeclarations has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 11, ternaries 3 (11 pts), loops 3 (8 pts) (nesting depth added 23). Of this number, 51 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
employer-source.scanEmployer (cognitive 50) web/src/lib/core/employer-source.mjs:9— employer-source.scanEmployer has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 11 (21 pts), if/else 9 (14 pts), boolean chains 10, error handling 2 (3 pts), loops 2 (nesting depth added 16). Of this number, 23 points are the body's own statements and 27 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
appModel.Update (cognitive 50) dashboard/main.go:106— appModel.Update has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (41 pts), loops 1 (4 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 27). Of this number, 48 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
walk-tree.walkTree::walk (cognitive 49) lib/walk-tree.mjs:170— walk-tree.walkTree::walk has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (36 pts), error handling 3 (8 pts), boolean chains 4, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
printSummary (cognitive 49) assessment-log.mjs:445— printSummary has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 10 (31 pts), if/else 6 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generate-pdf.generatePDF (cognitive 48) REDACTED:1577— generate-pdf.generatePDF has cognitive complexity 48 (threshold 15). Drivers by points: if/else 31 (37 pts), boolean chains 7, error handling 2, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
contact-extract.main (cognitive 48) contact-extract.mjs:239— contact-extract.main has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 16, ternaries 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verify-cv-structure.runCli (cognitive 48) verify-cv-structure.mjs:614— verify-cv-structure.runCli has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (21 pts), ternaries 5 (14 pts), boolean chains 5, loops 3 (5 pts), error handling 3 (nesting depth added 15). Of this number, 47 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
route.POST (cognitive 48) web/src/app/api/assistant/route.ts:43— route.POST has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (22 pts), ternaries 9 (13 pts), error handling 6 (8 pts), boolean chains 4, loops 1 (nesting depth added 11). Of this number, 24 points are the body's own statements and 24 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract-json-object.extractJsonObject (cognitive 48) web/src/lib/extract-json-object.mjs:24— extract-json-object.extractJsonObject has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22 (37 pts), loops 5 (6 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 18). Of this number, 44 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ViewerModel.renderAll (cognitive 48) dashboard/internal/ui/screens/viewer.go:335— ViewerModel.renderAll has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 8 (20 pts), boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
computeResponsiveness (cognitive 48) company-history.mjs:348— computeResponsiveness has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 11 (20 pts), boolean chains 5, loops 1, other 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
computePortalRecommendations (cognitive 48) stats.mjs:394— computePortalRecommendations has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 16, ternaries 4 (7 pts), loops 4, other 3, error handling 1 (nesting depth added 10). Of this number, 44 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseRecruiteeResponse (cognitive 48) providers/recruitee.mjs:446— parseRecruiteeResponse has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 8 (20 pts), if/else 7 (15 pts), boolean chains 5, loops 3 (5 pts), error handling 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetch (cognitive 48) providers/techinasia.mjs:318— fetch has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 8, ternaries 4 (6 pts), loops 3, error handling 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
diagnose.verifyFill (cognitive 47) web/src/lib/apply/diagnose.ts:213— diagnose.verifyFill has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 14, ternaries 3 (6 pts), loops 3 (nesting depth added 12). Most of this is not in the body itself: 9 of the 47 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 218, 214, 219). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
runBatchFromManifest (cognitive 47) REDACTED:1839— runBatchFromManifest has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 13, error handling 6 (7 pts), other 4, ternaries 1 (3 pts), loops 1 (nesting depth added 11). Of this number, 46 points are the body's own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cmdRun (cognitive 47) plugins.mjs:209— cmdRun has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (26 pts), ternaries 6 (11 pts), boolean chains 5, loops 2 (4 pts), other 1 (nesting depth added 15). Of this number, 46 points are the body's own statements and 1 belongs to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetch (cognitive 47) REDACTED:379— fetch has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 10, ternaries 4 (8 pts), loops 2 (3 pts), error handling 1 (2 pts), other 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
computeStatsMetrics (cognitive 47) web/src/lib/analytics-metrics.mjs:232— computeStatsMetrics has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 8 (16 pts), other 7, boolean chains 4, loops 1 (nesting depth added 18). Of this number, 45 points are the body's own statements and 2 belong to 10 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fingerprint-core.findCrossListings (cognitive 46) fingerprint-core.mjs:209— fingerprint-core.findCrossListings has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (26 pts), ternaries 7 (13 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vc-portfolios.parseA16zPayload (cognitive 46) seeds/vc-portfolios.mjs:187— vc-portfolios.parseA16zPayload has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (22 pts), ternaries 3 (10 pts), boolean chains 7, loops 4 (5 pts), error handling 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verify-ats.auditAts (cognitive 46) verify-ats.mjs:464— verify-ats.auditAts has cognitive complexity 46 (threshold 15). Drivers by points: if/else 27 (31 pts), loops 4 (7 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
data.ParseApplications (cognitive 46) REDACTED:199— data.ParseApplications has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 5, loops 2 (nesting depth added 20). Of this number, 42 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity· main (cognitive 46) · ×1
main (cognitive 46) rank-pipeline.mjs:408— main has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (26 pts), loops 4 (7 pts), boolean chains 5, ternaries 4, error handling 1 (2 pts), other 2 (nesting depth added 12). Of this number, 41 points are the body's own statements and 5 belong to 9 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetch (cognitive 46) providers/ultipro.mjs:365— fetch has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 3 (5 pts), boolean chains 4, error handling 1 (3 pts), ternaries 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
company-history.buildCompanyCards (cognitive 45) company-history.mjs:469— company-history.buildCompanyCards has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 9, ternaries 8 (9 pts), loops 6 (8 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ashby.formatLocation (cognitive 45) providers/ashby.mjs:334— ashby.formatLocation has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 8, loops 3 (8 pts), ternaries 3 (5 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseIcs (cognitive 45) ics-interview.mjs:274— parseIcs has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 15, ternaries 7 (9 pts), other 1 (nesting depth added 6). Of this number, 42 points are the body's own statements and 3 belong to 5 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
update-system.revertPaths (cognitive 44) REDACTED:2889— update-system.revertPaths has cognitive complexity 44 (threshold 15). Drivers by points: error handling 5 (19 pts), if/else 9 (17 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 23). Of this number, 43 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
readDom (cognitive 44) browser-extract.mjs:965— readDom has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 7 (16 pts), if/else 7 (12 pts), boolean chains 10, loops 3 (4 pts), error handling 1 (2 pts) (nesting depth added 16). None of this is in the body itself: all 44 points belong to 8 function items inside it that branch (a function literal at line 966, (anonymous)::strippedText, a function literal at line 1002, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
callOpenRouter (cognitive 44) openrouter-runner.mjs:247— callOpenRouter has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (32 pts), error handling 3 (6 pts), other 3, boolean chains 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
computeRejectionLatency (cognitive 44) rejection-latency.mjs:309— computeRejectionLatency has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (27 pts), ternaries 6 (8 pts), boolean chains 7, loops 2 (nesting depth added 15). Of this number, 42 points are the body's own statements and 2 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
stats.printSummary (cognitive 43) stats.mjs:694— stats.printSummary has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 9 (19 pts), if/else 16 (18 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scheduled-jobs-view.ScheduledJobsView (cognitive 43) web/src/components/scheduled-jobs-view.tsx:47— scheduled-jobs-view.ScheduledJobsView has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 13 (17 pts), boolean chains 13, if/else 9, error handling 4 (nesting depth added 4). Most of this is not in the body itself: 11 of the 43 points are its own statements and the rest belongs to 7 function items inside it that branch (loadData, handleDelete, handleTriggerOsScheduler, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
data.parseStatusLedger (cognitive 43) dashboard/internal/data/funnel_history.go:91— data.parseStatusLedger has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 6 (11 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 23). Of this number, 42 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verifyOffers (cognitive 43) REDACTED:3780— verifyOffers has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (25 pts), ternaries 5 (8 pts), error handling 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 16). Of this number, 31 points are the body's own statements and 12 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
renderSummary (cognitive 43) linkedin-join.mjs:591— renderSummary has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (23 pts), ternaries 6 (13 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 20). Of this number, 42 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scan-hn.main (cognitive 42) scan-hn.mjs:109— scan-hn.main has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 5, loops 2 (4 pts), error handling 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
assistant-console.AssistantConsole::send (cognitive 42) web/src/components/assistant-console.tsx:673— assistant-console.AssistantConsole::send has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 8, loops 4 (7 pts), ternaries 3 (6 pts), error handling 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (assistant-console.AssistantConsole) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
documents.discoverDocuments (cognitive 42) web/src/lib/documents.ts:25— documents.discoverDocuments has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (28 pts), error handling 4 (7 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 19). Of this number, 41 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
data.enrichAppURLsByCompany (cognitive 42) REDACTED:567— data.enrichAppURLsByCompany has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 4 (9 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseMarkdownRows (cognitive 42) tracker.mjs:370— parseMarkdownRows has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 6, ternaries 4 (6 pts), loops 2 (3 pts), other 3 (nesting depth added 16). Of this number, 39 points are the body's own statements and 3 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
check-jd-archive.checkJdArchive (cognitive 41) check-jd-archive.mjs:467— check-jd-archive.checkJdArchive has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 9 (23 pts), if/else 6 (11 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 20). Of this number, 40 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extractContacts::add (cognitive 41) followup-cadence.mjs:710— extractContacts::add has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 8, loops 2 (4 pts), ternaries 4, other 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
searchInteramt (cognitive 41) scan-interamt.mjs:159— searchInteramt has cognitive complexity 41 (threshold 15). Drivers by points: error handling 11 (26 pts), if/else 8 (13 pts), loops 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
personalization.scanHeadings (cognitive 40) lib/personalization.mjs:28— personalization.scanHeadings has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 3 (11 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
discovery-card.DiscoveryCard (cognitive 40) web/src/components/explore/discovery-card.tsx:42— discovery-card.DiscoveryCard has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 10 (25 pts), boolean chains 15 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
personalization-file.mergeSections (cognitive 40) web/src/lib/personalization-file.mjs:34— personalization-file.mergeSections has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 7 (16 pts), boolean chains 5, loops 3 (nesting depth added 15). Of this number, 38 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
checkMainChannel (cognitive 40) REDACTED:3943— checkMainChannel has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 8 (14 pts), boolean chains 11, if/else 8, error handling 4 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scanBoard (cognitive 40) scan-dayforce.mjs:464— scanBoard has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 6, ternaries 3 (6 pts), error handling 2 (3 pts), loops 3, other 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseEightfoldResponse (cognitive 40) providers/eightfold.mjs:263— parseEightfoldResponse has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 3 (6 pts), boolean chains 3, error handling 1 (3 pts), other 3, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
prevueaps.parsePrevueapsResponse (cognitive 39) providers/prevueaps.mjs:202— prevueaps.parsePrevueapsResponse has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 5 (11 pts), boolean chains 6, error handling 1 (3 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
run-history-drawer.RunHistoryDrawer (cognitive 39) web/src/components/scheduled-scans/run-history-drawer.tsx:10— run-history-drawer.RunHistoryDrawer has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 11 (34 pts), boolean chains 4, if/else 1 (nesting depth added 23). Most of this is not in the body itself: 2 of the 39 points are its own statements and the rest belongs to one function literal inside it that branches (line 45). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
parseCompensation (cognitive 39) providers/ashby.mjs:57— parseCompensation has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 8 (9 pts), boolean chains 8, other 8 (nesting depth added 4). Of this number, 26 points are the body's own statements and 13 belong to 6 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
jsonc-parse.stripJsoncSyntax (cognitive 38) jsonc-parse.mjs:26— jsonc-parse.stripJsoncSyntax has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
doctor.unpersonalizedFiles (cognitive 38) doctor.mjs:1281— doctor.unpersonalizedFiles has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (20 pts), ternaries 4 (14 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
persist-evaluation-report.writeEvaluationArtifacts (cognitive 38) persist-evaluation-report.mjs:44— persist-evaluation-report.writeEvaluationArtifacts has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 11, ternaries 3 (4 pts), error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
api.requestJson (cognitive 38) plugins/h1b-sponsor/lib/api.mjs:245— api.requestJson has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (23 pts), error handling 5 (7 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 11). Of this number, 20 points are the body's own statements and 18 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
assistant-history.cleanMessages (cognitive 38) web/src/lib/assistant-history.mjs:5— assistant-history.cleanMessages has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 7 (15 pts), if/else 12, boolean chains 11 (nesting depth added 8). Most of this is not in the body itself: 2 of the 38 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 11, 7). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
data.deriveNoteFields (cognitive 38) dashboard/internal/data/derive.go:158— data.deriveNoteFields has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 4, loops 4, match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StatsModel.renderPieChart (cognitive 38) dashboard/internal/ui/screens/stats.go:335— StatsModel.renderPieChart has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 6 (10 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
classifyRows (cognitive 38) close-stale.mjs:192— classifyRows has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (18 pts), other 8, ternaries 3 (6 pts), boolean chains 3, loops 3 (nesting depth added 12). Of this number, 37 points are the body's own statements and 1 belongs to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verify-cv-facts.runCli (cognitive 37) REDACTED:2937— verify-cv-facts.runCli has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 3 (6 pts), ternaries 3 (5 pts), boolean chains 3, error handling 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cv-title-check.parseCvExperience (cognitive 37) cv-title-check.mjs:93— cv-title-check.parseCvExperience has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (30 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
reply-proposals.readReplyProposals (cognitive 37) lib/reply-proposals.mjs:72— reply-proposals.readReplyProposals has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 5, error handling 2 (3 pts), loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
hiringroom.parseJsonLdJobs (cognitive 37) providers/hiringroom.mjs:151— hiringroom.parseJsonLdJobs has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (22 pts), error handling 2 (5 pts), ternaries 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
platsbanken.parsePlatsbankenResponse (cognitive 37) providers/platsbanken.mjs:193— platsbanken.parsePlatsbankenResponse has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 11 (21 pts), boolean chains 8, if/else 4 (7 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
buildCandidates (cognitive 37) REDACTED:679— buildCandidates has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 4 (12 pts), boolean chains 10, loops 2 (nesting depth added 14). Of this number, 31 points are the body's own statements and 6 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
greenhouse.buildOfficeMap::walk (cognitive 36) providers/greenhouse.mjs:132— greenhouse.buildOfficeMap::walk has cognitive complexity 36 (threshold 15). Drivers by points: if/else 5 (15 pts), ternaries 3 (11 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
jd-rescue.fromLdJson (cognitive 36) batch/jd-rescue.mjs:112— jd-rescue.fromLdJson has cognitive complexity 36 (threshold 15). Drivers by points: if/else 5 (15 pts), ternaries 5 (13 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 20). Of this number, 33 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
build-cv-latex.main (cognitive 36) build-cv-latex.mjs:146— build-cv-latex.main has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 16, if/else 8, ternaries 4 (6 pts), loops 3 (4 pts), error handling 2 (nesting depth added 3). Of this number, 30 points are the body's own statements and 6 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
contacts.printSummary (cognitive 36) contacts.mjs:379— contacts.printSummary has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 10, loops 5 (10 pts), boolean chains 2 (nesting depth added 12). Of this number, 32 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
doctor.main (cognitive 36) doctor.mjs:1155— doctor.main has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 10 (13 pts), loops 3 (7 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fill-stream.readFillResult (cognitive 36) web/src/lib/apply/fill-stream.mjs:12— fill-stream.readFillResult has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 3 (6 pts), boolean chains 5, error handling 2 (3 pts), loops 2 (3 pts) (nesting depth added 12). Of this number, 26 points are the body's own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scan.runScanner (cognitive 36) web/src/lib/core/scan.ts:189— scan.runScanner has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (27 pts), boolean chains 3, ternaries 2 (3 pts), loops 2, error handling 1 (nesting depth added 6). None of this is in the body itself: all 36 points belong to 10 function literals inside it that branch (lines 279, 342, 359, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
analyzeFromContent (cognitive 36) followup-cadence.mjs:871— analyzeFromContent has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 6 (12 pts), boolean chains 3, loops 2, other 2 (nesting depth added 14). Of this number, 32 points are the body's own statements and 4 belong to 9 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
seedBackfill (cognitive 36) REDACTED:551— seedBackfill has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 2 (5 pts), boolean chains 4, other 4, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generate-pdf.scanNesting (cognitive 35) REDACTED:929— generate-pdf.scanNesting has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 5, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verify-portals.discoverAlternates (cognitive 35) REDACTED:697— verify-portals.discoverAlternates has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 3 (6 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generalist-world.stripNonRendered (cognitive 35) REDACTED:130— generalist-world.stripNonRendered has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (30 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
view-model.statsModel (cognitive 35) web/src/lib/analytics/view-model.mjs:125— view-model.statsModel has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 12 (25 pts), if/else 5 (6 pts), boolean chains 3, loops 1 (nesting depth added 14). Of this number, 31 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
data.acquireTrackerLock (cognitive 35) dashboard/internal/data/tracker_lock.go:149— data.acquireTrackerLock has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetchHnDiscovery (cognitive 35) REDACTED:783— fetchHnDiscovery has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 5 (14 pts), boolean chains 9, if/else 4 (9 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
computeCalibration (cognitive 35) calibrate.mjs:135— computeCalibration has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5, ternaries 3 (5 pts), loops 2 (4 pts), other 2 (nesting depth added 10). Of this number, 32 points are the body's own statements and 3 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
createCachedLookup (cognitive 35) providers/_dns-cache.mjs:225— createCachedLookup has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (11 pts), other 10, ternaries 8 (9 pts), boolean chains 3, loops 2 (nesting depth added 2). Most of this is not in the body itself: 8 of the 35 points are its own statements and the rest belongs to 8 function items inside it that branch (cachedLookup, a function literal at line 312, a function literal at line 262, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
scan.buildCooldownFilter (cognitive 34) REDACTED:1314— scan.buildCooldownFilter has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (27 pts), boolean chains 6, loops 1 (nesting depth added 18). Most of this is not in the body itself: 2 of the 34 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1321, 1352, 1350). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
reply-matcher.classifyReply (cognitive 34) reply-matcher.mjs:612— reply-matcher.classifyReply has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 13, ternaries 1 (2 pts), loops 1 (nesting depth added 6). Of this number, 31 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ics-interview.printSummary (cognitive 34) ics-interview.mjs:462— ics-interview.printSummary has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 10 (25 pts), if/else 5 (6 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
panelist-roles.readIcsText (cognitive 34) REDACTED:271— panelist-roles.readIcsText has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 8, ternaries 1 (4 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
paylocity.parsePaylocityBoard (cognitive 34) providers/paylocity.mjs:127— paylocity.parsePaylocityBoard has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 7 (14 pts), boolean chains 5, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
update-system.configuredTemplateVariantsFromProfileSource (cognitive 34) REDACTED:1751— update-system.configuredTemplateVariantsFromProfileSource has cognitive complexity 34 (threshold 15). Drivers by points: if/else 26 (50 pts), boolean chains 10, loops 3 (4 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (update-system.configuredTemplateVariantsFromProfileSource::parseScalar) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
session.openSession (cognitive 34) web/src/lib/apply/session.ts:189— session.openSession has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 8, ternaries 4 (6 pts), error handling 2 (nesting depth added 5). Of this number, 31 points are the body's own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
buildCompanyCanonicalizer (cognitive 34) REDACTED:2210— buildCompanyCanonicalizer has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (9 pts), boolean chains 3, ternaries 1 (3 pts), other 1 (nesting depth added 19). Of this number, 33 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
renderMarkdown (cognitive 34) github-evidence.mjs:622— renderMarkdown has cognitive complexity 34 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 8 (9 pts), ternaries 5 (8 pts), boolean chains 3, other 2 (nesting depth added 9). Of this number, 28 points are the body's own statements and 6 belong to 5 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
htmlToText (cognitive 34) closing-soon.mjs:254— htmlToText has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 1 (4 pts), boolean chains 2, loops 2, other 2 (nesting depth added 15). Of this number, 28 points are the body's own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generate-pdf.normalizeTextForATS (cognitive 33) REDACTED:217— generate-pdf.normalizeTextForATS has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 5 (9 pts), boolean chains 8, loops 1 (nesting depth added 10). Of this number, 16 points are the body's own statements and 17 belong to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
assistant-console.AssistantConsole (cognitive 33) web/src/components/assistant-console.tsx:142— assistant-console.AssistantConsole has cognitive complexity 33 (threshold 15). Drivers by points: if/else 71 (92 pts), boolean chains 69, ternaries 35 (56 pts), error handling 12 (14 pts), loops 7 (11 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (assistant-console.AssistantConsole::send) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
data.CanonicalizeLocation (cognitive 33) dashboard/internal/data/stats.go:86— data.CanonicalizeLocation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
trackerLock.release (cognitive 33) dashboard/internal/data/tracker_lock.go:226— trackerLock.release has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
writeVcf (cognitive 33) contacts.mjs:441— writeVcf has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 7 (16 pts), if/else 9 (13 pts), boolean chains 3, other 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
roleFuzzyMatch (cognitive 33) role-matcher.mjs:240— roleFuzzyMatch has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 11, ternaries 3 (4 pts), other 2 (nesting depth added 4). Of this number, 30 points are the body's own statements and 3 belong to 16 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
analyze-patterns.buildPatternSignals (cognitive 32) analyze-patterns.mjs:1277— analyze-patterns.buildPatternSignals has cognitive complexity 32 (threshold 15). Drivers by points: loops 9 (16 pts), if/else 4 (9 pts), boolean chains 4, ternaries 3 (nesting depth added 12). Of this number, 30 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
pageup.parsePageupListing (cognitive 32) REDACTED:137— pageup.parsePageupListing has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 6, loops 3 (5 pts), error handling 1 (2 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ultipro.extractCandidateOpportunityDetail (cognitive 32) providers/ultipro.mjs:295— ultipro.extractCandidateOpportunityDetail has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (25 pts), error handling 1 (4 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
results-list.ResultsList (cognitive 32) web/src/components/explore/results-list.tsx:14— results-list.ResultsList has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 12 (23 pts), boolean chains 8, if/else 1 (nesting depth added 11). Of this number, 25 points are the body's own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
job-store.JobsProvider (cognitive 32) web/src/components/jobs/job-store.tsx:63— job-store.JobsProvider has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 7 (8 pts), boolean chains 7, error handling 2 (nesting depth added 3). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to 10 function literals inside it that branch (lines 176, 145, 217, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
report-view.ReportView (cognitive 32) web/src/components/report-view.tsx:48— report-view.ReportView has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 21, ternaries 5 (7 pts), if/else 2 (4 pts) (nesting depth added 4). Of this number, 18 points are the body's own statements and 14 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
data.loadJobURLs (cognitive 32) REDACTED:421— data.loadJobURLs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 4, loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
data.parseMarkdownLinks (cognitive 32) REDACTED:844— data.parseMarkdownLinks has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ViewerModel.Update (cognitive 32) dashboard/internal/ui/screens/viewer.go:158— ViewerModel.Update has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (29 pts), match/switch 2 (3 pts) (nesting depth added 20). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
query (cognitive 32) tracker.mjs:868— query has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 5, loops 2 (4 pts), ternaries 2 (3 pts), other 1 (nesting depth added 7). Of this number, 30 points are the body's own statements and 2 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
checkFreshness (cognitive 32) check-table-freshness.mjs:179— checkFreshness has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts), other 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
normalizeTechInAsiaJob (cognitive 32) providers/techinasia.mjs:240— normalizeTechInAsiaJob has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 9, ternaries 3 (5 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cv-payload-schema.validatePayload (cognitive 31) lib/cv-payload-schema.mjs:166— cv-payload-schema.validatePayload has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 8, loops 3, ternaries 2 (3 pts) (nesting depth added 8). Of this number, 23 points are the body's own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
stats.computeScanStats (cognitive 31) stats.mjs:246— stats.computeScanStats has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 8, loops 1, ternaries 1 (nesting depth added 12). Of this number, 30 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scan-ats-full.runSeedScan (cognitive 31) scan-ats-full.mjs:858— scan-ats-full.runSeedScan has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (5 pts), error handling 3 (4 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 11). Most of this is not in the body itself: 5 of the 31 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 881, 873). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
update-system.configuredTemplateVariantsFromProfileSource::parseScalar (cognitive 31) REDACTED:1755— update-system.configuredTemplateVariantsFromProfileSource::parseScalar has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 6, error handling 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (update-system.configuredTemplateVariantsFromProfileSource) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
agent-interpret.captureCandidates (cognitive 31) web/src/lib/apply/agent-interpret.ts:27— agent-interpret.captureCandidates has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 14, loops 1 (nesting depth added 9). None of this is in the body itself: all 31 points belong to 3 function literals inside it that branch (lines 28, 29, 54). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
data.enrichFromScanHistory (cognitive 31) REDACTED:496— data.enrichFromScanHistory has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (9 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity· main (cognitive 31) · ×1
main (cognitive 31) REDACTED:1646— main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (6 pts), other 5, error handling 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
main::processJobs (cognitive 31) scan-ats-full.mjs:1418— main::processJobs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, error handling 1 (3 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetchTextMeta (cognitive 31) REDACTED:431— fetchTextMeta has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 3 (6 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
compileLatexFile (cognitive 31) generate-latex.mjs:180— compileLatexFile has cognitive complexity 31 (threshold 15). Drivers by points: error handling 6 (14 pts), if/else 10 (13 pts), loops 1 (2 pts), boolean chains 1, ternaries 1 (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
computeProgressMetrics (cognitive 31) web/src/lib/analytics-metrics.mjs:41— computeProgressMetrics has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (12 pts), other 9, boolean chains 4, loops 3, ternaries 3 (nesting depth added 6). Of this number, 28 points are the body's own statements and 3 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
normalizeAnswers (cognitive 31) onboard-write.mjs:81— normalizeAnswers has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 16, if/else 6 (7 pts), ternaries 5, other 2, loops 1 (nesting depth added 1). Of this number, 26 points are the body's own statements and 5 belong to 5 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
analyze-patterns.buildPredictedDiscardReasonSignals (cognitive 30) analyze-patterns.mjs:1211— analyze-patterns.buildPredictedDiscardReasonSignals has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (7 pts), boolean chains 6, ternaries 1 (nesting depth added 11). Of this number, 29 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_engine.discoverPlugins (cognitive 30) plugins/_engine.mjs:285— _engine.discoverPlugins has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (19 pts), error handling 3 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 17). Of this number, 23 points are the body's own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
branded-successfactors.classifyUnknownHostSeeds (cognitive 30) branded-successfactors.mjs:118— branded-successfactors.classifyUnknownHostSeeds has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, error handling 2 (4 pts), loops 3 (nesting depth added 10). Of this number, 23 points are the body's own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
career-profile.validateProfile (cognitive 30) lib/career-profile.mjs:9— career-profile.validateProfile has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 7, ternaries 2 (4 pts), loops 3 (nesting depth added 5). Most of this is not in the body itself: 13 of the 30 points are its own statements and the rest belongs to 2 function items inside it that branch (checkFact, a function literal at line 31). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
clean-markers.processFile (cognitive 30) clean-markers.mjs:56— clean-markers.processFile has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 7 (18 pts), if/else 5 (8 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
followup-seed.parseCliArgs (cognitive 30) REDACTED:648— followup-seed.parseCliArgs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ultipro.parseListPage (cognitive 30) providers/ultipro.mjs:229— ultipro.parseListPage has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 6 (11 pts), boolean chains 5, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vc-portfolios.parseYCPayload (cognitive 30) seeds/vc-portfolios.mjs:126— vc-portfolios.parseYCPayload has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 6 (11 pts), boolean chains 6, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
export-ats-text.normalizeProfile (cognitive 30) scripts/export-ats-text.mjs:166— export-ats-text.normalizeProfile has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 19, if/else 11. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
company-history.factLine (cognitive 30) web/src/lib/company-history.mjs:167— company-history.factLine has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 5 (11 pts), boolean chains 6 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pipeline-sort.sortRows (cognitive 30) web/src/lib/core/pipeline-sort.mjs:38— pipeline-sort.sortRows has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (8 pts), ternaries 6 (8 pts), boolean chains 3 (nesting depth added 12). Of this number, 19 points are the body's own statements and 11 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
states.readCanonicalStates (cognitive 30) web/src/lib/core/states.ts:56— states.readCanonicalStates has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 6 (17 pts), if/else 4 (7 pts), boolean chains 3, loops 1 (2 pts), error handling 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
normalizeProfile (cognitive 30) plugins/h1b-sponsor/lib/api.mjs:475— normalizeProfile has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 11, other 10, ternaries 8, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
parseCliArgs (cognitive 30) archive-posting.mjs:113— parseCliArgs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 5, loops 1, other 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseClaudeEvent (cognitive 30) web/src/lib/run-cli-support.mjs:246— parseClaudeEvent has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 12, ternaries 1 (2 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseListPage (cognitive 30) providers/adp-workforcenow.mjs:295— parseListPage has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 10, ternaries 4 (6 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verify-portals.findUnmined (cognitive 29) REDACTED:1050— verify-portals.findUnmined has cognitive complexity 29 (threshold 15). Drivers by points: if/else 2 (10 pts), loops 4 (10 pts), ternaries 2 (7 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
debrief-sync.parseArgs (cognitive 29) debrief-sync.mjs:273— debrief-sync.parseArgs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
smartrecruiters.parseSmartRecruitersResponse (cognitive 29) providers/smartrecruiters.mjs:209— smartrecruiters.parseSmartRecruitersResponse has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 10, ternaries 4, error handling 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to one function literal inside it that branches (line 212). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
filter-audit.audit (cognitive 29) filter-audit.mjs:125— filter-audit.audit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (4 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 13). Of this number, 27 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
intake.listSourceFiles::walk (cognitive 29) intake.mjs:245— intake.listSourceFiles::walk has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
magneto.parseCards (cognitive 29) providers/magneto.mjs:88— magneto.parseCards has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 4 (9 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
export-ats-text.loadProfile (cognitive 29) scripts/export-ats-text.mjs:217— export-ats-text.loadProfile has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 4 (8 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
route.GET (cognitive 29) web/src/app/api/cv-pdf/route.ts:33— route.GET has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (15 pts), error handling 4 (8 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
apply-view.ApplyView (cognitive 29) web/src/components/apply-view.tsx:33— apply-view.ApplyView has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 25, ternaries 2 (3 pts), if/else 1 (nesting depth added 1). Of this number, 28 points are the body's own statements and 1 belongs to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
job-card.JobCard (cognitive 29) web/src/components/scheduled-scans/job-card.tsx:9— job-card.JobCard has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 13 (15 pts), boolean chains 9, if/else 4, error handling 1 (nesting depth added 2). Of this number, 19 points are the body's own statements and 10 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
run-cli-support.parseCodexEvent (cognitive 29) web/src/lib/run-cli-support.mjs:173— run-cli-support.parseCodexEvent has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 7, ternaries 1 (2 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
renderInPage (cognitive 29) REDACTED:2147— renderInPage has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), error handling 4 (6 pts), ternaries 5 (6 pts), other 3 (nesting depth added 4). Of this number, 24 points are the body's own statements and 5 belong to 5 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity· main (cognitive 29) · ×1
main (cognitive 29) discover-ats.mjs:1182— main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (19 pts), ternaries 3 (5 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseTracker (cognitive 29) tracker.mjs:532— parseTracker has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 4, ternaries 1 (3 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scanJd (cognitive 29) jd-skill-gap.mjs:301— scanJd has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 2 (5 pts), boolean chains 4, other 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
computeUrgency (cognitive 29) followup-cadence.mjs:817— computeUrgency has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 3 (8 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
searchAuthoredCommits (cognitive 29) github-evidence.mjs:505— searchAuthoredCommits has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
archiveUrl (cognitive 29) archive-posting.mjs:331— archiveUrl has cognitive complexity 29 (threshold 15). Drivers by points: error handling 5 (11 pts), if/else 7 (9 pts), boolean chains 3, ternaries 2 (3 pts), other 2, loops 1 (nesting depth added 9). Of this number, 28 points are the body's own statements and 1 belongs to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli-flags.validateFlags (cognitive 28) lib/cli-flags.mjs:106— cli-flags.validateFlags has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 10, ternaries 3 (6 pts) (nesting depth added 6). Most of this is not in the body itself: 6 of the 28 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 150, a function literal at line 123, a function literal at line 117, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
cv-templates.loadAtsRules (cognitive 28) REDACTED:233— cv-templates.loadAtsRules has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
status-hooks.archiveJdOnInterview (cognitive 28) lib/status-hooks.mjs:212— status-hooks.archiveJdOnInterview has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 8 (11 pts), if/else 8 (10 pts), boolean chains 6, error handling 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
detect-reposts.detectRepostsInGroup (cognitive 28) detect-reposts.mjs:352— detect-reposts.detectRepostsInGroup has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 17). Of this number, 26 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
breezy.parseBreezyResponse (cognitive 28) providers/breezy.mjs:123— breezy.parseBreezyResponse has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 5 (9 pts), boolean chains 4, error handling 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
intake.main (cognitive 28) intake.mjs:462— intake.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pythonorg.parsePythonOrgFeed (cognitive 28) REDACTED:85— pythonorg.parsePythonOrgFeed has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wttj.normalizeWttjHit (cognitive 28) providers/wttj.mjs:117— wttj.normalizeWttjHit has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 13, if/else 8, ternaries 7. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
skip-blockers.rankSkipBlockers (cognitive 28) skip-blockers.mjs:62— skip-blockers.rankSkipBlockers has cognitive complexity 28 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (9 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 15). Of this number, 26 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
drive.snapshot (cognitive 28) web/src/lib/apply/drive.ts:41— drive.snapshot has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 4 (7 pts), boolean chains 4, loops 3 (nesting depth added 13). Of this number, 25 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ViewerModel.styleLine (cognitive 28) dashboard/internal/ui/screens/viewer.go:772— ViewerModel.styleLine has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
snapshotConfiguredTemplateVariants (cognitive 28) REDACTED:1933— snapshotConfiguredTemplateVariants has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 4 (6 pts), loops 4 (5 pts), boolean chains 2, other 2, ternaries 1 (2 pts) (nesting depth added 9). Of this number, 25 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
renderSummary (cognitive 28) company-history.mjs:938— renderSummary has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 4 (13 pts), loops 4 (7 pts), if/else 4 (6 pts), boolean chains 1, other 1 (nesting depth added 14). Of this number, 26 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
printResults (cognitive 28) REDACTED:948— printResults has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (9 pts), boolean chains 7, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
aggregateGaps (cognitive 28) upskill.mjs:346— aggregateGaps has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 6, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 11). Of this number, 21 points are the body's own statements and 7 belong to 8 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseFormState (cognitive 28) REDACTED:355— parseFormState has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 5 (9 pts), boolean chains 6, loops 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
appendNote (cognitive 28) REDACTED:179— appendNote has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, ternaries 3 (5 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
recruitee.assembleLocation (cognitive 27) providers/recruitee.mjs:268— recruitee.assembleLocation has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 5 (8 pts), boolean chains 7 (nesting depth added 8). Most of this is not in the body itself: 13 of the 27 points are its own statements and the rest belongs to one function literal inside it that branches (line 270). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
hired-wall-build.buildSvg (cognitive 27) hired-wall-build.mjs:152— hired-wall-build.buildSvg has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 9 (17 pts), if/else 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 10). Of this number, 24 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
linkedin-join.renderCompanyAnswer (cognitive 27) linkedin-join.mjs:686— linkedin-join.renderCompanyAnswer has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), ternaries 2 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dover.parseDoverPage (cognitive 27) providers/dover.mjs:125— dover.parseDoverPage has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 4 (8 pts), boolean chains 7, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
jobvite.parseJobviteXml (cognitive 27) providers/jobvite.mjs:386— jobvite.parseJobviteXml has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
career-ops.readLanguageConfig (cognitive 27) web/src/lib/career-ops.ts:588— career-ops.readLanguageConfig has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 2 (6 pts), boolean chains 4, error handling 1 (nesting depth added 13). Of this number, 17 points are the body's own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PipelineModel.renderPreview (cognitive 27) dashboard/internal/ui/screens/pipeline.go:1965— PipelineModel.renderPreview has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
buildProjects (cognitive 27) build-cv-html.mjs:468— buildProjects has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 8 (13 pts), boolean chains 11, if/else 3 (nesting depth added 5). Most of this is not in the body itself: 3 of the 27 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 497, a function literal at line 471, a function literal at line 471, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
checkLivenessViaApi (cognitive 27) liveness-api.mjs:902— checkLivenessViaApi has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 9, error handling 3 (4 pts), ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
planExpiredHistoryRows (cognitive 27) liveness-core.mjs:417— planExpiredHistoryRows has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (4 pts), boolean chains 3, other 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
readBoundedText (cognitive 27) plugins/h1b-sponsor/lib/api.mjs:188— readBoundedText has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 4 (9 pts), ternaries 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
canonicalizeArchetype (cognitive 27) web/src/lib/analytics-metrics.mjs:147— canonicalizeArchetype has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 15, if/else 11, other 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
cv-templates.atsLint (cognitive 26) REDACTED:534— cv-templates.atsLint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 8, ternaries 2 (5 pts), loops 2 (3 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scan.loadReApplyWindows (cognitive 26) REDACTED:1286— scan.loadReApplyWindows has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 9, error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
stats.computeAllStats (cognitive 26) stats.mjs:619— stats.computeAllStats has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 11 (14 pts), if/else 3 (7 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 9). Of this number, 25 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
careerviet.parseListingPage (cognitive 26) providers/careerviet.mjs:207— careerviet.parseListingPage has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 4 (8 pts), boolean chains 2, error handling 1 (2 pts), loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
oraclecloud.parseOracleResponse (cognitive 26) providers/oraclecloud.mjs:186— oraclecloud.parseOracleResponse has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 5 (9 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scheduled-jobs-store.validateScheduledStore (cognitive 26) web/src/lib/scheduled-jobs-store.mjs:59— scheduled-jobs-store.validateScheduledStore has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, loops 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
route.POST (cognitive 26) web/src/app/api/apply/prefill/route.ts:23— route.POST has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10, ternaries 6 (8 pts), boolean chains 4, error handling 4 (nesting depth added 2). Of this number, 23 points are the body's own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
drive-action.executeAction (cognitive 26) web/src/lib/apply/drive-action.mjs:105— drive-action.executeAction has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 11, if/else 9 (10 pts), ternaries 4, error handling 1 (nesting depth added 1). Of this number, 24 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
personalization.coercePersonalization (cognitive 26) web/src/lib/personalization.mjs:47— personalization.coercePersonalization has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 5). Of this number, 18 points are the body's own statements and 8 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
report-persist.persistEvaluation (cognitive 26) REDACTED:189— report-persist.persistEvaluation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 6, ternaries 2 (nesting depth added 3). Of this number, 18 points are the body's own statements and 8 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
PipelineModel.Update (cognitive 26) dashboard/internal/ui/screens/pipeline.go:486— PipelineModel.Update has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
requisitionIdsForDedup (cognitive 26) REDACTED:2612— requisitionIdsForDedup has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 6 (9 pts), boolean chains 4, other 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
matchJurisdiction (cognitive 26) REDACTED:351— matchJurisdiction has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (3 pts), other 3, boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
runSelfTest (cognitive 26) discover-ats.mjs:933— runSelfTest has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 17, if/else 3 (5 pts), loops 2 (3 pts), ternaries 1 (nesting depth added 3). Of this number, 23 points are the body's own statements and 3 belong to 8 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
joinConnections (cognitive 26) linkedin-join.mjs:514— joinConnections has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 6, loops 3 (4 pts), ternaries 3 (4 pts) (nesting depth added 8). Of this number, 14 points are the body's own statements and 12 belong to 7 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
computeTrackerStats (cognitive 26) stats.mjs:77— computeTrackerStats has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 5, ternaries 3, loops 1, other 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
installLivenessRouteGuard (cognitive 26) liveness-browser.mjs:349— installLivenessRouteGuard has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, ternaries 2 (6 pts), error handling 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 3 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 352). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
detectChallenge (cognitive 26) scan-dayforce.mjs:150— detectChallenge has cognitive complexity 26 (threshold 15). Drivers by points: error handling 5 (12 pts), if/else 4 (9 pts), loops 3 (4 pts), other 1 (nesting depth added 13). Of this number, 25 points are the body's own statements and 1 belongs to 7 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
computeClosingSoon (cognitive 26) closing-soon.mjs:327— computeClosingSoon has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, loops 1, other 1 (nesting depth added 10). Of this number, 24 points are the body's own statements and 2 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
languageVersions (cognitive 26) providers/recruitee.mjs:143— languageVersions has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 9, ternaries 6 (8 pts), if/else 4 (6 pts), other 2, loops 1 (nesting depth added 4). Of this number, 19 points are the body's own statements and 7 belong to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cv-templates.discover (cognitive 25) REDACTED:131— cv-templates.discover has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 2 (5 pts), loops 3 (4 pts) (nesting depth added 12). Of this number, 23 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
hired-share.main (cognitive 25) hired-share.mjs:204— hired-share.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 7, ternaries 3 (4 pts) (nesting depth added 3). Of this number, 23 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
ics-interview.firstEvent (cognitive 25) ics-interview.mjs:145— ics-interview.firstEvent has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
keyword-match.extractKeywords (cognitive 25) keyword-match.mjs:328— keyword-match.extractKeywords has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 11). Of this number, 19 points are the body's own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
linkedin-join.parseCsv (cognitive 25) linkedin-join.mjs:270— linkedin-join.parseCsv has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
linkedin-join.main (cognitive 25) linkedin-join.mjs:830— linkedin-join.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (14 pts), ternaries 7 (8 pts), boolean chains 3 (nesting depth added 2). Of this number, 24 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
negotiation-roi.analyze (cognitive 25) negotiation-roi.mjs:345— negotiation-roi.analyze has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 5 (10 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_apify.fetchJson (cognitive 25) plugins/apify/_apify.mjs:80— _apify.fetchJson has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 1 (4 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_helpers.authResultsClauses (cognitive 25) plugins/gmail/_helpers.mjs:90— _helpers.authResultsClauses has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
adp-workforcenow.extractSalary (cognitive 25) providers/adp-workforcenow.mjs:222— adp-workforcenow.extractSalary has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 6 (11 pts), boolean chains 8, if/else 4 (6 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
garena.parseGarenaResponse (cognitive 25) providers/garena.mjs:37— garena.parseGarenaResponse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 5 (9 pts), boolean chains 6, loops 1 (nesting depth added 8). Of this number, 24 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
reeval-candidates.printSummary (cognitive 25) reeval-candidates.mjs:407— reeval-candidates.printSummary has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 8 (19 pts), loops 3 (4 pts), boolean chains 1, if/else 1 (nesting depth added 12). Of this number, 21 points are the body's own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
route.GET (cognitive 25) REDACTED:21— route.GET has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (10 pts), boolean chains 7, if/else 6 (7 pts), loops 1 (nesting depth added 7). Most of this is not in the body itself: 6 of the 25 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 42, 62). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
section-card.BulletRow (cognitive 25) web/src/components/cv-studio/section-card.tsx:121— section-card.BulletRow has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 12, ternaries 5 (7 pts), if/else 4 (6 pts) (nesting depth added 4). Of this number, 15 points are the body's own statements and 10 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
first-score-view.FirstScoreView (cognitive 25) web/src/components/explore/first-score-view.tsx:38— first-score-view.FirstScoreView has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (9 pts), error handling 3 (4 pts), ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 9 of the 25 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 65, a function literal at line 44, a function literal at line 53, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
cadence-settings.CadenceSettings (cognitive 25) web/src/components/followups/cadence-settings.tsx:22— cadence-settings.CadenceSettings has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 7 (8 pts), boolean chains 4, error handling 2, loops 1 (nesting depth added 5). Most of this is not in the body itself: 6 of the 25 points are its own statements and the rest belongs to 5 function items inside it that branch (save, toggle, a function literal at line 38, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
drive.driveSession (cognitive 25) web/src/lib/apply/drive.ts:161— drive.driveSession has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, ternaries 3 (4 pts), error handling 1, loops 1 (nesting depth added 7). Of this number, 24 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
studio.resolveStudio (cognitive 25) web/src/lib/cv-studio/studio.mjs:272— studio.resolveStudio has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 3 (8 pts), ternaries 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
buildStatusHistory (cognitive 25) tracker.mjs:639— buildStatusHistory has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 5 (7 pts), boolean chains 5, loops 3, other 2 (nesting depth added 5). Of this number, 23 points are the body's own statements and 2 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
addEntry (cognitive 25) assessment-log.mjs:324— addEntry has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (9 pts), other 8, ternaries 2 (4 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
computeReevalCandidates (cognitive 25) reeval-candidates.mjs:329— computeReevalCandidates has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 6, ternaries 4 (6 pts), other 2, loops 1 (nesting depth added 7). Of this number, 20 points are the body's own statements and 5 belong to 11 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tracker-parse.scanMarkdownLinks (cognitive 24) REDACTED:496— tracker-parse.scanMarkdownLinks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
add-entry.applyAdd (cognitive 24) add-entry.mjs:170— add-entry.applyAdd has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
classify-tier.classifyTier (cognitive 24) classify-tier.mjs:30— classify-tier.classifyTier has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, ternaries 2 (3 pts), loops 1 (nesting depth added 8). Of this number, 23 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
funnel-velocity.parseStatusLog (cognitive 24) funnel-velocity.mjs:130— funnel-velocity.parseStatusLog has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
closing-soon.readDate (cognitive 24) closing-soon.mjs:120— closing-soon.readDate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 4 (7 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
discover-ats.dedupeAgainstPortals (cognitive 24) discover-ats.mjs:458— discover-ats.dedupeAgainstPortals has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, ternaries 2 (4 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
doctor.onboardingState (cognitive 24) doctor.mjs:1408— doctor.onboardingState has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 10 (11 pts), boolean chains 6, error handling 2 (4 pts), if/else 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
reserve-report-num.runCli (cognitive 24) reserve-report-num.mjs:426— reserve-report-num.runCli has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, ternaries 4 (5 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generate-cover-letter.buildRecipientBlock (cognitive 24) generate-cover-letter.mjs:170— generate-cover-letter.buildRecipientBlock has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 3 (5 pts), boolean chains 2, loops 2 (nesting depth added 7). Of this number, 16 points are the body's own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
i18n-drift.formatReport (cognitive 24) i18n-drift.mjs:253— i18n-drift.formatReport has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3 (8 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 14). Of this number, 23 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
echojobs.normalizeEchojobsJob (cognitive 24) providers/echojobs.mjs:71— echojobs.normalizeEchojobsJob has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, ternaries 4, error handling 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
thehub.fetchScope (cognitive 24) providers/thehub.mjs:135— thehub.fetchScope has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
update-system.unsafeManifestPathReason (cognitive 24) REDACTED:505— update-system.unsafeManifestPathReason has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
route.POST (cognitive 24) REDACTED:103— route.POST has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 3 (5 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
assistant-status-confirmation.StatusConfirmationCard (cognitive 24) web/src/components/assistant-status-confirmation.tsx:16— assistant-status-confirmation.StatusConfirmationCard has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 10, ternaries 4 (8 pts), if/else 6 (nesting depth added 4). Of this number, 14 points are the body's own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
claude-usage-scan.createUsageScanner.scan (cognitive 24) web/src/lib/claude-usage-scan.mjs:99— claude-usage-scan.createUsageScanner.scan has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 3 (6 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
posting-url.markdownLinkTargets (cognitive 24) web/src/lib/posting-url.mjs:59— posting-url.markdownLinkTargets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
data.CanonicalizeArchetype (cognitive 24) dashboard/internal/data/stats.go:15— data.CanonicalizeArchetype has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 13, if/else 11. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
main.main (cognitive 24) dashboard/main.go:432— main.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (23 pts), loops 1 (nesting depth added 8). Of this number, 21 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
buildSalaryFilter (cognitive 24) REDACTED:1058— buildSalaryFilter has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 11, if/else 9, other 4. Most of this is not in the body itself: 10 of the 24 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 1078, 1059, 1068, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
toolFragments (cognitive 24) REDACTED:775— toolFragments has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (8 pts), boolean chains 5, other 2 (nesting depth added 9). Most of this is not in the body itself: 3 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 783). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
clauseBounds (cognitive 24) REDACTED:1313— clauseBounds has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 3 (4 pts), other 4 (nesting depth added 5). Of this number, 12 points are the body's own statements and 12 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
runHistorySeedScan (cognitive 24) scan-ats-full.mjs:936— runHistorySeedScan has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 4 (5 pts), loops 2, boolean chains 1, other 1, ternaries 1 (nesting depth added 7). Of this number, 13 points are the body's own statements and 11 belong to 10 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mapTrackerCaptureLinks (cognitive 24) check-jd-archive.mjs:410— mapTrackerCaptureLinks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, loops 2 (3 pts), error handling 1, other 1 (nesting depth added 9). Of this number, 23 points are the body's own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lintPayload (cognitive 24) ats-payload.mjs:402— lintPayload has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 5 (7 pts), boolean chains 3 (nesting depth added 7). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 414, 410, 411, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
seedFollowup (cognitive 24) REDACTED:474— seedFollowup has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, ternaries 3 (5 pts), other 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
buildRow (cognitive 24) assessment-log.mjs:160— buildRow has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, other 4, ternaries 1 (nesting depth added 1). Of this number, 13 points are the body's own statements and 11 belong to 5 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
application-answers.main (cognitive 23) application-answers.mjs:539— application-answers.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 7, error handling 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
archive-posting.main (cognitive 23) archive-posting.mjs:463— archive-posting.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 3 (6 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 6). Of this number, 22 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_registry.validateRegistryEntry (cognitive 23) plugins/_registry.mjs:116— _registry.validateRegistryEntry has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, boolean chains 10. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
check-table-freshness.printSummary (cognitive 23) check-table-freshness.mjs:310— check-table-freshness.printSummary has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 4 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
process-quality.aggregateProcessQuality (cognitive 23) process-quality.mjs:173— process-quality.aggregateProcessQuality has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 8). Of this number, 20 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
funnel-velocity.selfTest (cognitive 23) funnel-velocity.mjs:527— funnel-velocity.selfTest has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 16, loops 5, if/else 2. Of this number, 19 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
workable.parseWorkableWidget (cognitive 23) providers/workable.mjs:263— workable.parseWorkableWidget has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generate-latex.validateLatexContent (cognitive 23) generate-latex.mjs:104— generate-latex.validateLatexContent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
hired-wall-build.main (cognitive 23) hired-wall-build.mjs:207— hired-wall-build.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, ternaries 3 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
learn.apply (cognitive 23) learn.mjs:331— learn.apply has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 5, ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
4dayweek.normalize4dwJob (cognitive 23) providers/4dayweek.mjs:94— 4dayweek.normalize4dwJob has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 9 (12 pts), boolean chains 6, if/else 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
dassault.parseHits (cognitive 23) providers/dassault.mjs:113— dassault.parseHits has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (9 pts), error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
oraclecloud.resolveSite (cognitive 23) providers/oraclecloud.mjs:92— oraclecloud.resolveSite has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (8 pts), boolean chains 6, if/else 3 (6 pts), error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
remotli.normalizeRemotliJob (cognitive 23) providers/remotli.mjs:178— remotli.normalizeRemotliJob has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, if/else 8, ternaries 6. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
telegram-channel.parseChannelPage (cognitive 23) REDACTED:281— telegram-channel.parseChannelPage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, ternaries 2 (4 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
update-system.loadConfiguredTemplateVariants (cognitive 23) REDACTED:1851— update-system.loadConfiguredTemplateVariants has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 8, ternaries 2 (4 pts), error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
update-system.reconcileGitignore (cognitive 23) REDACTED:4190— update-system.reconcileGitignore has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 3 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
explore-ai.makeAiStreamParser.feed (cognitive 23) web/src/lib/explore-ai.ts:115— explore-ai.makeAiStreamParser.feed has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
report.issueBody (cognitive 23) web/src/lib/report/report.ts:127— report.issueBody has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 10 (16 pts), boolean chains 7 (nesting depth added 6). Of this number, 22 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
data.LoadPDFEntriesByPath (cognitive 23) dashboard/internal/data/pdf.go:108— data.LoadPDFEntriesByPath has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
data.LoadPDFManifest (cognitive 23) dashboard/internal/data/pdf.go:157— data.LoadPDFManifest has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
data.runStatusWriter (cognitive 23) dashboard/internal/data/status_writer.go:47— data.runStatusWriter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 6 (nesting depth added 2). Of this number, 20 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
ViewerModel.renderTableBlock (cognitive 23) dashboard/internal/ui/screens/viewer.go:464— ViewerModel.renderTableBlock has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 4 (9 pts) (nesting depth added 9). Of this number, 21 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rejectUserLayerPaths (cognitive 23) REDACTED:777— rejectUserLayerPaths has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, error handling 1, loops 1, ternaries 1 (nesting depth added 7). Of this number, 17 points are the body's own statements and 6 belong to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
computeRelocationAdjustment (cognitive 23) REDACTED:427— computeRelocationAdjustment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 6, ternaries 2 (3 pts), other 2 (nesting depth added 2). Of this number, 20 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
findUnarchivedApplications (cognitive 23) check-jd-archive.mjs:573— findUnarchivedApplications has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (5 pts), boolean chains 3, other 3, loops 2, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
renderTable (cognitive 23) tracker.mjs:1015— renderTable has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 3 (6 pts), boolean chains 3, loops 3, other 2 (nesting depth added 6). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1031, 1060, 1055, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
validatePayloadShape (cognitive 23) ats-payload.mjs:177— validatePayloadShape has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 9, ternaries 1 (nesting depth added 4). Of this number, 19 points are the body's own statements and 4 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
findUnclaimedEntries (cognitive 23) audit-portals.mjs:290— findUnclaimedEntries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, ternaries 3 (6 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
jd-rescue.main (cognitive 22) batch/jd-rescue.mjs:206— jd-rescue.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, error handling 3 (4 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verify-cv-facts.scopeInflationClaims (cognitive 22) REDACTED:1621— verify-cv-facts.scopeInflationClaims has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 11). Of this number, 17 points are the body's own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verify-portals.parseAtsSlug (cognitive 22) REDACTED:178— verify-portals.parseAtsSlug has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (7 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scan.main::resolveEntries (cognitive 22) REDACTED:4139— scan.main::resolveEntries has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
detect-reposts.loadAggregatorCompanies (cognitive 22) detect-reposts.mjs:204— detect-reposts.loadAggregatorCompanies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
company-history.loadStatusLogSource (cognitive 22) company-history.mjs:269— company-history.loadStatusLogSource has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, error handling 3, loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
contacts.parseContacts (cognitive 22) contacts.mjs:111— contacts.parseContacts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, loops 3, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
debrief-sync.applyDebriefSync (cognitive 22) debrief-sync.mjs:209— debrief-sync.applyDebriefSync has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
discover-ats.parseCompanyInput (cognitive 22) discover-ats.mjs:185— discover-ats.parseCompanyInput has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 11, ternaries 4 (9 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
i18n-drift.main (cognitive 22) i18n-drift.mjs:283— i18n-drift.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
onboard-write.buildPortals (cognitive 22) onboard-write.mjs:234— onboard-write.buildPortals has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, loops 3, error handling 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
plugin-audit.auditPlugin (cognitive 22) plugin-audit.mjs:79— plugin-audit.auditPlugin has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
beesite.parseSearchResult (cognitive 22) providers/beesite.mjs:106— beesite.parseSearchResult has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 6, ternaries 4 (6 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
getonbrd.normalizeGetonbrdJob (cognitive 22) providers/getonbrd.mjs:116— getonbrd.normalizeGetonbrdJob has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, ternaries 3, error handling 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
kalibrr.normalizeKalibrrJob (cognitive 22) providers/kalibrr.mjs:149— kalibrr.normalizeKalibrrJob has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, ternaries 3 (5 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
redrover.parseRedRoverResponse (cognitive 22) providers/redrover.mjs:112— redrover.parseRedRoverResponse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, ternaries 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
taleo.parseTaleoResponse (cognitive 22) providers/taleo.mjs:145— taleo.parseTaleoResponse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli.main (cognitive 22) scaffolder/bin/cli.mjs:75— cli.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, boolean chains 5, ternaries 2 (3 pts), error handling 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
vc-portfolios.fetchYCCompanies (cognitive 22) seeds/vc-portfolios.mjs:330— vc-portfolios.fetchYCCompanies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
validate-plugin-registry.validateRegistry (cognitive 22) validate-plugin-registry.mjs:19— validate-plugin-registry.validateRegistry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verify-ats.runSelfTest (cognitive 22) verify-ats.mjs:788— verify-ats.runSelfTest has cognitive complexity 22 (threshold 15). Drivers by points: loops 15, boolean chains 3, if/else 3, ternaries 1. Of this number, 19 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
config-form.ConfigForm (cognitive 22) web/src/components/config-form.tsx:38— config-form.ConfigForm has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 5, boolean chains 4, error handling 1 (nesting depth added 4). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 48, 78, 160, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
triage-row.TriageRow (cognitive 22) web/src/components/inbox/triage-row.tsx:28— triage-row.TriageRow has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 9 (16 pts), boolean chains 6 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
weekly-digest.runSelfTest (cognitive 22) weekly-digest.mjs:393— weekly-digest.runSelfTest has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 13, error handling 4, if/else 3, loops 1, ternaries 1. Of this number, 19 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
PipelineModel.handleDiscardPicker (cognitive 22) dashboard/internal/ui/screens/pipeline.go:936— PipelineModel.handleDiscardPicker has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PipelineModel.renderBodyWindow (cognitive 22) dashboard/internal/ui/screens/pipeline.go:1581— PipelineModel.renderBodyWindow has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 2 (nesting depth added 9). Of this number, 18 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseBlacklist (cognitive 22) REDACTED:3453— parseBlacklist has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 6, ternaries 3 (6 pts), loops 1, other 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
unminedHints (cognitive 22) REDACTED:427— unminedHints has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (6 pts), boolean chains 3, other 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
(anonymous) (cognitive 22) upskill.mjs:879— (anonymous) has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 4 (9 pts), boolean chains 1, ternaries 1 (nesting depth added 9). Of this number, 20 points are the body's own statements and 2 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseSessionFile (cognitive 22) weekly-digest.mjs:106— parseSessionFile has cognitive complexity 22 (threshold 15). Drivers by points: other 7, if/else 4 (6 pts), boolean chains 4, loops 2 (3 pts), error handling 1, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extractRows (cognitive 22) check-table-freshness.mjs:141— extractRows has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 7). Of this number, 15 points are the body's own statements and 7 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
history-ats-seeds.atsBoardUrlOf (cognitive 21) history-ats-seeds.mjs:22— history-ats-seeds.atsBoardUrlOf has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, ternaries 1 (2 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
workday.chooseSplitFacet (cognitive 21) providers/workday.mjs:279— workday.chooseSplitFacet has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, ternaries 3 (5 pts), loops 1 (nesting depth added 6). Of this number, 19 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
company-funded.parseArgs (cognitive 21) REDACTED:110— company-funded.parseArgs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 7, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
reply-matcher.getAppDomains (cognitive 21) reply-matcher.mjs:355— reply-matcher.getAppDomains has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
contact-extract.appendContact (cognitive 21) contact-extract.mjs:152— contact-extract.appendContact has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 9, ternaries 2 (nesting depth added 2). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 154, 170, 165, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
generate-cover-letter.main (cognitive 21) generate-cover-letter.mjs:420— generate-cover-letter.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, boolean chains 6, error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
merge-tracker.mergeTracker::mergeUnderLock::fuzzyTierMatch (cognitive 21) merge-tracker.mjs:2001— merge-tracker.mergeTracker::mergeUnderLock::fuzzyTierMatch has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, if/else 8 (9 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
install-h1b-index.installIndex (cognitive 21) plugins/h1b-sponsor/install-h1b-index.mjs:203— install-h1b-index.installIndex has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (9 pts), boolean chains 7, error handling 3, if/else 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
neogov.parseNeogovPage (cognitive 21) providers/neogov.mjs:157— neogov.parseNeogovPage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 8, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
peoplesoft.requestWithSession (cognitive 21) REDACTED:529— peoplesoft.requestWithSession has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 3 (6 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
torre.normalizeTorreOpportunity (cognitive 21) providers/torre.mjs:179— torre.normalizeTorreOpportunity has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, ternaries 3 (nesting depth added 2). Of this number, 19 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
update-system.localUserPaths (cognitive 21) REDACTED:398— update-system.localUserPaths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
route.writeStatus (cognitive 21) web/src/app/api/status/route.ts:79— route.writeStatus has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 7 (8 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mobile-nav.MobileNav (cognitive 21) web/src/components/mobile-nav.tsx:37— mobile-nav.MobileNav has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 8, ternaries 2 (nesting depth added 2). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 54, a function literal at line 153, onTouchMove, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
portals-config.setListInText (cognitive 21) REDACTED:116— portals-config.setListInText has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, loops 3 (4 pts), ternaries 2 (nesting depth added 4). Of this number, 20 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tracker-table.parseApplications (cognitive 21) web/src/lib/tracker-table.mjs:191— tracker-table.parseApplications has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 2 (4 pts), loops 1 (nesting depth added 11). Of this number, 18 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
buildContentFilter (cognitive 21) REDACTED:836— buildContentFilter has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 852, 862, 837, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
rawTextRanges (cognitive 21) REDACTED:849— rawTextRanges has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
syncIndex (cognitive 21) tracker.mjs:702— syncIndex has cognitive complexity 21 (threshold 15). Drivers by points: other 8, loops 4 (5 pts), ternaries 3 (5 pts), if/else 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
computeRunStats (cognitive 21) stats.mjs:551— computeRunStats has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 5 (8 pts), boolean chains 2, loops 1, other 1 (nesting depth added 6). Of this number, 19 points are the body's own statements and 2 belong to 9 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
makeGuardedFetch (cognitive 21) plugins/_engine.mjs:422— makeGuardedFetch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, error handling 1 (3 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 9). None of this is in the body itself: all 21 points belong to 6 function items inside it that branch (guardedFetch, hostOk, isLoopbackHost, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
assessment-log.main (cognitive 20) assessment-log.mjs:504— assessment-log.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, ternaries 4 (5 pts) (nesting depth added 2). Of this number, 16 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
audit-portals.auditCompanies::worker (cognitive 20) audit-portals.mjs:226— audit-portals.auditCompanies::worker has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 2 (4 pts), ternaries 2 (4 pts), error handling 1 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generate-pdf.extractSectionBlocks (cognitive 20) REDACTED:1059— generate-pdf.extractSectionBlocks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (6 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verify-portals.verifyOne (cognitive 20) REDACTED:875— verify-portals.verifyOne has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
company-history.runSelfTest (cognitive 20) company-history.mjs:992— company-history.runSelfTest has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 16, if/else 2, loops 1, ternaries 1. Of this number, 17 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
parse-gojobs-html.inputFiles (cognitive 20) docs/recipes/gojobs/parse-gojobs-html.mjs:99— parse-gojobs-html.inputFiles has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). Of this number, 18 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
latex-content.extractMacroBodies (cognitive 20) lib/latex-content.mjs:108— latex-content.extractMacroBodies has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
i18n-drift.compareStructure (cognitive 20) i18n-drift.mjs:106— i18n-drift.compareStructure has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 6 (9 pts), boolean chains 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
a16z-speedrun-talent.normalizeSpeedrunJob (cognitive 20) providers/a16z-speedrun-talent.mjs:98— a16z-speedrun-talent.normalizeSpeedrunJob has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 6 (7 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
icims.pickLocation (cognitive 20) providers/icims.mjs:229— icims.pickLocation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (5 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 9). Of this number, 16 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
itviec.parseListingPage (cognitive 20) providers/itviec.mjs:179— itviec.parseListingPage has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 3 (7 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 9). Of this number, 19 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
jazzhr.parseJazzHRList (cognitive 20) providers/jazzhr.mjs:123— jazzhr.parseJazzHRList has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, loops 2 (nesting depth added 5). Of this number, 17 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
landingjobs.normalizeLandingJob (cognitive 20) providers/landingjobs.mjs:81— landingjobs.normalizeLandingJob has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 6, boolean chains 5, error handling 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
personio.addLanguageVersions (cognitive 20) REDACTED:228— personio.addLanguageVersions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 pts), ternaries 2 (nesting depth added 7). Of this number, 15 points are the body's own statements and 5 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
softgarden.parseWidget (cognitive 20) providers/softgarden.mjs:82— softgarden.parseWidget has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
upskill.analyze (cognitive 20) upskill.mjs:447— upskill.analyze has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 9). Of this number, 19 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scheduled-jobs-runner.executeJob (cognitive 20) web/scripts/scheduled-jobs-runner.mjs:189— scheduled-jobs-runner.executeJob has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (6 pts), error handling 2 (5 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
page.ApplyPage (cognitive 20) web/src/app/pipeline/[id]/apply/page.tsx:19— page.ApplyPage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 7, error handling 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
worker-card.WorkerCard (cognitive 20) web/src/components/jobs/worker-card.tsx:79— worker-card.WorkerCard has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, ternaries 9 (10 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
edit-job-modal.EditJobModal (cognitive 20) web/src/components/scheduled-scans/edit-job-modal.tsx:11— edit-job-modal.EditJobModal has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, ternaries 4 (6 pts), if/else 2, error handling 1 (nesting depth added 2). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 31, handleSubmit). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
agent-interpret.interpretFormWithAgent (cognitive 20) web/src/lib/apply/agent-interpret.ts:138— agent-interpret.interpretFormWithAgent has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), ternaries 3, error handling 1, loops 1 (nesting depth added 1). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 162, 175, 179, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
report-tables.pipeCells (cognitive 20) web/src/lib/report-tables.mjs:10— report-tables.pipeCells has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PipelineModel.overlayDiscardPicker (cognitive 20) dashboard/internal/ui/screens/pipeline.go:2397— PipelineModel.overlayDiscardPicker has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
buildNoResponseFrictionSignals (cognitive 20) company-history.mjs:855— buildNoResponseFrictionSignals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 4 (8 pts), other 2, boolean chains 1, loops 1 (nesting depth added 8). Of this number, 17 points are the body's own statements and 3 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseLegacyResults (cognitive 20) REDACTED:213— parseLegacyResults has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (4 pts), error handling 1 (2 pts), boolean chains 1, loops 1, other 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
diffAgainstBaseline (cognitive 20) audit-portals.mjs:185— diffAgainstBaseline has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 6, ternaries 2 (4 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gcStaleReportReservations (cognitive 20) reserve-report-num.mjs:386— gcStaleReportReservations has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, error handling 1 (2 pts), loops 1, other 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
atsFromUrl (cognitive 20) coverage-check.mjs:55— atsFromUrl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 3). Of this number, 19 points are the body's own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
token-tracker.estimateCost (cognitive 19) utils/token-tracker.mjs:52— token-tracker.estimateCost has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generate-pdf.reorderCvSections (cognitive 19) REDACTED:1135— generate-pdf.reorderCvSections has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 3, boolean chains 2 (nesting depth added 4). Of this number, 17 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
build-cv-html.main (cognitive 19) build-cv-html.mjs:1018— build-cv-html.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7, ternaries 4 (5 pts), loops 2 (3 pts), boolean chains 2, error handling 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
scan.buildLocationFilter (cognitive 19) REDACTED:600— scan.buildLocationFilter has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 8, ternaries 1. Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 620, 628). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
funnel-stages.parseStatusLogStages (cognitive 19) funnel-stages.mjs:18— funnel-stages.parseStatusLogStages has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
workable.parseWorkableMarkdown (cognitive 19) providers/workable.mjs:323— workable.parseWorkableMarkdown has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
skill-entrypoints.ensureSkillEntrypoints (cognitive 19) scaffolder/bin/skill-entrypoints.mjs:82— skill-entrypoints.ensureSkillEntrypoints has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 3 (7 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
reserve-report-num.reserveReportNumbers (cognitive 19) reserve-report-num.mjs:295— reserve-report-num.reserveReportNumbers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
linkedin-join.renderTsv (cognitive 19) linkedin-join.mjs:650— linkedin-join.renderTsv has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). Of this number, 15 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
normalize-statuses.normalizeStatus (cognitive 19) normalize-statuses.mjs:58— normalize-statuses.normalizeStatus has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
api.fetchWithTimeout (cognitive 19) plugins/h1b-sponsor/lib/api.mjs:128— api.fetchWithTimeout has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (7 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tier.classifyTier (cognitive 19) plugins/h1b-sponsor/lib/tier.mjs:6— tier.classifyTier has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 6, ternaries 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
token.mintToken (cognitive 19) plugins/h1b-sponsor/token.mjs:99— token.mintToken has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 5, boolean chains 4, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builtin.parseListPage (cognitive 19) providers/builtin.mjs:364— builtin.parseListPage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
comeet.parseComeetResponse (cognitive 19) providers/comeet.mjs:115— comeet.parseComeetResponse has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 6, ternaries 6, if/else 2 (4 pts), error handling 1 (2 pts), loops 1 (nesting depth added 3). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 118, 152). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
computrabajo.parseCards (cognitive 19) providers/computrabajo.mjs:79— computrabajo.parseCards has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rheinmetall.parseVacancies (cognitive 19) providers/rheinmetall.mjs:62— rheinmetall.parseVacancies has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 2 (4 pts), error handling 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
thehub.normalizeHubJob (cognitive 19) providers/thehub.mjs:81— thehub.normalizeHubJob has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (10 pts), boolean chains 5, if/else 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
yourator.resolveYouratorUrl (cognitive 19) providers/yourator.mjs:116— yourator.resolveYouratorUrl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (3 pts), loops 1 (3 pts), boolean chains 2, ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
sync-batch-input.isPrivateOrInternalHostname (cognitive 19) sync-batch-input.mjs:120— sync-batch-input.isPrivateOrInternalHostname has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
route.GET (cognitive 19) web/src/app/api/logo/route.ts:45— route.GET has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), error handling 2, boolean chains 1, loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
session.enrichFromAts (cognitive 19) web/src/lib/apply/session.ts:110— session.enrichFromAts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
job-stream.readJobStream::consume (cognitive 19) web/src/lib/job-stream.mjs:21— job-stream.readJobStream::consume has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 6, boolean chains 4, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pipeline-table.parseInbox (cognitive 19) web/src/lib/pipeline-table.mjs:47— pipeline-table.parseInbox has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PipelineModel.renderAppLine (cognitive 19) dashboard/internal/ui/screens/pipeline.go:1866— PipelineModel.renderAppLine has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
redirectToMainCheckout (cognitive 19) REDACTED:1466— redirectToMainCheckout has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, other 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
buildTitleFilterOverrides (cognitive 19) REDACTED:275— buildTitleFilterOverrides has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseCompanyInput::add (cognitive 19) discover-ats.mjs:190— parseCompanyInput::add has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 8, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
detectReposts (cognitive 19) detect-reposts.mjs:305— detectReposts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 7, loops 2, ternaries 2 (nesting depth added 3). Of this number, 12 points are the body's own statements and 7 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cmdEvaluate (cognitive 19) openrouter-runner.mjs:675— cmdEvaluate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 4 (5 pts), ternaries 3, loops 1 (2 pts), boolean chains 1, other 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetchInContext (cognitive 19) providers/_http.mjs:147— fetchInContext has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 5, if/else 4 (5 pts), ternaries 3 (4 pts), error handling 2 (3 pts), other 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
validateEvaluationShape (cognitive 19) REDACTED:302— validateEvaluationShape has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 pts), other 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
findStaleScanQueries (cognitive 19) audit-portals.mjs:331— findStaleScanQueries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 6, ternaries 3 (5 pts), loops 1 (nesting depth added 5). Of this number, 18 points are the body's own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetch (cognitive 19) REDACTED:158— fetch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, ternaries 3, error handling 2, other 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
parseGrokEvent (cognitive 19) web/src/lib/run-cli-support.mjs:326— parseGrokEvent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, ternaries 2 (4 pts), error handling 1, other 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
applyClosures (cognitive 19) close-stale.mjs:270— applyClosures has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 3 (5 pts), loops 2 (3 pts), boolean chains 1, other 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
add-entry.main (cognitive 18) add-entry.mjs:220— add-entry.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 5, error handling 3 (4 pts), ternaries 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
check-jd-archive.classifyReportsByTrackerState (cognitive 18) check-jd-archive.mjs:346— check-jd-archive.classifyReportsByTrackerState has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (4 pts), boolean chains 2, error handling 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_http.withRetry (cognitive 18) providers/_http.mjs:484— _http.withRetry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_net.resolveAndValidate (cognitive 18) plugins/_net.mjs:76— _net.resolveAndValidate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
build-cv-html.buildExperience (cognitive 18) build-cv-html.mjs:422— build-cv-html.buildExperience has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, ternaries 4 (7 pts), if/else 2 (nesting depth added 3). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 449, 425). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
build-cv-html.buildEducation (cognitive 18) build-cv-html.mjs:537— build-cv-html.buildEducation has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, ternaries 3 (6 pts), if/else 2 (nesting depth added 3). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 560, 540). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
calibrate.loadLedgerReached (cognitive 18) calibrate.mjs:287— calibrate.loadLedgerReached has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verify-portals.runUnmined (cognitive 18) REDACTED:1073— verify-portals.runUnmined has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
listing-fingerprint.validateListingFingerprint (cognitive 18) listing-fingerprint.mjs:111— listing-fingerprint.validateListingFingerprint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 4). Of this number, 15 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
check-table-freshness.runSelfTest (cognitive 18) check-table-freshness.mjs:353— check-table-freshness.runSelfTest has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 3 (4 pts), error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 2). Of this number, 12 points are the body's own statements and 6 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
reply-matcher.checkRoleMatch (cognitive 18) reply-matcher.mjs:211— reply-matcher.checkRoleMatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rippling.parseRipplingPage (cognitive 18) providers/rippling.mjs:126— rippling.parseRipplingPage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 5 (6 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 3). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 133, 154). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
check.main (cognitive 18) plugins/h1b-sponsor/check.mjs:230— check.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
applitrack.parseApplitrackOutput (cognitive 18) providers/applitrack.mjs:115— applitrack.parseApplitrackOutput has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (6 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 3). Of this number, 16 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
arbeitnow.normalizeArbeitnowJob (cognitive 18) providers/arbeitnow.mjs:64— arbeitnow.normalizeArbeitnowJob has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 5, boolean chains 4, error handling 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
feishu-jobs.parseFeishuJobsResponse (cognitive 18) providers/feishu-jobs.mjs:87— feishu-jobs.parseFeishuJobsResponse has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 6, ternaries 3 (6 pts), if/else 3 (5 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
flowxtra.normalizeFlowxtraJob (cognitive 18) providers/flowxtra.mjs:77— flowxtra.normalizeFlowxtraJob has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, ternaries 4, error handling 1 (2 pts) (nesting depth added 2). Of this number, 17 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ibm.parseIbmResponse (cognitive 18) providers/ibm.mjs:51— ibm.parseIbmResponse has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (7 pts), boolean chains 5, if/else 3 (5 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
startup-jobs.parseStartupJobsFeed (cognitive 18) REDACTED:203— startup-jobs.parseStartupJobsFeed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tracker-sync-check.buildSyncReport (cognitive 18) tracker-sync-check.mjs:395— tracker-sync-check.buildSyncReport has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (6 pts), boolean chains 5, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tracker.exportMd (cognitive 18) tracker.mjs:1066— tracker.exportMd has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7, ternaries 6, boolean chains 3, loops 1 (2 pts) (nesting depth added 1). Of this number, 17 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
update-system.checkStatus (cognitive 18) REDACTED:3924— update-system.checkStatus has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (10 pts), boolean chains 4, if/else 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scheduled-jobs-runner.recordCompletion (cognitive 18) web/scripts/scheduled-jobs-runner.mjs:257— scheduled-jobs-runner.recordCompletion has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 8 (nesting depth added 1). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (apply, a function literal at line 274). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
assistant-console.ConfirmationCard (cognitive 18) web/src/components/assistant-console.tsx:1080— assistant-console.ConfirmationCard has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (14 pts), boolean chains 2, if/else 2 (nesting depth added 8). Of this number, 14 points are the body's own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
status-select.StatusEditor::onChange (cognitive 18) web/src/components/status-select.tsx:64— status-select.StatusEditor::onChange has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, ternaries 2 (3 pts), error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
analytics-data.normalizeWorkMode (cognitive 18) REDACTED:53— analytics-data.normalizeWorkMode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
discover.assembleDedupContext (cognitive 18) web/src/lib/core/discover.ts:13— discover.assembleDedupContext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3, boolean chains 2, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
studio.studioReducer (cognitive 18) web/src/lib/cv-studio/studio.mjs:184— studio.studioReducer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 3 (7 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
whats-new.collectWhatsNew (cognitive 18) web/src/lib/whats-new.mjs:52— whats-new.collectWhatsNew has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 4). Of this number, 11 points are the body's own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
collectSeenCompanyRoles::add (cognitive 18) REDACTED:2836— collectSeenCompanyRoles::add has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, other 2, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
printSummary (cognitive 18) discover-ats.mjs:896— printSummary has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (9 pts), loops 3 (6 pts), if/else 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
runAdd (cognitive 18) REDACTED:989— runAdd has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 1 (4 pts), loops 2 (3 pts), boolean chains 1, other 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseCards (cognitive 18) providers/builtin.mjs:288— parseCards has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), other 2, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity· main (cognitive 18) · ×1
main (cognitive 18) ics-interview.mjs:489— main has cognitive complexity 18 (threshold 15). Drivers by points: error handling 3 (6 pts), if/else 5, ternaries 3 (5 pts), boolean chains 1, other 1 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
tracker-parse.markdownLinkDestination (cognitive 17) REDACTED:420— tracker-parse.markdownLinkDestination has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_registry.resolveProvider (cognitive 17) providers/_registry.mjs:68— _registry.resolveProvider has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_net.isBlockedV4 (cognitive 17) plugins/_net.mjs:51— _net.isBlockedV4 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
zoho-recruit.enrichFromDetails (cognitive 17) providers/zoho-recruit.mjs:290— zoho-recruit.enrichFromDetails has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
history-ats-seeds.parseTrackerAtsSeeds (cognitive 17) history-ats-seeds.mjs:71— history-ats-seeds.parseTrackerAtsSeeds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 3 (6 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verify-cv-facts.delegatedAuthorshipClaims (cognitive 17) REDACTED:1186— verify-cv-facts.delegatedAuthorshipClaims has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). Of this number, 15 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verify-cv-facts.parseCliArgs (cognitive 17) REDACTED:2319— verify-cv-facts.parseCliArgs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generate-pdf.validateLockedSections (cognitive 17) REDACTED:665— generate-pdf.validateLockedSections has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2, ternaries 2 (nesting depth added 3). Of this number, 12 points are the body's own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
build-cv-html.prepareCandidatePhoto (cognitive 17) build-cv-html.mjs:149— build-cv-html.prepareCandidatePhoto has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 3, ternaries 3, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
build-cv-html.loadSectionPartials (cognitive 17) build-cv-html.mjs:358— build-cv-html.loadSectionPartials has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cv-templates.resolveTemplate (cognitive 17) REDACTED:608— cv-templates.resolveTemplate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 4). Of this number, 16 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
career-profile.reviewFact (cognitive 17) career-profile.mjs:172— career-profile.reviewFact has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verify-portals.main (cognitive 17) REDACTED:1139— verify-portals.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, ternaries 3 (4 pts), loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
scan.collectSeenCompanyRoles (cognitive 17) REDACTED:2829— scan.collectSeenCompanyRoles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 7, loops 3 (4 pts), ternaries 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pinpoint.parsePinpointResponse (cognitive 17) providers/pinpoint.mjs:124— pinpoint.parsePinpointResponse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 6, boolean chains 2, error handling 1 (2 pts) (nesting depth added 2). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 128). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
discover-ats.resolveWorkday (cognitive 17) discover-ats.mjs:626— discover-ats.resolveWorkday has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (3 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
latex-content.extractItemizeItems (cognitive 17) lib/latex-content.mjs:241— latex-content.extractItemizeItems has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
filter-audit.readHistory (cognitive 17) filter-audit.mjs:74— filter-audit.readHistory has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
reserve-report-num.occupiedFromFailedBatchState (cognitive 17) reserve-report-num.mjs:85— reserve-report-num.occupiedFromFailedBatchState has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mjs-files.trackedFiles (cognitive 17) lib/mjs-files.mjs:102— mjs-files.trackedFiles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (5 pts), error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
story-provenance-check.classifyEntries (cognitive 17) story-provenance-check.mjs:624— story-provenance-check.classifyEntries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
merge-tracker.reportNumbersWithStatus (cognitive 17) merge-tracker.mjs:72— merge-tracker.reportNumbersWithStatus has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
plugins.cmdAdd (cognitive 17) plugins.mjs:494— plugins.cmdAdd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 4 (5 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
install-h1b-index.downloadAsset (cognitive 17) plugins/h1b-sponsor/install-h1b-index.mjs:144— install-h1b-index.downloadAsset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 145). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
amazon.buildQuery (cognitive 17) providers/amazon.mjs:26— amazon.buildQuery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
jobicy.parseJobicyResponse (cognitive 17) providers/jobicy.mjs:43— jobicy.parseJobicyResponse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, boolean chains 5, ternaries 5, error handling 1. Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 53, toEpochMs). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
mokahr.parseMokaHrJobs (cognitive 17) REDACTED:171— mokahr.parseMokaHrJobs has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
personio.parsePersonioListing (cognitive 17) REDACTED:305— personio.parsePersonioListing has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
radancy.parseModernResults (cognitive 17) REDACTED:270— radancy.parseModernResults has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (7 pts), error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
telegram-channel.employerName (cognitive 17) REDACTED:145— telegram-channel.employerName has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
follow-up-card.FollowUpCard (cognitive 17) web/src/components/home/follow-up-card.tsx:27— follow-up-card.FollowUpCard has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (8 pts), boolean chains 6, if/else 2, error handling 1 (nesting depth added 1). Of this number, 13 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
portals-view.PortalsView (cognitive 17) web/src/components/portals-view.tsx:22— portals-view.PortalsView has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 2 (4 pts), loops 1, ternaries 1 (nesting depth added 2). Of this number, 9 points are the body's own statements and 8 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
scan.runDiscovery (cognitive 17) web/src/lib/core/scan.ts:373— scan.runDiscovery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 4 (6 pts), boolean chains 3, loops 1 (nesting depth added 3). Of this number, 13 points are the body's own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
pipeline-sankey.classifyLeaf (cognitive 17) web/src/lib/pipeline-sankey.mjs:139— pipeline-sankey.classifyLeaf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
pipeline-sankey.layoutSankey (cognitive 17) web/src/lib/pipeline-sankey.mjs:232— pipeline-sankey.layoutSankey has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 4 (5 pts), boolean chains 3, ternaries 3 (nesting depth added 3). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
posting-url.linkDestination (cognitive 17) web/src/lib/posting-url.mjs:23— posting-url.linkDestination has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scheduled-jobs.parseScheduledJobInput (cognitive 17) web/src/lib/scheduled-jobs.ts:90— scheduled-jobs.parseScheduledJobInput has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, ternaries 3 (4 pts), error handling 1, if/else 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
weekly-digest.extractGapsByCompany (cognitive 17) weekly-digest.mjs:185— weekly-digest.extractGapsByCompany has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mergeTracker (cognitive 17) merge-tracker.mjs:328— mergeTracker has cognitive complexity 17 (threshold 15). Drivers by points: if/else 188 (318 pts), boolean chains 100, ternaries 50 (85 pts), loops 16 (24 pts), other 24, error handling 4 (6 pts) (nesting depth added 175). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
buildHintStopwords (cognitive 17) REDACTED:332— buildHintStopwords has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (6 pts), other 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
companyHintsFromQuery (cognitive 17) REDACTED:384— companyHintsFromQuery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2, other 2 (nesting depth added 4). Of this number, 15 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseFollowups (cognitive 17) followup-cadence.mjs:504— parseFollowups has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 2, loops 1, other 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
validateUrlSecurity (cognitive 17) upskill.mjs:779— validateUrlSecurity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 2 (4 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fetchRssDiscovery (cognitive 17) REDACTED:752— fetchRssDiscovery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
countAuthoredCommits (cognitive 17) github-evidence.mjs:544— countAuthoredCommits has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (9 pts), boolean chains 5, if/else 3 (nesting depth added 2). Of this number, 14 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
resolveTenant (cognitive 17) providers/eightfold.mjs:118— resolveTenant has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
liveness-core.classifyLiveness (cognitive 16) liveness-core.mjs:271— liveness-core.classifyLiveness has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 3, ternaries 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
assessment-log.printOpen (cognitive 16) assessment-log.mjs:311— assessment-log.printOpen has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_engine.mergeProviderPlugins (cognitive 16) plugins/_engine.mjs:763— _engine.mergeProviderPlugins has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 1 (3 pts), error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
theme-style.readLockedSections (cognitive 16) theme-style.mjs:97— theme-style.readLockedSections has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 4). Of this number, 10 points are the body's own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
listing-fingerprint.triple (cognitive 16) listing-fingerprint.mjs:33— listing-fingerprint.triple has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
followup-cadence.extractContacts (cognitive 16) followup-cadence.mjs:704— followup-cadence.extractContacts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 12, loops 5 (9 pts), ternaries 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
company-funded.renderReport (cognitive 16) REDACTED:856— company-funded.renderReport has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (6 pts), boolean chains 4, loops 3 (4 pts), if/else 1 (2 pts) (nesting depth added 6). Of this number, 13 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
company-funded.printHuman (cognitive 16) REDACTED:912— company-funded.printHuman has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, ternaries 2 (5 pts), loops 2 (3 pts), if/else 2 (nesting depth added 4). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
coverage-check.main (cognitive 16) coverage-check.mjs:275— coverage-check.main has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 4, ternaries 3 (4 pts), loops 1 (nesting depth added 1). Of this number, 14 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
latex-content.extractSkillValues (cognitive 16) lib/latex-content.mjs:193— latex-content.extractSkillValues has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
github-evidence.collectCommits (cognitive 16) github-evidence.mjs:589— github-evidence.collectCommits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
github-evidence.runCli (cognitive 16) github-evidence.mjs:699— github-evidence.runCli has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 2, ternaries 2, boolean chains 1 (nesting depth added 2). Of this number, 15 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
intake.extractAll (cognitive 16) intake.mjs:296— intake.extractAll has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (7 pts), if/else 5 (6 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 3). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 299). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
api.plausibleMatch (cognitive 16) plugins/h1b-sponsor/lib/api.mjs:370— api.plausibleMatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (tokens, isPrefix). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
precheck-duplicate.findDuplicateCandidates (cognitive 16) precheck-duplicate.mjs:105— precheck-duplicate.findDuplicateCandidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 2). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
amazon.formatLocation (cognitive 16) providers/amazon.mjs:67— amazon.formatLocation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), boolean chains 3, loops 2 (3 pts), ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cryptocurrencyjobs.parseCryptocurrencyJobsRss (cognitive 16) REDACTED:63— cryptocurrencyjobs.parseCryptocurrencyJobsRss has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), if/else 2 (4 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
deutschebahn.parseHits (cognitive 16) providers/deutschebahn.mjs:81— deutschebahn.parseHits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (6 pts), error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
jobstreet.parseJobstreetItem (cognitive 16) providers/jobstreet.mjs:188— jobstreet.parseJobstreetItem has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, ternaries 2 (3 pts), error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
schoolspring.parseSchoolSpringPage (cognitive 16) providers/schoolspring.mjs:167— schoolspring.parseSchoolSpringPage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
taleo.parseColumns (cognitive 16) providers/taleo.mjs:121— taleo.parseColumns has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 11 (14 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
validate-portals.validateParser (cognitive 16) validate-portals.mjs:129— validate-portals.validateParser has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
route.GET (cognitive 16) REDACTED:22— route.GET has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (5 pts), error handling 1, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (toOffer). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
search-insights.SearchInsights (cognitive 16) web/src/components/analytics/search-insights.tsx:14— search-insights.SearchInsights has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, boolean chains 5, ternaries 3 (5 pts) (nesting depth added 2). Of this number, 10 points are the body's own statements and 6 belong to 5 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
submit-guard.isSubmitControl (cognitive 16) web/src/lib/apply/submit-guard.mjs:241— submit-guard.isSubmitControl has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 11, if/else 5. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
assistant-chat-store.saveChat (cognitive 16) web/src/lib/assistant-chat-store.mjs:66— assistant-chat-store.saveChat has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, error handling 2 (nesting depth added 1). Of this number, 8 points are the body's own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
portals-config.loadPortalsDocument (cognitive 16) REDACTED:37— portals-config.loadPortalsDocument has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (8 pts), error handling 3 (4 pts), if/else 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
profile-patch.profilePatchError (cognitive 16) web/src/lib/profile-patch.mjs:5— profile-patch.profilePatchError has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (7 pts), loops 2 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
data.markdownLinkDestination (cognitive 16) REDACTED:902— data.markdownLinkDestination has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
screens.findInlineMatch (cognitive 16) dashboard/internal/ui/screens/viewer.go:611— screens.findInlineMatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2 (nesting depth added 4). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 613, 642, 627). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
ProgressModel.renderFunnel (cognitive 16) dashboard/internal/ui/screens/progress.go:149— ProgressModel.renderFunnel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StatsModel.renderPay (cognitive 16) dashboard/internal/ui/screens/stats.go:572— StatsModel.renderPay has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseArgs (cognitive 16) scan-ats-full.mjs:423— parseArgs has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (6 pts), if/else 5, boolean chains 4, other 1 (nesting depth added 1). Of this number, 13 points are the body's own statements and 3 belong to 7 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
resolveRow (cognitive 16) set-status.mjs:448— resolveRow has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 1 (2 pts), ternaries 1 (2 pts), boolean chains 1, other 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
normalizeListing (cognitive 16) browser-extract.mjs:869— normalizeListing has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 1 (2 pts), other 2, ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity· main (cognitive 16) · ×1
main (cognitive 16) browser-extract.mjs:1057— main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), error handling 3 (4 pts), boolean chains 1 (nesting depth added 2). Of this number, 15 points are the body's own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
occupiedFromLedgers (cognitive 16) reserve-report-num.mjs:201— occupiedFromLedgers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 5 (7 pts), other 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TooManyMethods: PipelineModel dashboard/internal/ui/screens/pipeline.go:298— TooManyMethods — 59 methods. The bar is 30 methods; this is 29 over it, 1.97× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (30–31 lines × 2) REDACTED:525— REDACTED:525-554 | REDACTED:610-640 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:525` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (24–28 lines × 2) dashboard/internal/ui/screens/progress.go:94— dashboard/internal/ui/screens/progress.go:94-121 | dashboard/internal/ui/screens/stats.go:255-278 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `dashboard/internal/ui/screens/progress.go:94` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (26–27 lines × 2) dashboard/internal/ui/screens/pipeline.go:2181— dashboard/internal/ui/screens/pipeline.go:2181-2207 | dashboard/internal/ui/screens/viewer.go:949-974 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (21–22 lines × 2) dashboard/internal/data/pdf.go:110— dashboard/internal/data/pdf.go:110-131 | dashboard/internal/data/pdf.go:159-179 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `dashboard/internal/data/pdf.go:110` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `dashboard/internal/data/pdf.go:132` calls `isSafeRepoRelativePath` and `dashboard/internal/data/pdf.go:180` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (19–20 lines × 2) dashboard/internal/ui/screens/pipeline.go:538— dashboard/internal/ui/screens/pipeline.go:538-556 | dashboard/internal/ui/screens/pipeline.go:1019-1038 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `dashboard/internal/ui/screens/pipeline.go:538` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (12–14 lines × 2) REDACTED:382— REDACTED:382-393 | REDACTED:466-479 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:382` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:377` calls `Join`, `loadBatchInputURLs` and `REDACTED:463` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (12 lines × 2) dashboard/internal/data/pdf.go:135— dashboard/internal/data/pdf.go:135-146 | dashboard/internal/data/pdf.go:180-191 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) dashboard/internal/ui/screens/pipeline.go:2112— dashboard/internal/ui/screens/pipeline.go:2112-2122 | dashboard/internal/ui/screens/viewer.go:872-882 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `dashboard/internal/ui/screens/viewer.go:869` calls `Foreground`, `Render`, `sanitizeFlash` and `dashboard/internal/ui/screens/pipeline.go:2110` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8–10 lines × 2) dashboard/internal/ui/screens/pipeline.go:2260— dashboard/internal/ui/screens/pipeline.go:2260-2269 | dashboard/internal/ui/screens/pipeline.go:2398-2405 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10 lines × 2) dashboard/internal/ui/screens/progress.go:397— dashboard/internal/ui/screens/progress.go:397-406 | dashboard/internal/ui/screens/stats.go:660-669 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 3) dashboard/internal/ui/screens/pipeline.go:2106— dashboard/internal/ui/screens/pipeline.go:2106-2113 | dashboard/internal/ui/screens/progress.go:395-402 | dashboard/internal/ui/screens/stats.go:658-665 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (7 lines × 3) dashboard/internal/ui/screens/progress.go:157— dashboard/internal/ui/screens/progress.go:157-163 | dashboard/internal/ui/screens/progress.go:230-236 | dashboard/internal/ui/screens/progress.go:346-352 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `dashboard/internal/ui/screens/progress.go:157` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 3) dashboard/internal/ui/screens/progress.go:124— dashboard/internal/ui/screens/progress.go:124-129 | dashboard/internal/ui/screens/stats.go:281-286 | dashboard/internal/ui/screens/viewer.go:274-279 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (5 lines × 3) dashboard/internal/ui/screens/stats.go:434— dashboard/internal/ui/screens/stats.go:434-438 | dashboard/internal/ui/screens/stats.go:508-512 | dashboard/internal/ui/screens/stats.go:573-577 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 2) REDACTED:474— REDACTED:474-480 | REDACTED:511-517 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
IC1 · Incompleteness & stubs· Both branches are identical · ×1
Both branches are identical — the condition decides nothing generate-latex.mjs:434— Both arms of this conditional expression are the same, so no input can make the condition matter. Implement the distinction that was intended, or drop the condition.
IC1 · Incompleteness & stubs· Markup wires an event to an empty handler · ×1
Markup wires an event to an empty handler web/src/components/assistant-console.tsx:908— `onOpen` is wired to an arrow whose body is empty — the markup attaches a listener that does nothing. Implement the handler, or remove the attribute that wires it.
No structured logging — No logging call was found in the 767 JavaScript/TypeScript, Go production file(s) this check read across 4 module(s). Each was searched for its ecosystem's logging libraries (Go: log, log/slog, zap, zerolog, logrus, klog, hclog, logr; JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger) and for a call on a receiver named `log`/`logger` (or ending in `Logger`/`_logger`) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read — this is 'no logging found by this walk', not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose.
Duplication concentrated across 22 sibling directories (34 clone groups) web/src/app/api/assistant/route.ts:91— 34 duplicated blocks under web/src/app/api/ have copies in at least two of the sibling directories apply, assistant, company-history, cv, cv-studio, explore (+16 more sibling(s) not listed) — 28 of them are reported below, and 6 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 34 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 34 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 34 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
Duplication concentrated across 3 sibling directories (14 clone groups) web/src/app/api/cover-pdf/route.ts:36— 14 duplicated blocks under web/src/ have copies in at least two of the sibling directories app, components, lib — 7 of them are reported below, and 7 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 14 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 14 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 14 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
Duplication concentrated across 8 sibling directories (12 clone groups) web/src/components/followups/log-dialog.tsx:44— 12 duplicated blocks under web/src/components/ have copies in at least two of the sibling directories analytics, apply, cv, explore, followups, home (+2 more sibling(s) not listed) — 6 of them are reported below, and 6 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 12 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 12 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 12 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
Duplication concentrated across 7 sibling directories (11 clone groups) lib/dir-lock.mjs:42— 11 duplicated blocks under the repository root have copies in at least two of the sibling directories batch, lib, plugins, providers, seeds, utils (+1 more sibling(s) not listed) — 7 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 11 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 11 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 11 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
Wholesale file copy (271 identical lines × 2 files) lib/dir-lock.mjs:42— lib/dir-lock.mjs:42 · web/src/lib/core/dir-lock.mjs:42 — these 2 files are line-for-line copies of one another — 271 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication· Duplicated block with local edits (249 matched lines × 2 locations) · ×1
Duplicated block with local edits (249 matched lines × 2 locations) ollama-eval.mjs:41— ollama-eval.mjs:41 · openai-eval.mjs:46 — the two spans are one implementation copied and then locally edited — 1834 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (95 matched lines × 2 locations) · ×1
Duplicated block with local edits (95 matched lines × 2 locations) closing-soon.mjs:332— closing-soon.mjs:332 · reeval-candidates.mjs:332 — the two spans are one implementation copied and then locally edited — 830 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (93 matched lines × 2 locations) · ×1
Duplicated block with local edits (93 matched lines × 2 locations) providers/computrabajo.mjs:51— providers/computrabajo.mjs:51 · providers/magneto.mjs:45 — the two spans are one implementation copied and then locally edited — 689 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (80 matched lines × 2 locations) · ×1
Duplicated block with local edits (80 matched lines × 2 locations) providers/justjoin.mjs:8— providers/justjoin.mjs:8 · providers/nofluffjobs.mjs:8 — the two spans are one implementation copied and then locally edited — 589 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (76 lines × 2 locations) REDACTED:12— REDACTED:12 · REDACTED:12 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication· Duplicated block with local edits (72 matched lines × 2 locations) · ×1
Duplicated block with local edits (72 matched lines × 2 locations) providers/alibaba.mjs:69— providers/alibaba.mjs:69 · providers/tencent.mjs:43 — the two spans are one implementation copied and then locally edited — 540 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (67 matched lines × 2 locations) · ×1
Duplicated block with local edits (67 matched lines × 2 locations) web/src/app/api/assistant/route.ts:91— web/src/app/api/assistant/route.ts:91 · REDACTED:119 — the two spans are one implementation copied and then locally edited — 421 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (62 matched lines × 2 locations) · ×1
Duplicated block with local edits (62 matched lines × 2 locations) providers/careerviet.mjs:49— providers/careerviet.mjs:49 · providers/itviec.mjs:37 — the two spans are one implementation copied and then locally edited — 427 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (59 matched lines × 2 locations) · ×1
Duplicated block with local edits (59 matched lines × 2 locations) web/src/components/followups/log-dialog.tsx:25— web/src/components/followups/log-dialog.tsx:25 · web/src/components/followups/next-date-dialog.tsx:32 — the two spans are one implementation copied and then locally edited — 364 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (52 matched lines × 2 locations) · ×1
Duplicated block with local edits (52 matched lines × 2 locations) providers/beesite.mjs:55— providers/beesite.mjs:55 · providers/deutschebahn.mjs:58 — the two spans are one implementation copied and then locally edited — 337 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (46 lines × 3 locations) providers/careerviet.mjs:263— providers/careerviet.mjs:263 · providers/itviec.mjs:227 · providers/senjob.mjs:155 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication· Duplicated block with local edits (46 matched lines × 2 locations) · ×1
Duplicated block with local edits (46 matched lines × 2 locations) providers/dover.mjs:126— providers/dover.mjs:126 · providers/rippling.mjs:127 — the two spans are one implementation copied and then locally edited — 379 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (45 lines × 3 locations) REDACTED:16— REDACTED:16 · REDACTED:12 · REDACTED:12 — the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R10 · Code Duplication· Duplicated block with local edits (44 matched lines × 2 locations) · ×1
Duplicated block with local edits (44 matched lines × 2 locations) providers/neogov.mjs:29— providers/neogov.mjs:29 · providers/schoolspring.mjs:20 — the two spans are one implementation copied and then locally edited — 295 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (43 matched lines × 2 locations) · ×1
Duplicated block with local edits (43 matched lines × 2 locations) providers/hecklerkoch.mjs:24— providers/hecklerkoch.mjs:24 · providers/softgarden.mjs:27 — the two spans are one implementation copied and then locally edited — 313 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (42 matched lines × 2 locations) · ×1
Duplicated block with local edits (42 matched lines × 2 locations) providers/csod.mjs:38— providers/csod.mjs:38 · providers/phenom.mjs:53 — the two spans are one implementation copied and then locally edited — 275 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (41 matched lines × 2 locations) · ×1
Duplicated block with local edits (41 matched lines × 2 locations) REDACTED:245— REDACTED:245 · openai-eval.mjs:154 — the two spans are one implementation copied and then locally edited — 303 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (40 lines × 2 locations) providers/bamboohr.mjs:55— providers/bamboohr.mjs:55 · providers/breezy.mjs:16 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication· Duplicated block with local edits (37 matched lines × 2 locations) · ×1
Duplicated block with local edits (37 matched lines × 2 locations) REDACTED:230— REDACTED:230 · sync-batch-input.mjs:67 — the two spans are one implementation copied and then locally edited — 430 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (35 matched lines × 2 locations) · ×1
Duplicated block with local edits (35 matched lines × 2 locations) web/src/components/page-loading-skeletons.tsx:54— web/src/components/page-loading-skeletons.tsx:54 · web/src/components/page-loading-skeletons.tsx:113 — the two spans are one implementation copied and then locally edited — 222 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (34 lines × 2 locations) lib/cli-launch.mjs:21— lib/cli-launch.mjs:21 · web/src/lib/cli-launch.mjs:21 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication· Duplicated block with local edits (34 matched lines × 2 locations) · ×1
Duplicated block with local edits (34 matched lines × 2 locations) pipeline-lock.mjs:32— pipeline-lock.mjs:32 · portal-health-lock.mjs:23 — the two spans are one implementation copied and then locally edited — 219 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (34 lines × 3 locations) REDACTED:37— REDACTED:37 · REDACTED:38 · REDACTED:38 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 195, cognitive 282) · ×1
Complex function main (cyclomatic 195, cognitive 282) REDACTED:3989— main has cyclomatic complexity 195 and cognitive complexity 282; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function mergeUnderLock (cyclomatic 133, cognitive 236) merge-tracker.mjs:1334— mergeUnderLock has cyclomatic complexity 133 and cognitive complexity 236; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function runSelfTest (cyclomatic 115, cognitive 139) analyze-patterns.mjs:433— runSelfTest has cyclomatic complexity 115 and cognitive complexity 139; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 108, cognitive 161) · ×1
Complex function main (cyclomatic 108, cognitive 161) scan-ats-full.mjs:1156— main has cyclomatic complexity 108 and cognitive complexity 161; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function apply (cyclomatic 102, cognitive 164) REDACTED:4515— apply has cyclomatic complexity 102 and cognitive complexity 164; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function runSelfTest (cyclomatic 80, cognitive 86) build-cv-html.mjs:1108— runSelfTest has cyclomatic complexity 80 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function selfTest (cyclomatic 77, cognitive 59) REDACTED:746— selfTest has cyclomatic complexity 77 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 67, cognitive 130) REDACTED:4349— (anonymous) has cyclomatic complexity 67 and cognitive complexity 130; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function syncTrackerPdfFlags (cyclomatic 62, cognitive 148) sync-pdf-flags.mjs:56— syncTrackerPdfFlags has cyclomatic complexity 62 and cognitive complexity 148; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function ExplorerView (cyclomatic 54, cognitive 43) web/src/components/explore/explorer-view.tsx:33— ExplorerView has cyclomatic complexity 54 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function diagnose (cyclomatic 51, cognitive 77) coverage-check.mjs:123— diagnose has cyclomatic complexity 51 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function validateManifest (cyclomatic 51, cognitive 56) plugins/_engine.mjs:182— validateManifest has cyclomatic complexity 51 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function parseReport (cyclomatic 50, cognitive 58) analyze-patterns.mjs:974— parseReport has cyclomatic complexity 50 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function canonicalizeArchetype (cyclomatic 50, cognitive 27) web/src/lib/analytics-metrics.mjs:147— canonicalizeArchetype has cyclomatic complexity 50 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function validatePortalsConfig (cyclomatic 49, cognitive 130) validate-portals.mjs:190— validatePortalsConfig has cyclomatic complexity 49 and cognitive complexity 130; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function buildEvidence (cyclomatic 48, cognitive 57) github-evidence.mjs:195— buildEvidence has cyclomatic complexity 48 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function locallyModifiedSystemFiles (cyclomatic 47, cognitive 102) REDACTED:2399— locallyModifiedSystemFiles has cyclomatic complexity 47 and cognitive complexity 102; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 47, cognitive 88) · ×1
Complex function main (cyclomatic 47, cognitive 88) check-liveness.mjs:159— main has cyclomatic complexity 47 and cognitive complexity 88; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 46, cognitive 123) · ×1
Complex function main (cyclomatic 46, cognitive 123) batch/aggregate-tokens.mjs:30— main has cyclomatic complexity 46 and cognitive complexity 123; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function fold (cyclomatic 46, cognitive 57) REDACTED:533— fold has cyclomatic complexity 46 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
REDACTED: 5610 lines of code REDACTED:1— REDACTED has 5610 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
REDACTED: 4786 lines of code REDACTED:1— REDACTED has 4786 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
REDACTED: 2896 lines of code REDACTED:1— REDACTED has 2896 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
merge-tracker.mjs: 2288 lines of code merge-tracker.mjs:1— merge-tracker.mjs has 2288 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
REDACTED: 2193 lines of code REDACTED:1— REDACTED has 2193 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
scan-ats-full.mjs: 1834 lines of code scan-ats-full.mjs:1— scan-ats-full.mjs has 1834 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
analyze-patterns.mjs: 1697 lines of code analyze-patterns.mjs:1— analyze-patterns.mjs has 1697 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
REDACTED: 1632 lines of code REDACTED:1— REDACTED has 1632 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
company-history.mjs: 1618 lines of code company-history.mjs:1— company-history.mjs has 1618 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
build-cv-html.mjs: 1430 lines of code build-cv-html.mjs:1— build-cv-html.mjs has 1430 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
doctor.mjs: 1422 lines of code doctor.mjs:1— doctor.mjs has 1422 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
tracker.mjs: 1268 lines of code tracker.mjs:1— tracker.mjs has 1268 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
verify-ats.mjs: 1245 lines of code verify-ats.mjs:1— verify-ats.mjs has 1245 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
discover-ats.mjs: 1200 lines of code discover-ats.mjs:1— discover-ats.mjs has 1200 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
providers/workday.mjs: 1196 lines of code providers/workday.mjs:1— providers/workday.mjs has 1196 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
jd-skill-gap.mjs: 1195 lines of code jd-skill-gap.mjs:1— jd-skill-gap.mjs has 1195 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
REDACTED: 1171 lines of code REDACTED:1— REDACTED has 1171 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· web/src/components/assistant-console.tsx · ×1
web/src/components/assistant-console.tsx: 1089 lines of code web/src/components/assistant-console.tsx:1— web/src/components/assistant-console.tsx has 1089 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
browser-extract.mjs: 1076 lines of code browser-extract.mjs:1— browser-extract.mjs has 1076 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
check-jd-archive.mjs: 1067 lines of code check-jd-archive.mjs:1— check-jd-archive.mjs has 1067 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
followup-cadence.mjs: 1048 lines of code followup-cadence.mjs:1— followup-cadence.mjs has 1048 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
invite-match.mjs: 1029 lines of code invite-match.mjs:1— invite-match.mjs has 1029 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
set-status.mjs: 977 lines of code set-status.mjs:1— set-status.mjs has 977 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
tracker-utils.mjs: 971 lines of code tracker-utils.mjs:1— tracker-utils.mjs has 971 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
story-provenance-check.mjs: 956 lines of code story-provenance-check.mjs:1— story-provenance-check.mjs has 956 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
REDACTED: 955 lines of code REDACTED:1— REDACTED has 955 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
liveness-api.mjs: 948 lines of code liveness-api.mjs:1— liveness-api.mjs has 948 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
upskill.mjs: 939 lines of code upskill.mjs:1— upskill.mjs has 939 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
lib/dir-lock.mjs: 931 lines of code lib/dir-lock.mjs:1— lib/dir-lock.mjs has 931 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· web/src/lib/core/dir-lock.mjs · ×1
web/src/lib/core/dir-lock.mjs: 931 lines of code web/src/lib/core/dir-lock.mjs:1— web/src/lib/core/dir-lock.mjs has 931 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
REDACTED: 876 lines of code REDACTED:1— REDACTED has 876 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
openrouter-runner.mjs: 866 lines of code openrouter-runner.mjs:1— openrouter-runner.mjs has 866 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
linkedin-join.mjs: 859 lines of code linkedin-join.mjs:1— linkedin-join.mjs has 859 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
funnel-velocity.mjs: 835 lines of code funnel-velocity.mjs:1— funnel-velocity.mjs has 835 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
REDACTED: 776 lines of code REDACTED:1— REDACTED has 776 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
plugins/_engine.mjs: 763 lines of code plugins/_engine.mjs:1— plugins/_engine.mjs has 763 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
liveness-browser.mjs: 759 lines of code liveness-browser.mjs:1— liveness-browser.mjs has 759 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· updater-migration-tests.mjs · ×1
updater-migration-tests.mjs: 753 lines of code updater-migration-tests.mjs:1— updater-migration-tests.mjs has 753 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
stats.mjs: 750 lines of code stats.mjs:1— stats.mjs has 750 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
detect-reposts.mjs: 741 lines of code detect-reposts.mjs:1— detect-reposts.mjs has 741 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R6 · Tooling· The declared test suite includes a file that cannot be loaded · ×1
The declared test suite includes a file that cannot be loaded web/tests/lib/json-body.test.mjs:22— This repository declares test tooling, and the ✓ above records that declaration — but web/tests/lib/json-body.test.mjs and 2 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) — each one is reported with its failing import under Test Coverage — then the declared script exercises what it claims to.
Dead file (~945 LoC) REDACTED— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~527 LoC) REDACTED— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~524 LoC) REDACTED— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~479 LoC) providers/ultipro.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~471 LoC) providers/adp-workforcenow.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~469 LoC) providers/gupy.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~446 LoC) providers/techinasia.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~444 LoC) REDACTED— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~443 LoC) providers/jobvite.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~378 LoC) providers/jobstreet.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~358 LoC) providers/platsbanken.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~343 LoC) providers/gem.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~340 LoC) providers/arbeitsagentur.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~335 LoC) REDACTED— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~334 LoC) providers/careerviet.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~326 LoC) providers/remotli.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~322 LoC) providers/vdab.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~307 LoC) REDACTED— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~304 LoC) providers/taleo.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~299 LoC) REDACTED— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~297 LoC) REDACTED— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~295 LoC) providers/deutschebahn.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~293 LoC) providers/getro.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~290 LoC) providers/kalibrr.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~281 LoC) providers/avature.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~280 LoC) providers/occ.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~276 LoC) providers/phenom.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~268 LoC) REDACTED— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~260 LoC) providers/eploy.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~253 LoC) providers/prevueaps.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~250 LoC) providers/glints.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~249 LoC) providers/wttj.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~238 LoC) providers/jazzhr.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~234 LoC) providers/torre.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~231 LoC) providers/senjob.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~223 LoC) providers/mycareersfuture.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~222 LoC) providers/manfred.mjs— no import path from any entry point (382 application, 163 tooling, 1108 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Silent fallback default in catch check-jd-archive.mjs:581— `findUnarchivedApplications` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch url-key.mjs:305— `normalizeUrl` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch url-key.mjs:407— `postingScript` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:79— `cleanUrl` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch history-ats-seeds.mjs:115— `readIfPresent` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch theme-style.mjs:84— `readStyleTokens` swallows every exception into `return {}` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch theme-style.mjs:153— `readCvSectionOrder` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch lib/template-manifest.mjs:16— `parseMeta` swallows every exception into `return {}` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch build-cv-html.mjs:144— `profilePhotoValue` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch lib/outcome-dir.mjs:51— `mtime` (in `outcomeDirsFor`) swallows every exception into `return -1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:534— `locationHintFromUrl` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:1281— `loadCandidateCountry` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:1309— `loadReApplyWindows` swallows every exception into `return {}` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:1764— `languageFormsFromUrl` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch followup-cadence.mjs:90— `loadProfileCadence` swallows every exception into `return {}` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch close-stale.mjs:300— `readIfExists` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch doctor.mjs:867— `emptyYamlPrereqs` swallows every exception into `return false` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch openrouter-runner.mjs:104— `loadPersistedBlacklist` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch providers/_country.mjs:22— `countryName` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch providers/_profile-keywords.mjs:70— `resolveProfileKeywords` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch providers/bwi.mjs:95— `slugToTitle` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch providers/collage.mjs:66— `absoluteHttpsUrl` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch providers/glints.mjs:99— `deriveBaseUrl` swallows every exception into `return 'https://glints.com'` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch providers/hackernews.mjs:67— `looksLikeJobUrl` swallows every exception into `return false` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:88— `cleanUrl` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Duplicated predicate REDACTED:23— `!!v && typeof v === "object" && !Array.isArray(v)` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate build-cv-html.mjs:655— `!Array.isArray(categories) || categories.length === 0` appears character-identically in 2 files — build-cv-html.mjs, build-cv-latex.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate build-cv-html.mjs:408— `!Array.isArray(entries) || entries.length === 0` appears character-identically in 2 files — build-cv-html.mjs, build-cv-latex.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate REDACTED:4036— `!Number.isNaN(d.getTime()) && d.toISOString().slice(0, 10) === s` appears character-identically in 3 files — REDACTED, web/src/lib/followups.ts, weekly-digest.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate providers/icims.mjs:211— `!String(job.location || '').trim() || /^n\/?a$/i.test(String(job.location).trim())` appears character-identically in 2 files — providers/icims.mjs, providers/jazzhr.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate web/src/components/explore/first-score-view.tsx:83— `!e.shiftKey && document.activeElement === last` appears character-identically in 2 files — web/src/components/explore/first-score-view.tsx, web/src/components/mobile-nav.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate learn.mjs:252— `!entry || typeof entry !== 'object' || Array.isArray(entry)` appears character-identically in 3 files — learn.mjs, lib/cv-payload-schema.mjs, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate keyword-match.mjs:547— `!existsSync(reportPath) || !statSync(reportPath).isFile()` appears character-identically in 2 files — keyword-match.mjs, merge-tracker.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate openai-eval.mjs:203— `!isLoopback && parsed.protocol !== 'https:'` appears character-identically in 2 files — openai-eval.mjs, openai-tailor.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate history-ats-seeds.mjs:78— `!line.startsWith('|') || isHeaderRow(line) || isSeparatorRow(line)` appears character-identically in 2 files — history-ats-seeds.mjs, plugins.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/dir-lock.mjs:922— `!owner && existsSync(join(lockDir, 'owner.json'))` appears character-identically in 2 files — lib/dir-lock.mjs, web/src/lib/core/dir-lock.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate analyze-patterns.mjs:327— `!parsed || typeof parsed !== 'object' || Array.isArray(parsed)` appears character-identically in 4 files — analyze-patterns.mjs, hired-share.mjs, intake.mjs, upskill.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate ats-payload.mjs:786— `!payload || typeof payload !== 'object' || Array.isArray(payload)` appears character-identically in 2 files — ats-payload.mjs, lib/cv-payload-schema.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate company-history.mjs:735— `!profilePath || !existsSync(profilePath)` appears character-identically in 5 files — company-history.mjs, followup-cadence.mjs, lib/page-format.mjs, rejection-latency.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/dir-lock.mjs:656— `!readBack.inspected && retry < READBACK_RETRIES` appears character-identically in 2 files — lib/dir-lock.mjs, web/src/lib/core/dir-lock.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate plugins/h1b-sponsor/install-h1b-index.mjs:151— `!res.body || typeof res.body.getReader !== 'function'` appears character-identically in 2 files — plugins/h1b-sponsor/install-h1b-index.mjs, plugins/h1b-sponsor/lib/api.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate browser-extract.mjs:595— `!sections || typeof sections !== 'object'` appears character-identically in 2 files — browser-extract.mjs, providers/smartrecruiters.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate REDACTED:24— `!value || typeof value !== "object" || Array.isArray(value)` appears character-identically in 3 files — REDACTED, web/src/lib/profile-patch.mjs, web/src/lib/scheduled-job-input.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate web/src/lib/apply/agent-interpret.ts:39— `(el as HTMLElement).offsetParent === null && itype !== "radio" && itype !== "checkbox"` appears character-identically in 2 files — web/src/lib/apply/agent-interpret.ts, web/src/lib/apply/extract.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate REDACTED:1434— `/^cover([-_]|$)/.test(name) || /[-_]cover$/.test(name)` appears character-identically in 2 files — REDACTED, web/src/lib/documents.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate providers/alibaba.mjs:128— `Array.isArray(entry.keywords) && entry.keywords.length` appears character-identically in 5 files — providers/alibaba.mjs, providers/feishu-jobs.mjs, providers/meituan.mjs, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate providers/4dayweek.mjs:114— `Array.isArray(j.locations) && j.locations[0] && typeof j.locations[0] === 'object'` appears character-identically in 2 files — providers/4dayweek.mjs, providers/landingjobs.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate web/src/components/cv/cv-ingest.tsx:19— `JSON.parse(localStorage.getItem("career-ops:config") || "{}").cliId || null` appears character-identically in 3 files — web/src/components/cv/cv-ingest.tsx, web/src/components/explore/explore-provider.tsx, web/src/components/explore/explorer-view.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate merge-tracker.mjs:2401— `Number(process.env.CAREER_OPS_TRACKER_LOCK_RETRY_MS) || 75` appears character-identically in 3 files — merge-tracker.mjs, reserve-report-num.mjs, tracker-utils.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate merge-tracker.mjs:2402— `Number(process.env.CAREER_OPS_TRACKER_LOCK_STALE_MS) || 10 * 60_000` appears character-identically in 3 files — merge-tracker.mjs, reserve-report-num.mjs, tracker-utils.mjs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
README/code drift docs/RUNNING_ON_A_BUDGET.md:152— docs/RUNNING_ON_A_BUDGET.md documents the environment variable `OPENAI_API_BASE`, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/RUNNING_ON_A_BUDGET.md:257— docs/RUNNING_ON_A_BUDGET.md documents the environment variable `QWEN_API_BASE`, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/SOURCE_INDEXING_LOG.md:44— docs/SOURCE_INDEXING_LOG.md names `providers/a16z-speedrun.mjs`, but no file or folder `providers/a16z-speedrun.mjs` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/local-parser-cookbook.md:43— docs/local-parser-cookbook.md runs `npm run test:scan-tokens`, but no package.json declares a `test:scan-tokens` script. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
Hand-rolled JSON/XML parsing via regex providers/csod.mjs:100— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex providers/consider.mjs:128— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex providers/bwi.mjs:64— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex providers/builtin.mjs:123— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too.
Silent fallback default on error REDACTED:137— `getRepoRoot` turns a non-nil `err` into `return "."` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the `if` or in the doc comment, and the row stops firing.
Silent fallback default on error dashboard/internal/data/pdf.go:268— `sortPDFsNewestFirst` turns a non-nil `err` into `return 0` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the `if` or in the doc comment, and the row stops firing.
Silent fallback default on error dashboard/internal/data/pdf.go:310— `ResolveHTML` turns a non-nil `err` into `return "", ""` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the `if` or in the doc comment, and the row stops firing.
Silent fallback default on error dashboard/internal/ui/screens/pipeline.go:1101— `calculateWeeksToHire` turns a non-nil `err` into `return 1` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the `if` or in the doc comment, and the row stops firing.
GD1 · Unfinished & placeholder code· Placeholder literal left in code · ×3
Placeholder literal left in code story-provenance-check.mjs:741— A placeholder string ("# Experience
## Instructional Designer …") is still in shipped code — typical of generated boilerplate that was never filled in.
Placeholder literal left in code verify-ats.mjs:880— A placeholder string ("without tripping the low-text image heur…") is still in shipped code — typical of generated boilerplate that was never filled in.
Placeholder literal left in code verify-ats.mjs:1181— A placeholder string ("<header><div>jane@example.com | +1 415 5…") is still in shipped code — typical of generated boilerplate that was never filled in.
Subsumed condition operand dashboard/internal/data/stats.go:46— `strings.Contains(r, "administrator")` can never decide this `||` — every value satisfying `strings.Contains(r, "administrator")` also satisfies `strings.Contains(r, "admin")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
Subsumed condition operand REDACTED:710— `strings.HasPrefix(s, "duplicado")` can never decide this `||` — every value satisfying `strings.HasPrefix(s, "duplicado")` also satisfies `strings.HasPrefix(s, "dup")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
C2 · Access Controls· No named authorization policies · ×1
No named authorization policies — Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) — this is NOT a claim that endpoints are unprotected. What's missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can't be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 5 significant file(s) lose their only recent owner: lib/outcome-types.mjs, lib/ascii-fold.mjs, lib/outcome-dir.mjs, web/src/lib/whats-new-suppression.mjs, lib/placeholder-cell.mjs. Pair on, review, or document these before any departure.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 21 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (34 single-owned of 570 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 570 of the 767 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (2 file(s)), anonymized user #4 (2 file(s)), anonymized user #5 (3 file(s)), anonymized user #6 (3 file(s)), anonymized user #7 (2 file(s)) (+15 more) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: providers/mycareersfuture.mjs, jsonc-parse.mjs, providers/nofluffjobs.mjs, providers/justjoin.mjs, providers/arbeitnow.mjs, providers/landingjobs.mjs, web/src/components/beta/beta-banner.tsx, web/src/lib/report/report.ts (+21 more).
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 2 of 4 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is `(repository root)` (150402 LoC, 363 module-visible types across 14 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
Benchmarks don't track allocations dashboard/internal/ui/screens/pipeline_window_test.go— A Go testing.B suite exists but nothing turns on its allocation measurement — allocations (the main way hot code pressures a garbage collector or allocator) aren't being measured.
X2 · Cancellation propagation· Not all async functions that make a request accept an AbortSignal · ×1
Not all async functions that make a request accept an AbortSignal — Only 20/26 async functions that make a cancellable request (fetch, axios, ky, ofetch) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
Null assertions (`!`) reduce the strict null checking score — ~0.5 `!` null assertions per 1k TypeScript source lines — 14 assertion(s) across the 28209 source line(s) of the 230 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: web/src/app/actions/registry.ts (3), web/src/components/inbox/triage-row.tsx (3), web/src/app/api/explore/ai/route.ts (1). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce.
Skipped (documented): rejects a symlink that escapes CAREER_OPS_ROOT docs/recipes/gojobs/parse-gojobs-html.manual-test.mjs:59— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): rejects an HTML symlink inside a directory when its target escapes CAREER_OPS_ROOT docs/recipes/gojobs/parse-gojobs-html.manual-test.mjs:79— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): set-status honours a .career-ops-data marker, not just CAREER_OPS_ROOT tests/writer-scripts-data-root.test.mjs:236— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): generate-pdf honours a .career-ops-data marker for its workspace boundary tests/writer-scripts-data-root.test.mjs:254— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): generate-pdf follows a .career-ops-data marker that changes mid-process tests/writer-scripts-data-root.test.mjs:272— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): symlink policy: skip by default, follow on request, reject when a hash depends on it tests/walk-tree.test.mjs:198— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): a symlinked FILE is dropped by default and returned under links: follow tests/walk-tree.test.mjs:216— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): links: follow survives a link onto an ancestor, and still follows sibling aliases tests/walk-tree.test.mjs:236— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): symlinked proposal ${target} is refused without following its content tests/reply-proposals.test.mjs:440— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): code reached through a symlinked file or directory is audited tests/plugin-audit.test.mjs:74— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): tracker addition builders in lib and web agree tests/persist-evaluation-report.test.mjs:69— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): the web agrees with the CLI about the sheet tests/page-format.test.mjs:125— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): trackedFiles skips a tracked symlink rather than following it tests/mjs-files.test.mjs:318— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): trackedFiles rethrows a stat failure it does not recognise, instead of logging it tests/mjs-files.test.mjs:426— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): merge-tracker merges with the status as written when templates/states.yml is missing tests/merge-tracker-states-missing.test.mjs:22— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): a CLI reached through a symlinked directory still runs tests/main-guard-convention.test.mjs:68— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): isMainModule is true for the file node was pointed at, symlinked or not tests/main-guard-convention.test.mjs:126— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): REDACTED's inlined guard realpaths both sides tests/main-guard-convention.test.mjs:376— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): verify-pipeline warns about a report it cannot inspect instead of passing it tests/fix-report-links.test.mjs:170— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): real symlinks preserve legal mode aliases and cannot bypass root containment tests/evaluation-mode-parity.test.mjs:202— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): report symlinks cannot read or mutate files outside the reports directory tests/evaluation-cache.test.mjs:329— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): a checkout reached through a link gets no Runtime profile block without an override tests/batch-runner-profile-override.test.mjs:242— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): AGREES with the core's path-resolver.mjs on every branch web/tests/lib/data-root.test.mjs:102— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 22 file(s) — `.github/scripts/depends-on.mjs`, `.github/scripts/triage.bundle.mjs`, `build-cv-html.mjs`, `check-jd-archive.mjs`, `cv-sections-core.mjs`, … (+17 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
Run 01a16e3e-52f2-7e62-856d-69fcc4d3737d · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 84 · Warnings: 1884 · Recommendations: 88 · Info: 23 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 24-10-2026 @ 14:09 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.