Public report — career-ops, published 1 Oct 2026.
Concrete security findings (which rule fired, in which file, on which line; CVE IDs, secret matches,
dependency versions) are REDACTED in this version; ask the repo owner for the full report.
Public
Codebase surveyMeasured under the Code Assurance Index · rubric rubric-2026.09.18 (frozen) · verify this surveyFiledcd_3033701f8ad5474a8a110fd9ccb0beb7
Filed 1 October 2026, 15:25 UTC
Public
Large · 152,579 LoC · 4 projects · rebuild ~1.7 person-years · weakest lens: Code Health (37%)
Findings by grade
72 critical1323 serious88 minor34 could not be resolved — could be critical — see Limitations
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
1 October 2026, 15:16 UTC
A measurement, not a certificate. The Code Assurance Index does not certify,
approve or guarantee this codebase; it records a reproducible number and the evidence it was computed from. The
standard is authored by Canine Development, who also build Watchdog — its only implementation today. That is said
here so the number is checked rather than believed.
Grounded in facts. Every number here is computed, not narrated — reproducible, tool-backed, and traceable to a line of code. How to trust this ▸
1467findings with an exact file:lineof 1483 — the remainder are repo-wide signals (a dimension-level measurement, not a single line); open any file:line and verify
63/131dimensions across the health lenses152579 LoC · 4 projects — wide & deep
⚠ A critical security finding caps this grade — resolve it before relying on the score below; see the Security lens.
The platform is a large, valuable asset currently rated at risk, with a health score of 50%. While the architecture is robust and secure, the underlying code quality is weak, creating a significant drag on delivery speed and increasing the cost of every change. This imbalance means the business is paying a hidden tax on maintenance that could be eliminated with focused effort.
The primary risk is concentrated in the codebase’s maintainability. With nearly 153,000 lines of production code, the system is substantial enough that even small inefficiencies compound into major delays. The weakest lens is code health, which sits at 37%. This low score indicates high complexity and poor cohesion, meaning developers spend more time understanding and fixing issues than building new features. This creates a velocity tax on every change, plausibly increasing effort by 5–12% in affected areas. Over time, this drag erodes team capacity and increases the likelihood of defects slipping into production.
A second theme is the cost of technical debt. The effort to rebuild this system is estimated at 1.7 person-years, representing significant sunk value. However, the cost of inaction is higher. The top remediation action—migrating remaining JavaScript files to TypeScript and simplifying complex functions—pays for itself in roughly one to two months. After that point, the improvement is free, as it reduces the annual burden of maintaining over 1.3 million lines of changed code. This is not just a technical fix; it is a financial lever that unlocks team productivity.
What is genuinely good is the system’s stability and security. The architecture is well-designed, and security posture is strong, meaning the platform is reliable and safe to operate. These strengths provide a solid foundation for improvement. The focus should be on the code health lens, specifically by migrating to TypeScript and breaking down complex functions. This single move offers the highest leverage, reducing risk and accelerating delivery without requiring a full rebuild. The picture is partial, as domain modeling and event-driven patterns were not measured, but the current data clearly points to code quality as the critical bottleneck.
How the score is built — each lens's share of the headlineWidth is the lens's weight in the worst-heaviest fold (the weakest area pulls hardest); colour is that lens's own band. A lens fixes the score in proportion to its width.
Raise Code Health 37 → 70 (the Healthy floor) ⇒ headline 50 → ~61.
Code composition — where the lines go
Tests 100%
New since the last scan (100+)
338 finding(s) are new versus the previous scan (2026-09-15) — surfaced by this scheduled scan itself, no pull request required. Showing the first 100; the full set is in the report.
A full-fidelity diff against the previous run's complete recorded findings — line-move tolerant: a finding that only shifted line counts as unchanged, only genuinely new titles/files surface here.
0.7× (at 50% quality) — the last 20% of quality is most of the work
Size & shape
Large · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)
This codebase represents roughly ~1.7 person-years of build effort (about ~€240,000 to rebuild). Its weakest lens is Code Health at 37% — the part of that asset most exposed by the findings below.
How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.0) — standard service × a 0.7× quality factor, at €60–95/h; indicative, ±~30% · size measured directly from source · effort from total production LoC as straight-line logic (the tier split is a C#-only syntax walk), a conservative lower bound. Indicative only — most sensitive to the hourly rate and the domain tier (both tunable in config).
Top priorities
The highest-leverage moves; the full ranked list is in the Roadmap below.
1
Migrate the remaining .js/.jsx files to TypeScript.
Value concentrated against a weak lens · High · Value at risk
This is a Large asset (~1.7 person-years to rebuild), and its weakest lens is Code Health at 37%. The operational and business risk on an asset this size concentrates there — that's where remediation buys the most protection.
→ Direct remediation budget at Code Health first — highest risk-reduction per euro on an asset this size.
The top fix pays for itself · High · Economics
The top-ranked fix costs roughly 3–10 engineer-days once. Not doing it costs about 180.2–1081.4 engineer-days every year, paid as drag on the ~1,386,412 lines this team changes annually — a bill that arrives whether or not anyone books it. On those figures the fix breaks even in roughly 1–2 months and is free after that. Method, stated so this is not read as a quotation: debt from the ranked task's effort band; interest = annual changed lines (measured, annualised from the 90-day window) ÷ an ASSUMED 150–400 lines per engineer-day × the 5–12% drag implied by the code-quality signals; breaking point = debt ÷ annual interest. A modelled planning range built from measured inputs and one named assumption — not a quotation, a valuation, or a certified figure.
Evidence: D15 churn: 341,855 line(s) changed over a 90-day window ⇒ ~1,386,412/year · D1/D2/D4/D6 code quality: averaging 5.9/10 ⇒ a 5–12% drag on each change · top-ranked remediation: Medium effort ⇒ about 3–10 engineer-day(s)
→ Do the top-ranked fix now if this code will still be yours in 2 months.
Highest-leverage move · Medium · Leverage
Of everything flagged, the best return on effort is: Migrate the remaining .js/.jsx files to TypeScript. The rest can wait behind it.
Evidence: priority ranking: top of 5 ranked by impact/effort
→ Migrate the remaining .js/.jsx files to TypeScript.
A velocity tax on every change · Medium · Economics
The code-quality signals (complexity, duplication, cohesion) average 5.9/10, which acts as a tax on every change in the weaker areas: modifications there plausibly cost on the order of 5–12% more than in clean code, and the tax compounds as the codebase grows. (A modelled estimate, not a measured fact.)
Evidence: D1/D2/D4/D6 code quality: averaging 5.9/10 across the code-quality signals actually measured
→ Pay it down where churn is highest — the hotspots — not everywhere; that's where the tax is actually paid.
Architecture — module dependency matrix
Rows and columns are the same modules, ordered so that a module only depends on ones above it. A cell means the row depends on the column, and its number is how many type pairs create that dependency. Read one thing: is anything above the diagonal? A mark there is a dependency cycle. (A cycle is all this shows — an unusual but cycle-free dependency sits below the diagonal like any other.)
114 modules, 9 dependencies. Every dependency points down the layering — no cycles.
Showing the 40 most-connected modules; 74 more are not drawn.
Module dependency matrix. The row depends on the column; the number is how many type pairs create the dependency. A cell above the diagonal is part of a dependency cycle.
Dependency, pointing down the layeringAbove the diagonal — part of a cycleThe module itself
35→5 github.com/santifer/career-ops/dashboard/internal/data depends on github.com/santifer/career-ops/dashboard/internal/model✕
Type pairs
6 distinct (type in github.com/santifer/career-ops/dashboard/internal/data → type in github.com/santifer/career-ops/dashboard/internal/model) references.
github.com/santifer/career-ops/dashboard/internal/data uses github.com/santifer/career-ops/dashboard/internal/model. Changing github.com/santifer/career-ops/dashboard/internal/model can break github.com/santifer/career-ops/dashboard/internal/data, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
36→5 github.com/santifer/career-ops/dashboard/internal/ui/screens depends on github.com/santifer/career-ops/dashboard/internal/model✕
Type pairs
16 distinct (type in github.com/santifer/career-ops/dashboard/internal/ui/screens → type in github.com/santifer/career-ops/dashboard/internal/model) references.
github.com/santifer/career-ops/dashboard/internal/ui/screens uses github.com/santifer/career-ops/dashboard/internal/model. Changing github.com/santifer/career-ops/dashboard/internal/model can break github.com/santifer/career-ops/dashboard/internal/ui/screens, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
36→6 github.com/santifer/career-ops/dashboard/internal/ui/screens depends on github.com/santifer/career-ops/dashboard/internal/theme✕
Type pairs
5 distinct (type in github.com/santifer/career-ops/dashboard/internal/ui/screens → type in github.com/santifer/career-ops/dashboard/internal/theme) references.
github.com/santifer/career-ops/dashboard/internal/ui/screens uses github.com/santifer/career-ops/dashboard/internal/theme. Changing github.com/santifer/career-ops/dashboard/internal/theme can break github.com/santifer/career-ops/dashboard/internal/ui/screens, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
37→27 web.src.app.actions depends on web.src.app.actions.registry✕
Type pairs
1 distinct (type in web.src.app.actions → type in web.src.app.actions.registry) reference.
github.com/santifer/career-ops/dashboard uses github.com/santifer/career-ops/dashboard/internal/model. Changing github.com/santifer/career-ops/dashboard/internal/model can break github.com/santifer/career-ops/dashboard, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→6 github.com/santifer/career-ops/dashboard depends on github.com/santifer/career-ops/dashboard/internal/theme✕
Type pairs
1 distinct (type in github.com/santifer/career-ops/dashboard → type in github.com/santifer/career-ops/dashboard/internal/theme) reference.
github.com/santifer/career-ops/dashboard uses github.com/santifer/career-ops/dashboard/internal/theme. Changing github.com/santifer/career-ops/dashboard/internal/theme can break github.com/santifer/career-ops/dashboard, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
40→36 github.com/santifer/career-ops/dashboard depends on github.com/santifer/career-ops/dashboard/internal/ui/screens✕
Type pairs
6 distinct (type in github.com/santifer/career-ops/dashboard → type in github.com/santifer/career-ops/dashboard/internal/ui/screens) references.
github.com/santifer/career-ops/dashboard uses github.com/santifer/career-ops/dashboard/internal/ui/screens. Changing github.com/santifer/career-ops/dashboard/internal/ui/screens can break github.com/santifer/career-ops/dashboard, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
At a glance — Code Health · 37% · Weak · gated by D1, D2, D3, R1, R2, R3 ·
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
A03:2021 — Injection
103
High / Critical
A06:2021 — Vulnerable & Outdated Components
6
High / Critical
A05:2021 — Security Misconfiguration
2
High / Critical
Roadmap
First, migrate the remaining JavaScript files to TypeScript to establish type safety, and simultaneously remove dead code and unused exports to reduce maintenance overhead. Next, break down branch-heavy functions to lower complexity and split oversized files into smaller, focused modules to improve readability. Finally, address code duplication by extracting shared logic into common functions or types where appropriate, ensuring each remediation matches the specific pattern of the repeated code.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Migrate the remaining .js/.jsx files to TypeScript.
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.
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 — 72
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 — 1323
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 — 88
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 34
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. 59 of 63 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 4 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — 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 — 63 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, 1467 of 1483 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.
D8 Code Coverage — 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. Coverage NOT MEASURED: test source is present (.go, .mjs) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (`go test -coverprofile=coverage.out ./...`, or lcov — `vitest --coverage`, `jest --coverage`, `bun test --coverage --coverage-reporter=lcov`, or `nyc`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (`go test -coverprofile=coverage.out ./...`, or lcov — `vitest --coverage`, `jest --coverage`, `bun test --coverage --coverage-reporter=lcov`, or `nyc`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
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 1,515 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 24 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.
D11 Test Reliability — 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. Test source is present (.go, .mjs) but the built-in reliability runner does not support this repository's ecosystem, so flakiness couldn't be assessed. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
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.
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/triage.bundle.mjs`, `build-cv-html.mjs`, `check-jd-archive.mjs`, `cv-sections-core.mjs`, `REDACTED`, … (+13 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.
AX6 Interface segregation — 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 is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing 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.
C2 Access Controls — 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. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — 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. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — 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. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — 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. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
ED5 Idempotency — 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 finds retry-prone mutations by walking the repository's declared types, and NONE was loaded on this run, so it had nothing to look at. That is a limit of the analyzer's reach — it reads .NET projects — not a finding that this repository has no command handlers or message consumers.
GD1 Unfinished & placeholder code — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
IC1 Incompleteness & stubs — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
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. 75 further occurrence(s) are not listed individually; the score already reflects all 115.
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. 457 further occurrence(s) are not listed individually; the score already reflects all 497.
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. 63 further occurrence(s) are not listed individually; the score already reflects all 103.
S1 Web-Security Posture — 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. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X1 Async correctness — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X12 Unreachable branch — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X13 Undrained process stream — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X14 Bypassable address classification — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X15 Unvalidated length from an untrusted reader — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X16 Unfloored truncation loop — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X17 Uncapped recursion over a caller-supplied document — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X18 Disposal-pattern correctness — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X19 Unrestored process-global state — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X2 Cancellation propagation — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X20 Mistyped argument guard — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X21 Side-effecting pattern guard — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X22 Contradicted release guard — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X23 Unguarded diagnostic materialisation — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X26 Unsynchronised callback handoff — 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, Kotlin and Scala source only, and no C# was loaded, no Java, Kotlin or Scala 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.
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 and Rust source only, and no C# was loaded and no Java or Rust was found in this repository, 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.
X28 Index access outside its own emptiness guard — 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 Scala source only, and no C# was loaded and no Scala was found in this repository, 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 — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X30 Support guard that admits what it rejects — 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 Scala source only, and no C# was loaded and no Scala was found in this repository, 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.
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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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.
X5 Nullable reference types — 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing 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. 13 further occurrence(s) are not listed individually; the score already reflects all 53.
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.
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.
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".
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 (4): D19, D21, D26, 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.
518 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was scan.main at 191. A further 2 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.
+ 332 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 fetch (cyclomatic 32) finding(s) in Cyclomatic Complexity — start with vdab.mjs, getro.mjs. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 fetch (cyclomatic 31) finding(s) in Cyclomatic Complexity — start with arbeitsagentur.mjs, occ.mjs. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 fetch finding(s) in Cyclomatic Complexity — start with workday.mjs (2). — One of this dimension's main actionable groups (2 warning-level).
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.
+ 450 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 fetch (cognitive 62) finding(s) in Cognitive Complexity — start with workday.mjs, peoplesoft.mjs. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 fetch (cognitive 50) finding(s) in Cognitive Complexity — start with mokahr.mjs, getro.mjs. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 fetch (cognitive 46) finding(s) in Cognitive Complexity — start with ultipro.mjs, vdab.mjs. — One of this dimension's main actionable groups (2 warning-level).
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 Classes0.0 / 10Critical✓ 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 45 FunctionTooLong finding(s) in God Classes — start with route.ts (4), analyze-patterns.mjs (2), followups-view.tsx (2). — One of this dimension's main actionable groups (45 warning-level).
Resolve the 25 FileTooLong finding(s) in God Classes — start with REDACTED, REDACTED, pipeline.go. — One of this dimension's main actionable groups (25 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.
18 duplicated block group(s) detected. One further row reports members as variants of one another; it aggregates block groups already counted above and is not itself counted. 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 Members sharing a duplicated core (4 members, 50+ identical tokens) finding(s) in Code Duplication — start with pipeline.go. — 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, 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.
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.
1676 test methods: 1676 unit, 0 integration, 0 BDD, 0 e2e. The JavaScript/TypeScript suite contributes 1552 `it`/`test` case(s) across 188 test file(s) declaring at least one; its tier split is read from package names and paths only. The Go suite contributes 124 test case(s) across 24 `_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 2 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.
5 skipped (5 with a documented reason), 2 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 1515 tests. Measured on the JavaScript/TypeScript suite only — at least 24 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) · ×2tests/pipeline-lock.test.mjs:195
Skipped (documented): the web agrees with the CLI about the sheet · ×5tests/page-format.test.mjs:124
What to do
Resolve the 2 No assertions finding(s) in Test Quality — start with pipeline-lock.test.mjs, tracker-lock.test.mjs. — One of this dimension's main actionable groups (2 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.
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.
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 (200×80=16000); REDACTED (76×191=14516); test-all.mjs (324×17=5508) Repeated repair below the complexity floor: verify-pipeline.mjs (13 of 20 changes were fixes); set-status.mjs (12 of 19 changes were fixes); tests/helpers.mjs (10 of 16 changes were fixes)
Resolve the 104 Hotspot finding(s) in Churn × Complexity Hotspots — start with route.ts (10), REDACTED, REDACTED. — One of this dimension's main actionable groups (104 warning-level).
Resolve the 42 Repeated repair finding(s) in Churn × Complexity Hotspots — start with verify-pipeline.mjs, set-status.mjs, helpers.mjs. — One of this dimension's main actionable groups (42 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 Factor8.7 / 10Strong✓ 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.
60 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is verify-ats.mjs. Counted over 423 of the 532 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 · ×4
Further sole-owners (lower concentration)
What to do
Resolve the 4 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (4 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
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 26095 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 root README (career-ops) and its twelve sibling directories all deliver clear, well-structured documentation for the AI job search pipeline: a multi-tiered structure covering overview, internationalization, batch processing, a dashboard TUI, profile intake sources, a golden-set eval for cheap-model routing, examples, modes, plugins, providers, and a scaffolder one-command installer. The root README is judged against its own directory (the scaffolder README) as an internal document; the quality is high with no visible defects. A comprehensive documentation set covering READMEs (47), architecture/design docs (25), and per-directory READMEs for seeds/, templates/, tests/, web/, writing-samples/, sponsors/, and examples/latex-tex/. Each document is well-structured with a clear title, an overview section (for the directory it documents), usage examples, installation/shell commands, and a detailed outline; no clipped content. The root README is judged against its own scope. Each modes/es/ and modes/de/ README is a directory README documenting its own files for the DACH or LATAM job-market translation tier. The four language branches (de, es, fr, hi) are identical in content: an overview of when to use `modes/[lang]/`, two activation paths (session-specific and profile-permanent), a translated-mode list with purpose columns, and a glossary plus contribution guidance. All four directories share the same outline — each is a directory README, not the repository — so any one document's absence of an overview/installation/usage/contributing section would apply to all four.
Documentation: no project overview · ×2README.md
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.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.
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).
110 finding(s): 0 critical, 42 high, 68 medium, 0 low. 41 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 23 file(s) — `.github/scripts/triage.bundle.mjs` (lines 42–43, lines 456–457), `batch/batch-runner.sh` (line 750, line 758), `build-cv-html.mjs` (line 211, lines 218–219), `check-jd-archive.mjs` (line 273), `cv-sections-core.mjs` (line 200), … (+18 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
What to do
Resolve the 42 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (5), REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (42 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 41 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 (41 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 Critical vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 High vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 3 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 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 423 of the 532 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 1 Change coupling finding(s) in Change Coupling — start with _types.js. — One of this dimension's main actionable groups (1 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:40, web/src/components/apply-view.tsx:567, web/src/components/apply-view.tsx:592, …
This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. (×4) — web/src/components/apply-view.tsx:569, web/src/components/cv/cv-ingest.tsx:290, web/src/components/explore/filter-builder.tsx:228, …
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. (×6) — web/src/components/config-form.tsx:111, web/src/components/config-form.tsx:238, web/src/components/config-form.tsx:260, …
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:6, templates/cover-letter-template.html:2, REDACTED:6, …
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".
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.
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 97 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.
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 significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree, with each file named `NNNN-title` in whatever markup those docs already use, is the most discoverable form).
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.
No logging call was found in the 533 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.
Deployment is orchestrated by compose, but no service declares a `healthcheck:` and nothing pins a previous image to fall back to — the runtime can tell that the container is up, not that it is serving, so a bad release is harder to detect and reverse.
What to do
Add a `healthcheck:` to the served compose service — probing the endpoint it already answers on where it has one — with `depends_on: condition: service_healthy` on whatever waits for it, and keep the deployed image tag immutable and recorded so rolling back is re-pointing at the previous tag rather than rebuilding.
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 8 use(s) across 8,453 production line(s) (~0.9/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) or inside a Java method returning a Reactor Mono/Flux — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
`main` is async and calls readFileSync, existsSync, writeFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — add-entry.mjs:219
`acquirePipelineLock` is async and calls existsSync, mkdirSync, writeFileSync, statSync, rmSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — pipeline-lock.mjs:370
`add` is async and calls appendFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — agent-inbox.mjs:141
`resolve` is async and calls readFileSync, writeFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — agent-inbox.mjs:208
`main` is async and calls readFileSync, writeFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — application-answers.mjs:511
`extractPipelineEntries` is async and calls existsSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — archive-posting.mjs:260
`archiveUrl` is async and calls mkdirSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — archive-posting.mjs:319
`loadProviders` is async and calls existsSync, readdirSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — providers/_registry.mjs:24
`main` is async and calls readFileSync, existsSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — audit-portals.mjs:377
`processOffer` is async and calls mkdirSync, writeFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:250
`main` is async and calls existsSync, readFileSync, writeFileSync, execFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:367
`writeAndReport` is async and calls existsSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — build-cv-html.mjs:745
`main` is async and calls existsSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — build-cv-html.mjs:773, extract-latex-content.mjs:21
`runSelfTest` is async and calls existsSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — build-cv-html.mjs:853
`main` is async and calls existsSync, mkdirSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — build-cv-latex.mjs:146
`runSelfTest` is async and calls existsSync, mkdirSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — build-cv-latex.mjs:288
`acquireTrackerLock` is async and calls mkdirSync, writeFileSync, rmSync, statSync, existsSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — tracker-utils.mjs:393
`openTrackerTransaction` is async and calls readFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — tracker-utils.mjs:585
`doImport` is async and calls existsSync, readFileSync, mkdirSync, writeFileSync, renameSync, rmSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — career-profile.mjs:214
`runSelfTest` is async and calls mkdtempSync, writeFileSync, rmSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — company-history.mjs:1038
`main` is async and calls existsSync, readFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — paste-reply.mjs:202, contact-extract.mjs:253
`appendContact` is async and calls existsSync, readFileSync, mkdirSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — contact-extract.mjs:151
`main` is async and calls existsSync, readFileSync, writeFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×3) — discover-ats.mjs:1060, REDACTED:3268, fix-slugs.mjs:350
`loadPluginConfig` is async and calls existsSync, readFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — plugins/_engine.mjs:110
`mergeProviderPlugins` is async and calls existsSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — plugins/_engine.mjs:705
`verifyPortalsFile` is async and calls existsSync, readFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:702
`acquirePortalHealthLock` is async and calls mkdirSync, writeFileSync, statSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — portal-health-lock.mjs:107
`appendToPipeline` is async and calls existsSync, readFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:2704
`appendToScanHistory` is async and calls existsSync, mkdirSync, appendFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:2748
`appendPortalHealth` is async and calls mkdirSync, existsSync, appendFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:3042
`checkPortalSlugs` is async and calls existsSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — doctor.mjs:544
`acquireFollowupsLock` is async and calls mkdirSync, writeFileSync, statSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — followup-seed.mjs:316
`seedFollowup` is async and calls existsSync, readFileSync, mkdirSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — followup-seed.mjs:543
`seedBackfill` is async and calls existsSync, readFileSync, mkdirSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — followup-seed.mjs:616
`reserveReportNumbers` is async and calls mkdirSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — reserve-report-num.mjs:201
`releaseReportNumbers` is async and calls existsSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — reserve-report-num.mjs:260
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.4 / 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.
151 typed · 911 plain JS — the untyped files are add-entry.mjs, agent-inbox-tests.mjs, analyze-patterns.mjs, application-answers.mjs, application-artifacts.mjs, archive-posting.mjs (+905 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.
16 duplicated blocks under web/src/app/api/ have copies in at least two of the sibling directories apply, assistant, cover-pdf, cv, cv-pdf, doctor (+9 more sibling(s) not listed) — 14 of them are reported below, and 2 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 16 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 16 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 16 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:93
7 duplicated blocks under web/src/components/ have copies in at least two of the sibling directories apply, beta, cv, explore, followups, home (+2 more sibling(s) not listed) — 3 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 7 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 7 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 7 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/apply/apply-provider.tsx:360
6 duplicated blocks under web/src/ have copies in at least two of the sibling directories app, components, lib — 4 of them are reported below, and 2 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 6 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 6 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 6 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/tracker/delete/route.ts:73
5 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) — 4 of them are reported below, and 1 is 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 5 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 5 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 5 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/ascii-fold.mjs:54
REDACTED:41 · REDACTED:47 — the two spans are one implementation copied and then locally edited — 1732 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:41
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
REDACTED:178 · openai-tailor.mjs:129 — the two spans are one implementation copied and then locally edited — 475 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:178
providers/alibaba.mjs:69 · providers/tencent.mjs:43 — the two spans are one implementation copied and then locally edited — 508 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:93 · web/src/app/api/cv/ingest/route.ts:109 — the two spans are one implementation copied and then locally edited — 410 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:93
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:31 — 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/feishu-jobs.mjs:86 · providers/mokahr.mjs:173 — the two spans are one implementation copied and then locally edited — 345 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/feishu-jobs.mjs:86
build-cv-html.mjs:1185 · 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:1185
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/pinpoint.mjs:22 · providers/recruitee.mjs: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. — providers/pinpoint.mjs:22
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:777 · upskill.mjs:672 — 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:777
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
providers/hecklerkoch.mjs:24 · providers/softgarden.mjs:27 — the two spans are one implementation copied and then locally edited — 315 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
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
REDACTED:251 · providers/rheinmetall.mjs:56 — the two spans are one implementation copied and then locally edited — 253 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:251
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: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
test-all.mjs:14653 · test-all.mjs:14710 — 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. — test-all.mjs:14653
url-key.mjs:42 · web/src/lib/core/url-key.mjs:33 — 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. — url-key.mjs:42
providers/breezy.mjs:52 · providers/prevueaps.mjs:143 — the two spans are one implementation copied and then locally edited — 216 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/breezy.mjs:52
REDACTED:42 · REDACTED:50 — 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:42
web/src/components/app-shell.tsx:36 · web/src/components/mobile-nav.tsx:149 — 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/app-shell.tsx:36
scan-dayforce.mjs:592 · scan-interamt.mjs:366 — 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. — scan-dayforce.mjs:592
providers/mycareersfuture.mjs:186 · providers/vdab.mjs:263 — 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. — providers/mycareersfuture.mjs:186
lib/ascii-fold.mjs:54 · web/src/lib/core/ascii-fold.mjs:49 — 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/ascii-fold.mjs:54
openrouter-runner.mjs:240 · openrouter-runner.mjs:299 — 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. — openrouter-runner.mjs:240
pipeline-lock.mjs:654 · portal-health-lock.mjs:222 — 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. — pipeline-lock.mjs:654
providers/meituan.mjs:98 · providers/tencent.mjs:76 — 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. — providers/meituan.mjs:98
build-cv-html.mjs:1118 · build-cv-latex.mjs:337 — 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. — build-cv-html.mjs:1118
providers/deutschebahn.mjs:91 · providers/tkms.mjs:136 — 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. — providers/deutschebahn.mjs:91
web/src/components/followups/followups-view.tsx:107 · web/src/components/pipeline-view.tsx:55 — 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. — web/src/components/followups/followups-view.tsx:107
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.
set-status-tests.mjs:36 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. — set-status-tests.mjs:36
test-all.mjs:58 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. — test-all.mjs:58
tracker-columns-tests.mjs:355 reaches into another package with a relative path (./web/src/lib/tracker-table.mjs) — import the package by name instead. — tracker-columns-tests.mjs:355
tracker-columns-tests.mjs:446 reaches into another package with a relative path (./web/src/lib/tracker-table.mjs) — import the package by name instead. — tracker-columns-tests.mjs:446
tracker-columns-tests.mjs:682 reaches into another package with a relative path (./web/src/lib/tracker-table.mjs) — import the package by name instead. — tracker-columns-tests.mjs:682
tracker-columns-tests.mjs:763 reaches into another package with a relative path (./web/src/lib/tracker-table.mjs) — import the package by name instead. — tracker-columns-tests.mjs:763
tracker-columns-tests.mjs:1163 reaches into another package with a relative path (./web/src/lib/run-prompts.mjs) — import the package by name instead. — tracker-columns-tests.mjs:1163
REDACTED:3020 reaches into another package with a relative path (./scaffolder/bin/skill-entrypoints.mjs) — import the package by name instead. — REDACTED:3020
REDACTED:3691 reaches into another package with a relative path (./scaffolder/bin/skill-entrypoints.mjs) — import the package by name instead. — REDACTED:3691
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 (2 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 134 and cognitive complexity 176; 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:3268
runSelfTest has cyclomatic complexity 111 and cognitive complexity 135; 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:421
main has cyclomatic complexity 90 and cognitive complexity 132; 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:903
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:853
apply has cyclomatic complexity 78 and cognitive complexity 127; 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:3276
runSelfTest has cyclomatic complexity 61 and cognitive complexity 76; 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. — upskill.mjs:552
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:954
validateManifest has cyclomatic complexity 49 and cognitive complexity 54; 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:152
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
driveSession has cyclomatic complexity 46 and cognitive complexity 82; 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. — web/src/lib/apply/drive.ts:131
runSelfTest has cyclomatic complexity 45 and cognitive complexity 50; 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-latex.mjs:288
(anonymous) has cyclomatic complexity 43 and cognitive complexity 82; 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. — web/src/components/explore/explore-provider.tsx:157
fold has cyclomatic complexity 43 and cognitive complexity 54; 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:228
fetch has cyclomatic complexity 42 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. — REDACTED:310
generatePDF has cyclomatic complexity 42 and cognitive complexity 51; 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. — generate-pdf.mjs:1367
normalizeProfile has cyclomatic complexity 42 and cognitive complexity 32; 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. — scripts/export-ats-text.mjs:164
codeMask has cyclomatic complexity 41 and cognitive complexity 95; 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. — tests/local-today-gates.test.mjs:381
locallyModifiedSystemFiles has cyclomatic complexity 41 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. — REDACTED:1861
parseCvMarkdown has cyclomatic complexity 41 and cognitive complexity 85; 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. — scripts/export-ats-text.mjs:32
fetch has cyclomatic complexity 39 and cognitive complexity 62; 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. — providers/peoplesoft.mjs:776
What to do
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
Do you agree with this assessment?
R3 · Large Files3.1 / 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.
87 file(s) over 400 lines (counted as significant lines — blank lines excluded — over production source only, tests excluded), largest first: REDACTED (3924), REDACTED (3802), generate-pdf.mjs (1985), merge-tracker.mjs (1854), company-history.mjs (1655), analyze-patterns.mjs (1619) (+81 more).
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 Coverage5.3 / 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/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
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
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. (×38) — tracker-columns-tests.mjs, set-status-tests.mjs, build-cv-html.mjs, …
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/profile-input-validation.test.mjs and 1 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/profile-input-validation.test.mjs
Do you agree with this assessment?
R7 · Dead Code6.6 / 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 222 application, 125 tooling and 570 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 (222 application, 125 tooling, 570 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) — providers/peoplesoft.mjs, REDACTED, providers/ultipro.mjs, …
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.
Break each cycle by extracting the shared piece into a module both sides can import.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
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.
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. 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.
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.
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 — 3 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 evidenced — 4 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 60 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
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface 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) — case \"$arch\" in amd64) go_arch=amd64 ;; arm64) go_arch=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; 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.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D11 Test Reliability — Test reliability not included — no .mjs test runner
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. 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 — symbol resolution incomplete — navigability not assessed
D32 Data Compliance (PII/GDPR) — 18 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
D8 Code Coverage — Coverage not included — suite not readable by the collector
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 — This check finds retry-prone mutations (command handlers and message/event consumers) by walking the repository's declared types, and none was loaded here, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C# syntax, and none was loaded for this repository. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — 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
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 — no coverage report found on disk — produce a coverage report in a standard format (lcov — `vitest --coverage`, `jest --coverage`, `bun test --coverage --coverage-reporter=lcov`, or `nyc`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for tinybench, mitata, benchmark.js, benny or vitest `bench(...)` calls in files that import them (or `*.bench.*` files), or one of those in a package.json, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X1 Async correctness — 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
X12 Unreachable branch — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X13 Undrained process stream — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X14 Bypassable address classification — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X15 Unvalidated length from an untrusted reader — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X16 Unfloored truncation loop — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X17 Uncapped recursion over a caller-supplied document — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X18 Disposal-pattern correctness — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X19 Unrestored process-global state — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X2 Cancellation propagation — 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
X20 Mistyped argument guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X21 Side-effecting pattern guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X22 Contradicted release guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X23 Unguarded diagnostic materialisation — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X26 Unsynchronised callback handoff — 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
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
X28 Index access outside its own emptiness guard — 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
X3 Exception handling — 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
X30 Support guard that admits what it rejects — 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
X5 Nullable reference types — 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 · ×10
<input> without a programmatic label web/src/components/apply-view.tsx:40— 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/apply-view.tsx:592— 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/filter-builder.tsx:228— 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/explore/results-list.tsx:50— 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:204— 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:133— 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.
AC2 · Forms & labels· <textarea> without a programmatic label · ×7
<textarea> without a programmatic label web/src/components/apply-view.tsx:567— 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/assistant-console.tsx:618— 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/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:76— 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:198— 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:290— 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· <label> that labels no control · ×6
<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:88— 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/status-select.tsx:42— 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· <select> without a programmatic label · ×2
<select> without a programmatic label web/src/components/apply-view.tsx:569— 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/status-select.tsx:43— This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
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:3276— REDACTED changed 200 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in update-system.apply at line 3276. 70 of those changes were fix/bug commits, and the other 130 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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:3268— REDACTED changed 76 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 191 in scan.main at line 3268. 40 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: test-all.mjs test-all.mjs:182— test-all.mjs changed 324 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in test-all.runDiscovered at line 182. 145 of those changes were fix/bug commits, and the other 179 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +00:00' --full-history --no-merges -- test-all.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:903— scan-ats-full.mjs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 140 in scan-ats-full.main at line 903. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: analyze-patterns.mjs analyze-patterns.mjs:421— analyze-patterns.mjs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 107 in analyze-patterns.runSelfTest at line 421. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: build-cv-html.mjs build-cv-html.mjs:853— build-cv-html.mjs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in build-cv-html.runSelfTest at line 853. 11 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: web/src/app/api/run/route.ts web/src/app/api/run/route.ts:28— web/src/app/api/run/route.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in route.POST at line 28. 17 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: generate-pdf.mjs generate-pdf.mjs:1367— generate-pdf.mjs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in generate-pdf.generatePDF at line 1367. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +00:00' --full-history --no-merges -- generate-pdf.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: followup-cadence.mjs followup-cadence.mjs:663— followup-cadence.mjs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in followup-cadence.extractContacts at line 663. 17 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: dashboard/internal/ui/screens/pipeline.go dashboard/internal/ui/screens/pipeline.go:528— dashboard/internal/ui/screens/pipeline.go changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in PipelineModel.handleKey at line 528. 8 of those changes were fix/bug commits, and the other 9 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: REDACTED REDACTED:539— REDACTED changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in data.NormalizeStatus at line 539. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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:985— merge-tracker.mjs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in merge-tracker.parseTsvContent at line 985. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: upskill.mjs upskill.mjs:552— upskill.mjs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in upskill.runSelfTest at line 552. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: verify-cv-facts.mjs verify-cv-facts.mjs:1385— verify-cv-facts.mjs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in verify-cv-facts.runCli at line 1385. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +00:00' --full-history --no-merges -- verify-cv-facts.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: tracker-utils.mjs tracker-utils.mjs:393— tracker-utils.mjs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in tracker-utils.acquireTrackerLock at line 393. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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.
Hotspot: pipeline-lock.mjs pipeline-lock.mjs:370— pipeline-lock.mjs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in pipeline-lock.acquirePipelineLock at line 370. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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.
Hotspot: web/src/components/explore/explore-provider.tsx web/src/components/explore/explore-provider.tsx:116— web/src/components/explore/explore-provider.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 110 in explore-provider.ExploreProvider at line 116. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: build-cv-latex.mjs build-cv-latex.mjs:288— build-cv-latex.mjs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in build-cv-latex.runSelfTest at line 288. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +00:00' --full-history --no-merges -- build-cv-latex.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: stats.mjs stats.mjs:341— stats.mjs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in stats.computePortalStats at line 341. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: doctor.mjs doctor.mjs:842— doctor.mjs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in doctor.onboardingState at line 842. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: validate-portals.mjs validate-portals.mjs:167— validate-portals.mjs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in validate-portals.validatePortalsConfig at line 167. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: web/src/components/assistant-console.tsx web/src/components/assistant-console.tsx:152— web/src/components/assistant-console.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in assistant-console.AssistantConsole at line 152. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: providers/workday.mjs providers/workday.mjs:279— providers/workday.mjs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in workday.chooseSplitFacet at line 279. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +00:00' --full-history --no-merges -- providers/workday.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: openrouter-runner.mjs openrouter-runner.mjs:225— openrouter-runner.mjs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in openrouter-runner.callOpenRouter at line 225. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +00:00' --full-history --no-merges -- openrouter-runner.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: providers/_http.mjs providers/_http.mjs:107— providers/_http.mjs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _http.fetchInContext at line 107. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +00:00' --full-history --no-merges -- providers/_http.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: company-history.runSelfTest company-history.mjs:1038— 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: scan-ats-full.main scan-ats-full.mjs:903— FunctionTooLong — main runs 369 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 269 over it, 3.69× 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:116— FunctionTooLong — ExploreProvider runs 366 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 266 over it, 3.66× 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:60— FunctionTooLong — ApplyProvider runs 297 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 197 over it, 2.97× 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:853— FunctionTooLong — runSelfTest runs 277 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 177 over it, 2.77× 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:421— FunctionTooLong — runSelfTest runs 270 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 170 over it, 2.70× 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:637— FunctionTooLong — runSelfTest runs 270 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 170 over it, 2.70× 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:28— FunctionTooLong — POST 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: cv-ingest.CvIngest web/src/components/cv/cv-ingest.tsx:30— FunctionTooLong — CvIngest runs 242 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 142 over it, 2.42× 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: funnel-velocity.selfTest funnel-velocity.mjs:491— FunctionTooLong — selfTest runs 235 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 135 over it, 2.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/explore/ai/route.ts:46— FunctionTooLong — POST runs 234 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 134 over it, 2.34× 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:31— FunctionTooLong — ExplorerView runs 185 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 85 over it, 1.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: pipeline-view.PipelineView web/src/components/pipeline-view.tsx:35— FunctionTooLong — PipelineView runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84× 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:418— 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: invite-match.runSelfTest REDACTED:916— FunctionTooLong — runSelfTest runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82× 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:1281— 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: data.ComputeStatsMetrics dashboard/internal/data/stats.go:180— FunctionTooLong — ComputeStatsMetrics runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70× 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:81— FunctionTooLong — FollowupsView runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70× 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: upskill.runSelfTest upskill.mjs:552— FunctionTooLong — runSelfTest runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63× 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-table-freshness.runSelfTest check-table-freshness.mjs:360— FunctionTooLong — runSelfTest 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.
FunctionTooLong: detect-reposts.runSelfTest detect-reposts.mjs:516— FunctionTooLong — runSelfTest runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50× 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: aggregate-tokens.main batch/aggregate-tokens.mjs:30— FunctionTooLong — main runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45× 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: log-dialog.LogDialog web/src/components/followups/log-dialog.tsx:10— FunctionTooLong — LogDialog runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.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: mobile-nav.MobileNav web/src/components/mobile-nav.tsx:37— FunctionTooLong — MobileNav runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.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.
Repeated repair: verify-pipeline.mjs verify-pipeline.mjs:275— verify-pipeline.mjs changed 20 times in last 90 days and 13 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 275), 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(verify-pipeline): don't flag same company+role reports that carry distinct posting URLs (#4636)”; “fix: canonical states, data-root paths, pipeline parser, and link regex (#3559) (#3561)”; “fix(verify-pipeline): stop counting a SKIP row as a submission channel (#3978) (#4415)”; “fix(verifiers): resolve provider plugins like the scanner (#4026) (#4046)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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:378— set-status.mjs changed 19 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 6 (its worst body is set-status.resolveCandidates at line 378), 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): allow correcting stale notes without hand-editing (#4494)”; “fix(set-status): the canonical tracker write path cannot find a configured tracker (#3987) (#3988)”; “fix(set-status): add --help/-h and list the canonical states in usage (#4066)”; “fix(set-status): a transition into Applied seeds the follow-up from set-status itself (#3470)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: tests/helpers.mjs tests/helpers.mjs:163— tests/helpers.mjs changed 16 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 9 (its worst body is resolveAllowedExecutable at line 163), 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(tests): guard subtree-anchored walkers against nested checkouts (#3792)”; “fix(update-system): apply() cannot commit when a path it stages is ignored or never tracked”; “fix(tests): make the suite symlink-aware for externalized user layers”; “test(hermetic-env): move the regression to its own discovered file”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +00:00' --full-history --no-merges -- tests/helpers.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: tracker-columns-tests.mjs tracker-columns-tests.mjs:50— tracker-columns-tests.mjs changed 12 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 11 (its worst body is tracker-columns-tests.runScript at line 50), 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): the web tracker reader drops the Apply Link and Follow-up columns (#3603)”; “fix(tracker): carry the tracker layout through the export round-trip (#3794)”; “fix(tracker): resolve addition columns by name so score and status cannot transpose”; “fix(web): make the tracker reader agree with parseTrackerRow on row shape (#2565)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +00:00' --full-history --no-merges -- tracker-columns-tests.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: jd-skill-gap.mjs jd-skill-gap.mjs:239— jd-skill-gap.mjs changed 12 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 14 (its worst body is jd-skill-gap.scanJd 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(jd-skill-gap): recognize bolded and uncontracted requirements headings (#4285)”; “fix: improve error message for missing cv.md”; “fix(jd-skill-gap): resolve cv.md against the data root”; “fix(jd-skill-gap): recognize Traditional and Simplified Chinese requirement headings (#3631)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +00:00' --full-history --no-merges -- jd-skill-gap.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:300— REDACTED changed 14 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 13 (its worst body is gemini-eval.validateEvaluationShape at line 300), 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): 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)”; “fix(gemini-eval): write the **URL:** report header so its rows reach the URL dedup key (#3876)”; “fix(eval): parse the score in gemini-eval instead of concatenating it (#3799)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: REDACTED REDACTED:180— REDACTED 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 2 (its worst body is ollama-eval.readFile at line 180), 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): 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)”; “fix(ollama-eval): stream the response and make num_ctx configurable via OLLAMA_NUM_CTX (#3922)”; “fix(eval): persist openai/ollama evaluations as tracker additions (#3797)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: set-status-tests.mjs set-status-tests.mjs:48— set-status-tests.mjs changed 13 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 4 (its worst body is set-status-tests.runSetStatus at line 48), 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(set-status): resolve --report links from the Notes cell on customized layouts (#3075)”; “fix(set-status): rejects today's date east of UTC, logs tomorrow's west of it”; “fix(set-status): stop the --role guard from folding every non-Latin title to the same key (#2736)”; “fix(set-status): close the report-less-row blind spot and add explicit --row/--report selectors (#2347)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +00:00' --full-history --no-merges -- set-status-tests.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:218— dedup-tracker.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 6 (its worst body is dedup-tracker.roleMatch at line 218), 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(dedup-tracker): reject unrecognized flags instead of silently live-running (#2746)”; “fix(dedup): write the blind-via key prefix as an escape, not a raw NUL byte”; “fix(dedup): use the shared Unicode-aware company key instead of a local ASCII copy (#2587)”; “fix(dedup): use Unicode-aware Via key for blind-employer grouping (#2397)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: REDACTED REDACTED:235— REDACTED changed 13 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 2 (its worst body is openai-eval.readFile at line 235), 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: use model-aware MiniMax context budgets (#4650)”; “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)”; “fix(eval): persist openai/ollama evaluations as tracker additions (#3797)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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/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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: validate-system-paths-coverage.mjs validate-system-paths-coverage.mjs:112— validate-system-paths-coverage.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 6 (its worst body is validate-system-paths-coverage.covered at line 112), 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): 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)”; “fix(test): make the SYSTEM_PATHS coverage guard actually run in CI (#2240)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: web/src/lib/clis.ts web/src/lib/clis.ts:76— web/src/lib/clis.ts changed 8 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 5 (its worst body is clis.searchDirs 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): 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)”; “fix(web): enforce that no runtime grants itself blanket write permission (#2875)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: web/src/lib/run-prompts.mjs web/src/lib/run-prompts.mjs:103— web/src/lib/run-prompts.mjs changed 7 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 12 (its worst body is run-prompts.buildPrompt at line 103), 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): resolve the CV template from cv.template on dashboard runs (#4035)”; “fix(web): don't let a failed fetch become a scored report (#3826)”; “fix(tracker): resolve addition columns by name so score and status cannot transpose”; “fix(web): honour language.modes_dir and language.output on web-triggered runs (#3253)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: REDACTED REDACTED:250— REDACTED changed 7 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 batch-evaluate-gemini.processOffer at line 250), 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: handle dead postings in batch evaluation (#4381)”; “fix(eval): date reports with the local calendar day, not the UTC one (#4227)”; “fix(batch-evaluate): _profile.md and tracker-additions resolve to the code root (#4347) (#4348)”; “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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: outcome.mjs outcome.mjs:540— outcome.mjs changed 7 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 5 (its worst body is outcome.archivedCopyVerified at line 540), 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,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)”; “fix(outcome): a tracker edit forks the append-only journal, and directory order decides which half counts (#3325)”; “fix(calibrate): read all 14 outcome spellings outcome.mjs writes (#3322)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: providers/avature.mjs providers/avature.mjs:60— providers/avature.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 9 (its worst body is avature.resolveConfig at line 60), 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(avature): read article--jobs cards, titled from the h3 anchor (#4559)”; “fix(providers): avature preserves facet filters across pages, flags broken parses (#4252)”; “fix(providers): raise inter-page pacing to 250 ms on the eight providers still at 150 (#3095)”; “fix(providers): guard decodeEntities against out-of-range code points (#2150)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +00:00' --full-history --no-merges -- providers/avature.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:63— REDACTED changed 5 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 10 (its worst body is cli-fencing-probe.readCliHelp at line 63), 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: REDACTED REDACTED:139— REDACTED changed 6 times in last 90 days and 4 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 cv-templates.discover at line 139), 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): exempt a user-configured named template variant from the templates/ prune (#3700)”; “fix(paths): resolve user-layer files via the data root in batch-tailor, cv-templates and openrouter-runner (#4570)”; “fix(deps): make js-yaml imports work on both 4.x and 5.x (#2656)”; “fix(templates): allowlist the template format to prevent path traversal (#1776)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: find.mjs find.mjs:114— find.mjs changed 6 times in last 90 days and 4 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 114), 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(generate-pdf): key the PDF manifest on report number and artifact kind (#3959)”; “fix(find): print the one USAGE constant on the empty-query path too”; “fix(find): reject mistyped flags instead of searching for them”; “fix: resolve the PDF manifest from the tracker, not the install dir (#2471)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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/components/home/decision-card.tsx web/src/components/home/decision-card.tsx:15— web/src/components/home/decision-card.tsx changed 6 times in last 90 days and 4 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 decision-card.DecisionCard at line 15), 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 Via attribution for confidential employers”; “fix(web): use next/link for decision-card report link (#1931)”; “fix(web): Today primary action opens the report (#2967)”; “fix(web): contrast tokens — AA across both themes (#1627)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +00:00' --full-history --no-merges -- web/src/components/home/decision-card.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: web/src/app/analytics/page.tsx web/src/app/analytics/page.tsx:20— web/src/app/analytics/page.tsx changed 5 times in last 90 days and 4 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 page.Analytics at line 20), 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): pluralize the Analytics evaluation count (#3161)”; “fix(web): analytics tells an offer-holder they have 0 interviews (and nudges them to try harder) (#2410)”; “fix(web): propagate the Hired terminal-success state across the whole dashboard (#2250)”; “fix(web): portals copy + analytics semantics (#1628)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: providers/greenhouse.mjs providers/greenhouse.mjs:111— providers/greenhouse.mjs changed 5 times in last 90 days and 4 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 111), 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): 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)”; “fix(scan): recover Greenhouse office cities when location.name is a work model (#2104)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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: providers/icims.mjs providers/icims.mjs:223— providers/icims.mjs changed 5 times in last 90 days and 4 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 icims.pickLocation at line 223), 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(icims): stop doubling the careers- prefix on iCIMS board hosts”; “fix(icims): read every jobLocation entry when picking the location (#3728)”; “fix(providers/icims): fill a missing location from the posting's JSON-LD”; “fix(providers): raise inter-page pacing to 250 ms on the eight providers still at 150 (#3095)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +00:00' --full-history --no-merges -- providers/icims.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 5 times in last 90 days and 4 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): 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)”; “fix(providers): dead boards throw instead of reading as live-but-empty (#2379)”. 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-03..2026-10-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-03 14:16:25 +00:00' --until='2026-10-01 14:16:25 +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.
Sync-over-async blocking add-entry.mjs:219— `main` is async and calls readFileSync, existsSync, writeFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking pipeline-lock.mjs:370— `acquirePipelineLock` is async and calls existsSync, mkdirSync, writeFileSync, statSync, rmSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking agent-inbox.mjs:141— `add` is async and calls appendFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking agent-inbox.mjs:208— `resolve` is async and calls readFileSync, writeFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking application-answers.mjs:511— `main` is async and calls readFileSync, writeFileSync — 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:260— `extractPipelineEntries` is async and calls existsSync — 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:319— `archiveUrl` is async and calls mkdirSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking providers/_registry.mjs:24— `loadProviders` is async and calls existsSync, readdirSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking audit-portals.mjs:377— `main` is async and calls readFileSync, existsSync — 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:250— `processOffer` is async and calls mkdirSync, writeFileSync — 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:367— `main` is async and calls existsSync, readFileSync, writeFileSync, execFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking build-cv-html.mjs:745— `writeAndReport` is async and calls existsSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking build-cv-html.mjs:773— `main` is async and calls existsSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking build-cv-html.mjs:853— `runSelfTest` is async and calls existsSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking build-cv-latex.mjs:146— `main` is async and calls existsSync, mkdirSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking build-cv-latex.mjs:288— `runSelfTest` is async and calls existsSync, mkdirSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking tracker-utils.mjs:393— `acquireTrackerLock` is async and calls mkdirSync, writeFileSync, rmSync, statSync, existsSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking tracker-utils.mjs:585— `openTrackerTransaction` is async and calls readFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking career-profile.mjs:214— `doImport` is async and calls existsSync, readFileSync, mkdirSync, writeFileSync, renameSync, rmSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking company-history.mjs:1038— `runSelfTest` is async and calls mkdtempSync, writeFileSync, rmSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking paste-reply.mjs:202— `main` is async and calls existsSync, readFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking contact-extract.mjs:151— `appendContact` is async and calls existsSync, readFileSync, mkdirSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking contact-extract.mjs:253— `main` is async and calls existsSync, readFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking discover-ats.mjs:1060— `main` is async and calls existsSync, readFileSync, writeFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking plugins/_engine.mjs:110— `loadPluginConfig` is async and calls existsSync, readFileSync — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
+ 15 more in this group — see findings.md.
R4 · Test Coverage· No test reaches this file · ×38
No test reaches this file tracker-columns-tests.mjs— 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 set-status-tests.mjs— 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-html.mjs— 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— 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— 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/peoplesoft.mjs— 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— 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 tracker-writer-lock-tests.mjs— 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 set-status.mjs— 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— 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— 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— 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 negotiation-roi.mjs— 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— 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— 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— 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— 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 followup-seed-tests.mjs— 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/lib/apply/session.ts— 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 agent-inbox-tests.mjs— 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 plugins/h1b-sponsor/lib/api.mjs— 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— 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— 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— 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— 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.
FileTooLong: ./REDACTED REDACTED— FileTooLong — 1843 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 1343 over it, 3.69× 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 — 1832 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 1332 over it, 3.66× 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 — 1508 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: PipelineModel (57 blocks, 259-2373). The bar is 500 significant lines; this is 1008 over it, 3.02× 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: ./analyze-patterns.mjs analyze-patterns.mjs— FileTooLong — 1044 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 544 over it, 2.09× 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: ./generate-pdf.mjs generate-pdf.mjs— FileTooLong — 970 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 470 over it, 1.94× 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 — 914 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 414 over it, 1.83× 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 — 858 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 358 over it, 1.72× 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 — 814 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 314 over it, 1.63× 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 — 777 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 277 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 — 768 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 268 over it, 1.54× 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 — 701 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 201 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 — 651 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 151 over it, 1.30× 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-cv-facts.mjs verify-cv-facts.mjs— FileTooLong — 645 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 145 over it, 1.29× 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 — 573 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 73 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: components/assistant-console.tsx web/src/components/assistant-console.tsx— FileTooLong — 567 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 67 over it, 1.13× 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 — 566 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 66 over it, 1.13× 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 — 559 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 59 over it, 1.12× 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 — 558 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 58 over it, 1.12× 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: ./funnel-velocity.mjs funnel-velocity.mjs— FileTooLong — 548 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 48 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.
FileTooLong: screens/viewer.go dashboard/internal/ui/screens/viewer.go— FileTooLong — 540 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: ViewerModel (22 blocks, 33-806). The bar is 500 significant lines; this is 40 over it, 1.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 — 531 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 31 over it, 1.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: ./doctor.mjs doctor.mjs— FileTooLong — 530 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 30 over it, 1.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: ./upskill.mjs upskill.mjs— FileTooLong — 529 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 29 over it, 1.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: ./tracker.mjs tracker.mjs— FileTooLong — 523 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 23 over it, 1.05× 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: ./linkedin-join.mjs linkedin-join.mjs— FileTooLong — 512 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 12 over it, 1.02× 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.
AC3 · Page structure· Page without a main landmark · ×10
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 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:test-suite-dependency] set-status-tests.mjs:36— set-status-tests.mjs:36 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] test-all.mjs:58— test-all.mjs:58 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:relative-cross-package] tracker-columns-tests.mjs:355— tracker-columns-tests.mjs:355 reaches into another package with a relative path (./web/src/lib/tracker-table.mjs) — import the package by name instead.
Boundary violation [package:relative-cross-package] tracker-columns-tests.mjs:446— tracker-columns-tests.mjs:446 reaches into another package with a relative path (./web/src/lib/tracker-table.mjs) — import the package by name instead.
Boundary violation [package:relative-cross-package] tracker-columns-tests.mjs:682— tracker-columns-tests.mjs:682 reaches into another package with a relative path (./web/src/lib/tracker-table.mjs) — import the package by name instead.
Boundary violation [package:relative-cross-package] tracker-columns-tests.mjs:763— tracker-columns-tests.mjs:763 reaches into another package with a relative path (./web/src/lib/tracker-table.mjs) — import the package by name instead.
Boundary violation [package:relative-cross-package] tracker-columns-tests.mjs:1163— tracker-columns-tests.mjs:1163 reaches into another package with a relative path (./web/src/lib/run-prompts.mjs) — import the package by name instead.
Boundary violation [package:relative-cross-package] REDACTED:3020— REDACTED:3020 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:3691— REDACTED:3691 reaches into another package with a relative path (./scaffolder/bin/skill-entrypoints.mjs) — import the package by name instead.
Duplicated block (25 lines × 2 locations) lib/ascii-fold.mjs:54— lib/ascii-fold.mjs:54 · web/src/lib/core/ascii-fold.mjs:49 — 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.
Duplicated block (25 lines × 2 locations) openrouter-runner.mjs:240— openrouter-runner.mjs:240 · openrouter-runner.mjs:299 — 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 (25 lines × 2 locations) pipeline-lock.mjs:654— pipeline-lock.mjs:654 · portal-health-lock.mjs:222 — 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.
Duplicated block (25 lines × 2 locations) providers/meituan.mjs:98— providers/meituan.mjs:98 · providers/tencent.mjs:76 — 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.
fetch (cyclomatic 32) providers/vdab.mjs:191— fetch has cyclomatic complexity 32 (threshold 15). Of this number, 20 points are the body's own statements and 12 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.
fetch (cyclomatic 32) providers/getro.mjs:201— 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.
fetch (cyclomatic 31) providers/arbeitsagentur.mjs:157— fetch has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body's own statements and 4 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.
fetch (cyclomatic 31) providers/occ.mjs:170— fetch 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.
fetch::runQuery (cyclomatic 26) providers/workday.mjs:769— 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:899— 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.
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.
fetch (cyclomatic 22) REDACTED:234— 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.
main::processJobs (cyclomatic 19) scan-ats-full.mjs:1127— 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.
main::resolveEntries (cyclomatic 16) REDACTED:3418— 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.
route.POST (cyclomatic 16) web/src/app/api/followups/log/route.ts:30— 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 73). 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) web/src/app/api/tracker/delete/route.ts:26— 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.
fetch (cyclomatic 16) providers/gem.mjs:188— fetch has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body's own statements and 4 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.
fetch (cyclomatic 16) providers/oraclecloud.mjs:226— fetch 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.
No assertions: acquirePipelineLock: an ownerless lock older than the grace floor is still reclaimable (#2304) tests/pipeline-lock.test.mjs:195— 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.
fetch (cognitive 62) providers/workday.mjs:711— fetch has cognitive complexity 62 (threshold 15). Drivers by points: if/else 37 (77 pts), ternaries 19 (43 pts), boolean chains 15, loops 5 (11 pts), error handling 4 (10 pts), other 2 (nesting depth added 76). To reduce it, split the body into named stages: move each independent 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) providers/peoplesoft.mjs: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.
fetch (cognitive 50) providers/mokahr.mjs:233— fetch has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (26 pts), ternaries 5 (9 pts), error handling 2 (6 pts), loops 3 (6 pts), boolean chains 3 (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.
fetch (cognitive 50) providers/getro.mjs:201— fetch has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (21 pts), ternaries 7 (13 pts), boolean chains 11, loops 2 (3 pts), error handling 1 (2 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.
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.
fetch (cognitive 46) providers/vdab.mjs:191— fetch has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 10, error handling 4 (8 pts), loops 4 (6 pts), ternaries 2 (3 pts) (nesting depth added 16). Of this number, 25 points are the body's own statements and 21 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.
fetch::runQuery (cognitive 42) providers/workday.mjs:769— 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:899— 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.
main::processJobs (cognitive 31) scan-ats-full.mjs:1127— 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.
main::resolveEntries (cognitive 22) REDACTED:3418— 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.
fetch (cognitive 22) providers/gem.mjs:188— fetch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 1 (3 pts), error handling 1 (2 pts), ternaries 1 (nesting depth added 7). Of this number, 18 points are the body's own statements and 4 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.
fetch (cognitive 22) providers/oraclecloud.mjs:226— fetch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 3 (5 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.
route.POST (cognitive 20) web/src/app/api/apply/prefill/route.ts:19— route.POST has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (7 pts), if/else 6, error handling 5, boolean chains 2 (nesting depth added 2). Of this number, 17 points are the body's own statements and 3 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.
route.POST (cognitive 20) web/src/app/api/followups/cadence/route.ts:94— route.POST has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 4 (6 pts), ternaries 2 (3 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.
url-key.normalizeUrl (cognitive 19) url-key.mjs:79— 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:67— 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.
fetch (cognitive 19) providers/careerviet.mjs:291— fetch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2, 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.
fetch (cognitive 19) providers/itviec.mjs:260— fetch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2, 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.
route.POST (cognitive 17) web/src/app/api/apply/drive/route.ts:12— route.POST has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 4 (5 pts), error handling 4, boolean chains 1 (nesting depth added 3). 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.
route.POST (cognitive 17) web/src/app/api/tracker/delete/route.ts:26— route.POST has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, ternaries 2 (4 pts), error handling 3, boolean chains 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 — 134 stored fields beside 5 methods. The bar is 30 stored fields; this is 104 over it, 4.47× 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:270— TooManyFields — 34 stored fields beside 58 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.
MethodTooLong: PipelineModel.handleKey dashboard/internal/ui/screens/pipeline.go:528— MethodTooLong — handleKey runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 54 over it, 1.54× 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:84— MethodTooLong — Update runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.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.
Duplicated block (16 lines × 2) dashboard/internal/ui/screens/pipeline.go:810— dashboard/internal/ui/screens/pipeline.go:810-825 | dashboard/internal/ui/screens/viewer.go:740-755 — 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:739` calls `clampScrollOffset` and `dashboard/internal/ui/screens/pipeline.go:809` 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:255-270 — 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:197— dashboard/internal/data/pdf.go:197-205 | dashboard/internal/data/pdf.go:277-285 — 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:392— dashboard/internal/ui/screens/progress.go:392-400 | dashboard/internal/ui/screens/stats.go:667-675 — 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:392` 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.
Duplicated block (34 lines × 2 locations) test-all.mjs:14653— test-all.mjs:14653 · test-all.mjs:14710 — 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 (34 lines × 2 locations) url-key.mjs:42— url-key.mjs:42 · web/src/lib/core/url-key.mjs:33 — 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.
Duplicated block (23 lines × 2 locations) providers/deutschebahn.mjs:91— providers/deutschebahn.mjs:91 · providers/tkms.mjs:136 — 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 (23 lines × 2 locations) web/src/components/followups/followups-view.tsx:107— web/src/components/followups/followups-view.tsx:107 · web/src/components/pipeline-view.tsx:55 — 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.
R4 · Test Coverage· This test file cannot be loaded · ×2
This test file cannot be loaded web/tests/lib/profile-input-validation.test.mjs— 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— 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.
Dead file (~322 LoC) providers/gem.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (~269 LoC) providers/avature.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 (~269 LoC) providers/csod.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 (~197 LoC) providers/agentic-jobs.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 (~197 LoC) providers/getonbrd.mjs— no import path from any entry point (222 application, 125 tooling, 570 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
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 97 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.
scan.main (cyclomatic 191) REDACTED:3268— scan.main has cyclomatic complexity 191 (threshold 15). Of this number, 146 points are the body's own statements and 45 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.
scan-ats-full.main (cyclomatic 140) scan-ats-full.mjs:903— scan-ats-full.main has cyclomatic complexity 140 (threshold 15). Of this number, 92 points are the body's own statements and 48 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.
runSelfTest (cyclomatic 111) analyze-patterns.mjs:421— runSelfTest has cyclomatic complexity 111 (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 110) web/src/components/explore/explore-provider.tsx:116— explore-provider.ExploreProvider has cyclomatic complexity 110 (threshold 15). Most of this is not in the body itself: 1 of the 110 points is its own statement and the rest belongs to 15 function literals inside it that branch (lines 157, 419, 538, …). 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-console.AssistantConsole (cyclomatic 100) web/src/components/assistant-console.tsx:152— assistant-console.AssistantConsole has cyclomatic complexity 100 (threshold 15). Of this number, 55 points are the body's own statements and 45 belong to 16 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.
apply-provider.ApplyProvider (cyclomatic 90) web/src/components/apply/apply-provider.tsx:60— apply-provider.ApplyProvider has cyclomatic complexity 90 (threshold 15). Most of this is not in the body itself: 1 of the 90 points is its own statement and the rest belongs to 13 function literals inside it that branch (lines 213, 98, 348, …). 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 85) web/src/app/api/run/route.ts:28— route.POST has cyclomatic complexity 85 (threshold 15). Of this number, 31 points are the body's own statements and 54 belong to 15 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.
runSelfTest (cyclomatic 83) build-cv-html.mjs:853— runSelfTest has cyclomatic complexity 83 (threshold 15). Of this number, 80 points are the body's own statements and 3 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.
update-system.apply (cyclomatic 80) REDACTED:3276— update-system.apply has cyclomatic complexity 80 (threshold 15). Of this number, 78 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.
inbox-triage.InboxTriage (cyclomatic 77) web/src/components/inbox/inbox-triage.tsx:25— inbox-triage.InboxTriage has cyclomatic complexity 77 (threshold 15). Of this number, 20 points are the body's own statements and 57 belong to 23 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.
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 8 function literals inside it that branch (lines 23, 29, 24, …). 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 64) web/src/app/api/explore/ai/route.ts:46— route.POST has cyclomatic complexity 64 (threshold 15). Of this number, 21 points are the body's own statements and 43 belong to 11 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.
data.NormalizeStatus (cyclomatic 63) REDACTED:539— data.NormalizeStatus has cyclomatic complexity 63 (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.
upskill.runSelfTest (cyclomatic 61) upskill.mjs:552— upskill.runSelfTest has cyclomatic complexity 61 (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.
PipelineModel.handleKey (cyclomatic 58) dashboard/internal/ui/screens/pipeline.go:528— 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:274— 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.
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.
salary-gap.selfTest (cyclomatic 52) REDACTED:410— salary-gap.selfTest has cyclomatic complexity 52 (threshold 15). Of this number, 32 points are the body's own statements and 20 belong to 8 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.
explorer-view.ExplorerView (cyclomatic 52) web/src/components/explore/explorer-view.tsx:31— explorer-view.ExplorerView has cyclomatic complexity 52 (threshold 15). Of this number, 39 points are the body's own statements and 13 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.
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:214— 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:954— 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.
analyze-patterns.analyze (cyclomatic 49) analyze-patterns.mjs:1281— analyze-patterns.analyze has cyclomatic complexity 49 (threshold 15). Of this number, 33 points are the body's own statements and 16 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.
_engine.validateManifest (cyclomatic 49) plugins/_engine.mjs:152— _engine.validateManifest has cyclomatic complexity 49 (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.
acquirePipelineLock (cyclomatic 49) pipeline-lock.mjs:370— acquirePipelineLock has cyclomatic complexity 49 (threshold 15). Of this number, 35 points are the body's own statements and 14 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.locallyModifiedSystemFiles (cyclomatic 48) REDACTED:1861— update-system.locallyModifiedSystemFiles has cyclomatic complexity 48 (threshold 15). Of this number, 41 points are the body's own statements and 7 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.
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.
cv-ingest.CvIngest (cyclomatic 47) web/src/components/cv/cv-ingest.tsx:30— 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 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 47) web/src/components/followups/followups-view.tsx:81— followups-view.FollowupsView has cyclomatic complexity 47 (threshold 15). Of this number, 18 points are the body's own statements and 29 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.
fold (cyclomatic 47) REDACTED:228— fold has cyclomatic complexity 47 (threshold 15). Of this number, 43 points are the body's own statements and 4 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.
checkUrlLiveness (cyclomatic 47) liveness-browser.mjs:242— checkUrlLiveness has cyclomatic complexity 47 (threshold 15). Of this number, 25 points are the body's own statements and 22 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.
validate-portals.validatePortalsConfig (cyclomatic 46) validate-portals.mjs:167— validate-portals.validatePortalsConfig has cyclomatic complexity 46 (threshold 15). Of this number, 28 points are the body's own statements and 18 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.
parseCompensation (cyclomatic 45) providers/ashby.mjs:55— 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.
computePortalRecommendations (cyclomatic 44) stats.mjs:424— 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:310— 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.
update-system.configuredTemplateVariantsFromProfileSource (cyclomatic 43) REDACTED:1331— update-system.configuredTemplateVariantsFromProfileSource has cyclomatic complexity 43 (threshold 15). Of this number, 18 points are the body's own statements and 25 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.
generate-pdf.generatePDF (cyclomatic 42) generate-pdf.mjs:1367— generate-pdf.generatePDF has cyclomatic complexity 42 (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.
export-ats-text.normalizeProfile (cyclomatic 42) scripts/export-ats-text.mjs:164— 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.
route.POST (cyclomatic 42) web/src/app/api/cv/ingest/route.ts:68— route.POST has cyclomatic complexity 42 (threshold 15). Of this number, 23 points are the body's own statements and 19 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.
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.
export-ats-text.parseCvMarkdown (cyclomatic 41) scripts/export-ats-text.mjs:32— 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.
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.
followup-cadence.extractContacts (cyclomatic 40) followup-cadence.mjs:663— followup-cadence.extractContacts has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 11 of the 40 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 669, 735). 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-view.ApplyView (cyclomatic 39) web/src/components/apply-view.tsx:32— 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.
fetch (cyclomatic 39) providers/peoplesoft.mjs: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.matchCandidates (cyclomatic 38) reply-matcher.mjs:391— reply-matcher.matchCandidates 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.
reply-matcher.classifyReply (cyclomatic 38) reply-matcher.mjs:511— 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 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.
discover-ats.resolveCompany (cyclomatic 38) discover-ats.mjs:620— 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 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.
job-store.JobsProvider (cyclomatic 38) web/src/components/jobs/job-store.tsx:59— job-store.JobsProvider has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 1 of the 38 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 114, 142, 65, …). 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.
audit-portals.main (cyclomatic 37) audit-portals.mjs:377— 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:253— 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.
update-system.checkMainChannel (cyclomatic 36) REDACTED:2929— update-system.checkMainChannel has cyclomatic complexity 36 (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.
drive.driveSession (cyclomatic 36) web/src/lib/apply/drive.ts:131— drive.driveSession has cyclomatic complexity 36 (threshold 15). Of this number, 33 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.
scan.runScanner (cyclomatic 36) web/src/lib/core/scan.ts:186— scan.runScanner has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 1 of the 36 points is its own statement and the rest belongs to 10 function literals inside it that branch (lines 283, 363, 196, …). 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.
appModel.Update (cyclomatic 36) dashboard/main.go:84— appModel.Update has cyclomatic complexity 36 (threshold 15). Of this number, 35 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.
company-history.buildCompanyCards (cyclomatic 35) company-history.mjs:515— 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.
reply-watch.main (cyclomatic 35) reply-watch.mjs:222— reply-watch.main has cyclomatic complexity 35 (threshold 15). Of this number, 16 points are the body's own statements and 19 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.
scan-dayforce.main (cyclomatic 35) scan-dayforce.mjs:503— scan-dayforce.main 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.
route.POST (cyclomatic 35) web/src/app/api/assistant/route.ts:55— route.POST has cyclomatic complexity 35 (threshold 15). Of this number, 16 points are the body's own statements and 19 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.
fetch (cyclomatic 35) providers/workday.mjs:711— fetch 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.
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.
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, cachedLookup::resolve::(anonymous), guarded::(anonymous), …). 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.
pipeline-view.PipelineView (cyclomatic 33) web/src/components/pipeline-view.tsx:35— pipeline-view.PipelineView has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 11 of the 33 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 95, 70, 84, …). 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 33) providers/telegram-channel.mjs: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.
tracker-utils.acquireTrackerLock (cyclomatic 32) tracker-utils.mjs:393— tracker-utils.acquireTrackerLock 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.
discover-ats.parseCompanyInput (cyclomatic 32) discover-ats.mjs:181— discover-ats.parseCompanyInput has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 14 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 186). 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.
verify-ats.auditAts (cyclomatic 32) verify-ats.mjs:400— 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.
session.fillSession (cyclomatic 32) web/src/lib/apply/session.ts:395— session.fillSession has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body's own statements and 4 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.
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 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.
data.deriveNoteFields (cyclomatic 32) dashboard/internal/data/derive.go:156— data.deriveNoteFields 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.
printSummary (cyclomatic 32) analyze-patterns.mjs:1585— printSummary 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:669— 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.
parseCv (cyclomatic 32) career-profile.mjs:60— 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 ((anonymous), addFact, (anonymous), …). 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.
career-profile.validateProfile (cyclomatic 31) career-profile.mjs:150— career-profile.validateProfile has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 12 of the 31 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 155, 172). 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 (cyclomatic 31) generate-pdf.mjs:1633— runBatchFromManifest has cyclomatic complexity 31 (threshold 15). Of this number, 30 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.
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 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.
session.openSession (cyclomatic 30) web/src/lib/apply/session.ts:179— session.openSession has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body's own statements and 3 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.
buildSalaryFilter (cyclomatic 30) REDACTED:949— 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 969, 950, 959, …). 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.
parseMarkdownRows (cyclomatic 30) tracker.mjs:311— 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.
computePortalStats (cyclomatic 30) stats.mjs:341— computePortalStats has cyclomatic complexity 30 (threshold 15). Of this number, 29 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.
cmdRun (cyclomatic 30) plugins.mjs:128— cmdRun has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body's own statements and 3 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.
layoutSankey (cyclomatic 30) web/src/lib/pipeline-sankey.mjs:226— layoutSankey has cyclomatic complexity 30 (threshold 15). Of this number, 23 points are the body's own statements and 7 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.
check-liveness.main (cyclomatic 29) check-liveness.mjs:35— check-liveness.main 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.
rejection-latency.computeRejectionLatency (cyclomatic 29) rejection-latency.mjs:325— 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.
report-view.ReportView (cyclomatic 29) web/src/components/report-view.tsx:57— report-view.ReportView has cyclomatic complexity 29 (threshold 15). Of this number, 18 points are the body's own statements and 11 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.
computeResponsiveness (cyclomatic 29) company-history.mjs:394— 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.
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.
salary-gap.printSummary (cyclomatic 28) REDACTED:660— salary-gap.printSummary 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.
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.
scan-interamt.main (cyclomatic 28) scan-interamt.mjs:290— scan-interamt.main 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.
apply-view.FieldRow (cyclomatic 28) web/src/components/apply-view.tsx:521— apply-view.FieldRow has cyclomatic complexity 28 (threshold 15). 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, separate the cases: extract each independent 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 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.
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.
renderSummary (cyclomatic 28) funnel-velocity.mjs:425— renderSummary 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.
discover-ats.runSelfTest (cyclomatic 27) discover-ats.mjs:826— discover-ats.runSelfTest has cyclomatic complexity 27 (threshold 15). Of this number, 25 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.
_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.
data.ParseApplications (cyclomatic 27) REDACTED:87— data.ParseApplications has cyclomatic complexity 27 (threshold 15). Of this number, 24 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.
data.UpdateApplicationStatusAndNotes (cyclomatic 27) REDACTED:720— data.UpdateApplicationStatusAndNotes has cyclomatic complexity 27 (threshold 15). Of this number, 25 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.
callOpenRouter (cyclomatic 27) openrouter-runner.mjs:225— 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.
roleFuzzyMatch (cyclomatic 27) role-matcher.mjs:217— roleFuzzyMatch 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.
acquirePortalHealthLock (cyclomatic 27) portal-health-lock.mjs:107— acquirePortalHealthLock has cyclomatic complexity 27 (threshold 15). Of this number, 21 points are the body's own statements and 6 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.
company-funded.buildCandidates (cyclomatic 26) REDACTED:672— 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.
worker-card.WorkerCard (cyclomatic 26) web/src/components/jobs/worker-card.tsx:78— worker-card.WorkerCard has cyclomatic complexity 26 (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.
renderInPage (cyclomatic 26) generate-pdf.mjs:1930— 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.
scanBoard (cyclomatic 26) scan-dayforce.mjs:398— scanBoard 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 (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.
funnel-velocity.selfTest (cyclomatic 25) funnel-velocity.mjs:491— 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 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.
contact-extract.appendContact (cyclomatic 25) contact-extract.mjs:151— 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 153, 169, 164, …). 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:233— 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.
verify-cv-facts.runCli (cyclomatic 25) verify-cv-facts.mjs:1385— verify-cv-facts.runCli 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.
hired-share.main (cyclomatic 25) hired-share.mjs:142— 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:164— 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 literals inside it that branch (lines 212, 200, 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.
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.
config-form.ConfigForm (cyclomatic 25) web/src/components/config-form.tsx:38— config-form.ConfigForm has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 11 of the 25 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 48, 160, 78, …). 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.
discovery-card.DiscoveryCard (cyclomatic 25) web/src/components/explore/discovery-card.tsx:41— discovery-card.DiscoveryCard 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.
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.
clauseBounds (cyclomatic 25) verify-cv-facts.mjs:621— 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.
D1 · Cyclomatic Complexity· main (cyclomatic 25) · ×1
main (cyclomatic 25) rank-pipeline.mjs:258— main has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body's own statements and 1 belongs 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.
findCrossListings (cyclomatic 25) fingerprint-core.mjs:209— findCrossListings 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.
browser-extract.readDom (cyclomatic 24) browser-extract.mjs:729— browser-extract.readDom has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 730, 744, 750, …). 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.
stats.printSummary (cyclomatic 24) stats.mjs:724— stats.printSummary 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.
smartrecruiters.parseSmartRecruitersResponse (cyclomatic 24) providers/smartrecruiters.mjs:194— smartrecruiters.parseSmartRecruitersResponse has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 2 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 197). 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.
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 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.
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.
run-cli-support.parseCodexEvent (cyclomatic 24) web/src/lib/run-cli-support.mjs:171— 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:244— 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.
weekly-digest.runSelfTest (cyclomatic 24) weekly-digest.mjs:418— 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 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.
ViewerModel.styleLine (cyclomatic 24) dashboard/internal/ui/screens/viewer.go:614— 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.
collectSeenCompanyRoles (cyclomatic 24) REDACTED:2333— collectSeenCompanyRoles has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 10 of the 24 points are its own statements and the rest belongs to one function item inside it that branches (add). 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.
configuredTemplateVariantsFromProfileSource::parseScalar (cyclomatic 24) REDACTED:1335— 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.
writeVcf (cyclomatic 24) contacts.mjs:433— 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.
parseCliArgs (cyclomatic 24) archive-posting.mjs:97— 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.
fetch (cyclomatic 24) REDACTED:246— fetch 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.
build-cv-html.buildProjects (cyclomatic 23) build-cv-html.mjs:396— 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 425, 399). 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-jd-archive.checkJdArchive (cyclomatic 23) check-jd-archive.mjs:423— check-jd-archive.checkJdArchive 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.
company-funded.fetchHnDiscovery (cyclomatic 23) REDACTED:776— 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.
company-history.parseArgs (cyclomatic 23) company-history.mjs:123— company-history.parseArgs has cyclomatic complexity 23 (threshold 15). Of this number, 16 points are the body's own statements and 7 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.
scan.verifyOffers (cyclomatic 23) REDACTED:3112— scan.verifyOffers 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.
torre.normalizeTorreOpportunity (cyclomatic 23) providers/torre.mjs:154— 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.
today-dashboard.TodayDashboard (cyclomatic 23) web/src/components/home/today-dashboard.tsx:23— today-dashboard.TodayDashboard 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, 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.ComputeProgressMetrics (cyclomatic 23) REDACTED:990— data.ComputeProgressMetrics 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.
fuzzyTierMatch (cyclomatic 23) merge-tracker.mjs:1619— 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.
analyzeFromContent (cyclomatic 23) followup-cadence.mjs:829— analyzeFromContent has cyclomatic complexity 23 (threshold 15). Of this number, 19 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.
fetch (cyclomatic 23) providers/mokahr.mjs:233— fetch 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:511— 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.
company-funded.parseArgs (cyclomatic 22) REDACTED:103— 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.
_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.
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.
linkedin-join.joinConnections (cyclomatic 22) linkedin-join.mjs:514— linkedin-join.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 4 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.
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.
successfactors.fetchCsb (cyclomatic 22) providers/successfactors.mjs:303— successfactors.fetchCsb 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.
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.
results-list.ResultsList (cyclomatic 22) web/src/components/explore/results-list.tsx:13— results-list.ResultsList has cyclomatic complexity 22 (threshold 15). Of this number, 14 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.
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.
seedBackfill (cyclomatic 22) followup-seed.mjs:616— seedBackfill 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.
buildSvg (cyclomatic 22) hired-wall-build.mjs:152— buildSvg has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body's own statements and 3 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.
parseEightfoldResponse (cyclomatic 22) providers/eightfold.mjs:195— parseEightfoldResponse 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.
analyze-patterns.buildPatternSignals (cyclomatic 21) analyze-patterns.mjs:1206— 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.
invite-match.runSelfTest (cyclomatic 21) REDACTED:916— invite-match.runSelfTest has cyclomatic complexity 21 (threshold 15). 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, 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.
detect-reposts.detectReposts (cyclomatic 21) detect-reposts.mjs:313— 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 316, 352). 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:1038— 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 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.
recruitee.assembleLocation (cyclomatic 21) providers/recruitee.mjs:138— 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.
discover-ats.main (cyclomatic 21) discover-ats.mjs:1060— discover-ats.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.
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) providers/peoplesoft.mjs: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.
scan-ats-full.runSeedScan (cyclomatic 21) scan-ats-full.mjs:639— 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 662, 654). 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 21) web/src/app/api/status/route.ts:107— route.POST 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:277— 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:425— 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.Update (cyclomatic 21) dashboard/internal/ui/screens/viewer.go:129— ViewerModel.Update 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:289— 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.
parseTsvContent (cyclomatic 21) merge-tracker.mjs:985— 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:280— 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:131— 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.
acquireFollowupsLock (cyclomatic 21) followup-seed.mjs:316— acquireFollowupsLock 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.
seedFollowup (cyclomatic 21) followup-seed.mjs:543— seedFollowup 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.
fetch (cyclomatic 21) providers/phenom.mjs:167— fetch 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.
contacts.printSummary (cyclomatic 20) contacts.mjs:371— 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.
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.buildLocationFilter (cyclomatic 20) REDACTED:516— scan.buildLocationFilter has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 536, 544). 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.loadReApplyWindows (cyclomatic 20) REDACTED:1177— 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.
reserve-report-num.runCli (cyclomatic 20) reserve-report-num.mjs:332— reserve-report-num.runCli 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.
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.
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.
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.
cli.main (cyclomatic 20) scaffolder/bin/cli.mjs:87— cli.main 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.
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.
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 literals inside it that branch (lines 54, 153, 88, …). 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.
searchInteramt (cyclomatic 20) scan-interamt.mjs:175— 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.
fetch (cyclomatic 20) providers/csod.mjs:180— fetch 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.
cli-flags.validateFlags (cyclomatic 19) lib/cli-flags.mjs:106— cli-flags.validateFlags has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 122, 148, 116). 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.
audit-portals.auditCompanies (cyclomatic 19) audit-portals.mjs:212— 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 literals inside it that branch (lines 224, 219, 258). 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-table-freshness.runSelfTest (cyclomatic 19) check-table-freshness.mjs:360— 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 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.
verify-portals.verifyCompanies (cyclomatic 19) REDACTED:643— verify-portals.verifyCompanies 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.collectSeenUrls (cyclomatic 19) REDACTED:1667— scan.collectSeenUrls 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) generate-pdf.mjs:771— 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.
history-ats-seeds.atsBoardUrlOf (cyclomatic 19) history-ats-seeds.mjs:21— 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.
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-hn.main (cyclomatic 19) scan-hn.mjs:86— scan-hn.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.
export-ats-text.loadProfile (cyclomatic 19) scripts/export-ats-text.mjs:215— 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:836— 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.
route.POST (cyclomatic 19) web/src/app/api/apply/prefill/route.ts:19— route.POST has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body's own statements and 3 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.
portals-view.PortalsView (cyclomatic 19) web/src/components/portals-view.tsx:21— portals-view.PortalsView has cyclomatic complexity 19 (threshold 15). Of this number, 13 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.
drive.snapshot (cyclomatic 19) web/src/lib/apply/drive.ts:30— drive.snapshot has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 31, 33, 32). 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.
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 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.
PipelineModel.renderPreview (cyclomatic 19) dashboard/internal/ui/screens/pipeline.go:1892— 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.
parseCompanyInput::add (cyclomatic 19) discover-ats.mjs:186— 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.
fetchTextMeta (cyclomatic 19) REDACTED:424— 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.
validatePortalsConfig::validateEntryList (cyclomatic 19) validate-portals.mjs:281— validatePortalsConfig::validateEntryList 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.
installIndex (cyclomatic 19) plugins/h1b-sponsor/install-h1b-index.mjs:203— installIndex 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.
liveness-core.classifyLiveness (cyclomatic 18) liveness-core.mjs:159— liveness-core.classifyLiveness 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.
liveness-browser.createHeadedPageProvider (cyclomatic 18) liveness-browser.mjs:464— liveness-browser.createHeadedPageProvider has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body's own statements and 6 belong 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.
archive-posting.main (cyclomatic 18) archive-posting.mjs:399— 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.
build-cv-html.buildExperience (cyclomatic 18) build-cv-html.mjs:350— 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 377, 353). 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.
stats.computeAllStats (cyclomatic 18) stats.mjs:649— 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 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.
verify-portals.printResults (cyclomatic 18) REDACTED:729— 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.
fix-slugs.appendNote (cyclomatic 18) fix-slugs.mjs:156— 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:68— 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.
check.main (cyclomatic 18) plugins/h1b-sponsor/check.mjs:242— 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.
comeet.parseComeetResponse (cyclomatic 18) providers/comeet.mjs:115— comeet.parseComeetResponse 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 118, 149). 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.
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 literals inside it that branch (lines 53, 46). 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.
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.
upskill.aggregateGaps (cyclomatic 18) upskill.mjs:334— upskill.aggregateGaps has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body's own statements and 7 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.
cadence-settings.CadenceSettings (cyclomatic 18) web/src/components/followups/cadence-settings.tsx:21— cadence-settings.CadenceSettings has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 52, 34, 45, …). 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.
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 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.
StatsModel.renderPieChart (cyclomatic 18) dashboard/internal/ui/screens/stats.go:330— 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.
parseHeadedAddition (cyclomatic 18) merge-tracker.mjs:852— parseHeadedAddition has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body's own statements and 6 belong to 8 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.
findUnarchivedApplications (cyclomatic 18) check-jd-archive.mjs:530— 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.
renderTable (cyclomatic 18) tracker.mjs:785— 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.
computeTrackerStats (cyclomatic 18) stats.mjs:75— 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:186— 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.
extractTrackerReportNumbers (cyclomatic 18) tracker-parse.mjs:428— extractTrackerReportNumbers has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body's own statements and 6 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.
fetch (cyclomatic 18) providers/avature.mjs:188— fetch 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.
add-entry.applyAdd (cyclomatic 17) add-entry.mjs:169— 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:189— 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 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.
assessment-log.printSummary (cyclomatic 17) assessment-log.mjs:253— assessment-log.printSummary 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.
build-cv-html.prepareCandidatePhoto (cyclomatic 17) build-cv-html.mjs:117— build-cv-html.prepareCandidatePhoto 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.
build-cv-html.main (cyclomatic 17) build-cv-html.mjs:773— build-cv-html.main 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.
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.
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.
followup-cadence.computeUrgency (cyclomatic 17) followup-cadence.mjs:775— followup-cadence.computeUrgency 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.
company-history.loadStatusLogSource (cyclomatic 17) company-history.mjs:315— 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:281— 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 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.
scan.buildContentFilter (cyclomatic 17) REDACTED:752— 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 768, 778). 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:1205— 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 1212, 1243, 1241). 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.
intake.main (cyclomatic 17) intake.mjs:422— 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.
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 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.
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.
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:143— 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) REDACTED: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) providers/telegram-channel.mjs: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) providers/telegram-channel.mjs: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:568— 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 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.
update-system.rejectUserLayerPaths (cyclomatic 17) REDACTED:867— 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 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.
validate-portals.validateParser (cyclomatic 17) validate-portals.mjs:113— 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 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.
career-ops.readLanguageConfig (cyclomatic 17) web/src/lib/career-ops.ts:560— 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 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.
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.
PipelineModel.Update (cyclomatic 17) dashboard/internal/ui/screens/pipeline.go:458— PipelineModel.Update 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:910— 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:1794— 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.
buildRow (cyclomatic 17) merge-tracker.mjs:639— buildRow has cyclomatic complexity 17 (threshold 15). 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, separate the cases: extract each independent 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 17) scan-ats-full.mjs:717— runHistorySeedScan has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body's own statements and 8 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.
isPrivateIpv4 (cyclomatic 17) REDACTED:196— 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.
acquireTrackerLock::release (cyclomatic 17) tracker-utils.mjs:454— acquireTrackerLock::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.
proxyFor (cyclomatic 17) providers/_http.mjs:33— 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.
fetchInContext (cyclomatic 17) providers/_http.mjs:107— fetchInContext 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.
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.
fetch (cyclomatic 17) providers/remotli.mjs:265— fetch 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.
D1 · Cyclomatic Complexity· main (cyclomatic 17) · ×1
main (cyclomatic 17) hired-wall-build.mjs:207— main has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs 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.
parseListingPage (cyclomatic 17) providers/careerviet.mjs:207— parseListingPage 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:219— 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.
audit-portals.findUnclaimedEntries (cyclomatic 16) audit-portals.mjs:288— 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:465— 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 488, 468). 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-table-freshness.extractRows (cyclomatic 16) check-table-freshness.mjs:148— 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 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.
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.
funnel-velocity.parseStatusLog (cyclomatic 16) funnel-velocity.mjs:118— 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:103— 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.
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:436— 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.
discover-ats.parseArgs (cyclomatic 16) discover-ats.mjs:996— discover-ats.parseArgs has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1018, 1005, 1011, …). 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.
doctor.onboardingState (cyclomatic 16) doctor.mjs:842— doctor.onboardingState 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.
followup-seed.parseCliArgs (cyclomatic 16) followup-seed.mjs:701— followup-seed.parseCliArgs 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:259— 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.
plugin-audit.auditPlugin (cyclomatic 16) plugin-audit.mjs:95— 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:108— 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.
_notion.createNotionClient (cyclomatic 16) plugins/notion/_notion.mjs:66— _notion.createNotionClient has cyclomatic complexity 16 (threshold 15). 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, separate the cases: extract each independent 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.
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 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.
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.
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.
tracker.parseTracker (cyclomatic 16) tracker.mjs:473— 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:3171— 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.compute (cyclomatic 16) web/src/app/api/usage/route.ts:34— route.compute 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.
origin-guard.checkRequest (cyclomatic 16) web/src/lib/origin-guard.mjs:116— 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.
data.enrichFromScanHistory (cyclomatic 16) REDACTED:354— 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.
buildCompanyCanonicalizer (cyclomatic 16) REDACTED:1806— 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.
requisitionIdsForDedup (cyclomatic 16) REDACTED:2195— requisitionIdsForDedup 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.
parseBlacklist (cyclomatic 16) REDACTED:2797— 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.
parseArgs (cyclomatic 16) scan-ats-full.mjs:336— parseArgs has cyclomatic complexity 16 (threshold 15). Of this number, 12 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.
computeRunStats (cyclomatic 16) stats.mjs:581— 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.
cmdEvaluate (cyclomatic 16) openrouter-runner.mjs:652— 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.
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.
validateProfile::checkFact (cyclomatic 16) career-profile.mjs:155— 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.
scan.main (cognitive 271) REDACTED:3268— scan.main has cognitive complexity 271 (threshold 15). Drivers by points: if/else 97 (150 pts), boolean chains 49, ternaries 16 (34 pts), loops 18 (33 pts), error handling 4 (5 pts) (nesting depth added 87). Of this number, 196 points are the body's own statements and 75 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.
scan-ats-full.main (cognitive 225) scan-ats-full.mjs:903— scan-ats-full.main has cognitive complexity 225 (threshold 15). Drivers by points: if/else 63 (121 pts), ternaries 24 (43 pts), boolean chains 38, error handling 5 (14 pts), loops 6 (9 pts) (nesting depth added 89). Of this number, 134 points are the body's own statements and 91 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.
explore-provider.ExploreProvider (cognitive 157) web/src/components/explore/explore-provider.tsx:116— explore-provider.ExploreProvider has cognitive complexity 157 (threshold 15). Drivers by points: if/else 46 (82 pts), ternaries 17 (30 pts), boolean chains 17, error handling 10 (13 pts), loops 7 (11 pts), match/switch 1 (4 pts) (nesting depth added 59). Most of this is not in the body itself: 0 of the 157 points are its own statements and the rest belongs to 15 function literals inside it that branch (lines 157, 419, 538, …). 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-provider.ApplyProvider (cognitive 138) web/src/components/apply/apply-provider.tsx:60— apply-provider.ApplyProvider has cognitive complexity 138 (threshold 15). Drivers by points: if/else 53 (83 pts), ternaries 6 (18 pts), error handling 8 (14 pts), boolean chains 13, loops 7 (10 pts) (nesting depth added 51). Most of this is not in the body itself: 0 of the 138 points are its own statements and the rest belongs to 13 function literals inside it that branch (lines 213, 98, 348, …). 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 (cognitive 135) analyze-patterns.mjs:421— runSelfTest has cognitive complexity 135 (threshold 15). Drivers by points: if/else 72 (97 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.
apply (cognitive 129) REDACTED:3276— apply has cognitive complexity 129 (threshold 15). Drivers by points: if/else 38 (60 pts), error handling 17 (25 pts), loops 9 (17 pts), ternaries 7 (15 pts), boolean chains 12 (nesting depth added 46). Of this number, 127 points are the body's own statements and 2 belong to 15 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.
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.
assistant-console.AssistantConsole (cognitive 108) web/src/components/assistant-console.tsx:152— assistant-console.AssistantConsole has cognitive complexity 108 (threshold 15). Drivers by points: if/else 38 (51 pts), boolean chains 28, loops 7 (11 pts), error handling 8 (10 pts), ternaries 7 (8 pts) (nesting depth added 20). Of this number, 63 points are the body's own statements and 45 belong to 16 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.
validate-portals.validatePortalsConfig (cognitive 104) validate-portals.mjs:167— validate-portals.validatePortalsConfig has cognitive complexity 104 (threshold 15). Drivers by points: if/else 39 (79 pts), boolean chains 9, loops 3 (9 pts), ternaries 2 (7 pts) (nesting depth added 51). Of this number, 72 points are the body's own statements and 32 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.
update-system.locallyModifiedSystemFiles (cognitive 103) REDACTED:1861— update-system.locallyModifiedSystemFiles has cognitive complexity 103 (threshold 15). Drivers by points: if/else 15 (47 pts), loops 8 (22 pts), error handling 9 (18 pts), boolean chains 11, ternaries 2 (5 pts) (nesting depth added 58). Of this number, 86 points are the body's own statements and 17 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.
route.POST (cognitive 99) web/src/app/api/run/route.ts:28— route.POST has cognitive complexity 99 (threshold 15). Drivers by points: if/else 49 (59 pts), ternaries 12 (16 pts), boolean chains 13, error handling 7 (8 pts), loops 3 (nesting depth added 15). Of this number, 34 points are the body's own statements and 65 belong to 15 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.
doImport (cognitive 99) career-profile.mjs:214— 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.
acquirePipelineLock (cognitive 95) pipeline-lock.mjs:370— acquirePipelineLock has cognitive complexity 95 (threshold 15). Drivers by points: if/else 18 (56 pts), error handling 8 (17 pts), boolean chains 8, ternaries 7, other 6, loops 1 (nesting depth added 47). Of this number, 75 points are the body's own statements and 20 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.
fetch (cognitive 95) REDACTED:310— 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.
runSelfTest (cognitive 89) build-cv-html.mjs:853— runSelfTest has cognitive complexity 89 (threshold 15). Drivers by points: if/else 50 (59 pts), boolean chains 16, loops 9, error handling 5 (nesting depth added 9). Of this number, 86 points are the body's own statements and 3 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.
tracker-utils.acquireTrackerLock (cognitive 86) tracker-utils.mjs:393— tracker-utils.acquireTrackerLock has cognitive complexity 86 (threshold 15). Drivers by points: if/else 21 (64 pts), error handling 6 (15 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 53). To reduce it, split the body into named stages: move each independent 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). Most of this is not in the body itself: 0 of the 86 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 23, 29, 24, …). 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.
export-ats-text.parseCvMarkdown (cognitive 85) scripts/export-ats-text.mjs:32— 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:528— 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.
inbox-triage.InboxTriage (cognitive 82) web/src/components/inbox/inbox-triage.tsx:25— inbox-triage.InboxTriage has cognitive complexity 82 (threshold 15). Drivers by points: if/else 24 (29 pts), boolean chains 25, ternaries 12 (16 pts), loops 7, error handling 3 (5 pts) (nesting depth added 11). Of this number, 17 points are the body's own statements and 65 belong to 23 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.
route.POST (cognitive 80) web/src/app/api/explore/ai/route.ts:46— route.POST has cognitive complexity 80 (threshold 15). Drivers by points: if/else 32 (40 pts), error handling 12 (17 pts), boolean chains 11, ternaries 7 (11 pts), loops 1 (nesting depth added 17). Of this number, 24 points are the body's own statements and 56 belong to 11 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.
export-ats-text.formatAtsText (cognitive 77) scripts/export-ats-text.mjs:274— 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.
followups-view.FollowupsView (cognitive 77) web/src/components/followups/followups-view.tsx:81— followups-view.FollowupsView has cognitive complexity 77 (threshold 15). Drivers by points: ternaries 22 (51 pts), if/else 13 (14 pts), boolean chains 10, error handling 1, loops 1 (nesting depth added 30). Of this number, 23 points are the body's own statements and 54 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.
upskill.runSelfTest (cognitive 76) upskill.mjs:552— upskill.runSelfTest has cognitive complexity 76 (threshold 15). Drivers by points: if/else 49 (62 pts), boolean chains 5, error handling 3 (5 pts), loops 4 (nesting depth added 15). 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 76) providers/occ.mjs:170— fetch has cognitive complexity 76 (threshold 15). Drivers by points: if/else 9 (33 pts), ternaries 7 (20 pts), loops 4 (10 pts), boolean chains 9, error handling 1 (4 pts) (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.
session.fillSession (cognitive 75) web/src/lib/apply/session.ts:395— session.fillSession has cognitive complexity 75 (threshold 15). Drivers by points: if/else 21 (41 pts), error handling 8 (21 pts), boolean chains 5, ternaries 1 (5 pts), loops 2 (3 pts) (nesting depth added 38). Of this number, 68 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.
D2 · Cognitive Complexity· main (cognitive 69) · ×1
main (cognitive 69) audit-portals.mjs:377— 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.
update-system.configuredTemplateVariantsFromProfileSource (cognitive 68) REDACTED:1331— update-system.configuredTemplateVariantsFromProfileSource has cognitive complexity 68 (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). Of this number, 34 points are the body's own statements and 34 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.
checkUrlLiveness (cognitive 68) liveness-browser.mjs:242— checkUrlLiveness has cognitive complexity 68 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 14, error handling 5 (10 pts), ternaries 3 (7 pts), loops 3 (6 pts), other 4 (nesting depth added 22). Of this number, 38 points are the body's own statements and 30 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.
scan-dayforce.main (cognitive 66) scan-dayforce.mjs:503— scan-dayforce.main has cognitive complexity 66 (threshold 15). Drivers by points: if/else 20 (39 pts), loops 10 (19 pts), boolean chains 3, error handling 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent 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:620— 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 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.
salary-gap.printSummary (cognitive 61) REDACTED:660— salary-gap.printSummary has cognitive complexity 61 (threshold 15). Drivers by points: ternaries 8 (22 pts), if/else 15 (19 pts), loops 8 (18 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.
analyze-patterns.analyze (cognitive 60) analyze-patterns.mjs:1281— analyze-patterns.analyze has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (33 pts), boolean chains 14, ternaries 6 (7 pts), loops 5 (6 pts) (nesting depth added 14). Of this number, 40 points are the body's own statements and 20 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.
reply-matcher.matchCandidates (cognitive 59) reply-matcher.mjs:391— reply-matcher.matchCandidates has cognitive complexity 59 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 21, loops 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.
analyze-patterns.parseReport (cognitive 58) analyze-patterns.mjs:954— 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.
fold (cognitive 58) REDACTED:228— fold has cognitive complexity 58 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 9 (17 pts), boolean chains 13, loops 5, other 1 (nesting depth added 19). Of this number, 54 points are the body's own statements and 4 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.
acquirePortalHealthLock (cognitive 58) portal-health-lock.mjs:107— acquirePortalHealthLock has cognitive complexity 58 (threshold 15). Drivers by points: if/else 11 (36 pts), error handling 6 (13 pts), boolean chains 5, other 3, loops 1 (nesting depth added 32). Of this number, 46 points are the body's own statements and 12 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.
reply-watch.main (cognitive 57) reply-watch.mjs:222— reply-watch.main has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (24 pts), error handling 3 (9 pts), ternaries 3 (9 pts), loops 3 (8 pts), boolean chains 7 (nesting depth added 25). Of this number, 28 points are the body's own statements and 29 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.
apply-view.FieldRow (cognitive 57) web/src/components/apply-view.tsx:521— apply-view.FieldRow has cognitive complexity 57 (threshold 15). Drivers by points: ternaries 14 (46 pts), boolean chains 10, if/else 1 (nesting depth added 32). Of this number, 50 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.
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:60— 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.
job-store.JobsProvider (cognitive 56) web/src/components/jobs/job-store.tsx:59— job-store.JobsProvider has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (31 pts), boolean chains 8, ternaries 7 (8 pts), error handling 4 (6 pts), loops 2 (3 pts) (nesting depth added 19). Most of this is not in the body itself: 0 of the 56 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 114, 142, 65, …). 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.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.
followup-cadence.extractContacts (cognitive 55) followup-cadence.mjs:663— followup-cadence.extractContacts has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 12, loops 5 (9 pts), ternaries 4 (nesting depth added 18). Of this number, 16 points are the body's own statements and 39 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.
_engine.validateManifest (cognitive 55) plugins/_engine.mjs:152— _engine.validateManifest has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (31 pts), boolean chains 14, 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.
route.POST (cognitive 55) web/src/app/api/cv/ingest/route.ts:68— route.POST has cognitive complexity 55 (threshold 15). Drivers by points: if/else 24 (35 pts), boolean chains 8, error handling 6 (8 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 14). Of this number, 29 points are the body's own statements and 26 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 55) providers/arbeitsagentur.mjs:157— fetch has cognitive complexity 55 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 12, loops 4 (9 pts), ternaries 3 (7 pts), error handling 2 (5 pts) (nesting depth added 25). Of this number, 51 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.
cv-ingest.CvIngest (cognitive 53) web/src/components/cv/cv-ingest.tsx:30— 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 literals inside it that branch (lines 44, 146, 201, …). 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.
renderSummary (cognitive 53) funnel-velocity.mjs:425— renderSummary has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (26 pts), ternaries 7 (17 pts), loops 4 (7 pts), other 2, boolean chains 1 (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.
computePortalStats (cognitive 53) stats.mjs:341— 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 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.
generate-pdf.generatePDF (cognitive 51) generate-pdf.mjs:1367— generate-pdf.generatePDF has cognitive complexity 51 (threshold 15). Drivers by points: if/else 30 (37 pts), boolean chains 7, loops 2 (4 pts), error handling 2, ternaries 1 (nesting depth added 9). 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.
fetchCsb (cognitive 50) providers/successfactors.mjs:303— fetchCsb has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (31 pts), ternaries 2 (7 pts), loops 3 (6 pts), error handling 2 (4 pts), boolean chains 2 (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.
D2 · Cognitive Complexity· main (cognitive 50) · ×1
main (cognitive 50) scan-interamt.mjs:290— main has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 4 (7 pts), ternaries 3 (7 pts), boolean chains 2, error handling 1 (2 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.
acquireFollowupsLock (cognitive 49) followup-seed.mjs:316— acquireFollowupsLock has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (35 pts), error handling 4 (9 pts), other 3, boolean chains 1, loops 1 (nesting depth added 29). Of this number, 39 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.
contact-extract.main (cognitive 48) contact-extract.mjs:253— 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.
explorer-view.ExplorerView (cognitive 48) web/src/components/explore/explorer-view.tsx:31— explorer-view.ExplorerView has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 28, ternaries 7 (11 pts), if/else 7 (8 pts), error handling 1 (nesting depth added 5). Of this number, 32 points are the body's own statements and 16 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.
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 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.
ViewerModel.renderAll (cognitive 48) dashboard/internal/ui/screens/viewer.go:289— 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:394— 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.
printSummary (cognitive 48) analyze-patterns.mjs:1585— printSummary has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (18 pts), loops 10 (17 pts), ternaries 3 (8 pts), boolean chains 4, other 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.
computePortalRecommendations (cognitive 48) stats.mjs:424— 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.
findCrossListings (cognitive 48) fingerprint-core.mjs:209— findCrossListings has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (26 pts), ternaries 7 (13 pts), loops 3 (4 pts), boolean chains 3, other 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.
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.
drive.driveSession (cognitive 47) web/src/lib/apply/drive.ts:131— drive.driveSession has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 14, ternaries 4 (6 pts), error handling 2 (3 pts), loops 1 (nesting depth added 12). Of this number, 44 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.
fetch (cognitive 47) providers/telegram-channel.mjs: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.
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:400— 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.
company-history.buildCompanyCards (cognitive 45) company-history.mjs:515— 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:233— 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.
pipeline-view.PipelineView (cognitive 44) web/src/components/pipeline-view.tsx:35— pipeline-view.PipelineView has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 15 (25 pts), if/else 8 (10 pts), boolean chains 7, loops 2 (nesting depth added 12). Most of this is not in the body itself: 11 of the 44 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 70, 95, 84, …). 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.ParseApplications (cognitive 44) REDACTED:87— data.ParseApplications has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (40 pts), boolean chains 2, loops 2 (nesting depth added 21). Of this number, 41 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.
checkMainChannel (cognitive 44) REDACTED:2929— checkMainChannel has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 8 (14 pts), boolean chains 12, error handling 5 (9 pts), if/else 9 (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.
callOpenRouter (cognitive 44) openrouter-runner.mjs:225— 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:325— 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.
check-jd-archive.checkJdArchive (cognitive 43) check-jd-archive.mjs:423— check-jd-archive.checkJdArchive has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 10 (25 pts), if/else 6 (11 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 21). 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.
route.POST (cognitive 43) web/src/app/api/assistant/route.ts:55— route.POST has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (20 pts), ternaries 8 (11 pts), error handling 6 (8 pts), boolean chains 3, loops 1 (nesting depth added 10). Of this number, 18 points are the body's own statements and 25 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.
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.
stats.printSummary (cognitive 42) stats.mjs:724— stats.printSummary has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 9 (19 pts), if/else 15 (17 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.
intake.listSourceFiles (cognitive 42) intake.mjs:164— intake.listSourceFiles has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (24 pts), error handling 5 (10 pts), boolean chains 3, ternaries 2 (3 pts), loops 2 (nesting depth added 18). Most of this is not in the body itself: 1 of the 42 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 212, 200, 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.
data.enrichAppURLsByCompany (cognitive 42) REDACTED:425— 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:311— 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.
stripNonRendered (cognitive 42) REDACTED:130— stripNonRendered has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (30 pts), ternaries 3 (10 pts), boolean chains 1, loops 1 (nesting depth added 25). 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.
scan.runScanner (cognitive 41) web/src/lib/core/scan.ts:186— scan.runScanner has cognitive complexity 41 (threshold 15). Drivers by points: if/else 23 (28 pts), boolean chains 5, error handling 2 (3 pts), ternaries 2 (3 pts), loops 2 (nesting depth added 7). Most of this is not in the body itself: 0 of the 41 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 283, 346, 363, …). 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.
extractContacts::add (cognitive 41) followup-cadence.mjs:669— 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.
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.
cmdRun (cognitive 41) plugins.mjs:128— cmdRun has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (23 pts), ternaries 4 (7 pts), boolean chains 6, loops 2 (4 pts), other 1 (nesting depth added 11). Of this number, 39 points are the body's own statements and 2 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.
searchInteramt (cognitive 41) scan-interamt.mjs:175— 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.
discover-ats.parseCompanyInput (cognitive 40) discover-ats.mjs:181— discover-ats.parseCompanyInput has cognitive complexity 40 (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). Of this number, 22 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.
scan.verifyOffers (cognitive 40) REDACTED:3112— scan.verifyOffers has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (20 pts), ternaries 6 (14 pts), boolean chains 3, error handling 2, loops 1 (nesting depth added 19). 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.
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.
runBatchFromManifest (cognitive 39) generate-pdf.mjs:1633— runBatchFromManifest has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 10, error handling 6 (7 pts), other 3, ternaries 1 (3 pts), loops 1 (nesting depth added 9). Of this number, 38 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.
parseCompensation (cognitive 39) providers/ashby.mjs:55— 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.
check-liveness.main (cognitive 38) check-liveness.mjs:35— check-liveness.main has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (19 pts), ternaries 7 (11 pts), boolean chains 7, loops 1 (nesting depth added 8). Of this number, 36 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.
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.
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.
eightfold.parseEightfoldResponse (cognitive 38) providers/eightfold.mjs:195— eightfold.parseEightfoldResponse has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 4 (10 pts), boolean chains 4, error handling 1 (3 pts), 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.
StatsModel.renderPieChart (cognitive 38) dashboard/internal/ui/screens/stats.go:330— 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.
printSummary (cognitive 38) assessment-log.mjs:253— printSummary has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 8 (23 pts), if/else 5 (7 pts), loops 3 (6 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.
fetch (cognitive 38) providers/csod.mjs:180— fetch has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (27 pts), ternaries 3 (7 pts), loops 2 (3 pts), boolean chains 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.
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.
data.UpdateApplicationStatusAndNotes (cognitive 37) REDACTED:720— data.UpdateApplicationStatusAndNotes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 10). Of this number, 33 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.
buildCandidates (cognitive 37) REDACTED:672— 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 (cognitive 36) providers/greenhouse.mjs:111— greenhouse.buildOfficeMap 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). Most of this is not in the body itself: 0 of the 36 points are its own statements and the rest belongs to one function literal inside it that branches (line 115). 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.
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:371— 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.
appModel.Update (cognitive 36) dashboard/main.go:84— appModel.Update has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (31 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 17). 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, split the body into named stages: move each independent 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 36) browser-extract.mjs:729— readDom has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 5 (14 pts), if/else 5 (9 pts), boolean chains 8, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 15). Most of this is not in the body itself: 0 of the 36 points are its own statements and the rest belongs to 5 function items inside it that branch ((anonymous), (anonymous)::(anonymous), (anonymous)::(anonymous), …). 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.
scanBoard (cognitive 36) scan-dayforce.mjs:398— scanBoard has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 6, ternaries 3 (6 pts), loops 3, error handling 1 (2 pts), 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 36) providers/phenom.mjs:167— fetch has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 3 (6 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 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.
verify-portals.discoverAlternates (cognitive 35) REDACTED:494— 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.
generate-pdf.scanNesting (cognitive 35) generate-pdf.mjs:771— 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.
discovery-card.DiscoveryCard (cognitive 35) web/src/components/explore/discovery-card.tsx:41— discovery-card.DiscoveryCard has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 9 (24 pts), boolean chains 11 (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.
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.
analyzeFromContent (cognitive 35) followup-cadence.mjs:829— analyzeFromContent has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 6 (12 pts), boolean chains 3, loops 2, other 2 (nesting depth added 14). Of this number, 31 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.
fetchHnDiscovery (cognitive 35) REDACTED:776— 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.
selfTest (cognitive 35) REDACTED:410— selfTest has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 34, if/else 1. Of this number, 27 points are the body's own statements and 8 belong to 13 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.
seedBackfill (cognitive 35) followup-seed.mjs:616— seedBackfill has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (16 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.
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.
validateProfile (cognitive 35) career-profile.mjs:150— validateProfile has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 11, ternaries 2 (4 pts), loops 3, other 1 (nesting depth added 5). Most of this is not in the body itself: 14 of the 35 points are its own statements and the rest belongs to 4 function items inside it that branch (checkFact, (anonymous), (anonymous), …). 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.
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, cachedLookup::resolve::(anonymous), guarded::(anonymous), …). 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.
fetch (cognitive 35) REDACTED:234— fetch has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 7, loops 3 (6 pts), error handling 1 (3 pts), ternaries 2, other 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.
reply-matcher.classifyReply (cognitive 34) reply-matcher.mjs:511— 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 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.buildCooldownFilter (cognitive 34) REDACTED:1205— 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 1212, 1243, 1241). 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 (cognitive 34) REDACTED:1667— scan.collectSeenUrls has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 5 (8 pts), boolean chains 5 (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.
verify-cv-facts.runCli (cognitive 34) verify-cv-facts.mjs:1385— verify-cv-facts.runCli has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 5 (11 pts), ternaries 3 (5 pts), boolean chains 2, error handling 2 (nesting depth added 10). 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-hn.main (cognitive 34) scan-hn.mjs:86— scan-hn.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, loops 2 (4 pts), error handling 1 (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.
buildCompanyCanonicalizer (cognitive 34) REDACTED:1806— 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.
fetch (cognitive 34) REDACTED:246— fetch has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 9, ternaries 4 (6 pts), error handling 1 (3 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.
data.deriveNoteFields (cognitive 33) dashboard/internal/data/derive.go:156— data.deriveNoteFields has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 4, loops 4, match/switch 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.
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:433— 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.
D2 · Cognitive Complexity· main (cognitive 33) · ×1
main (cognitive 33) rank-pipeline.mjs:258— main has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 3 (5 pts), other 4, error handling 1 (2 pts), ternaries 2, boolean chains 1 (nesting depth added 9). Of this number, 31 points are the body's own statements and 2 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.
analyze-patterns.buildPatternSignals (cognitive 32) analyze-patterns.mjs:1206— 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.
verify-portals.verifyCompanies (cognitive 32) REDACTED:643— verify-portals.verifyCompanies has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 7, ternaries 2 (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.
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.
data.loadJobURLs (cognitive 32) REDACTED:277— 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.
acquireTrackerLock::release (cognitive 32) tracker-utils.mjs:454— acquireTrackerLock::release has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (25 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.
checkFreshness (cognitive 32) check-table-freshness.mjs:186— 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.
validatePortalsConfig::validateEntryList (cognitive 32) validate-portals.mjs:281— validatePortalsConfig::validateEntryList has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 5, 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.
buildSvg (cognitive 32) hired-wall-build.mjs:152— buildSvg has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 11 (20 pts), if/else 3 (5 pts), boolean chains 4, other 2, loops 1 (nesting depth added 11). Of this number, 28 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.
normalizeWttjHit (cognitive 32) providers/wttj.mjs:117— normalizeWttjHit has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 15, ternaries 8 (9 pts), if/else 8 (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.
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 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.computeScanStats (cognitive 31) stats.mjs:280— 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:639— 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 662, 654). 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.
cadence-settings.CadenceSettings (cognitive 31) web/src/components/followups/cadence-settings.tsx:21— cadence-settings.CadenceSettings has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 9 (21 pts), if/else 5 (6 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 13). Most of this is not in the body itself: 14 of the 31 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 52, 34, 45, …). 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.
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). Most of this is not in the body itself: 0 of the 31 points are its own statements and the rest belongs 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.
session.openSession (cognitive 31) web/src/lib/apply/session.ts:179— session.openSession has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 8, ternaries 4 (6 pts), error handling 1 (nesting depth added 4). Of this number, 28 points are the body's own statements and 3 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.
data.enrichFromScanHistory (cognitive 31) REDACTED:354— 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.
collectSeenCompanyRoles (cognitive 31) REDACTED:2333— collectSeenCompanyRoles has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4, loops 3 (4 pts), other 2, ternaries 1 (nesting depth added 8). Of this number, 16 points are the body's own statements and 15 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.
configuredTemplateVariantsFromProfileSource::parseScalar (cognitive 31) REDACTED:1335— 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.
parseTsvContent (cognitive 31) merge-tracker.mjs:985— 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.
fetchTextMeta (cognitive 31) REDACTED:424— 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.
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.
_engine.discoverPlugins (cognitive 30) plugins/_engine.mjs:247— _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 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.
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:164— 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.
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 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.
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.
parseClaudeEvent (cognitive 30) web/src/lib/run-cli-support.mjs:244— 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.
parseCliArgs (cognitive 30) archive-posting.mjs:97— 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.
roleFuzzyMatch (cognitive 30) role-matcher.mjs:217— roleFuzzyMatch has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 7, ternaries 3 (4 pts), other 2 (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.
apply-view.ApplyView (cognitive 29) web/src/components/apply-view.tsx:32— 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.
report-view.ReportView (cognitive 29) web/src/components/report-view.tsx:57— report-view.ReportView has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 18, ternaries 5 (7 pts), if/else 2 (4 pts) (nesting depth added 4). Of this number, 15 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.
run-cli-support.parseCodexEvent (cognitive 29) web/src/lib/run-cli-support.mjs:171— 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.
ViewerModel.Update (cognitive 29) dashboard/internal/ui/screens/viewer.go:129— ViewerModel.Update has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 2 (3 pts) (nesting depth added 18). 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.
renderInPage (cognitive 29) generate-pdf.mjs:1930— 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.
computeVelocity (cognitive 29) funnel-velocity.mjs:212— computeVelocity has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (19 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 16). 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.
parseTracker (cognitive 29) tracker.mjs:473— 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.
listSourceFiles::walk (cognitive 29) intake.mjs:212— 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.
layoutSankey (cognitive 29) web/src/lib/pipeline-sankey.mjs:226— layoutSankey has cognitive complexity 29 (threshold 15). Drivers by points: other 12, if/else 4 (6 pts), loops 4 (5 pts), boolean chains 3, ternaries 3 (nesting depth added 3). Of this number, 25 points are the body's own statements and 4 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.
detect-reposts.detectRepostsInGroup (cognitive 28) detect-reposts.mjs:360— 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:422— 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.
upskill.aggregateGaps (cognitive 28) upskill.mjs:334— upskill.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 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.
route.compute (cognitive 28) web/src/app/api/usage/route.ts:34— route.compute has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 3 (7 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (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.
ViewerModel.styleLine (cognitive 28) dashboard/internal/ui/screens/viewer.go:614— 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.
renderSummary (cognitive 28) company-history.mjs:984— 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.
computeUrgency (cognitive 28) followup-cadence.mjs:775— computeUrgency has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 3 (8 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.
parseFormState (cognitive 28) providers/peoplesoft.mjs: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.
printResults (cognitive 28) REDACTED:729— 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.
appendNote (cognitive 28) fix-slugs.mjs:156— 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.
applyAdd (cognitive 28) add-entry.mjs:169— applyAdd has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 2 (5 pts), boolean chains 4 (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:138— 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 140). 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.
recruitee.parseRecruiteeResponse (cognitive 27) providers/recruitee.mjs:219— recruitee.parseRecruiteeResponse has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 2 (4 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 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.
doctor.main (cognitive 27) doctor.mjs:689— doctor.main has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 7 (8 pts), loops 3 (7 pts) (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.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.
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:560— 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 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.ComputeProgressMetrics (cognitive 27) REDACTED:990— data.ComputeProgressMetrics has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 5, boolean chains 2, match/switch 1 (2 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.
PipelineModel.renderPreview (cognitive 27) dashboard/internal/ui/screens/pipeline.go:1892— 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:396— 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 ((anonymous), (anonymous), (anonymous), …). 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.
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.
fetch (cognitive 27) providers/remotli.mjs:265— fetch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 5, ternaries 3 (5 pts), loops 2 (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.
parseListingPage (cognitive 27) providers/careerviet.mjs:207— parseListingPage has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 4 (8 pts), boolean chains 2, error handling 1 (2 pts), loops 2, other 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.
parseOracleResponse (cognitive 27) providers/oraclecloud.mjs:186— parseOracleResponse has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 7 (12 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.
stats.computeAllStats (cognitive 26) stats.mjs:649— 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 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.loadReApplyWindows (cognitive 26) REDACTED:1177— 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.
linkedin-join.joinConnections (cognitive 26) linkedin-join.mjs:514— linkedin-join.joinConnections has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 8, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 8). Of this number, 14 points are the body's own statements and 12 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.
export-ats-text.loadProfile (cognitive 26) scripts/export-ats-text.mjs:215— export-ats-text.loadProfile has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 4 (8 pts), boolean chains 4 (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/status/route.ts:107— route.POST has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 5 (11 pts), boolean chains 3, 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.
PipelineModel.Update (cognitive 26) dashboard/internal/ui/screens/pipeline.go:458— 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.
D2 · Cognitive Complexity· main (cognitive 26) · ×1
main (cognitive 26) discover-ats.mjs:1060— main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 3 (5 pts), boolean chains 3, error handling 1 (2 pts) (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, 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.
computeTrackerStats (cognitive 26) stats.mjs:75— 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.
cv-templates.discover (cognitive 25) REDACTED:139— 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 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.
verify-cv-facts.factClaims (cognitive 25) verify-cv-facts.mjs:400— verify-cv-facts.factClaims has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 3 (10 pts), loops 3 (6 pts), boolean chains 5, if/else 1 (4 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.
hired-share.main (cognitive 25) hired-share.mjs:142— 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.
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.
_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.
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.
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 literals inside it that branch (lines 65, 44, 53, …). 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 (cognitive 25) discover-ats.mjs:826— runSelfTest has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 16, if/else 3 (5 pts), loops 2 (3 pts), ternaries 1 (nesting depth added 3). Of this number, 22 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.
tracker-parse.parseMarkdownLinks (cognitive 24) tracker-parse.mjs:384— tracker-parse.parseMarkdownLinks 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.
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:118— 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.
discover-ats.dedupeAgainstPortals (cognitive 24) discover-ats.mjs:436— 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.
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.
drive.snapshot (cognitive 24) web/src/lib/apply/drive.ts:30— drive.snapshot has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 4 (14 pts), boolean chains 7, if/else 1 (2 pts), loops 1 (nesting depth added 11). Most of this is not in the body itself: 0 of the 24 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 31, 32, 33). 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.
explore-ai.makeAiStreamParser (cognitive 24) web/src/lib/explore-ai.ts:56— explore-ai.makeAiStreamParser has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 2 (4 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.
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.
buildSalaryFilter (cognitive 24) REDACTED:949— 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 969, 950, 959, …). 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.
clauseBounds (cognitive 24) verify-cv-facts.mjs:621— 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.
installIndex (cognitive 24) plugins/h1b-sponsor/install-h1b-index.mjs:203— installIndex has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 4 (8 pts), boolean chains 7, error handling 5 (7 pts), if/else 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.
fetch (cognitive 24) providers/avature.mjs:188— fetch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, loops 2, ternaries 2 (nesting depth added 8). 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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
application-answers.main (cognitive 23) application-answers.mjs:511— 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:399— 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.
audit-portals.auditCompanies (cognitive 23) audit-portals.mjs:212— audit-portals.auditCompanies has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, ternaries 3 (5 pts), if/else 2 (4 pts), error handling 1 (3 pts), loops 1 (nesting depth added 6). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 224, 219, 258). 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-table-freshness.printSummary (cognitive 23) check-table-freshness.mjs:317— 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.
funnel-velocity.selfTest (cognitive 23) funnel-velocity.mjs:491— 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 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.
smartrecruiters.parseSmartRecruitersResponse (cognitive 23) providers/smartrecruiters.mjs:194— smartrecruiters.parseSmartRecruitersResponse has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 9, error handling 1 (2 pts), ternaries 2 (nesting depth added 5). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to one function literal inside it that branches (line 197). 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.
_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.
followup-seed.parseCliArgs (cognitive 23) followup-seed.mjs:701— followup-seed.parseCliArgs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (21 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.
generate-latex.validateLatexContent (cognitive 23) generate-latex.mjs:68— 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.
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.
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) providers/telegram-channel.mjs: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.reconcileGitignore (cognitive 23) REDACTED:3171— 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.
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 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.
ViewerModel.renderTableBlock (cognitive 23) dashboard/internal/ui/screens/viewer.go:418— 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.
requisitionIdsForDedup (cognitive 23) REDACTED:2195— requisitionIdsForDedup has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 5 (8 pts), boolean chains 3, 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.
rejectUserLayerPaths (cognitive 23) REDACTED:867— 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.
runHistorySeedScan (cognitive 23) scan-ats-full.mjs:717— runHistorySeedScan has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 4 (5 pts), loops 2, other 1, ternaries 1 (nesting depth added 7). Of this number, 12 points are the body's own statements and 11 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.
findUnarchivedApplications (cognitive 23) check-jd-archive.mjs:530— 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:785— 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 801, 830, 825, …). 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.
findUnclaimedEntries (cognitive 23) audit-portals.mjs:288— 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.
downloadAsset (cognitive 23) plugins/h1b-sponsor/install-h1b-index.mjs:144— downloadAsset has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 9). Most of this is not in the body itself: 0 of the 23 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 145, 165, 171, …). 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.
detect-reposts.loadAggregatorCompanies (cognitive 22) detect-reposts.mjs:212— 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:315— 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:103— 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.
verify-portals.parseAtsSlug (cognitive 22) REDACTED:175— 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.
jd-skill-gap.scanJd (cognitive 22) jd-skill-gap.mjs:239— jd-skill-gap.scanJd has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, 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.
plugin-audit.auditPlugin (cognitive 22) plugin-audit.mjs:95— 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.
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) REDACTED: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.
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.
route.GET (cognitive 22) web/src/app/api/cv-pdf/route.ts:32— route.GET has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), error handling 4 (8 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.
results-list.ResultsList (cognitive 22) web/src/components/explore/results-list.tsx:13— results-list.ResultsList has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 9 (13 pts), boolean chains 8, if/else 1 (nesting depth added 4). Of this number, 15 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.
weekly-digest.runSelfTest (cognitive 22) weekly-digest.mjs:418— 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 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.
PipelineModel.handleDiscardPicker (cognitive 22) dashboard/internal/ui/screens/pipeline.go:910— 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.
parseBlacklist (cognitive 22) REDACTED:2797— 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.
(anonymous) (cognitive 22) upskill.mjs:950— (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:131— 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:148— 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.
D2 · Cognitive Complexity· main (cognitive 22) · ×1
main (cognitive 22) hired-wall-build.mjs:207— main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, ternaries 3 (6 pts), other 1 (nesting depth added 6). Of this number, 21 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.
pickLocation (cognitive 22) providers/icims.mjs:223— pickLocation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 5, ternaries 2 (5 pts), loops 2 (3 pts), other 1 (nesting depth added 9). Of this number, 17 points are the body's own statements and 5 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.
company-funded.parseArgs (cognitive 21) REDACTED:103— 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.
invite-match.runSelfTest (cognitive 21) REDACTED:916— invite-match.runSelfTest has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 18, if/else 2, ternaries 1. Of this number, 19 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.
company-history.parseArgs (cognitive 21) company-history.mjs:123— company-history.parseArgs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 8, loops 1 (nesting depth added 2). Of this number, 16 points are the body's own statements and 5 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.
reply-matcher.getAppDomains (cognitive 21) reply-matcher.mjs:344— 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:151— 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 153, 169, 164, …). 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.
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.
reserve-report-num.runCli (cognitive 21) reserve-report-num.mjs:332— reserve-report-num.runCli has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, ternaries 2 (3 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-latex.compileLatexFile (cognitive 21) generate-latex.mjs:144— generate-latex.compileLatexFile has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 3 (5 pts), loops 1 (2 pts), 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, 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.
history-ats-seeds.atsBoardUrlOf (cognitive 21) history-ats-seeds.mjs:21— 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.
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) providers/peoplesoft.mjs: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:154— 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.
cli.main (cognitive 21) scaffolder/bin/cli.mjs:87— cli.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, boolean chains 4, ternaries 3 (4 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.
tracker-table.parseApplications (cognitive 21) web/src/lib/tracker-table.mjs:168— 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 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.
update-system.localUserPaths (cognitive 21) REDACTED:611— update-system.localUserPaths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 9). Of this number, 19 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.
update-system.revertPaths (cognitive 21) REDACTED:2233— update-system.revertPaths has cognitive complexity 21 (threshold 15). Drivers by points: error handling 4 (11 pts), if/else 2 (4 pts), ternaries 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.
upskill.analyze (cognitive 21) upskill.mjs:435— upskill.analyze has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 9). 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.
config-form.ConfigForm (cognitive 21) web/src/components/config-form.tsx:38— config-form.ConfigForm has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, ternaries 4, error handling 1 (nesting depth added 4). Most of this is not in the body itself: 8 of the 21 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.
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 literals inside it that branch (lines 54, 153, 88, …). 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.
buildContentFilter (cognitive 21) REDACTED:752— 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 768, 778, 753, …). 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) generate-pdf.mjs:691— 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.
computeRunStats (cognitive 21) stats.mjs:581— 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.
seedFollowup (cognitive 21) followup-seed.mjs:543— seedFollowup has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, other 3, ternaries 2 (3 pts) (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.
makeGuardedFetch (cognitive 21) plugins/_engine.mjs:384— 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). Most of this is not in the body itself: 0 of the 21 points are its own statements and the rest belongs to 6 function items inside it that branch (guardedFetch, hostOk, isLoopbackHost, …). 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.
extractTrackerReportNumbers (cognitive 21) tracker-parse.mjs:428— extractTrackerReportNumbers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, ternaries 2, loops 1, other 1 (nesting depth added 5). Of this number, 15 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.
createHeadedPageProvider (cognitive 21) liveness-browser.mjs:464— createHeadedPageProvider has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, error handling 3 (6 pts) (nesting depth added 4). Most of this is not in the body itself: 0 of the 21 points are its own statements and the rest belongs to 3 function items inside it that branch (get, isCachedPageUsable, close). 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.
parseListingPage (cognitive 21) providers/itviec.mjs:179— parseListingPage has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 3 (7 pts), loops 3 (4 pts), boolean chains 1, other 1 (nesting depth added 9). 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.
company-history.runSelfTest (cognitive 20) company-history.mjs:1038— 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 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.
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.
generate-pdf.extractSectionBlocks (cognitive 20) generate-pdf.mjs:901— 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.
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.
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 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.
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.
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.
story-provenance-check.classifyStoryBank (cognitive 20) story-provenance-check.mjs:452— story-provenance-check.classifyStoryBank has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 11). 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, split the body into named stages: move each independent 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 20) REDACTED:1431— update-system.loadConfiguredTemplateVariants has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 5, 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.rollback (cognitive 20) REDACTED:3943— update-system.rollback has cognitive complexity 20 (threshold 15). Drivers by points: error handling 5 (10 pts), if/else 4 (6 pts), ternaries 1 (3 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.
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.
pipeline-table.parseInbox (cognitive 20) web/src/lib/pipeline-table.mjs:48— pipeline-table.parseInbox has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (5 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.
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.
data.LoadPDFEntriesByPath (cognitive 20) dashboard/internal/data/pdf.go:80— data.LoadPDFEntriesByPath has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 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.
data.LoadPDFManifest (cognitive 20) dashboard/internal/data/pdf.go:124— data.LoadPDFManifest has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 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.
PipelineModel.overlayDiscardPicker (cognitive 20) dashboard/internal/ui/screens/pipeline.go:2323— 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.
main.main (cognitive 20) dashboard/main.go:345— main.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 1 (nesting depth added 7). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fuzzyTierMatch (cognitive 20) merge-tracker.mjs:1619— fuzzyTierMatch has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, 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.
buildNoResponseFrictionSignals (cognitive 20) company-history.mjs:901— 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.
computeFunnelWithHistory (cognitive 20) stats.mjs:227— computeFunnelWithHistory has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 3, ternaries 1 (2 pts) (nesting depth added 6). 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.
diffAgainstBaseline (cognitive 20) audit-portals.mjs:183— 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.
auditCompanies::worker (cognitive 20) audit-portals.mjs:224— 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.
gcStaleReportReservations (cognitive 20) reserve-report-num.mjs:292— 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.
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.
workable.parseWorkableMarkdown (cognitive 19) providers/workable.mjs:275— 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.
reserve-report-num.reserveReportNumbers (cognitive 19) reserve-report-num.mjs:201— 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.
generate-pdf.reorderCvSections (cognitive 19) generate-pdf.mjs:977— 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 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.
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 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.
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:108— 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.
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.
skill-entrypoints.ensureSkillEntrypoints (cognitive 19) scaffolder/bin/skill-entrypoints.mjs:86— 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.
update-system.snapshotConfiguredTemplateVariants (cognitive 19) REDACTED:1501— update-system.snapshotConfiguredTemplateVariants has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (5 pts), error handling 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). Of this number, 16 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.
route.POST (cognitive 19) web/src/app/api/followups/log/route.ts:30— route.POST has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, error handling 2, 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 73). 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.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.
triage-row.TriageRow (cognitive 19) web/src/components/inbox/triage-row.tsx:26— triage-row.TriageRow has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (12 pts), boolean chains 7 (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.
session.enrichFromAts (cognitive 19) web/src/lib/apply/session.ts:93— 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.
PipelineModel.renderAppLine (cognitive 19) dashboard/internal/ui/screens/pipeline.go:1794— 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.
buildTitleFilterOverrides (cognitive 19) REDACTED:203— 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.
buildRow (cognitive 19) merge-tracker.mjs:639— buildRow has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 1 (2 pts), other 1 (nesting depth added 4). Of this number, 16 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.
parseCompanyInput::add (cognitive 19) discover-ats.mjs:186— 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.
mapTrackerCaptureLinks (cognitive 19) check-jd-archive.mjs:376— mapTrackerCaptureLinks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2, error handling 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.
query (cognitive 19) tracker.mjs:659— query has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (nesting depth added 4). 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: 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.
detectReposts (cognitive 19) detect-reposts.mjs:313— 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:652— 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.
validateEvaluationShape (cognitive 19) REDACTED:300— 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:329— 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.
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.
add-entry.main (cognitive 18) add-entry.mjs:219— 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.
analyze-patterns.buildPredictedDiscardReasonSignals (cognitive 18) analyze-patterns.mjs:1162— analyze-patterns.buildPredictedDiscardReasonSignals has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 6). 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 into named stages: move each independent 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:350— 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 377, 353). 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:465— 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 488, 468). 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 (cognitive 18) build-cv-html.mjs:773— build-cv-html.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6, 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.
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.
check-jd-archive.classifyReportsByTrackerState (cognitive 18) check-jd-archive.mjs:312— 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.
check-table-freshness.runSelfTest (cognitive 18) check-table-freshness.mjs:360— 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 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.
reply-matcher.checkRoleMatch (cognitive 18) reply-matcher.mjs:202— 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.
_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.
scan.buildLocationFilter (cognitive 18) REDACTED:516— scan.buildLocationFilter has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 8, ternaries 1. 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 536, 544). 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.
doctor.onboardingState (cognitive 18) doctor.mjs:842— doctor.onboardingState has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (7 pts), boolean chains 4, 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.
generate-cover-letter.main (cognitive 18) generate-cover-letter.mjs:313— generate-cover-letter.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, boolean chains 3, error handling 2 (3 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 3). 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.
mjs-files.collectMjsFiles (cognitive 18) lib/mjs-files.mjs:131— mjs-files.collectMjsFiles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 7). Most of this is not in the body itself: 0 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 152). 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.
merge-tracker.sortTrackerRowsInPlace (cognitive 18) merge-tracker.mjs:1183— merge-tracker.sortTrackerRowsInPlace has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (4 pts), loops 3, boolean chains 2 (nesting depth added 4). Of this number, 10 points are the body's own statements and 8 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.
negotiation-roi.analyze (cognitive 18) negotiation-roi.mjs:325— negotiation-roi.analyze has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (6 pts), 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.
check.main (cognitive 18) plugins/h1b-sponsor/check.mjs:242— 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 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.
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.
comeet.parseComeetResponse (cognitive 18) providers/comeet.mjs:115— comeet.parseComeetResponse has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, ternaries 6, if/else 2 (3 pts), error handling 1 (2 pts) (nesting depth added 2). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 118, 149). 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.
feishu-jobs.parseFeishuJobsResponse (cognitive 18) providers/feishu-jobs.mjs:83— 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.
radancy.parseLegacyResults (cognitive 18) REDACTED:204— radancy.parseLegacyResults has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (4 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.
salary-gap.collectSources (cognitive 18) REDACTED:611— salary-gap.collectSources has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 1 (3 pts), loops 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.
tracker.exportMd (cognitive 18) tracker.mjs:836— 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.
tracker-sync-check.buildSyncReport (cognitive 18) tracker-sync-check.mjs:411— 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.
update-system.checkStatus (cognitive 18) REDACTED:2910— 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.
today-dashboard.TodayDashboard (cognitive 18) web/src/components/home/today-dashboard.tsx:23— today-dashboard.TodayDashboard has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, ternaries 6. Of this number, 15 points are the body's own statements and 3 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.
worker-card.WorkerCard (cognitive 18) web/src/components/jobs/worker-card.tsx:78— worker-card.WorkerCard has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, ternaries 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.
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.
data.appendNotesInLine (cognitive 18) REDACTED:821— data.appendNotesInLine has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 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.
runAdd (cognitive 18) REDACTED:770— 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.
fetch (cognitive 18) providers/eightfold.mjs:269— fetch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, ternaries 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.
tracker-parse.markdownLinkDestination (cognitive 17) tracker-parse.mjs:353— 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.
cli-flags.validateFlags (cognitive 17) lib/cli-flags.mjs:106— cli-flags.validateFlags has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts), ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 122, 148, 116). 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.reviewFact (cognitive 17) career-profile.mjs:197— 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.
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:565— 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.
_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.
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.
reserve-report-num.occupiedFromFailedBatchState (cognitive 17) reserve-report-num.mjs:71— 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.
verify-cv-facts.delegatedAuthorshipClaims (cognitive 17) verify-cv-facts.mjs:494— 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) verify-cv-facts.mjs:1018— 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.
history-ats-seeds.parseTrackerAtsSeeds (cognitive 17) history-ats-seeds.mjs:94— 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.
keyword-match.extractKeywords (cognitive 17) keyword-match.mjs:175— keyword-match.extractKeywords has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 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.
match-star.parseStories (cognitive 17) REDACTED:47— match-star.parseStories has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), boolean chains 6, if/else 1 (2 pts), loops 1 (nesting depth added 5). 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, split the body into named stages: move each independent 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.loadFailedReportNumbers (cognitive 17) merge-tracker.mjs:81— merge-tracker.loadFailedReportNumbers 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:387— 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.
_notion.createNotionClient (cognitive 17) plugins/notion/_notion.mjs:66— _notion.createNotionClient has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 3 (4 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 4). 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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
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 literals inside it that branch (lines 53, 46). 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.
mokahr.parseMokaHrJobs (cognitive 17) providers/mokahr.mjs: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.
radancy.parseModernResults (cognitive 17) REDACTED:257— 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) providers/telegram-channel.mjs: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.
scan.runDiscovery (cognitive 17) web/src/lib/core/scan.ts:382— 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.
weekly-digest.extractGapsByCompany (cognitive 17) weekly-digest.mjs:210— 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.
parseHeadedAddition (cognitive 17) merge-tracker.mjs:852— parseHeadedAddition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 2, other 2, ternaries 2 (nesting depth added 1). Of this number, 12 points are the body's own statements and 5 belong to 8 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.
parseFollowups (cognitive 17) followup-cadence.mjs:463— 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:853— 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:745— 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.
resolveTenant (cognitive 17) providers/eightfold.mjs:101— 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.
_registry.resolveProvider (cognitive 16) providers/_registry.mjs:65— _registry.resolveProvider has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (4 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.
build-cv-html.prepareCandidatePhoto (cognitive 16) build-cv-html.mjs:117— build-cv-html.prepareCandidatePhoto has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 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.
company-funded.renderReport (cognitive 16) REDACTED:849— 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:905— 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.
funnel-velocity.foldObservations (cognitive 16) funnel-velocity.mjs:160— funnel-velocity.foldObservations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (5 pts), loops 2 (nesting depth added 8). Of this number, 11 points are the body's own statements and 5 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.
workable.parseWorkableWidget (cognitive 16) providers/workable.mjs:233— workable.parseWorkableWidget has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, ternaries 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.
_engine.mergeProviderPlugins (cognitive 16) plugins/_engine.mjs:705— _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.
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.
intake.extractAll (cognitive 16) intake.mjs:263— 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 266). 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 literals inside it that branch (lines 380, 404). 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.
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:61— 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:143— 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) REDACTED: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:113— 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.
pipeline-sankey.classifyLeaf (cognitive 16) web/src/lib/pipeline-sankey.mjs:137— pipeline-sankey.classifyLeaf has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 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.
portals-config.loadPortalsDocument (cognitive 16) web/src/lib/portals-config.mjs:36— 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.
screens.findInlineMatch (cognitive 16) dashboard/internal/ui/screens/viewer.go:564— 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 566, 592, 580). 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.
StatsModel.renderPay (cognitive 16) dashboard/internal/ui/screens/stats.go:567— 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.
syncIndex (cognitive 16) tracker.mjs:551— syncIndex has cognitive complexity 16 (threshold 15). Drivers by points: other 6, ternaries 2 (4 pts), if/else 2 (3 pts), loops 2, error handling 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.
normalizeListing (cognitive 16) browser-extract.mjs:633— 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:792— 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.
checkLivenessViaApi (cognitive 16) liveness-api.mjs:430— checkLivenessViaApi has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, error handling 2, 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.
ClassTooLong: PipelineModel dashboard/internal/ui/screens/pipeline.go:270— ClassTooLong — 1268 significant lines (blank, comment-only and punctuation-only lines excluded), 58 methods, 57 blocks, lines 259-2373. The bar is 400 significant lines; this is 868 over it, 3.17× 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.
TooManyMethods: PipelineModel dashboard/internal/ui/screens/pipeline.go:270— TooManyMethods — 58 methods. The bar is 30 methods; this is 28 over it, 1.93× 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.
D30 · Dependency Vulnerabilities· Medium vulnerability · ×1
Change coupling: _types.js ↔ REDACTED providers/_types.js— `providers/_types.js` and `REDACTED` change together 57% of the time (8 of the 14 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 `5c26e4af` fix(scan-ats-full): collapse a Workday requisition served under sever…; `ba836064` feat(portals): probe non-ATS boards through the provider layer (#1529); `ef07461a` feat(scan): add early trust validation and job trust metadata (#985) — run `git show` on any of them.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (4 members, 50+ identical tokens) dashboard/internal/ui/screens/pipeline.go:2032— dashboard/internal/ui/screens/pipeline.go:2032-2104 | dashboard/internal/ui/screens/progress.go:377-400 | dashboard/internal/ui/screens/stats.go:652-675 | dashboard/internal/ui/screens/viewer.go:703-733 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (30–31 lines × 2) REDACTED:383— REDACTED:383-412 | REDACTED:469-499 — 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:383` 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:250-273 — 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:2108— dashboard/internal/ui/screens/pipeline.go:2108-2134 | dashboard/internal/ui/screens/viewer.go:769-794 — 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 (19–20 lines × 2) dashboard/internal/ui/screens/pipeline.go:502— dashboard/internal/ui/screens/pipeline.go:502-520 | dashboard/internal/ui/screens/pipeline.go:993-1012 — 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:502` 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 (17–18 lines × 2) dashboard/internal/data/pdf.go:82— dashboard/internal/data/pdf.go:82-98 | dashboard/internal/data/pdf.go:126-143 — 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:82` 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:99` calls `isSafeRepoRelativePath` and `dashboard/internal/data/pdf.go:144` 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–14 lines × 2) REDACTED:238— REDACTED:238-249 | REDACTED:324-337 — 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:238` 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.
Duplicated block (12 lines × 2) dashboard/internal/data/pdf.go:102— dashboard/internal/data/pdf.go:102-113 | dashboard/internal/data/pdf.go:144-155 — 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 (8–10 lines × 2) dashboard/internal/ui/screens/pipeline.go:2187— dashboard/internal/ui/screens/pipeline.go:2187-2196 | dashboard/internal/ui/screens/pipeline.go:2324-2331 — 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:380— dashboard/internal/ui/screens/progress.go:380-389 | dashboard/internal/ui/screens/stats.go:655-664 — 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 × 4) dashboard/internal/ui/screens/pipeline.go:2033— dashboard/internal/ui/screens/pipeline.go:2033-2040 | dashboard/internal/ui/screens/progress.go:378-385 | dashboard/internal/ui/screens/stats.go:653-660 | dashboard/internal/ui/screens/viewer.go:704-711 — 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 4 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:226-232 | dashboard/internal/ui/screens/progress.go:329-335 — 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:276-281 | dashboard/internal/ui/screens/viewer.go:228-233 — 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:429— dashboard/internal/ui/screens/stats.go:429-433 | dashboard/internal/ui/screens/stats.go:503-507 | dashboard/internal/ui/screens/stats.go:568-572 — 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:332— REDACTED:332-338 | REDACTED:369-375 — 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.
No structured logging — No logging call was found in the 533 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 15 sibling directories (16 clone groups) web/src/app/api/assistant/route.ts:93— 16 duplicated blocks under web/src/app/api/ have copies in at least two of the sibling directories apply, assistant, cover-pdf, cv, cv-pdf, doctor (+9 more sibling(s) not listed) — 14 of them are reported below, and 2 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 16 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 16 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 16 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 (7 clone groups) web/src/components/apply/apply-provider.tsx:360— 7 duplicated blocks under web/src/components/ have copies in at least two of the sibling directories apply, beta, cv, explore, followups, home (+2 more sibling(s) not listed) — 3 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 7 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 7 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 7 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 (6 clone groups) web/src/app/api/tracker/delete/route.ts:73— 6 duplicated blocks under web/src/ have copies in at least two of the sibling directories app, components, lib — 4 of them are reported below, and 2 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 6 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 6 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 6 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 (5 clone groups) lib/ascii-fold.mjs:54— 5 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) — 4 of them are reported below, and 1 is 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 5 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 5 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 5 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.
R10 · Code Duplication· Duplicated block with local edits (237 matched lines × 2 locations) · ×1
Duplicated block with local edits (237 matched lines × 2 locations) REDACTED:41— REDACTED:41 · REDACTED:47 — the two spans are one implementation copied and then locally edited — 1732 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 (75 matched lines × 2 locations) · ×1
Duplicated block with local edits (75 matched lines × 2 locations) REDACTED:178— REDACTED:178 · openai-tailor.mjs:129 — the two spans are one implementation copied and then locally edited — 475 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 (68 matched lines × 2 locations) · ×1
Duplicated block with local edits (68 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 — 508 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 (66 matched lines × 2 locations) · ×1
Duplicated block with local edits (66 matched lines × 2 locations) web/src/app/api/assistant/route.ts:93— web/src/app/api/assistant/route.ts:93 · web/src/app/api/cv/ingest/route.ts:109 — the two spans are one implementation copied and then locally edited — 410 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:31 — 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 (54 matched lines × 2 locations) · ×1
Duplicated block with local edits (54 matched lines × 2 locations) providers/feishu-jobs.mjs:86— providers/feishu-jobs.mjs:86 · providers/mokahr.mjs:173 — the two spans are one implementation copied and then locally edited — 345 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) · ×1
Duplicated block with local edits (48 matched lines × 2 locations) build-cv-html.mjs:1185— build-cv-html.mjs:1185 · 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 (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.
Duplicated block (46 lines × 2 locations) providers/pinpoint.mjs:22— providers/pinpoint.mjs:22 · providers/recruitee.mjs: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.
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.
Duplicated block (44 lines × 2 locations) analyze-patterns.mjs:777— analyze-patterns.mjs:777 · upskill.mjs:672 — 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.
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 — 315 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.
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 (39 matched lines × 2 locations) · ×1
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.
R10 · Code Duplication· Duplicated block with local edits (38 matched lines × 2 locations) · ×1
Duplicated block with local edits (38 matched lines × 2 locations) REDACTED:251— REDACTED:251 · providers/rheinmetall.mjs:56 — the two spans are one implementation copied and then locally edited — 253 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) · ×1
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 (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.
R10 · Code Duplication· Duplicated block with local edits (32 matched lines × 2 locations) · ×1
Duplicated block with local edits (32 matched lines × 2 locations) providers/breezy.mjs:52— providers/breezy.mjs:52 · providers/prevueaps.mjs:143 — the two spans are one implementation copied and then locally edited — 216 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 (31 lines × 2 locations) REDACTED:42— REDACTED:42 · REDACTED:50 — 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.
Duplicated block (28 lines × 2 locations) web/src/components/app-shell.tsx:36— web/src/components/app-shell.tsx:36 · web/src/components/mobile-nav.tsx:149 — 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.
Duplicated block (27 lines × 2 locations) scan-dayforce.mjs:592— scan-dayforce.mjs:592 · scan-interamt.mjs:366 — 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.
Duplicated block (26 lines × 2 locations) providers/mycareersfuture.mjs:186— providers/mycareersfuture.mjs:186 · providers/vdab.mjs:263 — 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 (24 lines × 2 locations) build-cv-html.mjs:1118— build-cv-html.mjs:1118 · build-cv-latex.mjs:337 — 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.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 134, cognitive 176) · ×1
Complex function main (cyclomatic 134, cognitive 176) REDACTED:3268— main has cyclomatic complexity 134 and cognitive complexity 176; 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 111, cognitive 135) analyze-patterns.mjs:421— runSelfTest has cyclomatic complexity 111 and cognitive complexity 135; 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 90, cognitive 132) · ×1
Complex function main (cyclomatic 90, cognitive 132) scan-ats-full.mjs:903— main has cyclomatic complexity 90 and cognitive complexity 132; 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:853— 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 apply (cyclomatic 78, cognitive 127) REDACTED:3276— apply has cyclomatic complexity 78 and cognitive complexity 127; 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 61, cognitive 76) upskill.mjs:552— runSelfTest has cyclomatic complexity 61 and cognitive complexity 76; 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:954— 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 validateManifest (cyclomatic 49, cognitive 54) plugins/_engine.mjs:152— validateManifest has cyclomatic complexity 49 and cognitive complexity 54; 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 driveSession (cyclomatic 46, cognitive 82) web/src/lib/apply/drive.ts:131— driveSession has cyclomatic complexity 46 and cognitive complexity 82; 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 45, cognitive 50) build-cv-latex.mjs:288— runSelfTest has cyclomatic complexity 45 and cognitive complexity 50; 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 (anonymous) (cyclomatic 43, cognitive 82) web/src/components/explore/explore-provider.tsx:157— (anonymous) has cyclomatic complexity 43 and cognitive complexity 82; 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 43, cognitive 54) REDACTED:228— fold has cyclomatic complexity 43 and cognitive complexity 54; 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 fetch (cyclomatic 42, cognitive 88) REDACTED:310— fetch has cyclomatic complexity 42 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.
Complex function generatePDF (cyclomatic 42, cognitive 51) generate-pdf.mjs:1367— generatePDF has cyclomatic complexity 42 and cognitive complexity 51; 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 normalizeProfile (cyclomatic 42, cognitive 32) scripts/export-ats-text.mjs:164— normalizeProfile has cyclomatic complexity 42 and cognitive complexity 32; 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 codeMask (cyclomatic 41, cognitive 95) tests/local-today-gates.test.mjs:381— codeMask has cyclomatic complexity 41 and cognitive complexity 95; 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 41, cognitive 86) REDACTED:1861— locallyModifiedSystemFiles has cyclomatic complexity 41 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 parseCvMarkdown (cyclomatic 41, cognitive 85) scripts/export-ats-text.mjs:32— parseCvMarkdown has cyclomatic complexity 41 and cognitive complexity 85; 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 fetch (cyclomatic 39, cognitive 62) providers/peoplesoft.mjs:776— fetch has cyclomatic complexity 39 and cognitive complexity 62; 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.
Large Files — 87 file(s) over 400 lines (counted as significant lines — blank lines excluded — over production source only, tests excluded), largest first: REDACTED (3924), REDACTED (3802), generate-pdf.mjs (1985), merge-tracker.mjs (1854), company-history.mjs (1655), analyze-patterns.mjs (1619) (+81 more).
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/profile-input-validation.test.mjs— This repository declares test tooling, and the ✓ above records that declaration — but web/tests/lib/profile-input-validation.test.mjs and 1 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) providers/peoplesoft.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 (~511 LoC) REDACTED— no import path from any entry point (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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) providers/telegram-channel.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (~433 LoC) providers/successfactors.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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) providers/mokahr.mjs— no import path from any entry point (222 application, 125 tooling, 570 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) REDACTED— no import path from any entry point (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (~272 LoC) providers/phenom.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 (~265 LoC) providers/arbeitsagentur.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (~258 LoC) providers/jobstreet.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (~247 LoC) REDACTED— no import path from any entry point (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (~233 LoC) providers/torre.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (222 application, 125 tooling, 570 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 (~214 LoC) providers/a16z-speedrun-talent.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 (~211 LoC) providers/yourator.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 (~209 LoC) providers/consider.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 (~202 LoC) providers/schoolspring.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 (~199 LoC) providers/feishu-jobs.mjs— no import path from any entry point (222 application, 125 tooling, 570 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 url-key.mjs:87— `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 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 REDACTED:72— `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 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 check-jd-archive.mjs:538— `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 followup-cadence.mjs:84— `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 REDACTED:450— `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:1172— `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:1200— `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 theme-style.mjs:53— `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:90— `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 history-ats-seeds.mjs:134— `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 openrouter-runner.mjs:100— `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/_profile-keywords.mjs:64— `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/agentic-jobs.mjs:67— `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/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 REDACTED:73— `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 providers/himalayas.mjs:41— `cleanHimalayasUrl` 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:149— `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 REDACTED:81— `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 providers/jobstreet.mjs:102— `deriveOrigin` swallows every exception into `return 'https://id.jobstreet.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/landingjobs.mjs:53— `companyFromUrl` 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:84— `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 providers/local-parser.mjs:128— `normalizeJobUrl` 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 web/src/app/api/followups/cadence/route.ts:20— `!!v && typeof v === "object" && !Array.isArray(v)` appears character-identically in 2 files — web/src/app/api/followups/cadence/route.ts, web/src/app/api/profile/route.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/icims.mjs:205— `!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 lib/cv-payload-schema.mjs:153— `!entry || typeof entry !== 'object' || Array.isArray(entry)` appears character-identically in 2 files — 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 analyze-patterns.mjs:315— `!parsed || typeof parsed !== 'object' || Array.isArray(parsed)` appears character-identically in 2 files — analyze-patterns.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 analyze-patterns.mjs:875— `!repoRelative.startsWith('reports/') || repoRelative.includes('..')` appears character-identically in 2 files — analyze-patterns.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 web/src/lib/portals-config.mjs:23— `!value || typeof value !== "object" || Array.isArray(value)` appears character-identically in 2 files — web/src/lib/portals-config.mjs, web/src/lib/profile-patch.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/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:18— `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 check-liveness.mjs:51— `Number(throttleArg.split('=')[1]) || 5000` appears character-identically in 2 files — check-liveness.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/phenom.mjs:100— `String(title) .normalize('NFKD') .replace(/[̀-ͯ]/g, '') .replace(/[^a-zA-Z0-9]+/g, '-') .replace(/^-+|-+$/g, '') || 'job'` appears character-identically in 2 files — providers/phenom.mjs, providers/tkms.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:136— `VALUE_FLAGS.includes(a) && args[idx + 1] !== undefined && !args[idx + 1].startsWith('--')` appears character-identically in 2 files — company-history.mjs, discover-ats.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 check-liveness.mjs:50— `a === '--throttle' || a.startsWith('--throttle=')` appears character-identically in 2 files — check-liveness.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 find.mjs:152— `a.startsWith('-') && !KNOWN_FLAGS.includes(a)` appears character-identically in 3 files — find.mjs, jd-similarity.mjs, plugin-audit.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:142— `a.startsWith('-') && !consumedValueIndices.has(idx) && !KNOWN_FLAGS.includes(a.split('=')[0])` appears character-identically in 2 files — company-history.mjs, discover-ats.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 assessment-log.mjs:293— `args.includes('--help') || args.includes('-h')` appears character-identically in 16 files — assessment-log.mjs, check-jd-archive.mjs, check-liveness.mjs, company-history.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:776— `args.length === 0 || args.includes('--help')` 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 archive-posting.mjs:127— `args[i + 1] === undefined || args[i + 1].startsWith('--')` appears character-identically in 2 files — archive-posting.mjs, discover-new-companies.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/_registry.mjs:28— `f.endsWith('.mjs') && !f.startsWith('_')` appears character-identically in 2 files — providers/_registry.mjs, validate-portals.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/consider.mjs:71— `host.endsWith('.local') || host.endsWith('.internal')` appears character-identically in 2 files — providers/consider.mjs, providers/eploy.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/consider.mjs:68— `host.startsWith('[') || host.includes(':')` appears character-identically in 2 files — providers/consider.mjs, providers/eploy.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/_trust-validator.mjs:100— `hostname === domain || hostname.endsWith('.' + domain)` appears character-identically in 2 files — providers/_trust-validator.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 discover-ats.mjs:1020— `idx !== -1 && args[idx + 1] && !args[idx + 1].startsWith('--')` appears character-identically in 2 files — discover-ats.mjs, scan-ats-full.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/remotive.mjs:32— `j && typeof j === 'object' && typeof j.title === 'string' && j.title.trim() !== '' && typeof j.url === 'string' && /^https?:\/\//i.test(j.ur…` appears character-identically in 2 files — providers/remotive.mjs, providers/workingnomads.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/4dayweek.mjs:108— `j.company && typeof j.company === 'object' && typeof j.company.name === 'string' && j.company.name.trim()` appears character-identically in 2 files — providers/4dayweek.mjs, providers/thehub.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/career-ops.ts:566— `parsed && typeof parsed === "object" && !Array.isArray(parsed)` appears character-identically in 2 files — web/src/lib/career-ops.ts, web/src/lib/status-cli.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.
Silent fallback default on error REDACTED:55— `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:232— `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:274— `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:1075— `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.
Silent fallback default on error dashboard/main.go:321— `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.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 12 significant file(s) lose their only recent owner: hired-wall-build.mjs, web/src/components/beta/beta-banner.tsx, plugins/apify/index.mjs, web/src/components/explore/first-score-view.tsx, web/src/components/portals-view.tsx, web/src/lib/report/report.ts, web/src/components/inbox/shortlist-tray.tsx, web/src/lib/core/followups-lock.ts (+4 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 7 significant file(s) lose their only recent owner: REDACTED, web/src/lib/status-alias.mjs, REDACTED, lib/outcome-types.mjs, lib/ascii-fold.mjs, lib/outcome-dir.mjs, web/src/lib/whats-new-suppression.mjs. Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #3 — If anonymized user #3 becomes unavailable, 6 significant file(s) lose their only recent owner: web/src/lib/cli-fencing.mjs, web/src/lib/claude-invocation.mjs, REDACTED, web/src/app/api/cv/ingest/route.ts, web/src/lib/worker-capabilities.mjs, web/src/app/api/apply/prefill/route.ts. Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #4 — If anonymized user #4 becomes unavailable, 5 significant file(s) lose their only recent owner: jd-capture.mjs, web/src/lib/apply/cv-match.mjs, web/src/lib/explore-error.mjs, web/src/lib/job-error-hint.mjs, web/src/lib/core/followup-view.mjs. Pair on, review, or document these before any departure.
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:119— 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.
Documentation: no project overview README.md— The opening paragraph ('Months of sending CVs into silence.') gives a strong hook but does not state what the project is or what it does for readers who skim it. State the purpose (AI-powered job search pipeline) and the value proposition (zero-auth portal scanner, batch processing, TUI dashboard) in one sentence above the opening hook.
Documentation: no licence statement README.md— The root README claims MIT license but no licence statement appears in the visible portion. Add a Licence section citing the MIT license and the author.
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:564— `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.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 22 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 (60 single-owned of 423 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; 423 of the 532 production source files in this repository met that bar). They are anonymized user #5 (2 file(s)), anonymized user #6 (2 file(s)), anonymized user #7 (2 file(s)), anonymized user #8 (2 file(s)), anonymized user #9 (2 file(s)), anonymized user #10 (2 file(s)) (+16 more) — spread or document their files in the same way, at lower priority than the named off-boarding risks above.
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/`.
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.
P4 · Deployment & Rollback· No rollback/health safety · ×1
No rollback/health safety — Deployment is orchestrated by compose, but no service declares a `healthcheck:` and nothing pins a previous image to fall back to — the runtime can tell that the container is up, not that it is serving, so a bad release is harder to detect and reverse.
Skipped (documented): the web agrees with the CLI about the sheet tests/page-format.test.mjs:124— 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:337— 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 18 file(s) — `.github/scripts/triage.bundle.mjs`, `build-cv-html.mjs`, `check-jd-archive.mjs`, `cv-sections-core.mjs`, `REDACTED`, … (+13 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 01a0f80a-2c52-7817-893c-7e2f4c154e8d · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 72 · Warnings: 1323 · Recommendations: 83 · Info: 5 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 01-10-2026 @ 15:16 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.