Public report of apple/swift-collections, published 28 October 2026. It has the same score, grades and number of findings as the full report. The details of security findings (where they are in the code, which known vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive report Measured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey → Signed and filed in the standard's public register, 28 October 2026, 21:01 UTC · Survey ID cd_8cec0bc35fe24d1198a5ba90d35a3b5c

apple/swift-collections

Measured 28 October 2026, 20:58 UTC, at code version f96b909

No regression since the last survey

A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.

CAI score 62out of 100 Adequate
CriticalWeakAdequateStrongExemplary
Up 1 since the last survey

The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.

A medium codebase: 92,171 lines of product code in 13 projects, tests not counted · Estimated rebuild effort: about 1.0 person-years · Weakest lens: Production Readiness, 48

Findings by how serious they are

11 critical 622 serious 30 minor

23 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.

This survey was produced by

Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
28 October 2026, 20:58 UTC

A measurement, not a certificate. The Code Assurance Index records a number together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that implements it, and today Watchdog is the only one that does.

The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸

52of 52 dimensions measured by tools.
651of 663 findings point to an exact file and line, so you can open each one in the code. The other 12 concern the repository as a whole, such as missing documentation.
52dimensions across 6 lenses, read from 92,171 lines of product code in 13 projects.
Chapters

Executive summary

apple/swift-collections falls short of our standard for production, in part because we found no logging, tracing or health checks in the code. It scores 62 out of 100 and is rated Adequate, and all 11 of its critical findings are security problems in the build pipeline and in its automatic dependency updates.

Production Readiness, at 48, is the weakest lens and counts most in the score. The best first step is recording design decisions, worth about 8 points. Adding a diagnostic log would lift Production Readiness itself, worth about 7 points. Raising Production Readiness to 70 would lift the score to about 70.

Ten pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. One automatic update takes new releases before a bad one can be spotted. Pinning each tool to an exact version and setting a waiting period for automatic updates would close both risks.

The product code is 92,171 lines, about €140,000 to rebuild.

A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.

How the score is built: what each lens counts for The lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Production Readiness 48 · counts for 46%Maturity 58 · counts for 25%Architecture 85 · counts for 14%Code Health 91 · counts for 8%Security and Compliance 93 · counts for 4%Performance 100 · counts for 2%

If Production Readiness rose from 48 to 70, the lowest score rated Strong, the score would rise from 62 to about 70.

Code composition: what the lines of code are
Product code 72%Tests 28%
New since the last survey: 18 findings

These 18 critical or serious findings weren't in the previous survey, on 14 October 2026.

  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift
  • Code Duplication · Duplicated block (14–16 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift
  • Code Duplication · Duplicated block (6 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift
  • Code Duplication · Duplicated block (7 lines × 2) Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift
  • Churn × Complexity Hotspots · Repeated repair: Sources/BitCollections/BitSet/BitSet.Counted.swift Sources/BitCollections/BitSet/BitSet.Counted.swift
  • Explicit Debt · FixmeComment Tests/_CollectionsTestSupport/MinimalTypes/StaccatoContainer.swift
  • Explicit Debt · FixmeComment Tests/ContainersTests/MutableContainer_Update_Tests.swift
  • Explicit Debt · FixmeComment Tests/ContainersTests/MutableContainer_Update_Tests.swift
  • Explicit Debt · FixmeComment Tests/BasicContainersTests/RigidSetTests.swift
  • Explicit Debt · FixmeComment Tests/BasicContainersTests/UniqueSetTests.swift
  • Explicit Debt · FixmeComment Tests/BasicContainersTests/RigidArrayTests.swift
  • Explicit Debt · FixmeComment Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift
  • Explicit Debt · FixmeComment Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift
  • Explicit Debt · FixmeComment Sources/BasicContainers/RigidArray/RigidArray+ContainerOperations.swift
  • Explicit Debt · FixmeComment Sources/BasicContainers/RigidArray/RigidArray+ContainerOperations.swift
  • Explicit Debt · FixmeComment Sources/ContainersPreview/Conformances/UniqueDeque+Container.swift
  • Explicit Debt · FixmeComment Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift
  • Change Coupling · Change-coupling hub: RigidArray+ContainerOperations.swift → UniqueArray+ContainerOperations.swift, BidirectionalContainer.swift, Container.swift, RigidDeque+ContainerOperations.swift, UniqueDeque+ContainerOperations.swift Sources/BasicContainers/RigidArray/RigidArray+ContainerOperations.swift

Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.

Fixed since the last survey: 9 findings

These 9 critical or serious findings were in the previous survey, on 14 October 2026, and are gone from this one.

  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift
  • Code Duplication · Duplicated block (11–13 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift
  • Explicit Debt · FixmeComment Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift
  • Explicit Debt · FixmeComment Tests/ContainersTests/MutableContainer_Update_Tests.swift
  • Explicit Debt · FixmeComment Tests/ContainersTests/MutableContainer_Update_Tests.swift
  • Explicit Debt · FixmeComment Tests/ContainersTests/MutableContainer_Update_Tests.swift
  • Explicit Debt · FixmeComment Tests/_CollectionsTestSupport/MinimalTypes/StaccatoContainer.swift
  • Explicit Debt · FixmeComment Tests/_CollectionsTestSupport/MinimalTypes/StaccatoContainer.swift
  • Change Coupling · Change-coupling hub: RigidArray+ContainerOperations.swift → UniqueArray+ContainerOperations.swift, Container.swift, RigidDeque+ContainerOperations.swift, UniqueDeque+ContainerOperations.swift Sources/BasicContainers/RigidArray/RigidArray+ContainerOperations.swift
Rebuild cost: about €140,000 · Estimate
Cost to rebuild€47,000 to €240,000, for 784 to 2,487 hours of work, about 1.0 person-years for 1 to 2 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.9 at a score of 62. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeMedium: 92,171 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.

Top priorities

The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.

1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 8 points · Low effort · ADR Quality
2
Write a diagnostic trail the user can hand back with a bug report: log through `os.Logger` (one per subsystem), which the unified log keeps and a sysdiagnose carries to you.
Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
Raises the score by about 7 points · Medium effort · Observability
3
Record your significant design decisions.
Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Raises the score by about 7 points · Medium effort · Architecture documentation

Diagnosis: what the measurements show together

Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.

Where the investment is most exposed · Value at risk
This code would cost about €140,000 to build again, about 1.0 person-years of work. Its weakest lens is Production Readiness, at 48 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 8 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.9 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 3% to 6% on every change. The history of the code shows how much it changes: about 39,459 lines over the last 90 days, which is about 160,028 lines a year. At that pace, the extra work comes to an estimated 11.1 to 66.4 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture — module dependency graph

Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.

arch BasicContainers BasicContainers InternalCollectionsUtilities InternalCollectionsUtilities BasicContainers->InternalCollectionsUtilities SpanPreview SpanPreview BasicContainers->SpanPreview BitCollections BitCollections BitCollections->InternalCollectionsUtilities Collections (CMake) Collections (CMake) Collections (SwiftPM) Collections (SwiftPM) Collections (SwiftPM)->BitCollections DequeModule DequeModule Collections (SwiftPM)->DequeModule HashTreeCollections HashTreeCollections Collections (SwiftPM)->HashTreeCollections HeapModule HeapModule Collections (SwiftPM)->HeapModule OrderedCollections OrderedCollections Collections (SwiftPM)->OrderedCollections ContainersPreview ContainersPreview ContainersPreview->BasicContainers ContainersPreview->DequeModule ContainersPreview->InternalCollectionsUtilities ContainersPreview->SpanPreview DequeModule->InternalCollectionsUtilities DequeModule->SpanPreview HashTreeCollections->InternalCollectionsUtilities HeapModule->InternalCollectionsUtilities OrderedCollections->InternalCollectionsUtilities SortedCollections SortedCollections SortedCollections->InternalCollectionsUtilities SpanPreview->InternalCollectionsUtilities TrailingElementsModule TrailingElementsModule TrailingElementsModule->InternalCollectionsUtilities

Architecture: which parts of the code depend on which

The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.

13 modules, with 60 dependencies between them. One loop runs through 11 of the modules, marked above the diagonal.

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 Utils.Debugger.Formatters.RigidArray2 SortedCollections3 SpanPreview4 RopeModule5 InternalCollectionsUtilities6 OrderedCollections7 HeapModule8 HashTreeCollections9 ContainersPreview10 DequeModule11 BitCollections12 TrailingElementsModule13 BasicContainers
1 Utils.Debugger.Formatters.RigidArray
2 SortedCollections47338
3 SpanPreview621
4 RopeModule1112622
5 InternalCollectionsUtilities2313815
6 OrderedCollections1535783
7 HeapModule15172
8 HashTreeCollections351913192
9 ContainersPreview12318101
10 DequeModule2292153
11 BitCollections1016
12 TrailingElementsModule422
13 BasicContainers32941015
Uses a module listed above itPart of a loopThe module itself
1 Utils.Debugger.Formatters.RigidArray2 SortedCollections3 SpanPreview4 RopeModule5 InternalCollectionsUtilities6 OrderedCollections7 HeapModule8 HashTreeCollections9 ContainersPreview10 DequeModule11 BitCollections12 TrailingElementsModule13 BasicContainersUtils.Debugger.Formatters.RigidArray1SortedCollections2SpanPreview3RopeModule4InternalCollectionsUtilities5OrderedCollections6HeapModule7HashTreeCollections8ContainersPreview9DequeModule10BitCollections11TrailingElementsModule12BasicContainers134733862111126222313815153578315172351913192123181012292153101642232941015

At a glance — Code Health · 91% · Exemplary ·

At a glance — Architecture · 85% · Adequate · gated by D6, D26 ·

At a glance — Maturity · 58% · Adequate · gated by M2 ·

At a glance — Readiness · 48% · Weak · gated by P2, P3 ·

At a glance — Security · 93% · Exemplary ·

At a glance — Performance · 100% · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

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 categoryFindingsSeverity
A05:2025 — Injection11High / Critical

Roadmap

First, establish a diagnostic trail by logging through os.Logger in all subsystems, prioritizing error paths that currently emit nothing to ensure users can report reproducible issues. Second, document significant design decisions in a dedicated ADR folder to capture context and consequences, and maintain a changelog to track release contents. Finally, integrate a SAST step into CI to automatically fail builds on security regressions, ensuring code quality is enforced before deployment.

Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.

Do thisHelpsEffortDimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.+8.3 ptsLowADR Quality
Write a diagnostic trail the user can hand back with a bug report: log through `os.Logger` (one per subsystem), which the unified log keeps and a sysdiagnose carries to you. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.+7.4 ptsMediumObservability
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.+7.3 ptsMediumArchitecture documentation
Add a SAST step to CI running what this repository's stack ships: CodeQL's Swift pack (Swift/Xcode) — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.+5.2 ptsMediumSecurity & performance tooling
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.+3.8 ptsMediumRelease Hygiene
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion.+1.3 ptsLowProject Cohesion
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.+1.9 ptsMediumDocumentation (README)
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor.+1.0 ptsLowBus Factor

File quality

Per-file score 0–10 — a quality signature. Of 237 files carrying findings, judged against the Production bar: 0% slop · 51% mixed · 49% near-clean.

FileScoreBandWorst signal
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
Sources/InternalCollectionsUtilities/UnsafeBitSet/_UnsafeBitSet.swift6.0MixedExplicit Debt: FixmeComment
Sources/InternalCollectionsUtilities/BorrowingIteratorProtocol+Equality.swift6.0MixedExplicit Debt: FixmeComment
Sources/BitCollections/BitSet/BitSet+SetAlgebra isEqualSet.swift6.0MixedExplicit Debt: FixmeComment
Sources/HashTreeCollections/HashNode/_HashNode+Structural symmetricDifference.swift6.0MixedExplicit Debt: FixmeComment
Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol+SpanwiseZip.swift6.0MixedExplicit Debt: FixmeComment
Sources/RopeModule/BigString/Operations/BigString+Managing Breaks.swift6.0MixedExplicit Debt: FixmeComment
Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isStrictSubset.swift6.0MixedExplicit Debt: FixmeComment
Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isEqualSet.swift6.0MixedExplicit Debt: FixmeComment
Sources/DequeModule/_UnsafeDequeHandle.swift6.0MixedExplicit Debt: FixmeComment
Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isStrictSuperset.swift6.0MixedExplicit Debt: FixmeComment
Sources/SortedCollections/BTree/_Node.UnsafeHandle+Insertion.swift6.0MixedExplicit Debt: TodoComment
Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift6.0MixedExplicit Debt: TodoComment
Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift6.0MixedExplicit Debt: FixmeComment
Sources/ContainersPreview/Conformances/InputSpan+Container.swift6.0MixedExplicit Debt: FixmeComment
Sources/InternalCollectionsUtilities/IntegerTricks/Integer rank.swift6.0MixedExplicit Debt: FixmeComment
Sources/RopeModule/BigString/Conformances/BigString+Comparable.swift6.0MixedExplicit Debt: FixmeComment
Sources/ContainersPreview/Conformances/RigidArray+Container.swift6.0MixedExplicit Debt: FixmeComment
Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift6.0MixedExplicit Debt: FixmeComment
Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift6.0MixedExplicit Debt: FixmeComment

How the grades work

Every finding carries one of four grades. Three say how serious it is. The fourth says this survey could not settle it — and it is a grade, not a gap.

Critical — 11

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 — 622

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 — 30

Recorded, with no effect on how the codebase functions. Present so the survey is complete, not because it needs doing.

Could not be resolved — 23

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. 52 of 52 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. 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 — 52 dimensions across the health lenses
D1D2D4D5D6D9D10D12D13D14D15D16D17D20D26D28D29D30D34D35D43AX10AX3AX4AX8AX9M1M2M3M4P1P2P3P6PF2X1X12X13X14X15X17X19X21X22X23X24X25X26X27X28X3X30

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
  1. 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, 651 of 663 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.)
  2. 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.
  3. 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.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Watchdog duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivySecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3✓ deterministic
LLM (sampled · advisory)Documentation quality, ADR conformance, naming — sampled over a bounded sample; advisory, never a deterministic measurement—◐ LLM · sampled · advisory

Every finding is locatable in findings.md. Run 01a1844e-fd21-7ffb-acac-77d5c435f645.

The exact command behind every deep-scan dimension — tool, version, invocation and retained raw output — is in Appendix B — Reproduction & audit trail.

Run transparency — what happened this run

What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.

  • D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: the Swift half could not be measured — the Swift suite in . produced no coverage export. Coverage is excluded from the score rather than counted as a near-zero. This is OUR limitation, not a defect in the repo. In the meantime, commit (or publish into the working tree) the lcov/Cobertura report your CI produces and the real number is read on the next scan. You can widen what we reach: optional: commit the lcov/Cobertura report your CI produces, and the real number is read on the next scan.
  • 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 (.swift) and this repository declares a SwiftPM test suite (swift-collections), but it was not re-run: the analyzer environment could not run it. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • D19 Documentation Quality — 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 kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
  • D21 Naming Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
  • D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: it declares a published package (Package.swift), but no published-package marker D22 reads admitted any project here, so this ecosystem's public API has no collector, and the remedy is to write one — no change to the scan image can close it.
  • D24 Comment Value — 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.
  • D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
  • D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `Benchmarks/Sources/Benchmarks/RigidDequeBenchmarks.swift`, `Benchmarks/Sources/Benchmarks/Rust/RustVecDequeBenchmarks.swift`, `Benchmarks/Sources/Benchmarks/UniqueDequeBenchmarks.swift`, `Benchmarks/Sources/memory-benchmark/DictionaryStatistics.swift`, `Sources/BasicContainers/HashTable/_HTable+Bitmap.swift`, … (+413 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
  • D44 Platform End-of-Life — 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 dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a Dockerfile) is simply not read here yet.
  • 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.
  • AXB1 Runtime evidence locked — no reproducible boot — 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. Subject: a native UI project (Xcode/Collections.xcodeproj/project.pbxproj). The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. Watchdog then boots it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
  • 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.
  • GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's Python, Swift is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • 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 reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby or Scala was found, and this repository's Python, Swift is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • M4 Documentation accuracy — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
  • 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.
  • 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 reads C# syntax, and JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • 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 reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala or PHP was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • 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 reads C# syntax, and JavaScript/TypeScript, Go, PHP, Dart, Kotlin, Ruby, Scala, Java, Python and Rust source only, and no C# was loaded, and no named async function in this repository's JavaScript/TypeScript, nor any Go, PHP or Dart function or Kotlin suspend function, makes a request that can be cancelled (fetch, axios, ky, ofetch; net/http, net.Dial; amphp; Dio; Ktor, OkHttp), so there is nothing to judge, 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.
  • 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 reads C# syntax, and JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X4 Structured logging — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Python, PHP, Dart, Ruby, Scala and Rust source only, and no C# was loaded, and this repository's JavaScript/TypeScript, Python and PHP make no call through a named logger, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • 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 reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's Python, Swift is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.

Limitations & what we did not check

Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.

Per-dimension blind spots

For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
  • D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.

Dimensions

D1 · Cyclomatic Complexity8.4 / 10Strong✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 8.4 / 10 · rule-coverage 100% · ceiling Prevented

16 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was _HashNode._intersection at 21.

_HashNode._intersection (cyclomatic 21)Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:28
_HashNode._subtracting (cyclomatic 21)Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift:28
OrderedSet._updateHashAfterContiguousMove (cyclomatic 21)Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:435
_HTable.checkInvariants (cyclomatic 20)Sources/BasicContainers/HashTable/_HTable+Debug.swift:85
_UnsafeBitSet.index (cyclomatic 20)Sources/InternalCollectionsUtilities/UnsafeBitSet/_UnsafeBitSet.swift:425

+ 11 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 16 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with _HashNode._intersection (cyclomatic 21), _HashNode._subtracting (cyclomatic 21), OrderedSet._updateHashAfterContiguousMove (cyclomatic 21). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 16 together lifts Cyclomatic Complexity from 8.4 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
  2. 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.

D2 · Cognitive Complexity6.9 / 10Adequate✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 6.9 / 10 · rule-coverage 100% · ceiling Prevented

50 method(s) exceeded the cognitive complexity threshold of 15; the worst was OrderedSet._updateHashAfterContiguousMove at 41.

OrderedSet._updateHashAfterContiguousMove (cognitive 41)Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:435
_UnsafeHashTable.adjustContents (cognitive 41)Sources/OrderedCollections/HashTable/_HashTable+UnsafeHandle.swift:451
BorrowingIteratorProtocol._spanwiseZip (cognitive 38)Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol+SpanwiseZip.swift:30
OrderedSet._updateHashAfterMove (cognitive 38)Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:503
_UnsafeBitSet.index (cognitive 36)Sources/InternalCollectionsUtilities/UnsafeBitSet/_UnsafeBitSet.swift:425

+ 45 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 50 bodies over 15 down to 15 or less in Cognitive Complexity — start with OrderedSet._updateHashAfterContiguousMove (cognitive 41), _UnsafeHashTable.adjustContents (cognitive 41), BorrowingIteratorProtocol._spanwiseZip (cognitive 38). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 50 together lifts Cognitive Complexity from 6.9 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
  2. 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.

D4 · Code Duplication8.9 / 10Strong✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 8.9 / 10 · rule-coverage 100% · ceiling Verified

201 duplicated block group(s) detected. A further 4 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.

Duplicated block (8 lines × 2) · ×25Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:156
Duplicated block (7 lines × 2) · ×22Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:359
Duplicated block (5 lines × 2) · ×19Sources/DequeModule/_UnsafeDequeHandle.swift:566
Duplicated block (11 lines × 2) · ×16Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:66
Duplicated block (9 lines × 2) · ×15Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:62

+ 45 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 25 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with RigidArray+Replacements.swift (2), RigidDictionary+Insertions.swift (2), _UnsafeDequeHandle.swift (2). — One of this dimension's main actionable groups (25 warning-level).
  2. Resolve the 22 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with UniqueArray+ContainerOperations.swift (3), InputSpan+Container.swift (3), RigidArray+Insertions.swift (2). — One of this dimension's main actionable groups (22 warning-level).
  3. Resolve the 19 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with SortedDictionary+BidirectionalCollection.swift (6), TreeDictionary+Collection.swift (3), SortedDictionary.Index.swift (2). — One of this dimension's main actionable groups (19 warning-level).
  4. 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.

D5 · Coupling8.8 / 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.

Maturity: Documented → Verified → Prevented · effective 8.8 / 10 · rule-coverage 100% · ceiling Prevented

13 production modules (SwiftPM+CMake), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 2 module(s) off the main sequence, with abstractness counted on 11 of the 13 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).

Off the main sequence: InternalCollectionsUtilities · ×2

What to do

  1. Resolve the 2 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (2 warning-level).
  2. 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.

D6 · Cohesion (LCOM4)3.3 / 10Weak✓ Tool-verified

What it measures: Whether a class's methods are focused on a single responsibility.

Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.

Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.

Maturity: Documented → Verified → Prevented · effective 3.3 / 10 · rule-coverage 100% · ceiling Verified

20 of 36 classes have LCOM4 above 3.

Low cohesion: Counted (LCOM4 57) · ×20Sources/BitCollections/BitSet/BitSet.Counted.swift:33

What to do

  1. Resolve the 20 Low cohesion finding(s) in Cohesion (LCOM4) — start with OrderedDictionary+Elements.SubSequence.swift (2), BitSet.Counted.swift, OrderedSet+UnorderedView.swift. — One of this dimension's main actionable groups (20 warning-level).
  2. Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.

D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.

Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

18 test methods: 18 unit, 0 integration, 0 BDD, 0 e2e. The Python suite contributes 3 test function(s) across 1 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.

✓ On the Gold path — maintain.

Detailed fixes: d9_recommendation.md.

D10 · Test Quality10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the tests truly assert behaviour rather than just running the code.

Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 15 tests.

✓ On the Gold path — maintain.

Detailed fixes: d10_recommendation.md.

D12 · Dependency Hygiene10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether dependencies are current, secure, and not bloated.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 outdated direct SwiftPM dependencies, 0 pinning defect(s). SwiftPM has no package registry: a dependency is a repository URL and its releases are that repository's semver tags, so currency is answered by listing tags rather than by querying an index. Only a newer tag on the SAME MAJOR is reported — a `from:` requirement admits everything below the next major and nothing above it, so a major crossing needs a Package.swift edit rather than an update, and naming the update as its remedy would be wrong. Whether any dependency is DEPRECATED or ABANDONED is not graded and cannot be: a repository publishes no such marker, and there is no registry that could carry one. Known CVEs in this dependency graph are D30's question.

✓ On the Gold path — maintain.

Detailed fixes: d12_recommendation.md.

D13 · Secret Scanning10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D14 · License Compliance10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the licenses of third-party packages are compatible with your policy.

Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 3 SwiftPM package(s) use a banned license. SwiftPM has no package registry, so each package's licence is the one its repository declares: 3 of them read from the licence file the repository carries at the revision Package.resolved pins, and 0 — unpinned, or whose licence file could not be read or named — from api.deps.dev, which reports the licence the repository declares today. Graded: every package a committed Package.resolved pins, direct and transitive, and every declared dependency none pins.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots10.0 / 10Stronggated by 3 serious findings✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: Benchmarks/Sources/Benchmarks/BitsetBenchmarks.swift (2×24=48); Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift (2×16=32) Repeated repair below the complexity floor: Sources/BitCollections/BitSet/BitSet.Counted.swift (3 of 3 changes were fixes)

Hotspot: Benchmarks/Sources/Benchmarks/BitsetBenchmarks.swift · ×2Benchmarks/Sources/Benchmarks/BitsetBenchmarks.swift:19
Repeated repair: Sources/BitCollections/BitSet/BitSet.Counted.swiftSources/BitCollections/BitSet/BitSet.Counted.swift:217

What to do

  1. Resolve the 2 Hotspot finding(s) in Churn × Complexity Hotspots — start with BitsetBenchmarks.swift, OrderedSet+Move.swift. — One of this dimension's main actionable groups (2 warning-level).
  2. Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with BitSet.Counted.swift. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.

D16 · Bus Factor7.7 / 10Strong✓ Tool-verified

What it measures: Whether knowledge is concentrated in too few people (the "bus factor").

Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.

Maturity: Documented → Verified → Prevented · effective 7.7 / 10 · rule-coverage 100% · ceiling Documented

84 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is Benchmarks/Sources/Benchmarks/OrderedDictionaryBenchmarks.swift. Counted over 373 of the 619 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Off-boarding risk: anonymized user #1
Further sole-owners (lower concentration)

What to do

  1. Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
  2. Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.

D17 · Explicit Debt9.3 / 10Stronggated by 321 serious findings✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.3 / 10 · rule-coverage 100% · ceiling Prevented

321 deducted task-comment markers across 92171 LoC (0.3/KLoC) → score 9.3. 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.

FixmeComment · ×279Package.swift:324
TodoComment · ×41Tests/HashTreeCollectionsTests/TreeDictionary Tests.swift:1738
XxxCommentUtils/Debugger/formatter_bytecode.py:938

What to do

  1. Resolve the 279 FixmeComment finding(s) in Explicit Debt — start with MutableSpan+Extras.swift (11), UniqueArray+Insertions.swift (9), UniqueArray+Replacements.swift (8). — One of this dimension's main actionable groups (279 warning-level).
  2. Resolve the 41 TodoComment finding(s) in Explicit Debt — start with _Node.UnsafeHandle+Deletion.swift (5), _Node.UnsafeHandle+Insertion.swift (4), RigidArrayTests.swift (3). — One of this dimension's main actionable groups (41 warning-level).
  3. Resolve the 1 XxxComment finding(s) in Explicit Debt — start with formatter_bytecode.py. — One of this dimension's main actionable groups (1 warning-level).
  4. 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.

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.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

No architecture decision records were found.

No ADRs found

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.

D26 · Project Cohesion0.0 / 10Critical✓ Tool-verified

What it measures: Whether each project is a focused, coherent unit rather than an oversized grab-bag.

Method: Project size overshoot penalties (LoC / public-type count / namespace count, 2-of-3 flag) weighted by log magnitude. Exhaustive across projects, deterministic, LLM-independent.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

1 of 1 build units (SwiftPM) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

  1. Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.

D28 · Secrets (history)10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

gitleaks scanned the full history AND the current working tree and found no secrets.

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)7.1 / 10Adequategated by 11 critical findings✓ Tool-verified

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).

