Public report of Graphify-Labs/graphify, published 25 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 25 October 2026, 00:05 UTC · Survey ID cd_2e97cc6f847a41debbdaeaf49a2a19fa
Graphify-Labs/graphify
Measured 25 October 2026, 00:00 UTC, at code version 92741d1
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
Code coverage is not measured: No coverage collector is wired up.
CAI scoreAt riskDown 6 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A medium codebase: 83,962 lines of product code in 2 projects, tests not counted · Estimated rebuild effort: about 1.3 person-years · Weakest lens: Security and Compliance, 42
Findings by how serious they are
34 critical924 serious61 minor
31 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
25 October 2026, 00:00 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
49of 54 dimensions measured by tools. The other 5 are advisory notes from an AI model, which explain the code but don't count towards the score.
1003of 1019 findings point to an exact file and line, so you can open each one in the code. The other 16 concern the repository as a whole, such as missing documentation.
54dimensions across 7 lenses, read from 83,962 lines of product code in 2 projects.
Graphify-Labs/graphify scores 50 out of 100, but it is rated At risk while a critical security finding is open; the score itself is unchanged.
The weakest lens counts most in the score, and here that is Security and Compliance, which scores 42 and is rated Weak. Its Access Controls dimension scores 0 out of 10, and until that reaches 4, Security and Compliance can't be rated higher than Adequate. The first actions are to protect endpoints by default-deny: a global authentication guard or middleware with explicit public opt-outs, or a guard on every route, plus named role/permission rules for what an authenticated caller may do and to resolve the 7 High CVE finding(s) in Dependency Vulnerabilities, and if Security and Compliance rose to 70, the score would rise from 50 to about 56.
34 findings are critical: 20 in Static Analysis (SAST), 11 in Dependency Vulnerabilities, two in Secrets (history) and one in Forms & labels.
Watchdog couldn't measure 30 dimensions in this code, among them Navigability, IL Efficiency and Data Protection, so they are left out of the score. The product code is 83,962 lines, which would take an estimated 1.3 person-years, around €190,000, to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Security and Compliance rose from 42 to 70, the lowest score rated Strong, the score would rise from 50 to about 56.
Code composition: what the lines of code are
Product code 42%Tests 58%
New since the last survey: 143 findings
These 143 critical or serious findings weren't in the previous survey, on 10 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 50 findings
These 50 critical or serious findings were in the previous survey, on 10 October 2026, and are gone from this one.
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Supply-chain Provenance & Signing · REDACTED
Rebuild cost: about €190,000 · Estimate
Cost to rebuild
€62,000 to €310,000, for 1,034 to 3,279 hours of work, about 1.3 person-years for 1 to 3 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.7 at a score of 50. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Medium: 83,962 lines of product code
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Protect endpoints by default-deny: a global authentication guard or middleware with explicit public opt-outs, or a guard on every route, plus named role/permission rules for what an authenticated caller may do.
Raises the score by about 7 points · Medium effort · Access Controls
2
Resolve the 7 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (7).
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €190,000 to build again, about 1.3 person-years of work. Its weakest lens is Security and Compliance, at 42 (Weak). Security and Compliance is about how well the product is protected, and how it handles personal data. Because the weakest lens counts most in the score, work on Security and Compliance also moves the score most.
Based on: the rebuild estimate · the Security and Compliance grade · how much each lens counts
What to do: Start with the Security and Compliance actions in Top priorities.
If you do one thing first · First action
Protect endpoints by default-deny: a global authentication guard or middleware with explicit public opt-outs, or a guard on every route, plus named role/permission rules for what an authenticated caller may do. Of all the actions in this report, it raises the score most for the work it takes: about 7 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.7 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 6% to 13% on every change. The history of the code shows how much it changes: about 172,981 lines over the last 90 days, which is about 701,534 lines a year. At that pace, the extra work comes to an estimated 102.4 to 614.1 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
37 modules, with 10 dependencies between them. Every module uses only modules listed above it, so there are no loops.
Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
graphify uses graphify.extractors.models, so a change to graphify.extractors.models can break graphify, while a change to graphify can't break graphify.extractors.models.
Position
Below the diagonal: graphify uses a module listed above it, which is the healthy direction.
graphify uses graphify.multigraph_compat, so a change to graphify.multigraph_compat can break graphify, while a change to graphify can't break graphify.multigraph_compat.
Position
Below the diagonal: graphify uses a module listed above it, which is the healthy direction.
graphify uses graphify.resolver_registry, so a change to graphify.resolver_registry can break graphify, while a change to graphify can't break graphify.resolver_registry.
Position
Below the diagonal: graphify uses a module listed above it, which is the healthy direction.
graphify uses graphify.symbol_resolution, so a change to graphify.symbol_resolution can break graphify, while a change to graphify can't break graphify.symbol_resolution.
Position
Below the diagonal: graphify uses a module listed above it, which is the healthy direction.
graphify.extractors uses graphify.extractors.models, so a change to graphify.extractors.models can break graphify.extractors, while a change to graphify.extractors can't break graphify.extractors.models.
Position
Below the diagonal: graphify.extractors uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 73% · Adequate · gated by D1, D2 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
37
High / Critical
A03:2025 — Software Supply Chain Failures
19
High / Critical
A07:2025 — Authentication Failures
3
High / Critical
A02:2025 — Security Misconfiguration
2
Medium
Roadmap
First, secure the application by implementing a global authentication guard with explicit public opt-outs and defining named role permissions for all endpoints. Next, immediately resolve the seven high-severity dependency vulnerabilities in the lock file and harden the web security posture by pinning third-party scripts with integrity hashes or restricting their origins via content security policies. Finally, eliminate redundant code comments and begin documenting significant architectural decisions in a dedicated folder to preserve design context for future development.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Protect endpoints by default-deny: a global authentication guard or middleware with explicit public opt-outs, or a guard on every route, plus named role/permission rules for what an authenticated caller may do.
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 — 34
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 — 924
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 — 61
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 31
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. 49 of 54 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 5 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 — 54 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, 1003 of 1019 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D10 Test Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 20 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 456 test source file(s) (.py) 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.
D12 Dependency Hygiene — 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. This repository's 31 shipped Python distribution(s) across 1 manifest(s) WERE read; what went unanswered is the currency half, because it grades an EXACT pin against the newest release and every declaration here is a floor or a range — which installs the newest release it admits and so cannot be behind one. So pypi.org was never asked. This is a true statement about the repository, and the healthy one, NOT a gap on our side: no reader we could write would find a currency question here.
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 Python REDACTED/requirements.txt (pip/uv/Poetry), but the licence verdict published here was taken over its NuGet package dependencies. Nothing was read about its Python dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D17 Explicit Debt — 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 C# workspace loaded this repository's projects but reported a load failure, and the dead-code reference search is unreliable over a graph that did not load cleanly, so it was skipped. The other debt markers on this row were read; dead symbols were not, and their absence from the score is not a finding that the code has none. First load diagnostic: Failure: Project file not found: 'tests/fixtures/src/WebApi/WebApi.csproj'.
D17 Explicit Debt — 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 0 deducted marker(s) and the 0.0/KLoC density on this row were taken over this repository's .NET projects ALONE: .py (83,634 lines, 100% of production source) went unread, because every marker collector on this path is reached through a C# workspace. D17's marker collectors need a compiler we do not have for that language, so none of its nine marker kinds were read there. The debt in that source is UNMEASURED — its absence from the score above is a gap in this analyzer's language coverage, not a finding that the code carries none.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
D39 IL Efficiency — 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. IL NOT MEASURED: the analyzer's own build of this repository failed for an ENVIRONMENT reason (exit 1) — MSBuild's engine or the CLR gave up, or our image does not carry the SDK band/targeting pack this repository needs. This is OUR limitation, not a defect in the repo, and it is not a statement that this repository fails to build. D18 owns the question of whether this repository builds; it was not answered here.
AX1 Captive dependencies — 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 Microsoft.Extensions.DependencyInjection registrations in C# and Spring beans in Java/Kotlin only, and this repository defines its own container in graphify/serve.py, whose lifetimes are not modelled 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.
AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via REDACTED (REDACTED). docker build failed (exit 1) — DEPRECATED: The legacy builder is deprecated and will be removed in a future release.
Install the buildx component to build images with BuildKit:
https://docs.docker.com/go/bui…; runtime evidence skipped.
C1 Data Protection — 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 personal data 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 personal data 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. 'psycopg' is imported (graphify/pg_introspect.py:14), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
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. 'psycopg' is imported (graphify/pg_introspect.py:14), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
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. 'psycopg' is imported (graphify/pg_introspect.py:14), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
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 reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and this repository's Python is most of its product and 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.
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.
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.
X24 Document value interpolated into markup unescaped — 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.
X25 Inert configuration knob — 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 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.
X29 Per-element action decided by a fixed element — 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.
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 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.
X32 Type resolved by simple name across every loaded assembly — 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.
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.
Repo exclusion declarations: 2 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.
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.
D11 Test Reliability: Flakiness is inferred from history/markers — Watchdog runs the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
D13 REDACTED Scanning: REDACTED 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.
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.
D22 Internal API Consistency: API-surface coherence is an LLM judgement over a sample of the public surface — consistency of intent across the whole API is approximated, not exhaustively verified.
D24 Comment Value: Comment value (WHY vs WHAT) is an LLM judgement over a bounded sample — it is advisory and cannot weigh a comment against the precise code change it was written to explain.
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 (go.mod, 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.
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.
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 (5): D19, D21, D22, D24, 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.
+ 217 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 17 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with cli.dispatch_command (cyclomatic 850), extract.extract (cyclomatic 372), build.build_from_json (cyclomatic 165). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 17 together lifts Cyclomatic Complexity from 2.0 to about 3.2/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 344 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 349 bodies over 15 down to 15 or less in Cognitive Complexity — start with cli.dispatch_command (cognitive 1652), extract.extract (cognitive 788), build.build_from_json (cognitive 337). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 349 together lifts Cognitive Complexity from 2.0 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
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 Classes8.6 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
24 over-large unit(s) detected — types, modules or files that carry too much.
FileTooLong: REDACTED · ×24REDACTED
What to do
Resolve the 24 FileTooLong finding(s) in God Classes — start with REDACTED, REDACTED, cli.py. — One of this dimension's main actionable groups (24 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.
230 duplicated block group(s) detected. A further 14 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 101 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 13 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with REDACTED (2), serve.py (2), build.py. — One of this dimension's main actionable groups (13 warning-level).
Resolve the 13 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with cli.py (5), REDACTED (2), cluster.py. — One of this dimension's main actionable groups (13 warning-level).
Resolve the 12 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with cli.py (3), REDACTED (2), build.py. — One of this dimension's main actionable groups (12 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 · Coupling6.9 / 10Adequate✓ 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.
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
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.
6976 test methods: 6974 unit, 2 integration, 0 BDD, 0 e2e. The JavaScript/TypeScript suite contributes 20 `it`/`test` case(s) across 1 test file(s) declaring at least one; its tier split is read from package names and paths only. The Python suite contributes 6956 test function(s) across 452 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Stronggated by 1 serious finding✓ 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.
0 skipped, 0 zero-assertion, 1 synchronised by a fixed sleep, no mocking-framework packages referenced (hand-written doubles or no mocking) across 20 tests. Measured on the JavaScript/TypeScript suite only — at least 456 test source file(s) (.py) went unread, so its test quality is unmeasured and is not in these counts.
Fixed-sleep synchronisation: output that finishes after navigation is discardedtests/pi.test.ts:207
What to do
Resolve the 1 Fixed-sleep synchronisation finding(s) in Test Quality — start with pi.test.ts. — One of this dimension's main actionable groups (1 warning-level).
Enforce Test Quality in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d10_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests pass reliably, with no flakiness.
Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.
What it measures: Whether 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 0 packages use a banned license. The depth of this set was not established for this repository: the graded packages are what this pass resolved, and no lockfile was read, so it is not certified to be the full transitive closure. ★ COVERAGE OF THIS VERDICT: it grades this repository's NuGet package dependencies and nothing else. The repository also declares a Python REDACTED/requirements.txt (pip/uv/Poetry), 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 (209×372=77748); graphify/cli.py (82×850=69700); REDACTED (166×117=19422) Repeated repair below the complexity floor: graphify/hooks.py (18 of 25 changes were fixes); graphify/paths.py (12 of 17 changes were fixes); graphify/extractors/elixir.py (10 of 10 changes were fixes)
Resolve the 38 Hotspot finding(s) in Churn × Complexity Hotspots — start with REDACTED, cli.py, REDACTED. — One of this dimension's main actionable groups (38 warning-level).
Resolve the 17 Repeated repair finding(s) in Churn × Complexity Hotspots — start with hooks.py, paths.py, elixir.py. — One of this dimension's main actionable groups (17 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor9.7 / 10Exemplary✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
3 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is graphify/mcp_ingest.py. Counted over 99 of the 111 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
✓ On the Gold path — maintain.
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
0 deducted debt markers + unmeasured dead symbols across 0 LoC in the .NET projects (0.0/KLoC) → score 10.0. Dead code not measured: the solution did not load cleanly, so the reference search was skipped. Measured on the .NET source only: .py (100% of production source) was not read, and carries at least 0 uncounted task marker(s) in 0 file(s).
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 and six worked/ directories all document their own directories (e.g. the 'reproducible example', 'Karpathy repos benchmark', or 'rsl-siege-manager case study'), each with a clear overview of what it is for, installation/run steps, and an after-run expectation. The architecture/design docs are comprehensive: ARCHITECTURE.md covers the pipeline, module responsibilities, input/output schema, and a full outline (calling extract() from your own code; extraction output schema; edge direction in graph.json; confidence labels; adding a new language extractor; security; testing), while Docker MCP-SQLite and How-it-works docs provide focused recipes plus an explanatory three-pass model. The summary is clear and complete. This is a repository-wide translations README for the Graphify project (a knowledge-graph assistant) with 38 architecture/design markdown docs. The translation READMEs are excellent: they open with a centered logo and link to each language's README, then state what the project does in an overview paragraph before any documentation begins. (8 of 25 sampled documents could not be assessed: 1 of 3 evaluation groups failed.)
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.
0 naming inconsistencies across 32 sampled symbols.
✓ On the Gold path — maintain.
Detailed fixes: d21_recommendation.md.
Do you agree with this assessment?
D22 · Internal API ConsistencyStronggated by 2 serious findings◐ Sampled · advisory
What it measures: Whether the internal API surface is consistent and coherent.
Method: Judged by language model at low temperature over a sample of the public API surface (IsPackable or .Contracts types). Sampled, advisory; confidence discounted by model uncertainty.
2 API inconsistencies across a 400-member sample of 126 exposed types.
Redundant entry points for graph construction. `build_from_json` appears to be a thin wrapper or legacy alias for `build`, differing only in accepting a single extraction dict vs a list, and lacking the `dedup_llm_backend` and `protected_ids` parameters. This creates confusion about which function to use for new code.
Inconsistent naming convention for singular vs plural operations. `edge_data` (singular) returns a single dict, while `edge_datas` (plural) returns a list. Standard Python/English convention would typically be `edge_data` (singular) for one item and `edge_data` (plural context) or `get_edge_data` for multiple, or consistently use `edge_data` and `edge_datas` but the latter is awkward. More importantly, if the graph supports multi-edges, `edge_data` returning a single dict implies it picks one arbitrarily or fails, whereas `edge_datas` returns all. The naming `edge_datas` is non-standard (should be `edge_data` or `get_edge_data` for the list version, or `edge_data` for single and `edge_data_list` for plural).
What to do
Resolve the 1 Redundant entry points for graph construction. `build_from_json` appears… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Inconsistent naming convention for singular vs plural operations.… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d22_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D24 · Comment ValueWeak◐ Sampled · advisory
What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).
Method: Judged by language model at low temperature (0.0-0.1) on deterministically sampled inline comments with surrounding code; findings verified back to sampled comments by substring match. Advisory, sampled.
Resolve the 2 redundant comment finding(s) in Comment Value — start with ToolkitViewModel.cs (2). — One of this dimension's main actionable groups (2 recommendation-level).
Detailed fixes: d24_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: REDACTED 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.
2 finding(s): 0 critical, 2 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
What to do
Resolve the 2 REDACTED finding(s) in Secrets (history) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
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).
37 finding(s): 0 critical, 20 high, 16 medium, 1 low. 19 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.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED, REDACTED. — One of this dimension's main actionable groups (6 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 19 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 (19 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 7 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (7). — One of this dimension's main actionable groups (7 issue-level).
Resolve the 3 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (3). — One of this dimension's main actionable groups (3 issue-level).
Resolve the 1 Critical vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
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).
Resolve the 1 Low IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 recommendation-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.
3 of 99 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is graphify/scip_ingest.py. Counted over 99 of the 111 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Orphaned file · ×3graphify/scip_ingest.py:1
Orphaned files with no living knowledge
✓ On the Gold path — maintain.
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
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.
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
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 3 platform declaration(s) and 31 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.
AC2 · Forms & labels4.3 / 10Weak✓ 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 for>, a wrapping <label>, or aria-label. — worked/rsl-siege-manager/graph.html:50
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>. — worked/rsl-siege-manager/graph.html:2
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 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 automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 1 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 test suite you already have: assert the accessibility invariants over the HTML your app renders — parse the rendered output in an existing test, or drive a real browser from one — and gate that test in CI so a regression blocks the merge.
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.
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.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.
Other · Security — Whether access is authorized by default — a framework authorization attribute/decorator or policy, or imperative guard methods (throw-on-violation) called from handlers.
Method: Roslyn scan: [Authorize] usage and authorization policies, plus imperative throw-on-violation guard methods detected via syntax. Deterministic.
This repository serves requests — a request handler (uvicorn.run() (graphify/serve.py:3058) — and no route guard, auth-gate middleware, global guard or imperative check that refuses a caller (401/403, an Unauthorized/Forbidden error) was found: its endpoints may be unprotected. — graphify/serve.py:3058
What to do
Protect endpoints by default-deny: a global authentication guard or middleware with explicit public opt-outs, or a guard on every route, plus named role/permission rules for what an authenticated caller may do.
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.
What to do
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 2 of 2 project(s) that lack one — worth up to 2 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
What to do
Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
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.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability7.0 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
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.
No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 16275 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
What to do
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
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.
What to do
Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where Watchdog can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
Other · Security — Only what this repository's own non-C# files could be read for was assessed — markup this repository SHIPS is scored for third-party script integrity whether or not the repository serves it itself, since a page handed to a consumer runs in that consumer’s origin. Nothing else in this dimension was assessed: the transport, cookie, input-validation and crypto controls are read from a source model that was not loaded for this repository’s language, so their absence here is not a finding about this repository.
Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.
`https://unpkg.com/vis-network/standalone/umd/vis-network.min.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository. — worked/rsl-siege-manager/graph.html:6
What to do
Pin third-party scripts and verify them: name an exact version in the URL and add an `integrity="sha384-…"` hash alongside `crossorigin="anonymous"` (both are required — an integrity hash on a cross-origin script without `crossorigin` is not evaluated, it blocks the script). Where the vendor ships a continuously-updated loader and publishes no stable hash (tag managers, analytics, chat widgets), Subresource Integrity is not available: constrain it instead with a `Content-Security-Policy` that names the exact origins allowed to execute, and drop the script from the pages that do not need it. Where the page is shipped inside a package that others host, prefer vendoring the asset and serving it from the app’s own origin, so no consumer inherits a third-party dependency they did not choose.
Other · Code Health — Whether an argument guard throws the exception its own condition describes — a guard that rejects a value for being EMPTY and reports it as `NullPointerException` (Java, Kotlin, Scala), `ArgumentError.notNull` (Dart) or `ArgumentNullException` (F#'s `nullArg`) tells the caller a parameter was null when it provably was not.
Method: Roslyn syntax: `throw new ArgumentNullException(nameof(p))` statements controlled by an `if`, whose condition is read for a test that is true of a NON-null `p` — an emptiness test that dereferences it (`p.Count == 0`, `!p.Any()`) or a BCL predicate documented true of the empty value (`string.IsNullOrEmpty(p)`). Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 10 of 55 WCAG 2.2 Level A/AA success criteria (18%; ≈20% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 45 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 — 3 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.
SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X10 Duplicated predicate — 23 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 20 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: this repository stores data through 'psycopg' (graphify/pg_introspect.py:14) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and MongoEngine model fields, Alembic and Django migration columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL files). Personal data may be written through raw SQL or a hosted backend, so whether its changes need an audit trail could not be established, and the trail's absence is not scored.
C4 Data Retention — Not assessed: this repository stores data through 'psycopg' (graphify/pg_introspect.py:14) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and mongoengine model fields, Alembic and Django migration columns, SQL schemas). Personal data may be written through raw SQL or a hosted backend, so whether a retention limit applies here could not be established, and its absence is not scored.
C5 Data-Subject Rights — Not assessed: this repository stores data through 'psycopg' (graphify/pg_introspect.py:14) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and mongoengine model fields, Alembic and Django migration columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL files). Personal data may be written through raw SQL or a hosted backend, so whether data-subject rights apply here could not be established, and their absence is not scored.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 59 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.
AC1 Text alternatives — No image/media element found in the parsed markup — AC1 not applicable here.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AC5 ARIA correctness — No ARIA usage found in the parsed markup — AC5 not applicable here.
AX1 Captive dependencies — 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
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — docker build failed (exit 1) — DEPRECATED: The legacy builder is deprecated and will be removed in a future release.
Install the buildx component to build images with BuildKit:
https://docs.docker.com/go/bui…; 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 — Not assessed: these personal data 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 personal data 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.
D12 Dependency Hygiene — Dependency currency not established — no declaration carries an exact pin to grade
D18 Solution Shape — D18 scores the shape of a .NET solution, but this repository's production source is mostly .py, .ts — the .NET project files present are an immaterial minority — so the dimension does not apply.
D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
D23 Boundary Type-Coupling — single shared-core project — no cross-context coupling to assess
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.py), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — 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.
D39 IL Efficiency — IL not measured — the analyzer's build of the target did not succeed
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 MEASURED: `--collect:"XPlat Code Coverage"` names a data collector that ships in the `coverlet.collector` package, and this repository wires up none — no test project references it and no runsettings declares one. The absence of coverage here is therefore not evidence about the suite or about our analyzer environment: without a collector, `--collect` produces nothing even from a suite that builds and passes. Add a `coverlet.collector` PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect.
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (19 value object(s))
ED1 Event-Driven — not scored — this repository shows only 1 of the 3 signals this lens looks for (a message-bus package)
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — reported, not scored — this repository's C# declares no analysable method bodies (a constants, record or DTO assembly), and this score is a density of unfinished work per method, which has no denominator here. The file-level signals below were still collected and are shown in full
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 — no outbound HTTP usage detected — no HTTP client call or construction in the JavaScript/TypeScript, Python source (service entry point: graphify/serve.py:2942 ())
P8 Schema migrations — no EF Core usage detected
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) 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 a pytest-benchmark or pytest-codspeed dependency with tests taking the `benchmark` fixture, an asv.conf.json with its `time_`/`mem_`/`peakmem_` benchmarks, or a pyperf Runner, 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.
PF2 Allocation hygiene — Not applicable: Python runs on a garbage-collected runtime that gives a program no allocation-control idiom to choose on a hot path — no pools, stack allocation or value types — so allocation awareness is not something this code can be rated on.
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
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.
X24 Document value interpolated into markup unescaped — 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.
X25 Inert configuration knob — 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 — 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.
X29 Per-element action decided by a fixed element — 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.
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 — 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.
X32 Type resolved by simple name across every loaded assembly — 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.
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
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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 · ×1
<input> without a programmatic label worked/rsl-siege-manager/graph.html: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 for>, a wrapping <label>, or aria-label.
Hotspot: REDACTED REDACTED:9272— REDACTED changed 209 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 372 in extract.extract at line 9272. 159 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01: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: graphify/cli.py graphify/cli.py:1408— graphify/cli.py changed 82 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 850 in cli.dispatch_command at line 1408. 52 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/cli.py`: 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:5995— REDACTED changed 166 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 117 in engine._extract_generic at line 5995. 137 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01: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: graphify/build.py graphify/build.py:1270— graphify/build.py changed 57 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 165 in build.build_from_json at line 1270. 50 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/build.py`: 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: graphify/watch.py graphify/watch.py:1677— graphify/watch.py changed 60 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 149 in watch._rebuild_code at line 1677. 45 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/watch.py`: 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:1248— REDACTED changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in resolution._apply_symbol_resolution_facts at line 1248. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01: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: graphify/detect.py graphify/detect.py:1960— graphify/detect.py changed 57 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in detect.detect at line 1960. 38 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/detect.py`: 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: graphify/dedup.py graphify/dedup.py:950— graphify/dedup.py changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 119 in dedup.deduplicate_entities at line 950. 15 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/dedup.py`: 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: graphify/cache.py graphify/cache.py:1525— graphify/cache.py changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in cache.save_semantic_cache at line 1525. 30 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/cache.py`: 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: graphify/serve.py graphify/serve.py:1120— graphify/serve.py changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in serve._subgraph_to_text at line 1120. 35 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/serve.py`: 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: graphify/llm.py graphify/llm.py:3041— graphify/llm.py changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in llm._call_llm at line 3041. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/llm.py`: 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:760— REDACTED changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in export.to_obsidian at line 760. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01: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: graphify/extractors/sql.py graphify/extractors/sql.py:453— graphify/extractors/sql.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in sql.extract_sql at line 453. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/extractors/sql.py`: 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: graphify/ruby_resolution.py graphify/ruby_resolution.py:77— graphify/ruby_resolution.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in ruby_resolution.resolve_ruby_member_calls at line 77. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/ruby_resolution.py`: 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: graphify/extractors/dart.py graphify/extractors/dart.py:14— graphify/extractors/dart.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 117 in dart.extract_dart at line 14. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/extractors/dart.py`: 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: graphify/exporters/html.py graphify/exporters/html.py:508— graphify/exporters/html.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in html.to_html at line 508. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/exporters/html.py`: 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: graphify/report.py graphify/report.py:96— graphify/report.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in report.generate at line 96. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/report.py`: 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: graphify/install.py graphify/install.py:2110— graphify/install.py changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in install._agents_uninstall at line 2110. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/install.py`: 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: graphify/extractors/solidity.py graphify/extractors/solidity.py:268— graphify/extractors/solidity.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in solidity.extract_solidity at line 268. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/extractors/solidity.py`: 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: graphify/__main__.py graphify/__main__.py:822— graphify/__main__.py changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in __main__._run_cli at line 822. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/__main__.py`: 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: graphify/analyze.py graphify/analyze.py:475— graphify/analyze.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in analyze.suggest_questions at line 475. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/analyze.py`: 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: graphify/extractors/go.py graphify/extractors/go.py:106— graphify/extractors/go.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in go._go_collect_type_refs at line 106. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/extractors/go.py`: 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: graphify/extractors/terraform.py graphify/extractors/terraform.py:177— graphify/extractors/terraform.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in terraform.extract_terraform at line 177. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/extractors/terraform.py`: 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: graphify/cross_repo_calls.py graphify/cross_repo_calls.py:211— graphify/cross_repo_calls.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in cross_repo_calls.link_cross_repo_member_calls at line 211. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/cross_repo_calls.py`: 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: graphify/cluster.py graphify/cluster.py:233— graphify/cluster.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in cluster.cluster at line 233. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/cluster.py`: 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.
FileTooLong: REDACTED REDACTED— FileTooLong — 7512 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7012 over it, 15.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.
FileTooLong: REDACTED REDACTED— FileTooLong — 6094 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5594 over it, 12.19× 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: graphify/cli.py graphify/cli.py— FileTooLong — 3968 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3468 over it, 7.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: REDACTED REDACTED— FileTooLong — 3026 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2526 over it, 6.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: graphify/llm.py graphify/llm.py— FileTooLong — 2239 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1739 over it, 4.48× 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: graphify/install.py graphify/install.py— FileTooLong — 2010 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1510 over it, 4.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.
FileTooLong: graphify/serve.py graphify/serve.py— FileTooLong — 1908 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1408 over it, 3.82× 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: graphify/watch.py graphify/watch.py— FileTooLong — 1827 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1327 over it, 3.65× 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: graphify/detect.py graphify/detect.py— FileTooLong — 1769 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1269 over it, 3.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: graphify/build.py graphify/build.py— FileTooLong — 1564 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1064 over it, 3.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: graphify/cache.py graphify/cache.py— FileTooLong — 968 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 468 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: graphify/dedup.py graphify/dedup.py— FileTooLong — 917 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 417 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: skillgen/gen.py tools/skillgen/gen.py— FileTooLong — 830 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 330 over it, 1.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: REDACTED REDACTED— FileTooLong — 823 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 323 over it, 1.65× 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: extractors/rust.py graphify/extractors/rust.py— FileTooLong — 713 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 213 over it, 1.43× 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: graphify/prs.py graphify/prs.py— FileTooLong — 610 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 110 over it, 1.22× 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: exporters/html.py graphify/exporters/html.py— FileTooLong — 588 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 88 over it, 1.18× 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: extractors/go.py graphify/extractors/go.py— FileTooLong — 588 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 88 over it, 1.18× 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: extractors/sql.py graphify/extractors/sql.py— FileTooLong — 582 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 82 over it, 1.16× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: extractors/objc.py graphify/extractors/objc.py— FileTooLong — 572 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 72 over it, 1.14× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: extractors/solidity.py graphify/extractors/solidity.py— FileTooLong — 566 significant lines (blank, comment-only and punctuation-only lines excluded). 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: graphify/reflect.py graphify/reflect.py— FileTooLong — 550 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 50 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: graphify/analyze.py graphify/analyze.py— FileTooLong — 526 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 26 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: extractors/pascal.py graphify/extractors/pascal.py— FileTooLong — 512 significant lines (blank, comment-only and punctuation-only lines excluded). 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.
Repeated repair: graphify/hooks.py graphify/hooks.py:149— graphify/hooks.py changed 25 times in last 90 days and 18 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 hooks._unquote_git_path at line 149), 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(hooks): run the rebuild from the checkout's top level (#3258)”; “fix(hooks): rebuild after cherry-pick, rebase and pull --rebase (#4490)”; “fix(hooks): drop MERGE_HEAD guard from post-merge so real merges rebuild (#4463)”; “fix(install): never let uninstall --purge delete the project when GRAPHIFY_OUT is empty or "."”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/hooks.py`: 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: graphify/paths.py graphify/paths.py:84— graphify/paths.py changed 17 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 14 (its worst body is paths.os_replace_with_fallback at line 84), 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(cache): read and write AST cache entries via extended-length paths on Windows”; “fix: write graph.json as one line of compact JSON (#3413)”; “fix(install): never let uninstall --purge delete the project when GRAPHIFY_OUT is empty or "."”; “fix: make the test suite pass on Windows (#4260)”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/paths.py`: 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: graphify/extractors/elixir.py graphify/extractors/elixir.py:16— graphify/extractors/elixir.py changed 10 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 8 (its worst body is elixir.extract_elixir at line 16), 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(elixir): extract defdelegate as a function definition (#4132)”; “fix(elixir): emit calls edges for keyword-form def bodies”; “fix(elixir): resolve qualified and aliased remote calls (#4206)”; “fix(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/extractors/elixir.py`: 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: graphify/extractors/bash.py graphify/extractors/bash.py:76— graphify/extractors/bash.py changed 11 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 10 (its worst body is bash._bash_assignment_base 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(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)”; “fix(bash): resolve exec-position script paths built from a variable”; “fix(bash): emit calls edges for x=$(fn) command substitution (#2978)”; “fix(extractors/bash): resolve dirname cmdsubst and dotdot suffix in source paths (#2596)”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/extractors/bash.py`: 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: graphify/extractors/powershell.py graphify/extractors/powershell.py:11— graphify/extractors/powershell.py changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is powershell.extract_powershell at line 11), 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(powershell): dot-source quoted/$PSScriptRoot paths and script-scope calls (#4356)”; “fix(powershell): extract functions inside file-scope begin/process/end blocks (#4270)”; “fix(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)”; “fix(powershell): resolve member calls by receiver owner (#4163)”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/extractors/powershell.py`: 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: graphify/extractors/julia.py graphify/extractors/julia.py:9— graphify/extractors/julia.py changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is julia.extract_julia at line 9), 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(julia): resolve module-qualified functor types, never fall back to the variable”; “fix(julia): name parametric functors by their type, not the variable”; “fix(julia): extract return-typed, qualified, operator and functor methods; broadcast/pipe calls”; “fix(julia,fortran): extract where-clause funcs, parametric types, and named generic interfaces (#4126, #4128, #4141)”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/extractors/julia.py`: 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: graphify/file_slice.py graphify/file_slice.py:181— graphify/file_slice.py changed 6 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 file_slice.expand_oversized_files at line 181), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(detect/extract): structurally extract .yaml/.yml config files (#2214)”; “fix(detect): classify Jinja templates as documents (#3427)”; “fix(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)”; “fix(llm): bisect PDF slices on extracted text; reconcile splittable-PDF tests (#2906)”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/file_slice.py`: 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: graphify/security.py graphify/security.py:105— graphify/security.py 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 12 (its worst body is security.validate_url at line 105), 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(security): reject embedded URL credentials”; “fix(security): reject malformed URL ports”; “fix(security): reject HTTP URLs without a hostname”; “fix(extract): also redact opaque Bearer tokens; guard against over-redaction”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/security.py`: 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: graphify/extractors/fortran.py graphify/extractors/fortran.py:72— graphify/extractors/fortran.py changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 11 (its worst body is fortran.extract_fortran at line 72), 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(fortran): extract named generic interfaces as callable nodes”; “revert(fortran): drop re-implementation of #4141 in favor of PR #4142”; “fix(julia,fortran): extract where-clause funcs, parametric types, and named generic interfaces (#4126, #4128, #4141)”; “fix(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/extractors/fortran.py`: 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: graphify/extractors/base.py graphify/extractors/base.py:125— graphify/extractors/base.py changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is base._read_source_bytes at line 125), 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(extractors): share the in-flight scan root via base, not graphify.extract (#3666)”; “fix(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)”; “fix(rust): stop prelude types becoming god nodes and label constructors”; “fix(go): scope the predeclared-function filter to Go bare identifiers”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/extractors/base.py`: 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: graphify/ingest.py graphify/ingest.py:14— graphify/ingest.py 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 13 (its worst body is ingest._yaml_str at line 14), 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(ingest): never write a text capture through an existing entry”; “fix: preserve earlier binary URL captures”; “fix(ingest): rewrite only the host when normalizing a tweet URL for oEmbed”; “fix(ingest): classify a URL by its host, not by text it contains”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/ingest.py`: 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: graphify/extractors/zig.py graphify/extractors/zig.py:20— graphify/extractors/zig.py 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 7 (its worst body is zig.extract_zig 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(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)”; “fix(zig): emit a node per tagged-union variant with a case_of edge”; “fix(zig): extract error set declarations and their members”; “fix(zig): emit a node per enum member with a case_of edge”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/extractors/zig.py`: 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: graphify/tree_html.py graphify/tree_html.py:178— graphify/tree_html.py changed 4 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 tree_html.build_tree at line 178), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(tree): don't count untagged nodes as a repo when choosing merged layout”; “fix(tree): group merged graphs by repo tag so repos get their own roots”; “fix(html): stop a node label from breaking out of the embedded script block (#4124)”; “fix(cli): surface four silent success-exit failures (#2534)”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/tree_html.py`: 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: graphify/extractors/commonlisp.py graphify/extractors/commonlisp.py:60— graphify/extractors/commonlisp.py changed 4 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 commonlisp.extract_commonlisp 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(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)”; “fix(commonlisp): derive node ids from the full path stem”; “fix(commonlisp): keep inherits edge when the superclass is in another file”; “fix(commonlisp): mint sourceless stubs for import targets so edges don't dangle”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/extractors/commonlisp.py`: 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: graphify/extractors/ocaml.py graphify/extractors/ocaml.py:15— graphify/extractors/ocaml.py changed 4 times in last 90 days and 3 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 ocaml.extract_ocaml 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(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)”; “fix(ocaml): extract classes and their methods and instance variables”; “fix(ocaml): don't bind a qualified external call to a same-named local def”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/extractors/ocaml.py`: 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: graphify/extractors/json_config.py graphify/extractors/json_config.py:34— graphify/extractors/json_config.py changed 3 times in last 90 days and 3 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 json_config._is_config_json at line 34), 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(json_config): link a package.json dependency's manifest entry to its ref node (#4569, #4572)”; “fix(extract): stop walking JSON Schema files as config manifests (#2255)”; “fix(json_config): stop emitting self-referential dep imports and array-as-extends edges”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/extractors/json_config.py`: 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: graphify/benchmark.py graphify/benchmark.py:55— graphify/benchmark.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is benchmark.run_benchmark at line 55), 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(benchmark): count the tokens of the answer query_graph returns”; “fix(benchmark): guard against a node with a None label (#2674)”; “fix: load raw edges-keyed graphs + stop pruning alive files as deleted (#2212, #2210)”. 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-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 18:20:06 +01:00' --until='2026-10-23 18:20:06 +01:00' --full-history --no-merges -- graphify/benchmark.py`: 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.
Duplicated block (9 lines × 2) graphify/build.py:2320— graphify/build.py:2320-2328 | graphify/build.py:2471-2479 — 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) graphify/exporters/graphdb.py:82— graphify/exporters/graphdb.py:82-90 | graphify/exporters/graphdb.py:194-202 — 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 `graphify/exporters/graphdb.py:82` 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 (9 lines × 2) graphify/extractors/bash.py:503— graphify/extractors/bash.py:503-511 | graphify/extractors/bash.py:546-554 — 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) graphify/extractors/blade.py:42— graphify/extractors/blade.py:42-50 | graphify/extractors/blade.py:52-60 — 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 `graphify/extractors/blade.py:42` 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 (9 lines × 2) graphify/extractors/commonlisp.py:328— graphify/extractors/commonlisp.py:328-336 | graphify/extractors/commonlisp.py:418-426 — 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. 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.
Duplicated block (9 lines × 2) graphify/extractors/dart.py:178— graphify/extractors/dart.py:178-186 | graphify/extractors/dart.py:189-197 — 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) REDACTED:4425— REDACTED:4425-4433 | REDACTED:4635-4643 — 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) REDACTED:6860— REDACTED:6860-6868 | REDACTED:9378-9386 — 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. 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.
Duplicated block (9 lines × 2) graphify/extractors/fortran.py:276— graphify/extractors/fortran.py:276-284 | graphify/extractors/fortran.py:334-342 — 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. 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, `graphify/extractors/fortran.py:333` calls `emit_signature_refs` and `graphify/extractors/fortran.py:275` 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 (9 lines × 2) REDACTED:3755— REDACTED:3755-3763 | REDACTED:4031-4039 — 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. 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.
Duplicated block (9 lines × 2) graphify/google_workspace.py:222— graphify/google_workspace.py:222-230 | graphify/google_workspace.py:235-243 — 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. 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 after the matched lines, `graphify/google_workspace.py:245` calls `RuntimeError` and `graphify/google_workspace.py:231` does not — after which the two agree again for 3 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 (9 lines × 2) graphify/serve.py:1593— graphify/serve.py:1593-1601 | graphify/serve.py:1688-1696 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `graphify/serve.py:1697` calls `join`, `_search_tokens`, `get` and `graphify/serve.py:1602` 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 (9 lines × 2) graphify/serve.py:2606— graphify/serve.py:2606-2614 | graphify/serve.py:2650-2658 — 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 (7 lines × 2) graphify/cli.py:1459— graphify/cli.py:1459-1465 | graphify/cli.py:3749-3755 — 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 (7 lines × 2) graphify/cli.py:2326— graphify/cli.py:2326-2332 | graphify/cli.py:3207-3213 — 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 (7 lines × 2) graphify/cli.py:2333— graphify/cli.py:2333-2339 | graphify/cli.py:3211-3217 — 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 (7 lines × 2) graphify/cli.py:3729— graphify/cli.py:3729-3735 | graphify/cli.py:3740-3746 — 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. 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 (7 lines × 2) graphify/cli.py:5247— graphify/cli.py:5247-5253 | graphify/cli.py:5256-5262 — 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 (7 lines × 2) graphify/cluster.py:365— graphify/cluster.py:365-371 | worked/mixed-corpus/raw/cluster.py:59-65 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) graphify/exporters/graphdb.py:45— graphify/exporters/graphdb.py:45-51 | graphify/exporters/graphdb.py:142-148 — 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 (7 lines × 2) REDACTED:5990— REDACTED:5990-5996 | REDACTED:6129-6135 — 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:5990` 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 (7 lines × 2) REDACTED:11233— REDACTED:11233-11239 | REDACTED:11254-11260 — 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:11233` 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 (7 lines × 2) graphify/extractors/cobol.py:108— graphify/extractors/cobol.py:108-114 | graphify/extractors/erlang.py:94-100 — 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 `graphify/extractors/cobol.py:108` 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 (7 lines × 2) REDACTED:4010— REDACTED:4010-4016 | REDACTED:4517-4523 — 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 (7 lines × 2) graphify/extractors/fortran.py:268— graphify/extractors/fortran.py:268-274 | graphify/extractors/fortran.py:281-287 — 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 (7 lines × 2) graphify/llm.py:3195— graphify/llm.py:3195-3201 | graphify/llm.py:3246-3252 — 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. 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 (5 lines × 2) graphify/build.py:1398— graphify/build.py:1398-1404 | graphify/build.py:1430-1434 — 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 (5 lines × 2) graphify/cli.py:2076— graphify/cli.py:2076-2080 | graphify/serve.py:2141-2145 — 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 (5 lines × 2) graphify/dedup.py:550— graphify/dedup.py:550-554 | graphify/dedup.py:568-572 — 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. 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.
Duplicated block (5 lines × 2) REDACTED:5061— REDACTED:5061-5065 | REDACTED:5080-5084 — 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 (5 lines × 2) REDACTED:5157— REDACTED:5157-5161 | REDACTED:6405-6409 — 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 (5 lines × 2) graphify/extractors/dart.py:539— graphify/extractors/dart.py:539-544 | graphify/extractors/dart.py:547-551 — 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 (5 lines × 2) graphify/extractors/sql.py:771— graphify/extractors/sql.py:771-775 | graphify/extractors/sql.py:777-781 — 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 (5 lines × 2) REDACTED:125— REDACTED:125-129 | graphify/serve.py:215-219 — 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 `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 (5 lines × 2) graphify/cli.py:2403— graphify/cli.py:2403-2407 | graphify/cli.py:3807-3811 — 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 `graphify/cli.py:2403` 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 (5 lines × 2) graphify/cli.py:2903— graphify/cli.py:2903-2907 | graphify/cli.py:3291-3295 — 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 `graphify/cli.py:2903` 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 (5 lines × 2) graphify/detect.py:716— graphify/detect.py:716-720 | graphify/detect.py:764-768 — 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 (5 lines × 2) graphify/prs.py:334— graphify/prs.py:334-338 | graphify/prs.py:648-652 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) graphify/analyze.py:707— graphify/analyze.py:707-717 | worked/mixed-corpus/raw/analyze.py:507-517 — before extracting anything, compare `graphify/analyze.py` and `worked/mixed-corpus/raw/analyze.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (11 lines × 2) graphify/build.py:2329— graphify/build.py:2329-2339 | graphify/build.py:2481-2491 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) graphify/cli.py:703— graphify/cli.py:703-713 | graphify/cli.py:800-810 — 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. 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.
Duplicated block (11 lines × 2) REDACTED:5502— REDACTED:5502-5512 | REDACTED:6345-6362 — 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:6345` 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 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.
Duplicated block (11 lines × 2) REDACTED:7956— REDACTED:7956-7966 | REDACTED:7972-7982 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:7967` calls `get` and `REDACTED:7983` 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 (11 lines × 2) REDACTED:1571— REDACTED:1571-1581 | graphify/extractors/go.py:76-86 — 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.
Duplicated block (11 lines × 2) REDACTED:7429— REDACTED:7429-7439 | REDACTED:7445-7456 — 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:7445` 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 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.
Duplicated block (11 lines × 2) graphify/extractors/ocaml.py:209— graphify/extractors/ocaml.py:209-219 | graphify/extractors/ocaml.py:249-259 — 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. 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 after the matched lines, `graphify/extractors/ocaml.py:220` calls `add`, `walk` and `graphify/extractors/ocaml.py:260` 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 (11 lines × 2) graphify/extractors/pascal.py:209— graphify/extractors/pascal.py:209-219 | graphify/pascal_resolution.py:91-101 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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.
Duplicated block (11 lines × 2) graphify/extractors/razor.py:12— graphify/extractors/razor.py:12-22 | graphify/extractors/sln.py:11-21 — 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.
Duplicated block (11 lines × 2) graphify/extractors/sql.py:564— graphify/extractors/sql.py:564-574 | graphify/extractors/sql.py:581-591 — 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. 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.
Duplicated block (10 lines × 2) graphify/analyze.py:517— graphify/analyze.py:517-526 | worked/mixed-corpus/raw/analyze.py:351-360 — before extracting anything, compare `graphify/analyze.py` and `worked/mixed-corpus/raw/analyze.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) graphify/cache.py:348— graphify/cache.py:348-357 | graphify/cache.py:735-744 — 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. 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.
Duplicated block (10 lines × 2) REDACTED:5686— REDACTED:5686-5695 | REDACTED:6242-6251 — 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. 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.
Duplicated block (10 lines × 2) REDACTED:6919— REDACTED:6919-6928 | REDACTED:7421-7430 — 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:6919` 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 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.
Duplicated block (10 lines × 2) REDACTED:7954— REDACTED:7954-7963 | REDACTED:8002-8011 — 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 (10 lines × 2) graphify/extractors/apex.py:133— graphify/extractors/apex.py:133-142 | graphify/extractors/apex.py:157-166 — 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 (10 lines × 2) graphify/extractors/dm.py:285— graphify/extractors/dm.py:285-294 | graphify/extractors/dm.py:446-455 — 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. 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.
Duplicated block (10 lines × 2) graphify/extractors/erlang.py:42— graphify/extractors/erlang.py:42-51 | graphify/extractors/vbnet.py:46-55 — 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 `graphify/extractors/erlang.py:42` 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. 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.
Duplicated block (10 lines × 2) REDACTED:1581— REDACTED:1581-1590 | REDACTED:1639-1648 — 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. 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.
Duplicated block (10 lines × 2) graphify/install.py:213— graphify/install.py:213-222 | graphify/install.py:227-236 — 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. 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.
Duplicated block (10 lines × 2) graphify/symbol_resolution.py:457— graphify/symbol_resolution.py:457-466 | graphify/symbol_resolution.py:482-491 — 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. 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.
Duplicated block (6 lines × 2) graphify/build.py:316— graphify/build.py:316-321 | graphify/build.py:338-343 — 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. 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.
Duplicated block (6 lines × 2) graphify/cli.py:2390— graphify/cli.py:2390-2395 | graphify/cli.py:2896-2901 — 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 (6 lines × 2) REDACTED:2940— REDACTED:2940-2945 | REDACTED:2997-3002 — 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 (6 lines × 2) REDACTED:4793— REDACTED:4793-4798 | REDACTED:6456-6461 — 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. 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.
Duplicated block (6 lines × 2) REDACTED:1244— REDACTED:1244-1249 | REDACTED:1251-1256 — 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. 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.
Duplicated block (6 lines × 2) graphify/extractors/erlang.py:28— graphify/extractors/erlang.py:28-33 | graphify/extractors/vbnet.py:24-29 — 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.
Duplicated block (6 lines × 2) graphify/extractors/powershell.py:120— graphify/extractors/powershell.py:120-125 | graphify/extractors/powershell.py:137-146 — 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 (6 lines × 2) graphify/serve.py:2209— graphify/serve.py:2209-2214 | graphify/serve.py:2218-2223 — 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 `graphify/serve.py:2209` 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. 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.
Duplicated block (6 lines × 2) graphify/extractors/dm.py:316— graphify/extractors/dm.py:316-321 | graphify/extractors/dm.py:468-473 — 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.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×8
Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:4568— REDACTED:4568-4734 | REDACTED:5131-5368 | REDACTED:5376-5534 | REDACTED:6375-6605 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:4568— REDACTED:4568-4734 | REDACTED:5131-5368 | REDACTED:5376-5534 | REDACTED:5582-5900 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:7817— REDACTED:7817-7899 | REDACTED:7903-8013 | graphify/extractors/razor.py:12-196 | graphify/extractors/sln.py:11-92 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) graphify/extractors/csharp.py:106— graphify/extractors/csharp.py:106-172 | graphify/extractors/csharp.py:445-567 | REDACTED:3721-3964 | REDACTED:4002-4229 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) graphify/extractors/dm.py:18— graphify/extractors/dm.py:18-255 | graphify/extractors/elixir.py:17-464 | graphify/extractors/powershell.py:12-426 | graphify/extractors/zig.py:21-245 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) graphify/install.py:1058— graphify/install.py:1058-1088 | graphify/install.py:1945-1980 | graphify/install.py:2184-2211 | graphify/install.py:2408-2432 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) graphify/install.py:1132— graphify/install.py:1132-1144 | graphify/install.py:1882-1923 | graphify/install.py:2213-2234 | graphify/install.py:2434-2450 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) graphify/install.py:1146— graphify/install.py:1146-1161 | graphify/install.py:1927-1943 | graphify/install.py:2246-2261 | graphify/install.py:2452-2468 — 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 (8 lines × 2) graphify/cli.py:1576— graphify/cli.py:1576-1583 | graphify/cli.py:1716-1723 — 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 lines × 2) graphify/cluster.py:325— graphify/cluster.py:325-332 | worked/mixed-corpus/raw/cluster.py:49-56 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) REDACTED:1881— REDACTED:1881-1888 | REDACTED:1893-1900 — 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 lines × 2) REDACTED:4464— REDACTED:4464-4471 | REDACTED:4519-4526 — 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 lines × 2) graphify/extractors/powershell.py:135— graphify/extractors/powershell.py:135-146 | graphify/extractors/powershell.py:167-174 — 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. 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 after the matched lines, `graphify/extractors/powershell.py:176` calls `setdefault`, `lower` and `graphify/extractors/powershell.py:147` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8 lines × 2) REDACTED:3662— REDACTED:3662-3669 | REDACTED:3862-3869 — 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 lines × 2) graphify/serve.py:1065— graphify/serve.py:1065-1072 | graphify/serve.py:1094-1101 — 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 (16 lines × 2) graphify/analyze.py:340— graphify/analyze.py:340-355 | worked/mixed-corpus/raw/analyze.py:196-211 — before extracting anything, compare `graphify/analyze.py` and `worked/mixed-corpus/raw/analyze.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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, `graphify/analyze.py:339` calls `dict`, `degree` and `worked/mixed-corpus/raw/analyze.py:195` 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) graphify/cache.py:1711— graphify/cache.py:1711-1726 | graphify/cache.py:1921-1936 — 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 (16 lines × 2) graphify/extractors/apex.py:108— graphify/extractors/apex.py:108-123 | graphify/extractors/apex.py:139-154 — 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. 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.
Duplicated block (16 lines × 2) REDACTED:6565— REDACTED:6565-6580 | REDACTED:6879-6894 — 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 (16 lines × 2) REDACTED:10122— REDACTED:10122-10137 | REDACTED:10143-10158 — 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 (16 lines × 2) graphify/analyze.py:184— graphify/analyze.py:184-199 | worked/mixed-corpus/raw/analyze.py:90-105 — before extracting anything, compare `graphify/analyze.py` and `worked/mixed-corpus/raw/analyze.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (15 lines × 2) graphify/cli.py:1723— graphify/cli.py:1723-1737 | graphify/cli.py:1802-1816 — 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 (15 lines × 2) graphify/cli.py:4869— graphify/cli.py:4869-4883 | graphify/cli.py:5017-5031 — 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 `graphify/cli.py:4869` 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 (15 lines × 2) REDACTED:5999— REDACTED:5999-6013 | REDACTED:6138-6152 — 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:5999` 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 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 after the matched lines, `REDACTED:6154` calls `get` and `REDACTED:6015` does not — after which the two agree again for 3 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 (15 lines × 2) graphify/extractors/erlang.py:78— graphify/extractors/erlang.py:78-92 | graphify/extractors/r.py:91-105 — 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.
Duplicated block (15 lines × 2) graphify/extractors/powershell.py:354— graphify/extractors/powershell.py:354-368 | graphify/extractors/zig.py:222-236 — 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 (15 lines × 2) graphify/watch.py:2277— graphify/watch.py:2277-2291 | graphify/watch.py:2545-2559 — 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. 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, `graphify/watch.py:2544` calls `unlink` and `graphify/watch.py:2272` 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 (8–9 lines × 2) graphify/cluster.py:402— graphify/cluster.py:402-409 | worked/mixed-corpus/raw/cluster.py:81-89 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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.
Duplicated block (8–9 lines × 2) graphify/dedup.py:1260— graphify/dedup.py:1260-1268 | graphify/dedup.py:1566-1573 — 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. 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.
Duplicated block (8–9 lines × 2) REDACTED:6923— REDACTED:6923-6931 | REDACTED:7053-7060 — 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:6923` 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 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.
Duplicated block (8–9 lines × 2) graphify/extractors/dart.py:319— graphify/extractors/dart.py:319-327 | graphify/extractors/dart.py:554-561 — 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 `graphify/extractors/dart.py:319` 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 (8–9 lines × 2) graphify/install.py:821— graphify/install.py:821-829 | graphify/install.py:866-873 — 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. 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.
Duplicated block (6 lines × 3) REDACTED:6923— REDACTED:6923-6929 | REDACTED:7053-7058 | REDACTED:7425-7431 — 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 `REDACTED:6923` 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 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 after the matched lines, `REDACTED:7433` calls `get`, `setdefault` and `REDACTED:6930` 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 (6 lines × 3) graphify/extractors/cobol.py:108— graphify/extractors/cobol.py:108-113 | graphify/extractors/erlang.py:94-99 | graphify/extractors/solidity.py:285-290 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `graphify/extractors/cobol.py:108` 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 (6 lines × 3) REDACTED:6662— REDACTED:6662-6667 | REDACTED:6703-6709 | REDACTED:8095-8100 — 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 (6 lines × 3) REDACTED:6697— REDACTED:6697-6703 | REDACTED:7997-8002 | REDACTED:8090-8095 — 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 (6 lines × 3) REDACTED:7988— REDACTED:7988-7993 | REDACTED:8182-8188 | REDACTED:8225-8231 — 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 (19 lines × 2) graphify/cli.py:1612— graphify/cli.py:1612-1636 | graphify/cli.py:3064-3082 — 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 (19 lines × 2) REDACTED:686— REDACTED:686-704 | REDACTED:2484-2502 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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.
Duplicated block (19 lines × 2) graphify/install.py:1271— graphify/install.py:1271-1289 | graphify/install.py:1445-1463 — 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. 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.
Duplicated block (19 lines × 2) graphify/mcp_ingest.py:204— graphify/mcp_ingest.py:204-222 | graphify/mcp_ingest.py:227-245 — 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 (14 lines × 2) graphify/build.py:2287— graphify/build.py:2287-2300 | graphify/build.py:2555-2568 — 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 (14 lines × 2) graphify/cli.py:1429— graphify/cli.py:1429-1442 | graphify/cli.py:1504-1517 — 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 `graphify/cli.py:1429` 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 (14 lines × 2) REDACTED:2370— REDACTED:2370-2383 | REDACTED:2411-2424 — 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 (14 lines × 2) graphify/extractors/ocaml.py:198— graphify/extractors/ocaml.py:198-211 | graphify/extractors/ocaml.py:212-225 — 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. 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, `graphify/extractors/ocaml.py:196` calls `next` and `graphify/extractors/ocaml.py:211` 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 (13 lines × 2) graphify/exporters/graphdb.py:65— graphify/exporters/graphdb.py:65-77 | graphify/exporters/graphdb.py:178-190 — 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 (13 lines × 2) graphify/extractors/apex.py:144— graphify/extractors/apex.py:144-156 | graphify/extractors/apex.py:167-179 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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.
Duplicated block (13 lines × 2) graphify/extractors/dart.py:289— graphify/extractors/dart.py:289-301 | graphify/extractors/dart.py:509-521 — 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 `graphify/extractors/dart.py:289` 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 (13 lines × 2) graphify/extractors/elixir.py:235— graphify/extractors/elixir.py:235-250 | graphify/extractors/elixir.py:255-267 — 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. 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.
Duplicated block (9 lines × 3) REDACTED:5639— REDACTED:5639-5647 | REDACTED:6004-6012 | REDACTED:6143-6151 — 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. 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 after the matched lines, `REDACTED:6154` calls `get` and `REDACTED:6015` 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 (9 lines × 3) REDACTED:6840— REDACTED:6840-6848 | REDACTED:6918-6926 | REDACTED:7420-7428 — 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. 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 (9 lines × 3) graphify/extractors/dart.py:302— graphify/extractors/dart.py:302-310 | graphify/extractors/dart.py:311-319 | graphify/extractors/dart.py:522-530 — 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 `graphify/extractors/dart.py:302` 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 (9 lines × 3) graphify/extractors/dart.py:328— graphify/extractors/dart.py:328-336 | graphify/extractors/dart.py:337-345 | graphify/extractors/dart.py:531-539 — 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 `graphify/extractors/dart.py:328` 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 (7 lines × 4) REDACTED:7843— REDACTED:7843-7849 | REDACTED:7922-7928 | graphify/extractors/razor.py:18-24 | graphify/extractors/sln.py:17-23 — there are 4 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (7 lines × 4) graphify/extractors/dm.py:53— graphify/extractors/dm.py:53-59 | graphify/extractors/elixir.py:53-59 | graphify/extractors/powershell.py:49-55 | graphify/extractors/zig.py:55-61 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `graphify/extractors/dm.py:53` 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 (7 lines × 4) REDACTED:7988— REDACTED:7988-7994 | REDACTED:8225-8232 | graphify/extractors/go.py:325-331 | graphify/extractors/rust.py:435-441 — there are 4 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (7 lines × 4) graphify/install.py:1135— graphify/install.py:1135-1141 | graphify/install.py:1910-1916 | graphify/install.py:2223-2230 | graphify/install.py:2440-2447 — all 4 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 × 3) graphify/extractors/blade.py:31— graphify/extractors/blade.py:31-37 | graphify/extractors/blade.py:42-48 | graphify/extractors/blade.py:52-58 — 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 `graphify/extractors/blade.py:31` 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 (7 lines × 3) graphify/extractors/elixir.py:457— graphify/extractors/elixir.py:457-463 | graphify/extractors/r.py:472-481 | graphify/extractors/zig.py:238-244 — 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. 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 (7 lines × 3) REDACTED:7330— REDACTED:7330-7336 | REDACTED:7936-7942 | REDACTED:7953-7959 — 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 × 3) graphify/extractors/erlang.py:42— graphify/extractors/erlang.py:42-48 | graphify/extractors/r.py:55-61 | graphify/extractors/vbnet.py:44-52 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `graphify/extractors/vbnet.py:44` 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 (5 lines × 3) graphify/cli.py:1464— graphify/cli.py:1464-1468 | graphify/cli.py:2397-2401 | graphify/cli.py:3754-3758 — 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 `graphify/cli.py:1464` 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 (5 lines × 3) graphify/cli.py:4114— graphify/cli.py:4114-4118 | graphify/cli.py:4127-4131 | graphify/watch.py:1806-1810 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (5 lines × 3) graphify/extractors/dm.py:44— graphify/extractors/dm.py:44-48 | graphify/extractors/powershell.py:42-46 | graphify/extractors/zig.py:48-52 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `graphify/extractors/dm.py:44` 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 (5 lines × 3) graphify/serve.py:634— graphify/serve.py:634-643 | graphify/serve.py:1597-1601 | graphify/serve.py:1692-1696 — 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 `graphify/serve.py:634` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `graphify/serve.py:1697` calls `join`, `_search_tokens`, `get` and `graphify/serve.py:1602` 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 (27 lines × 2) graphify/analyze.py:446— graphify/analyze.py:446-472 | worked/mixed-corpus/raw/analyze.py:292-318 — before extracting anything, compare `graphify/analyze.py` and `worked/mixed-corpus/raw/analyze.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (27 lines × 2) graphify/analyze.py:528— graphify/analyze.py:528-554 | worked/mixed-corpus/raw/analyze.py:362-388 — before extracting anything, compare `graphify/analyze.py` and `worked/mixed-corpus/raw/analyze.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (27 lines × 2) graphify/analyze.py:622— graphify/analyze.py:622-648 | worked/mixed-corpus/raw/analyze.py:439-465 — before extracting anything, compare `graphify/analyze.py` and `worked/mixed-corpus/raw/analyze.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (25 lines × 2) graphify/analyze.py:156— graphify/analyze.py:156-180 | worked/mixed-corpus/raw/analyze.py:62-86 — before extracting anything, compare `graphify/analyze.py` and `worked/mixed-corpus/raw/analyze.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (25 lines × 2) graphify/extractors/erlang.py:102— graphify/extractors/erlang.py:102-126 | graphify/extractors/vbnet.py:115-139 — 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 `graphify/extractors/erlang.py:102` 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 (25 lines × 2) graphify/extractors/fortran.py:144— graphify/extractors/fortran.py:144-168 | graphify/extractors/powershell.py:76-100 — 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 (24 lines × 2) graphify/analyze.py:680— graphify/analyze.py:680-703 | worked/mixed-corpus/raw/analyze.py:480-503 — before extracting anything, compare `graphify/analyze.py` and `worked/mixed-corpus/raw/analyze.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (24 lines × 2) graphify/cli.py:1695— graphify/cli.py:1695-1718 | graphify/cli.py:1766-1789 — 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 (24 lines × 2) REDACTED:6825— REDACTED:6825-6848 | REDACTED:7401-7428 — 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:7401` 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. 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.
Duplicated block (20 lines × 2) REDACTED:10566— REDACTED:10566-10585 | REDACTED:10588-10607 — 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 (20 lines × 2) graphify/install.py:386— graphify/install.py:386-405 | graphify/install.py:1215-1234 — 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 (20 lines × 2) graphify/install.py:2683— graphify/install.py:2683-2702 | graphify/install.py:2717-2736 — 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 (18 lines × 2) REDACTED:218— REDACTED:218-235 | graphify/watch.py:368-385 — 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 `REDACTED:218` 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. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `cwd` to `"str | Path | None" = None` in one and `Path | str | None = None` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (18 lines × 2) graphify/extractors/go.py:269— graphify/extractors/go.py:269-286 | graphify/extractors/julia.py:46-63 — 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 `graphify/extractors/go.py:269` 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 (18 lines × 2) REDACTED:3867— REDACTED:3867-3884 | REDACTED:4156-4173 — 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. 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, `REDACTED:4155` calls `lower` and `REDACTED:3866` does not — after which the two agree again for 3 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 (17 lines × 2) REDACTED:4220— REDACTED:4220-4236 | REDACTED:4406-4422 — 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. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `src` to `str` in one and `str | None` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (17 lines × 2) REDACTED:1202— REDACTED:1202-1218 | REDACTED:1560-1577 — 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 (17 lines × 2) REDACTED:5020— REDACTED:5020-5036 | REDACTED:5050-5066 — 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. 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.
Duplicated block (9–10 lines × 2) graphify/cli.py:1990— graphify/cli.py:1990-1999 | graphify/serve.py:2093-2101 — 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 (9–10 lines × 2) REDACTED:6944— REDACTED:6944-6953 | REDACTED:8008-8016 — 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–10 lines × 2) graphify/extractors/robot.py:195— graphify/extractors/robot.py:195-203 | graphify/extractors/robot.py:222-231 — 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 (21 lines × 2) graphify/extractors/commonlisp.py:117— graphify/extractors/commonlisp.py:117-137 | graphify/extractors/ocaml.py:57-77 — 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 (21 lines × 2) graphify/extractors/erlang.py:54— graphify/extractors/erlang.py:54-74 | graphify/extractors/vbnet.py:58-78 — 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 `graphify/extractors/erlang.py:54` 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 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.
Duplicated block (14–18 lines × 2) graphify/install.py:2213— graphify/install.py:2213-2230 | graphify/install.py:2434-2447 — 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 `graphify/install.py:2213` 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 (14–18 lines × 2) graphify/watch.py:2318— graphify/watch.py:2318-2335 | graphify/watch.py:2623-2636 — 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 (16–17 lines × 2) REDACTED:7333— REDACTED:7333-7349 | REDACTED:7400-7415 — 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:7333` 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 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 after the matched lines, `REDACTED:7416` calls `setdefault`, `set`, `update` and `REDACTED:7364` 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 (16–17 lines × 2) REDACTED:8058— REDACTED:8058-8073 | REDACTED:8203-8219 — 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. 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.
Duplicated block (16 lines × 3) graphify/cli.py:680— graphify/cli.py:680-695 | graphify/cli.py:759-774 | graphify/cli.py:780-795 — 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. 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.
Duplicated block (16 lines × 3) graphify/mcp_ingest.py:203— graphify/mcp_ingest.py:203-218 | graphify/mcp_ingest.py:226-241 | graphify/mcp_ingest.py:251-266 — 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 `graphify/mcp_ingest.py:203` 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 (10–12 lines × 2) REDACTED:6663— REDACTED:6663-6672 | REDACTED:6704-6715 — 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 (10–12 lines × 2) graphify/extractors/solidity.py:594— graphify/extractors/solidity.py:594-605 | graphify/extractors/solidity.py:680-689 — 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 `graphify/extractors/solidity.py:594` 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 (10 lines × 3) graphify/cli.py:2504— graphify/cli.py:2504-2513 | graphify/cli.py:2557-2566 | graphify/watch.py:2455-2464 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (10 lines × 3) graphify/extractors/elixir.py:49— graphify/extractors/elixir.py:49-58 | graphify/extractors/powershell.py:45-54 | graphify/extractors/zig.py:51-60 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `graphify/extractors/elixir.py:49` 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 (8 lines × 3) REDACTED:7044— REDACTED:7044-7051 | REDACTED:7625-7632 | REDACTED:8223-8230 — 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 (8 lines × 3) graphify/extractors/fortran.py:278— graphify/extractors/fortran.py:278-285 | graphify/extractors/fortran.py:322-329 | graphify/extractors/fortran.py:336-343 — 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. 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, `graphify/extractors/fortran.py:333` calls `emit_signature_refs` and `graphify/extractors/fortran.py:275` 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 (7–8 lines × 2) graphify/extractors/commonlisp.py:524— graphify/extractors/commonlisp.py:524-530 | graphify/extractors/powershell.py:353-360 — 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. 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 (7–8 lines × 2) REDACTED:6695— REDACTED:6695-6702 | REDACTED:8079-8085 — 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 (6 lines × 4) graphify/extractors/dart.py:297— graphify/extractors/dart.py:297-302 | graphify/extractors/dart.py:323-328 | graphify/extractors/dart.py:517-522 | graphify/extractors/dart.py:557-562 — all 4 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 (6 lines × 4) graphify/extractors/fortran.py:267— graphify/extractors/fortran.py:267-272 | graphify/extractors/fortran.py:280-285 | graphify/extractors/fortran.py:324-329 | graphify/extractors/fortran.py:338-343 — all 4 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.
AC3 · Page structure· Page without a main landmark · ×1
Page without a main landmark worked/rsl-siege-manager/graph.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
AC7 · A11y enforcement· Accessibility enforcement below the top rung · ×1
Accessibility enforcement below the top rung — No accessibility enforcement found — no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 1 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.
No authorization graphify/serve.py:3058— This repository serves requests — a request handler (uvicorn.run() (graphify/serve.py:3058) — and no route guard, auth-gate middleware, global guard or imperative check that refuses a caller (401/403, an Unauthorized/Forbidden error) was found: its endpoints may be unprotected.
cli.dispatch_command (cyclomatic 850) graphify/cli.py:1408— cli.dispatch_command has cyclomatic complexity 850 (threshold 15). To reduce it, separate the cases: extract each independent 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.extract (cyclomatic 372) REDACTED:9272— extract.extract has cyclomatic complexity 372 (threshold 15). To reduce it, separate the cases: extract each independent 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.build_from_json (cyclomatic 165) graphify/build.py:1270— build.build_from_json has cyclomatic complexity 165 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
watch._rebuild_code (cyclomatic 149) graphify/watch.py:1677— watch._rebuild_code has cyclomatic complexity 149 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
dedup.deduplicate_entities (cyclomatic 119) graphify/dedup.py:950— dedup.deduplicate_entities has cyclomatic complexity 119 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
dart.extract_dart (cyclomatic 117) graphify/extractors/dart.py:14— dart.extract_dart has cyclomatic complexity 117 (threshold 15). To reduce it, separate the cases: extract each independent 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._extract_generic (cyclomatic 117) REDACTED:5995— engine._extract_generic has cyclomatic complexity 117 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
install.dispatch_install_cli (cyclomatic 111) graphify/install.py:2536— install.dispatch_install_cli 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.
resolution._apply_symbol_resolution_facts (cyclomatic 98) REDACTED:1248— resolution._apply_symbol_resolution_facts has cyclomatic complexity 98 (threshold 15). To reduce it, separate the cases: extract each independent 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._js_extra_walk (cyclomatic 84) REDACTED:4317— engine._js_extra_walk has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ruby_resolution.resolve_ruby_member_calls (cyclomatic 84) graphify/ruby_resolution.py:77— ruby_resolution.resolve_ruby_member_calls has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent 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.build_merge (cyclomatic 83) graphify/build.py:2351— build.build_merge has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
solidity.extract_solidity (cyclomatic 81) graphify/extractors/solidity.py:268— solidity.extract_solidity has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent 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._resolve_python_member_calls (cyclomatic 80) REDACTED:4764— extract._resolve_python_member_calls has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent 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._ts_receiver_type_table (cyclomatic 79) REDACTED:3574— engine._ts_receiver_type_table has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent 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.generate (cyclomatic 63) graphify/report.py:96— report.generate has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
detect.detect (cyclomatic 61) graphify/detect.py:1960— detect.detect has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent 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._resolve_typescript_member_calls (cyclomatic 59) REDACTED:5126— extract._resolve_typescript_member_calls has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
watch._reconcile_existing_graph (cyclomatic 56) graphify/watch.py:993— watch._reconcile_existing_graph has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent 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._run_hook_guard (cyclomatic 55) graphify/cli.py:1104— cli._run_hook_guard has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
erlang.extract_erlang (cyclomatic 55) graphify/extractors/erlang.py:77— erlang.extract_erlang has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent 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._resolve_csharp_member_calls (cyclomatic 54) REDACTED:5577— extract._resolve_csharp_member_calls has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent 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._rewire_unique_stub_nodes (cyclomatic 53) REDACTED:3926— extract._rewire_unique_stub_nodes has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
resolution._resolve_java_type_references (cyclomatic 53) REDACTED:3715— resolution._resolve_java_type_references has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
llm._call_llm (cyclomatic 53) graphify/llm.py:3041— llm._call_llm has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent 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._resolve_swift_member_calls (cyclomatic 48) REDACTED:4563— extract._resolve_swift_member_calls has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent 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._js_find_exported_objects (cyclomatic 47) REDACTED:4248— engine._js_find_exported_objects has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent 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.to_obsidian (cyclomatic 46) REDACTED:760— export.to_obsidian has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
detect.save_manifest (cyclomatic 44) graphify/detect.py:2575— detect.save_manifest has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
html.to_html (cyclomatic 44) graphify/exporters/html.py:508— html.to_html has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
extract._resolve_objc_member_calls (cyclomatic 44) REDACTED:6370— extract._resolve_objc_member_calls has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
extract.extract_xaml (cyclomatic 44) REDACTED:8413— extract.extract_xaml has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cache.save_semantic_cache (cyclomatic 43) graphify/cache.py:1525— cache.save_semantic_cache has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent 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._resolve_java_member_calls (cyclomatic 43) REDACTED:6106— extract._resolve_java_member_calls has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent 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._csharp_method_receiver_types (cyclomatic 43) REDACTED:3339— engine._csharp_method_receiver_types has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
resolution._resolve_php_type_references (cyclomatic 43) REDACTED:3996— resolution._resolve_php_type_references has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
sql.extract_sql (cyclomatic 43) graphify/extractors/sql.py:453— sql.extract_sql has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
serve._subgraph_to_text (cyclomatic 43) graphify/serve.py:1120— serve._subgraph_to_text has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
resolution._collect_js_symbol_resolution_facts (cyclomatic 42) REDACTED:2213— resolution._collect_js_symbol_resolution_facts has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
terraform.extract_terraform (cyclomatic 42) graphify/extractors/terraform.py:177— terraform.extract_terraform has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
dedup._llm_tiebreak (cyclomatic 41) graphify/dedup.py:1530— dedup._llm_tiebreak 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.
resolution._disambiguate_colliding_node_ids (cyclomatic 41) REDACTED:1060— resolution._disambiguate_colliding_node_ids 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.
cluster.cluster (cyclomatic 40) graphify/cluster.py:233— cluster.cluster has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
dedup._path_qualify_dropped_collisions (cyclomatic 40) graphify/dedup.py:741— dedup._path_qualify_dropped_collisions has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
serve._score_query (cyclomatic 40) graphify/serve.py:575— serve._score_query has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
apex.extract_apex (cyclomatic 39) graphify/extractors/apex.py:9— apex.extract_apex 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.
resolution._resolve_cross_file_imports (cyclomatic 39) REDACTED:2913— resolution._resolve_cross_file_imports 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.
extract._resolve_cpp_member_calls (cyclomatic 38) REDACTED:5371— extract._resolve_cpp_member_calls 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.
extract._merge_csharp_partial_class_nodes (cyclomatic 36) REDACTED:4249— extract._merge_csharp_partial_class_nodes has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
extract._resolve_php_member_calls (cyclomatic 36) REDACTED:5954— extract._resolve_php_member_calls has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
engine._php_get_route_name (cyclomatic 36) REDACTED:5909— engine._php_get_route_name has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
llm.extract_corpus_parallel (cyclomatic 36) graphify/llm.py:2692— llm.extract_corpus_parallel has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
export.to_json (cyclomatic 35) REDACTED:287— export.to_json 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.
extract._import_js (cyclomatic 35) REDACTED:918— extract._import_js 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.
extract._resolve_c_include_edges (cyclomatic 35) REDACTED:6679— extract._resolve_c_include_edges 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.
engine._csharp_collect_type_refs (cyclomatic 35) REDACTED:393— engine._csharp_collect_type_refs 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.
index.graphify (cyclomatic 35) graphify/pi/index.ts:109— index.graphify has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 3 of the 35 points are its own statements and the rest belongs to one function literal inside it that branches (line 130). 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.finalize_raw_graph_endpoints (cyclomatic 34) graphify/build.py:266— build.finalize_raw_graph_endpoints has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
razor.extract_razor (cyclomatic 34) graphify/extractors/razor.py:11— razor.extract_razor has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
symbol_resolution.resolve_bash_source_edges (cyclomatic 34) graphify/symbol_resolution.py:427— symbol_resolution.resolve_bash_source_edges has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent 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._import_python (cyclomatic 33) REDACTED:754— extract._import_python 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.
extract.extract_csproj (cyclomatic 33) REDACTED:7902— extract.extract_csproj 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.
engine._kotlin_collect_type_refs (cyclomatic 33) REDACTED:1228— engine._kotlin_collect_type_refs 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.
CsharpNameResolver.__init__ (cyclomatic 32) graphify/extractors/csharp.py:204— CsharpNameResolver.__init__ 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.
engine._java_collect_type_refs (cyclomatic 32) REDACTED:563— engine._java_collect_type_refs 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.
resolution._resolve_go_type_references (cyclomatic 32) REDACTED:3612— resolution._resolve_go_type_references 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.
prs.cmd_prs (cyclomatic 32) graphify/prs.py:728— prs.cmd_prs 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.
semantic_cleanup.sanitize_semantic_fragment (cyclomatic 32) graphify/semantic_cleanup.py:172— semantic_cleanup.sanitize_semantic_fragment 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.
serve._find_node_tiers (cyclomatic 32) graphify/serve.py:1629— serve._find_node_tiers 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.
watch._reconcile_markdown_links (cyclomatic 32) graphify/watch.py:691— watch._reconcile_markdown_links 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.
resolution._ts_walk_class_members (cyclomatic 31) REDACTED:2104— resolution._ts_walk_class_members 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.
resolution._collect_python_symbol_resolution_facts (cyclomatic 31) REDACTED:2786— resolution._collect_python_symbol_resolution_facts 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.
analyze.suggest_questions (cyclomatic 30) graphify/analyze.py:475— analyze.suggest_questions has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
build.merge_raw_extraction (cyclomatic 30) graphify/build.py:2207— build.merge_raw_extraction has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cobol.extract_cobol (cyclomatic 30) graphify/extractors/cobol.py:99— cobol.extract_cobol has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
engine._python_collect_type_refs (cyclomatic 30) REDACTED:107— engine._python_collect_type_refs has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
resolution._ts_collect_type_refs (cyclomatic 30) REDACTED:2056— resolution._ts_collect_type_refs has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
sql._scan_sql (cyclomatic 30) graphify/extractors/sql.py:113— sql._scan_sql has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
build._lost_saved_semantic_nodes (cyclomatic 29) graphify/build.py:69— build._lost_saved_semantic_nodes 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.
cross_repo_calls.link_cross_repo_member_calls (cyclomatic 29) graphify/cross_repo_calls.py:211— cross_repo_calls.link_cross_repo_member_calls 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.
pascal._extract_pascal_regex (cyclomatic 29) graphify/extractors/pascal.py:231— pascal._extract_pascal_regex 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.
resolution._merge_decl_def_classes (cyclomatic 29) REDACTED:3209— resolution._merge_decl_def_classes 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.
install._platform_skill_destination (cyclomatic 29) graphify/install.py:206— install._platform_skill_destination 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.
cli._stale_graph_sources (cyclomatic 28) graphify/cli.py:438— cli._stale_graph_sources 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.
detect.detect_incremental (cyclomatic 28) graphify/detect.py:2886— detect.detect_incremental 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.
export.to_canvas (cyclomatic 28) REDACTED:1113— export.to_canvas 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.
extract._resolve_kotlin_qualified_calls (cyclomatic 28) REDACTED:6893— extract._resolve_kotlin_qualified_calls 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.
resolution._read_tsconfig_aliases (cyclomatic 28) REDACTED:124— resolution._read_tsconfig_aliases 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.
llm._call_openai_compat (cyclomatic 28) graphify/llm.py:1512— llm._call_openai_compat has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
cli._zero_node_stamped_semantic_sources (cyclomatic 27) graphify/cli.py:720— cli._zero_node_stamped_semantic_sources has cyclomatic complexity 27 (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.
extract._suppress_ambiguous_python_imports (cyclomatic 27) REDACTED:307— extract._suppress_ambiguous_python_imports 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.
extract._resolve_rust_self_member_calls (cyclomatic 27) REDACTED:7004— extract._resolve_rust_self_member_calls 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.
engine._kotlin_annotation_class_literal_refs (cyclomatic 27) REDACTED:1145— engine._kotlin_annotation_class_literal_refs 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.
engine._require_imports_js (cyclomatic 27) REDACTED:3880— engine._require_imports_js 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.
serve._shortest_path_text (cyclomatic 27) graphify/serve.py:2067— serve._shortest_path_text 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.
gen.main (cyclomatic 27) tools/skillgen/gen.py:1501— gen.main 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.
build._tier_replacement_sources (cyclomatic 26) graphify/build.py:2141— build._tier_replacement_sources 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.
extract._ejs_mask_non_script (cyclomatic 26) REDACTED:2804— extract._ejs_mask_non_script 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.
extract.collect_files (cyclomatic 26) REDACTED:11196— extract.collect_files 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.
engine._swift_collect_type_refs (cyclomatic 26) REDACTED:1587— engine._swift_collect_type_refs 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.
engine._scala_collect_type_refs (cyclomatic 26) REDACTED:1944— engine._scala_collect_type_refs 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.
rust._rust_collect_type_refs (cyclomatic 26) graphify/extractors/rust.py:48— rust._rust_collect_type_refs 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.
interface_dispatch.resolve_interface_dispatch (cyclomatic 26) graphify/interface_dispatch.py:93— interface_dispatch.resolve_interface_dispatch 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.
validate.validate_extraction (cyclomatic 26) graphify/validate.py:10— validate.validate_extraction 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.
dedup._disambiguate_defining_collisions (cyclomatic 25) graphify/dedup.py:675— dedup._disambiguate_defining_collisions 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.
csharp._resolve_cross_file_csharp_imports (cyclomatic 25) graphify/extractors/csharp.py:100— csharp._resolve_cross_file_csharp_imports 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.
engine._python_class_ref (cyclomatic 25) REDACTED:5273— engine._python_class_ref 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.
llm.extract_files_direct (cyclomatic 25) graphify/llm.py:2066— llm.extract_files_direct 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.
watch._rebuild_lock (cyclomatic 25) graphify/watch.py:188— watch._rebuild_lock has cyclomatic complexity 25 (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.
detect._env_command_args (cyclomatic 24) graphify/detect.py:353— detect._env_command_args 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.
detect._is_noise_dir (cyclomatic 24) graphify/detect.py:1152— detect._is_noise_dir 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.
extract._repoint_python_sibling_imports (cyclomatic 24) REDACTED:516— extract._repoint_python_sibling_imports 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.
extract._csharp_broken_escape_offsets (cyclomatic 24) REDACTED:3428— extract._csharp_broken_escape_offsets 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.
engine._ts_extra_walk (cyclomatic 24) REDACTED:4666— engine._ts_extra_walk has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
markdown_resolution.resolve_markdown_mentions (cyclomatic 24) graphify/markdown_resolution.py:146— markdown_resolution.resolve_markdown_mentions 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.
prs.triage_with_opus (cyclomatic 24) graphify/prs.py:634— prs.triage_with_opus 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.
cargo_introspect.introspect_cargo (cyclomatic 23) graphify/cargo_introspect.py:80— cargo_introspect.introspect_cargo 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.
cli._zero_node_stamped_code_sources (cyclomatic 23) graphify/cli.py:623— cli._zero_node_stamped_code_sources 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.
extract._merge_swift_extensions (cyclomatic 23) REDACTED:4148— extract._merge_swift_extensions 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.
analyze.suggest_questions (cyclomatic 23) worked/mixed-corpus/raw/analyze.py:321— analyze.suggest_questions 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.
affected.affected_nodes (cyclomatic 22) graphify/affected.py:267— affected.affected_nodes 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.
build._semantic_id_remap (cyclomatic 22) graphify/build.py:1086— build._semantic_id_remap 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.
extract._resolve_go_member_calls (cyclomatic 22) REDACTED:7157— extract._resolve_go_member_calls 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.
solidity.resolve_solidity_inherited_calls (cyclomatic 22) graphify/extractors/solidity.py:122— solidity.resolve_solidity_inherited_calls 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.
vbnet.extract_vbnet (cyclomatic 22) graphify/extractors/vbnet.py:81— vbnet.extract_vbnet 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.
llm._call_claude_cli (cyclomatic 22) graphify/llm.py:1812— llm._call_claude_cli 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.
llm._extract_with_adaptive_retry (cyclomatic 22) graphify/llm.py:2444— llm._extract_with_adaptive_retry 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.find_import_cycles (cyclomatic 21) graphify/analyze.py:720— analyze.find_import_cycles 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.
cli._graph_hint (cyclomatic 21) graphify/cli.py:236— cli._graph_hint 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.
dm.extract_dmm (cyclomatic 21) graphify/extractors/dm.py:370— dm.extract_dmm 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.
engine._cpp_collect_type_refs (cyclomatic 21) REDACTED:1837— engine._cpp_collect_type_refs 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.
engine._ts_emit_decorator_edges (cyclomatic 21) REDACTED:10636— engine._ts_emit_decorator_edges 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.
go._go_collect_type_refs (cyclomatic 21) graphify/extractors/go.py:106— go._go_collect_type_refs 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.
markdown._resolve_markdown_link (cyclomatic 21) graphify/extractors/markdown.py:259— markdown._resolve_markdown_link 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.
resolution._package_entry_candidates (cyclomatic 21) REDACTED:627— resolution._package_entry_candidates 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.
prs.render_dashboard (cyclomatic 21) graphify/prs.py:458— prs.render_dashboard 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.
build.graph_has_legacy_ids (cyclomatic 20) graphify/build.py:1183— build.graph_has_legacy_ids 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.
cache.load_cached (cyclomatic 20) graphify/cache.py:1055— cache.load_cached 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.
cache.scope_semantic_result (cyclomatic 20) graphify/cache.py:1829— cache.scope_semantic_result 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.
diagnostics.diagnose_extraction (cyclomatic 20) graphify/diagnostics.py:156— diagnostics.diagnose_extraction 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.
extract._repoint_python_package_imports (cyclomatic 20) REDACTED:440— extract._repoint_python_package_imports 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.
extract._rescue_js_dynamic_imports (cyclomatic 20) REDACTED:2227— extract._rescue_js_dynamic_imports 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.
extract._xaml_csharp_class_nodes (cyclomatic 20) REDACTED:8282— extract._xaml_csharp_class_nodes 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.
csharp._build_csharp_type_def_index (cyclomatic 20) graphify/extractors/csharp.py:20— csharp._build_csharp_type_def_index 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.
engine._js_scan_member_assignments (cyclomatic 20) REDACTED:4174— engine._js_scan_member_assignments 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.
engine._ruby_extra_walk (cyclomatic 20) REDACTED:5778— engine._ruby_extra_walk 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.
markdown.extract_markdown (cyclomatic 20) graphify/extractors/markdown.py:369— markdown.extract_markdown 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.
rust._rust_simple_generic_impl_key (cyclomatic 20) graphify/extractors/rust.py:109— rust._rust_simple_generic_impl_key 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.
semantic_cleanup.validate_semantic_fragment (cyclomatic 20) graphify/semantic_cleanup.py:44— semantic_cleanup.validate_semantic_fragment 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.
graphdb.push_to_falkordb (cyclomatic 19) graphify/exporters/graphdb.py:103— graphdb.push_to_falkordb 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.
extract._bind_member_field_tables (cyclomatic 19) REDACTED:5903— extract._bind_member_field_tables 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.
extract._resolve_kotlin_member_calls (cyclomatic 19) REDACTED:7396— extract._resolve_kotlin_member_calls 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.
extract._extract_parallel (cyclomatic 19) REDACTED:9085— extract._extract_parallel 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.
engine._php_receiver_type_table (cyclomatic 19) REDACTED:1002— engine._php_receiver_type_table 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.
engine._swift_local_var_types (cyclomatic 19) REDACTED:3109— engine._swift_local_var_types 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.
r.resolve_r_sourced_calls (cyclomatic 19) graphify/extractors/r.py:26— r.resolve_r_sourced_calls 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.
resolution._resolve_js_import_path (cyclomatic 19) REDACTED:52— resolution._resolve_js_import_path 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.
resolution._merge_go_package_types (cyclomatic 19) REDACTED:3361— resolution._merge_go_package_types 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.
sln.extract_sln (cyclomatic 19) graphify/extractors/sln.py:10— sln.extract_sln 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.
global_graph.global_add (cyclomatic 19) graphify/global_graph.py:79— global_graph.global_add 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.
symbol_resolution.resolve_python_import_guided_calls (cyclomatic 19) graphify/symbol_resolution.py:239— symbol_resolution.resolve_python_import_guided_calls 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.
analyze._surprise_score (cyclomatic 18) graphify/analyze.py:246— analyze._surprise_score has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
build._alias_index (cyclomatic 18) graphify/build.py:1010— build._alias_index 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.
export.to_graphml (cyclomatic 18) REDACTED:1292— export.to_graphml has cyclomatic complexity 18 (threshold 15). 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.
extract._python_absolute_import_alias_files (cyclomatic 18) REDACTED:236— extract._python_absolute_import_alias_files 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.
extract._xaml_codebehind_symbols (cyclomatic 18) REDACTED:8133— extract._xaml_codebehind_symbols 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.
extract._xaml_communitytoolkit_members (cyclomatic 18) REDACTED:8346— extract._xaml_communitytoolkit_members 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.
csharp._resolve_csharp_type_references (cyclomatic 18) graphify/extractors/csharp.py:439— csharp._resolve_csharp_type_references 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.
engine._csharp_method_signature (cyclomatic 18) REDACTED:193— engine._csharp_method_signature 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.
engine._python_property_reads (cyclomatic 18) REDACTED:2619— engine._python_property_reads 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.
engine._csharp_extra_walk (cyclomatic 18) REDACTED:4778— engine._csharp_extra_walk 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.
resolution._resolve_python_namespace_dir (cyclomatic 18) REDACTED:2710— resolution._resolve_python_namespace_dir 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.
resolution._resolve_cross_file_java_imports (cyclomatic 18) REDACTED:3434— resolution._resolve_cross_file_java_imports 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.
solidity.resolve_solidity_type_references (cyclomatic 18) graphify/extractors/solidity.py:222— solidity.resolve_solidity_type_references 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.
install._agents_uninstall (cyclomatic 18) graphify/install.py:2110— install._agents_uninstall 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.
__main__._run_cli (cyclomatic 17) graphify/__main__.py:822— __main__._run_cli 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.
build.prefix_graph_for_global (cyclomatic 17) graphify/build.py:2857— build.prefix_graph_for_global 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.
cross_repo_types.link_shared_type_declarations (cyclomatic 17) graphify/cross_repo_types.py:32— cross_repo_types.link_shared_type_declarations 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.
export.backup_if_protected (cyclomatic 17) REDACTED:42— export.backup_if_protected 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.
extract._resolve_csharp_qualified_calls (cyclomatic 17) REDACTED:6820— extract._resolve_csharp_qualified_calls 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.
extract.extract_slnx (cyclomatic 17) REDACTED:7816— extract.extract_slnx 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.
engine._java_receiver_chain (cyclomatic 17) REDACTED:661— engine._java_receiver_chain 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.
engine._php_collect_type_refs (cyclomatic 17) REDACTED:941— engine._php_collect_type_refs 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.
engine._python_alias_name (cyclomatic 17) REDACTED:1323— engine._python_alias_name 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.
engine._python_pre_scan_underscore_collisions (cyclomatic 17) REDACTED:1360— engine._python_pre_scan_underscore_collisions 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.
engine._swift_attribute_type_name (cyclomatic 17) REDACTED:1645— engine._swift_attribute_type_name 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.
engine._scan_python_nested_function_declarations (cyclomatic 17) REDACTED:4048— engine._scan_python_nested_function_declarations 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.
engine._ts_mark_public_twins (cyclomatic 17) REDACTED:10517— engine._ts_mark_public_twins 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.
resolution._resolve_python_module_path (cyclomatic 17) REDACTED:2637— resolution._resolve_python_module_path 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.
vbnet.resolve_vbnet_partial_calls (cyclomatic 17) graphify/extractors/vbnet.py:21— vbnet.resolve_vbnet_partial_calls 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.
verilog._augment_systemverilog_semantics (cyclomatic 17) graphify/extractors/verilog.py:103— verilog._augment_systemverilog_semantics has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
install._strip_json_comments (cyclomatic 17) graphify/install.py:1573— install._strip_json_comments 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.
serve._resolve_path_scoped_symbol (cyclomatic 17) graphify/serve.py:1534— serve._resolve_path_scoped_symbol 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.
watch._referenced_unscanned_identities (cyclomatic 17) graphify/watch.py:920— watch._referenced_unscanned_identities 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.
wiki.to_wiki (cyclomatic 17) graphify/wiki.py:304— wiki.to_wiki 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.
__main__._refresh_v1_opencode_plugins (cyclomatic 16) graphify/__main__.py:408— __main__._refresh_v1_opencode_plugins 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.
analyze.graph_diff (cyclomatic 16) graphify/analyze.py:621— analyze.graph_diff 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.
cli._bash_invokes_search (cyclomatic 16) graphify/cli.py:1042— cli._bash_invokes_search 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.
extract._canonicalize_csharp_namespace_nodes (cyclomatic 16) REDACTED:3731— extract._canonicalize_csharp_namespace_nodes 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.
extract._resolve_kotlin_import_targets (cyclomatic 16) REDACTED:6623— extract._resolve_kotlin_import_targets 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.
extract._resolve_elixir_import_targets (cyclomatic 16) REDACTED:7257— extract._resolve_elixir_import_targets 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.
extract._resolve_elixir_qualified_calls (cyclomatic 16) REDACTED:7329— extract._resolve_elixir_qualified_calls 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.
engine._java_method_receiver_types (cyclomatic 16) REDACTED:793— engine._java_method_receiver_types 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.
engine._python_fixture_type (cyclomatic 16) REDACTED:2116— engine._python_fixture_type 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.
engine._python_self_attr_bindings (cyclomatic 16) REDACTED:2693— engine._python_self_attr_bindings 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.
engine._ts_field_destructured_from_this (cyclomatic 16) REDACTED:3819— engine._ts_field_destructured_from_this 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.
engine._js_member_assignment_target (cyclomatic 16) REDACTED:4127— engine._js_member_assignment_target 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.
go._go_receiver_type_table (cyclomatic 16) graphify/extractors/go.py:182— go._go_receiver_type_table 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.
objc._objc_local_var_types (cyclomatic 16) graphify/extractors/objc.py:54— objc._objc_local_var_types 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.
resolution._resolve_tsconfig_alias (cyclomatic 16) REDACTED:342— resolution._resolve_tsconfig_alias 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.
terraform.resolve_terraform_modules (cyclomatic 16) graphify/extractors/terraform.py:111— terraform.resolve_terraform_modules 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.
install.install (cyclomatic 16) graphify/install.py:948— install.install 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.
llm._bind_node_evidence (cyclomatic 16) graphify/llm.py:734— llm._bind_node_evidence 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.
llm._call_ollama_native (cyclomatic 16) graphify/llm.py:1451— llm._call_ollama_native 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.
llm._label_batch_with_retry (cyclomatic 16) graphify/llm.py:3571— llm._label_batch_with_retry 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.
prs.attach_graph_impact (cyclomatic 16) graphify/prs.py:395— prs.attach_graph_impact 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.
reflect.aggregate_lessons (cyclomatic 16) graphify/reflect.py:364— reflect.aggregate_lessons 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.
reflect._render_bucket (cyclomatic 16) graphify/reflect.py:444— reflect._render_bucket 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.
serve._trigram_candidates (cyclomatic 16) graphify/serve.py:494— serve._trigram_candidates 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.
serve._query_graph_text (cyclomatic 16) graphify/serve.py:1413— serve._query_graph_text 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.
_StoredSourcePaths.__init__ (cyclomatic 16) graphify/watch.py:515— _StoredSourcePaths.__init__ 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.
watch._reconcile_graph_html (cyclomatic 16) graphify/watch.py:1595— watch._reconcile_graph_html has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D10 · Test Quality· Fixed-sleep synchronisation · ×1
Fixed-sleep synchronisation: output that finishes after navigation is discarded tests/pi.test.ts:207— This test starts work it did not wait for (`api`, still running when the sleep starts) and then orders itself against it with `Bun.sleep(5)` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
cli.dispatch_command (cognitive 1652) graphify/cli.py:1408— cli.dispatch_command has cognitive complexity 1652 (threshold 15). Drivers by points: if/else 363 (954 pts), error handling 66 (200 pts), boolean chains 190, loops 57 (154 pts), ternaries 56 (154 pts) (nesting depth added 920). 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.
extract.extract (cognitive 788) REDACTED:9272— extract.extract has cognitive complexity 788 (threshold 15). Drivers by points: if/else 217 (536 pts), loops 58 (105 pts), boolean chains 66, error handling 22 (46 pts), ternaries 14 (35 pts) (nesting depth added 411). 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.
build.build_from_json (cognitive 337) graphify/build.py:1270— build.build_from_json has cognitive complexity 337 (threshold 15). Drivers by points: if/else 88 (230 pts), boolean chains 47, loops 21 (33 pts), error handling 4 (14 pts), ternaries 5 (13 pts) (nesting depth added 172). 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.
engine._js_extra_walk (cognitive 333) REDACTED:4317— engine._js_extra_walk has cognitive complexity 333 (threshold 15). Drivers by points: if/else 48 (244 pts), loops 7 (42 pts), ternaries 4 (28 pts), boolean chains 19 (nesting depth added 255). 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.
dedup.deduplicate_entities (cognitive 309) graphify/dedup.py:950— dedup.deduplicate_entities has cognitive complexity 309 (threshold 15). Drivers by points: if/else 77 (224 pts), loops 20 (47 pts), boolean chains 21, ternaries 6 (13 pts), error handling 2 (4 pts) (nesting depth added 183). 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.
dart.extract_dart (cognitive 279) graphify/extractors/dart.py:14— dart.extract_dart has cognitive complexity 279 (threshold 15). Drivers by points: if/else 60 (165 pts), loops 31 (75 pts), ternaries 6 (19 pts), boolean chains 16, error handling 2 (4 pts) (nesting depth added 164). 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.
watch._rebuild_code (cognitive 257) graphify/watch.py:1677— watch._rebuild_code has cognitive complexity 257 (threshold 15). Drivers by points: if/else 78 (154 pts), boolean chains 37, error handling 16 (30 pts), loops 10 (18 pts), ternaries 11 (18 pts) (nesting depth added 105). To reduce it, split the body into named stages: move each independent 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._ts_receiver_type_table (cognitive 238) REDACTED:3574— engine._ts_receiver_type_table has cognitive complexity 238 (threshold 15). Drivers by points: if/else 31 (132 pts), ternaries 10 (61 pts), boolean chains 24, loops 8 (21 pts) (nesting depth added 165). 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.
solidity.extract_solidity (cognitive 229) graphify/extractors/solidity.py:268— solidity.extract_solidity has cognitive complexity 229 (threshold 15). Drivers by points: if/else 52 (178 pts), loops 13 (31 pts), boolean chains 10, ternaries 2 (8 pts), error handling 2 (nesting depth added 150). 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.
install.dispatch_install_cli (cognitive 215) graphify/install.py:2536— install.dispatch_install_cli has cognitive complexity 215 (threshold 15). Drivers by points: if/else 83 (165 pts), ternaries 18 (41 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 107). 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.
engine._extract_generic (cognitive 183) REDACTED:5995— engine._extract_generic has cognitive complexity 183 (threshold 15). Drivers by points: if/else 66 (119 pts), loops 18 (29 pts), boolean chains 17, ternaries 6 (14 pts), error handling 4 (nesting depth added 72). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
resolution._apply_symbol_resolution_facts (cognitive 180) REDACTED:1248— resolution._apply_symbol_resolution_facts has cognitive complexity 180 (threshold 15). Drivers by points: if/else 52 (123 pts), loops 22 (29 pts), boolean chains 20, error handling 3 (6 pts), ternaries 1 (2 pts) (nesting depth added 82). To reduce it, split the body into named stages: move each independent 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._php_get_route_name (cognitive 158) REDACTED:5909— engine._php_get_route_name has cognitive complexity 158 (threshold 15). Drivers by points: if/else 19 (95 pts), loops 6 (34 pts), ternaries 3 (23 pts), boolean chains 6 (nesting depth added 124). 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.
detect.detect (cognitive 157) graphify/detect.py:1960— detect.detect has cognitive complexity 157 (threshold 15). Drivers by points: if/else 37 (114 pts), loops 8 (19 pts), error handling 3 (11 pts), boolean chains 10, ternaries 3 (nesting depth added 96). 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.
engine._js_find_exported_objects (cognitive 156) REDACTED:4248— engine._js_find_exported_objects has cognitive complexity 156 (threshold 15). Drivers by points: if/else 21 (110 pts), loops 8 (35 pts), boolean chains 11 (nesting depth added 116). 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.
ruby_resolution.resolve_ruby_member_calls (cognitive 150) graphify/ruby_resolution.py:77— ruby_resolution.resolve_ruby_member_calls has cognitive complexity 150 (threshold 15). Drivers by points: if/else 41 (87 pts), ternaries 9 (27 pts), boolean chains 23, loops 11 (13 pts) (nesting depth added 66). To reduce it, split the body into named stages: move each independent 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.build_merge (cognitive 148) graphify/build.py:2351— build.build_merge has cognitive complexity 148 (threshold 15). Drivers by points: if/else 49 (105 pts), boolean chains 26, loops 5 (11 pts), ternaries 5 (6 pts) (nesting depth added 63). 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.
extract._resolve_python_member_calls (cognitive 147) REDACTED:4764— extract._resolve_python_member_calls has cognitive complexity 147 (threshold 15). Drivers by points: if/else 42 (105 pts), boolean chains 26, loops 10, ternaries 2 (6 pts) (nesting depth added 67). 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.
erlang.extract_erlang (cognitive 135) graphify/extractors/erlang.py:77— erlang.extract_erlang has cognitive complexity 135 (threshold 15). Drivers by points: if/else 36 (111 pts), loops 6 (10 pts), boolean chains 8, ternaries 1 (4 pts), error handling 2 (nesting depth added 82). 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.
extract._import_js (cognitive 122) REDACTED:918— extract._import_js has cognitive complexity 122 (threshold 15). Drivers by points: if/else 22 (80 pts), loops 6 (24 pts), ternaries 2 (11 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 87). 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.
report.generate (cognitive 120) graphify/report.py:96— report.generate has cognitive complexity 120 (threshold 15). Drivers by points: if/else 41 (70 pts), ternaries 10 (22 pts), loops 9 (20 pts), boolean chains 8 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
apex.extract_apex (cognitive 119) graphify/extractors/apex.py:9— apex.extract_apex has cognitive complexity 119 (threshold 15). Drivers by points: if/else 26 (93 pts), loops 6 (16 pts), ternaries 2 (6 pts), boolean chains 3, error handling 1 (nesting depth added 81). 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.
engine._csharp_method_receiver_types (cognitive 119) REDACTED:3339— engine._csharp_method_receiver_types has cognitive complexity 119 (threshold 15). Drivers by points: if/else 23 (82 pts), loops 8 (24 pts), ternaries 5 (10 pts), boolean chains 3 (nesting depth added 80). 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.
extract._import_python (cognitive 108) REDACTED:754— extract._import_python has cognitive complexity 108 (threshold 15). Drivers by points: if/else 20 (66 pts), ternaries 5 (18 pts), error handling 5 (16 pts), loops 2 (7 pts), boolean chains 1 (nesting depth added 75). 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.
resolution._collect_js_symbol_resolution_facts (cognitive 104) REDACTED:2213— resolution._collect_js_symbol_resolution_facts has cognitive complexity 104 (threshold 15). Drivers by points: if/else 23 (64 pts), loops 16 (39 pts), boolean chains 1 (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
html.to_html (cognitive 100) graphify/exporters/html.py:508— html.to_html has cognitive complexity 100 (threshold 15). Drivers by points: if/else 19 (55 pts), loops 8 (21 pts), ternaries 7 (13 pts), boolean chains 9, error handling 1 (2 pts) (nesting depth added 56). 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.
extract._resolve_typescript_member_calls (cognitive 100) REDACTED:5126— extract._resolve_typescript_member_calls has cognitive complexity 100 (threshold 15). Drivers by points: if/else 30 (60 pts), loops 13 (16 pts), boolean chains 13, ternaries 4 (11 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
watch._reconcile_existing_graph (cognitive 100) graphify/watch.py:993— watch._reconcile_existing_graph has cognitive complexity 100 (threshold 15). Drivers by points: if/else 31 (75 pts), boolean chains 17, loops 6 (7 pts), error handling 1 (nesting depth added 45). 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.
extract._resolve_csharp_member_calls (cognitive 98) REDACTED:5577— extract._resolve_csharp_member_calls has cognitive complexity 98 (threshold 15). Drivers by points: if/else 28 (67 pts), boolean chains 13, ternaries 4 (10 pts), loops 6 (8 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dedup._llm_tiebreak (cognitive 97) graphify/dedup.py:1530— dedup._llm_tiebreak has cognitive complexity 97 (threshold 15). Drivers by points: if/else 25 (75 pts), boolean chains 9, error handling 4 (7 pts), loops 4 (6 pts) (nesting depth added 55). 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.
extract._resolve_swift_member_calls (cognitive 96) REDACTED:4563— extract._resolve_swift_member_calls has cognitive complexity 96 (threshold 15). Drivers by points: if/else 25 (60 pts), loops 9 (13 pts), ternaries 4 (10 pts), boolean chains 9, error handling 1 (4 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract._resolve_java_member_calls (cognitive 96) REDACTED:6106— extract._resolve_java_member_calls has cognitive complexity 96 (threshold 15). Drivers by points: if/else 23 (70 pts), boolean chains 12, ternaries 2 (8 pts), loops 5 (6 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent 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._rewire_unique_stub_nodes (cognitive 94) REDACTED:3926— extract._rewire_unique_stub_nodes has cognitive complexity 94 (threshold 15). Drivers by points: if/else 31 (72 pts), boolean chains 12, loops 8 (10 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent 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.extract_xaml (cognitive 94) REDACTED:8413— extract.extract_xaml has cognitive complexity 94 (threshold 15). Drivers by points: if/else 22 (56 pts), loops 8 (19 pts), boolean chains 9, ternaries 3 (8 pts), error handling 2 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
resolution._ts_walk_class_members (cognitive 94) REDACTED:2104— resolution._ts_walk_class_members has cognitive complexity 94 (threshold 15). Drivers by points: loops 12 (41 pts), if/else 12 (38 pts), ternaries 3 (15 pts) (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._kotlin_collect_type_refs (cognitive 91) REDACTED:1228— engine._kotlin_collect_type_refs has cognitive complexity 91 (threshold 15). Drivers by points: if/else 18 (51 pts), loops 7 (22 pts), ternaries 3 (15 pts), boolean chains 3 (nesting depth added 60). 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.
resolution._collect_python_symbol_resolution_facts (cognitive 91) REDACTED:2786— resolution._collect_python_symbol_resolution_facts has cognitive complexity 91 (threshold 15). Drivers by points: if/else 17 (55 pts), ternaries 4 (20 pts), loops 6 (12 pts), boolean chains 4 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cache.save_semantic_cache (cognitive 90) graphify/cache.py:1525— cache.save_semantic_cache has cognitive complexity 90 (threshold 15). Drivers by points: if/else 22 (54 pts), loops 8 (14 pts), boolean chains 10, ternaries 3 (8 pts), 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.
cli._run_hook_guard (cognitive 90) graphify/cli.py:1104— cli._run_hook_guard has cognitive complexity 90 (threshold 15). Drivers by points: if/else 24 (48 pts), error handling 10 (21 pts), boolean chains 18, loops 1 (3 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
serve._subgraph_to_text (cognitive 90) graphify/serve.py:1120— serve._subgraph_to_text has cognitive complexity 90 (threshold 15). Drivers by points: if/else 18 (46 pts), ternaries 6 (21 pts), loops 7 (14 pts), boolean chains 9 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
resolution._resolve_java_type_references (cognitive 86) REDACTED:3715— resolution._resolve_java_type_references has cognitive complexity 86 (threshold 15). Drivers by points: if/else 26 (48 pts), loops 9 (14 pts), boolean chains 13, ternaries 3 (8 pts), error handling 2 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
terraform.extract_terraform (cognitive 86) graphify/extractors/terraform.py:177— terraform.extract_terraform has cognitive complexity 86 (threshold 15). Drivers by points: if/else 14 (45 pts), loops 5 (17 pts), boolean chains 13, error handling 3 (7 pts), ternaries 1 (4 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent 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.to_obsidian (cognitive 85) REDACTED:760— export.to_obsidian has cognitive complexity 85 (threshold 15). Drivers by points: if/else 17 (33 pts), ternaries 8 (22 pts), loops 12 (21 pts), boolean chains 5, error handling 3 (4 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract._resolve_objc_member_calls (cognitive 83) REDACTED:6370— extract._resolve_objc_member_calls has cognitive complexity 83 (threshold 15). Drivers by points: if/else 23 (55 pts), loops 9 (12 pts), ternaries 4 (11 pts), boolean chains 5 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
resolution._resolve_cross_file_imports (cognitive 80) REDACTED:2913— resolution._resolve_cross_file_imports has cognitive complexity 80 (threshold 15). Drivers by points: if/else 18 (51 pts), loops 7 (14 pts), boolean chains 10, ternaries 2 (4 pts), error handling 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dedup._path_qualify_dropped_collisions (cognitive 79) graphify/dedup.py:741— dedup._path_qualify_dropped_collisions has cognitive complexity 79 (threshold 15). Drivers by points: if/else 17 (41 pts), loops 9 (15 pts), ternaries 4 (13 pts), boolean chains 10 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._csharp_collect_type_refs (cognitive 77) REDACTED:393— engine._csharp_collect_type_refs has cognitive complexity 77 (threshold 15). Drivers by points: if/else 21 (45 pts), loops 6 (15 pts), ternaries 4 (14 pts), boolean chains 3 (nesting depth added 43). 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.
extract._resolve_php_member_calls (cognitive 76) REDACTED:5954— extract._resolve_php_member_calls has cognitive complexity 76 (threshold 15). Drivers by points: if/else 20 (58 pts), loops 6 (7 pts), ternaries 2 (6 pts), boolean chains 5 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
sql.extract_sql (cognitive 75) graphify/extractors/sql.py:453— sql.extract_sql has cognitive complexity 75 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 12 (21 pts), ternaries 5 (10 pts), boolean chains 4, error handling 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
symbol_resolution.resolve_bash_source_edges (cognitive 75) graphify/symbol_resolution.py:427— symbol_resolution.resolve_bash_source_edges has cognitive complexity 75 (threshold 15). Drivers by points: if/else 22 (59 pts), loops 6 (9 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
razor.extract_razor (cognitive 74) graphify/extractors/razor.py:11— razor.extract_razor has cognitive complexity 74 (threshold 15). Drivers by points: if/else 20 (59 pts), loops 5 (7 pts), boolean chains 5, ternaries 1 (2 pts), error handling 1 (nesting depth added 42). 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.
cluster.cluster (cognitive 73) graphify/cluster.py:233— cluster.cluster has cognitive complexity 73 (threshold 15). Drivers by points: if/else 26 (46 pts), loops 9 (17 pts), boolean chains 5, ternaries 1 (3 pts), error handling 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.
resolution._ts_collect_type_refs (cognitive 72) REDACTED:2056— resolution._ts_collect_type_refs has cognitive complexity 72 (threshold 15). Drivers by points: if/else 17 (39 pts), ternaries 4 (16 pts), loops 5 (13 pts), boolean chains 4 (nesting depth added 42). 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.
cross_repo_calls.link_cross_repo_member_calls (cognitive 68) graphify/cross_repo_calls.py:211— cross_repo_calls.link_cross_repo_member_calls has cognitive complexity 68 (threshold 15). Drivers by points: if/else 17 (48 pts), loops 4 (12 pts), boolean chains 8 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract._resolve_cpp_member_calls (cognitive 68) REDACTED:5371— extract._resolve_cpp_member_calls has cognitive complexity 68 (threshold 15). Drivers by points: if/else 20 (47 pts), loops 7 (8 pts), boolean chains 7, ternaries 3 (6 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.
cobol.extract_cobol (cognitive 67) graphify/extractors/cobol.py:99— cobol.extract_cobol has cognitive complexity 67 (threshold 15). Drivers by points: if/else 19 (50 pts), loops 5 (9 pts), ternaries 1 (4 pts), boolean chains 3, error handling 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent 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._java_collect_type_refs (cognitive 67) REDACTED:563— engine._java_collect_type_refs has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (33 pts), ternaries 5 (17 pts), loops 5 (12 pts), boolean chains 5 (nesting depth added 36). 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.
resolution._disambiguate_colliding_node_ids (cognitive 67) REDACTED:1060— resolution._disambiguate_colliding_node_ids has cognitive complexity 67 (threshold 15). Drivers by points: if/else 20 (44 pts), loops 11 (16 pts), boolean chains 7 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
detect.save_manifest (cognitive 66) graphify/detect.py:2575— detect.save_manifest has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (36 pts), ternaries 7 (13 pts), boolean chains 8, error handling 3 (5 pts), loops 3 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract._resolve_c_include_edges (cognitive 66) REDACTED:6679— extract._resolve_c_include_edges has cognitive complexity 66 (threshold 15). Drivers by points: if/else 25 (49 pts), boolean chains 5, loops 3 (5 pts), ternaries 2 (5 pts), error handling 1 (2 pts) (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.
resolution._package_entry_candidates (cognitive 66) REDACTED:627— resolution._package_entry_candidates has cognitive complexity 66 (threshold 15). Drivers by points: if/else 14 (50 pts), ternaries 1 (7 pts), loops 2 (5 pts), boolean chains 3, error handling 1 (nesting depth added 45). 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.
extract._csharp_broken_escape_offsets (cognitive 65) REDACTED:3428— extract._csharp_broken_escape_offsets has cognitive complexity 65 (threshold 15). Drivers by points: if/else 15 (42 pts), ternaries 4 (12 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llm._call_llm (cognitive 65) graphify/llm.py:3041— llm._call_llm has cognitive complexity 65 (threshold 15). Drivers by points: if/else 27 (41 pts), boolean chains 16, error handling 3 (5 pts), ternaries 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._kotlin_annotation_class_literal_refs (cognitive 64) REDACTED:1145— engine._kotlin_annotation_class_literal_refs has cognitive complexity 64 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 6 (15 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
detect.detect_incremental (cognitive 63) graphify/detect.py:2886— detect.detect_incremental has cognitive complexity 63 (threshold 15). Drivers by points: if/else 14 (38 pts), ternaries 5 (12 pts), error handling 3 (6 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 35). To reduce it, split the body into named stages: move each independent 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.to_json (cognitive 63) REDACTED:287— export.to_json has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (42 pts), error handling 5 (12 pts), boolean chains 6, loops 2, ternaries 1 (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.
pascal._extract_pascal_regex (cognitive 63) graphify/extractors/pascal.py:231— pascal._extract_pascal_regex has cognitive complexity 63 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 9 (15 pts), ternaries 7 (14 pts), boolean chains 1, error handling 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
serve._score_query (cognitive 63) graphify/serve.py:575— serve._score_query has cognitive complexity 63 (threshold 15). Drivers by points: if/else 14 (39 pts), boolean chains 16, ternaries 4 (5 pts), loops 2 (3 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract._merge_csharp_partial_class_nodes (cognitive 62) REDACTED:4249— extract._merge_csharp_partial_class_nodes has cognitive complexity 62 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 11 (17 pts), boolean chains 5, error handling 2 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._python_collect_type_refs (cognitive 61) REDACTED:107— engine._python_collect_type_refs has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 5 (12 pts), ternaries 3 (11 pts), boolean chains 4 (nesting depth added 33). 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.
validate.validate_extraction (cognitive 61) graphify/validate.py:10— validate.validate_extraction has cognitive complexity 61 (threshold 15). Drivers by points: if/else 14 (36 pts), loops 5 (13 pts), error handling 2 (8 pts), boolean chains 3, ternaries 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
build.finalize_raw_graph_endpoints (cognitive 60) graphify/build.py:266— build.finalize_raw_graph_endpoints has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (33 pts), ternaries 5 (13 pts), loops 6 (8 pts), boolean chains 6 (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.
build._tier_replacement_sources (cognitive 60) graphify/build.py:2141— build._tier_replacement_sources has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (41 pts), loops 8 (16 pts), boolean chains 3 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rust._rust_collect_type_refs (cognitive 59) graphify/extractors/rust.py:48— rust._rust_collect_type_refs has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 5 (13 pts), ternaries 3 (10 pts) (nesting depth added 34). 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.
llm.extract_corpus_parallel (cognitive 59) graphify/llm.py:2692— llm.extract_corpus_parallel has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (36 pts), loops 5 (8 pts), ternaries 4 (8 pts), boolean chains 7 (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.
resolution._resolve_php_type_references (cognitive 58) REDACTED:3996— resolution._resolve_php_type_references has cognitive complexity 58 (threshold 15). Drivers by points: if/else 21 (35 pts), boolean chains 10, loops 5 (6 pts), ternaries 2 (4 pts), error handling 2 (3 pts) (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.
sql._scan_sql (cognitive 58) graphify/extractors/sql.py:113— sql._scan_sql has cognitive complexity 58 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 5 (13 pts), boolean chains 12, ternaries 1 (3 pts) (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.
extract._resolve_kotlin_qualified_calls (cognitive 57) REDACTED:6893— extract._resolve_kotlin_qualified_calls has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (41 pts), loops 5 (8 pts), boolean chains 5, ternaries 1 (3 pts) (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.
engine._swift_collect_type_refs (cognitive 57) REDACTED:1587— engine._swift_collect_type_refs has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 6 (14 pts), ternaries 2 (8 pts), boolean chains 2 (nesting depth added 32). 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.
resolution._merge_decl_def_classes (cognitive 57) REDACTED:3209— resolution._merge_decl_def_classes has cognitive complexity 57 (threshold 15). Drivers by points: if/else 20 (44 pts), loops 5 (7 pts), boolean chains 3, ternaries 1 (3 pts) (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.
engine._scala_collect_type_refs (cognitive 56) REDACTED:1944— engine._scala_collect_type_refs has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 5 (13 pts), ternaries 2 (7 pts), boolean chains 3 (nesting depth added 31). 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.
engine._ts_field_destructured_from_this (cognitive 56) REDACTED:3819— engine._ts_field_destructured_from_this has cognitive complexity 56 (threshold 15). Drivers by points: if/else 8 (40 pts), loops 3 (10 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 41). 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.
detect._env_command_args (cognitive 55) graphify/detect.py:353— detect._env_command_args has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (51 pts), boolean chains 3, loops 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent 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._suppress_ambiguous_python_imports (cognitive 55) REDACTED:307— extract._suppress_ambiguous_python_imports has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (43 pts), loops 4 (7 pts), boolean chains 5 (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.suggest_questions (cognitive 54) graphify/analyze.py:475— analyze.suggest_questions has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (31 pts), ternaries 4 (11 pts), loops 6 (9 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
semantic_cleanup.sanitize_semantic_fragment (cognitive 54) graphify/semantic_cleanup.py:172— semantic_cleanup.sanitize_semantic_fragment has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (39 pts), loops 8 (9 pts), boolean chains 6 (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.
engine._ts_extra_walk (cognitive 53) REDACTED:4666— engine._ts_extra_walk has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 3 (9 pts), boolean chains 3, ternaries 1 (2 pts) (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.
cli._stale_graph_sources (cognitive 52) graphify/cli.py:438— cli._stale_graph_sources has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (36 pts), loops 4 (7 pts), error handling 4 (6 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.
extract._ejs_mask_non_script (cognitive 52) REDACTED:2804— extract._ejs_mask_non_script has cognitive complexity 52 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 9 (19 pts), ternaries 3 (8 pts), boolean chains 1 (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.
extract.extract_csproj (cognitive 52) REDACTED:7902— extract.extract_csproj has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 9, loops 5 (7 pts), error handling 3 (4 pts), ternaries 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.
vbnet.extract_vbnet (cognitive 52) graphify/extractors/vbnet.py:81— vbnet.extract_vbnet has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (36 pts), ternaries 1 (6 pts), loops 4 (5 pts), boolean chains 3, error handling 2 (nesting depth added 29). 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.
watch._reconcile_markdown_links (cognitive 52) graphify/watch.py:691— watch._reconcile_markdown_links has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (36 pts), loops 5 (6 pts), error handling 2 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._python_property_reads (cognitive 51) REDACTED:2619— engine._python_property_reads has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (41 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent 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._require_imports_js (cognitive 51) REDACTED:3880— engine._require_imports_js has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 4 (9 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
detect.xlsx_extract_structure (cognitive 49) graphify/detect.py:777— detect.xlsx_extract_structure has cognitive complexity 49 (threshold 15). Drivers by points: if/else 6 (24 pts), loops 5 (17 pts), error handling 4 (8 pts) (nesting depth added 34). 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.
engine._scan_python_nested_function_declarations (cognitive 49) REDACTED:4048— engine._scan_python_nested_function_declarations has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (40 pts), loops 2 (5 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent 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.merge_raw_extraction (cognitive 48) graphify/build.py:2207— build.merge_raw_extraction has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 9, loops 3 (6 pts), ternaries 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.
cargo_introspect.introspect_cargo (cognitive 48) graphify/cargo_introspect.py:80— cargo_introspect.introspect_cargo has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (38 pts), loops 3 (4 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dedup._disambiguate_defining_collisions (cognitive 48) graphify/dedup.py:675— dedup._disambiguate_defining_collisions has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 6 (10 pts), boolean chains 5, ternaries 2 (5 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CsharpNameResolver.__init__ (cognitive 48) graphify/extractors/csharp.py:204— CsharpNameResolver.__init__ has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (35 pts), boolean chains 10, loops 3 (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.
gen.main (cognitive 48) tools/skillgen/gen.py:1501— gen.main has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 8 (20 pts), ternaries 4 (7 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._swift_local_var_types (cognitive 47) REDACTED:3109— engine._swift_local_var_types has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (31 pts), loops 3 (6 pts), boolean chains 5, ternaries 1 (5 pts) (nesting depth added 30). 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.
serve._shortest_path_text (cognitive 47) graphify/serve.py:2067— serve._shortest_path_text has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (25 pts), ternaries 4 (10 pts), loops 4 (8 pts), boolean chains 3, error handling 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.
index.graphify (cognitive 47) graphify/pi/index.ts:109— index.graphify has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 7, ternaries 4 (6 pts), loops 3 (4 pts), error handling 2 (3 pts) (nesting depth added 14). Most of this is not in the body itself: 2 of the 47 points are its own statements and the rest belongs to one function literal inside it that branches (line 130). 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.
cli._zero_node_stamped_semantic_sources (cognitive 45) graphify/cli.py:720— cli._zero_node_stamped_semantic_sources has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (19 pts), error handling 7 (13 pts), loops 5 (9 pts), boolean chains 4 (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.
extract._bind_member_field_tables (cognitive 45) REDACTED:5903— extract._bind_member_field_tables has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 4 (7 pts), boolean chains 5 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
go._go_receiver_type_table (cognitive 45) graphify/extractors/go.py:182— go._go_receiver_type_table has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (32 pts), loops 3 (8 pts), ternaries 1 (3 pts), boolean chains 2 (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.
interface_dispatch.resolve_interface_dispatch (cognitive 45) graphify/interface_dispatch.py:93— interface_dispatch.resolve_interface_dispatch has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 6 (13 pts), boolean chains 6 (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.
engine._csharp_type_parameters_in_scope (cognitive 44) REDACTED:367— engine._csharp_type_parameters_in_scope has cognitive complexity 44 (threshold 15). Drivers by points: if/else 7 (36 pts), loops 3 (8 pts) (nesting depth added 34). 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.
verilog._augment_systemverilog_semantics (cognitive 44) graphify/extractors/verilog.py:103— verilog._augment_systemverilog_semantics has cognitive complexity 44 (threshold 15). Drivers by points: loops 8 (21 pts), ternaries 3 (13 pts), if/else 3 (8 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.
engine._ruby_extra_walk (cognitive 43) REDACTED:5778— engine._ruby_extra_walk has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 24). 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.
go._go_collect_type_refs (cognitive 43) graphify/extractors/go.py:106— go._go_collect_type_refs has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 4 (10 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
resolution._read_tsconfig_aliases (cognitive 43) REDACTED:124— resolution._read_tsconfig_aliases has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (30 pts), error handling 4 (5 pts), boolean chains 4, loops 3 (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.
affected.affected_nodes (cognitive 42) graphify/affected.py:267— affected.affected_nodes has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 4 (7 pts), boolean chains 4 (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.
build._lost_saved_semantic_nodes (cognitive 42) graphify/build.py:69— build._lost_saved_semantic_nodes has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 10, ternaries 2 (3 pts), loops 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.
extract._repoint_python_sibling_imports (cognitive 42) REDACTED:516— extract._repoint_python_sibling_imports has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (33 pts), error handling 3 (5 pts), boolean chains 2, loops 2 (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.
extract._resolve_rust_self_member_calls (cognitive 42) REDACTED:7004— extract._resolve_rust_self_member_calls has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 6, loops 5 (6 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.
extract.collect_files (cognitive 42) REDACTED:11196— extract.collect_files has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 9, loops 4 (8 pts), ternaries 3 (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.
engine._php_receiver_type_table (cognitive 42) REDACTED:1002— engine._php_receiver_type_table has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (31 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
serve._find_node_tiers (cognitive 42) graphify/serve.py:1629— serve._find_node_tiers has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 12, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
go._go_type_param_names (cognitive 41) graphify/extractors/go.py:66— go._go_type_param_names has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 5 (12 pts) (nesting depth added 28). 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.
_StoredSourcePaths.__init__ (cognitive 41) graphify/watch.py:515— _StoredSourcePaths.__init__ has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 3 (9 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 24). 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.
watch._rebuild_lock (cognitive 41) graphify/watch.py:188— watch._rebuild_lock has cognitive complexity 41 (threshold 15). Drivers by points: error handling 10 (22 pts), if/else 7 (10 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (2 pts) (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.
cache.scope_semantic_result (cognitive 40) graphify/cache.py:1829— cache.scope_semantic_result has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (30 pts), boolean chains 7, 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.
export.to_canvas (cognitive 40) REDACTED:1113— export.to_canvas has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 11 (14 pts), ternaries 4 (7 pts), boolean chains 5 (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.
resolution._resolve_go_type_references (cognitive 40) REDACTED:3612— resolution._resolve_go_type_references has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 12, loops 4 (5 pts), ternaries 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.
build._semantic_id_remap (cognitive 39) graphify/build.py:1086— build._semantic_id_remap has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 6, loops 2 (3 pts) (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.
engine._cpp_collect_type_refs (cognitive 39) REDACTED:1837— engine._cpp_collect_type_refs has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (24 pts), ternaries 2 (7 pts), loops 2 (5 pts), boolean chains 3 (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.
objc._objc_local_var_types (cognitive 39) graphify/extractors/objc.py:54— objc._objc_local_var_types has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 24). 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.
symbol_resolution.resolve_python_import_guided_calls (cognitive 39) graphify/symbol_resolution.py:239— symbol_resolution.resolve_python_import_guided_calls has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (4 pts), ternaries 2 (4 pts), boolean chains 2 (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.suggest_questions (cognitive 39) worked/mixed-corpus/raw/analyze.py:321— analyze.suggest_questions has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 5 (8 pts), ternaries 2 (7 pts), boolean chains 3 (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.
cache._relativize_source_files_in (cognitive 38) graphify/cache.py:656— cache._relativize_source_files_in has cognitive complexity 38 (threshold 15). Drivers by points: if/else 5 (20 pts), error handling 3 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli._zero_node_stamped_code_sources (cognitive 38) graphify/cli.py:623— cli._zero_node_stamped_code_sources has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (19 pts), error handling 6 (10 pts), loops 4 (7 pts), boolean chains 2 (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.
extract._python_absolute_import_alias_files (cognitive 38) REDACTED:236— extract._python_absolute_import_alias_files has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (17 pts), error handling 5 (12 pts), loops 3 (5 pts), boolean chains 2, ternaries 1 (2 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.
engine._swift_attribute_type_name (cognitive 38) REDACTED:1645— engine._swift_attribute_type_name has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (32 pts), boolean chains 3, loops 2 (3 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.
llm._load_custom_providers (cognitive 38) graphify/llm.py:292— llm._load_custom_providers has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 2 (5 pts), boolean chains 3, error handling 1 (3 pts), ternaries 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._python_class_ref (cognitive 37) REDACTED:5273— engine._python_class_ref has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (23 pts), ternaries 4 (9 pts), boolean chains 5 (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.
engine._ts_emit_decorator_edges (cognitive 37) REDACTED:10636— engine._ts_emit_decorator_edges has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 6 (13 pts), boolean chains 3, ternaries 1 (3 pts) (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.
install._platform_skill_destination (cognitive 37) graphify/install.py:206— install._platform_skill_destination has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 10 (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.
extract._rescue_js_dynamic_imports (cognitive 36) REDACTED:2227— extract._rescue_js_dynamic_imports has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (21 pts), error handling 3 (8 pts), boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._scala_type_parameters_in_scope (cognitive 36) REDACTED:1911— engine._scala_type_parameters_in_scope has cognitive complexity 36 (threshold 15). Drivers by points: if/else 5 (25 pts), loops 4 (11 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._scan_js_nested_function_declarations (cognitive 36) REDACTED:3977— engine._scan_js_nested_function_declarations has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (5 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._js_scan_member_assignments (cognitive 36) REDACTED:4174— engine._js_scan_member_assignments has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 3 (4 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.
markdown.extract_markdown (cognitive 36) graphify/extractors/markdown.py:369— markdown.extract_markdown has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (13 pts), ternaries 3 (6 pts), boolean chains 3, error handling 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.
dm.extract_dmm (cognitive 35) graphify/extractors/dm.py:370— dm.extract_dmm has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 3 (6 pts), boolean chains 2, error handling 1, ternaries 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.
engine._java_method_receiver_types (cognitive 35) REDACTED:793— engine._java_method_receiver_types has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 5 (10 pts), boolean chains 1, ternaries 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.
engine._php_collect_type_refs (cognitive 35) REDACTED:941— engine._php_collect_type_refs has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 2 (8 pts), loops 3 (6 pts) (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.
prs.triage_with_opus (cognitive 35) graphify/prs.py:634— prs.triage_with_opus has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (8 pts), error handling 4 (6 pts), boolean chains 5, ternaries 2 (5 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.
analyze.find_import_cycles (cognitive 34) graphify/analyze.py:720— analyze.find_import_cycles has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 4, ternaries 1 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
build.graph_has_legacy_ids (cognitive 34) graphify/build.py:1183— build.graph_has_legacy_ids has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 6, loops 2 (4 pts), ternaries 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.
detect._is_noise_dir (cognitive 34) graphify/detect.py:1152— detect._is_noise_dir has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 4, 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.
csharp._resolve_cross_file_csharp_imports (cognitive 34) graphify/extractors/csharp.py:100— csharp._resolve_cross_file_csharp_imports has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 8, loops 3 (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.
engine._swift_pre_scan (cognitive 34) REDACTED:1507— engine._swift_pre_scan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 2 (5 pts) (nesting depth added 24). 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.
sln.extract_sln (cognitive 34) graphify/extractors/sln.py:10— sln.extract_sln has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 4, error handling 2 (4 pts), loops 2 (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.
llm._extract_with_adaptive_retry (cognitive 34) graphify/llm.py:2444— llm._extract_with_adaptive_retry has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 5 (11 pts), boolean chains 4, error handling 1, 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.
build._alias_index (cognitive 33) graphify/build.py:1010— build._alias_index has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 4, 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.
build.prefix_graph_for_global (cognitive 33) graphify/build.py:2857— build.prefix_graph_for_global has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (21 pts), ternaries 1 (5 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 17). 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.
cli._bash_invokes_search (cognitive 33) graphify/cli.py:1042— cli._bash_invokes_search has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (8 pts), boolean chains 3, ternaries 1 (3 pts) (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.
extract._merge_swift_extensions (cognitive 33) REDACTED:4148— extract._merge_swift_extensions has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 5 (6 pts), boolean chains 3 (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.
extract._xaml_communitytoolkit_members (cognitive 33) REDACTED:8346— extract._xaml_communitytoolkit_members has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (22 pts), ternaries 2 (5 pts), boolean chains 4, error handling 1, 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.
csharp._build_csharp_type_def_index (cognitive 33) graphify/extractors/csharp.py:20— csharp._build_csharp_type_def_index has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._csharp_attribute_names (cognitive 33) REDACTED:458— engine._csharp_attribute_names has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 3 (7 pts), ternaries 1 (5 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._swift_extra_walk (cognitive 33) REDACTED:4854— engine._swift_extra_walk has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 4 (11 pts), ternaries 1 (5 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
r.resolve_r_sourced_calls (cognitive 33) graphify/extractors/r.py:26— r.resolve_r_sourced_calls has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 5 (8 pts), boolean chains 3 (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.
markdown_resolution.resolve_markdown_mentions (cognitive 33) graphify/markdown_resolution.py:146— markdown_resolution.resolve_markdown_mentions has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 6, loops 5 (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.
diagnostics.diagnose_extraction (cognitive 32) graphify/diagnostics.py:156— diagnostics.diagnose_extraction has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (3 pts), error handling 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.
markdown._resolve_markdown_link (cognitive 32) graphify/extractors/markdown.py:259— markdown._resolve_markdown_link has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (23 pts), error handling 2 (4 pts), boolean chains 3, ternaries 1 (2 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.
resolution._resolve_cross_file_java_imports (cognitive 32) REDACTED:3434— resolution._resolve_cross_file_java_imports has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 6 (9 pts), boolean chains 3, error handling 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.
__main__._refresh_v1_opencode_plugins (cognitive 31) graphify/__main__.py:408— __main__._refresh_v1_opencode_plugins has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (4 pts), error handling 2 (3 pts), ternaries 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.
cache.load_cached (cognitive 31) graphify/cache.py:1055— cache.load_cached has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 5, error handling 3 (5 pts), ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract._xaml_csharp_class_nodes (cognitive 31) REDACTED:8282— extract._xaml_csharp_class_nodes has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (6 pts), boolean chains 4, error handling 1, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._python_pre_scan_underscore_collisions (cognitive 31) REDACTED:1360— engine._python_pre_scan_underscore_collisions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 3 (4 pts), boolean chains 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.
engine._python_self_attr_bindings (cognitive 31) REDACTED:2693— engine._python_self_attr_bindings has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 5 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
resolution._resolve_tsconfig_alias (cognitive 31) REDACTED:342— resolution._resolve_tsconfig_alias has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), error handling 2 (5 pts), ternaries 1 (3 pts), loops 2, 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.
solidity.resolve_solidity_inherited_calls (cognitive 31) graphify/extractors/solidity.py:122— solidity.resolve_solidity_inherited_calls has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5, ternaries 2 (5 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.
vbnet.resolve_vbnet_partial_calls (cognitive 31) graphify/extractors/vbnet.py:21— vbnet.resolve_vbnet_partial_calls has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (7 pts), boolean chains 4 (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.
prs.render_dashboard (cognitive 31) graphify/prs.py:458— prs.render_dashboard has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13, ternaries 4 (12 pts), loops 3 (5 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.
extract._resolve_go_member_calls (cognitive 30) REDACTED:7157— extract._resolve_go_member_calls has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 6, loops 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.
engine._ts_mark_public_twins (cognitive 30) REDACTED:10517— engine._ts_mark_public_twins has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (5 pts), boolean chains 4 (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.
resolution._ts_heritage_clause_entries (cognitive 30) REDACTED:2029— resolution._ts_heritage_clause_entries has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 2 (5 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.
resolution._merge_go_package_types (cognitive 30) REDACTED:3361— resolution._merge_go_package_types has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 4 (5 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.
llm._call_openai_compat (cognitive 30) graphify/llm.py:1512— llm._call_openai_compat has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 10, ternaries 4 (7 pts), error handling 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, 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.
semantic_cleanup.validate_semantic_fragment (cognitive 30) graphify/semantic_cleanup.py:44— semantic_cleanup.validate_semantic_fragment has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 4 (7 pts), error handling 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.
cross_repo_types.link_shared_type_declarations (cognitive 29) graphify/cross_repo_types.py:32— cross_repo_types.link_shared_type_declarations has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (7 pts), boolean chains 6 (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.
extract._repoint_python_package_imports (cognitive 29) REDACTED:440— extract._repoint_python_package_imports has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, loops 3 (4 pts), error handling 2 (3 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.
extract._canonicalize_csharp_namespace_nodes (cognitive 29) REDACTED:3731— extract._canonicalize_csharp_namespace_nodes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (6 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.
extract._resolve_kotlin_member_calls (cognitive 29) REDACTED:7396— extract._resolve_kotlin_member_calls has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 3, loops 3 (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.
engine._csharp_method_signature (cognitive 29) REDACTED:193— engine._csharp_method_signature has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 5 (11 pts), boolean chains 1, 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.
engine._kotlin_annotation_names (cognitive 29) REDACTED:1111— engine._kotlin_annotation_names has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 4 (8 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.
engine._swift_receiver_name (cognitive 29) REDACTED:1735— engine._swift_receiver_name has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (8 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 17). 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.
engine._cpp_local_var_types (cognitive 29) REDACTED:3070— engine._cpp_local_var_types has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (23 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 17). 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.
resolution._resolve_python_module_path (cognitive 29) REDACTED:2637— resolution._resolve_python_module_path has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 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.
resolution._resolve_python_namespace_dir (cognitive 29) REDACTED:2710— resolution._resolve_python_namespace_dir has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 2 (4 pts), boolean chains 3, 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.
extract._resolve_kotlin_import_targets (cognitive 28) REDACTED:6623— extract._resolve_kotlin_import_targets has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (7 pts), boolean chains 4 (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.
engine._kotlin_type_parameters_in_scope (cognitive 28) REDACTED:1201— engine._kotlin_type_parameters_in_scope has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (18 pts), loops 4 (10 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. This shape REPEATS in the file: 2 other methods here (engine._swift_type_parameters_in_scope, engine._cpp_type_parameters_in_scope) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
engine._swift_type_parameters_in_scope (cognitive 28) REDACTED:1559— engine._swift_type_parameters_in_scope has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (18 pts), loops 4 (10 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. This shape REPEATS in the file: 2 other methods here (engine._kotlin_type_parameters_in_scope, engine._cpp_type_parameters_in_scope) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
engine._cpp_type_parameters_in_scope (cognitive 28) REDACTED:1806— engine._cpp_type_parameters_in_scope has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (18 pts), loops 4 (10 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. This shape REPEATS in the file: 2 other methods here (engine._kotlin_type_parameters_in_scope, engine._swift_type_parameters_in_scope) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
resolution._resolve_js_import_path (cognitive 28) REDACTED:52— resolution._resolve_js_import_path has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (7 pts), boolean chains 4, error handling 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.
install._strip_json_comments (cognitive 28) graphify/install.py:1573— install._strip_json_comments has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 3, ternaries 1 (2 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.
prs.cmd_prs (cognitive 28) graphify/prs.py:728— prs.cmd_prs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, loops 2, 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.
serve._trigram_candidates (cognitive 28) graphify/serve.py:494— serve._trigram_candidates has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 4 (6 pts), boolean chains 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.
extract._extract_parallel (cognitive 27) REDACTED:9085— extract._extract_parallel has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 5 (9 pts), ternaries 2 (3 pts), boolean chains 2, 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.
csharp._resolve_csharp_type_references (cognitive 27) graphify/extractors/csharp.py:439— csharp._resolve_csharp_type_references has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 5, 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.
engine._csharp_extra_walk (cognitive 27) REDACTED:4778— engine._csharp_extra_walk has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (5 pts), boolean chains 3 (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.
llm.extract_files_direct (cognitive 27) graphify/llm.py:2066— llm.extract_files_direct has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 7, error handling 1 (2 pts), ternaries 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, 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.
reflect.aggregate_lessons (cognitive 27) graphify/reflect.py:364— reflect.aggregate_lessons has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 4 (9 pts), loops 3 (7 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.
serve._query_graph_text (cognitive 27) graphify/serve.py:1413— serve._query_graph_text has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 14). 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.
cli._graph_hint (cognitive 26) graphify/cli.py:236— cli._graph_hint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, ternaries 3 (5 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.
dedup._remap_hyperedge_members (cognitive 26) graphify/dedup.py:910— dedup._remap_hyperedge_members has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 2 (8 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
detect._git_info_exclude (cognitive 26) graphify/detect.py:1366— detect._git_info_exclude has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 2 (6 pts), ternaries 2 (6 pts) (nesting depth added 16). 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.
extract._xaml_explicit_viewmodel_names (cognitive 26) REDACTED:8208— extract._xaml_explicit_viewmodel_names has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (6 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._self_call_target (cognitive 26) REDACTED:2213— engine._self_call_target has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 4 (10 pts), loops 2, boolean chains 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.
resolution._js_top_level_function_bodies (cognitive 26) REDACTED:1968— resolution._js_top_level_function_bodies has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (4 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.
reflect._render_bucket (cognitive 26) graphify/reflect.py:444— reflect._render_bucket has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (10 pts), ternaries 3 (9 pts), if/else 6, 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.
gen._core_to_powershell (cognitive 26) tools/skillgen/gen.py:495— gen._core_to_powershell has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (7 pts), boolean chains 3 (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.
extract.extract_slnx (cognitive 25) REDACTED:7816— extract.extract_slnx has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (4 pts), boolean chains 2, error handling 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.
extract._xaml_codebehind_symbols (cognitive 25) REDACTED:8133— extract._xaml_codebehind_symbols has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (5 pts), boolean chains 3, ternaries 2, error handling 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.
engine._java_type_parameters_in_scope (cognitive 25) REDACTED:489— engine._java_type_parameters_in_scope has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (20 pts), loops 2 (5 pts) (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.
engine._python_alias_name (cognitive 25) REDACTED:1323— engine._python_alias_name has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 7 (10 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.
solidity._callee_text (cognitive 25) graphify/extractors/solidity.py:26— solidity._callee_text has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 3 (9 pts), boolean chains 3, loops 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.
solidity.resolve_solidity_type_references (cognitive 25) graphify/extractors/solidity.py:222— solidity.resolve_solidity_type_references has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, loops 4 (5 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.
prs.attach_graph_impact (cognitive 25) graphify/prs.py:395— prs.attach_graph_impact has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (7 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
watch._referenced_unscanned_identities (cognitive 25) graphify/watch.py:920— watch._referenced_unscanned_identities has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (4 pts), boolean chains 3, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cache.file_hash (cognitive 24) graphify/cache.py:512— cache.file_hash has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 4 (6 pts), loops 1 (2 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
export.to_graphml (cognitive 24) REDACTED:1292— export.to_graphml has cognitive complexity 24 (threshold 15). Drivers by points: loops 10 (14 pts), if/else 6 (8 pts), error handling 1 (2 pts) (nesting depth added 7). 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.
CsharpNameResolver.resolve_type_name (cognitive 24) graphify/extractors/csharp.py:368— CsharpNameResolver.resolve_type_name has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (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.
dm.extract_dmf (cognitive 24) graphify/extractors/dm.py:442— dm.extract_dmf has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), boolean chains 3, error handling 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.
engine._java_receiver_chain (cognitive 24) REDACTED:661— engine._java_receiver_chain has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 2 (4 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.
engine._python_fixture_type (cognitive 24) REDACTED:2116— engine._python_fixture_type has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 3 (7 pts), boolean chains 2, 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.
erlang.resolve_erlang_remote_calls (cognitive 24) graphify/extractors/erlang.py:25— erlang.resolve_erlang_remote_calls has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, loops 3 (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.
global_graph.global_add (cognitive 24) graphify/global_graph.py:79— global_graph.global_add has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (5 pts), boolean chains 4, 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.
llm._call_claude_cli (cognitive 24) graphify/llm.py:1812— llm._call_claude_cli has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 8, loops 1 (2 pts), ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
analyze._cross_community_surprises (cognitive 23) graphify/analyze.py:387— analyze._cross_community_surprises has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (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.
engine._dynamic_import_js (cognitive 23) REDACTED:2955— engine._dynamic_import_js has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
llm._bind_node_evidence (cognitive 23) graphify/llm.py:734— llm._bind_node_evidence has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 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.
rcfile.load_graphifyrc (cognitive 23) graphify/rcfile.py:112— rcfile.load_graphifyrc has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 2 (6 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.
reflect._yaml_unescape (cognitive 23) graphify/reflect.py:71— reflect._yaml_unescape has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 2 (8 pts), boolean chains 3, 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.
watch._relativize_source_files (cognitive 23) graphify/watch.py:477— watch._relativize_source_files has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (6 pts), error handling 1 (4 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.
cache._ensure_stat_index (cognitive 22) graphify/cache.py:379— cache._ensure_stat_index has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (3 pts), error handling 1 (2 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cache._absolutize_source_files_in (cognitive 22) graphify/cache.py:986— cache._absolutize_source_files_in has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts), error handling 2 (5 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.
graphdb.push_to_falkordb (cognitive 22) graphify/exporters/graphdb.py:103— graphdb.push_to_falkordb has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (6 pts), error handling 2 (3 pts), loops 3, ternaries 3 (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.
cobol._code_lines (cognitive 22) graphify/extractors/cobol.py:40— cobol._code_lines has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, 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.
engine._js_member_nid (cognitive 22) REDACTED:1467— engine._js_member_nid has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 1 (3 pts), boolean chains 2, loops 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.
engine._js_member_assignment_target (cognitive 22) REDACTED:4127— engine._js_member_assignment_target has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3 (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.
resolution._resolve_js_module_path (cognitive 22) REDACTED:843— resolution._resolve_js_module_path has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 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.
resolution._resolve_lua_import_target (cognitive 22) REDACTED:944— resolution._resolve_lua_import_target has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (8 pts), error handling 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.
rust._rust_simple_generic_impl_key (cognitive 22) graphify/extractors/rust.py:109— rust._rust_simple_generic_impl_key has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4, loops 1, ternaries 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.
terraform.resolve_terraform_modules (cognitive 22) graphify/extractors/terraform.py:111— terraform.resolve_terraform_modules has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (5 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.
serve._pick_seeds (cognitive 22) graphify/serve.py:787— serve._pick_seeds 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.
__main__._run_cli (cognitive 21) graphify/__main__.py:822— __main__._run_cli has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
analyze.graph_diff (cognitive 21) graphify/analyze.py:621— analyze.graph_diff has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 5 (9 pts), loops 2, 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.
detect._has_build_output_markers (cognitive 21) graphify/detect.py:1083— detect._has_build_output_markers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts), boolean chains 2, error handling 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.
export.backup_if_protected (cognitive 21) REDACTED:42— export.backup_if_protected has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 3 (6 pts), boolean chains 2, ternaries 2, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
extract._resolve_elixir_import_targets (cognitive 21) REDACTED:7257— extract._resolve_elixir_import_targets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, 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.
extract._resolve_elixir_qualified_calls (cognitive 21) REDACTED:7329— extract._resolve_elixir_qualified_calls has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 3 (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.
resolution._resolve_workspace_import (cognitive 21) REDACTED:706— resolution._resolve_workspace_import has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (3 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.
sql._routine_body_refs (cognitive 21) graphify/extractors/sql.py:324— sql._routine_body_refs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4, boolean chains 3 (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.
llm._community_label_lines (cognitive 21) graphify/llm.py:3490— llm._community_label_lines has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 2 (4 pts), loops 2 (3 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.
manifest_ingest._parse_gomod (cognitive 21) REDACTED:263— manifest_ingest._parse_gomod has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 pts), 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.
serve._query_terms (cognitive 21) graphify/serve.py:312— serve._query_terms has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (7 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.
watch._reconcile_graph_html (cognitive 21) graphify/watch.py:1595— watch._reconcile_graph_html has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
__main__._check_skill_version (cognitive 20) graphify/__main__.py:172— __main__._check_skill_version has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 5 (6 pts), ternaries 1 (3 pts), boolean chains 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.
__main__._refresh_stale_skills (cognitive 20) graphify/__main__.py:265— __main__._refresh_stale_skills has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 2 (4 pts), loops 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.
analyze._cross_file_surprises (cognitive 20) graphify/analyze.py:324— analyze._cross_file_surprises has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 2, 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.
build._coerce_non_string_ids (cognitive 20) graphify/build.py:611— build._coerce_non_string_ids has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), boolean chains 4 (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.
cli._search_hint_terms (cognitive 20) graphify/cli.py:197— cli._search_hint_terms has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, loops 2 (3 pts), error handling 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.
extract._resolve_csharp_qualified_calls (cognitive 20) REDACTED:6820— extract._resolve_csharp_qualified_calls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, loops 2 (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.
engine._csharp_deferred_call (cognitive 20) REDACTED:3305— engine._csharp_deferred_call has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._cpp_extra_walk (cognitive 20) REDACTED:4994— engine._cpp_extra_walk 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.
llm._label_batch_with_retry (cognitive 20) graphify/llm.py:3571— llm._label_batch_with_retry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, error handling 2 (3 pts), ternaries 1 (3 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.
pascal_resolution.resolve_pascal_inherited_calls (cognitive 20) graphify/pascal_resolution.py:42— pascal_resolution.resolve_pascal_inherited_calls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, 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.
pg_introspect.introspect_postgres (cognitive 20) graphify/pg_introspect.py:11— pg_introspect.introspect_postgres has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4, boolean chains 3, ternaries 1 (3 pts), error handling 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.
report._learning_section (cognitive 20) graphify/report.py:65— report._learning_section has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 2 (6 pts), boolean chains 5, if/else 5, loops 2 (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.
scip_ingest._emit_relationships (cognitive 20) graphify/scip_ingest.py:169— scip_ingest._emit_relationships has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (6 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.
symbol_resolution.resolve_cross_file_raw_calls (cognitive 20) graphify/symbol_resolution.py:328— symbol_resolution.resolve_cross_file_raw_calls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (19 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.
watch._canonical_topology_for_compare (cognitive 20) graphify/watch.py:1370— watch._canonical_topology_for_compare has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts), boolean chains 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.
analyze._surprise_score (cognitive 19) graphify/analyze.py:246— analyze._surprise_score has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7, boolean chains 6, ternaries 4 (6 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.
detect.docx_to_markdown (cognitive 19) graphify/detect.py:698— detect.docx_to_markdown has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), error handling 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
detect.xlsx_to_markdown (cognitive 19) graphify/detect.py:745— detect.xlsx_to_markdown has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), ternaries 1 (3 pts), error handling 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.
detect._load_graphifyignore (cognitive 19) graphify/detect.py:1529— detect._load_graphifyignore has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (6 pts), ternaries 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._kotlin_user_type_name (cognitive 19) REDACTED:1084— engine._kotlin_user_type_name has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 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.
engine._python_untouched_params (cognitive 19) REDACTED:2155— engine._python_untouched_params has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._lexical_call_target (cognitive 19) REDACTED:2318— engine._lexical_call_target has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 2 (6 pts), loops 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.
engine._csharp_loop_element_types (cognitive 19) REDACTED:3183— engine._csharp_loop_element_types has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 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._ts_attach_class_fields (cognitive 19) REDACTED:3773— engine._ts_attach_class_fields has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (6 pts), ternaries 1 (3 pts), boolean chains 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.
engine._scala_extra_walk (cognitive 19) REDACTED:4890— engine._scala_extra_walk has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (2 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.
resolution._go_import_path_for_file (cognitive 19) REDACTED:3564— resolution._go_import_path_for_file has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 3 (4 pts), ternaries 3 (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.
llm._parse_llm_json (cognitive 19) graphify/llm.py:1164— llm._parse_llm_json has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 2 (3 pts), 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.
llm.detect_backend_with_source (cognitive 19) graphify/llm.py:3398— llm.detect_backend_with_source has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, 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.
llm.generate_community_labels (cognitive 19) graphify/llm.py:3775— llm.generate_community_labels has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
paths.os_replace_with_fallback (cognitive 19) graphify/paths.py:84— paths.os_replace_with_fallback has cognitive complexity 19 (threshold 15). Drivers by points: error handling 6 (10 pts), if/else 5 (7 pts), boolean chains 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.
reflect._load_node_community (cognitive 19) graphify/reflect.py:162— reflect._load_node_community has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 3 (4 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
scip_ingest.ingest_scip_json (cognitive 19) graphify/scip_ingest.py:42— scip_ingest.ingest_scip_json has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (4 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.
_StoredSourcePaths._anchors_stored_sources (cognitive 19) graphify/watch.py:590— _StoredSourcePaths._anchors_stored_sources has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 2 (6 pts), loops 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.
analyze.graph_diff (cognitive 19) worked/mixed-corpus/raw/analyze.py:438— analyze.graph_diff has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 6 (8 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.
build.build (cognitive 18) graphify/build.py:1942— build.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 1, ternaries 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.
cache._flush_stat_index (cognitive 18) graphify/cache.py:440— cache._flush_stat_index has cognitive complexity 18 (threshold 15). Drivers by points: error handling 6 (9 pts), if/else 3 (4 pts), ternaries 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract._drop_shadowed_csharp_partial_bases (cognitive 18) REDACTED:4447— extract._drop_shadowed_csharp_partial_bases has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, 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.
engine._kotlin_extra_walk (cognitive 18) REDACTED:5093— engine._kotlin_extra_walk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (8 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.
engine._python_local_class_bindings (cognitive 18) REDACTED:5320— engine._python_local_class_bindings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 2, ternaries 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.
resolution._load_workspace_packages (cognitive 18) REDACTED:453— resolution._load_workspace_packages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (2 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.
resolution._resolve_package_import (cognitive 18) REDACTED:808— resolution._resolve_package_import has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, ternaries 2 (3 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.
resolution._js_exported_declaration_names (cognitive 18) REDACTED:1901— resolution._js_exported_declaration_names has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts), boolean chains 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.
rust.extract_rust (cognitive 18) graphify/extractors/rust.py:234— rust.extract_rust has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3, boolean chains 2, error handling 2 (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.
install.install (cognitive 18) graphify/install.py:948— install.install has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, ternaries 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, 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.
manifest_ingest._parse_apm_fallback (cognitive 18) REDACTED:175— manifest_ingest._parse_apm_fallback has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1, ternaries 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.
mcp_ingest.extract_mcp_config (cognitive 18) graphify/mcp_ingest.py:86— mcp_ingest.extract_mcp_config has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 3, boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
serve._resolve_path_scoped_symbol (cognitive 18) graphify/serve.py:1534— serve._resolve_path_scoped_symbol has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, if/else 3 (5 pts), loops 1, ternaries 1 (nesting depth added 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.
tree_html.build_tree (cognitive 18) graphify/tree_html.py:178— tree_html.build_tree has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wiki.to_wiki (cognitive 18) graphify/wiki.py:304— wiki.to_wiki has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 5, boolean chains 4 (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.
build._fold_confidence (cognitive 17) graphify/build.py:520— build._fold_confidence has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 1 (4 pts), boolean chains 3 (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.
cli._clone_repo (cognitive 17) graphify/cli.py:1344— cli._clone_repo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 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.
cluster.remap_communities_to_previous (cognitive 17) graphify/cluster.py:434— cluster.remap_communities_to_previous has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (9 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 5). 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.
extract._import_c (cognitive 17) REDACTED:1093— extract._import_c has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (16 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.
extract._extract_spock_fallback (cognitive 17) REDACTED:3031— extract._extract_spock_fallback has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1, ternaries 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.
extract.extract_lazarus_package (cognitive 17) REDACTED:7702— extract.extract_lazarus_package has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2, loops 2, ternaries 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.
extract._xaml_binding_refs (cognitive 17) REDACTED:8090— extract._xaml_binding_refs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 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.
extract._get_extractor (cognitive 17) REDACTED:8927— extract._get_extractor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 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.
engine._lexical_class_bases (cognitive 17) REDACTED:2280— engine._lexical_class_bases has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3, 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.
engine._js_dispatch_value_idents (cognitive 17) REDACTED:2928— engine._js_dispatch_value_idents has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 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.
engine._cpp_alias_names (cognitive 17) REDACTED:4955— engine._cpp_alias_names has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, loops 2, ternaries 1 (2 pts) (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.
go.extract_go (cognitive 17) graphify/extractors/go.py:219— go.extract_go has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 4, loops 4, error handling 2 (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.
markdown._vault_lookup (cognitive 17) graphify/extractors/markdown.py:187— markdown._vault_lookup has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 1 (2 pts), loops 1 (2 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.
resolution._python_import_from_module (cognitive 17) REDACTED:2462— resolution._python_import_from_module has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 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.
hooks._install_hook (cognitive 17) graphify/hooks.py:880— hooks._install_hook has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 2 (nesting depth added 10). 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.
install._agents_uninstall (cognitive 17) graphify/install.py:2110— install._agents_uninstall has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
interface_dispatch._overload_pairs (cognitive 17) graphify/interface_dispatch.py:193— interface_dispatch._overload_pairs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, 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.
manifest_ingest._parse_pyproject (cognitive 17) REDACTED:214— manifest_ingest._parse_pyproject has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 5, ternaries 4, loops 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.
manifest_ingest._parse_pom (cognitive 17) REDACTED:291— manifest_ingest._parse_pom has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (4 pts), boolean chains 3, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tree_html._attach_files (cognitive 17) graphify/tree_html.py:68— tree_html._attach_files has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (4 pts), boolean chains 2, error handling 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.
wiki._community_article (cognitive 17) graphify/wiki.py:121— wiki._community_article has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (6 pts), if/else 5, boolean chains 4, ternaries 1 (2 pts) (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.
analyze._cross_community_surprises (cognitive 17) worked/mixed-corpus/raw/analyze.py:239— analyze._cross_community_surprises has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), boolean chains 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.
build.deduplicate_by_label (cognitive 16) graphify/build.py:2040— build.deduplicate_by_label has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
detect._git_tracked_path_keys (cognitive 16) graphify/detect.py:1312— detect._git_tracked_path_keys has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (3 pts), loops 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.
extract._import_kotlin (cognitive 16) REDACTED:1172— extract._import_kotlin has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, loops 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, 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.
engine._java_bound_names (cognitive 16) REDACTED:737— engine._java_bound_names has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine._csharp_element_type_name (cognitive 16) REDACTED:3249— engine._csharp_element_type_name has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (4 pts), boolean chains 3 (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.
resolution._pnpm_workspace_globs (cognitive 16) REDACTED:414— resolution._pnpm_workspace_globs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 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.
install._drop_opencode_config_entry (cognitive 16) graphify/install.py:1785— install._drop_opencode_config_entry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2, 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.
llm._call_ollama_native (cognitive 16) graphify/llm.py:1451— llm._call_ollama_native has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, error handling 1, 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.
llm._parse_label_response (cognitive 16) graphify/llm.py:3531— llm._parse_label_response has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, error handling 1, 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.
multigraph_compat._probe_node_link_round_trip (cognitive 16) graphify/multigraph_compat.py:95— multigraph_compat._probe_node_link_round_trip has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 1 (2 pts), boolean chains 1, 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.
paths.disambiguate_ambiguous_candidates (cognitive 16) graphify/paths.py:395— paths.disambiguate_ambiguous_candidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 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, 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.
security.validate_url (cognitive 16) graphify/security.py:105— security.validate_url has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 2 (3 pts), loops 1 (2 pts), boolean chains 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.
serve._compute_idf (cognitive 16) graphify/serve.py:377— serve._compute_idf has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 3 (6 pts), boolean chains 3 (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.
serve._bfs (cognitive 16) graphify/serve.py:1062— serve._bfs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 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.
watch._rebase_relative_source_files (cognitive 16) graphify/watch.py:496— watch._rebase_relative_source_files has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 2 (5 pts), error handling 1 (4 pts), boolean chains 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.
watch._check_shrink (cognitive 16) graphify/watch.py:1449— watch._check_shrink has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2 (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.
analyze._cross_file_surprises (cognitive 16) worked/mixed-corpus/raw/analyze.py:181— analyze._cross_file_surprises has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D22 · Internal API Consistency· Redundant entry points for graph construction. `build_from_json` appears to be a thin wrapper or legacy alias for `build`, differing only in accepting a single extraction dict vs a list, and lacking the `dedup_llm_backend` and `protected_ids` parameters. This creates confusion about which function to use for new code. · ×1
Redundant entry points for graph construction. `build_from_json` appears to be a thin wrapper or legacy alias for `build`, differing only in accepting a single extraction dict vs a list, and lacking the `dedup_llm_backend` and `protected_ids` parameters. This creates confusion about which function to use for new code. — Deprecate `build_from_json` and have it delegate to `build` with a list wrapper, or remove it if `build` is the canonical entry point. (signatures: build.build_from_json(extraction: dict, directed: bool, root: str | Path | None, dedup: bool): Graph | build.build(extractions: list[dict], directed: bool, dedup: bool, dedup_llm_backend: str | None, root: str | Path | None, protected_ids: set[str] | None): Graph)
D22 · Internal API Consistency· Inconsistent naming convention for singular vs plural operations. `edge_data` (singular) returns a single dict, while `edge_datas` (plural) returns a list. Standard Python/English convention would typically be `edge_data` (singular) for one item and `edge_data` (plural context) or `get_edge_data` for multiple, or consistently use `edge_data` and `edge_datas` but the latter is awkward. More importantly, if the graph supports multi-edges, `edge_data` returning a single dict implies it picks one arbitrarily or fails, whereas `edge_datas` returns all. The naming `edge_datas` is non-standard (should be `edge_data` or `get_edge_data` for the list version, or `edge_data` for single and `edge_data_list` for plural). · ×1
Inconsistent naming convention for singular vs plural operations. `edge_data` (singular) returns a single dict, while `edge_datas` (plural) returns a list. Standard Python/English convention would typically be `edge_data` (singular) for one item and `edge_data` (plural context) or `get_edge_data` for multiple, or consistently use `edge_data` and `edge_datas` but the latter is awkward. More importantly, if the graph supports multi-edges, `edge_data` returning a single dict implies it picks one arbitrarily or fails, whereas `edge_datas` returns all. The naming `edge_datas` is non-standard (should be `edge_data` or `get_edge_data` for the list version, or `edge_data` for single and `edge_data_list` for plural). — Rename `edge_datas` to `get_edge_data` (returning list) or `edge_data` (returning list) and ensure `edge_data` is clearly documented as returning the first/primary edge or raising if multiple exist. Alternatively, rename both to `get_edge` and `get_edges` for clarity. (signatures: build.edge_data(G: Graph, u: str, v: str): dict | build.edge_datas(G: Graph, u: str, v: str): list[dict])
Near-duplicate member pair (98 shared lines) graphify/analyze.py:481— graphify/analyze.py:481-618 | worked/mixed-corpus/raw/analyze.py:327-435 — These two members are variants of one another: 98 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (62 shared lines) graphify/analyze.py:622— graphify/analyze.py:622-717 | worked/mixed-corpus/raw/analyze.py:439-517 — These two members are variants of one another: 62 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (37 shared lines) graphify/extractors/erlang.py:28— graphify/extractors/erlang.py:28-74 | graphify/extractors/vbnet.py:24-78 — These two members are variants of one another: 37 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (29 shared lines) graphify/exporters/graphdb.py:29— graphify/exporters/graphdb.py:29-101 | graphify/exporters/graphdb.py:111-210 — These two members are variants of one another: 29 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Edited copy of a member (65 corresponding lines) · ×1
Edited copy of a member (65 corresponding lines) graphify/extractors/pascal_forms.py:11— graphify/extractors/pascal_forms.py:11-101 | graphify/extractors/pascal_forms.py:104-196 — These two members are one piece of code written twice and then edited apart: 65 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (5 members, 50+ identical tokens) graphify/extractors/cobol.py:100— graphify/extractors/cobol.py:100-297 | graphify/extractors/erlang.py:78-353 | graphify/extractors/r.py:91-482 | graphify/extractors/solidity.py:269-710 | graphify/extractors/vbnet.py:82-433 — These 5 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 5 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 5 times.
Duplicated block (64–68 lines × 2) graphify/extractors/pascal_forms.py:34— graphify/extractors/pascal_forms.py:34-101 | graphify/extractors/pascal_forms.py:133-196 — 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 (54–62 lines × 2) graphify/cli.py:4331— graphify/cli.py:4331-4384 | graphify/watch.py:2024-2085 — 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.
Duplicated block (21–48 lines × 2) graphify/cache.py:657— graphify/cache.py:657-704 | graphify/cache.py:987-1007 — 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 `graphify/cache.py:657` 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. 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.
Duplicated block (35–39 lines × 3) REDACTED:133— REDACTED:133-167 | graphify/google_workspace.py:32-66 | graphify/ingest.py:15-53 — 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. 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.
Duplicated block (32 lines × 2) graphify/analyze.py:576— graphify/analyze.py:576-607 | worked/mixed-corpus/raw/analyze.py:402-433 — before extracting anything, compare `graphify/analyze.py` and `worked/mixed-corpus/raw/analyze.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphify/analyze.py:576` 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 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.
Duplicated block (16–32 lines × 2) graphify/build.py:1101— graphify/build.py:1101-1132 | graphify/build.py:1211-1226 — 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. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `root` to `str | None` in one and `str | Path | None = None` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (31 lines × 2) graphify/analyze.py:410— graphify/analyze.py:410-440 | worked/mixed-corpus/raw/analyze.py:260-290 — before extracting anything, compare `graphify/analyze.py` and `worked/mixed-corpus/raw/analyze.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (30–31 lines × 2) graphify/cli.py:4389— graphify/cli.py:4389-4419 | graphify/watch.py:2090-2119 — 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.
Duplicated block (25–30 lines × 2) REDACTED:6610— REDACTED:6610-6639 | REDACTED:8347-8371 — 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 (23–27 lines × 2) REDACTED:7045— REDACTED:7045-7067 | REDACTED:8234-8260 — 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. 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.
Duplicated block (20–27 lines × 2) graphify/llm.py:1911— graphify/llm.py:1911-1937 | graphify/llm.py:3122-3141 — 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 (24–26 lines × 2) graphify/cli.py:663— graphify/cli.py:663-688 | graphify/cli.py:744-767 — 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. 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.
Duplicated block (18–25 lines × 3) REDACTED:7817— REDACTED:7817-7841 | REDACTED:7903-7920 | REDACTED:8414-8431 — 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 `REDACTED:7817` 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 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.
Duplicated block (19–25 lines × 2) REDACTED:2641— REDACTED:2641-2665 | REDACTED:2746-2764 — 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:2641` 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. 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. 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 (13–24 lines × 2) graphify/extractors/powershell.py:12— graphify/extractors/powershell.py:12-24 | graphify/extractors/powershell.py:457-480 — 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 `graphify/extractors/powershell.py:457` 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 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 after the matched lines, `graphify/extractors/powershell.py:28` calls `_file_stem` and `graphify/extractors/powershell.py:484` 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 (23 lines × 2) graphify/extractors/julia.py:63— graphify/extractors/julia.py:63-85 | graphify/extractors/objc.py:171-193 — 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 (19–23 lines × 2) graphify/llm.py:2579— graphify/llm.py:2579-2597 | graphify/llm.py:2667-2689 — 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 `graphify/llm.py:2579` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. 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.
Duplicated block (17–22 lines × 2) graphify/analyze.py:492— graphify/analyze.py:492-513 | worked/mixed-corpus/raw/analyze.py:332-348 — before extracting anything, compare `graphify/analyze.py` and `worked/mixed-corpus/raw/analyze.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (22 lines × 2) REDACTED:6980— REDACTED:6980-7001 | REDACTED:7466-7487 — 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. 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.
Duplicated block (17–21 lines × 3) graphify/extractors/pascal.py:489— graphify/extractors/pascal.py:489-509 | graphify/extractors/pascal_forms.py:55-71 | graphify/extractors/pascal_forms.py:154-170 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `graphify/extractors/pascal.py:489` 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 (13–21 lines × 2) graphify/extractors/ocaml.py:193— graphify/extractors/ocaml.py:193-205 | graphify/extractors/ocaml.py:266-286 — 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. 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.
Duplicated block (14–19 lines × 2) graphify/cli.py:2053— graphify/cli.py:2053-2071 | graphify/serve.py:2123-2136 — 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 (11–18 lines × 2) graphify/llm.py:2024— graphify/llm.py:2024-2041 | graphify/llm.py:3159-3169 — 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 `graphify/llm.py:2024` 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 (17 lines × 4) graphify/extractors/fortran.py:112— graphify/extractors/fortran.py:112-128 | graphify/extractors/go.py:268-284 | graphify/extractors/julia.py:45-61 | graphify/extractors/rust.py:305-321 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `graphify/extractors/fortran.py:112` 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 (15–17 lines × 3) graphify/cli.py:483— graphify/cli.py:483-498 | graphify/cli.py:660-676 | graphify/cli.py:741-755 — 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. 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.
Duplicated block (15–17 lines × 2) REDACTED:3999— REDACTED:3999-4015 | REDACTED:4072-4086 — 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. 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.
Duplicated block (12–16 lines × 3) graphify/watch.py:2322— graphify/watch.py:2322-2337 | graphify/watch.py:2371-2382 | graphify/watch.py:2627-2638 — 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 (15–16 lines × 2) REDACTED:317— REDACTED:317-331 | REDACTED:787-802 — 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. 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.
Duplicated block (14–15 lines × 4) graphify/install.py:1147— graphify/install.py:1147-1160 | graphify/install.py:1929-1942 | graphify/install.py:2246-2260 | graphify/install.py:2454-2467 — all 4 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. 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.
Duplicated block (15 lines × 3) graphify/install.py:1163— graphify/install.py:1163-1177 | graphify/install.py:2339-2362 | graphify/install.py:2470-2484 — 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 `graphify/install.py:1163` 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 (13–15 lines × 2) REDACTED:5076— REDACTED:5076-5090 | REDACTED:5104-5116 — 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. 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.
Duplicated block (10–15 lines × 2) REDACTED:9454— REDACTED:9454-9468 | graphify/extractors/rust.py:875-884 — 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–15 lines × 2) graphify/extractors/zig.py:147— graphify/extractors/zig.py:147-154 | graphify/extractors/zig.py:173-187 — 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 (14 lines × 3) REDACTED:7121— REDACTED:7121-7134 | REDACTED:7937-7950 | REDACTED:7954-7967 — 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (12–14 lines × 2) graphify/analyze.py:560— graphify/analyze.py:560-573 | worked/mixed-corpus/raw/analyze.py:390-401 — before extracting anything, compare `graphify/analyze.py` and `worked/mixed-corpus/raw/analyze.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphify/analyze.py:560` 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. 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 (11–14 lines × 2) REDACTED:5459— REDACTED:5459-5472 | REDACTED:6539-6549 — 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. 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.
Duplicated block (10–14 lines × 2) REDACTED:10252— REDACTED:10252-10265 | REDACTED:10267-10276 — 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:10252` 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 (9–14 lines × 2) graphify/extractors/rust.py:458— graphify/extractors/rust.py:458-466 | graphify/extractors/rust.py:485-498 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `graphify/extractors/rust.py:468` calls `_rust_type_last_segment`, `setdefault`, `set` and `graphify/extractors/rust.py:499` 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 (13–14 lines × 2) graphify/extractors/solidity.py:461— graphify/extractors/solidity.py:461-474 | graphify/extractors/solidity.py:482-494 — 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 `graphify/extractors/solidity.py:461` 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 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.
Duplicated block (13 lines × 3) REDACTED:4669— REDACTED:4669-4681 | REDACTED:5260-5272 | REDACTED:5454-5466 — 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. 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.
Duplicated block (10–13 lines × 3) graphify/install.py:1132— graphify/install.py:1132-1141 | graphify/install.py:2218-2230 | graphify/install.py:2435-2447 — 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 (12–13 lines × 2) graphify/cli.py:4972— graphify/cli.py:4972-4983 | graphify/cli.py:5154-5166 — 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 `graphify/cli.py:5154` 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 (8–13 lines × 2) graphify/extractors/bash.py:119— graphify/extractors/bash.py:119-131 | graphify/extractors/markdown.py:424-431 — 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.
Duplicated block (11–13 lines × 2) REDACTED:6696— REDACTED:6696-6708 | REDACTED:8089-8099 — 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 (9–13 lines × 2) graphify/extractors/zig.py:148— graphify/extractors/zig.py:148-156 | graphify/extractors/zig.py:159-171 — 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. 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 (11–12 lines × 4) graphify/extractors/csharp.py:162— graphify/extractors/csharp.py:162-172 | graphify/extractors/csharp.py:557-567 | REDACTED:3953-3964 | REDACTED:4219-4229 — there are 4 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. 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.
Duplicated block (10–12 lines × 4) graphify/install.py:1068— graphify/install.py:1068-1079 | graphify/install.py:1952-1961 | graphify/install.py:2191-2200 | graphify/install.py:2416-2425 — all 4 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 `graphify/install.py:1068` 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 (12 lines × 3) graphify/extractors/elixir.py:26— graphify/extractors/elixir.py:26-37 | graphify/extractors/powershell.py:21-32 | graphify/extractors/zig.py:30-41 — 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. 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.
Duplicated block (12 lines × 2) graphify/detect.py:391— graphify/detect.py:391-402 | graphify/detect.py:403-414 — 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. 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.
Duplicated block (10–11 lines × 2) graphify/install.py:1185— graphify/install.py:1185-1194 | graphify/install.py:2493-2503 — 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. 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.
Duplicated block (8–11 lines × 2) graphify/prs.py:424— graphify/prs.py:424-434 | graphify/serve.py:2664-2671 — 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 (10 lines × 4) graphify/detect.py:2662— graphify/detect.py:2662-2671 | graphify/detect.py:2673-2682 | graphify/detect.py:2684-2693 | graphify/detect.py:2695-2706 — all 4 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–10 lines × 2) REDACTED:3098— REDACTED:3098-3107 | graphify/extractors/objc.py:78-84 — 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 `REDACTED:3098` 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 (9 lines × 9) graphify/extractors/bash.py:117— graphify/extractors/bash.py:117-125 | graphify/extractors/dm.py:28-36 | graphify/extractors/fortran.py:88-96 | graphify/extractors/json_config.py:113-121 | graphify/extractors/julia.py:21-29 | graphify/extractors/objc.py:105-113 | graphify/extractors/ocaml.py:31-39 | graphify/extractors/rust.py:246-254 | graphify/extractors/verilog.py:219-227 — 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 9 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 after the matched lines, `graphify/extractors/bash.py:133` calls `set` and `graphify/extractors/fortran.py:97` 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 (9 lines × 4) graphify/extractors/erlang.py:87— graphify/extractors/erlang.py:87-95 | graphify/extractors/r.py:100-108 | graphify/extractors/solidity.py:278-286 | graphify/extractors/vbnet.py:91-99 — 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. 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.
Duplicated block (7–9 lines × 3) graphify/cli.py:1953— graphify/cli.py:1953-1959 | graphify/cli.py:2107-2113 | graphify/cli.py:3057-3065 — 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 (8–9 lines × 3) REDACTED:7988— REDACTED:7988-7995 | REDACTED:8225-8233 | graphify/extractors/rust.py:435-442 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (6–9 lines × 2) graphify/extractors/go.py:648— graphify/extractors/go.py:648-656 | graphify/extractors/go.py:661-666 — 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 lines × 8) graphify/extractors/dart.py:299— graphify/extractors/dart.py:299-306 | graphify/extractors/dart.py:308-315 | graphify/extractors/dart.py:317-324 | graphify/extractors/dart.py:325-332 | graphify/extractors/dart.py:334-341 | graphify/extractors/dart.py:519-526 | graphify/extractors/dart.py:528-535 | graphify/extractors/dart.py:537-544 — all 8 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 (8 lines × 7) graphify/extractors/bash.py:115— graphify/extractors/bash.py:115-122 | graphify/extractors/dm.py:26-33 | graphify/extractors/go.py:229-236 | graphify/extractors/julia.py:19-26 | graphify/extractors/ocaml.py:29-36 | graphify/extractors/rust.py:244-251 | graphify/extractors/verilog.py:217-224 — 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 7 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.
Duplicated block (6–8 lines × 2) graphify/extractors/go.py:792— graphify/extractors/go.py:792-799 | graphify/extractors/rust.py:955-960 — 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 `graphify/extractors/go.py:792` 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. 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. 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 (7 lines × 5) graphify/install.py:2683— graphify/install.py:2683-2689 | graphify/install.py:2717-2723 | graphify/install.py:2733-2739 | graphify/install.py:2763-2769 | graphify/install.py:2810-2816 — all 5 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 (6–7 lines × 2) graphify/cli.py:3554— graphify/cli.py:3554-3559 | graphify/cli.py:3565-3571 — 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 `graphify/cli.py:3565` 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. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `graphify/cli.py:3553` calls `exit` and `graphify/cli.py:3564` 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 (5 lines × 5) graphify/extractors/cobol.py:106— graphify/extractors/cobol.py:106-110 | graphify/extractors/erlang.py:92-96 | graphify/extractors/r.py:105-109 | graphify/extractors/solidity.py:283-287 | graphify/extractors/vbnet.py:96-100 — 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 5 call sites, so a change lands once.
Duplicated block (5 lines × 4) REDACTED:4598— REDACTED:4598-4604 | REDACTED:5173-5180 | REDACTED:5410-5414 | REDACTED:5621-5625 — all 4 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.
Coverage not measured — no coverage collector is wired up — Coverage NOT MEASURED: `--collect:"XPlat Code Coverage"` names a data collector that ships in the `coverlet.collector` package, and this repository wires up none — no test project references it and no runsettings declares one. The absence of coverage here is therefore not evidence about the suite or about our analyzer environment: without a collector, `--collect` produces nothing even from a suite that builds and passes. Add a `coverlet.collector` PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect.
Third-party script without Subresource Integrity worked/rsl-siege-manager/graph.html:6— `https://unpkg.com/vis-network/standalone/umd/vis-network.min.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository.
SC1 · Supply-chain hygiene· NuGet dependencies are not locked · ×1
NuGet dependencies are not locked — No packages.lock.json and no central package management — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
Duplicated predicate graphify/analyze.py:346— `_is_concept_node(G, u) or _is_concept_node(G, v)` appears character-identically in 2 files — graphify/analyze.py, worked/mixed-corpus/raw/analyze.py. 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 graphify/analyze.py:348— `_is_file_node(G, u) or _is_file_node(G, v)` appears character-identically in 2 files — graphify/analyze.py, worked/mixed-corpus/raw/analyze.py. 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 graphify/analyze.py:430— `cid_u is None or cid_v is None or cid_u == cid_v` appears character-identically in 2 files — graphify/analyze.py, worked/mixed-corpus/raw/analyze.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate REDACTED:915— `cu is not None and cv is not None and cu != cv` appears character-identically in 2 files — REDACTED, graphify/exporters/html.py. 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 graphify/extractors/cobol.py:295— `edge["target"] in seen_ids or edge["relation"] == "imports_from"` appears character-identically in 4 files — graphify/extractors/cobol.py, graphify/extractors/erlang.py, graphify/extractors/r.py, graphify/extractors/solidity.py. 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 graphify/analyze.py:90— `label.endswith("()") and G.degree(node_id) <= 1` appears character-identically in 2 files — graphify/analyze.py, worked/mixed-corpus/raw/analyze.py. 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 graphify/analyze.py:86— `label.startswith(".") and label.endswith("()")` appears character-identically in 3 files — graphify/analyze.py, graphify/build.py, worked/mixed-corpus/raw/analyze.py. 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 graphify/extractors/erlang.py:58— `len(candidates) != 1 or candidates[0] == caller` appears character-identically in 3 files — graphify/extractors/erlang.py, graphify/extractors/r.py, graphify/extractors/vbnet.py. 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 graphify/extractors/r.py:21— `len(value) >= 2 and value[0] == value[-1] and value[0] in "'\""` appears character-identically in 2 files — graphify/extractors/r.py, graphify/extractors/solidity.py. 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 graphify/analyze.py:315— `min(deg_u, deg_v) <= 2 and max(deg_u, deg_v) >= 5` appears character-identically in 2 files — graphify/analyze.py, worked/mixed-corpus/raw/analyze.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate REDACTED:751— `name_node is not None and name_node.type == "identifier"` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate graphify/extractors/csharp.py:171— `node.get("id") not in repointed_from or node.get("id") in still_referenced` appears character-identically in 2 files — graphify/extractors/csharp.py, 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 graphify/extractors/r.py:33— `node.get("source_file") and node.get("label") == Path(str(node["source_file"])).name` appears character-identically in 2 files — graphify/extractors/r.py, graphify/extractors/solidity.py. 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 graphify/analyze.py:519— `not _is_file_node(G, n) and not _is_concept_node(G, n) and s > 0` appears character-identically in 2 files — graphify/analyze.py, worked/mixed-corpus/raw/analyze.py. 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 graphify/cross_repo_calls.py:114— `not data.get("_callable_class") or not data.get("source_file")` appears character-identically in 2 files — graphify/cross_repo_calls.py, graphify/cross_repo_types.py. 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 graphify/extractors/cobol.py:147— `not source_id or not target_id or source_id == target_id or key in seen_edges` appears character-identically in 5 files — graphify/extractors/cobol.py, graphify/extractors/erlang.py, graphify/extractors/r.py, graphify/extractors/solidity.py. 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 graphify/analyze.py:354— `not u_source or not v_source or u_source == v_source` appears character-identically in 2 files — graphify/analyze.py, worked/mixed-corpus/raw/analyze.py. 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 graphify/prs.py:641— `p.base_branch == base and p.status not in ("WRONG-BASE", "STALE")` appears character-identically in 2 files — graphify/prs.py, graphify/serve.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate REDACTED:9244— `recv is not None and recv.type == "identifier"` appears character-identically in 2 files — REDACTED, graphify/extractors/objc.py. 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 graphify/build.py:1697— `src not in node_set or tgt not in node_set` appears character-identically in 2 files — graphify/build.py, worked/mixed-corpus/raw/build.py. 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 graphify/extractors/go.py:796— `tgt in valid_ids or edge["relation"] in ("imports", "imports_from")` appears character-identically in 2 files — graphify/extractors/go.py, graphify/extractors/rust.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate REDACTED:422— `true_src is not None and true_tgt is not None` appears character-identically in 2 files — REDACTED, graphify/watch.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate REDACTED:3102— `type_name and type_name[:1].isupper() and len(declarators) == 1` appears character-identically in 2 files — REDACTED, graphify/extractors/objc.py. 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 parse failure graphify/cache.py:1880— `_hashable` (in `scope_semantic_result`) returns `False` when `TypeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 on parse failure graphify/cache.py:1927— `edge_dangles` (in `scope_semantic_result`) returns `False` when `TypeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 on parse failure graphify/cache.py:1935— `hyperedge_dangles` (in `scope_semantic_result`) returns `False` when `TypeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 on parse failure graphify/cli.py:206— `_search_hint_terms` returns `[]` when `ValueError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 on parse failure graphify/detect.py:1899— `_ignored` (in `ignored_predicate`) returns `False` when `ValueError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 on parse failure graphify/detect.py:2716— `_in_root` (in `save_manifest`) returns `False` when `(ValueError, OSError, RuntimeError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 on parse failure graphify/detect.py:3035— `_in_root` (in `detect_incremental`) returns `False` when `(ValueError, OSError, RuntimeError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 on parse failure graphify/extractors/sql.py:383— `_go_separators` returns `[]` when `UnicodeDecodeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 on parse failure graphify/install.py:1635— `_load_json_like` returns `{}` when `(OSError, json.JSONDecodeError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 on parse failure graphify/multigraph_compat.py:156— `_probe_reserved_key_attr_rejected` returns `True` when `TypeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 on parse failure graphify/reflect.py:853— `load_learning_overlay` returns `{}` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 on parse failure graphify/serve.py:136— `_max_server_contexts` returns `8` when `ValueError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 on parse failure graphify/watch.py:952— `_referenced_unscanned_identities` returns `set()` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 graphify/cli.py:662— `_zero_node_stamped_code_sources` 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 graphify/cli.py:743— `_zero_node_stamped_semantic_sources` 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 graphify/cli.py:828— `_prune_graph_json_sources` swallows every exception into `return 0` — 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 graphify/detect.py:741— `docx_to_markdown` 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 graphify/detect.py:773— `xlsx_to_markdown` 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 graphify/detect.py:954— `count_words` swallows every exception into `return 0` — 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:441— `_workspace_globs` 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.
Orphaned file graphify/scip_ingest.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file graphify/multigraph_compat.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file graphify/pascal_resolution.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 3 significant file(s) lose their only recent owner: graphify/mcp_ingest.py, scripts/gen_demo_path.py, graphify/transcribe.py. Pair on, review, or document these before any departure.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
D34 · Knowledge Freshness· Orphaned files with no living knowledge · ×1
Orphaned files with no living knowledge — 3 of 99 analysed file(s) have no living knowledge left — their last meaningful change has decayed away, so if one breaks, no one currently understands it (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; 99 of the 111 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each — most significant first: graphify/scip_ingest.py, graphify/multigraph_compat.py, graphify/pascal_resolution.py. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
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.
No src/ separation — Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
No SAST — No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 16275 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
Dependency hygiene PARTLY measured — Python dependencies read, no exact pin to grade for currency — This repository's Python dependencies were read: 31 shipped distribution(s) across 1 manifest(s) (45 development or optional declaration(s) excluded, because a consumer does not install them). Whether any of them is behind its current release is the dependency-CURRENCY question, and no declaration here carries an EXACT pin to ask it about — every one is a floor or a range, which installs the newest release it admits and therefore cannot be behind one. That is a healthy declaration style, NOT a defect and NOT a gap in this analyzer; there is simply no currency question to answer. This is NOT a finding that these dependencies are current or healthy. Lockfiles are deliberately not read (poetry.lock, REDACTED, Pipfile.lock, pdm.lock): the four disagree about dev/optional membership, and misreading one would charge a test-only package a consumer never receives. Known CVEs in the same dependency graph are a separate question, reported under D30.
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.
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 01a1705b-938c-7885-aa94-8181f415a10b · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 34 · Warnings: 924 · Recommendations: 60 · Info: 1 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 25-10-2026 @ 00:00 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.