Public report — gitoxide, published 29 Sep 2026.
Concrete security findings (which rule fired, in which file, on which line; CVE IDs, secret matches,
dependency versions) are REDACTED in this version; ask the repo owner for the full report.
Public
Codebase surveyMeasured under the Code Assurance Index · rubric rubric-2026.09.17 (frozen) · verify this surveyFiledcd_30acfef02f03471c8bbf81bb61642c89
Filed 29 September 2026, 02:43 UTC
Public
Large · 213,437 LoC · 70 projects · rebuild ~3.0 person-years · weakest lens: Accessibility (62%)
Findings by grade
21 critical897 serious12 minor50 could not be resolved — could be critical — see Limitations
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
29 September 2026, 02:04 UTC
A measurement, not a certificate. The Code Assurance Index does not certify,
approve or guarantee this codebase; it records a reproducible number and the evidence it was computed from. The
standard is authored by Canine Development, who also build Watchdog — its only implementation today. That is said
here so the number is checked rather than believed.
Grounded in facts. Every number here is computed, not narrated — reproducible, tool-backed, and traceable to a line of code. How to trust this ▸
891findings with an exact file:lineof 930 — the remainder are repo-wide signals (a dimension-level measurement, not a single line); open any file:line and verify
48/127dimensions across the health lenses213437 LoC · 70 projects — wide & deep
The system holds an adequate standing with a health score of 69%, reflecting a large, complex asset that is functional but carries significant operational drag. With over 213,000 lines of production code and a rebuild cost estimated at €440,000, the organization has substantial value tied up here. While the architecture is robust and the domain modeling is excellent, the overall maturity and accessibility levels reveal hidden costs that threaten delivery speed and compliance.
The most critical risk is the accessibility gap, which sits at 62% against a backdrop of high architectural strength. This weakness creates a compliance exposure for a system of this scale, where remediation offers the highest protection per euro spent. The code quality signals suggest a velocity tax of 6–14% on changes in weaker areas, meaning every modification takes longer and costs more than it should. This drag compounds annually, affecting the nearly 1.1 million lines the team touches each year.
A specific set of structural fixes offers immediate leverage. Declaring language attributes, proper document titles, and main landmarks, along with ensuring visible focus styles and sufficient color contrast, addresses the core accessibility failures. These changes are not merely cosmetic; they prevent a recurring annual cost of hundreds of engineer-days in rework and compliance checks. The return on investment is rapid, with the initial effort paying for itself within months through sustained efficiency gains.
Strengths in architecture and domain modeling provide a solid foundation for these improvements. The system is well-structured, allowing for targeted fixes without major refactoring. However, confidence in the assessment is slightly tempered by unmeasured areas, such as event-driven patterns and code coverage, which remain unknown. Leadership should prioritize the accessibility remediation first, as it delivers the fastest financial return and reduces long-term technical debt, while acknowledging that some operational risks remain unquantified.
How the score is built — each lens's share of the headlineWidth is the lens's weight in the worst-heaviest fold (the weakest area pulls hardest); colour is that lens's own band. A lens fixes the score in proportion to its width.
D22 · Duplicate output configuration properties with different types. `output_format` uses the generic `OutputFormat` enum, while `format` uses a domain-specific `Format` enum. This forces users to choose between a generic and a specific formatter for the same operation, creating confusion about which one takes precedence or if they are redundant.
D22 · Duplicate output configuration properties with different types. Similar to the status module, `revision.list` exposes both `format` (generic `OutputFormat`) and `text` (specific `Format`). This inconsistency across modules suggests a lack of unified design for how output formatting is handled in context objects versus options structs.
D22 · Misleading property naming. `index_worktree_renames` is typed as `ProgressItem`, which typically denotes a progress bar or counter, not a boolean flag or configuration option. This suggests a copy-paste error or misuse of the `ProgressItem` type for a control flag, confusing the API consumer about the property's intent.
D22 · Inconsistent use of `ProgressItem` for configuration vs. state. In `clone.Options`, `revision` is a `ProgressItem`, which is semantically incorrect as a revision is a string/identifier, not a progress metric. In `fetch.Options`, `open_negotiation_graph` is also a `ProgressItem`, which is similarly confusing. These should likely be `String` or a specific `Revision` type, not progress tracking types.
A full-fidelity diff against the previous run's complete recorded findings — line-move tolerant: a finding that only shifted line counts as unchanged, only genuinely new titles/files surface here.
Rebuild cost & value ~ Modeled — €140,000–€730,000
1.0× (at 69% quality) — the last 20% of quality is most of the work
Size & shape
Large · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)
This codebase represents roughly ~3.0 person-years of build effort (about ~€440,000 to rebuild). Its weakest lens is Accessibility at 62% — the part of that asset most exposed by the findings below.
How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.0) — standard service × a 1.0× quality factor, at €60–95/h; indicative, ±~30% · size measured directly from source · effort from total production LoC as straight-line logic (the tier split is a C#-only syntax walk), a conservative lower bound. Indicative only — most sensitive to the hourly rate and the domain tier (both tunable in config).
Top priorities
The highest-leverage moves; the full ranked list is in the Roadmap below.
1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
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.
The top-ranked fix costs roughly 1–3 engineer-days once. Not doing it costs about 175.2–1051.1 engineer-days every year, paid as drag on the ~1,094,067 lines this team changes annually — a bill that arrives whether or not anyone books it. On those figures the fix breaks even in roughly 1–2 months and is free after that. Method, stated so this is not read as a quotation: debt from the ranked task's effort band; interest = annual changed lines (measured, annualised from the 90-day window) ÷ an ASSUMED 150–400 lines per engineer-day × the 6–14% drag implied by the code-quality signals; breaking point = debt ÷ annual interest. A modelled planning range built from measured inputs and one named assumption — not a quotation, a valuation, or a certified figure.
Evidence: D15 churn: 269,770 line(s) changed over a 90-day window ⇒ ~1,094,067/year · D1/D2/D4 code quality: averaging 5.4/10 ⇒ a 6–14% drag on each change · top-ranked remediation: Low effort ⇒ about 1–3 engineer-day(s)
→ Do the top-ranked fix now if this code will still be yours in 2 months.
Value concentrated against a weak lens · Medium · Value at risk
This is a Large asset (~3.0 person-years to rebuild), and its weakest lens is Accessibility at 62%. The operational and business risk on an asset this size concentrates there — that's where remediation buys the most protection.
→ Direct remediation budget at Accessibility first — highest risk-reduction per euro on an asset this size.
Highest-leverage move · Medium · Leverage
Of everything flagged, the best return on effort is: Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh. The rest can wait behind it.
Evidence: priority ranking: top of 5 ranked by impact/effort
→ Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
A velocity tax on every change · Medium · Economics
The code-quality signals (complexity, duplication, cohesion) average 5.4/10, which acts as a tax on every change in the weaker areas: modifications there plausibly cost on the order of 6–14% more than in clean code, and the tax compounds as the codebase grows. (A modelled estimate, not a measured fact.)
Evidence: D1/D2/D4 code quality: averaging 5.4/10 across the code-quality signals actually measured
→ Pay it down where churn is highest — the hotspots — not everywhere; that's where the tax is actually paid.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.
Architecture — module dependency matrix
Rows and columns are the same modules, ordered so that a module only depends on ones above it. A cell means the row depends on the column, and its number is how many type pairs create that dependency. Read one thing: is anything above the diagonal? A mark there is a dependency cycle. (A cycle is all this shows — an unusual but cycle-free dependency sits below the diagonal like any other.)
986 modules, 3493 dependencies. 6 dependency cycles across 181 modules, marked above the diagonal.
Showing the 40 most-connected modules; 946 more are not drawn.
Module dependency matrix. The row depends on the column; the number is how many type pairs create the dependency. A cell above the diagonal is part of a dependency cycle.
gitoxide_core.corpus.engine uses gix.config.tree.keys.validate. Changing gix.config.tree.keys.validate can break gitoxide_core.corpus.engine, not the reverse.
Position
Above the diagonal — a cycle. Neither module can be changed, tested or deployed independently until one of these dependencies goes.
4→33 gix_features.cache.impl_ depends on gix.config.tree.keys.validatecycle✕
Type pairs
1 distinct (type in gix_features.cache.impl_ → type in gix.config.tree.keys.validate) reference.
gix_features.cache.impl_ uses gix.config.tree.keys.validate. Changing gix.config.tree.keys.validate can break gix_features.cache.impl_, not the reverse.
Position
Above the diagonal — a cycle. Neither module can be changed, tested or deployed independently until one of these dependencies goes.
5→34 gix_glob.wildmatch.function depends on gitoxide_core.organizecycle✕
Type pairs
1 distinct (type in gix_glob.wildmatch.function → type in gitoxide_core.organize) reference.
gix.config.tree.sections.push.validate uses gix_glob.wildmatch.function. Changing gix_glob.wildmatch.function can break gix.config.tree.sections.push.validate, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
7→5 gix_bitmap.ewah depends on gix_glob.wildmatch.function✕
Type pairs
1 distinct (type in gix_bitmap.ewah → type in gix_glob.wildmatch.function) reference.
gitoxide_core.commitgraph.verify uses gix.config.tree.sections.push.validate. Changing gix.config.tree.sections.push.validate can break gitoxide_core.commitgraph.verify, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
10→38 gitoxide_core.commitgraph.verify depends on gitoxide_corecycle✕
Type pairs
1 distinct (type in gitoxide_core.commitgraph.verify → type in gitoxide_core) reference.
gix_attributes.search uses gix.config.tree.sections.push.validate. Changing gix.config.tree.sections.push.validate can break gix_attributes.search, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
12→15 gix_attributes.search depends on gix_attributescycle✕
Type pairs
2 distinct (type in gix_attributes.search → type in gix_attributes) references.
gix_credentials.helper uses gitoxide_core.index.information. Changing gitoxide_core.index.information can break gix_credentials.helper, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
16→5 gix_credentials.helper depends on gix_glob.wildmatch.function✕
Type pairs
2 distinct (type in gix_credentials.helper → type in gix_glob.wildmatch.function) references.
gix_credentials.helper uses gix.config.tree.sections.push.validate. Changing gix.config.tree.sections.push.validate can break gix_credentials.helper, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
16→10 gix_credentials.helper depends on gitoxide_core.commitgraph.verify✕
Type pairs
2 distinct (type in gix_credentials.helper → type in gitoxide_core.commitgraph.verify) references.
gix_credentials.helper uses gitoxide_core.commitgraph.verify. Changing gitoxide_core.commitgraph.verify can break gix_credentials.helper, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
16→33 gix_credentials.helper depends on gix.config.tree.keys.validatecycle✕
Type pairs
2 distinct (type in gix_credentials.helper → type in gix.config.tree.keys.validate) references.
gix_hash.object_id uses gitoxide_core.repository.branch.list. Changing gitoxide_core.repository.branch.list can break gix_hash.object_id, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
19→4 gix_hash.object_id depends on gix_features.cache.impl_✕
Type pairs
1 distinct (type in gix_hash.object_id → type in gix_features.cache.impl_) reference.
gix_object uses gix.config.tree.sections.gitoxide.subsections. Changing gix.config.tree.sections.gitoxide.subsections can break gix_object, not the reverse.
Position
Above the diagonal — a cycle. Neither module can be changed, tested or deployed independently until one of these dependencies goes.
22→26 gix_object depends on gix.dirwalk.itercycle✕
Type pairs
3 distinct (type in gix_object → type in gix.dirwalk.iter) references.
Which types
gix_object.CommitRefIter → gix.dirwalk.iter.Item
gix_object.TagRefIter → gix.dirwalk.iter.Item
gix_object.TreeRefIter → gix.dirwalk.iter.Item
Direction
gix_object uses gix.dirwalk.iter. Changing gix.dirwalk.iter can break gix_object, not the reverse.
Position
Above the diagonal — a cycle. Neither module can be changed, tested or deployed independently until one of these dependencies goes.
gix.config.tree.sections.gitoxide.subsections uses gitoxide_core.corpus.engine. Changing gitoxide_core.corpus.engine can break gix.config.tree.sections.gitoxide.subsections, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
23→4 gix.config.tree.sections.gitoxide.subsections depends on gix_features.cache.impl_✕
Type pairs
1 distinct (type in gix.config.tree.sections.gitoxide.subsections → type in gix_features.cache.impl_) reference.
gix.config.tree.sections.gitoxide.subsections uses gix_features.cache.impl_. Changing gix_features.cache.impl_ can break gix.config.tree.sections.gitoxide.subsections, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
23→5 gix.config.tree.sections.gitoxide.subsections depends on gix_glob.wildmatch.function✕
Type pairs
3 distinct (type in gix.config.tree.sections.gitoxide.subsections → type in gix_glob.wildmatch.function) references.
gix.config.tree.sections.gitoxide.subsections uses gix_glob.wildmatch.function. Changing gix_glob.wildmatch.function can break gix.config.tree.sections.gitoxide.subsections, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
23→12 gix.config.tree.sections.gitoxide.subsections depends on gix_attributes.search✕
Type pairs
1 distinct (type in gix.config.tree.sections.gitoxide.subsections → type in gix_attributes.search) reference.
gix.config.tree.sections.gitoxide.subsections uses gix_attributes.search. Changing gix_attributes.search can break gix.config.tree.sections.gitoxide.subsections, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
23→15 gix.config.tree.sections.gitoxide.subsections depends on gix_attributes✕
Type pairs
1 distinct (type in gix.config.tree.sections.gitoxide.subsections → type in gix_attributes) reference.
gix.config.tree.sections.gitoxide.subsections uses gix_attributes. Changing gix_attributes can break gix.config.tree.sections.gitoxide.subsections, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
23→17 gix.config.tree.sections.gitoxide.subsections depends on gix_fs✕
Type pairs
1 distinct (type in gix.config.tree.sections.gitoxide.subsections → type in gix_fs) reference.
gix.config.tree.sections.gitoxide.subsections uses gix_object. Changing gix_object can break gix.config.tree.sections.gitoxide.subsections, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
23→27 gix.config.tree.sections.gitoxide.subsections depends on gix.commit.describecycle✕
Type pairs
1 distinct (type in gix.config.tree.sections.gitoxide.subsections → type in gix.commit.describe) reference.
gix.config.tree.sections.gitoxide.subsections uses gix.commit.describe. Changing gix.commit.describe can break gix.config.tree.sections.gitoxide.subsections, not the reverse.
Position
Above the diagonal — a cycle. Neither module can be changed, tested or deployed independently until one of these dependencies goes.
23→32 gix.config.tree.sections.gitoxide.subsections depends on gix.typescycle✕
Type pairs
4 distinct (type in gix.config.tree.sections.gitoxide.subsections → type in gix.types) references.
gix.config.tree.sections.gitoxide.subsections uses gix.types. Changing gix.types can break gix.config.tree.sections.gitoxide.subsections, not the reverse.
Position
Above the diagonal — a cycle. Neither module can be changed, tested or deployed independently until one of these dependencies goes.
24→2 gix_commitgraph depends on gitoxide_core.repository.branch.list✕
Type pairs
2 distinct (type in gix_commitgraph → type in gitoxide_core.repository.branch.list) references.
gix_commitgraph uses gix.config.tree.sections.gitoxide.subsections. Changing gix.config.tree.sections.gitoxide.subsections can break gix_commitgraph, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
24→33 gix_commitgraph depends on gix.config.tree.keys.validatecycle✕
Type pairs
2 distinct (type in gix_commitgraph → type in gix.config.tree.keys.validate) references.
gix.config.tree.sections uses gix.config.tree.keys.validate. Changing gix.config.tree.keys.validate can break gix.config.tree.sections, not the reverse.
Position
Above the diagonal — a cycle. Neither module can be changed, tested or deployed independently until one of these dependencies goes.
26→16 gix.dirwalk.iter depends on gix_credentials.helper✕
Type pairs
1 distinct (type in gix.dirwalk.iter → type in gix_credentials.helper) reference.
gix_odb.store_impls.dynamic uses gitoxide_core.repository.branch.list. Changing gitoxide_core.repository.branch.list can break gix_odb.store_impls.dynamic, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
29→5 gix_odb.store_impls.dynamic depends on gix_glob.wildmatch.function✕
Type pairs
1 distinct (type in gix_odb.store_impls.dynamic → type in gix_glob.wildmatch.function) reference.
gix_odb.store_impls.dynamic uses gix_glob.wildmatch.function. Changing gix_glob.wildmatch.function can break gix_odb.store_impls.dynamic, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
29→7 gix_odb.store_impls.dynamic depends on gix_bitmap.ewah✕
Type pairs
1 distinct (type in gix_odb.store_impls.dynamic → type in gix_bitmap.ewah) reference.
gix_odb.store_impls.dynamic uses gix.config.tree.keys.validate. Changing gix.config.tree.keys.validate can break gix_odb.store_impls.dynamic, not the reverse.
Position
Above the diagonal — a cycle. Neither module can be changed, tested or deployed independently until one of these dependencies goes.
29→34 gix_odb.store_impls.dynamic depends on gitoxide_core.organizecycle✕
Type pairs
1 distinct (type in gix_odb.store_impls.dynamic → type in gitoxide_core.organize) reference.
gix.types uses gix.config.tree.sections.gitoxide.subsections. Changing gix.config.tree.sections.gitoxide.subsections can break gix.types, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
gix.config.tree.keys.validate uses gix_glob.wildmatch.function. Changing gix_glob.wildmatch.function can break gix.config.tree.keys.validate, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
33→9 gix.config.tree.keys.validate depends on gix_hash.oid✕
Type pairs
1 distinct (type in gix.config.tree.keys.validate → type in gix_hash.oid) reference.
gitoxide_core.organize uses gitoxide_core.repository.branch.list. Changing gitoxide_core.repository.branch.list can break gitoxide_core.organize, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
34→5 gitoxide_core.organize depends on gix_glob.wildmatch.function✕
Type pairs
1 distinct (type in gitoxide_core.organize → type in gix_glob.wildmatch.function) reference.
gix_error.concrete.metadata uses gix_glob.wildmatch.function. Changing gix_glob.wildmatch.function can break gix_error.concrete.metadata, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
36→11 gix_error.concrete.metadata depends on gix.clone.with_revision✕
Type pairs
1 distinct (type in gix_error.concrete.metadata → type in gix.clone.with_revision) reference.
gix_error.concrete.metadata uses gix.config.tree.keys.validate. Changing gix.config.tree.keys.validate can break gix_error.concrete.metadata, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
37→5 gix_tix.history depends on gix_glob.wildmatch.function✕
Type pairs
3 distinct (type in gix_tix.history → type in gix_glob.wildmatch.function) references.
gix_tix.history uses gix.config.tree.sections.gitoxide.subsections. Changing gix.config.tree.sections.gitoxide.subsections can break gix_tix.history, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A03:2021 — Injection
8
High / Critical
A05:2021 — Security Misconfiguration
6
High / Critical
A06:2021 — Vulnerable & Outdated Components
4
Medium
Roadmap
First, correct the page structure by adding essential semantic elements like language attributes, titles, and main landmarks while ensuring headings remain ordered and zoom is enabled. Second, enforce accessibility standards by integrating automated checks into your existing test suite and CI pipeline to prevent regressions, while simultaneously fixing visual issues such as focus styles, motion preferences, and color contrast. Finally, establish a clear record of architectural decisions by creating dated documents that outline context and consequences, and resolve any missing ADR findings to ensure long-term maintainability.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.
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.
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree, with each file named `NNNN-title` in whatever markup those docs already use, is the most discoverable form).
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 — 21
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 — 897
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 — 12
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 50
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. 43 of 48 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.8 — 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 — 48 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, 891 of 930 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.
D6 Cohesion (LCOM4) — 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's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.rs) and this repository declares a Cargo test suite (repository root, 495 test files), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D12 Dependency Hygiene — 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. Dependency Hygiene couldn't be assessed within its 5-minute budget on a solution this large — not included in this run.
D16 Bus Factor — 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. Single-maintainer repository — bus factor is not applicable (220 contributor(s) across 16735 commit(s) sampled, automation and bot accounts excluded). One of them holds 82% of the history; the other 219 hold 0.1% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
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 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.
AX2 Stateful singletons — 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.
AX6 Interface segregation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
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.
C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
DM3 Integration-event coupling — 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. Not scored — a domain type leaking across a crate boundary cannot be told apart from source alone from a legitimate shared-kernel crate. Reported as guidance rather than measured.
DM7 Repository granularity — 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. Not scored — detecting 'a repository per CHILD entity' needs the aggregate-root structure, which is not resolvable from source alone here. Reported as guidance rather than measured.
ED5 Idempotency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check finds retry-prone mutations by walking the repository's declared types, and NONE was loaded on this run, so it had nothing to look at. That is a limit of the analyzer's reach — it reads .NET projects — not a finding that this repository has no command handlers or message consumers.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
P10 Library API & versioning — 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 NuGet packaging and C# public API only, and no .NET project was loaded for this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
PF1 Benchmark discipline — 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.
PF2 Allocation hygiene — 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.
S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X1 Async correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X10 Duplicated predicate — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X12 Unreachable branch — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X13 Undrained process stream — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X14 Bypassable address classification — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X15 Unvalidated length from an untrusted reader — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X17 Uncapped recursion over a caller-supplied document — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X19 Unrestored process-global state — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X2 Cancellation propagation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X20 Mistyped argument guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X21 Side-effecting pattern guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X22 Contradicted release guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X23 Unguarded diagnostic materialisation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
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.
X27 Collection changed while being enumerated — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check 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.
X28 Index access outside its own emptiness guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check 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.
X6 Hand-rolled structured-format parsing — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X7 Silent fallback defaults — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 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.
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.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
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.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
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.
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.
AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
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.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
DM4 Rich vs anemic domain model: Behaviour is detected as state mutation inside a method body — a method that enforces an invariant by validating-and-throwing without mutating reads as a query, and mutation delegated through an interface the scan can't resolve isn't credited; entities with zero public properties still drop out of the population. It detects that state changes, not whether the rule is correct.
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, D26, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
120 function(s) exceeded the cyclomatic complexity threshold of 15; the worst was gix_tix::event_loop at 372. A further 6 function(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being gix_tix::action_with_shortcut_groups at 79 — they are counted neither in the figure above nor in this dimension's score.
+ 54 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 28 gix_tix finding(s) in Cyclomatic Complexity — start with rebase.rs (6), lib.rs (4), todo.rs (4). — One of this dimension's main actionable groups (28 warning-level).
Resolve the 12 gitoxide_core finding(s) in Cyclomatic Complexity — start with organize.rs (2), clean.rs, update.rs. — One of this dimension's main actionable groups (12 warning-level).
Resolve the 3 gix_validate finding(s) in Cyclomatic Complexity — start with path.rs (2), REDACTED. — One of this dimension's main actionable groups (3 warning-level).
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 88 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 46 gix_tix finding(s) in Cognitive Complexity — start with lib.rs (7), ui.rs (7), rebase.rs (7). — One of this dimension's main actionable groups (46 warning-level).
Resolve the 19 gitoxide_core finding(s) in Cognitive Complexity — start with organize.rs (2), update.rs, clean.rs. — One of this dimension's main actionable groups (19 warning-level).
Resolve the 9 Store finding(s) in Cognitive Complexity — start with find.rs (3), load_index.rs (2), metrics.rs. — One of this dimension's main actionable groups (9 warning-level).
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.7 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 36 FunctionTooLong finding(s) in God Classes — start with rebase.rs (5), mod.rs (4), lib.rs (3). — One of this dimension's main actionable groups (36 warning-level).
Resolve the 24 MethodTooLong finding(s) in God Classes — start with mod.rs (2), pipeline.rs (2), remote.rs (2). — One of this dimension's main actionable groups (24 warning-level).
Resolve the 16 FileTooLong finding(s) in God Classes — start with lib.rs, app.rs, rebase.rs. — One of this dimension's main actionable groups (16 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.
136 duplicated block group(s) detected. 2 of the 136 are in trees this repository does not ship — vendored, example/demo, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
+ 36 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 18 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with async_io.rs (3), enrich.rs (2), rebase.rs (2). — One of this dimension's main actionable groups (18 warning-level).
Resolve the 18 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with mod.rs (3), app.rs (2), write.rs (2). — One of this dimension's main actionable groups (18 warning-level).
Resolve the 12 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with rebase.rs (3), db.rs, find.rs. — 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 · Coupling7.2 / 10Strong✓ 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.
70 production modules (Cargo), 0 dependency cycle(s), 11 unstable depended-on module(s). Read from the build's own module declarations; 11 module(s) off the main sequence, with abstractness counted on 61 of the 70 (the rest declare no modelled class or interface, export only macros, or are not Gradle/Maven modules or Cargo crates).
Off the main sequence: gix-trace · ×11
Unstable project gitoxide-core
Unstable project gix
Unstable project gix-blame
Unstable project gix-dir
+ 7 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 11 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (11 warning-level).
Resolve the 1 Unstable project gitoxide-core finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Unstable project gix finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution9.6 / 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.
4268 test methods: 930 unit, 3338 integration, 0 BDD, 0 e2e. The Rust suite contributes 4268 `#[test]` function(s) across 495 file(s) declaring at least one; its unit/integration split is Cargo's own — 386 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test.
Inverted test pyramid
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md · top locations in Appendix A, every location in findings.md.
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: 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: gix-tix/src/lib.rs (194×372=72168); gix-tix/src/app.rs (147×165=24255); gix-tix/src/ui.rs (167×135=22545) Repeated repair below the complexity floor: gix-fs/src/lib.rs (3 of 4 changes were fixes); gix-command/src/lib.rs (3 of 3 changes were fixes)
Resolve the 72 Hotspot finding(s) in Churn × Complexity Hotspots — start with mod.rs (6), function.rs (6), remote.rs (3). — One of this dimension's main actionable groups (72 warning-level).
Resolve the 2 Repeated repair finding(s) in Churn × Complexity Hotspots — start with lib.rs (2). — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d15_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.
184 deducted task-comment markers across 213437 LoC (0.1/KLoC) → score 9.8. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
Resolve the 180 TodoComment finding(s) in Explicit Debt — start with mod.rs (21), function.rs (8), find.rs (6). — One of this dimension's main actionable groups (180 warning-level).
Resolve the 3 HackComment finding(s) in Explicit Debt — start with mod.rs (2), commit.rs. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 1 FixmeComment finding(s) in Explicit Debt — start with entry.rs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
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 gives a strong overview of gitoxide as an Rust implementation for future-proof applications with a pleasant developer experience and two primary usage paths (as Rust library via gix or as command-line tool gix plus ein). It also describes the development status, feature discovery, and a detailed list of crates, production-grade features, stabilization candidates, initial development, stress testing, stability and MSRV, installation, download binaries, homebrew, Arch Linux, Exherbo, from-source via Cargo, SSL-SSL-trial, lean install, build-failure handling, and the dual-license license for gix-config. The README of each subdirectory (gix-config, gix-imara-diff, etc.) documents its own directory rather than the repository root, so no single-document overview or installation/usage guidance is shared across them. The README for the gix-pack/fuzz directory is clear and complete for its target audience: a focused fuzz-testing guide that describes prerequisites, three test targets with their purposes, shell commands to run each individually and all at once, and reproducible-artifact guidance. It does not document the repository's root overview, installation, or contribution process, so those fall outside this README.
What to do
Improve Documentation Quality — currently 7.9/10. — The repository's root README gives a strong overview of gitoxide as an Rust implementation for future-proof applications with a pleasant developer experience and two primary usage paths (as Rust library via gix or as command-line tool gix plus ein). It also describes the development status, feature discovery, and a detailed list of crates, production-grade features, stabilization candidates, initial development, stress testing, stability and MSRV, installation, download binaries, homebrew, Arch Linux, Exherbo, from-source via Cargo, SSL-SSL-trial, lean install, build-failure handling, and the dual-license license for gix-config. The README of each subdirectory (gix-config, gix-imara-diff, etc.) documents its own directory rather than the repository root, so no single-document overview or installation/usage guidance is shared across them. The README for the gix-pack/fuzz directory is clear and complete for its target audience: a focused fuzz-testing guide that describes prerequisites, three test targets with their purposes, shell commands to run each individually and all at once, and reproducible-artifact guidance. It does not document the repository's root overview, installation, or contribution process, so those fall outside this README.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
0 naming inconsistencies across 0 sampled symbols.
✓ On the Gold path — maintain.
Detailed fixes: d21_recommendation.md.
Do you agree with this assessment?
D22 · Internal API ConsistencyAdequate◐ 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.
4 API inconsistencies across a 400-member sample of 1247 exposed types.
Duplicate output configuration properties with different types. `output_format` uses the generic `OutputFormat` enum, while `format` uses a domain-specific `Format` enum. This forces users to choose between a generic and a specific formatter for the same operation, creating confusion about which one takes precedence or if they are redundant.
Duplicate output configuration properties with different types. Similar to the status module, `revision.list` exposes both `format` (generic `OutputFormat`) and `text` (specific `Format`). This inconsistency across modules suggests a lack of unified design for how output formatting is handled in context objects versus options structs.
Misleading property naming. `index_worktree_renames` is typed as `ProgressItem`, which typically denotes a progress bar or counter, not a boolean flag or configuration option. This suggests a copy-paste error or misuse of the `ProgressItem` type for a control flag, confusing the API consumer about the property's intent.
Inconsistent use of `ProgressItem` for configuration vs. state. In `clone.Options`, `revision` is a `ProgressItem`, which is semantically incorrect as a revision is a string/identifier, not a progress metric. In `fetch.Options`, `open_negotiation_graph` is also a `ProgressItem`, which is similarly confusing. These should likely be `String` or a specific `Revision` type, not progress tracking types.
What to do
Resolve the 1 Duplicate output configuration properties with different types.… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Duplicate output configuration properties with different types. Similar… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Misleading property naming. `index_worktree_renames` is typed as… 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.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
8 finding(s): 0 critical, 7 high, 1 medium, 0 low. 2 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. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
What to do
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3). — One of this dimension's main actionable groups (3 issue-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 2 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 (2 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, 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 2 Medium advisory (unmaintained) finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 Medium advisory (unsound) finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 1 High IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 3 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 2 Low IaC finding(s) in IaC & Container Security — start with REDACTED (2). — One of this dimension's main actionable groups (2 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.
2 of 722 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is gix-utils/src/btoi.rs. Counted over 722 of the 995 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
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.
Resolve the 12 Boundary-crossing change coupling finding(s) in Change Coupling — start with decode.rs (8), ref_iter.rs (2), body.rs (2). — One of this dimension's main actionable groups (12 issue-level).
Resolve the 2 Change coupling finding(s) in Change Coupling — start with ref_iter.rs, cascade.rs. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 Change-coupling hub finding(s) in Change Coupling — start with body.rs. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
✓ On the Gold path — maintain.
Detailed fixes: d44_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC1 · Text alternatives10.0 / 10Exemplary○ Nothing flagged
Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.
Do you agree with this assessment?
AC2 · Forms & labels10.0 / 10Exemplary○ Nothing flagged
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.
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.
A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>. — etc/speak/gitmerge-2024.marp.html:1
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. — etc/speak/gitmerge-2024.marp.html:1
Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one. (×6) — etc/speak/gitmerge-2024.marp.html:39, etc/speak/gitmerge-2024.marp.html:44, etc/speak/gitmerge-2024.marp.html:49, …
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.
`div#\:\$p>svg>foreignObject>section` sets color: #333 on background-color: #0288d1 — 3.3:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet — editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from). — etc/speak/gitmerge-2024.marp.html:1
What to do
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Do you agree with this assessment?
AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified
Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.
Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.
Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.
No accessibility enforcement found — no 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. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
Do you agree with this assessment?
DM4 · Rich vs anemic domain model10.0 / 10Exemplary✓ Tool-verified
Other · Domain Modelling — Whether domain entities own their behaviour (invariant-enforcing commands) rather than being data-only structs driven by a foreign service.
Method: Roslyn (DDD-gated): entity method BODIES classified mutator-vs-query — only methods that mutate the entity's own declared state count as invariant-protecting behaviour, so a getter/passthrough doesn't rescue an anemic class. Deterministic, exhaustive over domain-layer entities.
Coverage: Population: entities by name/base convention; rich-vs-anemic judged by classifying each method body mutator-vs-query — logic-bearing domain types outside the convention are invisible.
Other · Domain Modelling — Whether a domain type's identity-bearing field stays immutable — a `pub` mutable field under a hand-rolled Hash/PartialEq breaks the value-identity invariant.
Method: Roslyn (DDD-gated): entities scanned for publicly writable state — public setters, and (C#/VB) own mutable collections handed out through an auto-property, a public field or a bare-field expression getter, where a computed/copying getter is never charged. One finding per entity; score softened when Marten/EF rehydration frameworks present. Deterministic, framework-aware.
Coverage: Population: entities by convention; encapsulation (setter shape) checked exhaustively within the set.
Other · Event Sourcing — Whether the recovery-replay fold is deterministic — state derived purely from each event's own fields, no clock/random/IO on the replay path.
Method: Roslyn syntax scan (event-sourcing gated): Apply/When folds checked for forbidden tokens (DateTime.Now, Guid.NewGuid, Random, IO), stripped of comments/strings. Deterministic, hard fact per fold.
Other · Event Sourcing — Whether domain events stay immutable (private fields, set once) rather than carrying mutable state.
Method: Roslyn scan (event-sourcing gated): persisted events checked for public setters; immutability verified per property/field. Deterministic, hard fact.
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
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 77 of 91 project(s) that lack one — worth up to 1.7 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 significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree, with each file named `NNNN-title` in whatever markup those docs already use, is the most discoverable form).
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
Only 26/27 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `gix-tui`.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
What to do
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin) or inside a Java method returning a Reactor Mono/Flux — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 13 of 55 WCAG 2.2 Level A/AA success criteria (24%; ≈26% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 42 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.
Not evidenced — 4 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 75 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.
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 — 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
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — the image ran but published no HTTP port — nothing to crawl (EXPOSE the web port to unlock runtime evidence) 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.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D10 Test Quality — ~126121 lines of test source are present (.rs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not included — the .rs suite was found but not re-run
D12 Dependency Hygiene — Dependency Hygiene not included (time budget)
D14 License Compliance — Not scored — this repository's 493 shipped crate(s) were read from its REDACTED, but crates.io could not be asked for the licence of 42 of them (HTTP 429 Unknown Error), and a licence verdict over part of a dependency graph is not a licence verdict. Nothing is asserted about this repository's licensing in either direction.
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout nor 2+ sibling source directories each declaring an aggregate root. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D27 Navigability — symbol resolution incomplete — too few calls resolved to assess navigability
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 — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D6 Cohesion (LCOM4) — D6 reads a CS/VB/GO/SCALA/SWIFT/DART/JAVA/PY/KT/TS/TSX/MTS/CTS/JS/JSX/MJS/CJS/PHP class graph only — this repository's production source is .rs, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
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 Aggregate boundaries — this Rust crate declares no domain aggregate (a struct with private state and its own command methods), so DM1's aggregate-boundary read has no population to be taken over
DM2 Strongly-typed ids — the crate defines newtype typed-ids but declares no domain aggregate that could carry an id — so DM2's adoption ratio has no population to be taken over
DM3 Integration-event coupling — not scored — a domain type leaking across a crate boundary cannot be told apart from source alone from a legitimate shared-kernel crate. Reported as guidance rather than measured
DM6 Domain ↔ infrastructure boundary — this Rust crate maps no type to a persistence framework (diesel/sea-orm/sqlx), so DM6's domain↔infrastructure fusion read has no population to be taken over
DM7 Repository granularity — not scored — detecting 'a repository per CHILD entity' needs the aggregate-root structure, which is not resolvable from source alone here. Reported as guidance rather than measured
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — This check finds retry-prone mutations (command handlers and message/event consumers) by walking the repository's declared types, and none was loaded here, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
GD1 Unfinished & placeholder code — no source files were read — this check reads C# syntax, and none was loaded for this repository. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P10 Library API & versioning — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Rust source, so there is no service whose uptime a failing dependency could take down
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) 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 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
PF2 Allocation hygiene — 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
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
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
X10 Duplicated predicate — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X12 Unreachable branch — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X13 Undrained process stream — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X14 Bypassable address classification — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X15 Unvalidated length from an untrusted reader — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X16 Unfloored truncation loop — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X17 Uncapped recursion over a caller-supplied document — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X18 Disposal-pattern correctness — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X19 Unrestored process-global state — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X20 Mistyped argument guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X21 Side-effecting pattern guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X22 Contradicted release guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X23 Unguarded diagnostic materialisation — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
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.
X27 Collection changed while being enumerated — 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.
X28 Index access outside its own emptiness 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.
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
X6 Hand-rolled structured-format parsing — 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
X7 Silent fallback defaults — 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.
Boundary-crossing change coupling: ref_iter.rs ↔ parse.rs gix-object/src/tree/ref_iter.rs— `gix-object/src/tree/ref_iter.rs` (context gix-object) and `gix-ref/src/parse.rs` (context gix-ref) sit in DIFFERENT parts of the tree yet change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `3cd3e2a7` Resolve Winnow deprecations; `12f03db6` Simplify parsers; `f0cbf81a` Resolve 0.4 not-quite deprecations — run `git show` on any of them.
Boundary-crossing change coupling: decode.rs ↔ parse.rs gix-actor/src/signature/decode.rs— `gix-actor/src/signature/decode.rs` (context gix-actor) and `gix-ref/src/parse.rs` (context gix-ref) sit in DIFFERENT parts of the tree yet change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `3cd3e2a7` Resolve Winnow deprecations; `12f03db6` Simplify parsers; `f0cbf81a` Resolve 0.4 not-quite deprecations — run `git show` on any of them.
Boundary-crossing change coupling: decode.rs ↔ decode.rs gix-actor/src/signature/decode.rs— `gix-actor/src/signature/decode.rs` (context gix-actor) and `gix-object/src/commit/message/decode.rs` (context gix-object) sit in DIFFERENT parts of the tree yet change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `3cd3e2a7` Resolve Winnow deprecations; `e175b20d` Update winnow to 0.6; `12f03db6` Simplify parsers — run `git show` on any of them.
Boundary-crossing change coupling: decode.rs ↔ mod.rs gix-actor/src/signature/decode.rs— `gix-actor/src/signature/decode.rs` (context gix-actor) and `gix-ref/src/store/packed/decode/mod.rs` (context gix-ref) sit in DIFFERENT parts of the tree yet change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `3cd3e2a7` Resolve Winnow deprecations (at that commit the file was still `gix-ref/src/store/packed/decode.rs`); `12f03db6` Simplify parsers (at that commit the file was still `gix-ref/src/store/packed/decode.rs`); `f0cbf81a` Resolve 0.4 not-quite deprecations (at that commit the file was still `gix-ref/src/store/packed/decode.rs`) — run `git show` on any of them.
Boundary-crossing change coupling: body.rs ↔ parse.rs gix-object/src/commit/message/body.rs— `gix-object/src/commit/message/body.rs` (context gix-object) and `gix-ref/src/parse.rs` (context gix-ref) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `3cd3e2a7` Resolve Winnow deprecations; `12f03db6` Simplify parsers; `f0cbf81a` Resolve 0.4 not-quite deprecations — run `git show` on any of them.
Boundary-crossing change coupling: decode.rs ↔ mod.rs gix-object/src/commit/message/decode.rs— `gix-object/src/commit/message/decode.rs` (context gix-object) and `gix-ref/src/store/packed/decode/mod.rs` (context gix-ref) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `3cd3e2a7` Resolve Winnow deprecations (at that commit the file was still `gix-ref/src/store/packed/decode.rs`); `12f03db6` Simplify parsers (at that commit the file was still `gix-ref/src/store/packed/decode.rs`); `f0cbf81a` Resolve 0.4 not-quite deprecations (at that commit the file was still `gix-ref/src/store/packed/decode.rs`) — run `git show` on any of them.
Boundary-crossing change coupling: decode.rs ↔ decode.rs gix-object/src/commit/message/decode.rs— `gix-object/src/commit/message/decode.rs` (context gix-object) and `gix-ref/src/store/file/loose/reference/decode.rs` (context gix-ref) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `3cd3e2a7` Resolve Winnow deprecations; `12f03db6` Simplify parsers; `f0cbf81a` Resolve 0.4 not-quite deprecations — run `git show` on any of them.
Boundary-crossing change coupling: decode.rs ↔ parse.rs gix-object/src/commit/message/decode.rs— `gix-object/src/commit/message/decode.rs` (context gix-object) and `gix-ref/src/parse.rs` (context gix-ref) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `3cd3e2a7` Resolve Winnow deprecations; `12f03db6` Simplify parsers; `f0cbf81a` Resolve 0.4 not-quite deprecations — run `git show` on any of them.
Boundary-crossing change coupling: decode.rs ↔ body.rs gix-actor/src/signature/decode.rs— `gix-actor/src/signature/decode.rs` (context gix-actor) and `gix-object/src/commit/message/body.rs` (context gix-object) sit in DIFFERENT parts of the tree yet change together 60% of the time (9 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `3cd3e2a7` Resolve Winnow deprecations; `52ede063` Move off deprecated take_until[01]; `12f03db6` Simplify parsers — run `git show` on any of them.
Boundary-crossing change coupling: decode.rs ↔ decode.rs gix-actor/src/signature/decode.rs— `gix-actor/src/signature/decode.rs` (context gix-actor) and `gix-ref/src/store/file/loose/reference/decode.rs` (context gix-ref) sit in DIFFERENT parts of the tree yet change together 60% of the time (9 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `3cd3e2a7` Resolve Winnow deprecations; `12f03db6` Simplify parsers; `f0cbf81a` Resolve 0.4 not-quite deprecations — run `git show` on any of them.
Boundary-crossing change coupling: ref_iter.rs ↔ parse.rs gix-object/src/tag/ref_iter.rs— `gix-object/src/tag/ref_iter.rs` (context gix-object) and `gix-ref/src/parse.rs` (context gix-ref) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `3cd3e2a7` Resolve Winnow deprecations; `f0cbf81a` Resolve 0.4 not-quite deprecations; `9ed7df0a` Resolve 0.4 deprecations — run `git show` on any of them.
Boundary-crossing change coupling: body.rs ↔ mod.rs gix-object/src/commit/message/body.rs— `gix-object/src/commit/message/body.rs` (context gix-object) and `gix-ref/src/store/packed/decode/mod.rs` (context gix-ref) sit in DIFFERENT parts of the tree yet change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `3cd3e2a7` Resolve Winnow deprecations (at that commit the file was still `gix-ref/src/store/packed/decode.rs`); `12f03db6` Simplify parsers (at that commit the file was still `gix-ref/src/store/packed/decode.rs`); `f0cbf81a` Resolve 0.4 not-quite deprecations (at that commit the file was still `gix-ref/src/store/packed/decode.rs`) — run `git show` on any of them.
AC3 · Page structure· Document without a <title> · ×1
Document without a <title> etc/speak/gitmerge-2024.marp.html:1— A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
TodoComment examples/log.rs:102— // TODO: should make use of the `git2::DiffOptions` — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gitoxide-core/src/corpus/trace.rs:62— // TODO: wait for new release of `tracing-forest` and load the ID from span fields. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gitoxide-core/src/corpus/engine.rs:128— // TODO: wait for new release of `tracing-forest` to be able to provide run_id via span attributes — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gitoxide-core/src/repository/verify.rs:39— // TODO: a way to get the pack cache from a handle — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gitoxide-core/src/repository/submodule.rs:50— // TODO(name-revision): this is the simple version, `git` gives it — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gitoxide-core/src/repository/status.rs:182— // TODO: handle multi-status characters, there can also be modifications at the same time as determined by their ID and potentially diffstats. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gitoxide-core/src/repository/blame.rs:27— // TODO(blame): Git uses something akin to `ToGitUnlessBinaryToTextIsPresent` here, but with a specialty: textconv output is converted — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gitoxide-core/src/repository/attributes/validate_baseline.rs:304— // TODO: find a way to not have to do more work, but make the warning go away. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gitoxide-core/src/repository/attributes/query.rs:75— // TODO(borrowchk): this shouldn't be necessary at all, but `pathspec` stays borrowed mutably for some reason. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gix-attributes/src/state.rs:8— // TODO: This should be some sort of 'smallbstring' - but can't use `kstring` here due to UTF8 requirement. 5% performance boost possible. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gix-attributes/src/search/outcome.rs:203— // TODO(borrowchk): one fine day we should be able to re-borrow `slot` without having to redo the array access. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gix-attributes/src/search/attributes.rs:60— // TODO: should `Pattern` trait use an instance as first argument to carry this information — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gix-blame/src/types.rs:215— // TODO(blame): add a type so rename tracking can avoid comparing blobs with symlinks. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gix-blame/src/file/function.rs:609— // TODO(perf): renames are usually rare enough to not care about the work duplication done here. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gix-blame/src/file/function.rs:788— // TODO(blame): add a test to show of symlink blaming works. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gix-commitgraph/src/verify.rs:57— // TODO: Detect duplicate commit IDs across different files. Not sure how to do this without — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gix-commitgraph/src/file/verify.rs:55— // TODO: Verify self.fan values as we go. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gix-commitgraph/src/file/commit.rs:40— // TODO: Add support for corrected commit date offset overflow. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gix-config-value/src/path.rs:49— // TODO: use the `*_r` version, but it's much harder to use. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gix-config/src/file/mutable/section.rs:238— // TODO(error): make it fallible — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gix-date/src/parse/git.rs:11— // TODO: this can probably be done more smartly, right now it's more of a brute force. Learn from Git here. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gix-diff/src/blob/platform.rs:103— // TODO: use `bstr::Lines` here, but it's not `Copy` — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gix-diff/src/blob/platform.rs:406— // TODO: make this `dyn` once https://github.com/rust-lang/rust/issues/65991 is stable, then also make tracker.rs `objects` dyn
TodoComment gix-diff/src/blob/platform.rs:431— // TODO: fix this - the diff shouldn't fail if binary (or large) files are used, just copy them into tempfiles. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment gix-diff/src/blob/pipeline.rs:524— // TODO: Add support for an actual Context, validate it *can* match Git — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
Hotspot: gix-tix/src/lib.rs gix-tix/src/lib.rs:1014— gix-tix/src/lib.rs changed 194 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 372 in gix_tix::event_loop at line 1014. 52 of those changes were fix/bug commits, and the other 142 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-tix/src/lib.rs`: 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: gix-tix/src/app.rs gix-tix/src/app.rs:1575— gix-tix/src/app.rs changed 147 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 165 in App::update at line 1575. 35 of those changes were fix/bug commits, and the other 112 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-tix/src/app.rs`: 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: gix-tix/src/ui.rs gix-tix/src/ui.rs:391— gix-tix/src/ui.rs changed 167 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 135 in gix_tix::ui::draw_with_worktree at line 391. 33 of those changes were fix/bug commits, and the other 134 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-tix/src/ui.rs`: 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: gix-tix/src/edit/rebase.rs gix-tix/src/edit/rebase.rs:1621— gix-tix/src/edit/rebase.rs changed 60 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in gix_tix::edit::rebase::perform_plan_with_progress at line 1621. 20 of those changes were fix/bug commits, and the other 40 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-tix/src/edit/rebase.rs`: 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: gix-tix/src/history.rs gix-tix/src/history.rs:1926— gix-tix/src/history.rs changed 75 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in gix_tix::history::decorations_excluding at line 1926. 17 of those changes were fix/bug commits, and the other 58 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-tix/src/history.rs`: 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: gix-merge/src/tree/function/resolve.rs gix-merge/src/tree/function/resolve.rs:97— gix-merge/src/tree/function/resolve.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 192 in gix_merge::tree::function::resolve::tree at line 97. 1 of those changes was a fix/bug commit, and the other 12 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-merge/src/tree/function/resolve.rs`: 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: src/plumbing/main.rs src/plumbing/main.rs:57— src/plumbing/main.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 122 in gitoxide::plumbing::main::main at line 57. 2 of those changes were fix/bug commits, and the other 17 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- src/plumbing/main.rs`: 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: gix-tix/src/edit/todo.rs gix-tix/src/edit/todo.rs:832— gix-tix/src/edit/todo.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in gix_tix::edit::todo::parse at line 832. 13 of those changes were fix/bug commits, and the other 19 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-tix/src/edit/todo.rs`: 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: gix-tix/src/edit/time_travel.rs gix-tix/src/edit/time_travel.rs:314— gix-tix/src/edit/time_travel.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in gix_tix::edit::time_travel::move_head_to_reporting at line 314. 16 of those changes were fix/bug commits, and the other 32 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-tix/src/edit/time_travel.rs`: 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: gix/src/open/repository.rs gix/src/open/repository.rs:166— gix/src/open/repository.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in ThreadSafeRepository::open_from_paths at line 166. 6 of those changes were fix/bug commits, and the other 21 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix/src/open/repository.rs`: 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: gix-tix/src/command.rs gix-tix/src/command.rs:306— gix-tix/src/command.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in gix_tix::command::write_history at line 306. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-tix/src/command.rs`: 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: gix-tix/src/ref_tree.rs gix-tix/src/ref_tree.rs:271— gix-tix/src/ref_tree.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Tree::handle_key at line 271. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-tix/src/ref_tree.rs`: 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: gix-tix/src/edit/create.rs gix-tix/src/edit/create.rs:49— gix-tix/src/edit/create.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in gix_tix::edit::create::prepare_inner at line 49. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-tix/src/edit/create.rs`: 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: gix-tix/src/edit/head.rs gix-tix/src/edit/head.rs:56— gix-tix/src/edit/head.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in gix_tix::edit::head::perform_inner at line 56. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-tix/src/edit/head.rs`: 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: gix/src/clone/fetch/mod.rs gix/src/clone/fetch/mod.rs:28— gix/src/clone/fetch/mod.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in PrepareFetch::fetch_only at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix/src/clone/fetch/mod.rs`: 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: gix-transport/src/client/blocking_io/http/curl/remote.rs gix-transport/src/client/blocking_io/http/curl/remote.rs:408— gix-transport/src/client/blocking_io/http/curl/remote.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in gix_transport::client::blocking_io::http::curl::remote::new at line 408. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-transport/src/client/blocking_io/http/curl/remote.rs`: 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: gix-blame/src/file/function.rs gix-blame/src/file/function.rs:68— gix-blame/src/file/function.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in gix_blame::file::function::file at line 68. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-blame/src/file/function.rs`: 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: gix-url/src/parse.rs gix-url/src/parse.rs:117— gix-url/src/parse.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in gix_url::parse::url at line 117. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-url/src/parse.rs`: 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: gix-url/src/simple_url.rs gix-url/src/simple_url.rs:202— gix-url/src/simple_url.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ParsedUrl::parse_host_port at line 202. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-url/src/simple_url.rs`: 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: gix/src/remote/connection/fetch/update_refs/mod.rs gix/src/remote/connection/fetch/update_refs/mod.rs:63— gix/src/remote/connection/fetch/update_refs/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in gix::remote::connection::fetch::update_refs::update at line 63. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix/src/remote/connection/fetch/update_refs/mod.rs`: 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: gix-status/src/index_as_worktree/function.rs gix-status/src/index_as_worktree/function.rs:371— gix-status/src/index_as_worktree/function.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in State::compute_status at line 371. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-status/src/index_as_worktree/function.rs`: 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: gix-diff/src/blob/pipeline.rs gix-diff/src/blob/pipeline.rs:190— gix-diff/src/blob/pipeline.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in Pipeline::convert_to_diffable at line 190. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-diff/src/blob/pipeline.rs`: 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: gix-odb/src/store_impls/dynamic/find.rs gix-odb/src/store_impls/dynamic/find.rs:51— gix-odb/src/store_impls/dynamic/find.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Handle::try_find_cached_inner at line 51. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-odb/src/store_impls/dynamic/find.rs`: 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: gix-odb/src/store_impls/dynamic/load_index.rs gix-odb/src/store_impls/dynamic/load_index.rs:168— gix-odb/src/store_impls/dynamic/load_index.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Store::consolidate_with_disk_state at line 168. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-odb/src/store_impls/dynamic/load_index.rs`: 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: gix-pack/src/cache/delta/traverse/resolve.rs gix-pack/src/cache/delta/traverse/resolve.rs:269— gix-pack/src/cache/delta/traverse/resolve.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in gix_pack::cache::delta::traverse::resolve::resolve_parallel at line 269. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-pack/src/cache/delta/traverse/resolve.rs`: 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.
gix_tix::event_loop (cognitive 915) gix-tix/src/lib.rs:1014— gix_tix::event_loop has cognitive complexity 915 (threshold 15). Drivers by points: if/else 199 (576 pts), match/switch 74 (274 pts), boolean chains 49, loops 6 (16 pts) (nesting depth added 587). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix_tix::ui::draw_with_worktree (cognitive 215) gix-tix/src/ui.rs:391— gix_tix::ui::draw_with_worktree has cognitive complexity 215 (threshold 15). Drivers by points: if/else 87 (140 pts), boolean chains 39, loops 9 (21 pts), match/switch 10 (15 pts) (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix_tix::edit::rebase::perform_plan_with_progress (cognitive 139) gix-tix/src/edit/rebase.rs:1621— gix_tix::edit::rebase::perform_plan_with_progress has cognitive complexity 139 (threshold 15). Drivers by points: if/else 36 (75 pts), loops 16 (26 pts), match/switch 13 (24 pts), boolean chains 14 (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.
gix_tix::edit::todo::parse (cognitive 122) gix-tix/src/edit/todo.rs:832— gix_tix::edit::todo::parse has cognitive complexity 122 (threshold 15). Drivers by points: if/else 43 (103 pts), boolean chains 9, loops 4 (7 pts), match/switch 2 (3 pts) (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.
gix_tix::edit::rebase::perform_inner (cognitive 102) gix-tix/src/edit/rebase.rs:1018— gix_tix::edit::rebase::perform_inner has cognitive complexity 102 (threshold 15). Drivers by points: if/else 42 (66 pts), boolean chains 26, match/switch 6 (9 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix_tix::ui::metadata_columns (cognitive 95) gix-tix/src/ui.rs:2314— gix_tix::ui::metadata_columns has cognitive complexity 95 (threshold 15). Drivers by points: if/else 40 (73 pts), loops 5 (15 pts), boolean chains 4, match/switch 3 (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.
gix_tix::draw (cognitive 75) gix-tix/src/lib.rs:4654— gix_tix::draw has cognitive complexity 75 (threshold 15). Drivers by points: if/else 26 (41 pts), boolean chains 14, match/switch 4 (11 pts), loops 3 (9 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.
gix_tix::command_menu::commands (cognitive 71) gix-tix/src/command_menu.rs:105— gix_tix::command_menu::commands has cognitive complexity 71 (threshold 15). Drivers by points: if/else 32 (45 pts), boolean chains 21, match/switch 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.
gix_tix::history::load (cognitive 70) gix-tix/src/history.rs:1018— gix_tix::history::load has cognitive complexity 70 (threshold 15). Drivers by points: if/else 25 (51 pts), loops 6 (11 pts), boolean chains 8 (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.
gix_tix::history::decorations_excluding (cognitive 68) gix-tix/src/history.rs:1926— gix_tix::history::decorations_excluding has cognitive complexity 68 (threshold 15). Drivers by points: if/else 23 (43 pts), boolean chains 11, match/switch 4 (11 pts), loops 3 (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.
gix_tix::edit::rebase::finish_review_with_progress (cognitive 48) gix-tix/src/edit/rebase.rs:1373— gix_tix::edit::rebase::finish_review_with_progress has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (37 pts), boolean chains 5, loops 3, match/switch 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.
gix_tix::edit::rebase::stack_insert_plan (cognitive 40) gix-tix/src/edit/rebase.rs:646— gix_tix::edit::rebase::stack_insert_plan has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 7 (8 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix_tix::edit::rebase::update_refs (cognitive 40) gix-tix/src/edit/rebase.rs:2973— gix_tix::edit::rebase::update_refs has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 4 (6 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix_tix::edit::head::perform_inner (cognitive 40) gix-tix/src/edit/head.rs:56— gix_tix::edit::head::perform_inner has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 8, match/switch 5 (6 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.
gix_tix::edit::time_travel::perform_reporting_rebased (cognitive 36) gix-tix/src/edit/time_travel.rs:736— gix_tix::edit::time_travel::perform_reporting_rebased has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 8 (16 pts), if/else 11 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix_tix::edit::todo::prepare (cognitive 34) gix-tix/src/edit/todo.rs:80— gix_tix::edit::todo::prepare has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 7 (9 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix_tix::edit::todo::prepare_continuation (cognitive 33) gix-tix/src/edit/todo.rs:258— gix_tix::edit::todo::prepare_continuation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 4 (10 pts), 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.
gix_tix::edit::time_travel::move_head_to_reporting (cognitive 33) gix-tix/src/edit/time_travel.rs:314— gix_tix::edit::time_travel::move_head_to_reporting has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 10 (14 pts), boolean chains 5 (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.
gix_tix::edit::todo::parse_state (cognitive 31) gix-tix/src/edit/todo.rs:658— gix_tix::edit::todo::parse_state has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix_tix::run_with_rebase_selection (cognitive 29) gix-tix/src/lib.rs:5732— gix_tix::run_with_rebase_selection has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3 (8 pts), boolean chains 4, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix_tix::history::decode_metadata (cognitive 27) gix-tix/src/history.rs:1666— gix_tix::history::decode_metadata has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (7 pts), loops 2 (5 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.
gix_tix::command::write_history (cognitive 27) gix-tix/src/command.rs:306— gix_tix::command::write_history has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 5, match/switch 3 (5 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.
gix_tix::app_action (cognitive 27) gix-tix/src/lib.rs:7082— gix_tix::app_action has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (7 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix_tix::edit::rebase::worktree_transitions (cognitive 25) gix-tix/src/edit/rebase.rs:2898— gix_tix::edit::rebase::worktree_transitions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (4 pts), loops 2, 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.
gix_tix::ref_tree::place_rail (cognitive 25) gix-tix/src/ref_tree.rs:1126— gix_tix::ref_tree::place_rail has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (6 pts), loops 4, boolean chains 1 (nesting depth added 8). Of this number, 20 points are the body's own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FunctionTooLong: gix_tix::event_loop gix-tix/src/lib.rs:1014— FunctionTooLong — gix_tix::event_loop runs 2296 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 2196 over it, 22.96× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gitoxide::plumbing::main::main src/plumbing/main.rs:57— FunctionTooLong — gitoxide::plumbing::main::main runs 1475 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 1375 over it, 14.75× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_merge::tree::function::resolve::tree gix-merge/src/tree/function/resolve.rs:97— FunctionTooLong — gix_merge::tree::function::resolve::tree runs 1322 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 1222 over it, 13.22× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_tix::ui::draw_with_worktree gix-tix/src/ui.rs:391— FunctionTooLong — gix_tix::ui::draw_with_worktree runs 699 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 599 over it, 6.99× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_tix::edit::rebase::perform_plan_with_progress gix-tix/src/edit/rebase.rs:1621— FunctionTooLong — gix_tix::edit::rebase::perform_plan_with_progress runs 390 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 290 over it, 3.90× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_tix::command_menu::commands gix-tix/src/command_menu.rs:105— FunctionTooLong — gix_tix::command_menu::commands runs 374 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 274 over it, 3.74× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_tix::edit::rebase::perform_inner gix-tix/src/edit/rebase.rs:1018— FunctionTooLong — gix_tix::edit::rebase::perform_inner runs 304 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 204 over it, 3.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_tix::draw gix-tix/src/lib.rs:4654— FunctionTooLong — gix_tix::draw runs 265 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 165 over it, 2.65× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_blame::file::function::file gix-blame/src/file/function.rs:68— FunctionTooLong — gix_blame::file::function::file runs 260 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 160 over it, 2.60× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix::config::cache::init::apply_environment_overrides gix/src/config/cache/init.rs:409— FunctionTooLong — gix::config::cache::init::apply_environment_overrides runs 240 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 140 over it, 2.40× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix::remote::connection::fetch::update_refs::update gix/src/remote/connection/fetch/update_refs/mod.rs:63— FunctionTooLong — gix::remote::connection::fetch::update_refs::update runs 227 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 127 over it, 2.27× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_glob::wildmatch::function::match_recursive gix-glob/src/wildmatch.rs:55— FunctionTooLong — gix_glob::wildmatch::function::match_recursive runs 218 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 118 over it, 2.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_tix::history::load gix-tix/src/history.rs:1018— FunctionTooLong — gix_tix::history::load runs 209 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 109 over it, 2.09× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_tix::edit::rebase::finish_review_with_progress gix-tix/src/edit/rebase.rs:1373— FunctionTooLong — gix_tix::edit::rebase::finish_review_with_progress runs 205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 105 over it, 2.05× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_tix::ui::metadata_columns gix-tix/src/ui.rs:2314— FunctionTooLong — gix_tix::ui::metadata_columns runs 193 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 93 over it, 1.93× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_transport::client::blocking_io::http::curl::remote::new gix-transport/src/client/blocking_io/http/curl/remote.rs:408— FunctionTooLong — gix_transport::client::blocking_io::http::curl::remote::new runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_tix::edit::todo::parse gix-tix/src/edit/todo.rs:832— FunctionTooLong — gix_tix::edit::todo::parse runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_pack::index::write::function::write_data_iter_to_stream gix-pack/src/index/write/mod.rs:98— FunctionTooLong — gix_pack::index::write::function::write_data_iter_to_stream runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_tix::edit::todo::prepare gix-tix/src/edit/todo.rs:80— FunctionTooLong — gix_tix::edit::todo::prepare runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_pack::data::output::count::objects::expand::this gix-pack/src/data/output/count/objects/mod.rs:139— FunctionTooLong — gix_pack::data::output::count::objects::expand::this runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gitoxide::porcelain::main::main src/porcelain/main.rs:15— FunctionTooLong — gitoxide::porcelain::main::main runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_diff::index::function::diff gix-diff/src/index/function.rs:30— FunctionTooLong — gix_diff::index::function::diff runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_tix::command::write_history gix-tix/src/command.rs:306— FunctionTooLong — gix_tix::command::write_history runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_tix::edit::time_travel::perform_reporting_rebased gix-tix/src/edit/time_travel.rs:736— FunctionTooLong — gix_tix::edit::time_travel::perform_reporting_rebased runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: gix_tix::edit::time_travel::move_head_to_reporting gix-tix/src/edit/time_travel.rs:314— FunctionTooLong — gix_tix::edit::time_travel::move_head_to_reporting runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
gix_tix::event_loop (cyclomatic 372) gix-tix/src/lib.rs:1014— gix_tix::event_loop 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.
gix_tix::ui::draw_with_worktree (cyclomatic 135) gix-tix/src/ui.rs:391— gix_tix::ui::draw_with_worktree has cyclomatic complexity 135 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
gix_tix::edit::rebase::perform_plan_with_progress (cyclomatic 78) gix-tix/src/edit/rebase.rs:1621— gix_tix::edit::rebase::perform_plan_with_progress has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
gix_tix::edit::rebase::perform_inner (cyclomatic 68) gix-tix/src/edit/rebase.rs:1018— gix_tix::edit::rebase::perform_inner has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
gix_tix::command_menu::commands (cyclomatic 63) gix-tix/src/command_menu.rs:105— gix_tix::command_menu::commands 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.
gix_tix::edit::todo::parse (cyclomatic 57) gix-tix/src/edit/todo.rs:832— gix_tix::edit::todo::parse has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
gix_tix::ui::metadata_columns (cyclomatic 46) gix-tix/src/ui.rs:2314— gix_tix::ui::metadata_columns 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.
gix_tix::draw (cyclomatic 44) gix-tix/src/lib.rs:4654— gix_tix::draw 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. This is NOT this file's highest cyclomatic complexity: gix_tix::action_with_shortcut_groups (cyclomatic 79) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
gix_tix::history::decorations_excluding (cyclomatic 42) gix-tix/src/history.rs:1926— gix_tix::history::decorations_excluding 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.
gix_tix::history::load (cyclomatic 37) gix-tix/src/history.rs:1018— gix_tix::history::load has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
gix_tix::edit::time_travel::move_head_to_reporting (cyclomatic 30) gix-tix/src/edit/time_travel.rs:314— gix_tix::edit::time_travel::move_head_to_reporting has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
gix_tix::edit::head::perform_inner (cyclomatic 29) gix-tix/src/edit/head.rs:56— gix_tix::edit::head::perform_inner 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.
gix_tix::edit::rebase::stack_insert_plan (cyclomatic 28) gix-tix/src/edit/rebase.rs:646— gix_tix::edit::rebase::stack_insert_plan 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.
gix_tix::edit::rebase::finish_review_with_progress (cyclomatic 28) gix-tix/src/edit/rebase.rs:1373— gix_tix::edit::rebase::finish_review_with_progress 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.
gix_tix::app_action (cyclomatic 25) gix-tix/src/lib.rs:7082— gix_tix::app_action has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: gix_tix::action_with_shortcut_groups (cyclomatic 79) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
gix_tix::edit::todo::parse_state (cyclomatic 24) gix-tix/src/edit/todo.rs:658— gix_tix::edit::todo::parse_state 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.
gix_tix::edit::time_travel::perform_reporting_rebased (cyclomatic 24) gix-tix/src/edit/time_travel.rs:736— gix_tix::edit::time_travel::perform_reporting_rebased has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
gix_tix::edit::rebase::update_refs (cyclomatic 23) gix-tix/src/edit/rebase.rs:2973— gix_tix::edit::rebase::update_refs 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.
gix_tix::edit::todo::prepare (cyclomatic 22) gix-tix/src/edit/todo.rs:80— gix_tix::edit::todo::prepare 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.
gix_tix::command::write_history (cyclomatic 21) gix-tix/src/command.rs:306— gix_tix::command::write_history 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.
gix_tix::app::transition (cyclomatic 19) gix-tix/src/app.rs:3860— gix_tix::app::transition has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
gix_tix::run_with_rebase_selection (cyclomatic 19) gix-tix/src/lib.rs:5732— gix_tix::run_with_rebase_selection has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: gix_tix::action_with_shortcut_groups (cyclomatic 79) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
gix_tix::history::decode_metadata (cyclomatic 18) gix-tix/src/history.rs:1666— gix_tix::history::decode_metadata has cyclomatic complexity 18 (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.
gix_tix::ref_tree::place_rail (cyclomatic 18) gix-tix/src/ref_tree.rs:1126— gix_tix::ref_tree::place_rail has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
gix_tix::edit::rebase::worktree_transitions (cyclomatic 17) gix-tix/src/edit/rebase.rs:2898— gix_tix::edit::rebase::worktree_transitions 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.
MethodTooLong: App.update gix-tix/src/app.rs:1575— MethodTooLong — update runs 453 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 353 over it, 4.53× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Repository.transport_options gix/src/repository/config/transport.rs:25— MethodTooLong — transport_options runs 312 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 212 over it, 3.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ThreadSafeRepository.open_from_paths gix/src/open/repository.rs:166— MethodTooLong — open_from_paths runs 274 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 174 over it, 2.74× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PrepareFetch.fetch_only gix/src/clone/fetch/mod.rs:28— MethodTooLong — fetch_only runs 235 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 135 over it, 2.35× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Pipeline.convert_to_diffable gix-diff/src/blob/pipeline.rs:190— MethodTooLong — convert_to_diffable runs 222 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 122 over it, 2.22× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: HistoryGraph.refresh gix-tix/src/history.rs:633— MethodTooLong — refresh runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Store.consolidate_with_disk_state gix-odb/src/store_impls/dynamic/load_index.rs:168— MethodTooLong — consolidate_with_disk_state runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Repository.add_worktree gix/src/worktree/add.rs:88— MethodTooLong — add_worktree runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: File.resolve_deltas gix-pack/src/data/file/decode/entry.rs:231— MethodTooLong — resolve_deltas runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Handle.try_find_cached_inner gix-odb/src/store_impls/dynamic/find.rs:51— MethodTooLong — try_find_cached_inner runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Remote.default gix-transport/src/client/blocking_io/http/reqwest/remote.rs:38— MethodTooLong — default runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Platform.into_iter gix/src/status/iter/mod.rs:44— MethodTooLong — into_iter runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Overview.new gix-tix/src/ref_tree.rs:872— MethodTooLong — new runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PrepareDetached.receive gix/src/remote/connection/fetch/receive_pack.rs:90— MethodTooLong — receive runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Store.verify_integrity gix-odb/src/store_impls/dynamic/verify.rs:94— MethodTooLong — verify_integrity runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Repository.try_find_remote_inner gix/src/repository/remote.rs:182— MethodTooLong — try_find_remote_inner runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Pipeline.convert_to_mergeable gix-merge/src/blob/pipeline.rs:139— MethodTooLong — convert_to_mergeable runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Engine.perform_run gitoxide-core/src/corpus/engine.rs:70— MethodTooLong — perform_run runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Transaction.prepare_inner gix-ref/src/store/file/transaction/prepare.rs:228— MethodTooLong — prepare_inner runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Handle.try_header_inner gix-odb/src/store_impls/dynamic/header.rs:20— MethodTooLong — try_header_inner runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: File.verify_integrity_inner gix-pack/src/multi_index/verify.rs:94— MethodTooLong — verify_integrity_inner runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Transaction.lock_ref_and_apply_change gix-ref/src/store/file/transaction/prepare.rs:38— MethodTooLong — lock_ref_and_apply_change runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: State.compute_status gix-status/src/index_as_worktree/function.rs:371— MethodTooLong — compute_status runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: File.new gix-commitgraph/src/file/init.rs:29— MethodTooLong — new runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
gitoxide_core::query::engine::update::update (cognitive 111) gitoxide-core/src/query/engine/update.rs:21— gitoxide_core::query::engine::update::update has cognitive complexity 111 (threshold 15). Drivers by points: if/else 28 (64 pts), match/switch 8 (34 pts), loops 8 (12 pts), boolean chains 1 (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.
gitoxide_core::repository::clean::function::clean (cognitive 109) gitoxide-core/src/repository/clean.rs:41— gitoxide_core::repository::clean::function::clean has cognitive complexity 109 (threshold 15). Drivers by points: if/else 42 (92 pts), boolean chains 8, match/switch 4 (8 pts), loops 1 (nesting depth added 54). 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.
gitoxide_core::hours::estimate (cognitive 62) gitoxide-core/src/hours/mod.rs:103— gitoxide_core::hours::estimate has cognitive complexity 62 (threshold 15). Drivers by points: if/else 26 (41 pts), loops 6 (10 pts), match/switch 3 (6 pts), boolean chains 5 (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.
gitoxide_core::repository::remote::refs_impl::print_refmap (cognitive 50) gitoxide-core/src/repository/remote.rs:153— gitoxide_core::repository::remote::refs_impl::print_refmap has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 7 (20 pts), loops 3 (6 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.
gitoxide_core::hours::core::spawn_tree_delta_threads (cognitive 45) gitoxide-core/src/hours/core.rs:84— gitoxide_core::hours::core::spawn_tree_delta_threads has cognitive complexity 45 (threshold 15). Drivers by points: if/else 6 (25 pts), match/switch 5 (17 pts), 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.
gitoxide_core::repository::attributes::validate_baseline::function::validate_baseline (cognitive 40) gitoxide-core/src/repository/attributes/validate_baseline.rs:32— gitoxide_core::repository::attributes::validate_baseline::function::validate_baseline has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 7 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gitoxide_core::repository::index::entries::function::print_entries (cognitive 38) gitoxide-core/src/repository/index/entries.rs:93— gitoxide_core::repository::index::entries::function::print_entries has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 2 (7 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gitoxide_core::repository::fetch::function::print_updates (cognitive 31) gitoxide-core/src/repository/fetch.rs:202— gitoxide_core::repository::fetch::function::print_updates has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 7 (13 pts), loops 2 (3 pts) (nesting depth added 16). Of this number, 30 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gitoxide_core::repository::attributes::query::function::query (cognitive 27) gitoxide-core/src/repository/attributes/query.rs:24— gitoxide_core::repository::attributes::query::function::query has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (8 pts), boolean chains 1, match/switch 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.
gitoxide_core::repository::status::show (cognitive 25) gitoxide-core/src/repository/status.rs:47— gitoxide_core::repository::status::show has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 5 (10 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
gitoxide_core::repository::clone::function::clone (cognitive 23) gitoxide-core/src/repository/clone.rs:24— gitoxide_core::repository::clone::function::clone has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 2 (6 pts), boolean chains 2, match/switch 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
gitoxide_core::organize::handle (cognitive 23) gitoxide-core/src/organize.rs:143— gitoxide_core::organize::handle has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 5, boolean chains 1, loops 1 (nesting depth added 6). Of this number, 19 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gitoxide_core::repository::odb::statistics (cognitive 21) gitoxide-core/src/repository/odb.rs:64— gitoxide_core::repository::odb::statistics has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (3 pts), match/switch 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.
gitoxide_core::repository::merge::tree::function::tree (cognitive 20) gitoxide-core/src/repository/merge/tree.rs:27— gitoxide_core::repository::merge::tree::function::tree has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 5 (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.
gitoxide_core::index::checkout::checkout_exclusive (cognitive 20) gitoxide-core/src/index/checkout.rs:14— gitoxide_core::index::checkout::checkout_exclusive has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, loops 5 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 4). 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.
gitoxide_core::repository::revision::list::function::list (cognitive 20) gitoxide-core/src/repository/revision/list.rs:31— gitoxide_core::repository::revision::list::function::list has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 4 (6 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
gitoxide_core::organize::find_git_repository_workdirs (cognitive 20) gitoxide-core/src/organize.rs:29— gitoxide_core::organize::find_git_repository_workdirs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 3). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (is_repository, into_workdir, repository_at). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
gitoxide_core::pack::verify::pack_or_pack_index (cognitive 18) gitoxide-core/src/pack/verify.rs:87— gitoxide_core::pack::verify::pack_or_pack_index has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 5 (6 pts), loops 1 (4 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.
gitoxide_core::pack::create::create (cognitive 16) gitoxide-core/src/pack/create.rs:88— gitoxide_core::pack::create::create has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 2, match/switch 2, loops 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.
Duplicated block (9 lines × 2) gitoxide-core/src/repository/fetch.rs:234— gitoxide-core/src/repository/fetch.rs:234-242 | gitoxide-core/src/repository/remote.rs:170-178 — 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 lines × 2) gix-config/src/file/mutable/section.rs:319— gix-config/src/file/mutable/section.rs:319-327 | gix-config/src/file/section/mod.rs:292-300 — 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 (9 lines × 2) gix-odb/src/store_impls/dynamic/handle.rs:257— gix-odb/src/store_impls/dynamic/handle.rs:257-265 | gix-odb/src/store_impls/dynamic/handle.rs:275-283 — 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) gix-pack/src/data/delta.rs:42— gix-pack/src/data/delta.rs:42-50 | gix-pack/src/data/delta.rs:54-62 — 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) gix-protocol/src/handshake/refs/async_io.rs:11— gix-protocol/src/handshake/refs/async_io.rs:11-19 | gix-protocol/src/handshake/refs/async_io.rs:42-50 — 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) gix-tix/src/command/enrich.rs:172— gix-tix/src/command/enrich.rs:172-180 | gix-tix/src/lib.rs:5398-5406 — 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 (9 lines × 2) gix-tix/src/edit/rebase.rs:613— gix-tix/src/edit/rebase.rs:613-621 | gix-tix/src/edit/rebase.rs:767-775 — 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) gix-tix/src/edit/rebase.rs:2452— gix-tix/src/edit/rebase.rs:2452-2460 | gix-tix/src/edit/rebase.rs:2907-2915 — 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) gix-tix/src/lib.rs:6196— gix-tix/src/lib.rs:6196-6204 | gix-tix/src/lib.rs:6746-6754 — 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) gix-transport/src/client/git/async_io.rs:56— gix-transport/src/client/git/async_io.rs:56-64 | gix-transport/src/client/git/blocking_io.rs:54-62 — before extracting anything, compare `gix-transport/src/client/git/async_io.rs` and `gix-transport/src/client/git/blocking_io.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) src/plumbing/options/mod.rs:770— src/plumbing/options/mod.rs:770-778 | src/plumbing/options/mod.rs:850-858 — 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) src/plumbing/main.rs:149— src/plumbing/main.rs:149-157 | src/porcelain/main.rs:17-25 — 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 (9 lines × 2) gix-transport/src/client/async_io/bufread_ext.rs:123— gix-transport/src/client/async_io/bufread_ext.rs:123-131 | gix-transport/src/client/blocking_io/bufread_ext.rs:113-121 — 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 (9 lines × 2) gix-transport/src/client/git/async_io.rs:118— gix-transport/src/client/git/async_io.rs:118-126 | gix-transport/src/client/git/blocking_io.rs:113-121 — before extracting anything, compare `gix-transport/src/client/git/async_io.rs` and `gix-transport/src/client/git/blocking_io.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) gix-tix/src/lib.rs:5352— gix-tix/src/lib.rs:5352-5360 | gix-tix/src/lib.rs:5409-5417 — 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) gix-filter/src/driver/process/client.rs:39— gix-filter/src/driver/process/client.rs:39-47 | gix-filter/src/driver/process/server.rs:41-49 — 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 lines × 2) gix-tix/src/command/enrich.rs:139— gix-tix/src/command/enrich.rs:139-147 | gix-tix/src/command/enrich.rs:183-191 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) gix-pack/fuzz/fuzz_targets/index_file.rs:13— gix-pack/fuzz/fuzz_targets/index_file.rs:13-21 | gix-pack/fuzz/fuzz_targets/multi_index_file.rs:15-23 — 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) gix-diff/src/index/function.rs:145— gix-diff/src/index/function.rs:145-149 | gix-diff/src/index/function.rs:151-155 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) gix-imara-diff/src/sources.rs:175— gix-imara-diff/src/sources.rs:175-179 | gix-imara-diff/src/sources.rs:208-212 — 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) gix-odb/src/store_impls/loose/find.rs:97— gix-odb/src/store_impls/loose/find.rs:97-101 | gix-odb/src/store_impls/loose/find.rs:122-127 — 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) gix-prompt/src/unix.rs:42— gix-prompt/src/unix.rs:42-46 | gix-prompt/src/unix.rs:61-65 — 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) gix-tix/src/app.rs:1776— gix-tix/src/app.rs:1776-1780 | gix-tix/src/app.rs:1787-1791 — 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) gix-tix/src/app.rs:3555— gix-tix/src/app.rs:3555-3559 | gix-tix/src/app.rs:3571-3575 — 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) gix-transport/src/client/async_io/bufread_ext.rs:118— gix-transport/src/client/async_io/bufread_ext.rs:118-122 | gix-transport/src/client/blocking_io/bufread_ext.rs:108-112 — 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 (5 lines × 2) gix-config/src/file/section/mod.rs:196— gix-config/src/file/section/mod.rs:196-200 | gix-config/src/file/write.rs:10-14 — 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 (5 lines × 2) gix-config/src/format.rs:96— gix-config/src/format.rs:96-100 | gix-config/src/parse/format.rs:81-85 — 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 (5 lines × 2) gix-hash/src/io.rs:108— gix-hash/src/io.rs:108-112 | gix-pack/src/data/input/bytes_to_entries.rs:336-340 — 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 (5 lines × 2) gix-tix/src/edit/create.rs:386— gix-tix/src/edit/create.rs:386-392 | gix-tix/src/edit/split.rs:108-112 — 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) gix-tix/src/history.rs:1280— gix-tix/src/history.rs:1280-1284 | gix-tix/src/history.rs:1491-1495 — 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) gix-tix/src/edit/time_travel.rs:1201— gix-tix/src/edit/time_travel.rs:1201-1205 | gix-tix/src/edit/time_travel.rs:1227-1231 — 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) gitoxide-core/src/repository/fetch.rs:168— gitoxide-core/src/repository/fetch.rs:168-172 | gitoxide-core/src/repository/revision/list.rs:122-126 — 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 (5 lines × 2) gix-config/src/file/includes/mod.rs:159— gix-config/src/file/includes/mod.rs:159-163 | gix-config/src/file/includes/mod.rs:180-184 — 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) gix-odb/src/store_impls/loose/write.rs:36— gix-odb/src/store_impls/loose/write.rs:36-40 | gix-odb/src/store_impls/loose/write.rs:53-57 — 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) gix-odb/src/store_impls/loose/write.rs:73— gix-odb/src/store_impls/loose/write.rs:73-77 | gix-odb/src/store_impls/loose/write.rs:91-95 — 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) gix-refspec/src/match_group/mod.rs:90— gix-refspec/src/match_group/mod.rs:90-94 | gix-refspec/src/match_group/mod.rs:161-165 — 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.
FileTooLong: src/lib.rs gix-tix/src/lib.rs— FileTooLong — 5798 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 139 free functions. The bar is 500 significant lines; this is 5298 over it, 11.60× 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: src/app.rs gix-tix/src/app.rs— FileTooLong — 2712 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 72% of them inside a single declaration: App (513-3444). The bar is 500 significant lines; this is 2212 over it, 5.42× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: edit/rebase.rs gix-tix/src/edit/rebase.rs— FileTooLong — 2506 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 48 free functions. The bar is 500 significant lines; this is 2006 over it, 5.01× 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: src/ui.rs gix-tix/src/ui.rs— FileTooLong — 2138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 51 free functions. The bar is 500 significant lines; this is 1638 over it, 4.28× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/history.rs gix-tix/src/history.rs— FileTooLong — 1629 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 33 free functions. The bar is 500 significant lines; this is 1129 over it, 3.26× 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: plumbing/main.rs src/plumbing/main.rs— FileTooLong — 1525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 1025 over it, 3.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: function/resolve.rs gix-merge/src/tree/function/resolve.rs— FileTooLong — 1414 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 914 over it, 2.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: src/ref_tree.rs gix-tix/src/ref_tree.rs— FileTooLong — 1270 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 770 over it, 2.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: edit/time_travel.rs gix-tix/src/edit/time_travel.rs— FileTooLong — 999 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 39 free functions. The bar is 500 significant lines; this is 499 over it, 2.00× 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: edit/todo.rs gix-tix/src/edit/todo.rs— FileTooLong — 925 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 425 over it, 1.85× 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: options/mod.rs src/plumbing/options/mod.rs— FileTooLong — 746 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 246 over it, 1.49× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: file/function.rs gix-blame/src/file/function.rs— FileTooLong — 711 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 211 over it, 1.42× 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: edit/undo.rs gix-tix/src/edit/undo.rs— FileTooLong — 636 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 37 free functions. The bar is 500 significant lines; this is 136 over it, 1.27× 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: cache/init.rs gix/src/config/cache/init.rs— FileTooLong — 561 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 61 over it, 1.12× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/command.rs gix-tix/src/command.rs— FileTooLong — 559 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 59 over it, 1.12× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: rewrites/tracker.rs gix-diff/src/rewrites/tracker.rs— FileTooLong — 513 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 62% of them inside a single declaration: Tracker (3 blocks, 138-630). The bar is 500 significant lines; this is 13 over it, 1.03× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
gitoxide_core::repository::clean::function::clean (cyclomatic 55) gitoxide-core/src/repository/clean.rs:41— gitoxide_core::repository::clean::function::clean 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.
gitoxide_core::query::engine::update::update (cyclomatic 45) gitoxide-core/src/query/engine/update.rs:21— gitoxide_core::query::engine::update::update has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
gitoxide_core::hours::estimate (cyclomatic 37) gitoxide-core/src/hours/mod.rs:103— gitoxide_core::hours::estimate has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
gitoxide_core::repository::status::show (cyclomatic 24) gitoxide-core/src/repository/status.rs:47— gitoxide_core::repository::status::show has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
gitoxide_core::repository::attributes::validate_baseline::function::validate_baseline (cyclomatic 23) gitoxide-core/src/repository/attributes/validate_baseline.rs:32— gitoxide_core::repository::attributes::validate_baseline::function::validate_baseline 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.
gitoxide_core::repository::merge::tree::function::tree (cyclomatic 18) gitoxide-core/src/repository/merge/tree.rs:27— gitoxide_core::repository::merge::tree::function::tree 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.
gitoxide_core::repository::remote::refs_impl::print_refmap (cyclomatic 18) gitoxide-core/src/repository/remote.rs:153— gitoxide_core::repository::remote::refs_impl::print_refmap 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.
gitoxide_core::hours::core::spawn_tree_delta_threads (cyclomatic 18) gitoxide-core/src/hours/core.rs:84— gitoxide_core::hours::core::spawn_tree_delta_threads 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.
gitoxide_core::organize::find_git_repository_workdirs (cyclomatic 18) gitoxide-core/src/organize.rs:29— gitoxide_core::organize::find_git_repository_workdirs has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 3 function items inside it that branch (is_repository, into_workdir, repository_at). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
gitoxide_core::organize::handle (cyclomatic 17) gitoxide-core/src/organize.rs:143— gitoxide_core::organize::handle has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
gitoxide_core::index::checkout::checkout_exclusive (cyclomatic 16) gitoxide-core/src/index/checkout.rs:14— gitoxide_core::index::checkout::checkout_exclusive has cyclomatic complexity 16 (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.
gitoxide_core::repository::odb::statistics (cyclomatic 16) gitoxide-core/src/repository/odb.rs:64— gitoxide_core::repository::odb::statistics 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.
Duplicated block (7 lines × 2) gitoxide-core/src/corpus/db.rs:61— gitoxide-core/src/corpus/db.rs:61-67 | gitoxide-core/src/query/db.rs:15-21 — 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) gix-object/src/traits/find.rs:220— gix-object/src/traits/find.rs:220-226 | gix-object/src/traits/find.rs:238-244 — 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) gix-pack/src/index/traverse/with_index.rs:84— gix-pack/src/index/traverse/with_index.rs:84-90 | gix-pack/src/index/traverse/with_lookup.rs:91-97 — 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 (7 lines × 2) gix-ref/src/store/file/overlay_iter.rs:391— gix-ref/src/store/file/overlay_iter.rs:391-397 | gix-ref/src/store/file/overlay_iter.rs:404-410 — 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) gix-tix/src/edit/rebase.rs:1284— gix-tix/src/edit/rebase.rs:1284-1290 | gix-tix/src/edit/rebase.rs:1574-1580 — 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) gix-tix/src/ref_tree.rs:257— gix-tix/src/ref_tree.rs:257-263 | gix-tix/src/ref_tree.rs:709-715 — 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) gix-transport/src/client/async_io/bufread_ext.rs:133— gix-transport/src/client/async_io/bufread_ext.rs:133-139 | gix-transport/src/client/blocking_io/bufread_ext.rs:123-129 — 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) gix-diff/src/blob/pipeline.rs:495— gix-diff/src/blob/pipeline.rs:495-501 | gix-merge/src/blob/pipeline.rs:313-319 — 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) gix-object/src/commit/ref_iter.rs:162— gix-object/src/commit/ref_iter.rs:162-168 | gix-object/src/tag/ref_iter.rs:78-84 — 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) gix-tix/src/edit/rebase.rs:2362— gix-tix/src/edit/rebase.rs:2362-2368 | gix-tix/src/edit/rebase.rs:2415-2421 — 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) gix-tix/src/edit/rebase.rs:409— gix-tix/src/edit/rebase.rs:409-415 | gix-tix/src/edit/rebase.rs:3006-3012 — 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) gix-tix/src/edit/create.rs:396— gix-tix/src/edit/create.rs:396-402 | gix-tix/src/edit/split.rs:116-122 — 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 × 2) gix-hash/src/object_id.rs:70— gix-hash/src/object_id.rs:70-79 | gix-hash/src/object_id.rs:85-94 — 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) gix-merge/src/blob/builtin_driver/text/function.rs:174— gix-merge/src/blob/builtin_driver/text/function.rs:174-183 | gix-merge/src/blob/builtin_driver/text/function.rs:201-210 — 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) gix-merge/src/tree/function/resolve.rs:1567— gix-merge/src/tree/function/resolve.rs:1567-1576 | gix-merge/src/tree/function/resolve.rs:1873-1882 — 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) gix-packetline/src/async_io/read.rs:47— gix-packetline/src/async_io/read.rs:47-56 | gix-packetline/src/blocking_io/read.rs:45-54 — `gix-packetline/src/async_io/read.rs` and `gix-packetline/src/blocking_io/read.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 55 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (10 lines × 2) gix-protocol/src/handshake/refs/async_io.rs:14— gix-protocol/src/handshake/refs/async_io.rs:14-23 | gix-protocol/src/handshake/refs/blocking_io.rs:14-23 — 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 × 2) gix-tix/src/app.rs:1991— gix-tix/src/app.rs:1991-2000 | gix-tix/src/app.rs:2052-2061 — 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) gix-tix/src/edit/rebase.rs:3027— gix-tix/src/edit/rebase.rs:3027-3036 | gix-tix/src/edit/rebase.rs:3042-3051 — 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) REDACTED:147— REDACTED:147-156 | REDACTED:164-173 — 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) gix-pack/src/index/verify.rs:115— gix-pack/src/index/verify.rs:115-124 | gix-pack/src/multi_index/verify.rs:50-59 — 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 (10 lines × 2) src/plumbing/main.rs:1649— src/plumbing/main.rs:1649-1658 | src/plumbing/main.rs:1704-1714 — 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) gix-filter/src/driver/process/client.rs:91— gix-filter/src/driver/process/client.rs:91-100 | gix-filter/src/driver/process/server.rs:93-102 — 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.
Off the main sequence: gix-trace — gix-trace: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 15 project(s), so it's rigid to change.
Off the main sequence: gix-hash — gix-hash: abstractness 0.00, instability 0.07, distance 0.93 — zone of pain — concrete and depended on by 25 project(s), so it's rigid to change.
Off the main sequence: gix-date — gix-date: abstractness 0.00, instability 0.08, distance 0.92 — zone of pain — concrete and depended on by 12 project(s), so it's rigid to change.
Off the main sequence: gix-path — gix-path: abstractness 0.00, instability 0.09, distance 0.91 — zone of pain — concrete and depended on by 30 project(s), so it's rigid to change.
Off the main sequence: gix-hashtable — gix-hashtable: abstractness 0.00, instability 0.11, distance 0.89 — zone of pain — concrete and depended on by 8 project(s), so it's rigid to change.
Off the main sequence: gix-tempfile — gix-tempfile: abstractness 0.00, instability 0.11, distance 0.89 — zone of pain — concrete and depended on by 8 project(s), so it's rigid to change.
Off the main sequence: gix-imara-diff — gix-imara-diff: abstractness 0.12, instability 0.00, distance 0.88 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: gix-validate — gix-validate: abstractness 0.00, instability 0.13, distance 0.88 — zone of pain — concrete and depended on by 7 project(s), so it's rigid to change.
Off the main sequence: gix-error — gix-error: abstractness 0.21, instability 0.00, distance 0.79 — zone of pain — concrete and depended on by 52 project(s), so it's rigid to change.
Off the main sequence: gix-zlib — gix-zlib: abstractness 0.00, instability 0.25, distance 0.75 — zone of pain — concrete and depended on by 3 project(s), so it's rigid to change.
Off the main sequence: gix-features — gix-features: abstractness 0.12, instability 0.14, distance 0.74 — zone of pain — concrete and depended on by 18 project(s), so it's rigid to change.
Duplicated block (11 lines × 2) gitoxide-core/src/repository/merge/commit.rs:60— gitoxide-core/src/repository/merge/commit.rs:60-70 | gitoxide-core/src/repository/merge/tree.rs:94-104 — 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 lines × 2) gix/src/worktree/remove.rs:384— gix/src/worktree/remove.rs:384-394 | gix/src/worktree/remove.rs:400-410 — 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) gix/src/config/cache/access.rs:55— gix/src/config/cache/access.rs:55-65 | gix/src/config/cache/access.rs:119-129 — 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) gix/src/clone/fetch/mod.rs:82— gix/src/clone/fetch/mod.rs:82-92 | gix/src/clone/fetch/mod.rs:108-118 — 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) gix-diff/src/tree/function.rs:225— gix-diff/src/tree/function.rs:225-235 | gix-diff/src/tree/function.rs:279-289 — 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) gix-index/src/access/mod.rs:354— gix-index/src/access/mod.rs:354-364 | gix-index/src/access/mod.rs:445-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.
Duplicated block (11 lines × 2) gix-pack/src/bundle/write/mod.rs:96— gix-pack/src/bundle/write/mod.rs:96-106 | gix-pack/src/bundle/write/mod.rs:209-219 — 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) gix-packetline/src/async_io/read.rs:115— gix-packetline/src/async_io/read.rs:115-125 | gix-packetline/src/blocking_io/read.rs:114-124 — `gix-packetline/src/async_io/read.rs` and `gix-packetline/src/blocking_io/read.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 55 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (11 lines × 2) gix-tix/src/history.rs:1274— gix-tix/src/history.rs:1274-1284 | gix-tix/src/history.rs:1940-1950 — 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) gix-pack/fuzz/fuzz_targets/index_file.rs:34— gix-pack/fuzz/fuzz_targets/index_file.rs:34-44 | gix-pack/fuzz/fuzz_targets/multi_index_file.rs:35-45 — 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.
Store::consolidate_with_disk_state (cognitive 80) gix-odb/src/store_impls/dynamic/load_index.rs:168— Store::consolidate_with_disk_state has cognitive complexity 80 (threshold 15). Drivers by points: if/else 29 (58 pts), match/switch 4 (13 pts), loops 4 (5 pts), boolean chains 4 (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.
Store::load_next_index (cognitive 30) gix-odb/src/store_impls/dynamic/load_index.rs:86— Store::load_next_index has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (8 pts), loops 3 (7 pts) (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.
Store::metrics (cognitive 29) gix-odb/src/store_impls/dynamic/metrics.rs:9— Store::metrics has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 3 (8 pts), loops 3 (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.
Store::load_pack (cognitive 26) gix-odb/src/store_impls/dynamic/load_one.rs:14— Store::load_pack has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 8 (24 pts), if/else 2 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Store::find_inner (cognitive 25) gix-ref/src/store/file/find.rs:156— Store::find_inner has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Store::find_one_with_verified_input (cognitive 19) gix-ref/src/store/file/find.rs:88— Store::find_one_with_verified_input has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), loops 2 (3 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.
Store::lookup_prefix (cognitive 18) gix-odb/src/store_impls/loose/find.rs:25— Store::lookup_prefix has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 2 (6 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Store::reflog_create_or_append (cognitive 18) gix-ref/src/store/file/loose/reflog.rs:137— Store::reflog_create_or_append has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Store::verify_integrity (cognitive 16) gix-odb/src/store_impls/dynamic/verify.rs:94— Store::verify_integrity has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 2 (3 pts), loops 2 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Duplicated block (6 lines × 2) gix-features/src/parallel/in_parallel.rs:61— gix-features/src/parallel/in_parallel.rs:61-66 | gix-features/src/parallel/in_parallel.rs:129-134 — 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) gix-packetline/src/async_io/encode.rs:76— gix-packetline/src/async_io/encode.rs:76-81 | gix-packetline/src/async_io/encode.rs:101-106 — 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) gix-revwalk/src/graph/mod.rs:207— gix-revwalk/src/graph/mod.rs:207-212 | gix-revwalk/src/graph/mod.rs:258-263 — 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) gix-tix/src/lib.rs:537— gix-tix/src/lib.rs:537-542 | gix-tix/src/lib.rs:548-553 — 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) gix-worktree/src/stack/state/ignore.rs:179— gix-worktree/src/stack/state/ignore.rs:179-184 | gix-worktree/src/stack/state/ignore.rs:208-213 — 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) gix-error/src/error.rs:143— gix-error/src/error.rs:143-148 | gix-error/src/exn/impls.rs:251-256 — 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 (6 lines × 2) gix-transport/src/client/blocking_io/http/curl/mod.rs:153— gix-transport/src/client/blocking_io/http/curl/mod.rs:153-158 | gix-transport/src/client/blocking_io/http/reqwest/remote.rs:361-366 — 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 (6 lines × 2) gix-tix/src/history.rs:764— gix-tix/src/history.rs:764-769 | gix-tix/src/history.rs:1151-1156 — 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) gix-filter/src/driver/process/client.rs:29— gix-filter/src/driver/process/client.rs:29-34 | gix-filter/src/driver/process/client.rs:81-86 — 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.
gix::remote::connection::fetch::update_refs::update (cognitive 92) gix/src/remote/connection/fetch/update_refs/mod.rs:63— gix::remote::connection::fetch::update_refs::update has cognitive complexity 92 (threshold 15). Drivers by points: if/else 18 (51 pts), match/switch 11 (37 pts), boolean chains 2, loops 2 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix::config::snapshot::credential_helpers::function::credential_helpers (cognitive 41) gix/src/config/snapshot/credential_helpers.rs:69— gix::config::snapshot::credential_helpers::function::credential_helpers has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 2 (6 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix::worktree::remove::resolve (cognitive 24) gix/src/worktree/remove.rs:310— gix::worktree::remove::resolve has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 5 (8 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.
gix::open::repository::check_safe_directories (cognitive 23) gix/src/open/repository.rs:622— gix::open::repository::check_safe_directories has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix::remote::connection::fetch::update_refs::update_needs_adjustment_as_edits_symbolic_target_is_missing (cognitive 22) gix/src/remote/connection/fetch/update_refs/mod.rs:384— gix::remote::connection::fetch::update_refs::update_needs_adjustment_as_edits_symbolic_target_is_missing has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (16 pts), match/switch 3 (6 pts) (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
gix::config::cache::init::apply_environment_overrides (cognitive 22) gix/src/config/cache/init.rs:409— gix::config::cache::init::apply_environment_overrides has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (4 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.
gix::repository::worktree::insert_head (cognitive 18) gix/src/repository/worktree.rs:231— gix::repository::worktree::insert_head has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2, match/switch 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.
gix::create::into_with_capabilities (cognitive 16) gix/src/create.rs:156— gix::create::into_with_capabilities has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TooManyMethods: Repository gix/src/types.rs:159— TooManyMethods — 188 methods, declared across 36 files: repository/object.rs (23), config/mod.rs (21), repository/reference.rs (20), repository/location.rs (16), +32 more file(s). The bar is 30 methods; this is 158 over it, 6.27× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: App gix-tix/src/app.rs:513— TooManyMethods — 176 methods. The bar is 30 methods; this is 146 over it, 5.87× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: File gix-config/src/types.rs:104— TooManyMethods — 137 methods, declared across 11 files: access/raw.rs (39), access/read_only.rs (29), access/comfort.rs (24), access/mutate.rs (24), +7 more file(s). The bar is 30 methods; this is 107 over it, 4.57× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: State gix-index/src/lib.rs:136— TooManyMethods — 56 methods, declared across 5 files: access/mod.rs (48), src/write.rs (3), src/init.rs (2), src/verify.rs (2), +1 more file(s). The bar is 30 methods; this is 26 over it, 1.87× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Store gix-ref/src/lib.rs:131— TooManyMethods — 50 methods, declared across 9 files: file/find.rs (14), loose/reflog.rs (9), file/packed.rs (7), file/mod.rs (5), +5 more file(s). The bar is 30 methods; this is 20 over it, 1.67× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Store gix-odb/src/lib.rs:149— TooManyMethods — 43 methods, declared across 12 files: dynamic/load_index.rs (10), dynamic/handle.rs (8), loose/find.rs (7), loose/write.rs (5), +8 more file(s). The bar is 30 methods; this is 13 over it, 1.43× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: SectionMut gix-config/src/file/mutable/section.rs:23— TooManyMethods — 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Cache gix/src/config/mod.rs:190— TooManyMethods — 33 methods, declared across 2 files: cache/access.rs (29), cache/init.rs (4). The bar is 30 methods; this is 3 over it, 1.10× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (15 lines × 2) gitoxide-core/src/commitgraph/verify.rs:63— gitoxide-core/src/commitgraph/verify.rs:63-77 | gitoxide-core/src/repository/commitgraph/verify.rs:52-66 — 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 (15 lines × 2) gix-imara-diff/src/myers.rs:129— gix-imara-diff/src/myers.rs:129-143 | gix-imara-diff/src/myers.rs:152-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 (15 lines × 2) gix-imara-diff/src/slider_heuristic.rs:127— gix-imara-diff/src/slider_heuristic.rs:127-141 | gix-imara-diff/src/slider_heuristic.rs:154-168 — 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) gix-imara-diff/src/unified_diff.rs:230— gix-imara-diff/src/unified_diff.rs:230-244 | gix-imara-diff/src/unified_diff.rs:264-278 — 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) gix-protocol/src/handshake/refs/async_io.rs:45— gix-protocol/src/handshake/refs/async_io.rs:45-59 | gix-protocol/src/handshake/refs/blocking_io.rs:43-57 — 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) gix-tix/src/edit/rebase.rs:1242— gix-tix/src/edit/rebase.rs:1242-1256 | gix-tix/src/edit/rebase.rs:1538-1552 — 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) src/plumbing/main.rs:1834— src/plumbing/main.rs:1834-1848 | src/porcelain/main.rs:178-192 — 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) gix-blame/src/file/function.rs:584— gix-blame/src/file/function.rs:584-591 | gix-blame/src/file/function.rs:594-601 — 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) gix-diff/src/rewrites/tracker.rs:556— gix-diff/src/rewrites/tracker.rs:556-563 | gix-diff/src/rewrites/tracker.rs:612-619 — 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) gix-pack/src/cache/delta/traverse/resolve.rs:649— gix-pack/src/cache/delta/traverse/resolve.rs:649-656 | gix-pack/src/data/file/decode/entry.rs:495-502 — 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) gix-packetline/src/async_io/encode.rs:89— gix-packetline/src/async_io/encode.rs:89-96 | gix-packetline/src/async_io/encode.rs:116-123 — 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) gix-tix/src/edit/time_travel.rs:476— gix-tix/src/edit/time_travel.rs:476-483 | gix-tix/src/edit/time_travel.rs:634-641 — 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) gix-odb/src/store_impls/loose/find.rs:213— gix-odb/src/store_impls/loose/find.rs:213-220 | gix-pack/src/lib.rs:67-74 — 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) gix-imara-diff/src/unified_diff.rs:180— gix-imara-diff/src/unified_diff.rs:180-187 | gix-imara-diff/src/unified_diff.rs:189-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.
AC3 · Page structure· Heading level jumps from h1 to h3 · ×6
Heading level jumps from h1 to h3 etc/speak/gitmerge-2024.marp.html:39— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
Heading level jumps from h1 to h3 etc/speak/gitmerge-2024.marp.html:44— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
Heading level jumps from h1 to h3 etc/speak/gitmerge-2024.marp.html:49— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
Heading level jumps from h1 to h3 etc/speak/gitmerge-2024.marp.html:54— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
Heading level jumps from h1 to h3 etc/speak/gitmerge-2024.marp.html:59— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
Heading level jumps from h1 to h3 etc/speak/gitmerge-2024.marp.html:64— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
Handle::try_find_cached_inner (cognitive 63) gix-odb/src/store_impls/dynamic/find.rs:51— Handle::try_find_cached_inner has cognitive complexity 63 (threshold 15). Drivers by points: if/else 8 (26 pts), match/switch 6 (25 pts), loops 4 (11 pts), boolean chains 1 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Handle::try_header_inner (cognitive 63) gix-odb/src/store_impls/dynamic/header.rs:20— Handle::try_header_inner has cognitive complexity 63 (threshold 15). Drivers by points: if/else 8 (26 pts), match/switch 6 (25 pts), loops 4 (11 pts), boolean chains 1 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Handle::location_by_oid (cognitive 29) gix-odb/src/store_impls/dynamic/find.rs:321— Handle::location_by_oid has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 3 (15 pts), if/else 3 (11 pts), loops 2 (3 pts) (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Handle::lookup_prefix (cognitive 23) gix-odb/src/store_impls/dynamic/prefix.rs:120— Handle::lookup_prefix has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (6 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 12). Of this number, 22 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Handle::contains (cognitive 17) gix-odb/src/store_impls/dynamic/find.rs:281— Handle::contains has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
File::resolve_deltas (cognitive 26) gix-pack/src/data/file/decode/entry.rs:231— File::resolve_deltas has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 3 (6 pts), loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
File::from_paths_metadata_buf (cognitive 18) gix-config/src/file/init/from_paths.rs:61— File::from_paths_metadata_buf has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
File::verify_integrity_inner (cognitive 18) gix-pack/src/multi_index/verify.rs:94— File::verify_integrity_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (4 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.
File::eq (cognitive 17) gix-config/src/file/impls.rs:51— File::eq has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). Of this number, 13 points are the body's own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
File::write_to_filter (cognitive 17) gix-config/src/file/write.rs:18— File::write_to_filter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 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.
Duplicated block (12 lines × 2) gix-pathspec/src/search/matching.rs:134— gix-pathspec/src/search/matching.rs:134-145 | gix-pathspec/src/search/matching.rs:196-207 — 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 (12 lines × 2) gix-transport/src/client/git/async_io.rs:148— gix-transport/src/client/git/async_io.rs:148-159 | gix-transport/src/client/git/blocking_io.rs:143-154 — before extracting anything, compare `gix-transport/src/client/git/async_io.rs` and `gix-transport/src/client/git/blocking_io.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) gix-worktree/src/stack/state/attributes.rs:109— gix-worktree/src/stack/state/attributes.rs:109-120 | gix-worktree/src/stack/state/attributes.rs:148-159 — 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 (12 lines × 2) gix-diff/src/tree/recorder.rs:122— gix-diff/src/tree/recorder.rs:122-133 | gix-traverse/src/tree/recorder.rs:120-131 — 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 (12 lines × 2) gix/src/config/tree/sections/core.rs:548— gix/src/config/tree/sections/core.rs:548-559 | gix/src/config/tree/sections/pack.rs:73-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.
gix_merge::tree::function::resolve::tree (cognitive 677) gix-merge/src/tree/function/resolve.rs:97— gix_merge::tree::function::resolve::tree has cognitive complexity 677 (threshold 15). Drivers by points: if/else 98 (458 pts), match/switch 39 (175 pts), boolean chains 38, loops 3 (6 pts) (nesting depth added 499). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix_merge::tree::apply_index_entries::function::apply_index_entries (cognitive 25) gix-merge/src/tree/mod.rs:488— gix_merge::tree::apply_index_entries::function::apply_index_entries has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 3 (6 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
gix_merge::blob::builtin_driver::text::utils::zealously_contract_hunks (cognitive 19) gix-merge/src/blob/builtin_driver/text/utils.rs:173— gix_merge::blob::builtin_driver::text::utils::zealously_contract_hunks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2, match/switch 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.
gix_merge::tree::utils::unique_path_in_tree (cognitive 16) gix-merge/src/tree/utils.rs:75— gix_merge::tree::utils::unique_path_in_tree has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Pipeline::convert_to_diffable (cognitive 102) gix-diff/src/blob/pipeline.rs:190— Pipeline::convert_to_diffable has cognitive complexity 102 (threshold 15). Drivers by points: if/else 20 (54 pts), match/switch 9 (38 pts), boolean chains 10 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Pipeline::convert_to_mergeable (cognitive 46) gix-merge/src/blob/pipeline.rs:139— Pipeline::convert_to_mergeable has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 6 (22 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.
Pipeline::worktree_file_to_object (cognitive 17) gix/src/filter.rs:158— Pipeline::worktree_file_to_object has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 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.
Pipeline::convert_to_git (cognitive 17) gix-filter/src/pipeline/convert.rs:46— Pipeline::convert_to_git has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5 (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.
App::update (cognitive 99) gix-tix/src/app.rs:1575— App::update has cognitive complexity 99 (threshold 15). Drivers by points: if/else 35 (65 pts), match/switch 9 (17 pts), boolean chains 13, loops 2 (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.
App::update_hidden_branch_targets (cognitive 20) gix-tix/src/app.rs:2217— App::update_hidden_branch_targets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 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.
App::finish_lane_computation (cognitive 20) gix-tix/src/app.rs:2399— App::finish_lane_computation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
App::peel_compressed_segment (cognitive 16) gix-tix/src/app.rs:1402— App::peel_compressed_segment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (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.
gix_validate::tag::name_inner (cognitive 88) REDACTED:77— gix_validate::tag::name_inner has cognitive complexity 88 (threshold 15). Drivers by points: if/else 32 (66 pts), loops 5 (16 pts), boolean chains 4, match/switch 1 (2 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.
gix_validate::path::is_dot_ntfs (cognitive 31) gix-validate/src/path.rs:269— gix_validate::path::is_dot_ntfs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 2, loops 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.
gix_validate::path::component (cognitive 28) gix-validate/src/path.rs:90— gix_validate::path::component has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 5 (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.
gix_validate::path::is_win_device (cognitive 17) gix-validate/src/path.rs:157— gix_validate::path::is_win_device has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Transaction::commit_inner (cognitive 71) gix-ref/src/store/file/transaction/commit.rs:37— Transaction::commit_inner has cognitive complexity 71 (threshold 15). Drivers by points: if/else 14 (41 pts), match/switch 7 (23 pts), boolean chains 4, loops 3 (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.
Transaction::prepare_inner (cognitive 47) gix-ref/src/store/file/transaction/prepare.rs:228— Transaction::prepare_inner has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 5 (14 pts), loops 4 (9 pts), boolean chains 4 (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.
Transaction::lock_ref_and_apply_change (cognitive 31) gix-ref/src/store/file/transaction/prepare.rs:38— Transaction::lock_ref_and_apply_change has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 5 (10 pts), boolean chains 3 (nesting depth added 14). Of this number, 29 points are the body's own statements and 2 belong to one function item inside it that branches. The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Transaction::prepare (cognitive 25) gix-ref/src/store/packed/transaction.rs:56— Transaction::prepare has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (6 pts), loops 2 (4 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.
gix_pack::data::output::count::objects::expand::this (cognitive 52) gix-pack/src/data/output/count/objects/mod.rs:139— gix_pack::data::output::count::objects::expand::this has cognitive complexity 52 (threshold 15). Drivers by points: loops 7 (28 pts), match/switch 4 (16 pts), if/else 3 (8 pts) (nesting depth added 38). 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.
gix_pack::cache::delta::traverse::resolve::resolve_parallel (cognitive 35) gix-pack/src/cache/delta/traverse/resolve.rs:269— gix_pack::cache::delta::traverse::resolve::resolve_parallel has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 5 (8 pts), match/switch 2 (4 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.
gix_pack::index::access::lookup_prefix (cognitive 28) gix-pack/src/index/access.rs:221— gix_pack::index::access::lookup_prefix has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 3 (9 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix_pack::data::output::entry::iter_from_counts::function::iter_from_counts (cognitive 25) gix-pack/src/data/output/entry/iter_from_counts.rs:46— gix_pack::data::output::entry::iter_from_counts::function::iter_from_counts has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 7 (17 pts), loops 3 (4 pts), if/else 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
gix_config::format::normalize_events (cognitive 49) gix-config/src/format.rs:119— gix_config::format::normalize_events has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (34 pts), boolean chains 6, loops 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix_config::parse::format::normalize_events (cognitive 39) gix-config/src/parse/format.rs:103— gix_config::parse::format::normalize_events has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 3 (6 pts), boolean chains 4, match/switch 3 (4 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.
gix_config::parse::from_bytes::value (cognitive 24) gix-config/src/parse/from_bytes/mod.rs:318— gix_config::parse::from_bytes::value has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (5 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.
gix_config::file::includes::include_condition_match (cognitive 16) gix-config/src/file/includes/mod.rs:153— gix_config::file::includes::include_condition_match has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (5 pts), match/switch 3 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Tree::handle_key (cognitive 46) gix-tix/src/ref_tree.rs:271— Tree::handle_key has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 16, match/switch 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.
Tree::draw (cognitive 24) gix-tix/src/ref_tree.rs:400— Tree::draw has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 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.
Tree::peel_to_entry (cognitive 17) gix/src/object/tree/mod.rs:112— Tree::peel_to_entry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Tree::verify::verify_recursive (cognitive 17) gix-index/src/extension/tree/verify.rs:12— Tree::verify::verify_recursive 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.
gix_protocol::fetch::function::fetch (cognitive 35) gix-protocol/src/fetch/function.rs:40— gix_protocol::fetch::function::fetch has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 2, loops 1 (2 pts), match/switch 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.
gix_protocol::handshake::refs::shared::parse_v2 (cognitive 34) gix-protocol/src/handshake/refs/shared.rs:208— gix_protocol::handshake::refs::shared::parse_v2 has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 7 (21 pts), if/else 5 (11 pts), loops 1 (2 pts) (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
gix_protocol::fetch::negotiate::mark_complete_and_common_ref (cognitive 23) gix-protocol/src/fetch/negotiate.rs:102— gix_protocol::fetch::negotiate::mark_complete_and_common_ref has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 4 (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.
gix_protocol::fetch::negotiate::one_round (cognitive 17) gix-protocol/src/fetch/negotiate.rs:445— gix_protocol::fetch::negotiate::one_round has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Algorithm::mark_common (cognitive 31) gix-negotiate/src/consecutive.rs:42— Algorithm::mark_common has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (6 pts), boolean chains 4 (nesting depth added 18). 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.
Algorithm::mark_common (cognitive 24) gix-negotiate/src/skipping.rs:36— Algorithm::mark_common has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Algorithm::next_have (cognitive 19) gix-negotiate/src/consecutive.rs:108— Algorithm::next_have has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 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.
Algorithm::next_have (cognitive 16) gix-negotiate/src/skipping.rs:136— Algorithm::next_have has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
State::compute_status (cognitive 28) gix-status/src/index_as_worktree/function.rs:371— State::compute_status has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 6, match/switch 4 (5 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.
State::apply_delayed (cognitive 20) gix-filter/src/driver/apply.rs:83— State::apply_delayed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (8 pts) (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
State::from_bytes (cognitive 20) gix-index/src/decode/mod.rs:40— State::from_bytes has cognitive complexity 20 (threshold 15). Drivers by points: loops 3 (10 pts), match/switch 3 (7 pts), if/else 3 (nesting depth added 11). 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.
State::id_mappings_from_index (cognitive 16) gix-worktree/src/stack/state/mod.rs:96— State::id_mappings_from_index has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Repository::add_worktree (cognitive 25) gix/src/worktree/add.rs:88— Repository::add_worktree has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 3 (5 pts), loops 2, 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.
Repository::try_find_remote_inner (cognitive 22) gix/src/repository/remote.rs:182— Repository::try_find_remote_inner has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Repository::branch_remote_ref_name (cognitive 19) gix/src/repository/config/branch.rs:43— Repository::branch_remote_ref_name has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 4 (6 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Repository::state (cognitive 16) gix/src/repository/state.rs:8— Repository::state has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (16 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, 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.
Duplicated block (13 lines × 2) gitoxide-core/src/repository/index/entries.rs:401— gitoxide-core/src/repository/index/entries.rs:401-413 | gix-index/src/lib.rs:223-235 — 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 (13 lines × 2) gix-packetline/src/async_io/sidebands.rs:285— gix-packetline/src/async_io/sidebands.rs:285-297 | gix-packetline/src/blocking_io/sidebands.rs:145-157 — 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 (13 lines × 2) gix-transport/src/client/capabilities.rs:224— gix-transport/src/client/capabilities.rs:224-236 | gix-transport/src/client/capabilities.rs:311-323 — 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) gix-traverse/src/commit/simple.rs:524— gix-traverse/src/commit/simple.rs:524-536 | gix-traverse/src/commit/simple.rs:606-618 — 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.
gix_validate::tag::name_inner (cyclomatic 38) REDACTED:77— gix_validate::tag::name_inner 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.
gix_validate::path::component (cyclomatic 22) gix-validate/src/path.rs:90— gix_validate::path::component 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.
gix_validate::path::is_win_device (cyclomatic 18) gix-validate/src/path.rs:157— gix_validate::path::is_win_device has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
gix::remote::connection::fetch::update_refs::update (cyclomatic 31) gix/src/remote/connection/fetch/update_refs/mod.rs:63— gix::remote::connection::fetch::update_refs::update 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.
gix::worktree::remove::resolve (cyclomatic 20) gix/src/worktree/remove.rs:310— gix::worktree::remove::resolve has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
gix::config::snapshot::credential_helpers::function::credential_helpers (cyclomatic 16) gix/src/config/snapshot/credential_helpers.rs:69— gix::config::snapshot::credential_helpers::function::credential_helpers 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.
gix_config::format::normalize_events (cyclomatic 29) gix-config/src/format.rs:119— gix_config::format::normalize_events 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.
gix_config::parse::format::normalize_events (cyclomatic 26) gix-config/src/parse/format.rs:103— gix_config::parse::format::normalize_events 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.
gix_config::parse::from_bytes::value (cyclomatic 19) gix-config/src/parse/from_bytes/mod.rs:318— gix_config::parse::from_bytes::value 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.
Transaction::commit_inner (cyclomatic 27) gix-ref/src/store/file/transaction/commit.rs:37— Transaction::commit_inner 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.
Transaction::lock_ref_and_apply_change (cyclomatic 23) gix-ref/src/store/file/transaction/prepare.rs:38— Transaction::lock_ref_and_apply_change has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Transaction::prepare_inner (cyclomatic 23) gix-ref/src/store/file/transaction/prepare.rs:228— Transaction::prepare_inner 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.
HackComment gix-object/src/tree/mod.rs:104— // Hack: `0o140000` represents `"040000"`, `0o40000` represents `"40000"`. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment gix-object/src/tree/mod.rs:169— // Hack: `0o140000` represents `"040000"`, `0o40000` represents `"40000"`. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment gix-ref/src/store/file/transaction/commit.rs:58— // Special HACK: no reflog for symref changes as there is no OID involved which the reflog needs. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
gix_diff::index::function::diff (cognitive 63) gix-diff/src/index/function.rs:30— gix_diff::index::function::diff has cognitive complexity 63 (threshold 15). Drivers by points: match/switch 10 (35 pts), if/else 11 (23 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 38). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
gix_diff::rewrites::tracker::find_match (cognitive 42) gix-diff/src/rewrites/tracker.rs:684— gix_diff::rewrites::tracker::find_match has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 3 (10 pts), boolean chains 4, loops 2 (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.
gix_diff::tree::function::handle_lhs_and_rhs_with_equal_filenames (cognitive 19) gix-diff/src/tree/function.rs:298— gix_diff::tree::function::handle_lhs_and_rhs_with_equal_filenames has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
HistoryGraph::refresh (cognitive 47) gix-tix/src/history.rs:633— HistoryGraph::refresh has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 8 (13 pts), boolean chains 5 (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.
HistoryGraph::paint_inner (cognitive 41) gix-tix/src/history.rs:559— HistoryGraph::paint_inner has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 4 (5 pts), boolean chains 4, match/switch 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.
HistoryGraph::descendants_in_parent_order (cognitive 20) gix-tix/src/history.rs:307— HistoryGraph::descendants_in_parent_order has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Search::can_match_relative_path (cognitive 38) gix-pathspec/src/search/matching.rs:133— Search::can_match_relative_path has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 6, loops 1 (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.
Search::pattern_matching_relative_path (cognitive 35) gix-pathspec/src/search/matching.rs:27— Search::pattern_matching_relative_path has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 2 (6 pts), boolean chains 3, loops 1 (2 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.
Search::directory_matches_prefix (cognitive 25) gix-pathspec/src/search/matching.rs:195— Search::directory_matches_prefix has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, 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.
gix_dir::walk::classify::resolve_file_type_with_index (cognitive 31) gix-dir/src/walk/classify.rs:357— gix_dir::walk::classify::resolve_file_type_with_index has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 13). Of this number, 27 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix_dir::walk::classify::path (cognitive 30) gix-dir/src/walk/classify.rs:133— gix_dir::walk::classify::path has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 7 (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.
gix_dir::walk::readdir::recursive (cognitive 24) gix-dir/src/walk/readdir.rs:26— gix_dir::walk::readdir::recursive has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MiddleSnakeSearch::found_snake (cognitive 29) gix-imara-diff/src/myers/middle_snake.rs:203— MiddleSnakeSearch::found_snake has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 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.
MiddleSnakeSearch::run (cognitive 26) gix-imara-diff/src/myers/middle_snake.rs:107— MiddleSnakeSearch::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (23 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.
MiddleSnakeSearch::best_position (cognitive 19) gix-imara-diff/src/myers/middle_snake.rs:170— MiddleSnakeSearch::best_position has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, 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.
gix_traverse::tree::depthfirst::function::depthfirst (cognitive 21) gix-traverse/src/tree/depthfirst.rs:39— gix_traverse::tree::depthfirst::function::depthfirst has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (7 pts), loops 2 (4 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.
gix_traverse::commit::topo::iter::collect_parents (cognitive 20) gix-traverse/src/commit/topo/iter.rs:249— gix_traverse::commit::topo::iter::collect_parents has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), match/switch 2 (4 pts) (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
gix_traverse::tree::breadthfirst::function::breadthfirst (cognitive 17) gix-traverse/src/tree/breadthfirst.rs:42— gix_traverse::tree::breadthfirst::function::breadthfirst has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (6 pts), loops 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.
Url::path_query_fragment (cognitive 21) gix-url/src/lib.rs:554— Url::path_query_fragment has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (3 pts) (nesting depth added 8). Of this number, 15 points are the body's own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Url::write_to (cognitive 16) gix-url/src/lib.rs:689— Url::write_to has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, match/switch 1 (2 pts) (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.
Url::write_canonical_form_to (cognitive 16) gix-url/src/lib.rs:734— Url::write_canonical_form_to has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 1). Of this number, 11 points are the body's own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ClassTooLong: App gix-tix/src/app.rs:513— ClassTooLong — 1952 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 176 methods. The bar is 400 significant lines; this is 1552 over it, 4.88× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: HistoryGraph gix-tix/src/history.rs:125— ClassTooLong — 526 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 23 methods, 2 blocks, lines 125-843. The bar is 400 significant lines; this is 126 over it, 1.32× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Tree gix-tix/src/ref_tree.rs:145— ClassTooLong — 492 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 30 methods, 2 blocks, lines 145-791. The bar is 400 significant lines; this is 92 over it, 1.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (9–10 lines × 2) gitoxide-core/src/repository/merge/commit.rs:45— gitoxide-core/src/repository/merge/commit.rs:45-54 | gitoxide-core/src/repository/merge/tree.rs:73-81 — 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) gix-config/src/file/util.rs:18— gix-config/src/file/util.rs:18-27 | gix-config/src/file/util.rs:40-48 — 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) gix-date/src/parse/git.rs:60— gix-date/src/parse/git.rs:60-68 | gix-date/src/parse/git.rs:101-110 — 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.
gix_merge::tree::function::resolve::tree (cyclomatic 192) gix-merge/src/tree/function/resolve.rs:97— gix_merge::tree::function::resolve::tree has cyclomatic complexity 192 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
gix_merge::tree::apply_index_entries::function::apply_index_entries (cyclomatic 22) gix-merge/src/tree/mod.rs:488— gix_merge::tree::apply_index_entries::function::apply_index_entries has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Tree::handle_key (cyclomatic 41) gix-tix/src/ref_tree.rs:271— Tree::handle_key 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.
Tree::draw (cyclomatic 16) gix-tix/src/ref_tree.rs:400— Tree::draw 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.
gix_blame::file::function::file (cyclomatic 40) gix-blame/src/file/function.rs:68— gix_blame::file::function::file 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.
gix_blame::file::process_change (cyclomatic 27) gix-blame/src/file/mod.rs:17— gix_blame::file::process_change has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Pipeline::convert_to_diffable (cyclomatic 38) gix-diff/src/blob/pipeline.rs:190— Pipeline::convert_to_diffable 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.
Pipeline::convert_to_mergeable (cyclomatic 19) gix-merge/src/blob/pipeline.rs:139— Pipeline::convert_to_mergeable 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.
gix_diff::index::function::diff (cyclomatic 27) gix-diff/src/index/function.rs:30— gix_diff::index::function::diff has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
gix_diff::rewrites::tracker::find_match (cyclomatic 21) gix-diff/src/rewrites/tracker.rs:684— gix_diff::rewrites::tracker::find_match 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.
ParsedUrl::parse_host_port (cyclomatic 27) gix-url/src/simple_url.rs:202— ParsedUrl::parse_host_port 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.
ParsedUrl::parse (cyclomatic 16) gix-url/src/simple_url.rs:110— ParsedUrl::parse 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.
HistoryGraph::refresh (cyclomatic 26) gix-tix/src/history.rs:633— HistoryGraph::refresh 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.
HistoryGraph::paint_inner (cyclomatic 21) gix-tix/src/history.rs:559— HistoryGraph::paint_inner 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.
Remote::default (cyclomatic 26) gix-transport/src/client/blocking_io/http/reqwest/remote.rs:38— Remote::default 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.
Remote::save_to (cyclomatic 19) gix/src/remote/save.rs:13— Remote::save_to 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.
Repository::try_find_remote_inner (cyclomatic 21) gix/src/repository/remote.rs:182— Repository::try_find_remote_inner has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Repository::add_worktree (cyclomatic 18) gix/src/worktree/add.rs:88— Repository::add_worktree 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.
gix_discover::upwards::function::discover_opts (cyclomatic 21) gix-discover/src/upwards/mod.rs:205— gix_discover::upwards::function::discover_opts 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.
gix_discover::is::git_with_metadata (cyclomatic 20) gix-discover/src/is.rs:43— gix_discover::is::git_with_metadata 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.
Handle::try_find_cached_inner (cyclomatic 20) gix-odb/src/store_impls/dynamic/find.rs:51— Handle::try_find_cached_inner 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.
Handle::try_header_inner (cyclomatic 20) gix-odb/src/store_impls/dynamic/header.rs:20— Handle::try_header_inner 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.
Search::pattern_matching_relative_path (cyclomatic 20) gix-pathspec/src/search/matching.rs:27— Search::pattern_matching_relative_path 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.
Search::can_match_relative_path (cyclomatic 19) gix-pathspec/src/search/matching.rs:133— Search::can_match_relative_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.
gix_pack::data::output::count::objects::expand::this (cyclomatic 19) gix-pack/src/data/output/count/objects/mod.rs:139— gix_pack::data::output::count::objects::expand::this has cyclomatic complexity 19 (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.
gix_pack::cache::delta::traverse::resolve::resolve_parallel (cyclomatic 17) gix-pack/src/cache/delta/traverse/resolve.rs:269— gix_pack::cache::delta::traverse::resolve::resolve_parallel 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.
gix_revision::describe::function::describe (cyclomatic 18) gix-revision/src/describe.rs:148— gix_revision::describe::function::describe 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.
gix_revision::merge_base::function::remove_redundant (cyclomatic 17) gix-revision/src/merge_base/function.rs:46— gix_revision::merge_base::function::remove_redundant 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.
gix_protocol::fetch::function::fetch (cyclomatic 17) gix-protocol/src/fetch/function.rs:40— gix_protocol::fetch::function::fetch has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
gix_protocol::fetch::negotiate::mark_complete_and_common_ref (cyclomatic 17) gix-protocol/src/fetch/negotiate.rs:102— gix_protocol::fetch::negotiate::mark_complete_and_common_ref 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.
Repeated repair: gix-fs/src/lib.rs gix-fs/src/lib.rs:143— gix-fs/src/lib.rs 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 8 (its worst body is gix_fs::adjust_shared_repository_permissions at line 143), 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(gix-fs)!: apply Git's shared permissions for files and directories”; “fix(gix)!: preserve causes across fallible conversions”; “fix(gix-fs): revalidate cached terminal entries before reusing them”. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-fs/src/lib.rs`: 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: gix-command/src/lib.rs gix-command/src/lib.rs:159— gix-command/src/lib.rs 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 6 (its worst body is gix_command::win_path_lookup at line 159), 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(gix-command): safely split commands and ignore shebang options”; “fix(gix-command): invoke existing absolute paths directly”; “fix: use onfigured shell arguments in gix-command”. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 18:44:01 +02:00' --until='2026-09-28 18:44:01 +02:00' --full-history --no-merges -- gix-command/src/lib.rs`: 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.
gix_blame::file::function::file (cognitive 105) gix-blame/src/file/function.rs:68— gix_blame::file::function::file has cognitive complexity 105 (threshold 15). Drivers by points: if/else 29 (83 pts), loops 6 (16 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 66). 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.
gix_blame::file::process_change (cognitive 38) gix-blame/src/file/mod.rs:17— gix_blame::file::process_change has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 8 (18 pts), boolean chains 1 (nesting depth added 18). Of this number, 37 points are the body's own statements and 1 belongs to one function item inside it that branches. The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Editor::upsert_or_remove_at_pathbuf (cognitive 65) gix-object/src/tree/editor.rs:272— Editor::upsert_or_remove_at_pathbuf has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (45 pts), match/switch 5 (16 pts), boolean chains 3, loops 1 (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.
Editor::write_at_pathbuf (cognitive 37) gix-object/src/tree/editor.rs:185— Editor::write_at_pathbuf has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 3 (14 pts), loops 2 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ParsedUrl::parse_host_port (cognitive 53) gix-url/src/simple_url.rs:202— ParsedUrl::parse_host_port has cognitive complexity 53 (threshold 15). Drivers by points: if/else 24 (45 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ParsedUrl::parse (cognitive 24) gix-url/src/simple_url.rs:110— ParsedUrl::parse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 3 (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.
gix_status::index_as_worktree_with_renames::function::index_as_worktree_with_renames (cognitive 49) gix-status/src/index_as_worktree_with_renames/mod.rs:48— gix_status::index_as_worktree_with_renames::function::index_as_worktree_with_renames has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 5 (12 pts), match/switch 6 (11 pts) (nesting depth added 26). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
gix_status::fscache::windows::directory_entries (cognitive 30) gix-status/src/fscache.rs:315— gix_status::fscache::windows::directory_entries has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (7 pts), match/switch 1 (5 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.
Remote::default (cognitive 45) gix-transport/src/client/blocking_io/http/reqwest/remote.rs:38— Remote::default has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 5 (10 pts), boolean chains 3, 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.
Remote::save_to (cognitive 31) gix/src/remote/save.rs:13— Remote::save_to has cognitive complexity 31 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 9 (13 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 12). 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.
gix_revision::merge_base::function::remove_redundant (cognitive 44) gix-revision/src/merge_base/function.rs:46— gix_revision::merge_base::function::remove_redundant has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 6 (14 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.
gix_revision::describe::function::describe (cognitive 34) gix-revision/src/describe.rs:148— gix_revision::describe::function::describe has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 3 (6 pts), match/switch 1 (4 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.
WithSidebands::poll_fill_buf (cognitive 43) gix-packetline/src/async_io/sidebands.rs:242— WithSidebands::poll_fill_buf has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 6 (22 pts), if/else 4 (19 pts), loops 1 (2 pts) (nesting depth added 32). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
WithSidebands::fill_buf (cognitive 32) gix-packetline/src/blocking_io/sidebands.rs:137— WithSidebands::fill_buf has cognitive complexity 32 (threshold 15). Drivers by points: if/else 4 (16 pts), match/switch 4 (14 pts), loops 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Engine::perform_run (cognitive 42) gitoxide-core/src/corpus/engine.rs:70— Engine::perform_run has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 4 (12 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Engine::run (cognitive 24) gitoxide-core/src/query/engine/command.rs:13— Engine::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
gix_discover::upwards::function::discover_opts (cognitive 41) gix-discover/src/upwards/mod.rs:205— gix_discover::upwards::function::discover_opts has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (33 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gix_discover::is::git_with_metadata (cognitive 24) gix-discover/src/is.rs:43— gix_discover::is::git_with_metadata has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 4 (6 pts), boolean chains 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, 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.
gix_worktree::remove::remove_root_with_after_scan (cognitive 40) gix-worktree/src/remove.rs:190— gix_worktree::remove::remove_root_with_after_scan has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (22 pts), match/switch 3 (11 pts), loops 3 (5 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.
gix_worktree::stack::delegate::create_leading_directory (cognitive 16) gix-worktree/src/stack/delegate.rs:164— gix_worktree::stack::delegate::create_leading_directory has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (3 pts), boolean chains 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.
Iter::next (cognitive 30) gix-fs/src/dir/create.rs:151— Iter::next has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (20 pts), match/switch 4 (10 pts) (nesting depth added 21). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Iter::next (cognitive 20) gix/src/status/iter/mod.rs:230— Iter::next has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Vec::for_each_set_bit (cognitive 29) gix-bitmap/src/ewah.rs:96— Vec::for_each_set_bit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (9 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.
Vec::extend_with_splits_of_symbolic_refs (cognitive 17) gix-ref/src/transaction/ext.rs:56— Vec::extend_with_splits_of_symbolic_refs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 1 (4 pts), loops 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.
gix_path::realpath::function::realpath_opts (cognitive 28) gix-path/src/realpath.rs:38— gix_path::realpath::function::realpath_opts has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 2, match/switch 1 (2 pts), 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.
gix_path::convert::normalize_inner (cognitive 19) gix-path/src/convert.rs:263— gix_path::convert::normalize_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (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.
Simple::next_by_topology (cognitive 27) gix-traverse/src/commit/simple.rs:600— Simple::next_by_topology has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (7 pts), match/switch 2 (6 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.
Simple::next_by_commit_date (cognitive 20) gix-traverse/src/commit/simple.rs:512— Simple::next_by_commit_date has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 3 (8 pts), loops 3 (7 pts), if/else 2 (5 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.
Tracker::emit (cognitive 21) gix-diff/src/rewrites/tracker.rs:201— Tracker::emit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 pts), boolean chains 3, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Tracker::match_pairs (cognitive 20) gix-diff/src/rewrites/tracker.rs:406— Tracker::match_pairs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TreeNodes::track_change (cognitive 21) gix-merge/src/tree/utils.rs:519— TreeNodes::track_change has cognitive complexity 21 (threshold 15). Drivers by points: if/else 2 (9 pts), match/switch 2 (5 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TreeNodes::check_conflict (cognitive 18) gix-merge/src/tree/utils.rs:571— TreeNodes::check_conflict has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Pattern::normalize (cognitive 21) gix-pathspec/src/pattern.rs:46— Pattern::normalize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 6). Of this number, 18 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Pattern::to_bstring (cognitive 19) gix-pathspec/src/pattern.rs:160— Pattern::to_bstring has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (3 pts), match/switch 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.
gix_date::parse::function::parse (cognitive 18) gix-date/src/parse/function.rs:105— gix_date::parse::function::parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
gix_date::parse::git::split_time_and_offset (cognitive 16) gix-date/src/parse/git.rs:155— gix_date::parse::git::split_time_and_offset has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, 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.
D30 · Dependency Vulnerabilities· Medium advisory (unmaintained) · ×2
REDACTED
REDACTED
D30 · Dependency Vulnerabilities· Medium advisory (unsound) · ×2
Change coupling: ref_iter.rs ↔ ref_iter.rs gix-object/src/tag/ref_iter.rs— `gix-object/src/tag/ref_iter.rs` and `gix-object/src/tree/ref_iter.rs` change together 62% of the time (10 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `3cd3e2a7` Resolve Winnow deprecations; `58252501` Refactor Errors to track remaining Input; `be1f4b5d` Remove From<winnow> for (small) step towards stable API — run `git show` on any of them.
Change coupling: cascade.rs ↔ serde.rs gix-credentials/src/helper/cascade.rs— `gix-credentials/src/helper/cascade.rs` and `gix-credentials/src/protocol/context/serde.rs` change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `d0360639` change(gix-credentials)!: migrate errors to gix-error; `7496ef16` feat(gix-credentials)!: support HTTP challenges in credential context…; `7d66c9fc` fix!: make `protect_protocol` part of `Context` so it's self-contained. — run `git show` on any of them.
Duplicated block (27 lines × 2) gix-merge/src/tree/function/resolve.rs:866— gix-merge/src/tree/function/resolve.rs:866-892 | gix-merge/src/tree/function/resolve.rs:1923-1949 — 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 (27 lines × 2) gix-tix/src/history.rs:687— gix-tix/src/history.rs:687-713 | gix-tix/src/history.rs:736-762 — 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) gitoxide-core/src/commitgraph/verify.rs:45— gitoxide-core/src/commitgraph/verify.rs:45-58 | gitoxide-core/src/repository/commitgraph/verify.rs:34-47 — 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 (14 lines × 2) gix-object/src/commit/ref_iter.rs:253— gix-object/src/commit/ref_iter.rs:253-266 | gix-object/src/tag/ref_iter.rs:127-140 — 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.
AC3 · Page structure· Page without a main landmark · ×1
Page without a main landmark etc/speak/gitmerge-2024.marp.html:1— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Low contrast colour pair in CSS (3.3:1) etc/speak/gitmerge-2024.marp.html:1— `div#\:\$p>svg>foreignObject>section` sets color: #333 on background-color: #0288d1 — 3.3:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet — editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from).
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.
App::update (cyclomatic 165) gix-tix/src/app.rs:1575— App::update has cyclomatic complexity 165 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
gitoxide::plumbing::main::main (cyclomatic 122) src/plumbing/main.rs:57— gitoxide::plumbing::main::main has cyclomatic complexity 122 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
gix_glob::wildmatch::function::match_recursive (cyclomatic 106) gix-glob/src/wildmatch.rs:55— gix_glob::wildmatch::function::match_recursive has cyclomatic complexity 106 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ThreadSafeRepository::open_from_paths (cyclomatic 46) gix/src/open/repository.rs:166— ThreadSafeRepository::open_from_paths 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.
gix_transport::client::blocking_io::http::curl::remote::new (cyclomatic 37) gix-transport/src/client/blocking_io/http/curl/remote.rs:408— gix_transport::client::blocking_io::http::curl::remote::new has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Store::consolidate_with_disk_state (cyclomatic 34) gix-odb/src/store_impls/dynamic/load_index.rs:168— Store::consolidate_with_disk_state 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.
PrepareFetch::fetch_only (cyclomatic 29) gix/src/clone/fetch/mod.rs:28— PrepareFetch::fetch_only 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.
Mark::try_collapse (cyclomatic 29) gix-dir/src/walk/readdir.rs:289— Mark::try_collapse 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.
Overview::new (cyclomatic 28) gix-tix/src/ref_tree.rs:872— Overview::new has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Merge::run (cyclomatic 26) gix-merge/src/blob/builtin_driver/text/function.rs:55— Merge::run 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.
Cascade::invoke (cyclomatic 25) gix-credentials/src/helper/cascade.rs:79— Cascade::invoke 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.
Editor::upsert_or_remove_at_pathbuf (cyclomatic 24) gix-object/src/tree/editor.rs:272— Editor::upsert_or_remove_at_pathbuf 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.
Configuration::at_path (cyclomatic 23) gix-filter/src/pipeline/util.rs:26— Configuration::at_path has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 4 function items inside it that branch (extract_encoding, extract_crlf, extract_eol, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
Response::from_line_reader (cyclomatic 23) gix-protocol/src/fetch/response/io.rs:51— Response::from_line_reader 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.
gix_refspec::parse::function::parse (cyclomatic 23) gix-refspec/src/parse.rs:19— gix_refspec::parse::function::parse has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
State::compute_status (cyclomatic 23) gix-status/src/index_as_worktree/function.rs:371— State::compute_status has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Command::from (cyclomatic 22) gix-command/src/prepare.rs:179— Command::from 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.
gix_dir::walk::classify::path (cyclomatic 22) gix-dir/src/walk/classify.rs:133— gix_dir::walk::classify::path 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.
gix_filter::eol::convert_to_git::function::convert_to_git (cyclomatic 22) gix-filter/src/eol/convert_to_git.rs:55— gix_filter::eol::convert_to_git::function::convert_to_git 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.
gix_url::parse::url (cyclomatic 22) gix-url/src/parse.rs:117— gix_url::parse::url 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.
gix_status::index_as_worktree_with_renames::function::index_as_worktree_with_renames (cyclomatic 21) gix-status/src/index_as_worktree_with_renames/mod.rs:48— gix_status::index_as_worktree_with_renames::function::index_as_worktree_with_renames 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.
gix_command::parse::parse_words (cyclomatic 20) gix-command/src/parse.rs:106— gix_command::parse::parse_words has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Attribute::fmt (cyclomatic 20) gix-config-value/src/color.rs:338— Attribute::fmt has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
gix_utils::str::precompose_impl (cyclomatic 20) gix-utils/src/str.rs:13— gix_utils::str::precompose_impl has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body's own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Stack::make_relative_path_current (cyclomatic 19) gix-fs/src/stack.rs:138— Stack::make_relative_path_current 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.
File::resolve_deltas (cyclomatic 19) gix-pack/src/data/file/decode/entry.rs:231— File::resolve_deltas 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.
Collection::try_from_file (cyclomatic 18) gitoxide-core/src/index/information.rs:80— Collection::try_from_file 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.
LineWriter::poll_write (cyclomatic 18) gix-packetline/src/async_io/encode.rs:54— LineWriter::poll_write 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.
gix_worktree::remove::remove_root_with_after_scan (cyclomatic 18) gix-worktree/src/remove.rs:190— gix_worktree::remove::remove_root_with_after_scan 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.
Mode::change_to_match_fs_with_values (cyclomatic 17) gix-index/src/entry/mode.rs:76— Mode::change_to_match_fs_with_values 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.
WorktreeWatchRefresh::observe (cyclomatic 17) gix-tix/src/lib.rs:156— WorktreeWatchRefresh::observe 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. This is NOT this file's highest cyclomatic complexity: gix_tix::action_with_shortcut_groups (cyclomatic 79) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
gix_quote::ansi_c::undo (cyclomatic 17) gix-quote/src/ansi_c.rs:56— gix_quote::ansi_c::undo has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
gix_date::parse::function::parse (cyclomatic 16) gix-date/src/parse/function.rs:105— gix_date::parse::function::parse 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.
Myers::split (cyclomatic 16) gix-imara-diff/src/myers.rs:113— Myers::split 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.
gix_path::realpath::function::realpath_opts (cyclomatic 16) gix-path/src/realpath.rs:38— gix_path::realpath::function::realpath_opts 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.
LooseThenPacked::next (cyclomatic 16) gix-ref/src/store/file/overlay_iter.rs:105— LooseThenPacked::next has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body's own statements and 8 belong to 2 function items inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
CompressedHistory::new (cyclomatic 16) gix-tix/src/app.rs:3447— CompressedHistory::new has cyclomatic complexity 16 (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.
Prepared::finish (cyclomatic 16) gix-tix/src/edit/rebase.rs:2182— Prepared::finish 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.
FixmeComment gix-pack/src/data/file/decode/entry.rs:457— // FIXME(Performance) If delta-chains are uneven, we know we will have to copy bytes over here — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
gix_glob::wildmatch::function::match_recursive (cognitive 335) gix-glob/src/wildmatch.rs:55— gix_glob::wildmatch::function::match_recursive has cognitive complexity 335 (threshold 15). Drivers by points: if/else 58 (233 pts), match/switch 14 (51 pts), loops 7 (29 pts), boolean chains 22 (nesting depth added 234). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gitoxide::plumbing::main::main (cognitive 171) src/plumbing/main.rs:57— gitoxide::plumbing::main::main has cognitive complexity 171 (threshold 15). Drivers by points: match/switch 39 (90 pts), if/else 37 (79 pts), boolean chains 2 (nesting depth added 93). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
gix_transport::client::blocking_io::http::curl::remote::new (cognitive 73) gix-transport/src/client/blocking_io/http/curl/remote.rs:408— gix_transport::client::blocking_io::http::curl::remote::new has cognitive complexity 73 (threshold 15). Drivers by points: if/else 27 (57 pts), match/switch 4 (10 pts), boolean chains 3, loops 2 (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.
ThreadSafeRepository::open_from_paths (cognitive 72) gix/src/open/repository.rs:166— ThreadSafeRepository::open_from_paths has cognitive complexity 72 (threshold 15). Drivers by points: if/else 26 (47 pts), boolean chains 12, match/switch 7 (11 pts), loops 1 (2 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.
Merge::run (cognitive 56) gix-merge/src/blob/builtin_driver/text/function.rs:55— Merge::run has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (40 pts), match/switch 6 (13 pts), boolean chains 2, 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.
Cascade::invoke (cognitive 51) gix-credentials/src/helper/cascade.rs:79— Cascade::invoke has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (40 pts), loops 2 (5 pts), boolean chains 4, match/switch 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.
Command::from (cognitive 50) gix-command/src/prepare.rs:179— Command::from has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (44 pts), match/switch 2 (5 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.
LineWriter::poll_write (cognitive 45) gix-packetline/src/async_io/encode.rs:54— LineWriter::poll_write has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 5 (13 pts), match/switch 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PrepareFetch::fetch_only (cognitive 43) gix/src/clone/fetch/mod.rs:28— PrepareFetch::fetch_only has cognitive complexity 43 (threshold 15). Drivers by points: if/else 23 (31 pts), match/switch 4 (8 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Overview::new (cognitive 42) gix-tix/src/ref_tree.rs:872— Overview::new has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 12 (15 pts), boolean chains 4 (nesting depth added 15). Of this number, 40 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Response::from_line_reader (cognitive 41) gix-protocol/src/fetch/response/io.rs:51— Response::from_line_reader has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (25 pts), match/switch 4 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 27). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Mark::try_collapse (cognitive 36) gix-dir/src/walk/readdir.rs:289— Mark::try_collapse has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 9, match/switch 2 (4 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.
gix_filter::eol::convert_to_git::function::convert_to_git (cognitive 34) gix-filter/src/eol/convert_to_git.rs:55— gix_filter::eol::convert_to_git::function::convert_to_git has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 5, match/switch 2 (4 pts), loops 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.
LookupRefDeltaObjectsIter::next (cognitive 34) gix-pack/src/data/input/lookup_ref_delta_objects.rs:85— LookupRefDeltaObjectsIter::next has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 6 (20 pts), if/else 5 (14 pts) (nesting depth added 23). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Myers::split (cognitive 33) gix-imara-diff/src/myers.rs:113— Myers::split has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 2 (5 pts), boolean chains 3, 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.
LcsSearch::update_lcs (cognitive 32) gix-imara-diff/src/histogram/lcs.rs:63— LcsSearch::update_lcs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 4 (7 pts), boolean chains 2 (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.
gix_url::parse::url (cognitive 30) gix-url/src/parse.rs:117— gix_url::parse::url has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 10 (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.
gix_worktree_state::checkout::chunk::process_delayed_filter_results (cognitive 30) gix-worktree-state/src/checkout/chunk.rs:158— gix_worktree_state::checkout::chunk::process_delayed_filter_results has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 2 (8 pts), loops 3 (6 pts), boolean chains 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.
gix_utils::str::precompose_impl (cognitive 29) gix-utils/src/str.rs:13— gix_utils::str::precompose_impl has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 7, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 7). Of this number, 22 points are the body's own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Reverse::next (cognitive 28) gix-ref/src/store/file/log/iter.rs:107— Reverse::next has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 2 (3 pts) (nesting depth added 16). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
gix_command::parse::parse_words (cognitive 27) gix-command/src/parse.rs:106— gix_command::parse::parse_words has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 5 (16 pts), if/else 5 (10 pts), loops 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
gix_features::parallel::in_parallel::in_parallel_with_slice (cognitive 27) gix-features/src/parallel/in_parallel.rs:195— gix_features::parallel::in_parallel::in_parallel_with_slice has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (6 pts), match/switch 2 (4 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.
Configuration::at_path (cognitive 27) gix-filter/src/pipeline/util.rs:26— Configuration::at_path has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 7 (11 pts) (nesting depth added 8). Most of this is not in the body itself: 8 of the 27 points are its own statements and the rest belongs to 4 function items inside it that branch (extract_encoding, extract_crlf, extract_eol, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
Stack::make_relative_path_current (cognitive 27) gix-fs/src/stack.rs:138— Stack::make_relative_path_current has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, loops 3, match/switch 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.
Handler::header (cognitive 27) gix-transport/src/client/blocking_io/http/curl/remote.rs:317— Handler::header has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (25 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.
gix_macros::momo::convert (cognitive 26) gix-macros/src/momo.rs:167— gix_macros::momo::convert has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 14). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
gix_refspec::parse::function::parse (cognitive 26) gix-refspec/src/parse.rs:19— gix_refspec::parse::function::parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 8 (11 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.
CompressedHistory::new (cognitive 26) gix-tix/src/app.rs:3447— CompressedHistory::new has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 6 (8 pts), boolean chains 3, match/switch 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.
Postprocessor::run (cognitive 25) gix-imara-diff/src/postprocess.rs:75— Postprocessor::run has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 5 (10 pts) (nesting depth added 14). 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.
Link::dissolve_into (cognitive 25) gix-index/src/extension/link.rs:46— Link::dissolve_into has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (6 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.
Prepared::finish (cognitive 24) gix-tix/src/edit/rebase.rs:2182— Prepared::finish has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (6 pts), boolean chains 5 (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.
Parents::next (cognitive 23) gix-commitgraph/src/file/commit.rs:128— Parents::next has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 5 (11 pts) (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Capabilities::probe_ignore_case (cognitive 22) gix-fs/src/capabilities.rs:114— Capabilities::probe_ignore_case has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (7 pts), loops 2 (5 pts) (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
EntryMode::extract_from_bytes (cognitive 22) gix-object/src/tree/mod.rs:121— EntryMode::extract_from_bytes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WorktreeWatchRefresh::observe (cognitive 22) gix-tix/src/lib.rs:156— WorktreeWatchRefresh::observe has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (7 pts), boolean chains 2, match/switch 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.
gix_error::exn::impls::write_error_node_recursive (cognitive 21) gix-error/src/exn/impls.rs:348— gix_error::exn::impls::write_error_node_recursive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ReadFilterOutput::read (cognitive 21) gix-filter/src/driver/apply.rs:342— ReadFilterOutput::read has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 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.
Indents::score (cognitive 21) gix-imara-diff/src/slider_heuristic.rs:258— Indents::score has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, match/switch 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.
SortedLoosePaths::next (cognitive 21) gix-ref/src/store/file/loose/iter.rs:49— SortedLoosePaths::next has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LaneState::advance_ids (cognitive 21) gix-tix/src/app.rs:3767— LaneState::advance_ids has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (6 pts), match/switch 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.
Graph::verify_integrity (cognitive 20) gix-commitgraph/src/verify.rs:34— Graph::verify_integrity has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Lines::next (cognitive 20) gix-ignore/src/parse.rs:30— Lines::next has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MatchGroup::match_lhs (cognitive 19) gix-refspec/src/match_group/mod.rs:39— MatchGroup::match_lhs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), match/switch 2 (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.
LooseThenPacked::next (cognitive 18) gix-ref/src/store/file/overlay_iter.rs:105— LooseThenPacked::next has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 2 (3 pts), loops 1 (nesting depth added 8). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (peek_loose, advance_to_non_private). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
gix_object::commit::message::summary (cognitive 17) gix-object/src/commit/message/mod.rs:92— gix_object::commit::message::summary has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Source::storage_location (cognitive 16) gix-config/src/source.rs:61— Source::storage_location has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 4 (7 pts) (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Name::from_str (cognitive 16) gix-config-value/src/color.rs:234— Name::from_str has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Stats::from_bytes (cognitive 16) gix-filter/src/eol/utils.rs:46— Stats::from_bytes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Stat::matches (cognitive 16) gix-index/src/entry/stat.rs:38— Stat::matches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (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.
FullNameRef::category_and_short_name (cognitive 16) gix-ref/src/fullname.rs:111— FullNameRef::category_and_short_name has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), 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.
D22 · Internal API Consistency· Duplicate output configuration properties with different types. `output_format` uses the generic `OutputFormat` enum, while `format` uses a domain-specific `Format` enum. This forces users to choose between a generic and a specific formatter for the same operation, creating confusion about which one takes precedence or if they are redundant. · ×1
Duplicate output configuration properties with different types. `output_format` uses the generic `OutputFormat` enum, while `format` uses a domain-specific `Format` enum. This forces users to choose between a generic and a specific formatter for the same operation, creating confusion about which one takes precedence or if they are redundant. — Remove `output_format` and rely solely on the domain-specific `Format` enum, or vice versa, to ensure a single source of truth for output styling in the status module. (signatures: gitoxide_core.repository.status.Options.output_format: OutputFormat | gitoxide_core.repository.status.Options.format: Format)
D22 · Internal API Consistency· Duplicate output configuration properties with different types. Similar to the status module, `revision.list` exposes both `format` (generic `OutputFormat`) and `text` (specific `Format`). This inconsistency across modules suggests a lack of unified design for how output formatting is handled in context objects versus options structs. · ×1
Duplicate output configuration properties with different types. Similar to the status module, `revision.list` exposes both `format` (generic `OutputFormat`) and `text` (specific `Format`). This inconsistency across modules suggests a lack of unified design for how output formatting is handled in context objects versus options structs. — Standardize on a single property name and type for output formatting across all context/options structs. Given `Format` is more specific, consider unifying all to use `Format` or a unified `OutputStyle` trait. (signatures: gitoxide_core.repository.revision.list.Context.format: OutputFormat | gitoxide_core.repository.revision.list.Context.text: Format)
D22 · Internal API Consistency· Misleading property naming. `index_worktree_renames` is typed as `ProgressItem`, which typically denotes a progress bar or counter, not a boolean flag or configuration option. This suggests a copy-paste error or misuse of the `ProgressItem` type for a control flag, confusing the API consumer about the property's intent. · ×1
Misleading property naming. `index_worktree_renames` is typed as `ProgressItem`, which typically denotes a progress bar or counter, not a boolean flag or configuration option. This suggests a copy-paste error or misuse of the `ProgressItem` type for a control flag, confusing the API consumer about the property's intent. — Change the type of `index_worktree_renames` to `bool` if it is a toggle, or rename it to `index_worktree_renames_progress` if it genuinely tracks progress (though unlikely for a configuration option). (signatures: gitoxide_core.repository.status.Options.thread_limit: ProgressItem | gitoxide_core.repository.status.Options.index_worktree_renames: ProgressItem)
D22 · Internal API Consistency· Inconsistent use of `ProgressItem` for configuration vs. state. In `clone.Options`, `revision` is a `ProgressItem`, which is semantically incorrect as a revision is a string/identifier, not a progress metric. In `fetch.Options`, `open_negotiation_graph` is also a `ProgressItem`, which is similarly confusing. These should likely be `String` or a specific `Revision` type, not progress tracking types. · ×1
Inconsistent use of `ProgressItem` for configuration vs. state. In `clone.Options`, `revision` is a `ProgressItem`, which is semantically incorrect as a revision is a string/identifier, not a progress metric. In `fetch.Options`, `open_negotiation_graph` is also a `ProgressItem`, which is similarly confusing. These should likely be `String` or a specific `Revision` type, not progress tracking types. — Change the type of `revision` in `clone.Options` to `String` or `PartialName`. Investigate `open_negotiation_graph` to ensure it is not misusing `ProgressItem` for a boolean or path. (signatures: gitoxide_core.repository.clone.Options.revision: ProgressItem | gitoxide_core.repository.fetch.Options.open_negotiation_graph: ProgressItem)
TooManyFields: App gix-tix/src/app.rs:513— TooManyFields — 102 stored fields beside 176 methods. The bar is 30 stored fields; this is 72 over it, 3.40× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
Change-coupling hub: body.rs → decode.rs, parse.rs, ref_iter.rs gix-object/src/commit/message/body.rs— `gix-object/src/commit/message/body.rs` changes together with 3 other files — `gix-object/src/commit/message/decode.rs`, `gix-object/src/parse.rs`, `gix-object/src/tree/ref_iter.rs` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
Duplicated block (22–27 lines × 2) gix-merge/src/tree/function/resolve.rs:849— gix-merge/src/tree/function/resolve.rs:849-870 | gix-merge/src/tree/function/resolve.rs:1306-1332 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (25 lines × 2) gitoxide-core/src/repository/fetch.rs:293— gitoxide-core/src/repository/fetch.rs:293-317 | gitoxide-core/src/repository/remote.rs:217-241 — 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 (22–23 lines × 2) gix-merge/src/tree/function/resolve.rs:704— gix-merge/src/tree/function/resolve.rs:704-725 | gix-merge/src/tree/function/resolve.rs:1524-1546 — 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 (22 lines × 2) gix-merge/src/tree/function/resolve.rs:1406— gix-merge/src/tree/function/resolve.rs:1406-1427 | gix-merge/src/tree/function/resolve.rs:1794-1815 — 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 × 4) gix-merge/src/tree/function/resolve.rs:681— gix-merge/src/tree/function/resolve.rs:681-700 | gix-merge/src/tree/function/resolve.rs:742-761 | gix-merge/src/tree/function/resolve.rs:1154-1173 | gix-merge/src/tree/function/resolve.rs:1501-1520 — 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 (16–20 lines × 2) gix-blame/src/file/mod.rs:133— gix-blame/src/file/mod.rs:133-152 | gix-blame/src/file/mod.rs:181-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 (19–20 lines × 2) gix-packetline/src/async_io/read.rs:135— gix-packetline/src/async_io/read.rs:135-154 | gix-packetline/src/blocking_io/read.rs:134-152 — `gix-packetline/src/async_io/read.rs` and `gix-packetline/src/blocking_io/read.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 55 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (20 lines × 2) gix-tix/src/history.rs:770— gix-tix/src/history.rs:770-789 | gix-tix/src/history.rs:1158-1177 — 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–19 lines × 2) gix-merge/src/blob/builtin_driver/text/utils.rs:194— gix-merge/src/blob/builtin_driver/text/utils.rs:194-211 | gix-merge/src/blob/builtin_driver/text/utils.rs:234-252 — 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) gix-utils/src/btoi.rs:117— gix-utils/src/btoi.rs:117-135 | gix-utils/src/btoi.rs:235-253 — 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–18 lines × 2) gix-merge/src/tree/function/resolve.rs:800— gix-merge/src/tree/function/resolve.rs:800-817 | gix-merge/src/tree/function/resolve.rs:1832-1848 — 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) gix-date/src/parse/git.rs:69— gix-date/src/parse/git.rs:69-85 | gix-date/src/parse/git.rs:123-139 — 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) gix-diff/src/index/function.rs:231— gix-diff/src/index/function.rs:231-246 | gix-diff/src/index/function.rs:258-273 — 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–15 lines × 2) gix-merge/src/blob/pipeline.rs:204— gix-merge/src/blob/pipeline.rs:204-218 | gix-merge/src/blob/pipeline.rs:289-301 — 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–14 lines × 2) gix-packetline/src/async_io/read.rs:167— gix-packetline/src/async_io/read.rs:167-180 | gix-packetline/src/blocking_io/read.rs:165-177 — `gix-packetline/src/async_io/read.rs` and `gix-packetline/src/blocking_io/read.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 55 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (12–13 lines × 2) gix-blame/src/file/function.rs:969— gix-blame/src/file/function.rs:969-981 | gix-blame/src/file/function.rs:1000-1011 — 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–11 lines × 2) gix-object/src/parse.rs:23— gix-object/src/parse.rs:23-33 | gix-object/src/parse.rs:93-102 — 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–11 lines × 2) gix-transport/src/client/git/async_io.rs:86— gix-transport/src/client/git/async_io.rs:86-96 | gix-transport/src/client/git/blocking_io.rs:83-91 — before extracting anything, compare `gix-transport/src/client/git/async_io.rs` and `gix-transport/src/client/git/blocking_io.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 3) gix-merge/src/tree/function/resolve.rs:702— gix-merge/src/tree/function/resolve.rs:702-711 | gix-merge/src/tree/function/resolve.rs:762-771 | gix-merge/src/tree/function/resolve.rs:1522-1531 — 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 (9 lines × 3) gix-tix/src/app.rs:1865— gix-tix/src/app.rs:1865-1873 | gix-tix/src/app.rs:1891-1899 | gix-tix/src/app.rs:1905-1913 — 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 × 2) gix-pack/src/index/access.rs:229— gix-pack/src/index/access.rs:229-237 | gix-pack/src/index/access.rs:290-297 — 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–9 lines × 2) gix-refspec/src/match_group/mod.rs:68— gix-refspec/src/match_group/mod.rs:68-76 | gix-refspec/src/match_group/mod.rs: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 (8 lines × 3) gix-tix/src/history.rs:193— gix-tix/src/history.rs:193-200 | gix-tix/src/history.rs:644-651 | gix-tix/src/history.rs:1039-1046 — 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) gix-blame/src/file/function.rs:585— gix-blame/src/file/function.rs:585-592 | gix-blame/src/file/function.rs:595-602 | gix-blame/src/file/function.rs:874-880 — 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 (5 lines × 4) gix-worktree/src/stack/state/attributes.rs:107— gix-worktree/src/stack/state/attributes.rs:107-111 | gix-worktree/src/stack/state/attributes.rs:146-150 | gix-worktree/src/stack/state/ignore.rs:181-185 | gix-worktree/src/stack/state/ignore.rs:210-214 — 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.
Duplicated block (184 lines × 2) gix/src/open/permissions.rs:37— gix/src/open/permissions.rs:37-229 | gix/src/repository/permissions.rs:36-219 — 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 × 5) gitoxide-core/src/repository/tree.rs:53— gitoxide-core/src/repository/tree.rs:53-59 | gix-diff/src/tree/recorder.rs:82-88 | gix-index/src/init.rs:198-204 | gix-traverse/src/tree/recorder.rs:56-62 | gix-worktree-stream/src/from_tree/traverse.rs:39-45 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times.
Duplicated block (9 lines × 4) gitoxide-core/src/repository/tree.rs:61— gitoxide-core/src/repository/tree.rs:61-69 | gix-diff/src/tree/recorder.rs:90-98 | gix-traverse/src/tree/recorder.rs:64-72 | gix-worktree-stream/src/from_tree/traverse.rs:47-55 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times.
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.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
Split gix — The gix project is huge (28k LoC) and sprawls across 29 namespaces under the config/tree, repository, status, worktree, and ext layers. Suggested: split into gix/config-tree/sections, gix/repository, gix/status, gix/worktree, gix/ext
D34 · Knowledge Freshness· Orphaned files with no living knowledge · ×1
Orphaned files with no living knowledge — 2 of 722 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; 722 of the 995 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: gix-utils/src/btoi.rs, gix-index/src/entry/stat.rs. 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.
D9 · Test Distribution· Inverted test pyramid · ×1
Inverted test pyramid — Only 22 % of tests are unit tests (930 unit vs 3338 integration, 0 BDD); a broader unit base gives faster, more localised feedback.
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.
Logging is not universal — Only 26/27 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `gix-tui`.
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 01a0eae8-10b9-7edb-8bef-30b26ec5c2e2 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 21 · Warnings: 897 · Recommendations: 12 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 29-09-2026 @ 02:04 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.