Maturity: Documented → Verified → Prevented · effective 7.1 / 10 · rule-coverage 100% · ceiling Documented

11 finding(s): 0 critical, 11 high, 0 medium, 0 low. 9 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens.

REDACTED
REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. No action in Static Analysis (SAST) — all 6 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 (6 issue-level, 0 of them charged here).
  3. No action in Static Analysis (SAST) — all 3 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 (3 issue-level, 0 of them charged here).

Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.

D30 · Dependency Vulnerabilities10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.

Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No known-vulnerable dependencies in any ecosystem this repository declares.

✓ On the Gold path — maintain.

Detailed fixes: d30_recommendation.md.

D34 · Knowledge Freshness10.0 / 10Exemplary✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

1 of 373 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is Sources/OrderedCollections/OrderedSet/OrderedSet+Diffing.swift. Counted over 373 of the 619 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
Orphaned fileSources/OrderedCollections/OrderedSet/OrderedSet+Diffing.swift:1

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.

D35 · Change Coupling9.8 / 10Stronggated by 4 serious findings✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.8 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: RigidDeque+ContainerOperations.swift↔UniqueDeque+ContainerOperations.swift 100%; UniqueArray+ContainerOperations.swift↔UniqueDeque+ContainerOperations.swift 100%; RigidArray+ContainerOperations.swift↔UniqueDeque+ContainerOperations.swift 100%

Change coupling: RigidDeque+ContainerOperations.swift ↔ UniqueDeque+ContainerOperations.swift · ×3Sources/DequeModule/RigidDeque/RigidDeque+ContainerOperations.swift:1
Change-coupling hub: RigidArray+ContainerOperations.swift → UniqueArray+ContainerOperations.swift, BidirectionalContainer.swift, Container.swift, RigidDeque+ContainerOperations.swift, UniqueDeque+ContainerOperations.swiftSources/BasicContainers/RigidArray/RigidArray+ContainerOperations.swift

What to do

  1. Resolve the 3 Change coupling finding(s) in Change Coupling — start with UniqueArray+ContainerOperations.swift (2), RigidDeque+ContainerOperations.swift. — One of this dimension's main actionable groups (3 warning-level).
  2. Resolve the 1 Change-coupling hub finding(s) in Change Coupling — start with RigidArray+ContainerOperations.swift. — 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.

D43 · Malicious Dependencies10.0 / 10Exemplary✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No dependency in any ecosystem this repository declares is published as malicious.

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

Frontend & cross-cutting dimensions

R = React/JS · M = Maturity · P = Readiness.

AX10 · Code composition10.0 / 10Exemplary✓ Tool-verified

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.
AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

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.

AX4 · Dependency direction10.0 / 10Exemplary✓ Tool-verified

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.

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.

AX9 · CQS / query purity10.0 / 10Exemplary✓ Tool-verified

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.

M1 · Documentation (README)6.7 / 10Adequate✓ Tool-verified

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 a build/run (quick start) section to the root README — the first thing a newcomer needs.
  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
  • Add a README to the 2 of 2 project(s) that lack one — worth up to 2 pts.
M2 · Architecture documentation0.0 / 10Critical✓ Tool-verified

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.
  • No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.

What to do

  • Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
  • Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.

Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.

M4 · Documentation accuracy10.0 / 10Exemplary○ Nothing flagged

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.

P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — Whether an automated pipeline builds and tests every change.

Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.

P2 · Observability0.0 / 10Critical✓ Tool-verified

Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.

Method: Filesystem/Roslyn scan: structured-logging frameworks (Serilog, NLog), OpenTelemetry, and health-check endpoint patterns. Exhaustive, deterministic.

  • No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.

What to do

  • Write a diagnostic trail the user can hand back with a bug report: log through `os.Logger` (one per subsystem), which the unified log keeps and a sysdiagnose carries to you. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
P3 · Security & performance tooling3.0 / 10Weak✓ Tool-verified

Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).

Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.

  • No static application security testing detected. For this repository's stack, add CodeQL's Swift pack (Swift/Xcode) (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 5663 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.

What to do

  • Add a SAST step to CI running what this repository's stack ships: CodeQL's Swift pack (Swift/Xcode) — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P6 · Release Hygiene5.0 / 10Adequate✓ Tool-verified

Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.

Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.

  • No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)

What to do

  • Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
PF2 · Allocation hygiene10.0 / 10Exemplary✓ Tool-verified

Readiness · Performance — Whether the code is written to minimise allocations so it doesn't pressure its host's memory manager — buffer/slice views over copies, object pooling, stack or value-type allocation, and buffer writers. Reward-only: credited where present, never penalised where a simpler style is fine.

Method: Production-source scan: density (per 1k LoC) of allocation-aware APIs — in .NET Span/Memory, ArrayPool/ObjectPool, stackalloc, ValueTask, value-type structs, IBufferWriter, string.Create, SkipLocalsInit; off .NET, with comments and strings blanked, Go's sync.Pool, preallocated slices/maps, Grow, strconv.Append* and buf[:0] reuse; the JVM's NIO buffer views, MemorySegment, primitive collections, pools and literal presizes (plus Kotlin primitive arrays and value classes, Scala AnyVal and @specialized); Swift's reserveCapacity, ContiguousArray, withUnsafe* access and ~Copyable. Activated off .NET on the same floor (400 lines, and benchmarks or 8 uses); Rust and garbage-collected scripting languages are not applicable. Reward-only. Deterministic, syntax/text detection.

X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.

Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.

X12 · Unreachable branch10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.

Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.

X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.

Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.

X14 · Bypassable address classification10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.

Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.

X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.

Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.

X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.

Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.

X19 · Unrestored process-global state10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.

Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.

X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.

Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.

X22 · Contradicted release guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.

Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.

X23 · Unguarded diagnostic materialisation10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.

Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.

X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.

Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.

X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.

Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.

X26 · Unsynchronised callback handoff10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.

Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.

X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.

Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.

X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.

Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.

X3 · Exception handling10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.

Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.

X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.

Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.

Reference — by lens

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.

LensScoreRatingImpact
Code Health91%ExemplarySolid.
Architecture85%Adequate — gated by D6, D26Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity58%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness48%Weak — gated by P2, P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security93%ExemplarySolid.
Performance100%ExemplaryStrongest area.
Unscored — 1 check(s) recorded observations but carry no score

These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.

  • X10 Duplicated predicate — 20 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 3 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.
  • P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 63 check(s) not relevant to this codebase

These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.

  • AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
  • AX1 Captive dependencies — Not applicable: this repository's Python imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one; this repository's Swift imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
  • AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. No Swift request handler (a Vapor, Hummingbird, Kitura, Swifter or Perfect route handler, as a method or a registered closure) is declared, so no state is shared between request threads. Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written.
  • 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
  • AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • 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.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named property (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a SwiftData @Model, a Core Data, Realm, GRDB or Fluent type, a GRDB or SQLite.swift column, or in a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (CoreData, SwiftData, GRDB, RealmSwift, SQLite, Firebase, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named property (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a SwiftData @Model, a Core Data, Realm, GRDB or Fluent type, a GRDB or SQLite.swift column, or in a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (CoreData, SwiftData, GRDB, RealmSwift, SQLite, Firebase, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D11 Test Reliability — Test reliability not included — the .swift suite was found but not re-run
  • 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.
  • D19 Documentation Quality — D19 withholds "Documentation: empty section": 1 candidate(s) were measured and not published.
  • D21 Naming Consistency — Naming consistency is measured on C# only; Python, Rust, Swift not measured.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — D24 reads C# and Visual Basic comments only — this repository's production source is .py, .rs, .swift, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D25 ADR Conformance — no ADRs to check
  • D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.swift), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D3 God Classes — Most of this repository's production source (.cpp, .py, .swift) was not read by god-class detection, so class size was not assessed for the languages that are the product — whatever else this pass did read is not this repository's class size. Not scored — this is a gap in the analyzer, not a verdict about this repository.
  • D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
  • D32 Data Compliance (PII/GDPR) — 418 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
  • D36 Supply-chain Provenance & Signing — The CI pipeline builds and tests but publishes no released artifact — no package publish, container push, GitHub release or deployment step. Supply-chain provenance, signing and SBOM attest RELEASED artifacts, so there is nothing to attest here. Add them to the release pipeline when this repo starts shipping artifacts (a published package, a container image, a deployed service or a tagged release).
  • D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • 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.
  • D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
  • 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 — Swift suite
  • DM1 Domain Modelling — not scored — this repository shows none of the 3 signals this lens looks for
  • ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and this analysis resolves a call's owner only where the receiver's type is written down in the source. 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 — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
  • IC1 Incompleteness & stubs — 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 Python, Swift 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 — `swift test --enable-code-coverage` (SwiftPM) or `xcodebuild test -scheme <YourScheme> -enableCodeCoverage YES` (an .xcodeproj/.xcworkspace suite), then `xcrun llvm-cov export -format=lcov`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `Benchmark("…")` in a file importing package-benchmark, or package-benchmark in Package.swift, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF3 Async & latency hygiene — Not applicable: this repository declares no async functions, so there is no asynchronous code for a blocking call to stall.
  • 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.
  • X16 Unfloored truncation loop — 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
  • X18 Disposal-pattern 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
  • 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 asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X29 Per-element action decided by a fixed element — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • 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.

Critical — 11 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
Serious — 622 finding(s)
D17 · Explicit Debt · FixmeComment · ×279
  • FixmeComment Package.swift:324 — // FIXME: _modify accessors in RopeModule seem to be broken in Swift 6 mode — 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.
  • FixmeComment Package@swift-6.2.swift:322 — // FIXME: _modify accessors in RopeModule seem to be broken in Swift 6 mode — 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.
  • FixmeComment Utils/Debugger/formatter_bytecode.py:398 — # FIXME: uleb — 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.
  • FixmeComment Utils/Debugger/formatter_bytecode.py:403 — # FIXME — 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.
  • FixmeComment Utils/Debugger/formatter_bytecode.py:406 — # FIXME — 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.
  • FixmeComment Utils/Debugger/formatter_bytecode.py:476 — # FIXME uleb — 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.
  • FixmeComment Utils/Debugger/formatter_bytecode.py:619 — # FIXME uleb — 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.
  • FixmeComment Utils/Debugger/formatter_bytecode.py:622 — # FIXME uleb — 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.
  • FixmeComment Tests/_CollectionsTestSupport/Utilities/RepeatableRandomNumberGenerator.swift:24 — // FIXME: Replace with something better. — 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.
  • FixmeComment Tests/_CollectionsTestSupport/Utilities/With.swift:15 — // FIXME: Properties with borrow accessors cannot initialize locals. — 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.
  • FixmeComment Tests/_CollectionsTestSupport/MinimalTypes/CustomBorrowingIterator.swift:60 — // FIXME: Why is this necessary? — 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.
  • FixmeComment Sources/DequeModule/UniqueDeque/UniqueDeque.swift:206 — // FIXME: Why is this necessary? — 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.
  • FixmeComment Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift:81 — // FIXME: Why is this necessary? — 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.
  • FixmeComment Tests/_CollectionsTestSupport/MinimalTypes/MinimalEncoder.swift:22 — /// FIXME: Fix error reporting. We ought to throw errors instead of trapping — 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.
  • FixmeComment Tests/_CollectionsTestSupport/MinimalTypes/PureProducer.swift:44 — // FIXME: This is rejected: — 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.
  • FixmeComment Tests/_CollectionsTestSupport/MinimalTypes/StaccatoContainer.swift:148 — // FIXME rdar://150240032 — 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.
  • FixmeComment Tests/_CollectionsTestSupport/ConformanceCheckers/CheckBidirectionalCollection.swift:16 — // FIXME: Port all of the collection validation tests from the Swift compiler codebase. — 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.
  • FixmeComment Tests/_CollectionsTestSupport/ConformanceCheckers/CheckCollection.swift:16 — // FIXME: Port all of the collection validation tests from the Swift compiler codebase. — 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.
  • FixmeComment Tests/_CollectionsTestSupport/ConformanceCheckers/CheckSequence.swift:16 — // FIXME: Port all of the collection validation tests from the Swift compiler codebase. — 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.
  • FixmeComment Tests/_CollectionsTestSupport/ConformanceCheckers/CheckCollection.swift:20 — // FIXME: Port the collection validation tests from the Swift compiler codebase. — 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.
  • FixmeComment Tests/_CollectionsTestSupport/ConformanceCheckers/CheckSequence.swift:20 — // FIXME: Port the collection validation tests from the Swift compiler codebase. — 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.
  • FixmeComment Tests/_CollectionsTestSupport/ConformanceCheckers/CheckContainer.swift:245 — // FIXME: Add throwing versions of checkEquatable/checkHashable/checkComparable — 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.
  • FixmeComment Tests/_CollectionsTestSupport/AssertionContexts/Assertions.swift:164 — // FIXME: Remove when CustomStringConvertible starts supporting — 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.
  • FixmeComment Tests/_CollectionsTestSupport/AssertionContexts/Assertions.swift:427 — // FIXME: Remove this in favor of the better one below — 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.
  • FixmeComment Tests/_CollectionsTestSupport/AssertionContexts/Combinatorics.swift:131 — // FIXME: Use randomSample() from swift-algorithms to eliminate dupes — 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.
  • + 254 more in this group — see findings.md.
D17 · Explicit Debt · TodoComment · ×41
  • TodoComment Tests/HashTreeCollectionsTests/TreeDictionary Tests.swift:1738 — // TODO: determine how to best calculate the expected order of the hash tree — 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 Tests/HashTreeCollectionsTests/TreeDictionary Tests.swift:1758 — // TODO: determine how to best calculate the expected order of the hash tree — 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 Tests/BasicContainersTests/RigidArrayTests.swift:456 — // TODO — 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 Tests/BasicContainersTests/RigidArrayTests.swift:487 — // TODO — 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 Tests/BasicContainersTests/RigidArrayTests.swift:828 — // TODO — 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 Tests/BasicContainersTests/UniqueArrayTests.swift:368 — // TODO — 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 Tests/BasicContainersTests/UniqueArrayTests.swift:382 — // TODO — 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 Tests/BasicContainersTests/UniqueArrayTests.swift:630 — // TODO — 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 Sources/ContainersPreview/Types/Shared.swift:14 — // TODO — 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 Sources/BasicContainers/UniqueArray/UniqueArray+Experimental.swift:20 — // TODO — 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 Sources/BasicContainers/UniqueArray/UniqueArray+Experimental.swift:42 — // TODO — 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 Sources/BasicContainers/UniqueArray/UniqueArray+Experimental.swift:61 — // TODO — 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 Sources/SortedCollections/SortedSet/SortedSet+Equatable.swift:28 — // TODO: optimize/benchmarking by comparing node identity. — 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 Sources/SortedCollections/SortedSet/SortedSet+Partial RangeReplaceableCollection.swift:158 — // TODO: optimize to not perform excessive traversals — 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 Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:150 — // TODO: might want to consider uniqueness to minimize CoW copies. — 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 Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:299 — // TODO: could be worthwhile to evaluate recursive approach — 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 Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:300 — // TODO: in some cases, it could be faster to search from the root each time — 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 Sources/SortedCollections/SortedDictionary/SortedDictionary+Equatable.swift:28 — // TODO: optimize/benchmarking by comparing node identity/shared subtrees. — 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 Sources/SortedCollections/SortedDictionary/SortedDictionary.swift:212 — // TODO: Optimize to reuse dictionary structure. — 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 Sources/SortedCollections/SortedDictionary/SortedDictionary.swift:213 — // TODO: optimize to use identify fastest iteration method — 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 Sources/SortedCollections/SortedDictionary/SortedDictionary.swift:214 — // TODO: optimize CoW checks — 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 Sources/SortedCollections/BTree/_BTree+BidirectionalCollection.swift:33 — // TODO: further consider O(1) implementation — 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 Sources/SortedCollections/BTree/_BTree+BidirectionalCollection.swift:99 — // TODO: this might be redundant given the fact the same (but generalized) — 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 Sources/SortedCollections/BTree/_BTree+BidirectionalCollection.swift:165 — // TODO: optimization for searching within children — 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 Sources/SortedCollections/BTree/_BTree+Partial RangeReplaceableCollection.swift:127 — // TODO: potentially use empty storage class. — 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.
  • + 16 more in this group — see findings.md.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×25
  • Duplicated block (8 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:156 — Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:156-163 | Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:139-146 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift` and `Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:156` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (8 lines × 2) Sources/BasicContainers/RigidDictionary/RigidDictionary+Insertions.swift:97 — Sources/BasicContainers/RigidDictionary/RigidDictionary+Insertions.swift:97-104 | Sources/BasicContainers/UniqueDictionary/UniqueDictionary+Insertions.swift:52-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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/RigidDictionary/RigidDictionary+Insertions.swift:97` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) Sources/BasicContainers/RigidDictionary/RigidDictionary+Insertions.swift:116 — Sources/BasicContainers/RigidDictionary/RigidDictionary+Insertions.swift:116-123 | Sources/BasicContainers/UniqueDictionary/UniqueDictionary+Insertions.swift:75-82 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/RigidDictionary/RigidDictionary+Insertions.swift:116` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) Sources/BasicContainers/RigidDictionary/RigidDictionary+Resizing.swift:71 — Sources/BasicContainers/RigidDictionary/RigidDictionary+Resizing.swift:71-78 | Sources/BasicContainers/RigidSet/RigidSet+Resizing.swift:68-75 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/RigidDictionary/RigidDictionary+Resizing.swift:71` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Sources/BasicContainers/RigidDictionary/RigidDictionary+Resizing.swift:79` calls `swap` and `Sources/BasicContainers/RigidSet/RigidSet+Resizing.swift:76` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (8 lines × 2) Sources/BasicContainers/RigidSet/RigidSet+Deprecated.swift:19 — Sources/BasicContainers/RigidSet/RigidSet+Deprecated.swift:19-26 | Sources/BasicContainers/UniqueSet/UniqueSet+Deprecated.swift:19-26 — before extracting anything, compare `Sources/BasicContainers/RigidSet/RigidSet+Deprecated.swift` and `Sources/BasicContainers/UniqueSet/UniqueSet+Deprecated.swift` as WHOLE FILES: 96% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (8 lines × 2) Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:134 — Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:134-141 | Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:146-153 — before extracting anything, compare `Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:134` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (8 lines × 2) Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift:57 — Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift:57-64 | Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift:104-111 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift:57` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (8 lines × 2) Sources/DequeModule/_UnsafeDequeHandle.swift:874 — Sources/DequeModule/_UnsafeDequeHandle.swift:874-881 | Sources/DequeModule/_UnsafeDequeHandle.swift:902-909 — 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) Sources/DequeModule/_UnsafeDequeHandle.swift:1493 — Sources/DequeModule/_UnsafeDequeHandle.swift:1493-1500 | Sources/DequeModule/_UnsafeDequeHandle.swift:1513-1520 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/DequeModule/_UnsafeDequeHandle.swift:1493` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (8 lines × 2) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:233 — Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:233-240 | Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift:232-239 — before extracting anything, compare `Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift` and `Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (8 lines × 2) Sources/HeapModule/Heap+UnsafeHandle.swift:219 — Sources/HeapModule/Heap+UnsafeHandle.swift:219-226 | Sources/HeapModule/Heap+UnsafeHandle.swift:330-337 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HeapModule/Heap+UnsafeHandle.swift:219` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift:164 — Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift:164-171 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer+Extras.swift:172-179 — before extracting anything, compare `Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift` and `Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer+Extras.swift` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 33 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (8 lines × 2) Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:426 — Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:426-433 | Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:469-476 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:426` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (8 lines × 2) Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:152 — Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:152-159 | Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift:152-159 — before extracting anything, compare `Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift` and `Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (8 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:90 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:90-97 | Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift:77-84 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift` and `Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (8 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:236 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:236-243 | Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift:243-250 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift` and `Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (8 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Experimental.swift:61 — Sources/BasicContainers/RigidArray/RigidArray+Experimental.swift:61-68 | Sources/BasicContainers/UniqueArray/UniqueArray+Experimental.swift:74-81 — 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) Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:404 — Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:404-412 | Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:342-349 — 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) Sources/ContainersPreview/Conformances/OutputSpan+Container.swift:27 — Sources/ContainersPreview/Conformances/OutputSpan+Container.swift:27-34 | Sources/ContainersPreview/Conformances/RigidArray+Container.swift:26-33 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (8 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Append.swift:272 — Sources/DequeModule/RigidDeque/RigidDeque+Append.swift:272-279 | Sources/DequeModule/UniqueDeque/UniqueDeque+Append.swift:264-271 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Append.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Append.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (8 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Append.swift:314 — Sources/DequeModule/RigidDeque/RigidDeque+Append.swift:314-323 | Sources/DequeModule/UniqueDeque/UniqueDeque+Append.swift:316-323 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Append.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Append.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (8 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift:305 — Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift:305-312 | Sources/DequeModule/UniqueDeque/UniqueDeque+Prepend.swift:296-303 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Prepend.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (8 lines × 2) Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift:42 — Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift:42-49 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer+Extras.swift:55-62 — before extracting anything, compare `Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift` and `Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer+Extras.swift` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 33 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 (8 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:395 — Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:395-402 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:785-792 — 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) Sources/BasicContainers/UniqueArray/UniqueArray.swift:160 — Sources/BasicContainers/UniqueArray/UniqueArray.swift:160-167 | Sources/DequeModule/UniqueDeque/UniqueDeque.swift:251-258 — 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.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×22
  • Duplicated block (7 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:359 — Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:359-365 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:725-731 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:359` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (7 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:366 — Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:366-372 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:733-739 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:733` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (7 lines × 2) Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:67 — Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:67-74 | Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:137-143 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:67` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (7 lines × 2) Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:80 — Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:80-86 | Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:149-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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:80` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (7 lines × 2) Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:169 — Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:169-175 | Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift:175-181 — before extracting anything, compare `Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift` and `Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:169` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (7 lines × 2) Sources/HashTreeCollections/HashNode/_HashNode+Subtree Insertions.swift:239 — Sources/HashTreeCollections/HashNode/_HashNode+Subtree Insertions.swift:239-245 | Sources/HashTreeCollections/HashNode/_HashNode+Subtree Insertions.swift:270-276 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HashTreeCollections/HashNode/_HashNode+Subtree Insertions.swift:239` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (7 lines × 2) Sources/HashTreeCollections/HashNode/_HashNode+Subtree Removals.swift:161 — Sources/HashTreeCollections/HashNode/_HashNode+Subtree Removals.swift:161-168 | Sources/HashTreeCollections/HashNode/_HashNode+Subtree Removals.swift:195-201 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HashTreeCollections/HashNode/_HashNode+Subtree Removals.swift:161` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Equatable.swift:33 — Sources/BasicContainers/RigidArray/RigidArray+Equatable.swift:33-39 | Sources/BasicContainers/UniqueArray/UniqueArray+Equatable.swift:32-38 — 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) Sources/BasicContainers/RigidDictionary/RigidDictionary+Resizing.swift:18 — Sources/BasicContainers/RigidDictionary/RigidDictionary+Resizing.swift:18-24 | Sources/BasicContainers/RigidSet/RigidSet+Resizing.swift:18-24 — 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) Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift:341 — Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift:341-347 | Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift:55-61 — before extracting anything, compare `Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift:349 — Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift:349-355 | Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift:63-69 — before extracting anything, compare `Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) Sources/ContainersPreview/Conformances/InputSpan+Container.swift:64 — Sources/ContainersPreview/Conformances/InputSpan+Container.swift:64-70 | Sources/ContainersPreview/Conformances/MutableSpan+Container.swift:64-70 — 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) Sources/ContainersPreview/Conformances/InputSpan+Container.swift:72 — Sources/ContainersPreview/Conformances/InputSpan+Container.swift:72-78 | Sources/ContainersPreview/Conformances/OutputSpan+Container.swift:63-69 — before extracting anything, compare `Sources/ContainersPreview/Conformances/InputSpan+Container.swift` and `Sources/ContainersPreview/Conformances/OutputSpan+Container.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 37 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 (7 lines × 2) Sources/ContainersPreview/Conformances/InputSpan+Container.swift:80 — Sources/ContainersPreview/Conformances/InputSpan+Container.swift:80-86 | Sources/ContainersPreview/Conformances/OutputSpan+Container.swift:71-77 — before extracting anything, compare `Sources/ContainersPreview/Conformances/InputSpan+Container.swift` and `Sources/ContainersPreview/Conformances/OutputSpan+Container.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 37 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 (7 lines × 2) Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:304 — Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:304-310 | Sources/ContainersPreview/Conformances/UniqueDeque+Container.swift:165-171 — 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) Sources/DequeModule/RigidDeque/RigidDeque+Consumption.swift:102 — Sources/DequeModule/RigidDeque/RigidDeque+Consumption.swift:102-108 | Sources/DequeModule/UniqueDeque/UniqueDeque+Consumption.swift:85-91 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Consumption.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Consumption.swift` as WHOLE FILES: 91% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:180 — Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:180-186 | Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift:179-185 — before extracting anything, compare `Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift` and `Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:290 — Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:290-296 | Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift:356-362 — before extracting anything, compare `Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift` and `Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Filter.swift:52 — Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Filter.swift:52-58 | Sources/HashTreeCollections/TreeSet/TreeSet+Filter.swift:50-56 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (7 lines × 2) Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift:357 — Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift:357-363 | Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift:71-77 — before extracting anything, compare `Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Append.swift:239 — Sources/DequeModule/RigidDeque/RigidDeque+Append.swift:239-245 | Sources/DequeModule/UniqueDeque/UniqueDeque+Prepend.swift:236-242 — 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) Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift:15 — Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift:15-21 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer+Extras.swift:15-21 — before extracting anything, compare `Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift` and `Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer+Extras.swift` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 33 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.
D6 · Cohesion (LCOM4) · Low cohesion · ×20
  • Low cohesion: Counted (LCOM4 57) Sources/BitCollections/BitSet/BitSet.Counted.swift:33 — Counted's methods fall into 57 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 57 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: UnorderedView (LCOM4 38) Sources/OrderedCollections/OrderedSet/OrderedSet+UnorderedView.swift:71 — UnorderedView's methods fall into 38 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 38 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: Elements (LCOM4 30) Sources/OrderedCollections/OrderedDictionary/OrderedDictionary+Elements.SubSequence.swift:18 — Elements's methods fall into 30 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 30 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: _Word (LCOM4 25) Sources/InternalCollectionsUtilities/UnsafeBitSet/_UnsafeBitSet+_Word.swift:43 — _Word's methods fall into 25 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 25 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: Values (LCOM4 23) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Values.swift:48 — Values's methods fall into 23 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 23 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: SubSequence (LCOM4 22) Sources/OrderedCollections/OrderedDictionary/OrderedDictionary+Elements.SubSequence.swift:39 — SubSequence's methods fall into 22 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 22 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: UnicodeScalarView (LCOM4 20) Benchmarks/Sources/Benchmarks/BigStringBenchmarks.swift:36 — UnicodeScalarView's methods fall into 20 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 20 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: MutableSpan (LCOM4 17) Sources/InternalCollectionsUtilities/MutableSpan+Extras.swift:14 — MutableSpan's methods fall into 17 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 17 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: Keys (LCOM4 16) Sources/InternalCollectionsUtilities/_UniqueCollection.swift:39 — Keys's methods fall into 16 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 16 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: UnsafeHandle (LCOM4 13) Sources/HashTreeCollections/HashNode/_HashNode+Debugging.swift:54 — UnsafeHandle's methods fall into 13 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 13 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: OutputSpan (LCOM4 12) Sources/InternalCollectionsUtilities/OutputSpan+Extras.swift:29 — OutputSpan's methods fall into 12 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 12 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: Span (LCOM4 10) Sources/InternalCollectionsUtilities/Span+Extras.swift:50 — Span's methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: UTF16View (LCOM4 10) Sources/RopeModule/BigString/Views/BigString+UTF16View.swift:35 — UTF16View's methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: UTF8View (LCOM4 10) Sources/RopeModule/BigString/Views/BigString+UTF8View.swift:35 — UTF8View's methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: Index (LCOM4 9) Sources/BitCollections/BitSet/BitSet.Index.swift:48 — Index's methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: Builder (LCOM4 7) Sources/HashTreeCollections/HashNode/_HashNode+Builder.swift:43 — Builder's methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: String (LCOM4 6) Sources/InternalCollectionsUtilities/String+Padding.swift:14 — String's methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: Slice (LCOM4 5) Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer+Extras.swift:296 — Slice's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: Iterator (LCOM4 4) Sources/BitCollections/BitSet/BitSet+BidirectionalCollection.swift:121 — Iterator's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: StringProtocol (LCOM4 4) Sources/RopeModule/Utilities/String Utilities.swift:14 — StringProtocol's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×19
  • Duplicated block (5 lines × 2) Sources/DequeModule/_UnsafeDequeHandle.swift:566 — Sources/DequeModule/_UnsafeDequeHandle.swift:566-570 | Sources/DequeModule/_UnsafeDequeHandle.swift:585-589 — 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) Sources/HashTreeCollections/HashNode/_HashNode+Structural symmetricDifference.swift:167 — Sources/HashTreeCollections/HashNode/_HashNode+Structural symmetricDifference.swift:167-171 | Sources/HashTreeCollections/HashNode/_HashNode+Structural symmetricDifference.swift:177-181 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HashTreeCollections/HashNode/_HashNode+Structural symmetricDifference.swift:167` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift:155 — Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift:155-159 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer+Extras.swift:163-167 — before extracting anything, compare `Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift` and `Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer+Extras.swift` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 33 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift:155` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (5 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:200 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:200-204 | Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift:282-286 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift` and `Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) Sources/BasicContainers/UniqueDictionary/UniqueDictionary+Equatable.swift:22 — Sources/BasicContainers/UniqueDictionary/UniqueDictionary+Equatable.swift:22-26 | Sources/BasicContainers/UniqueSet/UniqueSet+Equatable.swift:22-26 — 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) Sources/ContainersPreview/Conformances/InputSpan+Container.swift:58 — Sources/ContainersPreview/Conformances/InputSpan+Container.swift:58-62 | Sources/ContainersPreview/Conformances/OutputSpan+Container.swift:49-53 — before extracting anything, compare `Sources/ContainersPreview/Conformances/InputSpan+Container.swift` and `Sources/ContainersPreview/Conformances/OutputSpan+Container.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 37 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 (5 lines × 2) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:131 — Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:131-135 | Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift:130-134 — before extracting anything, compare `Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift` and `Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (5 lines × 2) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:142 — Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:142-146 | Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift:141-145 — before extracting anything, compare `Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift` and `Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (5 lines × 2) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:210 — Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:210-214 | Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift:209-213 — before extracting anything, compare `Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift` and `Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:68 — Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:68-72 | Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift:68-72 — before extracting anything, compare `Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift` and `Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:79 — Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:79-83 | Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift:79-83 — before extracting anything, compare `Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift` and `Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:90 — Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:90-94 | Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift:90-94 — before extracting anything, compare `Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift` and `Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:102 — Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:102-106 | Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift:102-106 — before extracting anything, compare `Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift` and `Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:116 — Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:116-120 | Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift:116-120 — before extracting anything, compare `Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift` and `Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:132 — Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:132-136 | Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift:132-136 — before extracting anything, compare `Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift` and `Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift:380 — Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift:380-387 | Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift:49-53 — before extracting anything, compare `Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) Sources/SortedCollections/SortedDictionary/SortedDictionary.Index.swift:46 — Sources/SortedCollections/SortedDictionary/SortedDictionary.Index.swift:46-50 | Sources/SortedCollections/SortedSet/SortedSet.Index.swift:78-82 — 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) Sources/SortedCollections/SortedDictionary/SortedDictionary.Index.swift:55 — Sources/SortedCollections/SortedDictionary/SortedDictionary.Index.swift:55-59 | Sources/SortedCollections/SortedSet/SortedSet.Index.swift:87-91 — 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) Sources/RopeModule/BigString/Basics/BigString+Contents.swift:171 — Sources/RopeModule/BigString/Basics/BigString+Contents.swift:171-175 | Sources/RopeModule/BigString/Basics/BigString+Contents.swift:181-185 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/RopeModule/BigString/Basics/BigString+Contents.swift:171` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×16
  • Duplicated block (11 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:66 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:66-76 | Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift:35-45 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift` and `Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (11 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:78 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:78-88 | Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift:65-75 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift` and `Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (11 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Append.swift:174 — Sources/DequeModule/RigidDeque/RigidDeque+Append.swift:174-184 | Sources/DequeModule/UniqueDeque/UniqueDeque+Append.swift:161-171 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Append.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Append.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (11 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift:154 — Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift:154-164 | Sources/DequeModule/UniqueDeque/UniqueDeque+Prepend.swift:142-152 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Prepend.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (11 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift:177 — Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift:177-187 | Sources/DequeModule/UniqueDeque/UniqueDeque+Prepend.swift:167-177 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Prepend.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (11 lines × 2) Sources/HashTreeCollections/HashNode/_HashNode+Subtree Insertions.swift:393 — Sources/HashTreeCollections/HashNode/_HashNode+Subtree Insertions.swift:393-403 | Sources/HashTreeCollections/HashNode/_HashNode+Subtree Insertions.swift:438-448 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HashTreeCollections/HashNode/_HashNode+Subtree Insertions.swift:393` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 lines × 2) Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isStrictSuperset.swift:100 — Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isStrictSuperset.swift:100-110 | Sources/OrderedCollections/OrderedSet/OrderedSet+Partial SetAlgebra isStrictSuperset.swift:131-141 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 lines × 2) Sources/InternalCollectionsUtilities/MutableSpan+Extras.swift:45 — Sources/InternalCollectionsUtilities/MutableSpan+Extras.swift:45-55 | Sources/SpanPreview/MutableSpan+InputSpanHelpers.swift:31-41 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/InternalCollectionsUtilities/MutableSpan+Extras.swift:45` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 lines × 2) Sources/RopeModule/BigString/Conformances/BigString+Equatable.swift:32 — Sources/RopeModule/BigString/Conformances/BigString+Equatable.swift:32-42 | Sources/RopeModule/BigString/Views/BigSubstring.swift:81-91 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/RopeModule/BigString/Conformances/BigString+Equatable.swift:32` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 lines × 2) Sources/RopeModule/BigString/Conformances/BigString+Equatable.swift:64 — Sources/RopeModule/BigString/Conformances/BigString+Equatable.swift:64-74 | Sources/RopeModule/BigString/Conformances/BigString+Equatable.swift:92-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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/RopeModule/BigString/Conformances/BigString+Equatable.swift:64` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (11 lines × 2) Sources/SortedCollections/BTree/_BTree+UnsafeCursor.swift:392 — Sources/SortedCollections/BTree/_BTree+UnsafeCursor.swift:392-402 | Sources/SortedCollections/BTree/_BTree+UnsafeCursor.swift:447-457 — 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) Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:511 — Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:511-521 | Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:544-554 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:511` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 2) Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:153 — Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:153-163 | Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:354-364 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:153` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 2) Sources/ContainersPreview/Conformances/RigidArray+Container.swift:266 — Sources/ContainersPreview/Conformances/RigidArray+Container.swift:266-276 | Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:242-252 — before extracting anything, compare `Sources/ContainersPreview/Conformances/RigidArray+Container.swift` and `Sources/ContainersPreview/Conformances/RigidDeque+Container.swift` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 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 (11 lines × 2) Sources/ContainersPreview/Conformances/RigidArray+Container.swift:286 — Sources/ContainersPreview/Conformances/RigidArray+Container.swift:286-296 | Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:262-272 — before extracting anything, compare `Sources/ContainersPreview/Conformances/RigidArray+Container.swift` and `Sources/ContainersPreview/Conformances/RigidDeque+Container.swift` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 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 (11 lines × 2) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Keys.swift:320 — Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Keys.swift:320-330 | Sources/HashTreeCollections/TreeSet/TreeSet+Hashable.swift:19-29 — before extracting anything, compare `Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Keys.swift` and `Sources/HashTreeCollections/TreeSet/TreeSet+Hashable.swift` as WHOLE FILES: 96% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×15
  • Duplicated block (9 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:62 — Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:62-70 | Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:62-70 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift` and `Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:62` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) Sources/BasicContainers/RigidSet/RigidSet+Initializers.swift:97 — Sources/BasicContainers/RigidSet/RigidSet+Initializers.swift:97-105 | Sources/DequeModule/RigidDeque/RigidDeque+Initializers.swift:174-182 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/RigidSet/RigidSet+Initializers.swift:97` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) Sources/BasicContainers/RigidSet/RigidSet+Insertions.swift:192 — Sources/BasicContainers/RigidSet/RigidSet+Insertions.swift:192-200 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:837-845 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/RigidSet/RigidSet+Insertions.swift:192` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (9 lines × 2) Sources/BitCollections/BitArray/BitArray._UnsafeHandle.swift:135 — Sources/BitCollections/BitArray/BitArray._UnsafeHandle.swift:135-143 | Sources/BitCollections/BitArray/BitArray._UnsafeHandle.swift:155-163 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BitCollections/BitArray/BitArray._UnsafeHandle.swift:135` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (9 lines × 2) Sources/ContainersPreview/Conformances/MutableSpan+Container.swift:124 — Sources/ContainersPreview/Conformances/MutableSpan+Container.swift:124-132 | Sources/ContainersPreview/Conformances/MutableSpan+Container.swift:142-150 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/ContainersPreview/Conformances/MutableSpan+Container.swift:124` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (9 lines × 2) Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:216 — Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:216-224 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:527-535 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:216` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) Sources/HashTreeCollections/HashNode/_HashNode+Structural merge.swift:37 — Sources/HashTreeCollections/HashNode/_HashNode+Structural merge.swift:37-45 | Sources/HashTreeCollections/HashNode/_HashNode+Structural merge.swift:259-267 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HashTreeCollections/HashNode/_HashNode+Structural merge.swift:37` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) Sources/OrderedCollections/OrderedDictionary/OrderedDictionary+Move.swift:53 — Sources/OrderedCollections/OrderedDictionary/OrderedDictionary+Move.swift:53-61 | Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:59-67 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/OrderedCollections/OrderedDictionary/OrderedDictionary+Move.swift:53` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) Sources/RopeModule/Rope/Operations/Rope+Join.swift:63 — Sources/RopeModule/Rope/Operations/Rope+Join.swift:63-71 | Sources/RopeModule/Rope/Operations/Rope+Join.swift:102-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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/RopeModule/Rope/Operations/Rope+Join.swift:63` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (9 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Initializers.swift:106 — Sources/BasicContainers/RigidArray/RigidArray+Initializers.swift:106-114 | Sources/DequeModule/RigidDeque/RigidDeque+Initializers.swift:116-124 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Sources/BasicContainers/RigidArray/RigidArray+Initializers.swift:125` calls `available` and `Sources/DequeModule/RigidDeque/RigidDeque+Initializers.swift:133` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (9 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Initializers.swift:169 — Sources/BasicContainers/RigidArray/RigidArray+Initializers.swift:169-177 | Sources/DequeModule/RigidDeque/RigidDeque+Initializers.swift:133-141 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Sources/DequeModule/RigidDeque/RigidDeque+Initializers.swift:151` calls `available` and `Sources/BasicContainers/RigidArray/RigidArray+Initializers.swift:187` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (9 lines × 2) Sources/BasicContainers/UniqueArray/UniqueArray+Insertions.swift:265 — Sources/BasicContainers/UniqueArray/UniqueArray+Insertions.swift:265-273 | Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift:278-286 — 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) Sources/BasicContainers/UniqueDictionary/UniqueDictionary+Removals.swift:38 — Sources/BasicContainers/UniqueDictionary/UniqueDictionary+Removals.swift:38-46 | Sources/BasicContainers/UniqueSet/UniqueSet+Removals.swift:37-45 — 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) Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift:307 — Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift:307-315 | Sources/DequeModule/UniqueDeque/UniqueDeque+Insertions.swift:324-332 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Insertions.swift` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift:361 — Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift:361-369 | Sources/DequeModule/UniqueDeque/UniqueDeque+Insertions.swift:380-388 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Insertions.swift` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×15
  • Duplicated block (6 lines × 2) Sources/RopeModule/Rope/Basics/Rope+_UnsafeHandle.swift:189 — Sources/RopeModule/Rope/Basics/Rope+_UnsafeHandle.swift:189-194 | Sources/RopeModule/Rope/Basics/Rope+_UnsafeHandle.swift:207-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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/RopeModule/Rope/Basics/Rope+_UnsafeHandle.swift:189` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) Sources/RopeModule/Rope/Operations/Rope+Join.swift:83 — Sources/RopeModule/Rope/Operations/Rope+Join.swift:83-88 | Sources/RopeModule/Rope/Operations/Rope+Join.swift:119-124 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/RopeModule/Rope/Operations/Rope+Join.swift:83` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (6 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:23 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:23-28 | Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift:28-33 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift` and `Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (6 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Removals.swift:135 — Sources/BasicContainers/RigidArray/RigidArray+Removals.swift:135-140 | Sources/BasicContainers/UniqueArray/UniqueArray+Removals.swift:117-124 — 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) Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift:372 — Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift:372-378 | Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift:84-89 — before extracting anything, compare `Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (6 lines × 2) Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift:389 — Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift:389-396 | Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift:91-96 — before extracting anything, compare `Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (6 lines × 2) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:194 — Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:194-199 | Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift:193-198 — before extracting anything, compare `Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift` and `Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (6 lines × 2) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:304 — Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:304-309 | Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift:370-375 — before extracting anything, compare `Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift` and `Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (6 lines × 2) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Keys.swift:154 — Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Keys.swift:154-159 | Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Values.swift:140-145 — 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 (6 lines × 2) Sources/DequeModule/UniqueDeque/UniqueDeque+Append.swift:30 — Sources/DequeModule/UniqueDeque/UniqueDeque+Append.swift:30-35 | Sources/DequeModule/UniqueDeque/UniqueDeque+Prepend.swift:30-35 — 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 (6 lines × 2) Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra formSymmetricDifference.swift:50 — Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra formSymmetricDifference.swift:50-55 | Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra formUnion.swift:59-64 — 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 (6 lines × 2) Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isDisjoint.swift:52 — Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isDisjoint.swift:52-57 | Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isSubset.swift:60-65 — 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 (6 lines × 2) Sources/RopeModule/BigString/Views/BigSubstring+UnicodeScalarView.swift:269 — Sources/RopeModule/BigString/Views/BigSubstring+UnicodeScalarView.swift:269-274 | Sources/RopeModule/BigString/Views/BigSubstring.swift:311-316 — 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 (6 lines × 2) Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:57 — Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:57-62 | Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift:57-62 — before extracting anything, compare `Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift` and `Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (6 lines × 2) Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:173 — Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift:173-178 | Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift:173-178 — before extracting anything, compare `Sources/SortedCollections/SortedDictionary/SortedDictionary+BidirectionalCollection.swift` and `Sources/SortedCollections/SortedSet/SortedSet+BidirectionalCollection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×10
  • Duplicated block (10 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:97 — Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:97-106 | Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift:95-104 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift` and `Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:97` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 2) Sources/BasicContainers/RigidSet/RigidSet+Insertions.swift:205 — Sources/BasicContainers/RigidSet/RigidSet+Insertions.swift:205-215 | Sources/BasicContainers/UniqueSet/UniqueSet+Insertions.swift:107-116 — 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) Sources/BitCollections/BitSet/BitSet+SetAlgebra isSubset.swift:120 — Sources/BitCollections/BitSet/BitSet+SetAlgebra isSubset.swift:120-129 | Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isSubset.swift:92-101 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (10 lines × 2) Sources/ContainersPreview/Protocols/Container/BidirectionalContainer.swift:188 — Sources/ContainersPreview/Protocols/Container/BidirectionalContainer.swift:188-197 | Sources/ContainersPreview/Protocols/Container/Container.swift:388-397 — 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) Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:65 — Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:65-74 | Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:141-150 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:65` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (10 lines × 2) Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:39 — Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:39-48 | Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift:39-48 — before extracting anything, compare `Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift` and `Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:39` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (10 lines × 2) Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:59 — Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:59-68 | Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift:61-70 — before extracting anything, compare `Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift` and `Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:59` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 2) Sources/InternalCollectionsUtilities/MutableSpan+Extras.swift:78 — Sources/InternalCollectionsUtilities/MutableSpan+Extras.swift:78-87 | Sources/SpanPreview/MutableSpan+InputSpanHelpers.swift:64-73 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/InternalCollectionsUtilities/MutableSpan+Extras.swift:78` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (10 lines × 2) Sources/RopeModule/BigString/Operations/BigString+Append.swift:83 — Sources/RopeModule/BigString/Operations/BigString+Append.swift:83-92 | Sources/RopeModule/BigString/Operations/BigString+Append.swift:97-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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/RopeModule/BigString/Operations/BigString+Append.swift:83` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 2) Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:202 — Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:202-211 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:513-522 — 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.
D4 · Code Duplication · Duplicated block (9 lines × 3) · ×7
  • Duplicated block (9 lines × 3) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:217 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:217-225 | Sources/DequeModule/RigidDeque/RigidDeque+Deprecations.swift:117-125 | Sources/DequeModule/UniqueDeque/UniqueDeque+Deprecations.swift:135-143 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times.
  • Duplicated block (9 lines × 3) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:254 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:254-262 | Sources/DequeModule/RigidDeque/RigidDeque+Deprecations.swift:191-199 | Sources/DequeModule/UniqueDeque/UniqueDeque+Deprecations.swift:211-219 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `Sources/DequeModule/UniqueDeque/UniqueDeque+Deprecations.swift:182` calls `available` and `Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:252` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (9 lines × 3) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:264 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:264-272 | Sources/DequeModule/RigidDeque/RigidDeque+Deprecations.swift:227-235 | Sources/DequeModule/UniqueDeque/UniqueDeque+Deprecations.swift:248-256 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times.
  • Duplicated block (9 lines × 3) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:283 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:283-291 | Sources/DequeModule/RigidDeque/RigidDeque+Deprecations.swift:298-306 | Sources/DequeModule/UniqueDeque/UniqueDeque+Deprecations.swift:321-329 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times.
  • Duplicated block (9 lines × 3) Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:482 — Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:482-492 | Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:360-368 | Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:372-380 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift` and `Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 3) Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:584 — Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:584-595 | Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:460-468 | Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:474-482 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift` and `Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 3) Sources/OrderedCollections/OrderedDictionary/OrderedDictionary+Elements.SubSequence.swift:287 — Sources/OrderedCollections/OrderedDictionary/OrderedDictionary+Elements.SubSequence.swift:287-295 | Sources/OrderedCollections/OrderedDictionary/OrderedDictionary+Elements.swift:250-258 | Sources/OrderedCollections/OrderedDictionary/OrderedDictionary+Values.swift:252-260 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×5
  • Duplicated block (13 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:114 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:114-126 | Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift:120-132 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift` and `Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (13 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:148 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:148-160 | Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift:155-167 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift` and `Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (13 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:88 — Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:88-100 | Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:192-204 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:88` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. The matched lines also register a scope-exit action (a `defer`-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead — before the caller uses what it releases — so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register.
  • Duplicated block (13 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Append.swift:248 — Sources/DequeModule/RigidDeque/RigidDeque+Append.swift:248-260 | Sources/DequeModule/UniqueDeque/UniqueDeque+Append.swift:238-250 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Append.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Append.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (13 lines × 2) Sources/RopeModule/Rope/Operations/Rope+Remove.swift:63 — Sources/RopeModule/Rope/Operations/Rope+Remove.swift:63-75 | Sources/RopeModule/Rope/Operations/Rope+Remove.swift:133-145 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/RopeModule/Rope/Operations/Rope+Remove.swift:63` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×5
  • Duplicated block (12 lines × 2) Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:151 — Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:151-162 | Sources/ContainersPreview/Conformances/UniqueDeque+Container.swift:85-96 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:151` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift:336 — Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift:336-347 | Sources/DequeModule/UniqueDeque/UniqueDeque+Prepend.swift:329-340 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Prepend.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift:336` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 2) Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isStrictSubset.swift:101 — Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isStrictSubset.swift:101-112 | Sources/OrderedCollections/OrderedSet/OrderedSet+Partial SetAlgebra isStrictSubset.swift:130-141 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (12 lines × 2) Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:550 — Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:550-561 | Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:572-583 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:550` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 2) Sources/OrderedCollections/OrderedSet/OrderedSet+Partial SetAlgebra isDisjoint.swift:44 — Sources/OrderedCollections/OrderedSet/OrderedSet+Partial SetAlgebra isDisjoint.swift:44-55 | Sources/OrderedCollections/OrderedSet/OrderedSet+Partial SetAlgebra isDisjoint.swift:95-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
D4 · Code Duplication · Duplicated block (22 lines × 2) · ×4
  • Duplicated block (22 lines × 2) Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:590 — Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:590-611 | Sources/DequeModule/_UnsafeDequeHandle.swift:1062-1083 — before extracting anything, compare `Sources/DequeModule/Deque/Deque._UnsafeHandle.swift` and `Sources/DequeModule/_UnsafeDequeHandle.swift` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:590` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (22 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift:318 — Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift:318-339 | Sources/DequeModule/UniqueDeque/UniqueDeque+Insertions.swift:335-356 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Insertions.swift` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (22 lines × 2) Sources/BasicContainers/UniqueDictionary/UniqueDictionary+Resizing.swift:18 — Sources/BasicContainers/UniqueDictionary/UniqueDictionary+Resizing.swift:18-39 | Sources/BasicContainers/UniqueSet/UniqueSet+Resizing.swift:18-39 — before extracting anything, compare `Sources/BasicContainers/UniqueDictionary/UniqueDictionary+Resizing.swift` and `Sources/BasicContainers/UniqueSet/UniqueSet+Resizing.swift` as WHOLE FILES: 96% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (22 lines × 2) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Debugging.swift:25 — Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Debugging.swift:25-46 | Sources/HashTreeCollections/TreeSet/TreeSet+Debugging.swift:25-46 — before extracting anything, compare `Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Debugging.swift` and `Sources/HashTreeCollections/TreeSet/TreeSet+Debugging.swift` as WHOLE FILES: 97% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (7 lines × 3) · ×4
  • Duplicated block (7 lines × 3) Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:218 — Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:218-224 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:265-271 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:529-535 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:218` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (7 lines × 3) Sources/BasicContainers/UniqueArray/UniqueArray+Append.swift:206 — Sources/BasicContainers/UniqueArray/UniqueArray+Append.swift:206-212 | Sources/DequeModule/RigidDeque/RigidDeque+Append.swift:222-228 | Sources/DequeModule/UniqueDeque/UniqueDeque+Append.swift:211-217 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Append.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Append.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 3) Sources/ContainersPreview/Conformances/UniqueArray+Container.swift:25 — Sources/ContainersPreview/Conformances/UniqueArray+Container.swift:25-31 | Sources/ContainersPreview/Conformances/UniqueDeque+Container.swift:27-33 | Sources/ContainersPreview/Conformances/UniqueSet+Container.swift:32-38 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
  • Duplicated block (7 lines × 3) Sources/DequeModule/Deque/Deque+Hashable.swift:19 — Sources/DequeModule/Deque/Deque+Hashable.swift:19-25 | Sources/OrderedCollections/OrderedDictionary/OrderedDictionary+Values.swift:400-406 | Sources/OrderedCollections/OrderedSet/OrderedSet+SubSequence.swift:375-381 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times.
D35 · Change Coupling · Change coupling · ×3
  • Change coupling: RigidDeque+ContainerOperations.swift ↔ UniqueDeque+ContainerOperations.swift Sources/DequeModule/RigidDeque/RigidDeque+ContainerOperations.swift:1 — `Sources/DequeModule/RigidDeque/RigidDeque+ContainerOperations.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift` change together 100% of the time (11 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder — so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `e75f053e` Update MutableContainer (at that commit the files were still `Sources/DequeModule/RigidDeque/RigidDeque+Container.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Container.swift`); `95395ad9` Add BidirectionalContainer.spanBoundary(before:maxDistance:limitedBy:… (at that commit the files were still `Sources/DequeModule/RigidDeque/RigidDeque+Container.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Container.swift`); `e70b4df2` Introduce Container.nextSpan(after:maxCount:limitedBy:) and make it t… (at that commit the files were still `Sources/DequeModule/RigidDeque/RigidDeque+Container.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Container.swift`) — run `git show` on any of them.
  • Change coupling: UniqueArray+ContainerOperations.swift ↔ UniqueDeque+ContainerOperations.swift Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift:1 — `Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift` change together 100% of the time (11 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder — so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `e75f053e` Update MutableContainer (at that commit the files were still `Sources/BasicContainers/UniqueArray/UniqueArray+Container.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Container.swift`); `95395ad9` Add BidirectionalContainer.spanBoundary(before:maxDistance:limitedBy:… (at that commit the files were still `Sources/BasicContainers/UniqueArray/UniqueArray+Container.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Container.swift`); `e70b4df2` Introduce Container.nextSpan(after:maxCount:limitedBy:) and make it t… (at that commit the files were still `Sources/BasicContainers/UniqueArray/UniqueArray+Container.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Container.swift`) — run `git show` on any of them.
  • Change coupling: UniqueArray+ContainerOperations.swift ↔ RigidDeque+ContainerOperations.swift Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift:1 — `Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift` and `Sources/DequeModule/RigidDeque/RigidDeque+ContainerOperations.swift` change together 69% of the time (11 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder — so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `e75f053e` Update MutableContainer (at that commit the files were still `Sources/BasicContainers/UniqueArray/UniqueArray+Container.swift` and `Sources/DequeModule/RigidDeque/RigidDeque+Container.swift`); `95395ad9` Add BidirectionalContainer.spanBoundary(before:maxDistance:limitedBy:… (at that commit the files were still `Sources/BasicContainers/UniqueArray/UniqueArray+Container.swift` and `Sources/DequeModule/RigidDeque/RigidDeque+Container.swift`); `e70b4df2` Introduce Container.nextSpan(after:maxCount:limitedBy:) and make it t… (at that commit the files were still `Sources/BasicContainers/UniqueArray/UniqueArray+Container.swift` and `Sources/DequeModule/RigidDeque/RigidDeque+Container.swift`) — run `git show` on any of them.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×3
  • Members sharing a duplicated core (4 members, 50+ identical tokens) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:206 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:206-215 | Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift:186-195 | Sources/DequeModule/RigidDeque/RigidDeque+Deprecations.swift:78-87 | Sources/DequeModule/UniqueDeque/UniqueDeque+Deprecations.swift:95-104 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) Sources/ContainersPreview/Conformances/InputSpan+Container.swift:94 — Sources/ContainersPreview/Conformances/InputSpan+Container.swift:94-103 | Sources/ContainersPreview/Conformances/OutputSpan+Container.swift:85-94 | Sources/DequeModule/RigidDeque/RigidDeque+ContainerOperations.swift:104-113 | Sources/InternalCollectionsUtilities/Span+Extras.swift:100-109 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:547 — Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:547-672 | Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:759-865 | Sources/DequeModule/_UnsafeDequeHandle.swift:1021-1144 | Sources/DequeModule/_UnsafeDequeHandle.swift:1152-1257 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×3
  • Duplicated block (19 lines × 2) Sources/BasicContainers/HashTable/_HTable+Iteration.swift:250 — Sources/BasicContainers/HashTable/_HTable+Iteration.swift:250-268 | Sources/BasicContainers/HashTable/_HTable+Iteration.swift:329-347 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/HashTable/_HTable+Iteration.swift:250` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (19 lines × 2) Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:797 — Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:797-815 | Sources/DequeModule/_UnsafeDequeHandle.swift:1189-1207 — before extracting anything, compare `Sources/DequeModule/Deque/Deque._UnsafeHandle.swift` and `Sources/DequeModule/_UnsafeDequeHandle.swift` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:797` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (19 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift:132 — Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift:132-150 | Sources/DequeModule/UniqueDeque/UniqueDeque+Insertions.swift:138-156 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Insertions.swift` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×3
  • Duplicated block (14 lines × 2) Sources/ContainersPreview/Conformances/RigidArray+Container.swift:204 — Sources/ContainersPreview/Conformances/RigidArray+Container.swift:204-217 | Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:79-92 — before extracting anything, compare `Sources/ContainersPreview/Conformances/RigidArray+Container.swift` and `Sources/ContainersPreview/Conformances/RigidDeque+Container.swift` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 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 (14 lines × 2) Sources/HashTreeCollections/HashNode/_HashNode+Subtree Insertions.swift:56 — Sources/HashTreeCollections/HashNode/_HashNode+Subtree Insertions.swift:56-69 | Sources/HashTreeCollections/HashNode/_HashNode+Subtree Insertions.swift:163-176 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HashTreeCollections/HashNode/_HashNode+Subtree Insertions.swift:56` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `slot` to `_HashSlot` in one and `let` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (14 lines × 2) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:263 — Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift:263-276 | Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift:262-275 — before extracting anything, compare `Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Collection.swift` and `Sources/HashTreeCollections/TreeSet/TreeSet+Collection.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (10 lines × 3) · ×3
  • Duplicated block (10 lines × 3) Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:143 — Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:143-152 | Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift:148-157 | Sources/HashTreeCollections/HashNode/_HashNode+Structural union.swift:191-200 — before extracting anything, compare `Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift` and `Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:143` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (10 lines × 3) Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:520 — Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:520-529 | Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:396-405 | Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:409-418 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift` and `Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (10 lines × 3) Sources/BitCollections/BitSet/BitSet+SetAlgebra subtracting.swift:31 — Sources/BitCollections/BitSet/BitSet+SetAlgebra subtracting.swift:31-40 | Sources/BitCollections/BitSet/BitSet+SetAlgebra symmetricDifference.swift:31-40 | Sources/BitCollections/BitSet/BitSet+SetAlgebra union.swift:28-37 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (8 lines × 3) · ×3
  • Duplicated block (8 lines × 3) Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:165 — Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:165-172 | Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:224-231 | Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:268-275 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:165` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (8 lines × 3) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:227 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:227-234 | Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift:234-241 | Sources/DequeModule/UniqueDeque/UniqueDeque+Deprecations.swift:172-179 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift` and `Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Sources/DequeModule/UniqueDeque/UniqueDeque+Deprecations.swift:182` calls `available` and `Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:236` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (8 lines × 3) Sources/BasicContainers/RigidSet/RigidSet+Initializers.swift:39 — Sources/BasicContainers/RigidSet/RigidSet+Initializers.swift:39-46 | Sources/BasicContainers/UniqueSet/UniqueSet+Initializers.swift:38-47 | Sources/ContainersPreview/Protocols/Container/DynamicContainer.swift:51-58 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times.
D15 · Churn × Complexity Hotspots · Hotspot · ×2
  • Hotspot: Benchmarks/Sources/Benchmarks/BitsetBenchmarks.swift Benchmarks/Sources/Benchmarks/BitsetBenchmarks.swift:19 — Benchmarks/Sources/Benchmarks/BitsetBenchmarks.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Benchmark.addBitSetBenchmarks at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 18:20:51 -07:00' --until='2026-10-26 18:20:51 -07:00' --full-history --no-merges -- Benchmarks/Sources/Benchmarks/BitsetBenchmarks.swift`: 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: Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:265 — Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in OrderedSet._move at line 265. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 18:20:51 -07:00' --until='2026-10-26 18:20:51 -07:00' --full-history --no-merges -- Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift`: 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.
D4 · Code Duplication · Duplicated block (25 lines × 2) · ×2
  • Duplicated block (25 lines × 2) Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:127 — Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:127-151 | Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift:132-156 — before extracting anything, compare `Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift` and `Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:127` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (25 lines × 2) Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isEqualSet.swift:82 — Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isEqualSet.swift:82-106 | Sources/OrderedCollections/OrderedSet/OrderedSet+Partial SetAlgebra isEqualSet.swift:51-75 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isEqualSet.swift:82` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×2
  • Duplicated block (17 lines × 2) Sources/ContainersPreview/Conformances/RigidArray+Container.swift:236 — Sources/ContainersPreview/Conformances/RigidArray+Container.swift:236-252 | Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:111-127 — before extracting anything, compare `Sources/ContainersPreview/Conformances/RigidArray+Container.swift` and `Sources/ContainersPreview/Conformances/RigidDeque+Container.swift` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Sources/ContainersPreview/Conformances/RigidArray+Container.swift:256` calls `available` and `Sources/ContainersPreview/Conformances/RigidDeque+Container.swift:151` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (17 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:316 — Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:316-332 | Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:327-343 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×2
  • Duplicated block (16 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift:240 — Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift:240-255 | Sources/DequeModule/UniqueDeque/UniqueDeque+Insertions.swift:253-268 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Insertions.swift` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (16 lines × 2) Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:110 — Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:110-125 | Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:215-230 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:110` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (12–13 lines × 3) · ×2
  • Duplicated block (12–13 lines × 3) Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:171 — Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:171-183 | Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift:170-181 | Sources/DequeModule/UniqueDeque/UniqueDeque+Insertions.swift:178-189 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift` and `Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (12–13 lines × 3) Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:202 — Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:202-214 | Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift:201-212 | Sources/DequeModule/UniqueDeque/UniqueDeque+Insertions.swift:211-222 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift` and `Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Sources/DequeModule/RigidDeque/RigidDeque+Insertions.swift:215` calls `available` and `Sources/BasicContainers/RigidArray/RigidArray+Insertions.swift:233` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (12 lines × 3) · ×2
  • Duplicated block (12 lines × 3) Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:280 — Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:280-291 | Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:234-245 | Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:243-254 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift` and `Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (12 lines × 3) Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:320 — Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:320-331 | Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:274-285 | Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:284-295 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift` and `Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:288` calls `available` and `Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:361` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (10–11 lines × 2) · ×2
  • Duplicated block (10–11 lines × 2) Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:62 — Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:62-72 | Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:75-84 — before extracting anything, compare `Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:62` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10–11 lines × 2) Sources/HashTreeCollections/HashNode/_HashNode+Structural symmetricDifference.swift:70 — Sources/HashTreeCollections/HashNode/_HashNode+Structural symmetricDifference.swift:70-80 | Sources/HashTreeCollections/HashNode/_HashNode+Structural symmetricDifference.swift:96-105 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HashTreeCollections/HashNode/_HashNode+Structural symmetricDifference.swift:70` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `Sources/HashTreeCollections/HashNode/_HashNode+Structural symmetricDifference.swift:69` calls `mapValuesToVoid` and `Sources/HashTreeCollections/HashNode/_HashNode+Structural symmetricDifference.swift:95` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (9–10 lines × 2) · ×2
  • Duplicated block (9–10 lines × 2) Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:65 — Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:65-73 | Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:158-167 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:65` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (9–10 lines × 2) Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:166 — Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:166-174 | Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:269-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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:166` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D4 · Code Duplication · Duplicated block (8 lines × 4) · ×2
  • Duplicated block (8 lines × 4) Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:601 — Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:601-611 | Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:852-859 | Sources/DequeModule/_UnsafeDequeHandle.swift:1073-1083 | Sources/DequeModule/_UnsafeDequeHandle.swift:1244-1251 — before extracting anything, compare `Sources/DequeModule/Deque/Deque._UnsafeHandle.swift` and `Sources/DequeModule/_UnsafeDequeHandle.swift` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:601` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 4) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:274 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:274-281 | Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift:306-313 | Sources/DequeModule/RigidDeque/RigidDeque+Deprecations.swift:263-270 | Sources/DequeModule/UniqueDeque/UniqueDeque+Deprecations.swift:285-292 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift` and `Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:285` calls `inline` and `Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift:317` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×2
  • Duplicated block (6 lines × 3) Sources/ContainersPreview/Conformances/InputSpan+Container.swift:94 — Sources/ContainersPreview/Conformances/InputSpan+Container.swift:94-99 | Sources/ContainersPreview/Conformances/OutputSpan+Container.swift:85-90 | Sources/DequeModule/RigidDeque/RigidDeque+ContainerOperations.swift:104-109 — before extracting anything, compare `Sources/ContainersPreview/Conformances/InputSpan+Container.swift` and `Sources/ContainersPreview/Conformances/OutputSpan+Container.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 37 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/ContainersPreview/Conformances/InputSpan+Container.swift:94` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 3) Sources/BasicContainers/RigidArray/RigidArray+ContainerOperations.swift:301 — Sources/BasicContainers/RigidArray/RigidArray+ContainerOperations.swift:301-306 | Sources/DequeModule/RigidDeque/RigidDeque+ContainerOperations.swift:42-47 | Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift:42-47 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+ContainerOperations.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift` as WHOLE FILES: 82% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (5 lines × 4) · ×2
  • Duplicated block (5 lines × 4) Sources/BasicContainers/RigidArray/RigidArray+ContainerOperations.swift:433 — Sources/BasicContainers/RigidArray/RigidArray+ContainerOperations.swift:433-437 | Sources/ContainersPreview/Conformances/InputSpan+Container.swift:88-92 | Sources/ContainersPreview/Conformances/OutputSpan+Container.swift:79-83 | Sources/ContainersPreview/Conformances/Span+Container.swift:82-88 — before extracting anything, compare `Sources/ContainersPreview/Conformances/InputSpan+Container.swift` and `Sources/ContainersPreview/Conformances/OutputSpan+Container.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 37 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 (5 lines × 4) Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift:27 — Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift:27-31 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer+Extras.swift:28-32 | Sources/InternalCollectionsUtilities/UnsafeMutableRawBufferPointer+Extras.swift:18-22 | Sources/InternalCollectionsUtilities/UnsafeRawBufferPointer+Extras.swift:17-21 — before extracting anything, compare `Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift` and `Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer+Extras.swift` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 33 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.
D5 · Coupling · Off the main sequence · ×2
  • Off the main sequence: InternalCollectionsUtilities — InternalCollectionsUtilities: abstractness 0.22, instability 0.00, distance 0.78 — zone of pain — concrete and depended on by 10 project(s), so it's rigid to change.
  • Off the main sequence: SpanPreview — SpanPreview: 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.
D1 · Cyclomatic Complexity · _HashNode._intersection (cyclomatic 21) · ×1
  • _HashNode._intersection (cyclomatic 21) Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:28 — _HashNode._intersection 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.
D1 · Cyclomatic Complexity · _HashNode._subtracting (cyclomatic 21) · ×1
  • _HashNode._subtracting (cyclomatic 21) Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift:28 — _HashNode._subtracting 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.
D1 · Cyclomatic Complexity · OrderedSet._updateHashAfterContiguousMove (cyclomatic 21) · ×1
  • OrderedSet._updateHashAfterContiguousMove (cyclomatic 21) Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:435 — OrderedSet._updateHashAfterContiguousMove 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.
D1 · Cyclomatic Complexity · _HTable.checkInvariants (cyclomatic 20) · ×1
  • _HTable.checkInvariants (cyclomatic 20) Sources/BasicContainers/HashTable/_HTable+Debug.swift:85 — _HTable.checkInvariants 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.
D1 · Cyclomatic Complexity · _UnsafeBitSet.index (cyclomatic 20) · ×1
  • _UnsafeBitSet.index (cyclomatic 20) Sources/InternalCollectionsUtilities/UnsafeBitSet/_UnsafeBitSet.swift:425 — _UnsafeBitSet.index has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _HashNode.isSubset (cyclomatic 19) · ×1
  • _HashNode.isSubset (cyclomatic 19) Sources/HashTreeCollections/HashNode/_HashNode+Structural isSubset.swift:17 — _HashNode.isSubset 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.
D1 · Cyclomatic Complexity · BorrowingIteratorProtocol._elementsEqual (cyclomatic 19) · ×1
  • BorrowingIteratorProtocol._elementsEqual (cyclomatic 19) Sources/InternalCollectionsUtilities/BorrowingIteratorProtocol+Equality.swift:22 — BorrowingIteratorProtocol._elementsEqual 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.
D1 · Cyclomatic Complexity · BitSet.isEqualSet (cyclomatic 18) · ×1
  • BitSet.isEqualSet (cyclomatic 18) Sources/BitCollections/BitSet/BitSet+SetAlgebra isEqualSet.swift:61 — BitSet.isEqualSet 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.
D1 · Cyclomatic Complexity · _HashNode._intersection_slow (cyclomatic 18) · ×1
  • _HashNode._intersection_slow (cyclomatic 18) Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:109 — _HashNode._intersection_slow 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.
D1 · Cyclomatic Complexity · _HashNode._subtracting_slow (cyclomatic 18) · ×1
  • _HashNode._subtracting_slow (cyclomatic 18) Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift:112 — _HashNode._subtracting_slow 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.
D1 · Cyclomatic Complexity · _HashNode._symmetricDifference (cyclomatic 18) · ×1
  • _HashNode._symmetricDifference (cyclomatic 18) Sources/HashTreeCollections/HashNode/_HashNode+Structural symmetricDifference.swift:27 — _HashNode._symmetricDifference 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.
D1 · Cyclomatic Complexity · _HashNode._union (cyclomatic 16) · ×1
  • _HashNode._union (cyclomatic 16) Sources/HashTreeCollections/HashNode/_HashNode+Structural union.swift:45 — _HashNode._union 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.
D1 · Cyclomatic Complexity · BorrowingIteratorProtocol._spanwiseZip (cyclomatic 16) · ×1
  • BorrowingIteratorProtocol._spanwiseZip (cyclomatic 16) Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol+SpanwiseZip.swift:30 — BorrowingIteratorProtocol._spanwiseZip 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.
D1 · Cyclomatic Complexity · OrderedSet._move (cyclomatic 16) · ×1
  • OrderedSet._move (cyclomatic 16) Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:265 — OrderedSet._move 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.
D1 · Cyclomatic Complexity · _Chunk.formCharacterIndex (cyclomatic 16) · ×1
  • _Chunk.formCharacterIndex (cyclomatic 16) Sources/RopeModule/BigString/Chunk/BigString+Chunk+Character.swift:305 — _Chunk.formCharacterIndex 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.
D1 · Cyclomatic Complexity · _Chunk.resyncBreaks (cyclomatic 16) · ×1
  • _Chunk.resyncBreaks (cyclomatic 16) Sources/RopeModule/BigString/Operations/BigString+Managing Breaks.swift:177 — _Chunk.resyncBreaks 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.
D15 · Churn × Complexity Hotspots · Repeated repair · ×1
  • Repeated repair: Sources/BitCollections/BitSet/BitSet.Counted.swift Sources/BitCollections/BitSet/BitSet.Counted.swift:217 — Sources/BitCollections/BitSet/BitSet.Counted.swift 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 2 (its worst body is Counted.== at line 217), 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: “[BitCollections] Fix BitSet intersection doc examples for Range inputs”; “[BitCollections] Fix BitSet.Counted.isEqualSet(to:) rejecting sequences with duplicates”; “[BitCollections] Fix BitSet.Counted.update(with:) not maintaining the cached count”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 18:20:51 -07:00' --until='2026-10-26 18:20:51 -07:00' --full-history --no-merges -- Sources/BitCollections/BitSet/BitSet.Counted.swift`: 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.
D17 · Explicit Debt · XxxComment · ×1
  • XxxComment Utils/Debugger/formatter_bytecode.py:938 — # XXX: Does not handle multiple comparisons, ex: `0 < x < 10` — 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.
D2 · Cognitive Complexity · OrderedSet._updateHashAfterContiguousMove (cognitive 41) · ×1
  • OrderedSet._updateHashAfterContiguousMove (cognitive 41) Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:435 — OrderedSet._updateHashAfterContiguousMove has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (14 pts), boolean chains 6, ternaries 2 (6 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.
D2 · Cognitive Complexity · _UnsafeHashTable.adjustContents (cognitive 41) · ×1
  • _UnsafeHashTable.adjustContents (cognitive 41) Sources/OrderedCollections/HashTable/_HashTable+UnsafeHandle.swift:451 — _UnsafeHashTable.adjustContents has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 4 (12 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · BorrowingIteratorProtocol._spanwiseZip (cognitive 38) · ×1
  • BorrowingIteratorProtocol._spanwiseZip (cognitive 38) Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol+SpanwiseZip.swift:30 — BorrowingIteratorProtocol._spanwiseZip has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · OrderedSet._updateHashAfterMove (cognitive 38) · ×1
  • OrderedSet._updateHashAfterMove (cognitive 38) Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:503 — OrderedSet._updateHashAfterMove has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 5 (16 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.
D2 · Cognitive Complexity · _UnsafeBitSet.index (cognitive 36) · ×1
  • _UnsafeBitSet.index (cognitive 36) Sources/InternalCollectionsUtilities/UnsafeBitSet/_UnsafeBitSet.swift:425 — _UnsafeBitSet.index has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 5 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _HashNode._subtracting (cognitive 35) · ×1
  • _HashNode._subtracting (cognitive 35) Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift:28 — _HashNode._subtracting has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 4, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BorrowingIteratorProtocol._elementsEqual (cognitive 34) · ×1
  • BorrowingIteratorProtocol._elementsEqual (cognitive 34) Sources/InternalCollectionsUtilities/BorrowingIteratorProtocol+Equality.swift:22 — BorrowingIteratorProtocol._elementsEqual has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 6 (10 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _HashNode._intersection (cognitive 33) · ×1
  • _HashNode._intersection (cognitive 33) Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:28 — _HashNode._intersection has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 3, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _HTable.checkInvariants (cognitive 31) · ×1
  • _HTable.checkInvariants (cognitive 31) Sources/BasicContainers/HashTable/_HTable+Debug.swift:85 — _HTable.checkInvariants has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _HashNode._symmetricDifference (cognitive 31) · ×1
  • _HashNode._symmetricDifference (cognitive 31) Sources/HashTreeCollections/HashNode/_HashNode+Structural symmetricDifference.swift:27 — _HashNode._symmetricDifference has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 4, 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.
D2 · Cognitive Complexity · _HashNode.isSubset (cognitive 30) · ×1
  • _HashNode.isSubset (cognitive 30) Sources/HashTreeCollections/HashNode/_HashNode+Structural isSubset.swift:17 — _HashNode.isSubset has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (27 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.
D2 · Cognitive Complexity · TreeSet.isStrictSubset (cognitive 30) · ×1
  • TreeSet.isStrictSubset (cognitive 30) Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isStrictSubset.swift:94 — TreeSet.isStrictSubset has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BitSet.isEqualSet (cognitive 28) · ×1
  • BitSet.isEqualSet (cognitive 28) Sources/BitCollections/BitSet/BitSet+SetAlgebra isEqualSet.swift:61 — BitSet.isEqualSet has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 3 (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.
D2 · Cognitive Complexity · _HashNode._intersection_slow (cognitive 28) · ×1
  • _HashNode._intersection_slow (cognitive 28) Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:109 — _HashNode._intersection_slow has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 3, 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.
D2 · Cognitive Complexity · _HashNode._merge_slow (cognitive 28) · ×1
  • _HashNode._merge_slow (cognitive 28) Sources/HashTreeCollections/HashNode/_HashNode+Structural merge.swift:198 — _HashNode._merge_slow has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 2 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _UnsafeHashTable.adjustContents (cognitive 28) · ×1
  • _UnsafeHashTable.adjustContents (cognitive 28) Sources/OrderedCollections/HashTable/_HashTable+UnsafeHandle.swift:392 — _UnsafeHashTable.adjustContents has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (12 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.
D2 · Cognitive Complexity · _HashNode._subtracting_slow (cognitive 27) · ×1
  • _HashNode._subtracting_slow (cognitive 27) Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift:112 — _HashNode._subtracting_slow has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · OrderedSet.isStrictSubset (cognitive 27) · ×1
  • OrderedSet.isStrictSubset (cognitive 27) Sources/OrderedCollections/OrderedSet/OrderedSet+Partial SetAlgebra isStrictSubset.swift:119 — OrderedSet.isStrictSubset has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _HashNode._union (cognitive 26) · ×1
  • _HashNode._union (cognitive 26) Sources/HashTreeCollections/HashNode/_HashNode+Structural union.swift:45 — _HashNode._union has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4, ternaries 1 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · OrderedSet._move (cognitive 25) · ×1
  • OrderedSet._move (cognitive 25) Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:265 — OrderedSet._move has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · UnsafeHandle.describeNode (cognitive 24) · ×1
  • UnsafeHandle.describeNode (cognitive 24) Sources/SortedCollections/BTree/_Node.UnsafeHandle+CustomDebugStringConvertible.swift:61 — UnsafeHandle.describeNode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _Chunk.formCharacterIndex (cognitive 24) · ×1
  • _Chunk.formCharacterIndex (cognitive 24) Sources/RopeModule/BigString/Chunk/BigString+Chunk+Character.swift:305 — _Chunk.formCharacterIndex has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _HashNode._merge (cognitive 23) · ×1
  • _HashNode._merge (cognitive 23) Sources/HashTreeCollections/HashNode/_HashNode+Structural merge.swift:55 — _HashNode._merge has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4, 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.
D2 · Cognitive Complexity · _HTable._bitmapDescription (cognitive 22) · ×1
  • _HTable._bitmapDescription (cognitive 22) Sources/BasicContainers/HashTable/_HTable+Debug.swift:39 — _HTable._bitmapDescription has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (10 pts), loops 1 (2 pts) (nesting depth added 13). 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.
D2 · Cognitive Complexity · Container._spanwiseZip (cognitive 22) · ×1
  • Container._spanwiseZip (cognitive 22) Sources/ContainersPreview/Protocols/Container/Container+SpanwiseZip.swift:26 — Container._spanwiseZip has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 4 (8 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.
D2 · Cognitive Complexity · TreeDictionary.init (cognitive 22) · ×1
  • TreeDictionary.init (cognitive 22) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Codable.swift:98 — TreeDictionary.init has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _Chunk.resyncBreaks (cognitive 22) · ×1
  • _Chunk.resyncBreaks (cognitive 22) Sources/RopeModule/BigString/Operations/BigString+Managing Breaks.swift:177 — _Chunk.resyncBreaks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 1 (2 pts), loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _BTree.checkInvariants (cognitive 22) · ×1
  • _BTree.checkInvariants (cognitive 22) Sources/SortedCollections/BTree/_BTree+Invariants.swift:18 — _BTree.checkInvariants has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _HashNode._union_slow (cognitive 21) · ×1
  • _HashNode._union_slow (cognitive 21) Sources/HashTreeCollections/HashNode/_HashNode+Structural union.swift:157 — _HashNode._union_slow has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · OrderedSet.isStrictSuperset (cognitive 21) · ×1
  • OrderedSet.isStrictSuperset (cognitive 21) Sources/OrderedCollections/OrderedSet/OrderedSet+Partial SetAlgebra isStrictSuperset.swift:120 — OrderedSet.isStrictSuperset has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _BTree.findAnyIndex (cognitive 21) · ×1
  • _BTree.findAnyIndex (cognitive 21) Sources/SortedCollections/BTree/_BTree.swift:344 — _BTree.findAnyIndex has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (9 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.
D2 · Cognitive Complexity · OrderedSet.isSubset (cognitive 20) · ×1
  • OrderedSet.isSubset (cognitive 20) Sources/OrderedCollections/OrderedSet/OrderedSet+Partial SetAlgebra isSubset.swift:119 — OrderedSet.isSubset 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.
D2 · Cognitive Complexity · PermutableContainer.heapSort (cognitive 19) · ×1
  • PermutableContainer.heapSort (cognitive 19) Sources/ContainersPreview/Protocols/Container/PermutableContainer+HeapSort.swift:21 — PermutableContainer.heapSort has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TreeSet.isEqualSet (cognitive 19) · ×1
  • TreeSet.isEqualSet (cognitive 19) Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isEqualSet.swift:81 — TreeSet.isEqualSet has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 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.
D2 · Cognitive Complexity · OrderedSet.difference (cognitive 19) · ×1
  • OrderedSet.difference (cognitive 19) Sources/OrderedCollections/OrderedSet/OrderedSet+Diffing.swift:20 — OrderedSet.difference has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BitSet.isSubset (cognitive 18) · ×1
  • BitSet.isSubset (cognitive 18) Sources/BitCollections/BitSet/BitSet+SetAlgebra isSubset.swift:108 — BitSet.isSubset has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _UnsafeDequeHandle.closeGap (cognitive 18) · ×1
  • _UnsafeDequeHandle.closeGap (cognitive 18) Sources/DequeModule/_UnsafeDequeHandle.swift:1152 — _UnsafeDequeHandle.closeGap has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 3 (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.
D2 · Cognitive Complexity · _HashNode.isDisjoint (cognitive 18) · ×1
  • _HashNode.isDisjoint (cognitive 18) Sources/HashTreeCollections/HashNode/_HashNode+Structural isDisjoint.swift:17 — _HashNode.isDisjoint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 4, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _HashNode.isEqualSet (cognitive 18) · ×1
  • _HashNode.isEqualSet (cognitive 18) Sources/HashTreeCollections/HashNode/_HashNode+Structural isEqualSet.swift:16 — _HashNode.isEqualSet has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _UnsafeBitSet.index (cognitive 18) · ×1
  • _UnsafeBitSet.index (cognitive 18) Sources/InternalCollectionsUtilities/UnsafeBitSet/_UnsafeBitSet.swift:384 — _UnsafeBitSet.index has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _Node.join (cognitive 18) · ×1
  • _Node.join (cognitive 18) Sources/SortedCollections/BTree/_Node.swift:216 — _Node.join has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (18 pts) (nesting depth added 4). 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 (prepending, appending). 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.
D2 · Cognitive Complexity · BitSet.isStrictSubset (cognitive 17) · ×1
  • BitSet.isStrictSubset (cognitive 17) Sources/BitCollections/BitSet/BitSet+SetAlgebra isStrictSubset.swift:118 — BitSet.isStrictSubset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (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.
D2 · Cognitive Complexity · TreeSet.isStrictSuperset (cognitive 17) · ×1
  • TreeSet.isStrictSuperset (cognitive 17) Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isStrictSuperset.swift:94 — TreeSet.isStrictSuperset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TreeSet.isSubset (cognitive 17) · ×1
  • TreeSet.isSubset (cognitive 17) Sources/HashTreeCollections/TreeSet/TreeSet+SetAlgebra isSubset.swift:86 — TreeSet.isSubset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · UnsafeHandle.insertElement (cognitive 17) · ×1
  • UnsafeHandle.insertElement (cognitive 17) Sources/SortedCollections/BTree/_Node.UnsafeHandle+Insertion.swift:128 — UnsafeHandle.insertElement has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 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.
D2 · Cognitive Complexity · _UnsafeHandle.closeGap (cognitive 17) · ×1
  • _UnsafeHandle.closeGap (cognitive 17) Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:759 — _UnsafeHandle.closeGap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 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.
D2 · Cognitive Complexity · OrderedSet._partition (cognitive 17) · ×1
  • OrderedSet._partition (cognitive 17) Sources/OrderedCollections/OrderedSet/OrderedSet+Partial MutableCollection.swift:406 — OrderedSet._partition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (5 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. This shape REPEATS in the file: one other method here (MutableCollection._partition) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · MutableCollection._partition (cognitive 17) · ×1
  • MutableCollection._partition (cognitive 17) Sources/OrderedCollections/OrderedSet/OrderedSet+Partial MutableCollection.swift:121 — MutableCollection._partition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (5 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. This shape REPEATS in the file: one other method here (OrderedSet._partition) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · UnsafeHandle.concatenateWith (cognitive 16) · ×1
  • UnsafeHandle.concatenateWith (cognitive 16) Sources/SortedCollections/BTree/_Node.UnsafeHandle+Insertion.swift:354 — UnsafeHandle.concatenateWith has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _BTree.takeCursor (cognitive 16) · ×1
  • _BTree.takeCursor (cognitive 16) Sources/SortedCollections/BTree/_BTree+UnsafeCursor.swift:440 — _BTree.takeCursor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1, ternaries 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.
D35 · Change Coupling · Change-coupling hub · ×1
  • Change-coupling hub: RigidArray+ContainerOperations.swift → UniqueArray+ContainerOperations.swift, BidirectionalContainer.swift, Container.swift, RigidDeque+ContainerOperations.swift, UniqueDeque+ContainerOperations.swift Sources/BasicContainers/RigidArray/RigidArray+ContainerOperations.swift — `Sources/BasicContainers/RigidArray/RigidArray+ContainerOperations.swift` changes together with 5 other files — `Sources/BasicContainers/UniqueArray/UniqueArray+ContainerOperations.swift`, `Sources/ContainersPreview/Protocols/Container/BidirectionalContainer.swift`, `Sources/ContainersPreview/Protocols/Container/Container.swift`, `Sources/DequeModule/RigidDeque/RigidDeque+ContainerOperations.swift`, `Sources/DequeModule/UniqueDeque/UniqueDeque+ContainerOperations.swift` — none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 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 5.
D4 · Code Duplication · Edited copy of a member (30 corresponding lines) · ×1
  • Edited copy of a member (30 corresponding lines) Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:194 — Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:194-230 | Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:248-278 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (39 lines × 2) · ×1
  • Duplicated block (39 lines × 2) Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:628 — Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:628-666 | Sources/DequeModule/_UnsafeDequeHandle.swift:1100-1138 — before extracting anything, compare `Sources/DequeModule/Deque/Deque._UnsafeHandle.swift` and `Sources/DequeModule/_UnsafeDequeHandle.swift` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:628` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (33 lines × 2) · ×1
  • Duplicated block (33 lines × 2) Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:827 — Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:827-859 | Sources/DequeModule/_UnsafeDequeHandle.swift:1219-1251 — before extracting anything, compare `Sources/DequeModule/Deque/Deque._UnsafeHandle.swift` and `Sources/DequeModule/_UnsafeDequeHandle.swift` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:827` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (26 lines × 2) · ×1
  • Duplicated block (26 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:407 — Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:407-432 | Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:420-445 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (23–25 lines × 2) · ×1
  • Duplicated block (23–25 lines × 2) Sources/InternalCollectionsUtilities/IntegerTricks/Integer rank.swift:92 — Sources/InternalCollectionsUtilities/IntegerTricks/Integer rank.swift:92-116 | Sources/InternalCollectionsUtilities/IntegerTricks/Integer rank.swift:129-151 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/InternalCollectionsUtilities/IntegerTricks/Integer rank.swift:92` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (22–24 lines × 2) · ×1
  • Duplicated block (22–24 lines × 2) Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:191 — Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:191-214 | Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:321-342 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift:191` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (21 lines × 2) · ×1
  • Duplicated block (21 lines × 2) Sources/RopeModule/BigString/Conformances/BigString+Comparable.swift:16 — Sources/RopeModule/BigString/Conformances/BigString+Comparable.swift:16-36 | Sources/RopeModule/BigString/Views/BigSubstring.swift:113-133 — before extracting anything, compare `Sources/RopeModule/BigString/Conformances/BigString+Comparable.swift` and `Sources/RopeModule/BigString/Views/BigSubstring.swift` as WHOLE FILES: 96% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (18–20 lines × 2) · ×1
  • Duplicated block (18–20 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:188 — Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:188-205 | Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:194-213 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (13–16 lines × 2) · ×1
  • Duplicated block (13–16 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift:256 — Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift:256-268 | Sources/DequeModule/UniqueDeque/UniqueDeque+Prepend.swift:245-260 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Prepend.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift:256` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (14–16 lines × 2) · ×1
  • Duplicated block (14–16 lines × 2) Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift:274 — Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift:274-289 | Sources/DequeModule/UniqueDeque/UniqueDeque+Prepend.swift:266-279 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Prepend.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Prepend.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (15 lines × 2) · ×1
  • Duplicated block (15 lines × 2) Sources/InternalCollectionsUtilities/BorrowingIteratorProtocol+Equality.swift:35 — Sources/InternalCollectionsUtilities/BorrowingIteratorProtocol+Equality.swift:35-49 | Sources/InternalCollectionsUtilities/BorrowingIteratorProtocol+Equality.swift:117-131 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/InternalCollectionsUtilities/BorrowingIteratorProtocol+Equality.swift:35` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (12–14 lines × 2) · ×1
  • Duplicated block (12–14 lines × 2) Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Initializers.swift:299 — Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Initializers.swift:299-312 | Sources/OrderedCollections/OrderedDictionary/OrderedDictionary+Initializers.swift:331-342 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Initializers.swift:299` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Sources/HashTreeCollections/TreeDictionary/TreeDictionary+Initializers.swift:313` calls `_invariantCheck` and `Sources/OrderedCollections/OrderedDictionary/OrderedDictionary+Initializers.swift:343` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (13–14 lines × 2) · ×1
  • Duplicated block (13–14 lines × 2) Sources/SortedCollections/SortedDictionary/SortedDictionary+Partial RangeReplaceableCollection.swift:153 — Sources/SortedCollections/SortedDictionary/SortedDictionary+Partial RangeReplaceableCollection.swift:153-165 | Sources/SortedCollections/SortedSet/SortedSet+Partial RangeReplaceableCollection.swift:153-166 — 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.
D4 · Code Duplication · Duplicated block (11 lines × 4) · ×1
  • Duplicated block (11 lines × 4) Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:95 — Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:95-105 | Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:151-161 | Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:196-206 | Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:250-260 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:95` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:162` calls `next` and `Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift:106` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (11 lines × 3) · ×1
  • Duplicated block (11 lines × 3) Sources/BasicContainers/RigidArray/RigidArray+Append.swift:149 — Sources/BasicContainers/RigidArray/RigidArray+Append.swift:149-160 | Sources/DequeModule/RigidDeque/RigidDeque+Append.swift:151-161 | Sources/DequeModule/UniqueDeque/UniqueDeque+Append.swift:136-146 — before extracting anything, compare `Sources/DequeModule/RigidDeque/RigidDeque+Append.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Append.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (9–11 lines × 2) · ×1
  • Duplicated block (9–11 lines × 2) Sources/BasicContainers/RigidSet/RigidSet+Initializers.swift:51 — Sources/BasicContainers/RigidSet/RigidSet+Initializers.swift:51-61 | Sources/DequeModule/RigidDeque/RigidDeque+Initializers.swift:96-104 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/RigidSet/RigidSet+Initializers.swift:51` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (10 lines × 4) · ×1
  • Duplicated block (10 lines × 4) Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:206 — Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift:206-215 | Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift:186-195 | Sources/DequeModule/RigidDeque/RigidDeque+Deprecations.swift:78-87 | Sources/DequeModule/UniqueDeque/UniqueDeque+Deprecations.swift:95-104 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Deprecated.swift` and `Sources/BasicContainers/UniqueArray/UniqueArray+Deprecated.swift` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (7 lines × 4) · ×1
  • Duplicated block (7 lines × 4) Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:154 — Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:154-160 | Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:132-138 | Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift:137-143 | Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:144-150 — before extracting anything, compare `Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift` and `Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/RigidArray/RigidArray+Replacements.swift:154` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (6 lines × 5) · ×1
  • Duplicated block (6 lines × 5) Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:148 — Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:148-153 | Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:171-176 | Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift:153-158 | Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift:177-182 | Sources/HashTreeCollections/HashNode/_HashNode+Structural union.swift:196-201 — before extracting anything, compare `Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift` and `Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:148` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (6 lines × 4) · ×1
  • Duplicated block (6 lines × 4) Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:66 — Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:66-72 | Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:136-141 | Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:79-84 | Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift:148-153 — before extracting anything, compare `Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift` and `Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift:66` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D4 · Code Duplication · Duplicated block (5 lines × 3) · ×1
  • Duplicated block (5 lines × 3) Sources/ContainersPreview/Conformances/InputSpan+Container.swift:99 — Sources/ContainersPreview/Conformances/InputSpan+Container.swift:99-103 | Sources/ContainersPreview/Conformances/OutputSpan+Container.swift:90-94 | Sources/InternalCollectionsUtilities/Span+Extras.swift:105-109 — before extracting anything, compare `Sources/ContainersPreview/Conformances/InputSpan+Container.swift` and `Sources/ContainersPreview/Conformances/OutputSpan+Container.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 37 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/ContainersPreview/Conformances/InputSpan+Container.swift:99` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (35 lines × 2) · ×1
  • Duplicated block (35 lines × 2) Sources/BasicContainers/UniqueDictionary/UniqueDictionary+Debugging.swift:18 — Sources/BasicContainers/UniqueDictionary/UniqueDictionary+Debugging.swift:18-52 | Sources/BasicContainers/UniqueSet/UniqueSet+Debugging.swift:18-52 — before extracting anything, compare `Sources/BasicContainers/UniqueDictionary/UniqueDictionary+Debugging.swift` and `Sources/BasicContainers/UniqueSet/UniqueSet+Debugging.swift` as WHOLE FILES: 97% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (62 lines × 2) · ×1
  • Duplicated block (62 lines × 2) Sources/SortedCollections/SortedDictionary/SortedDictionary+Keys.swift:186 — Sources/SortedCollections/SortedDictionary/SortedDictionary+Keys.swift:186-247 | Sources/SortedCollections/SortedDictionary/SortedDictionary+Values.swift:187-266 — before extracting anything, compare `Sources/SortedCollections/SortedDictionary/SortedDictionary+Keys.swift` and `Sources/SortedCollections/SortedDictionary/SortedDictionary+Values.swift` as WHOLE FILES: 92% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. 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. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/SortedCollections/SortedDictionary/SortedDictionary+Keys.swift:186` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also register a scope-exit action (a `defer`-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead — before the caller uses what it releases — so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register.
P2 · Observability · No structured logging · ×1
  • No structured logging — No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
Minor — 30 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×20
  • Duplicated predicate Sources/DequeModule/Deque/Deque+Collection.swift:414 — `bounds.lowerBound >= 0 && bounds.upperBound <= count` appears character-identically in 3 files — Sources/DequeModule/Deque/Deque+Collection.swift, Sources/DequeModule/RigidDeque/RigidDeque+Removals.swift, Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer+Extras.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/DequeModule/Deque/Deque+Collection.swift:858 — `bounds.lowerBound >= 0 && bounds.upperBound <= self.count` appears character-identically in 2 files — Sources/DequeModule/Deque/Deque+Collection.swift, Sources/DequeModule/_UnsafeDequeHandle.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/RopeModule/BigString/Views/BigSubstring+UTF16View.swift:186 — `bounds.lowerBound >= startIndex && bounds.upperBound <= endIndex` appears character-identically in 4 files — Sources/RopeModule/BigString/Views/BigSubstring+UTF16View.swift, Sources/RopeModule/BigString/Views/BigSubstring+UTF8View.swift, Sources/RopeModule/BigString/Views/BigSubstring+UnicodeScalarView.swift, Sources/RopeModule/BigString/Views/BigSubstring.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/BasicContainers/RigidArray/RigidArray+Consumption.swift:143 — `compiler(>=6.4) && UnstableContainersPreview` appears character-identically in 51 files — Sources/BasicContainers/RigidArray/RigidArray+Consumption.swift, Sources/BasicContainers/UniqueArray/UniqueArray+Consumption.swift, Sources/ContainersPreview/Conformances/InputSpan+Container.swift, Sources/ContainersPreview/Conformances/MutableSpan+Container.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/ContainersPreview/Conformances/RigidSet+Container.swift:22 — `compiler(>=6.4) && UnstableContainersPreview && UnstableHashedContainers` appears character-identically in 3 files — Sources/ContainersPreview/Conformances/RigidSet+Container.swift, Sources/ContainersPreview/Conformances/UniqueSet+Container.swift, Sources/ContainersPreview/Extensions/RigidSet+Extras.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/BasicContainers/RigidDictionary/RigidDictionary+Consumption.swift:18 — `compiler(>=6.4) && UnstableHashedContainers` appears character-identically in 47 files — Sources/BasicContainers/RigidDictionary/RigidDictionary+Consumption.swift, Sources/BasicContainers/RigidDictionary/RigidDictionary+Debugging.swift, Sources/BasicContainers/RigidDictionary/RigidDictionary+Equatable.swift, Sources/BasicContainers/RigidDictionary/RigidDictionary+Hashable.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/OrderedCollections/OrderedDictionary/OrderedDictionary+Move.swift:54 — `destination >= 0 && destination <= count` appears character-identically in 2 files — Sources/OrderedCollections/OrderedDictionary/OrderedDictionary+Move.swift, Sources/OrderedCollections/OrderedSet/OrderedSet+Move.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/RopeModule/BigString/Views/BigSubstring+UTF16View.swift:180 — `position >= startIndex && position < endIndex` appears character-identically in 4 files — Sources/RopeModule/BigString/Views/BigSubstring+UTF16View.swift, Sources/RopeModule/BigString/Views/BigSubstring+UTF8View.swift, Sources/RopeModule/BigString/Views/BigSubstring+UnicodeScalarView.swift, Sources/RopeModule/BigString/Views/BigSubstring.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/SortedCollections/SortedSet/SortedSet+Codable.swift:45 — `previousElement == nil || previousElement! < element` appears character-identically in 2 files — Sources/SortedCollections/SortedSet/SortedSet+Codable.swift, Sources/SortedCollections/SortedSet/SortedSet+Initializers.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/SortedCollections/SortedDictionary/SortedDictionary+Codable.swift:67 — `previousKey == nil || previousKey! < key` appears character-identically in 2 files — Sources/SortedCollections/SortedDictionary/SortedDictionary+Codable.swift, Sources/SortedCollections/SortedDictionary/SortedDictionary+Initializers.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/BitCollections/BitArray/BitArray+RangeReplaceableCollection.swift:484 — `range.lowerBound >= 0 && range.upperBound <= count` appears character-identically in 2 files — Sources/BitCollections/BitArray/BitArray+RangeReplaceableCollection.swift, Sources/BitCollections/BitArray/BitArray._UnsafeHandle.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/BitCollections/BitArray/BitArray+Copy.swift:92 — `range.lowerBound >= 0 && range.upperBound <= self.count` appears character-identically in 2 files — Sources/BitCollections/BitArray/BitArray+Copy.swift, Sources/BitCollections/BitArray/BitArray+RangeReplaceableCollection.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/RopeModule/BigString/Views/BigSubstring+UnicodeScalarView.swift:219 — `range.lowerBound >= _bounds.lowerBound && range.upperBound <= _bounds.upperBound` appears character-identically in 2 files — Sources/RopeModule/BigString/Views/BigSubstring+UnicodeScalarView.swift, Sources/RopeModule/BigString/Views/BigSubstring.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/BasicContainers/HashTable/_HTable.swift:63 — `scale >= Self.minimumScale && scale <= Self.maximumScale` appears character-identically in 2 files — Sources/BasicContainers/HashTable/_HTable.swift, Sources/OrderedCollections/HashTable/_HashTable.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift:35 — `self.isCollisionNode || other.isCollisionNode` appears character-identically in 5 files — Sources/HashTreeCollections/HashNode/_HashNode+Structural intersection.swift, Sources/HashTreeCollections/HashNode/_HashNode+Structural merge.swift, Sources/HashTreeCollections/HashNode/_HashNode+Structural subtracting.swift, Sources/HashTreeCollections/HashNode/_HashNode+Structural symmetricDifference.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:571 — `sourceIsContiguous && targetIsContiguous` appears character-identically in 2 files — Sources/DequeModule/Deque/Deque._UnsafeHandle.swift, Sources/DequeModule/_UnsafeDequeHandle.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/RopeModule/BigString/Views/BigSubstring+UTF16View.swift:174 — `start >= startIndex && start <= endIndex` appears character-identically in 4 files — Sources/RopeModule/BigString/Views/BigSubstring+UTF16View.swift, Sources/RopeModule/BigString/Views/BigSubstring+UTF8View.swift, Sources/RopeModule/BigString/Views/BigSubstring+UnicodeScalarView.swift, Sources/RopeModule/BigString/Views/BigSubstring.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/DequeModule/Deque/Deque+Collection.swift:558 — `subrange.lowerBound >= 0 && subrange.upperBound <= count` appears character-identically in 5 files — Sources/DequeModule/Deque/Deque+Collection.swift, Sources/DequeModule/RigidDeque/RigidDeque.swift, Sources/DequeModule/_UnsafeDequeHandle.swift, Sources/InternalCollectionsUtilities/MutableSpan+Extras.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/BasicContainers/RigidArray/RigidArray+ContainerOperations.swift:87 — `subrange.lowerBound >= 0 && subrange.upperBound <= self.count` appears character-identically in 3 files — Sources/BasicContainers/RigidArray/RigidArray+ContainerOperations.swift, Sources/BasicContainers/RigidArray/RigidArray.swift, Sources/InternalCollectionsUtilities/MutableSpan+Extras.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift:30 — `unsafe (self.baseAddress == other.baseAddress) && (self.count == other.count)` appears character-identically in 4 files — Sources/InternalCollectionsUtilities/UnsafeBufferPointer+Extras.swift, Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer+Extras.swift, Sources/InternalCollectionsUtilities/UnsafeMutableRawBufferPointer+Extras.swift, Sources/InternalCollectionsUtilities/UnsafeRawBufferPointer+Extras.swift. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 78 significant file(s) lose their only recent owner: Sources/BasicContainers/UniqueArray/UniqueArray+Replacements.swift, Sources/DequeModule/UniqueDeque/UniqueDeque+Replacements.swift, Sources/DequeModule/RigidDeque/RigidDeque+Replacements.swift, Sources/BasicContainers/RigidArray/RigidArray+ContainerOperations.swift, Sources/SortedCollections/BTree/_Node.UnsafeHandle+Insertion.swift, Sources/ContainersPreview/Protocols/Container/Container.swift, Sources/RopeModule/Rope/Basics/Rope+_Node.swift, Sources/ContainersPreview/Protocols/Producer/Producer.swift (+70 more). Pair on, review, or document these before any departure.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 5 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (84 single-owned of 373 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 373 of the 619 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: Benchmarks/Sources/Benchmarks/OrderedDictionaryBenchmarks.swift, Sources/OrderedCollections/OrderedDictionary/OrderedDictionary+Move.swift, Sources/SortedCollections/SortedSet/SortedSet+SetAlgebra.swift, Sources/OrderedCollections/OrderedSet/OrderedSet+ReserveCapacity.swift, Sources/HashTreeCollections/HashNode/_HashNode+Invariants.swift, Sources/BasicContainers/RigidArray/RigidArray+Formatter.swift.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is `(repository root)` (84259 LoC, 165 module-visible types across 41 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D34 · Knowledge Freshness · Orphaned files with no living knowledge · ×1
  • Orphaned files with no living knowledge — 1 of 373 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, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 373 of the 619 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: Sources/OrderedCollections/OrderedSet/OrderedSet+Diffing.swift. 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.
D34 · Knowledge Freshness · Orphaned file · ×1
  • Orphaned file Sources/OrderedCollections/OrderedSet/OrderedSet+Diffing.swift:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
M2 · Architecture documentation · No ADRs · ×1
  • 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.
M2 · Architecture documentation · No architecture diagram/doc · ×1
  • No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST — No static application security testing detected. For this repository's stack, add CodeQL's Swift pack (Swift/Xcode) (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 5663 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P6 · Release Hygiene · No changelog · ×1
  • No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)

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.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-6c114fbaa3894fe5b9aa953ba6f666c6/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-6c114fbaa3894fe5b9aa953ba6f666c6/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .11artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .0artifacts/raw/osv-scanner.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 418 file(s) — `Benchmarks/Sources/Benchmarks/RigidDequeBenchmarks.swift`, `Benchmarks/Sources/Benchmarks/Rust/RustVecDequeBenchmarks.swift`, `Benchmarks/Sources/Benchmarks/UniqueDequeBenchmarks.swift`, `Benchmarks/Sources/memory-benchmark/DictionaryStatistics.swift`, `Sources/BasicContainers/HashTable/_HTable+Bitmap.swift`, … (+413 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.0—
D36 · Supply-chain Provenance & Signingprovenance—provenance: not applicable — The CI pipeline builds and tests but publishes no released artifact — no package publish, container push, GitHub release or deployment step. Supply-chain provenance, signing and SBOM attest RELEASED artifacts, so there is nothing to attest here. Add them to the release pipeline when this repo starts shipping artifacts (a published package, a container image, a deployed service or a tagged release).0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—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.0—
D41 · Kernel & Syscall Confinementruntime-hardening—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.0—
D42 · Runtime Threat Enforcementruntime-hardening—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.0—
D43 · Malicious Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .0artifacts/raw/osv-scanner.json

Run 01a1844e-fd21-7ffb-acac-77d5c435f645 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

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.

⬇ Findings, MITRE CWE-tagged .sarif⬇ Health changelog .md