Public report of SpeciesFileGroup/taxonworks, published 16 November 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.11.4). 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, 16 November 2026, 18:08 UTC · Survey ID cd_a8174ab61b004632820bc74cc4fb4896

SpeciesFileGroup/taxonworks

Measured 16 November 2026, 18:05 UTC, at code version 1e69086

First survey, so nothing to compare with yet
CAI score 38.1out of 100 Weak
CriticalWeakAdequateStrongExemplary

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

A large codebase: 338,649 lines of product code in 2 projects, tests not counted · Estimated rebuild effort: about 2.5 person-years · Weakest lens: Accessibility, 31.6

Findings by how serious they are

323 critical 2612 serious 139 minor

12 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look 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

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
16 November 2026, 18:05 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 the Canine Code Analyzer. It is open to any tool that implements it, and today the Canine Code Analyzer is the only one that does.

The score is deterministic, which means the same code always gets the same score. We work 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 ▸

75of 75 dimensions measured by tools.
3049of 3074 findings point to an exact file and line, so you can open each one in the code. The other 25 concern the repository as a whole, such as missing documentation.
75dimensions across 8 lenses, read from 338,649 lines of product code in 2 projects.
Chapters

Executive summary

SpeciesFileGroup/taxonworks falls short of our standard for a preview release because it has controls that only work with a mouse and images with no text description. It scores 38.1 out of 100 and is rated Weak, and 210 of its 323 critical findings are security problems.

Accessibility, at 31.6, is the weakest lens and counts most in the score. The best first step for the work it takes is replacing the three packages under a banned licence, worth about 3.2 points. Making the controls keyboard-usable would lift Accessibility itself, worth about 3.6 points. Raising Accessibility to 65 would lift the score to about 43.3.

178 weaknesses in the code could be used by an attacker. Twenty-six controls can't be used without a mouse, and fourteen pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Making the controls work with a keyboard, fixing the weaknesses the scanner points to and pinning each tool to an exact version would close these risks. Limiting each secret to its own step would fix the four secrets exposed to more of the pipeline than needed, and the ten unsafe settings in infrastructure or container files need changing to safe values. The 21 form fields without a label need a label.

The product code is 338,649 lines, about €370,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.
Accessibility 31.6 · counts for 45%Production Readiness 36.2 · counts for 25%Code Health 39.1 · counts for 14%Security and Compliance 50.9 · counts for 8%Maturity 57.7 · counts for 4%Architecture 65.2 · counts for 2%Domain Modelling 75.6 · counts for 1%Performance 100.0 · counts for 1%

If Accessibility rose from 31.6 to 65, the lowest score rated Strong, the score would rise from 38.1 to about 43.3.

Code composition: what the lines of code are
Product code 78%Tests 22%
Rebuild cost: about €370,000 · Estimate
Cost to rebuild€120,000 to €620,000, for 2,049 to 6,499 hours of work, about 2.5 person-years for 1 to 5 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.7 at a score of 38. 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.
SizeLarge: 338,649 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: We price 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 3 Banned license finding(s) in License Compliance.
Raises the score by about 3.2 points · Low effort · License Compliance
2
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
Raises the score by about 3.6 points · Medium effort · Keyboard semantics
3
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Raises the score by about 3.2 points · Medium effort · Text alternatives

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 €370,000 to build again, about 2.5 person-years of work. Its weakest lens is Accessibility, at 31.6 (Weak). Accessibility is about whether the interface is built so that everyone can use it, including people who can't see the screen or can't use a mouse. Because the weakest lens counts most in the score, work on Accessibility also moves the score most.
Based on: the rebuild estimate · the Accessibility grade · how much each lens counts
What to do: Start with the Accessibility actions in Top priorities.
If you do one thing first · First action
Resolve the 3 Banned license finding(s) in License Compliance. Of all the actions in this report, it raises the score most for the work it takes: about 3.2 points for low effort, because it clears the 3 License Compliance 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.4 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 4% to 9% on every change. The history of the code shows how much it changes: about 64,142 lines over the last 90 days, which is about 260,131 lines a year. At that pace, the extra work comes to an estimated 26.1 to 156.3 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 our 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: 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.

814 modules, with 413 dependencies between them. 2 loops run through 12 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 774 more are left out to keep it readable.

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 Autoselect2 BatchLoad3 DataControllerConfiguration4 Shared5 Shared.Dwc6 TaxonNameRelationship.Typification.Genus7 Autoselect.Levels8 Catalog9 CollectionObject10 FieldOccurrence11 Queries.Concerns12 Role13 Catalog.Nomenclature14 Queries15 Queries.Query16 Queries.CollectingEvent17 Queries.DwcOccurrence18 Queries.Loan19 Queries.TaxonName20 (global)21 Queries.CollectionObject22 Queries.FieldOccurrence23 Container24 Download25 Identifier26 News27 NomenclaturalRank28 TaxonNameClassification29 TaxonNameRelationship30 Identifier.Global31 Identifier.Local32 NomenclaturalRank.Icn33 NomenclaturalRank.Icnp34 NomenclaturalRank.Iczn35 TaxonNameClassification.Iczn36 TaxonNameRelationship.Iczn37 Material38 TaxonNameClassification.Iczn.Unavailable39 TaxonNameRelationship.Iczn.Invalidating40 TaxonNameRelationship.Iczn.Invalidating.Synonym
1 Autoselect
2 BatchLoad
3 DataControllerConfiguration
4 Shared
5 Shared.Dwc
6 TaxonNameRelationship.Typification.Genus
7 Autoselect.Levels1
8 Catalog4
9 CollectionObject231
10 FieldOccurrence231
11 Queries.Concerns7
12 Role15
13 Catalog.Nomenclature3
14 Queries1
15 Queries.Query22
16 Queries.CollectingEvent1222
17 Queries.DwcOccurrence211
18 Queries.Loan412
19 Queries.TaxonName723
20 (global)100541411711
21 Queries.CollectionObject10121
22 Queries.FieldOccurrence7121
23 Container21
24 Download7
25 Identifier14
26 News3
27 NomenclaturalRank4
28 TaxonNameClassification5
29 TaxonNameRelationship10
30 Identifier.Global112
31 Identifier.Local510
32 NomenclaturalRank.Icn4
33 NomenclaturalRank.Icnp4
34 NomenclaturalRank.Iczn4
35 TaxonNameClassification.Iczn4
36 TaxonNameRelationship.Iczn3
37 Material11
38 TaxonNameClassification.Iczn.Unavailable22
39 TaxonNameRelationship.Iczn.Invalidating5
40 TaxonNameRelationship.Iczn.Invalidating.Synonym4
Uses a module listed above itPart of a loopThe module itself
1 Autoselect2 BatchLoad3 DataControllerConfiguration4 Shared5 Shared.Dwc6 TaxonNameRelationship.Typification.Genus7 Autoselect.Levels8 Catalog9 CollectionObject10 FieldOccurrence11 Queries.Concerns12 Role13 Catalog.Nomenclature14 Queries15 Queries.Query16 Queries.CollectingEvent17 Queries.DwcOccurrence18 Queries.Loan19 Queries.TaxonName20 (global)21 Queries.CollectionObject22 Queries.FieldOccurrence23 Container24 Download25 Identifier26 News27 NomenclaturalRank28 TaxonNameClassification29 TaxonNameRelationship30 Identifier.Global31 Identifier.Local32 NomenclaturalRank.Icn33 NomenclaturalRank.Icnp34 NomenclaturalRank.Iczn35 TaxonNameClassification.Iczn36 TaxonNameRelationship.Iczn37 Material38 TaxonNameClassification.Iczn.Unavailable39 TaxonNameRelationship.Iczn.Invalidating40 TaxonNameRelationship.Iczn.Invalidating.SynonymAutoselect1BatchLoad2DataControllerConfiguration3Shared4Shared.Dwc5TaxonNameRelationship.Typification.Genus6Autoselect.Levels7Catalog8CollectionObject9FieldOccurrence10Queries.Concerns11Role12Catalog.Nomenclature13Queries14Queries.Query15Queries.CollectingEvent16Queries.DwcOccurrence17Queries.Loan18Queries.TaxonName19(global)20Queries.CollectionObject21Queries.FieldOccurrence22Container23Download24Identifier25News26NomenclaturalRank27TaxonNameClassification28TaxonNameRelationship29Identifier.Global30Identifier.Local31NomenclaturalRank.Icn32NomenclaturalRank.Icnp33NomenclaturalRank.Iczn34TaxonNameClassification.Iczn35TaxonNameRelationship.Iczn36Material37TaxonNameClassification.Iczn.Unavailable38TaxonNameRelationship.Iczn.Invalidating39TaxonNameRelationship.Iczn.Invalidating.Synonym401423123171531221222211412723100541411711101217121217143451011251044443112254+774 more modules (most-connected shown)

At a glance — Code Health · 39.1 · Weak · gated by R1, X3, X5 ·

At a glance — Architecture · 65.2 · Adequate · gated by R9 ·

At a glance — Maturity · 57.7 · Adequate · gated by M2 ·

At a glance — Readiness · 36.2 · Weak · gated by R6, R8, P3, P7 ·

At a glance — Security · 50.9 · Adequate · gated by D29, D31, D36 ·

At a glance — Domain Modelling · 75.6 · Strong ·

At a glance — Accessibility · 31.6 · Weak · gated by AC1, AC4 ·

At a glance — Performance · 100.0 · 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 — Injection612High / Critical
A02:2025 — Security Misconfiguration84High / Critical
A03:2025 — Software Supply Chain Failures11High / Critical
A07:2025 — Authentication Failures3High / Critical

Roadmap

Top priorities: Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href; Resolve the 3 Banned license finding(s) in License Compliance; Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.

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

Do thisHelpsEffortDimension
Resolve the 3 Banned license finding(s) in License Compliance.+3.2 ptsLowLicense Compliance
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.+3.6 ptsMediumKeyboard semantics
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.+3.2 ptsMediumText alternatives
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.+2.3 ptsMediumForms & labels
Add a test runner (vitest / jest / playwright) and eslint and type checking (adopt TypeScript, or type-check the existing JavaScript with `checkJs`) as package.json scripts and run them in CI.+2.1 ptsMediumTooling
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.+1.9 ptsMediumType Safety
Use valid, non-abstract roles, supply the ARIA state each role requires, and never put aria-hidden on a focusable element.+1.7 ptsMediumARIA correctness
Resolve the 1042 TodoComment finding(s) in Explicit Debt — start with REDACTED (61), REDACTED (56), REDACTED (34).+1.9 ptsHighExplicit Debt

File quality

Per-file score 0–10 — a quality signature. Of 747 files carrying findings, judged against the Preview bar: 8% slop · 32% mixed · 60% near-clean.

FileScoreBandWorst signal
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED

How the grades work

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

Critical — 323

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

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

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

Could not be resolved — 12

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

This survey 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. All 75 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.

Every figure here is one of two 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. 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.

What we checked — 75 dimensions across the health lenses
D1D2D3D4D5D6D10D12D13D14D15D16D17D19D20D24D28D29D30D31D34D35D36D40D41D43D44AC1AC2AC3AC4AC5AC6AX10AX2AX3AX4AX6DM6M1M2M3P1P2P3P4P5P6P7P8PF3R1R10R11R2R3R5R6R7R8R9S1X1X12X16X17X18X21X23X25X28X29X3X30X5

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, 3049 of 3074 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 or a scanner, 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
Canine Code Analyzer 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 · trivy · checkovSecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3 · 3.2.533✓ deterministic

Every finding is locatable in findings.md. Run 01a1e588-da33-7ae4-a065-c823e8a7c58e.

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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.rb, .mjs) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo.
  • D10 Test Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 13 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 968 test source file(s) (.rb) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
  • D11 Test Reliability — not measured this run — We 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 (.rb, .mjs) and this repository declares a Ruby test suite (RSpec: repository root, 736 spec files), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its gem dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
  • D21 Naming Consistency — not measured this run — We 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. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. This repository's source is written only in languages whose packages are published through a manifest, and no manifest in the tree makes a publication act: either there is no package manifest of any ecosystem (no package.json, pyproject.toml, setup.py, gemspec, Cargo.toml, pom.xml, build.gradle, composer.json, pubspec.yaml or mix.exs), or every one present declares in its package manager's own terms that it is not published (an npm package marked "private": true, a Cargo package with publish = false, a pubspec with publish_to: none, a Composer "project", a Poetry project with package-mode = false, or the "Private :: Do Not Upload" classifier). With no publication act there is no intentionally-exposed surface for API consistency to be judged over.
  • D24 Comment Value — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • D26 Project Cohesion — not measured this run — We 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. `(repository root)` (180469 LoC, 3959 module-visible types across 768 directories) is over its size bounds, and whether one unit is a coherent whole or a grab-bag is read from its type references: the parts of it that reach the rest only through its shared core. Those are read over the C#/VB code model, which this unit's source did not supply. Its size alone is no verdict on its cohesion, so none is published.
  • AC2 Forms & labels — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. 586 further occurrence(s) are not listed individually; the score already reflects all 626.
  • AC3 Page structure — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. 73 further occurrence(s) are not listed individually; the score already reflects all 113.
  • AC4 Keyboard semantics — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. 86 further occurrence(s) are not listed individually; the score already reflects all 126.
  • C1 Data Protection — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • C2 Access Controls — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • C3 Audit Trail — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • GD1 Unfinished & placeholder code — not measured this run — We 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, Scala, Rust and Java source only, and this repository's Vue components is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • IC1 Incompleteness & stubs — not measured this run — We 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, Scala and Rust source only, and this repository's Vue components is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • R10 Code Duplication — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. 396 further occurrence(s) are not listed individually; the score already reflects all 436.
  • R7 Dead Code — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. 133 further occurrence(s) are not listed individually; the score already reflects all 173.
  • X10 Duplicated predicate — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 25 further occurrence(s) are not listed individually; the score already reflects all 65.
  • X24 Document value interpolated into markup unescaped — not measured this run — We 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. Document value interpolated into markup unescaped could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository. Engine failure: ArgumentOutOfRangeException: Index was out of range. Must be non-negative and less than the size of the collection. (Parameter 'index').
  • X27 Collection changed while being enumerated — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X3 Exception handling — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. 383 further occurrence(s) are not listed individually; the score already reflects all 423.
  • X7 Silent fallback defaults — not measured this run — We 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. 64 further occurrence(s) are not listed individually; the score already reflects all 104.

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

Limitations & what we did not check

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

Per-dimension blind spots

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

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • 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 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D40 Network Egress Confinement: Egress confinement is read from committed Kubernetes manifests — a policy applied out-of-band (cluster-default deny, a service mesh, or a cloud firewall/security group off-repo) is invisible, and a present NetworkPolicy is declared config, not proof the cluster admission-controller actually enforces it at runtime.
  • D41 Kernel & Syscall Confinement: Syscall/MAC confinement is read from committed manifests — a profile applied by a cluster-wide PodSecurity default or a mutating webhook off-repo isn't seen, and a declared seccomp/AppArmor profile is config presence, not proof the node's kernel actually loaded and enforced it.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
  • AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
  • AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
  • AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
  • AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
  • AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
  • 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.
  • DM6 Domain ↔ infrastructure boundary: Infrastructure reached through a hand-rolled wrapper, a domain-named facade, reflection, or a string-keyed service locator resolves to a non-infra type and isn't seen; the body scan is symbol resolution over syntax, not full dataflow. A clean result means "no resolved infra reference in a domain body", not a proof of purity.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity6.0 / 10Adequate✓ 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 6.0 / 10 · rule-coverage 100% · ceiling Prevented

71 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was Taxon.import at 105. A further 4 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being DwcOccurrence.is_stale_metadata at 25 — they are counted neither in the figure above nor in this dimension's score. 4 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: app/models/dwc_occurrence.rb (DwcOccurrence.is_stale_metadata at 25), lib/queries/source/autocomplete.rb (Autocomplete.autocomplete at 23), lib/export/dwca/checklist/data.rb (Data.cleanup at 19), REDACTED (Nomenclature.predict_three_forms at 16). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

(anonymous) (cyclomatic 16) · ×2app/javascript/vue/tasks/dwca_import/store/actions/loadDataSetRecords.js:8
Taxon.import (cyclomatic 105)app/models/dataset_record/darwin_core/taxon.rb:49
Occurrence.import (cyclomatic 67)app/models/dataset_record/darwin_core/occurrence.rb:311
FromObservationMatrix.get_descriptor_hash (cyclomatic 62)lib/tools/description/from_observation_matrix.rb:241
InteractiveKey.useful_descriptors (cyclomatic 60)lib/tools/interactive_key.rb:478

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

What to do

  1. Bring the 3 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with Taxon.import (cyclomatic 105), Occurrence.import (cyclomatic 67), FromObservationMatrix.get_descriptor_hash (cyclomatic 62). — 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 3 together lifts Cyclomatic Complexity from 6.0 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

D2 · Cognitive Complexity5.2 / 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 5.2 / 10 · rule-coverage 100% · ceiling Prevented

133 method(s) exceeded the cognitive complexity threshold of 15; the worst was Taxon.import at 215.

Filter.otu_scope_facet (cognitive 20) · ×2lib/queries/depiction/filter.rb:114
setObservation.default (cognitive 16) · ×2app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setObservation.js:3
(anonymous) (cognitive 16) · ×2app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/mutations/setObservation.js:3
Taxon.import (cognitive 215)app/models/dataset_record/darwin_core/taxon.rb:49
Person.merge_with (cognitive 137)app/models/person.rb:203

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

What to do

  1. Bring the 2 bodies over 120 down to 120 or less in Cognitive Complexity — start with Taxon.import (cognitive 215), Person.merge_with (cognitive 137). — 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 2 together lifts Cognitive Complexity from 5.2 to about 5.8/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.

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

D3 · God Classes9.2 / 10Stronggated by 71 serious findings✓ Tool-verified

What it measures: Over-large classes that try to do too much ("god classes").

Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.

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

71 god class(es) detected.

TooManyMethods: TaxonName · ×45REDACTED:159
FileTooLong: protonym/soft_validation_extensions.rb · ×21app/models/protonym/soft_validation_extensions.rb
FunctionTooLong: useLightTable.useLightTable · ×5app/javascript/vue/components/LightTable/composables/useLightTable.js:94

What to do

  1. Resolve the 45 TooManyMethods finding(s) in God Classes — start with REDACTED (13), REDACTED (2), REDACTED. — One of this dimension's main actionable groups (45 warning-level).
  2. Resolve the 21 FileTooLong finding(s) in God Classes — start with REDACTED (6), soft_validation_extensions.rb, occurrence.rb. — One of this dimension's main actionable groups (21 warning-level).
  3. Resolve the 5 FunctionTooLong finding(s) in God Classes — start with useLightTable.js, useFieldSync.js, useBiologicalAssociationAnatomicalParts.js. — One of this dimension's main actionable groups (5 warning-level).

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

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

What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.

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

161 duplicated block group(s) detected. 2.8 % of the production lines (9,580 of 338,649) are in a reported copy. A further 250 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. Measured on part of this repository only: .vue (47% of production source) was not exposed to THIS dimension's token comparison and is not in this count; duplication there is measured by R10 Code Duplication, the frontend lens's card running the same clone algorithm over the JS/TS token stream.

Duplicated block (7 lines × 2) · ×19REDACTED:71
Edited copy of a member (9 corresponding lines) · ×16app/models/collection_object/biological_collection_object.rb:94
Edited copy of a member (4 corresponding lines) · ×16app/models/nomenclatural_rank/icn/higher_classification_group.rb:4
Edited copy of a member (10 corresponding lines) · ×15app/models/repository.rb:91
Edited copy of a member (3 corresponding lines) · ×14app/models/nomenclatural_rank/icn/family_group/family.rb:8

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

What to do

  1. Resolve the 19 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with REDACTED (2), REDACTED, REDACTED. — One of this dimension's main actionable groups (19 warning-level).
  2. Resolve the 16 Edited copy of a member (9 corresponding lines) finding(s) in Code Duplication — start with biological_collection_object.rb, REDACTED, REDACTED. — One of this dimension's main actionable groups (16 warning-level).
  3. Resolve the 16 Edited copy of a member (4 corresponding lines) finding(s) in Code Duplication — start with misapplication.rb (2), higher_classification_group.rb, forgotten.rb. — One of this dimension's main actionable groups (16 warning-level).

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

D5 · Coupling10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.

Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.

Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.

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

2 production modules (npm+RubyGems), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations, and main-sequence distance (abstractness) is not computed for these modules yet.

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)5.6 / 10Adequate✓ 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 5.6 / 10 · rule-coverage 100% · ceiling Verified

108 of 292 classes have LCOM4 above 3.

Low cohesion: CollectionObject (LCOM4 63) · ×108app/models/collection_object.rb:64

What to do

  1. Resolve the 108 Low cohesion finding(s) in Cohesion (LCOM4) — start with REDACTED (27), REDACTED (2), data.rb (2). — One of this dimension's main actionable groups (108 warning-level).

Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.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 13 tests. Measured on the JavaScript/TypeScript suite only — at least 968 test source file(s) (.rb) went unread, so its test quality is unmeasured and is not in these counts.

✓ On the Gold path — maintain.

Detailed fixes: d10_recommendation.md.

D12 · Dependency Hygiene9.8 / 10Exemplary✓ Tool-verified

What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.

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

5 outdated direct gem(s), 0 pinning defect(s). 128 declaration(s) graded against rubygems.org, 113 of them against a version resolved in a committed REDACTED. 15 declaration(s) carry a requirement that EXCLUDES the current release; that is a deliberate constraint (a supported-version ceiling or a held-back CI pin) and is counted, not charged. Whether any of these gems is DEPRECATED or YANKED is not graded — rubygems.org publishes no deprecation marker, and a yank removes a version rather than flagging it. Whether any is UNMAINTAINED is not graded either: no registry publishes a maintenance status, and release age does not stand in for one. Whether any is UNUSED is a source question, not a registry one. Known CVEs in this dependency graph are D30's question, read from the manifest there.

Outdated: logical_query_parser · ×5

✓ On the Gold path — maintain.

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

D13 · REDACTED 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

REDACTED scan ran and found no leaked secrets. 4 detection(s) were excluded as holding no minted credential in material that runs: a name, reference or comparison rather than a value, a readable phrase or pattern, a value that declares itself fake, or development, test, example, mock or demo material.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D14 · License Compliance4.0 / 10Weak✓ Tool-verified

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 4.0 / 10 · rule-coverage 100% · ceiling Verified

3 of 221 shipped gem(s) use a banned license. Licences were resolved from rubygems.org over the 221 gem(s) a consumer installs — this repository's runtime declarations closed transitively over its committed REDACTED. Development-group and `add_development_dependency` gems are excluded: they are not distributed with this repository. 6 of them publish no licence on rubygems.org; that is missing data, not a violation, and none of them is charged. ★ COVERAGE OF THIS VERDICT: it grades this repository's gem dependencies and nothing else. The repository also declares package.json, and the licences of those dependencies were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.

Banned license: bibtex-ruby · ×3

What to do

  1. Resolve the 3 Banned license finding(s) in License Compliance. — One of this dimension's main actionable groups (3 issue-level).

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

D15 · Churn × Complexity Hotspots9.9 / 10Stronggated by 4 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 9.9 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: app/javascript/vue/components/ui/AutoselectField.vue (30×24=720); REDACTED (13×35=455); app/models/dataset_record/darwin_core/occurrence.rb (6×67=402) Repeated repair below the complexity floor: app/models/import_dataset/darwin_core.rb (3 of 4 changes were fixes)

Hotspot: app/javascript/vue/components/ui/AutoselectField.vue · ×3app/javascript/vue/components/ui/AutoselectField.vue:537
Repeated repair: app/models/import_dataset/darwin_core.rbapp/models/import_dataset/darwin_core.rb:134

What to do

  1. Resolve the 3 Hotspot finding(s) in Churn × Complexity Hotspots — start with AutoselectField.vue, REDACTED, occurrence.rb. — One of this dimension's main actionable groups (3 warning-level).
  2. Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with darwin_core.rb. — 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.1 / 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.1 / 10 · rule-coverage 100% · ceiling Documented

348 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is app/models/dataset_record/darwin_core/occurrence.rb. Counted over 1227 of the 5688 production source files in this repository: 4427 are under the ~2,400-byte size floor this dimension measures over, and the remaining 34 have no attributable history left to measure.

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

What to do

  1. Resolve the 4 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (4 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 Debt8.5 / 10Strong✓ 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 8.5 / 10 · rule-coverage 100% · ceiling Prevented

1059 deducted task-comment markers across 135207 LoC (0.8/KLoC) → score 8.5. 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.

TodoComment · ×1042spec/rails_helper.rb:22
HackComment · ×5spec/models/concerns/shared/maps_spec.rb:182
TodoComment repeated across 11 filesspec/lib/export/coldp_spec.rb:18

What to do

  1. Resolve the 1042 TodoComment finding(s) in Explicit Debt — start with REDACTED (61), REDACTED (56), REDACTED (34). — One of this dimension's main actionable groups (1042 warning-level).
  2. Resolve the 5 HackComment finding(s) in Explicit Debt — start with maps_spec.rb, REDACTED, geographic_item.rb. — One of this dimension's main actionable groups (5 warning-level).
  3. Resolve the 1 TodoComment repeated across 11 files finding(s) in Explicit Debt — start with coldp_spec.rb. — One of this dimension's main actionable groups (1 warning-level).

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

D19 · Documentation Quality0.0 / 10Critical✓ Tool-verified

What it measures: Whether the project's documentation is clear, complete, and useful.

Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.

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

0 of 1 documentation facets pass in full; short on: F2 example. 17 document(s) read across 1 unit(s).

Documentation: no build, run or usage exampleREADME.md:1

What to do

  1. Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d19_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: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.

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

No architecture decision records were found.

No ADRs foundconfig.ru:1

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality — start with config.ru. — 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.

D24 · Comment Value10.0 9.2 / 10Exemplary○ Nothing flagged

What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).

Method: Every inline C# comment compared word by word with the identifiers, literals and constructs of the code it annotates (taken from the syntax); a comment whose words that code already contains is redundant, as are closing-brace labels and generator template text. Comments giving a reason or a reference are kept; other scripts and languages are not judged. Deterministic, exhaustive, advisory.

Maturity: Documented → Verified → Prevented · effective 9.2 / 10 · rule-coverage 92% · ceiling Documented

0 of 99 judged comments only repeat the code they sit on (0.0 %). 16 comment(s) in another language or script were not judged.

✓ On the Gold path — maintain.

Detailed fixes: d24_recommendation.md.

D28 · Secrets (history)8.0 / 10Adequategated by 2 critical findings✓ Tool-verified

What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.

Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.

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

2 finding(s): 0 critical, 2 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.

REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 1 REDACTED finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 1 High secret finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  3. Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).

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

D29 · Static Analysis (SAST)0.0 / 10Critical✓ 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 0.0 / 10 · rule-coverage 100% · ceiling Documented

612 finding(s): 0 critical, 197 high, 415 medium, 0 low. 14 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 5 file(s) — `.github/spec_runner.sh` (line 14, lines 20–22, lines 24–27, …), `REDACTED` (lines 51–67), `exe/docker_health_check.sh` (line 15), `spec/files/geo/illinois.json`, `spec/files/settings/syntax_error.yml` — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

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

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

D30 · Dependency Vulnerabilities8.8 / 10Adequategated by 1 critical finding✓ Tool-verified

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 REDACTED 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. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

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

4 finding(s): 0 critical, 1 high, 3 medium, 0 low.

REDACTED
REDACTED

What to do

  1. Resolve the 1 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 3 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 warning-level).

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

D31 · IaC & Container Security0.8 / 10Critical✓ Tool-verified

What it measures: Whether Dockerfiles / Terraform / Kubernetes config follow security best practices.

Method: IaC/container misconfiguration scan via trivy config (REDACTED/Terraform/K8s/Helm/CloudFormation); severity rules to 0-10 moderate normalizer. NotApplicable without manifests. Exhaustive, deterministic.

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

84 finding(s): 0 critical, 10 high, 53 medium, 21 low.

REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 53 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (24), REDACTED (23), REDACTED (2). — One of this dimension's main actionable groups (53 warning-level).
  2. Resolve the 21 Low IaC finding(s) in IaC & Container Security — start with REDACTED (6), REDACTED (6), REDACTED (5). — One of this dimension's main actionable groups (21 recommendation-level).
  3. Resolve the 10 High IaC finding(s) in IaC & Container Security — start with REDACTED (3), REDACTED (2), REDACTED. — One of this dimension's main actionable groups (10 issue-level).

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

D34 · Knowledge Freshness9.9 / 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 9.9 / 10 · rule-coverage 100% · ceiling Documented

15 of 1261 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is app/javascript/vue/components/radials/annotator/images/identifier.js. Counted over 1261 of the 5688 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned file · ×15app/javascript/vue/components/radials/annotator/images/identifier.js:1
Orphaned files with no living knowledge

✓ On the Gold path — maintain.

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

D35 · Change Coupling9.8 / 10Adequategated by 5 critical 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: Lead.js↔data.rb 92%; App.vue↔Leaflet.vue 83%; loadCollectionObject.js↔getters.js 83%

Boundary-crossing change coupling: inaturalist_import_controller.rb ↔ inaturalist_import_helper.rb · ×5app/controllers/tasks/field_occurrences/inaturalist_import_controller.rb:1
Change coupling: App.vue ↔ Leaflet.vue · ×17app/javascript/vue/tasks/gazetteers/new_gazetteer/App.vue:1
Change-coupling hub: data.rb → AnatomicalPart.js, Lead.js, Otu.js, TaxonName.js · ×4config/routes/data.rb
Change coupling clique: App.vue, ModalEdge.vue, ModalObject.vue, useGraph.jsapp/javascript/vue/tasks/biological_associations/biological_associations_graph/App.vue

What to do

  1. Resolve the 5 Boundary-crossing change coupling finding(s) in Change Coupling — start with inaturalist_import_controller.rb, REDACTED, format.rb. — One of this dimension's main actionable groups (5 issue-level).
  2. Resolve the 17 Change coupling finding(s) in Change Coupling — start with inaturalist_import_helper.rb (2), formatters.js (2), App.vue. — One of this dimension's main actionable groups (17 warning-level).
  3. Resolve the 4 Change-coupling hub finding(s) in Change Coupling — start with data.rb, inaturalist_import_controller.rb, dwcChecklistDownload.vue. — One of this dimension's main actionable groups (4 warning-level).

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

D36 · Supply-chain Provenance & Signing0.0 / 10Critical✓ Tool-verified

What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.

Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.

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

0/4 supply-chain integrity signals present (provenance, signing, SBOM, pinned actions).

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 3 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (3 warning-level).
  2. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
  3. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).

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

D40 · Network Egress Confinement6.0 / 10Adequate✓ Tool-verified

What it measures: Whether Kubernetes workloads restrict network EGRESS with a NetworkPolicy (or Cilium policy), limiting where a compromised pod can send data or reach a command-and-control server. Presence of committed egress-restricting policy, not runtime enforcement.

Method: Deterministic YAML-manifest inspection (no external tool, no Roslyn — language-agnostic): Kubernetes workloads gate applicability; credits a NetworkPolicy / Cilium policy that restricts egress (policyTypes: [Egress] / egress rules). Reward-leaning (neutral floor climbing to 10, never a deduction — baseline misconfigs stay with D31). Deterministic.

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

0/2 network-egress controls present (network policy, egress restriction).

No network policy

What to do

  1. Resolve the 1 No network policy finding(s) in Network Egress Confinement. — One of this dimension's main actionable groups (1 recommendation-level).

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

D41 · Kernel & Syscall Confinement6.0 / 10Adequate✓ Tool-verified

What it measures: Whether Kubernetes workloads confine the kernel boundary — a seccomp profile (RuntimeDefault/Localhost) plus an AppArmor/SELinux mandatory-access-control layer — shrinking the syscall attack surface a container escape would use. Presence of committed confinement config, not runtime enforcement.

Method: Deterministic YAML-manifest inspection (no external tool, no Roslyn): on Kubernetes workloads, credits a seccomp profile (RuntimeDefault/Localhost) and an AppArmor/SELinux MAC layer. Reward-leaning (neutral floor climbing to 10); NotApplicable without workloads. Deterministic.

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

0/2 workload(s) run every container under a seccomp profile; 0/2 declare an AppArmor/SELinux profile.

No seccomp profile · ×2REDACTED:21

What to do

  1. Resolve the 2 No seccomp profile finding(s) in Kernel & Syscall Confinement — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 recommendation-level).

Detailed fixes: d41_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. Reported 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. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

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.

D44 · Platform End-of-Life10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.

Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.

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

0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 2 platform declaration(s) and 162 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AC1 · Text alternatives2.2 / 10Weak✓ Tool-verified

Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.

Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.

  • An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative. (×8) — app/javascript/vue/components/radials/annotator/components/depictions/depiction_annotator.vue:9, app/javascript/vue/tasks/digitize/components/shared/zoomImage.vue:31, app/javascript/vue/tasks/images/filter/components/image.vue:74, …
  • A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content. (×2) — app/views/tasks/accessions/breakdown/buffered_data/index.html.erb:32, app/views/tasks/accessions/breakdown/sqed_depiction/_metadata.html.erb:31

What to do

  • Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
AC2 · Forms & labels4.2 / 10Weak✓ Tool-verified

Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.

Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label. — app/assets/javascripts/views/citations/_topic_picker.js:122
  • A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can't say where it goes. Add visible text or an aria-label. (×2) — REDACTED:151, REDACTED:183
  • This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. (×20) — app/javascript/vue/components/Export/PredicateFilter.vue:46, app/javascript/vue/components/Export/PredicateFilter.vue:60, app/javascript/vue/components/Export/PredicateFilter.vue:78, …
  • This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id. (×17) — app/javascript/vue/components/Filter/Facets/CollectingEvent/FacetCollectingEvent/AttributeForm.vue:4, app/javascript/vue/components/Filter/Facets/CollectingEvent/FacetCollectingEvent/AttributeForm.vue:13, app/javascript/vue/components/Filter/Facets/CollectingEvent/FacetCollectingEvent/FacetCollectingEvent.vue:7, …

What to do

  • Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
AC3 · Page structure5.6 / 10Adequate✓ Tool-verified

Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.

Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one. (×4) — app/javascript/vue/tasks/nomenclature/new_combination/app.vue:35, app/javascript/vue/tasks/observation_matrices/dashboard/app.vue:55, app/javascript/vue/tasks/observation_matrices/image/app.vue:85, …
  • A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope). (×35) — app/javascript/vue/tasks/otus/match_by_taxon_name/components/ResultTable.vue:351, app/javascript/vue/tasks/people/author_by_letter/components/AlphabetButtons.vue:3, app/javascript/vue/tasks/unify/people/components/CompareTable.vue:43, …
  • An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it's decorative. — app/javascript/vue/tasks/unify/people/components/CompareTable.vue:5

What to do

  • Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
AC4 · Keyboard semantics1.0 / 10Critical✓ Tool-verified

Other · Accessibility — Whether interactive behaviour is keyboard-reachable — no click handler on a non-interactive element lacking a role, tabindex and key handler, no element the repo's own CSS styles `cursor: pointer` without giving it any of the three, no unfocusable element whose only binding is a mouse enter/leave pair or a double-click, no positive tabindex, no href-less anchor, no placeholder-href (#/javascript) link acting as a button. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: click handlers on non-interactive elements lacking role+tabindex+key handler, positive tabindex values, and href-less anchors. Components skipped, spreads suppressed. Deterministic, hard fact per element.

Coverage: Population: elements that pose a keyboard-semantics question, in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) — a non-natively-interactive element carrying a click handler, a double-click or hover enter/leave binding, a pointer-only gesture on a tabindex="0" element, or `cursor: pointer` from the repo's own CSS; an href-less or placeholder-href (#, javascript:) anchor; and any element with a positive tabindex. Natively interactive elements used correctly (<button>, <a href>, form controls) are NOT in the population — there is nothing to judge — so a page of nothing but correct controls gives AC4 nothing to measure. Keyboard reachability is judged from the markup, never from a rendered page. ★ An interactive element declared in a tagged-template (html`…`) or hyperscript frontend is NOT in this population — no producer reads either — so an empty population is reported as an analyzer gap, never as "this repository has no interactive elements".

  • An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action. (×11) — app/assets/javascripts/views/citations/_topic_picker.js:63, app/assets/javascripts/views/confidences/form.js:66, app/assets/javascripts/views/otus/_otu_picker.js:63, …
  • An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action. (×3) — app/assets/javascripts/views/citations/_topic_picker.js:144, app/assets/javascripts/views/confidences/form.js:114, app/javascript/vue/components/radials/navigation/components/recent.vue:16
  • A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler. (×24) — app/javascript/vue/components/Filter/Facets/shared/FacetIdentifiers.vue:65, app/javascript/vue/components/editInPlace.vue:4, app/javascript/vue/components/expand.vue:3, …
  • This <span> binds double-click and nothing else. No click, no key handler, and no tabindex="0", so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native <button> or <a href>. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role + tabindex="0" + a key handler alongside the double-click. — app/javascript/vue/components/LightTable/components/LightTableItem.vue:61
  • This <div> binds mousedown and double-click — pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabindex="0", so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native <button> or <a href>. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role + tabindex="0" + a key handler alongside the double-click. — app/javascript/vue/components/resizeHandle.vue:2

What to do

  • Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
AC5 · ARIA correctness5.2 / 10Adequate✓ Tool-verified

Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.

Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • This role is not a valid WAI-ARIA role, so assistive tech ignores it. Use a valid role (or the native element). (×3) — app/javascript/vue/components/Filter/Facets/CollectionObject/Determiner/FacetDetermination.vue:38, app/javascript/vue/tasks/collecting_events/filter/components/Filter.vue:5, app/javascript/vue/tasks/collection_objects/filter/components/filter.vue:15

What to do

  • Use valid, non-abstract roles, supply the ARIA state each role requires, and never put aria-hidden on a focusable element.
AC6 · Visual & motion safety6.0 / 10Adequate✓ Tool-verified

Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.

Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.

Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • `hr` sets color: #f5f5f5 on background-color: #f5f5f5 — 1.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — app/javascript/vue/tasks/nomenclature/new_combination/components/newCombination.vue:313
  • `.button-expand` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — app/javascript/vue/tasks/otus/browse/components/Panel/PanelDescendants/PanelDescendantsExpand.vue:73
  • `.progress-fill` moves (`transition: width 0.2s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — app/javascript/vue/tasks/sources/verbatim_author_year_source/components/AuthorYearTable.vue:250
  • `.meter-animation-enter-active` moves (`animation: progressBar 3s linear`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×2) — app/javascript/vue/tasks/sources/new_source/components/Autosave.vue:73, app/javascript/vue/tasks/nomenclature/new_taxon_name/components/autosave.vue:99
  • `.progress-matched` moves (`transition: width 0.3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×2) — app/javascript/vue/tasks/otus/match_by_taxon_name/components/SummaryBar.vue:121, app/javascript/vue/tasks/otus/assign_taxon_name/components/StatusBar.vue:143
  • `.progress-unmatched` moves (`transition: width 0.3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×2) — app/javascript/vue/tasks/otus/match_by_taxon_name/components/SummaryBar.vue:126, app/javascript/vue/tasks/otus/assign_taxon_name/components/StatusBar.vue:148
  • `.save-countdown__duration-bar-animation-enter-active` moves (`animation: countdown 3333ms linear`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — app/javascript/vue/tasks/observation_matrices/matrix_row_coder/MatrixRowCoder/SaveCountdown/SaveCountdown.scss:19
  • `.pulse-dot::after` moves (`animation: pulse 1.5s infinite ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — app/javascript/vue/tasks/news/NotificationBell/components/NotificationPulse.vue:25

What to do

  • Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
AX10 · Code composition8.5 / 10Strong✓ 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.

AX2 · Stateful singletons10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether singleton services avoid mutable shared instance state that concurrent callers would race on.

Method: Roslyn scan: singleton field mutations unguarded by lock or Interlocked, per type; syntax-based guard detection. Deterministic, traceable per field.

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.

AX6 · Interface segregation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').

Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.

DM6 · Domain ↔ infrastructure boundary7.6 / 10Strong✓ Tool-verified

Other · Domain Modelling — Whether the domain layer stays free of infrastructure dependencies — a domain aggregate fused to a persistence ORM (ActiveRecord/Sequel/ROM) on its own declaration (active-record) couples the domain to infrastructure. The clean-architecture dependency rule.

Method: Roslyn (DDD-gated): domain-layer types scanned for infrastructure usage in member SIGNATURES and inside method/accessor BODIES — resolved calls and object-creations into EF/Marten/HTTP/Mongo/Redis/message-bus types (not just a namespace allowlist). Deterministic, symbol-resolved, exhaustive over domain-layer bodies, DDD-native.

Coverage: Domain layer identified by NAMESPACE heuristic; infrastructure then resolved by symbol in member SIGNATURES and method/accessor BODIES — rename the layer and the check evaporates.

  • `Document` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository). — app/models/document.rb:52
  • `Import` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository). — app/models/import.rb:28
  • `Lead` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository). — app/models/lead.rb:57
  • `LoanItem` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository). — REDACTED:38
  • `Person` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository). — app/models/person.rb:51
  • `Project` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository). — app/models/project.rb:21
  • `TaxonName` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository). — REDACTED:159
  • `TaxonNameClassification` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository). — REDACTED:18
  • `User` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository). — REDACTED:106

What to do

  • Keep the ORM/table mapping on a boundary data-model + mapper; leave the domain entity framework-free (map row↔domain through a repository).
M1 · Documentation (README)6.0 / 10Adequate✓ Tool-verified

Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.

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.
M2 · Architecture documentation2.0 / 10Weak✓ 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.

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.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.

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

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 · Observability7.0 / 10Strong✓ 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.

What to do

  • Add a health-check endpoint (Rails' /up (rails/health#show) or a /health route) so orchestrators and load balancers can probe liveness/readiness.
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.

  • `package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — package.json:4

What to do

  • Your ecosystem's static analyzer is declared as a dependency but is not wired into CI — run it as a required step on push/PR (e.g. `composer phpstan` / `mix sobelow` / `bundle exec brakeman` / the spotbugs Gradle task / `sbt scalafixAll --check` / `golangci-lint run` / `rebar3 lint`) so a regression fails the build instead of relying on someone running it locally.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback8.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.

Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.

What to do

  • Add an approval/environment gate (required reviewers / protection rules) before production promotion.
P5 · DR & Backup7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether disaster recovery is planned and codified — backups, geo-recovery, RTO/RPO, persistence guarantees — from IaC + container manifests + docs, never the live cloud.

Method: Filesystem scan: disaster recovery, backup, geo-recovery, RTO/RPO, persistence guarantees from IaC, manifests, and docs. Exhaustive, deterministic, never a live environment.

What to do

  • Document RTO/RPO and a tested restore procedure (a backup config alone isn't disaster recovery).
P6 · Release Hygiene10.0 / 10Exemplary✓ 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.

P7 · Outbound HTTP resilience3.0 / 10Weak✓ Tool-verified

Readiness · Readiness — Whether outbound HTTP calls are wrapped in resilience (retry/timeout/circuit-breaker) so a failing dependency doesn't cascade.

Method: Source scan: outbound HTTP clients and what bounds them — resilience handlers (Polly, AddStandardResilienceHandler) on .NET; on Go, the JVM, Python, JavaScript/TypeScript, Ruby, PHP, Rust, Elixir, Swift, Dart and Erlang, a timeout, deadline, retry or breaker beside each call, or a process-wide client default (a framework-wide deadline such as Drupal core's, Laravel's or actix's awc counts). Exhaustive, deterministic.

  • `Net::HTTP.start` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. (×4) — app/models/concerns/shared/purl_deprecation.rb:73, app/models/concerns/shared/purl_deprecation.rb:89, lib/utilities/net.rb:16, …
  • `Net::HTTP.get` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. (×2) — REDACTED:366, lib/taxonworks_net.rb:13
  • `Net::HTTP.get_response` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. (×2) — lib/export/coldp/files/species_interaction.rb:40, lib/nexml.rb:127

What to do

  • Set `open_timeout` and `read_timeout` explicitly on every client (Net::HTTP, Faraday `request: { timeout: }`, HTTParty `timeout:`), add Faraday's `:retry` middleware (faraday-retry) or `retriable`, and a breaker (`circuitbox`, `stoplight`) around dependencies that fail.
P8 · Schema migrations10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — Whether database schema changes go through versioned migrations rather than being auto-created from the model at startup.

Method: Roslyn scan: EF Core DbContext for a versioned migrations directory versus bare EnsureCreated usage; off .NET, a file scan of dependency manifests, migration histories (Flyway, Liquibase, Alembic, Django, Rails, Prisma, TypeORM, Knex/Sequelize, golang-migrate, goose, Laravel, Doctrine, Diesel/sqlx) and schema auto-create in production source or config. Exhaustive, deterministic.

PF3 · Async & latency hygiene10.0 / 10Exemplary✓ Tool-verified

Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.

Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.

R1 · Type Safety0.0 / 10Critical✓ Tool-verified

React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.

Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.

  • 0 typed · 3455 plain JS — the untyped files are app/assets/config/manifest.js, app/assets/javascripts/application.js, app/assets/javascripts/separated/utilities/browser/browser_compatibility.js, app/assets/javascripts/separated_application.js, app/assets/javascripts/theme.js, app/assets/javascripts/tw.js (+3449 more).

What to do

  • Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
R10 · Code Duplication6.5 / 10Adequate✓ Tool-verified

React / JS · Code Health — The share of the scored frontend lines inside a near-exact copy-pasted block of substantial extent (the D4 clone algorithm over JS/TS tokens, D-386; each line once, 10 at none and 0 at a quarter of the lines, as D4): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.

Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Scored on the share of the scored frontend lines inside a reported copy, on the same curve as D4. Deterministic.

  • 139 duplicated blocks under app/javascript/vue/tasks/ have copies in at least two of the sibling directories administration, anatomical_parts, asserted_distributions, asserted_environments, biological_associations, biological_relationships (+35 more sibling(s) not listed) — 79 of them are reported below, and 60 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 139 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 139 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 139 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — app/javascript/vue/tasks/anatomical_parts/filter/components/filters/FacetTaxonNameRelationshipType.vue:90
  • 79 duplicated blocks under app/javascript/vue/ have copies in at least two of the sibling directories components, composables, helpers, initializers, shared, tasks — 51 of them are reported below, and 28 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 79 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 79 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 79 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — app/javascript/vue/components/ui/Table/VirtualScroller.vue:24
  • 42 duplicated blocks under app/javascript/vue/components/radials/ have copies in at least two of the sibling directories BiologicalAssociation, annotator, asserted_distribution, ce, co, composables (+11 more sibling(s) not listed) — 33 of them are reported below, and 9 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 42 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 42 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 42 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — app/javascript/vue/components/radials/annotator/annotator.vue:108
  • 37 duplicated blocks under app/javascript/vue/tasks/observation_matrices/ have copies in at least two of the sibling directories image, matrix_column_coder, matrix_row_coder, new — 21 of them are reported below, and 16 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 37 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 37 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 37 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/MatrixColumnCoder/SampleDescriptor/SampleDescriptorObservation.vue:91
  • 26 duplicated blocks under app/javascript/vue/components/Filter/Facets/ have copies in at least two of the sibling directories AnatomicalParts, AssertedDistributions, AssertedEnvironments, BiologicalAssociation, CollectingEvent, CollectionObject (+8 more sibling(s) not listed) — 19 of them are reported below, and 7 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 26 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 26 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 26 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — app/javascript/vue/components/Filter/Facets/BiologicalAssociation/FacetNomenclatureRelation.vue:61
  • 15 duplicated blocks under app/javascript/vue/tasks/otus/browse/components/Panel/ have copies in at least two of the sibling directories PanelAnnotations, PanelAssertedDistribution, PanelAssertedEnvironments, PanelBiologicalAssociations, PanelCollectionObjects, PanelCommonNames (+8 more sibling(s) not listed) — 7 of them are reported below, and 8 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 15 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 15 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 15 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — app/javascript/vue/tasks/otus/browse/components/Panel/PanelCollectionObjects/PanelCollectionObjects.vue:90
  • 10 duplicated blocks under app/javascript/vue/components/ have copies in at least two of the sibling directories Filter, TaxonDetermination, graph, layout, radials, ui — 8 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 10 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 10 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 10 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — app/javascript/vue/components/TaxonDetermination/TaxonDeterminationForm.vue:74
  • 10 duplicated blocks under app/javascript/vue/initializers/ have copies in at least two of the sibling directories Autoselect, ButtonConfidence, ButtonOtu, ButtonTag, MapShape, QuickCitation (+8 more sibling(s) not listed) — 8 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 10 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 10 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 10 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — app/javascript/vue/initializers/Autoselect/main.js:17
  • 8 duplicated blocks under app/assets/javascripts/views/ have copies in at least two of the sibling directories citations, confidences, hub, otus, people, shared (+2 more sibling(s) not listed) — 7 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 8 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 8 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 8 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — app/assets/javascripts/views/confidences/form.js:27
  • 6 duplicated blocks under app/javascript/vue/tasks/biological_associations/ have copies in at least two of the sibling directories new, new_ba — 5 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 6 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 6 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 6 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — app/javascript/vue/tasks/biological_associations/new/store/store.js:8
  • 5 duplicated blocks under app/javascript/vue/components/radials/mass/components/Annotator/ have copies in at least two of the sibling directories Attribution, Confidence, Identifier, Protocol — 4 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 5 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — app/javascript/vue/components/radials/mass/components/Annotator/Confidence/ConfidenceMain.vue:72
  • app/javascript/vue/tasks/biological_associations/new/store/store.js:8 · app/javascript/vue/tasks/biological_associations/new_ba/store/store.js:27 — the two spans are one implementation copied and then locally edited — 762 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — app/javascript/vue/tasks/biological_associations/new/store/store.js:8
  • app/javascript/vue/components/radials/annotator/annotator.vue:108 · app/javascript/vue/components/radials/object/radial.vue:111 — the two spans are one implementation copied and then locally edited — 670 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — app/javascript/vue/components/radials/annotator/annotator.vue:108
  • app/javascript/vue/tasks/anatomical_parts/filter/components/filters/FacetTaxonNameRelationshipType.vue:90 · app/javascript/vue/tasks/taxon_name_relationships/filter/components/filters/FacetTaxonNameRelationshipType.vue:90 — these 2 files are line-for-line copies of one another — 106 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — app/javascript/vue/tasks/anatomical_parts/filter/components/filters/FacetTaxonNameRelationshipType.vue:90
  • app/assets/javascripts/views/tasks/collecting_events/parse/dates/index.js:1 · app/assets/javascripts/views/tasks/collecting_events/parse/lat_long/index.js:1 — the two spans are one implementation copied and then locally edited — 804 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — app/assets/javascripts/views/tasks/collecting_events/parse/dates/index.js:1
  • app/javascript/vue/tasks/asserted_distributions/new_asserted_distribution/store/store.js:26 · app/javascript/vue/tasks/biological_associations/new/store/store.js:72 — the two spans are one implementation copied and then locally edited — 391 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — app/javascript/vue/tasks/asserted_distributions/new_asserted_distribution/store/store.js:26
  • app/javascript/vue/components/radials/mass/components/Annotator/Confidence/ConfidenceMain.vue:72 · app/javascript/vue/components/radials/mass/components/Annotator/Protocol/ProtocolMain.vue:66 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — app/javascript/vue/components/radials/mass/components/Annotator/Confidence/ConfidenceMain.vue:72
  • app/javascript/vue/tasks/nomenclature/new_taxon_name/components/classification.vue:121 · app/javascript/vue/tasks/nomenclature/new_taxon_name/components/relationshipPicker.vue:183 — the two spans are one implementation copied and then locally edited — 393 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — app/javascript/vue/tasks/nomenclature/new_taxon_name/components/classification.vue:121
  • app/javascript/vue/components/ui/Button/ButtonConfidence.vue:72 · app/javascript/vue/components/ui/Button/ButtonTag.vue:73 — the two spans are one implementation copied and then locally edited — 358 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — app/javascript/vue/components/ui/Button/ButtonConfidence.vue:72
  • app/javascript/vue/tasks/observation_matrices/matrix_column_coder/MatrixColumnCoder/SampleDescriptor/SampleDescriptorObservation.vue:91 · app/javascript/vue/tasks/observation_matrices/matrix_row_coder/MatrixRowCoder/SampleDescriptor/SampleDescriptorObservation.vue:93 — these 2 files are line-for-line copies of one another — 76 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/MatrixColumnCoder/SampleDescriptor/SampleDescriptorObservation.vue:91
  • app/javascript/vue/tasks/collecting_events/stepwise/collectors/composables/useStore.js:24 · app/javascript/vue/tasks/collection_objects/stepwise/determinations/composables/useStore.js:24 — the two spans are one implementation copied and then locally edited — 362 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — app/javascript/vue/tasks/collecting_events/stepwise/collectors/composables/useStore.js:24
  • app/javascript/vue/tasks/collecting_events/new_collecting_event/components/ModalCollectionObjects/ModalCollectionObjects.vue:224 · app/javascript/vue/tasks/collecting_events/new_collecting_event/components/ModalFieldOccurrences/ModalFieldOccurrences.vue:149 — the two spans are one implementation copied and then locally edited — 330 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — app/javascript/vue/tasks/collecting_events/new_collecting_event/components/ModalCollectionObjects/ModalCollectionObjects.vue:224
  • app/javascript/vue/components/Filter/Facets/BiologicalAssociation/FacetNomenclatureRelation.vue:61 · app/javascript/vue/components/Filter/Facets/TaxonName/components/TaxonNameSelector.vue:72 — the two spans are one implementation copied and then locally edited — 345 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — app/javascript/vue/components/Filter/Facets/BiologicalAssociation/FacetNomenclatureRelation.vue:61
  • app/javascript/vue/components/Filter/Facets/shared/FacetConfidence.vue:103 · app/javascript/vue/components/Filter/Facets/shared/FacetTags.vue:112 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — app/javascript/vue/components/Filter/Facets/shared/FacetConfidence.vue:103
  • app/javascript/vue/tasks/anatomical_parts/anatomical_parts_graph/constants/networkConfig.js:1 · app/javascript/vue/tasks/biological_associations/biological_associations_graph/constants/networkConfig.js:1 — these 2 files are line-for-line copies of one another — 55 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — app/javascript/vue/tasks/anatomical_parts/anatomical_parts_graph/constants/networkConfig.js:1
  • app/javascript/vue/tasks/collection_objects/filter/components/DeleteCollectionObjects.vue:22 · app/javascript/vue/tasks/field_occurrences/filter/components/DeleteFieldOccurrences.vue:22 — these 2 files are line-for-line copies of one another — 54 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — app/javascript/vue/tasks/collection_objects/filter/components/DeleteCollectionObjects.vue:22
  • app/javascript/vue/components/ui/Table/VirtualScroller.vue:24 · app/javascript/vue/tasks/dwca_import/components/VirtualScroller.vue:24 — these 2 files are line-for-line copies of one another — 53 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — app/javascript/vue/components/ui/Table/VirtualScroller.vue:24
  • app/javascript/vue/tasks/digitize/store/pinia/determinations.js:1 · app/javascript/vue/tasks/field_occurrences/new/store/determinations.js:1 — these 2 files are line-for-line copies of one another — 52 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — app/javascript/vue/tasks/digitize/store/pinia/determinations.js:1
  • app/javascript/vue/tasks/administration/data/components/Reindex/ProgressBar.vue:20 · app/javascript/vue/tasks/dwc/dashboard/components/ProgressBar.vue:21 — the two spans are one implementation copied and then locally edited — 283 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — app/javascript/vue/tasks/administration/data/components/Reindex/ProgressBar.vue:20
  • app/javascript/vue/tasks/otus/browse/components/Panel/PanelCollectionObjects/PanelCollectionObjects.vue:90 · app/javascript/vue/tasks/otus/browse/components/Panel/PanelFieldOccurrences/PanelFieldOccurrences.vue:88 — the two spans are one implementation copied and then locally edited — 279 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — app/javascript/vue/tasks/otus/browse/components/Panel/PanelCollectionObjects/PanelCollectionObjects.vue:90
  • app/javascript/vue/tasks/nomenclature/filter/components/filters/FacetRelationships.vue:118 · app/javascript/vue/tasks/nomenclature/filter/components/filters/FacetStatus.vue:93 — the two spans are one implementation copied and then locally edited — 198 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — app/javascript/vue/tasks/nomenclature/filter/components/filters/FacetRelationships.vue:118
  • app/javascript/vue/components/Filter/Facets/shared/FacetByAttributeRow/ByAttributeRowFacet.vue:60 · app/javascript/vue/components/Filter/Facets/shared/FacetDataAttribute/FacetDataAttribute.vue:54 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — app/javascript/vue/components/Filter/Facets/shared/FacetByAttributeRow/ByAttributeRowFacet.vue:60
  • app/javascript/vue/tasks/observation_matrices/matrix_column_coder/MatrixColumnCoder/ContinuousDescriptor/ContinuousDescriptorObservation.vue:44 · app/javascript/vue/tasks/observation_matrices/matrix_row_coder/MatrixRowCoder/ContinuousDescriptor/ContinuousDescriptorObservation.vue:44 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/MatrixColumnCoder/ContinuousDescriptor/ContinuousDescriptorObservation.vue:44
  • app/javascript/vue/tasks/otus/browse/components/Panel/PanelAssertedEnvironments/PanelAssertedEnvironments.vue:39 · app/javascript/vue/tasks/otus/browse/components/Panel/PanelCommonNames/PanelCommonNames.vue:48 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — app/javascript/vue/tasks/otus/browse/components/Panel/PanelAssertedEnvironments/PanelAssertedEnvironments.vue:39
  • app/javascript/vue/tasks/gazetteers/import_gazetteers/components/DocumentSelector.vue:129 · app/javascript/vue/tasks/observation_matrices/import_nexus/components/DocumentSelector.vue:98 — the two spans are one implementation copied and then locally edited — 277 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — app/javascript/vue/tasks/gazetteers/import_gazetteers/components/DocumentSelector.vue:129
  • app/javascript/vue/components/Filter/Facets/Source/FacetAuthors.vue:56 · app/javascript/vue/components/Filter/Facets/Source/FacetEditors.vue:56 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — app/javascript/vue/components/Filter/Facets/Source/FacetAuthors.vue:56
  • app/javascript/vue/tasks/dwc/compact/components/ChartLifeStageCounts.vue:14 · app/javascript/vue/tasks/dwc/compact/components/ChartSexCounts.vue:14 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — app/javascript/vue/tasks/dwc/compact/components/ChartLifeStageCounts.vue:14
  • app/javascript/vue/tasks/observation_matrices/matrix_row_coder/MatrixRowCoder/ContinuousDescriptor/ContinuousDescriptor.vue:38 · app/javascript/vue/tasks/observation_matrices/matrix_row_coder/MatrixRowCoder/SampleDescriptor/SampleDescriptor.vue:43 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — app/javascript/vue/tasks/observation_matrices/matrix_row_coder/MatrixRowCoder/ContinuousDescriptor/ContinuousDescriptor.vue:38
  • app/javascript/vue/tasks/collection_objects/browse/components/PanelCE/PanelCEModal.vue:74 · app/javascript/vue/tasks/field_occurrences/browse/components/PanelCE/PanelCEModal.vue:71 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — app/javascript/vue/tasks/collection_objects/browse/components/PanelCE/PanelCEModal.vue:74
  • app/javascript/vue/routes/endpoints/CollectionObject.js:35 · app/javascript/vue/routes/endpoints/FieldOccurrence.js:24 — the 2 copies are spread across 2 files, and what repeats is a LIST OF ENTRIES rather than behaviour — the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator's options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents. — app/javascript/vue/routes/endpoints/CollectionObject.js:35

What to do

  • Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
R11 · Import Boundaries9.8 / 10Exemplary✓ Tool-verified

React / JS · Architecture — Conformance to the detected frontend architecture layout (feature-sliced / layered src) plus cross-package deep-import rules (D-386).

Method: Conformance to the detected frontend layout (feature-sliced / layered src) plus cross-package deep-import rules, over the module graph. Deterministic.

  • app/javascript/vue/components/audio/AudioPlayer.vue:8 imports wavesurfer.js/dist/plugins/spectrogram.esm.js, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead. — app/javascript/vue/components/audio/AudioPlayer.vue:8
  • app/javascript/vue/components/audio/AudioPlayer.vue:9 imports wavesurfer.js/dist/plugins/timeline.esm.js, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead. — app/javascript/vue/components/audio/AudioPlayer.vue:9
  • app/javascript/vue/components/audio/AudioPlayer.vue:10 imports wavesurfer.js/dist/plugins/regions.esm.js, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead. — app/javascript/vue/components/audio/AudioPlayer.vue:10
  • app/javascript/vue/components/markdown-editor.vue:15 imports easymde/dist/easymde.min.js, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead. — app/javascript/vue/components/markdown-editor.vue:15
  • app/javascript/vue/components/ui/VMap/VMap.vue:22 imports leaflet.markercluster/dist/leaflet.markercluster, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead. — app/javascript/vue/components/ui/VMap/VMap.vue:22
  • app/javascript/vue/tasks/otus/browse/components/Panel/PanelBiologicalAssociations/PanelBiologicalAssociationsNetwork.vue:44 imports v-network-graph/lib/force-layout, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead. — app/javascript/vue/tasks/otus/browse/components/Panel/PanelBiologicalAssociations/PanelBiologicalAssociationsNetwork.vue:44

What to do

  • Fix the listed violations: import through public entries (package exports / slice index), never reach into another layer or package's internals.
R2 · Cyclomatic Complexity9.8 / 10Exemplary✓ Tool-verified

React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.

Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.

  • onInput has cyclomatic complexity 24 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/components/ui/AutoselectField.vue:537
  • onWindowMouseup has cyclomatic complexity 23 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/tasks/containers/collection_layout/components/SvgGrid.vue:299
  • makeItem has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/components/LightTable/composables/useLightTable.js:56
  • addRooms has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/tasks/containers/collection_layout/components/ScaffoldForm.vue:220
  • computeChanges has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/tasks/images/light_table/adapters/changes.js:11
  • setSelectorParams has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/tasks/anatomical_parts/anatomical_parts_graph/app.vue:266
  • doCreate has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/components/ui/AutoselectField/ColConfirmModal.vue:503
  • compositionItemToItem has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/tasks/images/light_table/adapters/compositionItem.js:36
  • (anonymous) has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/tasks/dwca_import/store/actions/loadDataSetRecords.js:9
  • mapAnatomicalPartAttributesToAssociationSides has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/components/radials/object/components/biological_relationships/composables/useBiologicalAssociationAnatomicalParts.js:308
  • onWindowMousemove has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/tasks/containers/collection_layout/components/SvgGrid.vue:277
  • onKeyDown has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/components/LightTable/LightTable.vue:184
  • saveAssociation has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/components/radials/object/components/biological_relationships/biological_relationships_annotator.vue:506
  • itemAttributes has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/tasks/images/light_table/adapters/compositionItem.js:90
  • (anonymous) has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/tasks/otus/match_by_taxon_name/components/ResultTable.vue:540
  • classifyApplyOtu has cyclomatic complexity 12 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/tasks/images/light_table/adapters/applyOtu.js:30
  • handleRowUpdate has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/tasks/otus/match_by_taxon_name/app.vue:337
  • (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/components/ui/AutoselectField.vue:673
  • doCreate has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/components/ui/AutoselectField/OtuNewModal.vue:238
  • noUnsavedChanges has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/tasks/projects/dwc_export_preferences/app.vue:397
  • saveBiologicalAssociation has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/tasks/biological_associations/new_ba/store/store.js:234
  • sortFunction has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — app/javascript/vue/helpers/arrays.js:20
R3 · Large Files9.7 / 10Exemplary✓ Tool-verified

React / JS · Code Health — How many source files exceed the large-file threshold.

Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.

  • app/javascript/vue/components/ui/AutoselectField.vue has 1137 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/components/ui/AutoselectField.vue:1
  • app/javascript/vue/tasks/leads/cite_key/app.vue has 961 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/leads/cite_key/app.vue:1
  • app/javascript/vue/tasks/otus/match_by_taxon_name/components/ResultTable.vue has 645 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/otus/match_by_taxon_name/components/ResultTable.vue:1
  • app/javascript/vue/components/Filter/Table/TableResults.vue has 638 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/components/Filter/Table/TableResults.vue:1
  • app/javascript/vue/components/radials/object/components/biological_relationships/biological_relationships_annotator.vue has 636 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/components/radials/object/components/biological_relationships/biological_relationships_annotator.vue:1
  • app/javascript/vue/tasks/otus/match_by_taxon_name/app.vue has 606 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/otus/match_by_taxon_name/app.vue:1
  • app/javascript/vue/components/ui/AutoselectField/ColConfirmModal.vue has 587 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/components/ui/AutoselectField/ColConfirmModal.vue:1
  • app/javascript/vue/tasks/data_attributes/field_synchronize/components/Table/VTable.vue has 583 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/data_attributes/field_synchronize/components/Table/VTable.vue:1
  • app/javascript/vue/components/LightTable/composables/useLightTable.js has 579 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/components/LightTable/composables/useLightTable.js:1
  • app/javascript/vue/tasks/collection_objects/slide_breakdown/app.vue has 566 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/collection_objects/slide_breakdown/app.vue:1
  • app/javascript/vue/tasks/projects/dwc_export_preferences/app.vue has 536 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/projects/dwc_export_preferences/app.vue:1
  • app/javascript/vue/components/ui/Autocomplete.vue has 535 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/components/ui/Autocomplete.vue:1
  • app/javascript/vue/tasks/sources/new_source/components/bibtex/AuthorMatchModal.vue has 522 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/sources/new_source/components/bibtex/AuthorMatchModal.vue:1
  • app/javascript/vue/components/ui/SmartSelector.vue has 487 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/components/ui/SmartSelector.vue:1
  • app/javascript/vue/components/radials/annotator/annotator.vue has 472 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/components/radials/annotator/annotator.vue:1
  • app/javascript/vue/tasks/leads/new_lead/shared/Couplet.vue has 458 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/leads/new_lead/shared/Couplet.vue:1
  • app/javascript/vue/tasks/leads/new_lead/shared/Lead.vue has 449 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/leads/new_lead/shared/Lead.vue:1
  • app/javascript/vue/components/role_picker.vue has 444 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/components/role_picker.vue:1
  • app/javascript/vue/tasks/biological_associations/biological_associations_graph/components/BiologicalAssociationsGraph.vue has 425 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/biological_associations/biological_associations_graph/components/BiologicalAssociationsGraph.vue:1
  • app/javascript/vue/tasks/leads/new_lead/store/leadStore.js has 423 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/leads/new_lead/store/leadStore.js:1
  • app/javascript/vue/tasks/containers/collection_layout/components/SvgGrid.vue has 422 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/containers/collection_layout/components/SvgGrid.vue:1
  • app/javascript/vue/tasks/data_attributes/field_synchronize/composables/useFieldSync.js has 418 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/data_attributes/field_synchronize/composables/useFieldSync.js:1
  • app/javascript/vue/tasks/data_attributes/multi_update/components/DataAttributeTable.vue has 417 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/data_attributes/multi_update/components/DataAttributeTable.vue:1
  • app/assets/javascripts/workbench/pinboard.js has 416 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/assets/javascripts/workbench/pinboard.js:1
  • app/javascript/vue/tasks/nomenclature/reclassifier/components/Tree/TreeNode.vue has 410 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/nomenclature/reclassifier/components/Tree/TreeNode.vue:1
  • app/javascript/vue/components/radials/navigation/radial.vue has 408 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/components/radials/navigation/radial.vue:1
  • app/javascript/vue/components/ui/VMap/VMap.vue has 401 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/components/ui/VMap/VMap.vue:1
  • app/javascript/vue/tasks/biological_associations/biological_associations_graph/composition/useGraph.js has 401 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — app/javascript/vue/tasks/biological_associations/biological_associations_graph/composition/useGraph.js:1

What to do

  • Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
R5 · Dependency Freshness6.6 / 10Strong✓ Tool-verified

React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).

Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.

  • 34 outdated package(s); JS/npm CVEs scored in D30
R6 · Tooling0.0 / 10Critical✓ Tool-verified

React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.

Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.

  • test ✗ · lint ✗ · typecheck ✗ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.
  • the root package configures a linter in `eslint.config.mjs`, but no package script, bundler plugin, task runner or CI step in this repository runs a linter, so the rules it sets are enforced nowhere. Run it where it can fail: a `lint` script that CI runs, a linter plugin in the build, or a CI step. — eslint.config.mjs:1

What to do

  • Add a test runner (vitest / jest / playwright) and eslint and type checking (adopt TypeScript, or type-check the existing JavaScript with `checkJs`) as package.json scripts and run them in CI.
R7 · Dead Code7.2 / 10Strong✓ Tool-verified

React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).

Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.

  • Unreachable from the 39 application, 4 tooling and 1 test entry point(s) detected in this repo. This repository declares no build, type-check or test script, so nothing here would fail on a wrong deletion — confirm by hand that nothing loads each file (including by a path built at runtime) before removing it. An undetected custom entry would make these reachable.
  • no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×34) — app/javascript/vue/tasks/anatomical_parts/filter/components/filters/FacetTaxonNameRelationshipType.vue, app/javascript/vue/tasks/extracts/filter/components/dwcDownload.vue, app/javascript/vue/components/Filter/Facets/BiologicalAssociation/FacetNomenclatureRelation.vue, …
  • no import path from any entry point (39 application, 4 tooling, 1 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (app/javascript/packs/rspack.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — app/javascript/vanilla/initializers/rspackProgressCompilation.js
  • no import path from any entry point (39 application, 4 tooling, 1 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (app/javascript/vue/tasks/dwc/dashboard/components/Reindex/ReindexPanel.vue) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — app/javascript/vue/tasks/dwc/dashboard/components/ProgressBar.vue
  • no import path from any entry point (39 application, 4 tooling, 1 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (app/javascript/vue/tasks/dwc/dashboard/components/Graph/GraphPanel.vue) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it (×2) — app/javascript/vue/tasks/dwc/dashboard/components/Graph/GraphIndex.vue, app/javascript/vue/tasks/dwc/dashboard/components/Graph/GraphCollectionObjects.vue
  • no import path from any entry point (39 application, 4 tooling, 1 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (app/javascript/vue/components/radials/navigation/components/recent.vue) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — app/javascript/vue/components/radials/navigation/components/radialObjectExtend.js

What to do

  • Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
R8 · Dependency Hygiene3.0 / 10Weak✓ Tool-verified

React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.

Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.

  • Imported but not declared in any reachable package.json — installs work only by hoisting accident. (×3) — config/rspack/rspack.config.js:5, app/javascript/vue/tasks/projects/dwc_export_preferences/components/XmlEditor.vue:7, babel.config.js:2
  • Declared in the root package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×2) — package.json:56, package.json:32

What to do

  • Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
R9 · Circular Imports0.0 / 10Critical✓ Tool-verified

React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.

Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.

  • app/javascript/vue/components/displayList.vue → app/javascript/vue/components/radials/annotator/annotator.vue → app/javascript/vue/components/radials/annotator/constants/slices.js → app/javascript/vue/components/radials/annotator/components/alternate_value_annotator.vue → app/javascript/vue/components/displayList.vue (one verified cycle inside a mutually-dependent group of 57 files) — app/javascript/vue/components/displayList.vue:74
  • app/javascript/vue/components/ui/VMap/constants/index.js → app/javascript/vue/components/ui/VMap/constants/shapes.js → app/javascript/vue/components/ui/VMap/constants/index.js — app/javascript/vue/components/ui/VMap/constants/index.js:5
  • app/javascript/vue/helpers/forms.js → app/javascript/vue/helpers/index.js → app/javascript/vue/helpers/forms.js — app/javascript/vue/helpers/forms.js:1
  • app/javascript/vue/tasks/collection_objects/browse/store/actions/actions.js → app/javascript/vue/tasks/collection_objects/browse/store/actions/loadIdentifiersFor.js → app/javascript/vue/tasks/collection_objects/browse/store/mutations/mutations.js → app/javascript/vue/tasks/collection_objects/browse/store/mutations/resetState.js → app/javascript/vue/tasks/collection_objects/browse/store/store.js → app/javascript/vue/tasks/collection_objects/browse/store/actions/actions.js (one verified cycle inside a mutually-dependent group of 6 files) — app/javascript/vue/tasks/collection_objects/browse/store/actions/actions.js:10
  • app/javascript/vue/tasks/collection_objects/slide_breakdown/store/actions/actions.js → app/javascript/vue/tasks/collection_objects/slide_breakdown/store/actions/nuke.js → app/javascript/vue/tasks/collection_objects/slide_breakdown/store/mutations/mutations.js → app/javascript/vue/tasks/collection_objects/slide_breakdown/store/mutations/resetStore.js → app/javascript/vue/tasks/collection_objects/slide_breakdown/store/store.js → app/javascript/vue/tasks/collection_objects/slide_breakdown/store/actions/actions.js (one verified cycle inside a mutually-dependent group of 7 files) — app/javascript/vue/tasks/collection_objects/slide_breakdown/store/actions/actions.js:3
  • app/javascript/vue/tasks/containers/new_container/utils/index.js → app/javascript/vue/tasks/containers/new_container/utils/makeVisualizerContainerItem.js → app/javascript/vue/tasks/containers/new_container/utils/index.js — app/javascript/vue/tasks/containers/new_container/utils/index.js:4
  • app/javascript/vue/tasks/data_attributes/field_synchronize/composables/index.js → app/javascript/vue/tasks/data_attributes/field_synchronize/composables/useFieldSync.js → app/javascript/vue/tasks/data_attributes/field_synchronize/composables/index.js — app/javascript/vue/tasks/data_attributes/field_synchronize/composables/index.js:1
  • app/javascript/vue/tasks/data_attributes/field_synchronize/factory/index.js → app/javascript/vue/tasks/data_attributes/field_synchronize/factory/makeDataAttributeList.js → app/javascript/vue/tasks/data_attributes/field_synchronize/utils/index.js → app/javascript/vue/tasks/data_attributes/field_synchronize/utils/fillDataAttributes.js → app/javascript/vue/tasks/data_attributes/field_synchronize/factory/index.js — app/javascript/vue/tasks/data_attributes/field_synchronize/factory/index.js:2
  • app/javascript/vue/tasks/digitize/components/biologicalAssociation/main.vue → app/javascript/vue/tasks/digitize/store/mutations/mutations.js → app/javascript/vue/tasks/digitize/store/mutations/resetStore.js → app/javascript/vue/tasks/digitize/store/store.js → app/javascript/vue/tasks/digitize/const/components.js → app/javascript/vue/tasks/digitize/components/biologicalAssociation/main.vue (one verified cycle inside a mutually-dependent group of 35 files) — app/javascript/vue/tasks/digitize/components/biologicalAssociation/main.vue:30
  • app/javascript/vue/tasks/dwca_import/store/actions/actions.js → app/javascript/vue/tasks/dwca_import/store/actions/importRow.js → app/javascript/vue/tasks/dwca_import/store/actions/actions.js (one verified cycle inside a mutually-dependent group of 4 files) — app/javascript/vue/tasks/dwca_import/store/actions/actions.js:3
  • app/javascript/vue/tasks/extracts/new_extract/store/actions/actions.js → app/javascript/vue/tasks/extracts/new_extract/store/actions/resetState.js → app/javascript/vue/tasks/extracts/new_extract/store/store.js → app/javascript/vue/tasks/extracts/new_extract/store/actions/actions.js — app/javascript/vue/tasks/extracts/new_extract/store/actions/actions.js:14
  • app/javascript/vue/tasks/images/new_image/store/actions/actions.js → app/javascript/vue/tasks/images/new_image/store/actions/applyAttibutions.js → app/javascript/vue/tasks/images/new_image/store/mutations/mutations.js → app/javascript/vue/tasks/images/new_image/store/mutations/resetStore.js → app/javascript/vue/tasks/images/new_image/store/store.js → app/javascript/vue/tasks/images/new_image/store/actions/actions.js (one verified cycle inside a mutually-dependent group of 11 files) — app/javascript/vue/tasks/images/new_image/store/actions/actions.js:2
  • app/javascript/vue/tasks/leads/new_lead/full_key/app.vue → app/javascript/vue/tasks/leads/new_lead/store/leadStore.js → app/javascript/vue/tasks/leads/new_lead/shared/layouts/index.js → app/javascript/vue/tasks/leads/new_lead/full_key/app.vue (one verified cycle inside a mutually-dependent group of 5 files) — app/javascript/vue/tasks/leads/new_lead/full_key/app.vue:157
  • app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/actions.js → app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/createObservation.js → app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/mutations/mutations.js → app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/mutations/resetState.js → app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/store.js → app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/actions.js (one verified cycle inside a mutually-dependent group of 12 files) — app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/actions.js:9
  • app/javascript/vue/tasks/otus/browse/components/Panel/PanelTimeline/PanelTimeline.vue → app/javascript/vue/tasks/otus/browse/constants/index.js → app/javascript/vue/tasks/otus/browse/constants/components.js → app/javascript/vue/tasks/otus/browse/components/Panel/PanelTimeline/PanelTimeline.vue (one verified cycle inside a mutually-dependent group of 5 files) — app/javascript/vue/tasks/otus/browse/components/Panel/PanelTimeline/PanelTimeline.vue:68
  • app/javascript/vue/utils/ModalEventStack.js → app/javascript/vue/utils/index.js → app/javascript/vue/utils/ModalEventStack.js (one verified cycle inside a mutually-dependent group of 3 files) — app/javascript/vue/utils/ModalEventStack.js:1

What to do

  • Break each cycle by extracting the shared piece into a module both sides can import.
S1 · Web-Security Posture6.0 / 10Adequate✓ Tool-verified

Other · Security — Read from this repository's Ruby source: cryptographic hygiene (weak hash or cipher, key material fixed in the source) and outbound TLS (certificate validation, protocol version) — facts about code that hold whether or not it serves anything itself. Markup this repository SHIPS is scored for third-party script integrity whether or not the repository serves it itself, since a page handed to a consumer runs in that consumer’s origin. The server controls — HTTPS enforcement, HSTS, cookie flags, input validation — are NOT assessed for Ruby: this reading covers the code's own cryptography and the TLS connections it opens as a client, and a Rails, Rack or Sinatra application's transport, header and validation settings are not modelled. Their absence here is not a finding about this repository.

Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.

  • MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`Digest::SHA256` or `OpenSSL::Digest.new("SHA256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call. (×5) — REDACTED:75, REDACTED:270, REDACTED:19, …
  • `https://cdn.jsdelivr.net/npm/echarts@5/dist/echarts.min.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. 6 such include(s) across the repository's markup. — app/views/tasks/containers/collection_layout/index.html.erb:1

What to do

  • Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (xxhash, murmurhash) where it only derives an identifier such as a cache key. This repository constructs a collision-broken hash (MD5/SHA1) at 5 sites, not one: `REDACTED:75` (Digest::MD5.hexdigest), `REDACTED:270` (Digest::SHA1.hexdigest), `REDACTED:19` (Digest::MD5.hexdigest), `REDACTED:10` (Digest::SHA1.hexdigest), `REDACTED:77` (Digest::MD5.hexdigest). Each is a separate decision — fixing only the line this row cites leaves the others in place.
  • Pin third-party scripts and verify them: name an exact version in the URL and add an `integrity="sha384-…"` hash alongside `crossorigin="anonymous"` (both are required — an integrity hash on a cross-origin script without `crossorigin` is not evaluated, it blocks the script). Where the vendor ships a continuously-updated loader and publishes no stable hash (tag managers, analytics, chat widgets), Subresource Integrity is not available: constrain it instead with a `Content-Security-Policy` that names the exact origins allowed to execute, and drop the script from the pages that do not need it. Where the page is shipped inside a package that others host, prefer vendoring the asset and serving it from the app’s own origin, so no consumer inherits a third-party dependency they did not choose.
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.

X16 · Unfloored truncation loop10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.

Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.

X17 · Uncapped recursion over a caller-supplied document3.5 / 10Weak✓ Tool-verified

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

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

  • `symbolize_keys` is public and takes `hash` — which it walks as a `Hash` — from its caller, and it calls itself at line 28 (`self.symbolize_keys`) with a piece of `hash` — and nowhere in `symbolize_keys` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. A walk like this one raises `SystemStackError` past about 3,800 levels on the main thread and about 1,000 on a `Thread` — where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). `JSON.parse` stops at 100 levels by default, but the other parsers a caller may use do not: `YAML.safe_load` builds 1,400 levels from 2.8 KB, `Oj.load` 100,000, REXML 200,000, and `JSON.load` on json 2.7 (Ruby 3.3's default) or `JSON.parse(…, max_nesting: false)` 58,000. `SystemStackError` is not a `StandardError`: a bare `rescue` or `rescue => e` around the call does not stop it. Thread a depth argument through `symbolize_keys` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — lib/utilities/hashes.rb:28

What to do

  • Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
X18 · Disposal-pattern correctness3.7 / 10Weak✓ Tool-verified

Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.

Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.

  • `File.open` is called here without a block, so it hands back an open descriptor the caller must close — and its first and only use reads `.read` through it and drops it. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`File.open(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`). (×3) — lib/generators/taxon_works/batch_load/batch_load_generator.rb:22, lib/generators/taxon_works/batch_load/batch_load_generator.rb:30, lib/generators/taxon_works/batch_load/batch_load_generator.rb:42
  • `File.open` is called here without a block, so it hands back an open descriptor the caller must close — and its first and only use reads `.each` through it and drops it. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`File.open(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`). — app/models/otu.rb:262
  • `Tempfile.new` is called here without a block, so it hands back an open descriptor the caller must close — and it is held in `tempfile`, and every later use of `tempfile` in `ocr` reads a member through it — it is never closed, returned, passed, yielded or stored. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`Tempfile.new(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`). — REDACTED:225

What to do

  • Each finding names the value and the span that decides who owns it — the `new` that created it, or the constructor parameter that handed it over. Confirm ownership from that span, then make the disposal match it: release what this type created, leave what it was injected with to whoever created THAT, and drop a finalizer whose type holds nothing unmanaged to release.
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.

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.

X25 · Inert configuration knob7.1 / 10Strong✓ Tool-verified

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.

  • `default export` accepts `state` from the caller and keeps it in `state` on line 4, where only it can read the value — but nothing ever reads `state`. Setting `state` therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read `state` where the behaviour it configures is decided — or, if the behaviour genuinely is fixed, remove `state` from the accepted options so callers stop setting a knob that does nothing. (×4) — app/javascript/vue/tasks/observation_matrices/new/store/actions/loadColumnDynamicItems.js:4, app/javascript/vue/tasks/observation_matrices/new/store/actions/loadRowDynamicItems.js:4, app/javascript/vue/tasks/nomenclature/new_taxon_name/store/actions/loadRelationships.js:4, …
  • `default export` accepts `commit` from the caller and keeps it in `commit` on line 3, where only it can read the value — but nothing ever reads `commit`. Setting `commit` therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read `commit` where the behaviour it configures is decided — or, if the behaviour genuinely is fixed, remove `commit` from the accepted options so callers stop setting a knob that does nothing. — app/javascript/vue/tasks/observation_matrices/image/store/actions/createObservation.js:3
  • `useViewerTransform` accepts `pan` from the caller and keeps it in `pan` on line 1, where only it can read the value — but nothing ever reads `pan`. Setting `pan` therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read `pan` where the behaviour it configures is decided — or, if the behaviour genuinely is fixed, remove `pan` from the accepted options so callers stop setting a knob that does nothing. — app/javascript/vue/tasks/images/browse/composables/useViewerTransform.js:1

What to do

  • Each finding names the spans that disagree — the knob the caller supplies and the site that ignores it, whether by re-spelling its default, by falling back under the wrong key, by parsing with no format provider at all, or by printing under whatever culture the host supplies. Confirm from those spans, then decide which of the two the type meant: read the knob at the named site, or drop the knob so the signature stops advertising something the type cannot feel. Leaving both is the one option that cannot be right.
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.

X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.

Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.

X3 · Exception handling3.5 / 10Weak✓ Tool-verified

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.

  • `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×26) — lib/taxonworks_net.rb:15, REDACTED:365, lib/utilities/files.rb:37, …
  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×12) — lib/batch_load/import/otus/identifiers_interpreter.rb:42, lib/batch_load/import/collecting_events/gpx_interpreter.rb:57, REDACTED:728, …
  • `… rescue false` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×2) — app/models/project.rb:281, app/models/identifier/global.rb:55

What to do

  • Swallowed exception (caught, then discarded)
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.

X5 · Nullable reference types2.0 / 10Critical✓ Tool-verified

Other · Code Health — Whether Ruby's type checker checks nil and is not undermined by assertions — a file Sorbet reads at `# typed: true` or above, or a Steep target `check`s under its default or strict diagnostics, is one where a method call on a `T.nilable(String)` / `String?` is an error, and each `T.must`, `#: as !nil` or `# steep:ignore NoMethod` is the author telling the checker a value cannot be nil.

Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.

  • This repository commits no Sorbet configuration (`sorbet/config`) and no `Steepfile`, so nothing type-checks its 2235 Ruby product file(s): a nilable value reaches a method call silently and raises `NoMethodError: undefined method … for nil` the first time it is nil. A `# typed:` sigil does nothing without a `sorbet/config` beside the code; a Steep run configured only on a command line is not something this check can read.

What to do

  • Adopt a checker and raise it file by file: with Sorbet, `srb init` (or `bundle exec tapioca init`) commits `sorbet/config`, then move each file's sigil from `# typed: false` to `# typed: true` and on to `strict` as its methods get `sig`s — `spoom bump` does the moving; with Steep, write RBS signatures and `check` the product directories in the `Steepfile` under `D::Ruby.default` or `strict`, not `lenient`. Then pay down the assertions rather than adding to them: each `T.must` is a nil the checker could not rule out — narrow it (`return unless x`, `x&.`, `if (y = x)`), make the attribute non-nilable and set it in `initialize`, or change the method so the nil cannot arrive.

WCAG coverage — what static analysis assessed

Statically assessed 15 of 55 WCAG 2.2 Level A/AA success criteria (27%; ≈30% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 40 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).

DimensionWCAG 2.2 A/AA criteriaCoverage
AC1 · Text alternatives1.1.1, 1.2.2, 1.2.5Partial signal
AC2 · Forms & labels1.3.1, 3.3.2, 4.1.2Partial signal
AC3 · Page structure1.4.4, 2.2.1, 2.4.1, 2.4.2, 3.1.1, 4.1.2Partial signal
AC4 · Keyboard semantics2.1.1, 2.4.3Partial signal
AC5 · ARIA correctness4.1.2Partial signal
AC6 · Visual & motion safety1.4.3, 2.4.7Partial — literal CSS only

Not statically assessed — these 40 Level A/AA criteria need runtime or manual evaluation (WCAG-EM): 1.2.1, 1.2.3, 1.2.4, 1.3.2, 1.3.3, 1.3.4, 1.3.5, 1.4.1, 1.4.2, 1.4.5, 1.4.10, 1.4.11, 1.4.12, 1.4.13, 2.1.2, 2.1.4, 2.2.2, 2.3.1, 2.4.4, 2.4.5, 2.4.6, 2.4.11, 2.5.1, 2.5.2, 2.5.3, 2.5.4, 2.5.7, 2.5.8, 3.1.2, 3.2.1, 3.2.2, 3.2.3, 3.2.4, 3.2.6, 3.3.1, 3.3.3, 3.3.4, 3.3.7, 3.3.8, 4.1.3.

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 Health39.1Weak — gated by R1, X3, X5Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture65.2Adequate — gated by R9Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity57.7Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness36.2Weak — gated by R6, R8, P3, P7Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security50.9Adequate — gated by D29, D31, D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Domain Modelling75.6StrongSolid.
Accessibility31.6Weak — gated by AC1, AC4Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance100.0ExemplaryStrongest area.
Unscored — 2 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 — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
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 — C3 reached only 40% of this repository's production lines — javascript (203,442 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • C4 Data Retention — Repo shows no data-retention / TTL / cleanup mechanism for personal data — absence of evidence is not evidence of a working control. Define retention periods and a purge/cleanup job (or TTL) in code, or document where retention is enforced, so this dimension can be scored.
  • C5 Data-Subject Rights — Repo shows no corroborated data-subject-rights mechanism (erasure / export-portability / consent) tied to a subject id or GDPR vocabulary — absence of evidence is not evidence of a working control. Implement erasure, data export/portability and consent tracking over the subject's records.
Not included — 48 check(s) not relevant to this codebase

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

  • AX1 Captive dependencies — Not applicable: this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Ruby 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.
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — compose up failed (exit 17 — an image could not be built) — te && apt-get install -y locales libgtk-3-0 libgtk-3-dev libdbus-glib-1-2 libxt6 libasound2t64 && curl -sL 'https://download.mozilla.org/?product=firefox-latest&lang=en-US&os=linux64' | tar -xJf - -C /usr/bin && /usr/bin/firefox/firefox --version && apt clean && rm -rf /var/lib/apt/lists/* /tmp/* /var/tmp/*" did not complete successfully: exit code: 2; likely cause (the repository): a RUN step of the repository's REDACTED exited with code 2 (`/bin/sh -c apt-get update && apt-get install -y locales libgtk-3-0 libgtk-3-dev libdbus-glib-…`): the build's own command failed, for example a compile or test error; runtime evidence skipped The cause is in the repository, not in our sandbox: a RUN step of the repository's REDACTED exited with code 2 (`/bin/sh -c apt-get update && apt-get install -y locales libgtk-3-0 libgtk-3-dev libdbus-glib-…`): the build's own command failed, for example a compile or test error. Nothing here says the surface is inaccessible, only that it was never rendered.
  • C1 Data Protection — C1 reached only 40% of this repository's production lines — javascript (203,442 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • C2 Access Controls — C2 reached only 40% of this repository's production lines — javascript (203,442 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • D11 Test Reliability — Test reliability not included — the .rb 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.
  • D21 Naming Consistency — D21 withholds its case and prefix conventions rows: 3 candidate(s) found and not reported.
  • D22 Internal API Consistency — No intentionally-exposed public API to evaluate for consistency.
  • 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+ sibling projects each declaring an entity of their own or taking another project's integration events. Aggregate roots were found in only one source directory (db), which is a layered codebase, not two contexts. 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"]`.
  • D25 ADR Conformance — no ADRs to check
  • D26 Project Cohesion — D26 could not read how the parts of this repository's one build unit reference each other, so its cohesion was not measured. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D27 Navigability — symbol resolution incomplete — navigability not assessed
  • D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
  • 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.
  • D42 Runtime Threat Enforcement — The repository ships application workloads but no cluster-governance resources (CRDs, admission webhooks, or a committed policy engine). Runtime threat-detection (Falco/Tetragon) and admission control (Kyverno/OPA-Gatekeeper/PodSecurity) are cluster-OPERATOR controls owned by the platform, not shipped by an application repo/chart — nothing for this repo to assess.
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • D8 Code Coverage — Coverage not included — suite not readable by the collector
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust and Java, 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
  • M4 Documentation accuracy — Not applicable: the 17 current-state document(s) make no claim of a kind M4 checks. 2 claim(s) of kinds M4 does not check were not checked (path 1, environment variable 1); M4 checks only links and versions and artefact counts.
  • 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'.
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `x.report(…)` entries in a `Benchmark.ips`/`bm`/`bmbm`/`benchmark`/`memory` block, `benchmark:` entries in a benchmark-driver YAML under a bench* directory, rspec-benchmark `perform_*` expectations where the gem is installed, or benchmark-ips, benchmark-memory, rspec-benchmark or benchmark-driver in a Gemfile or gemspec, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • R4 Test Coverage — 1 test file(s) reach none of 3149 production file(s) via imports — exercised outside the JS import graph (integration/bundled), not import-reachable
  • SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X2 Cancellation propagation — no C# was loaded; this repository's Ruby was read, and no request in it can be cancelled by a caller — a Ruby request takes no token: Net::HTTP, Faraday and async-http are stopped from outside the call (Async::Task#stop, Thread#raise, Timeout), not through a parameter
  • 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.
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X24 Document value interpolated into markup unescaped — Document value interpolated into markup unescaped could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository.
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X27 Collection changed while being enumerated — X27 reached only 40% of this repository's production lines — javascript (203,442 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • 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 — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Ruby was read, and it logs through none: the standard library's Logger, which Rails.logger is, takes one finished message and no template arguments or fields (as log4net does in C#), so an interpolated message there loses nothing the API could have kept. The console gem (`Console.info`), SemanticLogger, Ougai and dry-logger would be judged.
  • X6 Hand-rolled structured-format parsing — 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 — 323 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 141 more in this group — see findings.md.
AC2 · Forms & labels · <input> without a programmatic label · ×20
  • <input> without a programmatic label app/assets/javascripts/views/citations/_topic_picker.js:122 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label app/javascript/vue/components/Export/PredicateFilter.vue:46 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Export/PredicateFilter.vue:60 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Export/PredicateFilter.vue:78 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Export/PredicateFilter.vue:92 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Export/PredicateFilter.vue:110 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Export/PredicateFilter.vue:124 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Filter/Facets/CollectingEvent/FacetCollectingEvent/AttributeForm.vue:6 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Filter/Facets/CollectingEvent/FacetCollectingEvent/FacetCollectingEvent.vue:9 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Filter/Facets/CollectingEvent/FacetCollectingEvent/FacetCollectingEvent.vue:18 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Filter/Facets/Extract/FacetDateRange.vue:7 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Filter/Facets/Extract/FacetDateRange.vue:15 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Filter/Facets/Extract/FacetVerbatimAnatomical.vue:6 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Filter/Facets/Otu/FacetWKT.vue:4 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Filter/Facets/Source/FacetAuthors.vue:6 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Filter/Facets/Source/FacetDate.vue:7 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Filter/Facets/Source/FacetDate.vue:16 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Filter/Facets/Source/FacetEditors.vue:6 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Filter/Facets/Source/FacetTitle.vue:6 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label app/javascript/vue/components/Filter/Facets/Source/FacetTitle.vue:15 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC4 · Keyboard semantics · Click handler on a non-interactive <span> · ×18
  • Click handler on a non-interactive <span> app/javascript/vue/components/Filter/Facets/shared/FacetIdentifiers.vue:65 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/editInPlace.vue:4 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/expand.vue:3 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/expand.vue:8 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/list/VListItemControl.vue:15 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/list/VListItemControl.vue:21 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/pagination.vue:72 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/pagination.vue:79 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/radials/object/components/displayList.vue:25 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/radials/object/components/displayList.vue:31 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/radials/object/components/origin_relationship/components/relationshipsTableRow.vue:9 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/radials/object/components/shared/listItems.vue:26 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/radials/object/components/shared/listItems.vue:32 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/radials/object/components/shared/tableList.vue:31 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/radials/object/components/shared/tableList.vue:36 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/radials/shared/CopyObjectId.vue:2 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/table_list.vue:48 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <span> app/javascript/vue/components/taxon_names/browseTaxon.vue:2 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
AC2 · Forms & labels · <label> that labels no control · ×17
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/CollectingEvent/FacetCollectingEvent/AttributeForm.vue:4 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/CollectingEvent/FacetCollectingEvent/AttributeForm.vue:13 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/CollectingEvent/FacetCollectingEvent/FacetCollectingEvent.vue:7 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/CollectingEvent/FacetCollectingEvent/FacetCollectingEvent.vue:16 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/Extract/FacetDateRange.vue:6 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/Extract/FacetDateRange.vue:14 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/Extract/FacetVerbatimAnatomical.vue:5 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/Source/FacetAuthors.vue:5 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/Source/FacetDate.vue:6 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/Source/FacetDate.vue:15 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/Source/FacetEditors.vue:5 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/Source/FacetTitle.vue:5 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/Source/FacetTitle.vue:14 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/TaxonName/components/ConverageSelector.vue:3 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/TaxonName/components/IncludeSelector.vue:3 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/TaxonName/components/TaxonNameMode.vue:3 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control app/javascript/vue/components/Filter/Facets/shared/FacetByAttributeRow/ByAttributeRow.vue:5 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D31 · IaC & Container Security · High IaC · ×10
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
DM6 · Domain ↔ infrastructure boundary · Domain fused to persistence infrastructure · ×9
  • Domain fused to persistence infrastructure: Document app/models/document.rb:52 — `Document` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository).
  • Domain fused to persistence infrastructure: Import app/models/import.rb:28 — `Import` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository).
  • Domain fused to persistence infrastructure: Lead app/models/lead.rb:57 — `Lead` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository).
  • Domain fused to persistence infrastructure: LoanItem REDACTED:38 — `LoanItem` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository).
  • Domain fused to persistence infrastructure: Person app/models/person.rb:51 — `Person` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository).
  • Domain fused to persistence infrastructure: Project app/models/project.rb:21 — `Project` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository).
  • Domain fused to persistence infrastructure: TaxonName REDACTED:159 — `TaxonName` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository).
  • Domain fused to persistence infrastructure: TaxonNameClassification REDACTED:18 — `TaxonNameClassification` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository).
  • Domain fused to persistence infrastructure: User REDACTED:106 — `User` is a domain concept fused to persistence ON ITS OWN DECLARATION (Rails ActiveRecord — `ApplicationRecord`) — the domain entity IS the ActiveRecord row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model + a mapper, and the domain entity framework-free (map row↔domain through a repository).
AC1 · Text alternatives · <img> without a text alternative · ×8
  • <img> without a text alternative app/javascript/vue/components/radials/annotator/components/depictions/depiction_annotator.vue:9 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative app/javascript/vue/tasks/digitize/components/shared/zoomImage.vue:31 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative app/javascript/vue/tasks/images/filter/components/image.vue:74 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative app/javascript/vue/tasks/images/new_filename_depicting_image/components/ImageErrorList.vue:9 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative app/javascript/vue/tasks/interactive_keys/components/Descriptors/Depictions/Character.vue:9 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative app/javascript/vue/tasks/observation_matrices/image/components/View/CellDepiction.vue:13 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative app/javascript/vue/tasks/observation_matrices/matrix_column_coder/MatrixColumnCoder/DepictionModal/Character.vue:9 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
  • <img> without a text alternative app/javascript/vue/tasks/observation_matrices/matrix_row_coder/MatrixRowCoder/DepictionModal/Character.vue:9 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
R9 · Circular Imports · Import cycle (2 files) · ×6
  • Import cycle (2 files) app/javascript/vue/components/ui/VMap/constants/index.js:5 — app/javascript/vue/components/ui/VMap/constants/index.js → app/javascript/vue/components/ui/VMap/constants/shapes.js → app/javascript/vue/components/ui/VMap/constants/index.js
  • Import cycle (2 files) app/javascript/vue/helpers/forms.js:1 — app/javascript/vue/helpers/forms.js → app/javascript/vue/helpers/index.js → app/javascript/vue/helpers/forms.js
  • Import cycle (2 files) app/javascript/vue/tasks/containers/new_container/utils/index.js:4 — app/javascript/vue/tasks/containers/new_container/utils/index.js → app/javascript/vue/tasks/containers/new_container/utils/makeVisualizerContainerItem.js → app/javascript/vue/tasks/containers/new_container/utils/index.js
  • Import cycle (2 files) app/javascript/vue/tasks/data_attributes/field_synchronize/composables/index.js:1 — app/javascript/vue/tasks/data_attributes/field_synchronize/composables/index.js → app/javascript/vue/tasks/data_attributes/field_synchronize/composables/useFieldSync.js → app/javascript/vue/tasks/data_attributes/field_synchronize/composables/index.js
  • Import cycle (2 files) app/javascript/vue/tasks/dwca_import/store/actions/actions.js:3 — app/javascript/vue/tasks/dwca_import/store/actions/actions.js → app/javascript/vue/tasks/dwca_import/store/actions/importRow.js → app/javascript/vue/tasks/dwca_import/store/actions/actions.js (one verified cycle inside a mutually-dependent group of 4 files)
  • Import cycle (2 files) app/javascript/vue/utils/ModalEventStack.js:1 — app/javascript/vue/utils/ModalEventStack.js → app/javascript/vue/utils/index.js → app/javascript/vue/utils/ModalEventStack.js (one verified cycle inside a mutually-dependent group of 3 files)
AC4 · Keyboard semantics · Click handler on a non-interactive <div> · ×5
  • Click handler on a non-interactive <div> app/javascript/vue/components/graph/ContextMenu.vue:2 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> app/javascript/vue/components/pinboard/navigator.vue:3 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> app/javascript/vue/components/ui/Context/ContextMenu.vue:2 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> app/javascript/vue/components/ui/VToggleLockHeader.vue:2 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> app/javascript/vue/components/ui/VToggleTheme.vue:2 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
D35 · Change Coupling · Boundary-crossing change coupling · ×5
  • Boundary-crossing change coupling: inaturalist_import_controller.rb ↔ inaturalist_import_helper.rb app/controllers/tasks/field_occurrences/inaturalist_import_controller.rb:1 — `app/controllers/tasks/field_occurrences/inaturalist_import_controller.rb` (context controllers) and `app/helpers/tasks/field_occurrences/inaturalist_import_helper.rb` (context helpers) sit in DIFFERENT parts of the tree yet change together 83% of the time (10 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `36f701bb` Cleanup #5086; `f7a805fa` Cleanup #5086; `bee82452` Add set-determination-for-all button to iNat import pre-import #5086 — run `git show` on any of them.
  • Boundary-crossing change coupling: REDACTED ↔ base.rb app/controllers/metadata_controller.rb:1 — `app/controllers/metadata_controller.rb` (context controllers) and `config/routes/base.rb` (context config) sit in DIFFERENT parts of the tree yet change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `01124f27` Get Filter OTU to Project Vocab working #4007; `ff6294af` Add /annotations/move_one?to_global_id=&annotation_global_id=; `fd51925a` /metadata/class_navigation endpoint — run `git show` on any of them.
  • Boundary-crossing change coupling: format.rb ↔ name.rb app/models/protonym/format.rb:1 — `app/models/protonym/format.rb` (context models) and `lib/export/coldp/files/name.rb` (context export) sit in DIFFERENT parts of the tree yet change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `7f9d03d6` Refactor autonym_synonym.; `e3648f90` Fix combinations with no Source being excluded; `f9b17d3c` Include Combinations that reference inferred combination Protonyms — run `git show` on any of them.
  • Boundary-crossing change coupling: REDACTED ↔ data.rb REDACTED:1 — `REDACTED` (context controllers) and `config/routes/data.rb` (context config) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `efacf771` Add batch create from filter CE/OTU for Asserted Environments #5128; `7d29d001` Remove #update action on AE; cleanup #114; `9abba15e` Add smart level to AE autoselect #114 — run `git show` on any of them.
  • Boundary-crossing change coupling: REDACTED ↔ biological_associations_helper.rb REDACTED:1 — `REDACTED` (context controllers) and `app/helpers/biological_associations_helper.rb` (context helpers) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `41aa93f6` Finish getting Browse AD working for any object type #4025; `b7d526d5` Add autocomplete/search for BiologicalAssociations #4025; `48fa37da` Adds an extended BA endpoint (closes #3944) — run `git show` on any of them.
R9 · Circular Imports · Import cycle (5 files) · ×5
  • Import cycle (5 files) app/javascript/vue/tasks/collection_objects/browse/store/actions/actions.js:10 — app/javascript/vue/tasks/collection_objects/browse/store/actions/actions.js → app/javascript/vue/tasks/collection_objects/browse/store/actions/loadIdentifiersFor.js → app/javascript/vue/tasks/collection_objects/browse/store/mutations/mutations.js → app/javascript/vue/tasks/collection_objects/browse/store/mutations/resetState.js → app/javascript/vue/tasks/collection_objects/browse/store/store.js → app/javascript/vue/tasks/collection_objects/browse/store/actions/actions.js (one verified cycle inside a mutually-dependent group of 6 files)
  • Import cycle (5 files) app/javascript/vue/tasks/collection_objects/slide_breakdown/store/actions/actions.js:3 — app/javascript/vue/tasks/collection_objects/slide_breakdown/store/actions/actions.js → app/javascript/vue/tasks/collection_objects/slide_breakdown/store/actions/nuke.js → app/javascript/vue/tasks/collection_objects/slide_breakdown/store/mutations/mutations.js → app/javascript/vue/tasks/collection_objects/slide_breakdown/store/mutations/resetStore.js → app/javascript/vue/tasks/collection_objects/slide_breakdown/store/store.js → app/javascript/vue/tasks/collection_objects/slide_breakdown/store/actions/actions.js (one verified cycle inside a mutually-dependent group of 7 files)
  • Import cycle (5 files) app/javascript/vue/tasks/digitize/components/biologicalAssociation/main.vue:30 — app/javascript/vue/tasks/digitize/components/biologicalAssociation/main.vue → app/javascript/vue/tasks/digitize/store/mutations/mutations.js → app/javascript/vue/tasks/digitize/store/mutations/resetStore.js → app/javascript/vue/tasks/digitize/store/store.js → app/javascript/vue/tasks/digitize/const/components.js → app/javascript/vue/tasks/digitize/components/biologicalAssociation/main.vue (one verified cycle inside a mutually-dependent group of 35 files)
  • Import cycle (5 files) app/javascript/vue/tasks/images/new_image/store/actions/actions.js:2 — app/javascript/vue/tasks/images/new_image/store/actions/actions.js → app/javascript/vue/tasks/images/new_image/store/actions/applyAttibutions.js → app/javascript/vue/tasks/images/new_image/store/mutations/mutations.js → app/javascript/vue/tasks/images/new_image/store/mutations/resetStore.js → app/javascript/vue/tasks/images/new_image/store/store.js → app/javascript/vue/tasks/images/new_image/store/actions/actions.js (one verified cycle inside a mutually-dependent group of 11 files)
  • Import cycle (5 files) app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/actions.js:9 — app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/actions.js → app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/createObservation.js → app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/mutations/mutations.js → app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/mutations/resetState.js → app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/store.js → app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/actions.js (one verified cycle inside a mutually-dependent group of 12 files)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D14 · License Compliance · Banned license · ×3
  • Banned license: bibtex-ruby — `bibtex-ruby` 6.2.0 is published on rubygems.org under GPL-3.0-or-later, which this policy bans, and it is in the RUNTIME closure of this repository's Bundler manifests — so it is installed by everything that installs this repository, not just by its test harness. Replace it, or record an accepted exception.
  • Banned license: latex-decode — `latex-decode` 0.4.2 is published on rubygems.org under GPL-3.0-or-later, which this policy bans, and it is in the RUNTIME closure of this repository's Bundler manifests — so it is installed by everything that installs this repository, not just by its test harness. Replace it, or record an accepted exception.
  • Banned license: ruby-graphviz — `ruby-graphviz` 1.2.5 is published on rubygems.org under GPL-2.0, which this policy bans, and it is in the RUNTIME closure of this repository's Bundler manifests — so it is installed by everything that installs this repository, not just by its test harness. Replace it, or record an accepted exception.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
R9 · Circular Imports · Import cycle (3 files) · ×3
  • Import cycle (3 files) app/javascript/vue/tasks/extracts/new_extract/store/actions/actions.js:14 — app/javascript/vue/tasks/extracts/new_extract/store/actions/actions.js → app/javascript/vue/tasks/extracts/new_extract/store/actions/resetState.js → app/javascript/vue/tasks/extracts/new_extract/store/store.js → app/javascript/vue/tasks/extracts/new_extract/store/actions/actions.js
  • Import cycle (3 files) app/javascript/vue/tasks/leads/new_lead/full_key/app.vue:157 — app/javascript/vue/tasks/leads/new_lead/full_key/app.vue → app/javascript/vue/tasks/leads/new_lead/store/leadStore.js → app/javascript/vue/tasks/leads/new_lead/shared/layouts/index.js → app/javascript/vue/tasks/leads/new_lead/full_key/app.vue (one verified cycle inside a mutually-dependent group of 5 files)
  • Import cycle (3 files) app/javascript/vue/tasks/otus/browse/components/Panel/PanelTimeline/PanelTimeline.vue:68 — app/javascript/vue/tasks/otus/browse/components/Panel/PanelTimeline/PanelTimeline.vue → app/javascript/vue/tasks/otus/browse/constants/index.js → app/javascript/vue/tasks/otus/browse/constants/components.js → app/javascript/vue/tasks/otus/browse/components/Panel/PanelTimeline/PanelTimeline.vue (one verified cycle inside a mutually-dependent group of 5 files)
AC2 · Forms & labels · Link with no accessible name · ×2
  • Link with no accessible name REDACTED:151 — A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can't say where it goes. Add visible text or an aria-label.
  • Link with no accessible name REDACTED:183 — A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can't say where it goes. Add visible text or an aria-label.
AC5 · ARIA correctness · Invalid ARIA role "Collector" · ×2
  • Invalid ARIA role "Collector" app/javascript/vue/tasks/collecting_events/filter/components/Filter.vue:5 — This role is not a valid WAI-ARIA role, so assistive tech ignores it. Use a valid role (or the native element).
  • Invalid ARIA role "Collector" app/javascript/vue/tasks/collection_objects/filter/components/filter.vue:15 — This role is not a valid WAI-ARIA role, so assistive tech ignores it. Use a valid role (or the native element).
R9 · Circular Imports · Import cycle (4 files) · ×2
  • Import cycle (4 files) app/javascript/vue/components/displayList.vue:74 — app/javascript/vue/components/displayList.vue → app/javascript/vue/components/radials/annotator/annotator.vue → app/javascript/vue/components/radials/annotator/constants/slices.js → app/javascript/vue/components/radials/annotator/components/alternate_value_annotator.vue → app/javascript/vue/components/displayList.vue (one verified cycle inside a mutually-dependent group of 57 files)
  • Import cycle (4 files) app/javascript/vue/tasks/data_attributes/field_synchronize/factory/index.js:2 — app/javascript/vue/tasks/data_attributes/field_synchronize/factory/index.js → app/javascript/vue/tasks/data_attributes/field_synchronize/factory/makeDataAttributeList.js → app/javascript/vue/tasks/data_attributes/field_synchronize/utils/index.js → app/javascript/vue/tasks/data_attributes/field_synchronize/utils/fillDataAttributes.js → app/javascript/vue/tasks/data_attributes/field_synchronize/factory/index.js
AC2 · Forms & labels · <select> without a programmatic label · ×1
  • <select> without a programmatic label app/javascript/vue/components/Filter/Facets/shared/FacetByAttributeRow/ByAttributeRow.vue:6 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC4 · Keyboard semantics · Double-click handler on a non-interactive <span> · ×1
  • Double-click handler on a non-interactive <span> app/javascript/vue/components/LightTable/components/LightTableItem.vue:61 — This <span> binds double-click and nothing else. No click, no key handler, and no tabindex="0", so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native <button> or <a href>. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role + tabindex="0" + a key handler alongside the double-click.
AC4 · Keyboard semantics · Double-click handler on a non-interactive <div> · ×1
  • Double-click handler on a non-interactive <div> app/javascript/vue/components/resizeHandle.vue:2 — This <div> binds mousedown and double-click — pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabindex="0", so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native <button> or <a href>. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role + tabindex="0" + a key handler alongside the double-click.
AC4 · Keyboard semantics · Click handler on a non-interactive <li> · ×1
  • Click handler on a non-interactive <li> app/javascript/vue/components/ui/AutoselectField/ColDatasetPicker.vue:63 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
AC5 · ARIA correctness · Invalid ARIA role "Determiner" · ×1
  • Invalid ARIA role "Determiner" app/javascript/vue/components/Filter/Facets/CollectionObject/Determiner/FacetDetermination.vue:38 — This role is not a valid WAI-ARIA role, so assistive tech ignores it. Use a valid role (or the native element).
D28 · Secrets (history) · REDACTED · ×1
  • REDACTED
D28 · Secrets (history) · High secret · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · High CVE · ×1
  • REDACTED
R8 · Dependency Hygiene · Unlisted import '@rspack/core' · ×1
  • Unlisted import '@rspack/core' config/rspack/rspack.config.js:5 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
R8 · Dependency Hygiene · Unlisted import 'codemirror' · ×1
  • Unlisted import 'codemirror' app/javascript/vue/tasks/projects/dwc_export_preferences/components/XmlEditor.vue:7 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
R8 · Dependency Hygiene · Unlisted import 'shakapacker' · ×1
  • Unlisted import 'shakapacker' babel.config.js:2 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
Serious — 2612 finding(s)
D17 · Explicit Debt · TodoComment · ×1042
  • TodoComment spec/rails_helper.rb:22 — # TODO: this is all kinds of fragile and terrible. Potential fix: — 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 spec/spec_helper.rb:116 — # TODO if global than doesn't belong in Features — 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 spec/spec_helper.rb:139 — # TODO, this should be downloads: true strategy to eliminate need to call everytime — 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 spec/support/models.rb:21 — # TODO: Reconsider need if occurrence import specs are refactored — 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 spec/support/projects_and_users.rb:11 — # TODO: should not be needed anymore — 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 spec/support/projects_and_users.rb:23 — # TODO: Not sure why this is required, perhaps Spring related?! — 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 spec/support/shared_contexts/shared_cached_map.rb:2 — # TODO: GeographicItems for Gazetteers can be any shape type - also note — 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 spec/support/shared_contexts/shared_geo.rb:898 — # TODO: All of these need by: and project: — 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 spec/support/features/authentication_helpers.rb:15 — #find_link('sign_out') # TODO: check for Capybara bug fix down the road? — 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 spec/support/features/wait_for_ajax.rb:2 — # TODO: Remove this file. Time has passed, now this shouldn't be required. No spec is currently using this as of 2019-12-29. — 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 spec/support/concerns/request/api.rb:38 — # They are not at this point, so we write an exception. TODO: remove factory_bot ancestor spin-ups and use a shared_context instead — 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 spec/support/concerns/request/api.rb:93 — # They are not at this point, so we write an exception. TODO: remove factory_bot ancestor spin-ups and use a shared_context instead — 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 spec/models/alternate_value_spec.rb:175 — # TODO: remove Current.project_id — 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 spec/models/collection_object_spec.rb:518 — # TODO: (Nearly) all this belongs in the Identifiers Concern specs !!! — 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 spec/models/collection_object_spec.rb:618 — # TODO: below all generic identifier specs, move — 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 spec/models/container_item_spec.rb:19 — # TODO: move to concern — 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 spec/models/download_spec.rb:4 — # TODO: Avoid having to merge file_path when factory already provides this — 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 spec/controllers/downloads_controller_spec.rb:31 — # TODO: Avoid having to merge file_path when factory already provides this — 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 spec/models/geographic_area_spec.rb:4 — # TODO: Where/how to generate the real GeoJSON (RGeo::GeoJSON.encode(object) does not seem to work properly) — 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 spec/models/geographic_area_spec.rb:313 — # TODO: cleanup/extend — 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 spec/models/georeference_spec.rb:251 — # TODO: Remove. The georeference should assume the geographic items handle their own error checking — 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 spec/models/georeference_spec.rb:390 — # TODO: Figure out why the save of the georeference does not propagate down to the geographic_item — 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 spec/models/georeference_spec.rb:396 — # TODO: the following expectation will not be met, under some circumstances (different math packages on — 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 spec/models/georeference_spec.rb:399 — # TODO: why did this shape change so much? Project change related? — 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 spec/models/georeference_spec.rb:458 — # TODO: doesn't belong in this mode, reference via CollectingEvent filter — 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.
  • + 1017 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED · ×174
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 149 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED · ×164
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 139 more in this group — see findings.md.
D6 · Cohesion (LCOM4) · Low cohesion · ×108
  • Low cohesion: CollectionObject (LCOM4 63) app/models/collection_object.rb:64 — CollectionObject's methods fall into 63 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 63 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: BiologicalAssociation (LCOM4 58) app/models/biological_association.rb:29 — BiologicalAssociation's methods fall into 58 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 58 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: FieldOccurrence (LCOM4 55) app/models/field_occurrence.rb:19 — FieldOccurrence's methods fall into 55 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 55 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: CollectingEvent (LCOM4 48) REDACTED:183 — CollectingEvent's methods fall into 48 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 48 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: TaxonName (LCOM4 42) REDACTED:159 — TaxonName's methods fall into 42 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 42 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: Filter (LCOM4 35) lib/queries/collection_object/filter.rb:3 — Filter's methods fall into 35 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 35 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: Filter (LCOM4 34) lib/queries/collecting_event/filter.rb:3 — Filter's methods fall into 34 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 34 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: Filter (LCOM4 34) lib/queries/field_occurrence/filter.rb:3 — Filter's methods fall into 34 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 34 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: Filter (LCOM4 34) lib/queries/otu/filter.rb:3 — Filter's methods fall into 34 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 34 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: Filter (LCOM4 31) lib/queries/observation/filter.rb:5 — Filter's methods fall into 31 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 31 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: AnatomicalPart (LCOM4 30) app/models/anatomical_part.rb:45 — AnatomicalPart'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: AssertedDistribution (LCOM4 30) REDACTED:30 — AssertedDistribution'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: Otu (LCOM4 29) app/models/otu.rb:24 — Otu's methods fall into 29 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 29 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: Filter (LCOM4 29) lib/queries/biological_association/filter.rb:4 — Filter's methods fall into 29 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 29 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: Filter (LCOM4 29) lib/queries/taxon_name/filter.rb:3 — Filter's methods fall into 29 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 29 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: Filter (LCOM4 27) lib/queries/descriptor/filter.rb:3 — Filter's methods fall into 27 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 27 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: Georeference (LCOM4 26) REDACTED:67 — Georeference's methods fall into 26 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 26 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: Loan (LCOM4 26) app/models/loan.rb:62 — Loan's methods fall into 26 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 26 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: Filter (LCOM4 24) lib/queries/content/filter.rb:3 — Filter's methods fall into 24 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 24 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: Person (LCOM4 23) app/models/person.rb:51 — Person'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: Filter (LCOM4 23) lib/queries/asserted_distribution/filter.rb:4 — Filter'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: Filter (LCOM4 23) lib/queries/extract/filter.rb:4 — Filter'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: User (LCOM4 22) REDACTED:106 — User'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: Filter (LCOM4 22) lib/queries/biological_associations_graph/filter.rb:4 — Filter'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: Image (LCOM4 21) REDACTED:48 — Image's methods fall into 21 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 21 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.
  • + 83 more in this group — see findings.md.
D31 · IaC & Container Security · Medium IaC · ×53
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 28 more in this group — see findings.md.
D3 · God Classes · TooManyMethods · ×45
  • TooManyMethods: TaxonName REDACTED:159 — TooManyMethods — 146 methods. The bar is 30 methods; this is 116 over it, 4.87× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: GeographicItem app/models/geographic_item.rb:20 — TooManyMethods — 96 methods. The bar is 30 methods; this is 66 over it, 3.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Instance app/models/protonym/soft_validation_extensions.rb:400 — TooManyMethods — 85 methods. The bar is 30 methods; this is 55 over it, 2.83× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Filter lib/queries/biological_association/filter.rb:4 — TooManyMethods — 77 methods. The bar is 30 methods; this is 47 over it, 2.57× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: CollectingEvent REDACTED:183 — TooManyMethods — 76 methods. The bar is 30 methods; this is 46 over it, 2.53× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Filter lib/queries/taxon_name/filter.rb:3 — TooManyMethods — 68 methods. The bar is 30 methods; this is 38 over it, 2.27× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Protonym REDACTED:12 — TooManyMethods — 66 methods. The bar is 30 methods; this is 36 over it, 2.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Filter lib/queries/collection_object/filter.rb:3 — TooManyMethods — 66 methods. The bar is 30 methods; this is 36 over it, 2.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Filter lib/queries/image/filter.rb:3 — TooManyMethods — 65 methods. The bar is 30 methods; this is 35 over it, 2.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: TaxonNameRelationship app/models/taxon_name_relationship.rb:44 — TooManyMethods — 62 methods. The bar is 30 methods; this is 32 over it, 2.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: OtusController REDACTED:1 — TooManyMethods — 61 methods. The bar is 30 methods; this is 31 over it, 2.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: TaxonNamesHelper REDACTED:1 — TooManyMethods — 60 methods. The bar is 30 methods; this is 30 over it, 2.00× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Filter lib/queries/otu/filter.rb:3 — TooManyMethods — 51 methods. The bar is 30 methods; this is 21 over it, 1.70× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: CollectionObjectsController REDACTED:1 — TooManyMethods — 49 methods. The bar is 30 methods; this is 19 over it, 1.63× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Autocomplete REDACTED:19 — TooManyMethods — 47 methods. The bar is 30 methods; this is 17 over it, 1.57× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: TaxonNamesController REDACTED:1 — TooManyMethods — 45 methods. The bar is 30 methods; this is 15 over it, 1.50× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Filter REDACTED:18 — TooManyMethods — 45 methods. The bar is 30 methods; this is 15 over it, 1.50× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Autocomplete lib/queries/taxon_name/autocomplete.rb:4 — TooManyMethods — 44 methods. The bar is 30 methods; this is 14 over it, 1.47× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: CollectionObject app/models/collection_object.rb:64 — TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Combination REDACTED:58 — TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: CollectingEventExtensions app/models/concerns/shared/dwc/collecting_event_extensions.rb:2 — TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Georeference REDACTED:67 — TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Lead app/models/lead.rb:57 — TooManyMethods — 41 methods. The bar is 30 methods; this is 11 over it, 1.37× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Bibtex app/models/source/bibtex.rb:302 — TooManyMethods — 41 methods. The bar is 30 methods; this is 11 over it, 1.37× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: ObservationMatricesController REDACTED:1 — TooManyMethods — 40 methods. The bar is 30 methods; this is 10 over it, 1.33× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • + 20 more in this group — see findings.md.
AC3 · Page structure · Data table has no header cells · ×35
  • Data table has no header cells app/javascript/vue/tasks/otus/match_by_taxon_name/components/ResultTable.vue:351 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/javascript/vue/tasks/people/author_by_letter/components/AlphabetButtons.vue:3 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/javascript/vue/tasks/unify/people/components/CompareTable.vue:43 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/javascript/vue/tasks/unify/people/components/Table/TableAnnotations.vue:4 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/administration/data_overview.html.erb:22 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/alternate_values/list.html.erb:3 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/asserted_distributions/_quick_new_asserted_distribution_form.html.erb:1 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/asserted_distributions/list.html.erb:3 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/asserted_environments/list.html.erb:3 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/attributions/list.html.erb:3 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/biological_associations/list.html.erb:3 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/biological_associations_graphs/list.html.erb:3 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/biological_relationships/list.html.erb:2 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/character_states/list.html.erb:6 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/citations/list.html.erb:3 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/collecting_events/_filter_form_inputs.html.erb:3 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/collecting_events/_filter_form_inputs.html.erb:7 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/collecting_events/_filter_form_inputs.html.erb:36 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/collecting_events/_form.html.erb:131 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/collecting_events/_form.html.erb:159 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/collecting_events/_form.html.erb:191 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/collecting_events/_form.html.erb:207 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/collecting_events/_form.html.erb:227 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/collecting_events/list.html.erb:3 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • Data table has no header cells app/views/collection_objects/list.html.erb:3 — A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
  • + 10 more in this group — see findings.md.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×28
  • Swallowed exception (caught, then discarded) lib/taxonworks_net.rb:15 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:365 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) lib/utilities/files.rb:37 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/observation.rb:274 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/otu.rb:280 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/project.rb:281 — `… rescue false` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/source.rb:302 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/source.rb:422 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/source.rb:441 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:1940 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:276 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/taxon_name_relationship/iczn/invalidating/synonym/objective.rb:75 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/taxon_name_relationship/iczn/invalidating/synonym/objective/unjustified_emendation.rb:71 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/protonym/soft_validation_extensions.rb:616 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/protonym/soft_validation_extensions.rb:648 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/protonym/soft_validation_extensions.rb:757 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/protonym/soft_validation_extensions.rb:787 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/protonym/soft_validation_extensions.rb:817 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/protonym/soft_validation_extensions.rb:847 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/protonym/soft_validation_extensions.rb:877 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/protonym/soft_validation_extensions.rb:907 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/protonym/soft_validation_extensions.rb:939 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/protonym/soft_validation_extensions.rb:969 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/protonym/soft_validation_extensions.rb:1026 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) app/models/protonym/soft_validation_extensions.rb:1057 — `rescue` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • + 3 more in this group — see findings.md.
D3 · God Classes · FileTooLong · ×21
  • FileTooLong: protonym/soft_validation_extensions.rb app/models/protonym/soft_validation_extensions.rb — FileTooLong — 1359 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 859 over it, 2.72× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: darwin_core/occurrence.rb app/models/dataset_record/darwin_core/occurrence.rb — FileTooLong — 1293 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 793 over it, 2.59× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 1176 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 676 over it, 2.35× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: biological_association/filter.rb lib/queries/biological_association/filter.rb — FileTooLong — 814 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 314 over it, 1.63× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 810 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 310 over it, 1.62× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: taxon_name/filter.rb lib/queries/taxon_name/filter.rb — FileTooLong — 750 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 250 over it, 1.50× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 745 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 245 over it, 1.49× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 744 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 244 over it, 1.49× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: models/geographic_item.rb app/models/geographic_item.rb — FileTooLong — 742 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 242 over it, 1.48× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: collection_object/filter.rb lib/queries/collection_object/filter.rb — FileTooLong — 676 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 176 over it, 1.35× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 633 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 133 over it, 1.27× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: image/filter.rb lib/queries/image/filter.rb — FileTooLong — 613 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 113 over it, 1.23× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: occurrence/media_exporter.rb lib/export/dwca/occurrence/media_exporter.rb — FileTooLong — 594 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 94 over it, 1.19× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: otu/filter.rb lib/queries/otu/filter.rb — FileTooLong — 577 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 77 over it, 1.15× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: models/collection_object.rb app/models/collection_object.rb — FileTooLong — 539 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 39 over it, 1.08× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: checklist/occurrence_normalizer.rb lib/export/dwca/checklist/occurrence_normalizer.rb — FileTooLong — 533 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 33 over it, 1.07× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 531 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 31 over it, 1.06× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 531 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 31 over it, 1.06× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: models/taxon_name_relationship.rb app/models/taxon_name_relationship.rb — FileTooLong — 525 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 25 over it, 1.05× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: files/name.rb lib/export/coldp/files/name.rb — FileTooLong — 517 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 17 over it, 1.03× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 515 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 15 over it, 1.03× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×19
  • Duplicated block (7 lines × 2) REDACTED:71 — REDACTED:71-77 | REDACTED:81-87 — 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) REDACTED:135 — REDACTED:135-141 | REDACTED:61-68 — 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) lib/tools/description/from_observation_matrix.rb:167 — lib/tools/description/from_observation_matrix.rb:167-173 | lib/tools/interactive_key.rb:221-227 — 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) REDACTED:798 — REDACTED:798-804 | REDACTED:825-831 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:806` calls `match`, `W` and `REDACTED:834` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (7 lines × 2) REDACTED:44 — REDACTED:44-50 | REDACTED:27-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 (7 lines × 2) REDACTED:27 — REDACTED:27-33 | REDACTED:42-48 — 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) lib/vocabulary.rb:29 — lib/vocabulary.rb:29-35 | lib/vocabulary.rb:40-46 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (7 lines × 2) app/models/protonym/soft_validation_extensions.rb:1372 — app/models/protonym/soft_validation_extensions.rb:1372-1378 | app/models/protonym/soft_validation_extensions.rb:1442-1448 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (7 lines × 2) app/helpers/projects_helper.rb:195 — app/helpers/projects_helper.rb:195-201 | app/helpers/users_helper.rb:17-23 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. 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) REDACTED:882 — REDACTED:882-888 | REDACTED:1810-1816 — 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) app/models/taxon_name_relationship/typification/genus/original.rb:31 — app/models/taxon_name_relationship/typification/genus/original.rb:31-37 | app/models/taxon_name_relationship/typification/genus/tautonomy.rb:31-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 both call sites, so a change lands once.
  • Duplicated block (7 lines × 2) lib/queries/anatomical_part/filter.rb:126 — lib/queries/anatomical_part/filter.rb:126-132 | lib/queries/asserted_environment/filter.rb:97-103 — 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 (7 lines × 2) lib/queries/anatomical_part/filter.rb:136 — lib/queries/anatomical_part/filter.rb:136-142 | lib/queries/asserted_environment/filter.rb:107-113 — 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 (7 lines × 2) REDACTED:115 — REDACTED:115-121 | REDACTED:109-115 — 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) REDACTED:27 — REDACTED:27-33 | REDACTED:14-20 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (7 lines × 2) app/helpers/tasks/collecting_events/parse/stepwise/dates_helper.rb:20 — app/helpers/tasks/collecting_events/parse/stepwise/dates_helper.rb:20-26 | app/helpers/tasks/collecting_events/parse/stepwise/lat_long_helper.rb:21-27 — 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) app/models/observation_matrix_column_item.rb:124 — app/models/observation_matrix_column_item.rb:124-130 | app/models/observation_matrix_row_item.rb:239-246 — 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) lib/queries/image/autocomplete.rb:112 — lib/queries/image/autocomplete.rb:112-118 | lib/queries/sound/autocomplete.rb:59-65 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (7 lines × 2) app/helpers/biological_associations_helper.rb:67 — app/helpers/biological_associations_helper.rb:67-73 | app/helpers/biological_associations_helper.rb:90-96 — both copies are in the same file, so extract the 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 `app/helpers/biological_associations_helper.rb:67` 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.
D29 · Static Analysis (SAST) · REDACTED · ×18
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D35 · Change Coupling · Change coupling · ×17
  • Change coupling: App.vue ↔ Leaflet.vue app/javascript/vue/tasks/gazetteers/new_gazetteer/App.vue:1 — `app/javascript/vue/tasks/gazetteers/new_gazetteer/App.vue` and `app/javascript/vue/tasks/gazetteers/new_gazetteer/components/Leaflet.vue` change together 83% of the time (10 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `d5a370e2` Replace map component, change layout size; `92e8da14` #1954 Cleanup; `dca2bb07` #1954 Fix notifications, other cleanup — run `git show` on any of them.
  • Change coupling: loadCollectionObject.js ↔ getters.js app/javascript/vue/tasks/collection_objects/browse/store/actions/loadCollectionObject.js:1 — `app/javascript/vue/tasks/collection_objects/browse/store/actions/loadCollectionObject.js` and `app/javascript/vue/tasks/collection_objects/browse/store/getters/getters.js` change together 83% of the time (10 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `74361808` Add AP panel to Browse CO #4407; `e858f9df` Add sounds panel to Browse CO #244; `a3471fbf` Add geographic area — run `git show` on any of them.
  • Change coupling: documents_packager_controller.rb ↔ App.vue app/controllers/tasks/sources/documents_packager_controller.rb:1 — `app/controllers/tasks/sources/documents_packager_controller.rb` and `app/javascript/vue/tasks/sources/documents_packager/App.vue` change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `57d5d0e8` Cleanup #4683; `963f5e7e` Unify/generalize doc and image bulk download #4683 #4248; `11bc5251` Cleanup vue code #4683 — run `git show` on any of them.
  • Change coupling: AudioPlayer.vue ↔ PanelSound.vue app/javascript/vue/components/audio/AudioPlayer.vue:1 — `app/javascript/vue/components/audio/AudioPlayer.vue` and `app/javascript/vue/tasks/sounds/browse/components/Panel/PanelSound.vue` change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `25bfa9b2` Set spectrogram to use a linear frequency scale; `77da8b42` Add settings to toggle regions and spectogram; `ad7656ac` add timeline to waveform — run `git show` on any of them.
  • Change coupling: REDACTED ↔ ImportOptions.vue REDACTED:1 — `REDACTED` and `app/javascript/vue/tasks/observation_matrices/import_nexus/components/ImportOptions.vue` change together 69% of the time (9 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `06a8242d` #2029 Bundle citation options; `2bb47fb0` Revert "#2029 Capitalize first word of all options"; `e8bb42e0` #2029 Capitalize first word of all options — run `git show` on any of them.
  • Change coupling: inaturalist_import_helper.rb ↔ ImportForm.vue app/helpers/tasks/field_occurrences/inaturalist_import_helper.rb:1 — `app/helpers/tasks/field_occurrences/inaturalist_import_helper.rb` and `app/javascript/vue/tasks/field_occurrences/inaturalist_import/components/ImportForm.vue` change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `36f701bb` Cleanup #5086; `f7a805fa` Cleanup #5086; `bee82452` Add set-determination-for-all button to iNat import pre-import #5086 — run `git show` on any of them.
  • Change coupling: links.js ↔ tasks.rb app/javascript/vue/components/radials/linker/constants/links.js:1 — `app/javascript/vue/components/radials/linker/constants/links.js` and `config/routes/tasks.rb` change together 61% of the time (25 of the 41 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 25 shared commits counted here, the most recent 3 are `73beb559` Rename route; `d93691ea` Initial Material Examined Implementation; `963f5e7e` Unify/generalize doc and image bulk download #4683 #4248 — run `git show` on any of them.
  • Change coupling: application.js ↔ tasks.rb app/javascript/packs/application.js:1 — `app/javascript/packs/application.js` and `config/routes/tasks.rb` change together 58% of the time (52 of the 90 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 52 shared commits counted here, the most recent 3 are `5b927bae` Add New Asserted Environment task #5107; `11698b02` Add AssertedEnvironment filter #114; `18290e86` Add Assign taxon name to OTU task — run `git show` on any of them.
  • Change coupling: REDACTED ↔ LeadItems.vue REDACTED:1 — `REDACTED` and `app/javascript/vue/tasks/leads/new_lead/shared/LeadItems.vue` change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `ed63cb98` Send character depictions back to key from interactive splitting #4527; `1b78b23f` Auto-sync lead otu with lead_item otu when only one lead_item exists; `1fcbe884` Update key with data from interactive key selections #4527 — run `git show` on any of them.
  • Change coupling: name.rb ↔ taxon.rb lib/export/coldp/files/name.rb:1 — `lib/export/coldp/files/name.rb` and `lib/export/coldp/files/taxon.rb` change together 56% of the time (10 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `5e4d7879` Fix data attribute and nil handling; `72e2bd11` Refactor interactions; edge case fixes; `75be3e92` ColDP columns, gender, and infraspecies rendering fixes — run `git show` on any of them.
  • Change coupling: REDACTED ↔ REDACTED REDACTED:1 — `REDACTED` and `lib/queries/sqed_depiction/filter.rb` change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `a5906b1b` Fix staged image filter failing on identifier queries; `39795d77` Fix #3258; `d22c98cd` Isolate identifier concern specs — run `git show` on any of them.
  • Change coupling: MatchOptionsPanel.vue ↔ ResultTable.vue app/javascript/vue/tasks/otus/match_by_taxon_name/components/MatchOptionsPanel.vue:1 — `app/javascript/vue/tasks/otus/match_by_taxon_name/components/MatchOptionsPanel.vue` and `app/javascript/vue/tasks/otus/match_by_taxon_name/components/ResultTable.vue` change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `57c9cd50` Change the 'Clear matches' button to 'Restart' in Match OTUs; `a19d199c` Add help bubbles to Match OTU task; `e1535e9c` UI tweak — run `git show` on any of them.
  • Change coupling: media_extensions.rb ↔ media_target_extensions.rb app/models/concerns/shared/dwc/media_extensions.rb:1 — `app/models/concerns/shared/dwc/media_extensions.rb` and `app/models/concerns/shared/dwc/media_target_extensions.rb` change together 50% of the time (9 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `cfb29fc4` Move DWC_DELIMITER to a more global Export::Dwca::DELIMITER #4643; `7f36f2eb` Add furtherInformationURL for dwca image extension #2830; `47623169` Add 'Credit' column computation to media extension #2830 — run `git show` on any of them.
  • Change coupling: inaturalist_import_helper.rb ↔ SummaryTable.vue app/helpers/tasks/field_occurrences/inaturalist_import_helper.rb:1 — `app/helpers/tasks/field_occurrences/inaturalist_import_helper.rb` and `app/javascript/vue/tasks/field_occurrences/inaturalist_import/components/SummaryTable.vue` change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `36f701bb` Cleanup #5086; `bee82452` Add set-determination-for-all button to iNat import pre-import #5086; `46299820` Listen for FO TD updates on radials in Import from iNat task #5086 — run `git show` on any of them.
  • Change coupling: formatters.js ↔ PreviousLeads.vue app/javascript/vue/tasks/leads/helpers/formatters.js:1 — `app/javascript/vue/tasks/leads/helpers/formatters.js` and `app/javascript/vue/tasks/leads/new_lead/previous_future/components/PreviousLeads.vue` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `e75e30a8` #1691 Don't use superscript couplet labels in past and future couplet… (at that commit the file was still `app/javascript/vue/tasks/leads/new_lead/components/PreviousCouplets.vue`); `7f27a619` #1691 Add couplet numbers to future text as well (at that commit the file was still `app/javascript/vue/tasks/leads/new_lead/components/PreviousCouplets.vue`); `98807e08` #1691 In new_lead, previous and future links should point to parent (at that commit the file was still `app/javascript/vue/tasks/leads/new_lead/components/PreviousCouplets.vue`) — run `git show` on any of them.
  • Change coupling: app.vue ↔ ContainerItemFill.vue app/javascript/vue/tasks/containers/new_container/app.vue:1 — `app/javascript/vue/tasks/containers/new_container/app.vue` and `app/javascript/vue/tasks/containers/new_container/components/ContainerItem/ContainerItemFill.vue` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `91db73c8` Add slots count; `446b1ac2` Add spinner; `d535b7be` Add tab to list and fixes — run `git show` on any of them.
  • Change coupling: formatters.js ↔ Lead.vue app/javascript/vue/tasks/leads/helpers/formatters.js:1 — `app/javascript/vue/tasks/leads/helpers/formatters.js` and `app/javascript/vue/tasks/leads/new_lead/shared/Lead.vue` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `84e6629f` #1691 Factor out FutureCoupletsList and use it to fix show's future c… (at that commit the file was still `app/javascript/vue/tasks/leads/new_lead/components/Lead.vue`); `08af9f4c` #1691 Remove couplet/tw:id display from header of left and right in n… (at that commit the file was still `app/javascript/vue/tasks/leads/new_lead/components/Lead.vue`); `98807e08` #1691 In new_lead, previous and future links should point to parent (at that commit the file was still `app/javascript/vue/tasks/leads/new_lead/components/Lead.vue`) — run `git show` on any of them.
D4 · Code Duplication · Edited copy of a member (9 corresponding lines) · ×16
  • Edited copy of a member (9 corresponding lines) app/models/collection_object/biological_collection_object.rb:94 — app/models/collection_object/biological_collection_object.rb:94-102 | app/models/field_occurrence/biological_field_occurrence.rb:67-78 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) REDACTED:25 — REDACTED:25-33 | REDACTED:38-47 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) REDACTED:56 — REDACTED:56-65 | REDACTED:91-99 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) app/helpers/workbench/navigation_helper.rb:90 — app/helpers/workbench/navigation_helper.rb:90-98 | app/helpers/workbench/navigation_helper.rb:104-112 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) REDACTED:109 — REDACTED:109-159 | REDACTED:135-143 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) REDACTED:970 — REDACTED:970-978 | app/models/collecting_event/georeference.rb:60-68 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) app/models/taxon_name_relationship/icn.rb:29 — app/models/taxon_name_relationship/icn.rb:29-37 | app/models/taxon_name_relationship/iczn.rb:27-35 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) REDACTED:51 — REDACTED:51-61 | REDACTED:67-75 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) REDACTED:54 — REDACTED:54-62 | REDACTED:117-125 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) REDACTED:91 — REDACTED:91-99 | REDACTED:24-34 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) REDACTED:58 — REDACTED:58-66 | REDACTED:32-40 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) lib/hub/data.rb:45 — lib/hub/data.rb:45-56 | lib/user_tasks.rb:53-61 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) lib/queries/collection_object/filter.rb:814 — lib/queries/collection_object/filter.rb:814-822 | lib/queries/field_occurrence/filter.rb:350-358 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) app/jobs/basic_nomenclature_create_download_job.rb:5 — app/jobs/basic_nomenclature_create_download_job.rb:5-13 | app/jobs/coldp_create_download_job.rb:13-21 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) lib/catalog.rb:166 — lib/catalog.rb:166-174 | lib/catalog/entry.rb:148-156 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) lib/queries/collection_object/autocomplete.rb:87 — lib/queries/collection_object/autocomplete.rb:87-96 | lib/queries/field_occurrence/autocomplete.rb:68-76 — These two members are one piece of code written twice and then edited apart: 9 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 · Edited copy of a member (4 corresponding lines) · ×16
  • Edited copy of a member (4 corresponding lines) app/models/nomenclatural_rank/icn/higher_classification_group.rb:4 — app/models/nomenclatural_rank/icn/higher_classification_group.rb:4-9 | app/models/nomenclatural_rank/iczn/species_group.rb:4-7 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) app/models/taxon_name_relationship/iczn/invalidating/homonym/primary/forgotten.rb:8 — app/models/taxon_name_relationship/iczn/invalidating/homonym/primary/forgotten.rb:8-11 | app/models/taxon_name_relationship/iczn/invalidating/homonym/primary/suppressed.rb:6-9 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) lib/tools/description/from_observation_matrix.rb:186 — lib/tools/description/from_observation_matrix.rb:186-189 | lib/tools/interactive_key.rb:238-241 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) app/models/taxon_name_relationship/iczn/invalidating/synonym/forgotten_name.rb:8 — app/models/taxon_name_relationship/iczn/invalidating/synonym/forgotten_name.rb:8-12 | app/models/taxon_name_relationship/iczn/invalidating/synonym/suppression.rb:6-9 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) app/models/taxon_name_relationship/icn/unaccepting/misapplication.rb:14 — app/models/taxon_name_relationship/icn/unaccepting/misapplication.rb:14-17 | app/models/taxon_name_relationship/icn/unaccepting/synonym/homotypic/basionym.rb:15-18 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) app/models/taxon_name_relationship/iczn/invalidating/usage/family_group_name_form.rb:5 — app/models/taxon_name_relationship/iczn/invalidating/usage/family_group_name_form.rb:5-8 | app/models/taxon_name_relationship/iczn/invalidating/usage/family_group_name_original_form.rb:5-8 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) app/models/taxon_name_relationship/iczn/invalidating/usage/incorrect_original_spelling.rb:6 — app/models/taxon_name_relationship/iczn/invalidating/usage/incorrect_original_spelling.rb:6-9 | app/models/taxon_name_relationship/iczn/invalidating/usage/misspelling.rb:14-18 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) app/models/taxon_name_relationship/iczn/invalidating/homonym.rb:31 — app/models/taxon_name_relationship/iczn/invalidating/homonym.rb:31-35 | app/models/taxon_name_relationship/iczn/invalidating/synonym.rb:13-16 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) app/models/taxon_name_relationship/typification/genus/original.rb:4 — app/models/taxon_name_relationship/typification/genus/original.rb:4-7 | app/models/taxon_name_relationship/typification/genus/subsequent.rb:4-7 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) lib/autoselect/otu/levels/catalogue_of_life.rb:41 — lib/autoselect/otu/levels/catalogue_of_life.rb:41-44 | lib/autoselect/otu/levels/col_valid_name.rb:67-70 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) lib/tools/image_matrix.rb:251 — lib/tools/image_matrix.rb:251-254 | lib/tools/interactive_key.rb:231-234 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) app/models/taxon_name_relationship/iczn/invalidating/misapplication.rb:6 — app/models/taxon_name_relationship/iczn/invalidating/misapplication.rb:6-9 | app/models/taxon_name_relationship/iczn/invalidating/unavailable.rb:6-9 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) app/models/taxon_name_relationship/iczn/invalidating/synonym/suppression/total.rb:14 — app/models/taxon_name_relationship/iczn/invalidating/synonym/suppression/total.rb:14-17 | app/models/taxon_name_relationship/iczn/potentially_validating.rb:12-16 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) lib/export/packagers/documents.rb:43 — lib/export/packagers/documents.rb:43-47 | lib/export/packagers/images.rb:42-45 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) app/controllers/tasks/administrator/year_in_review_controller.rb:6 — app/controllers/tasks/administrator/year_in_review_controller.rb:6-10 | app/controllers/tasks/projects/year_in_review_controller.rb:6-9 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) app/models/taxon_name_relationship/hybrid.rb:18 — app/models/taxon_name_relationship/hybrid.rb:18-21 | app/models/taxon_name_relationship/icn.rb:22-25 — These two members are one piece of code written twice and then edited apart: 4 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.
D29 · Static Analysis (SAST) · REDACTED · ×15
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (10 corresponding lines) · ×15
  • Edited copy of a member (10 corresponding lines) app/models/repository.rb:91 — app/models/repository.rb:91-100 | app/models/serial.rb:177-187 — These two members are one piece of code written twice and then edited apart: 10 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.
  • Edited copy of a member (10 corresponding lines) REDACTED:55 — REDACTED:55-64 | REDACTED:8-18 — These two members are one piece of code written twice and then edited apart: 10 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.
  • Edited copy of a member (10 corresponding lines) lib/queries/otu/filter.rb:307 — lib/queries/otu/filter.rb:307-321 | lib/queries/otu/filter.rb:344-353 — These two members are one piece of code written twice and then edited apart: 10 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.
  • Edited copy of a member (10 corresponding lines) lib/queries/asserted_distribution/filter.rb:450 — lib/queries/asserted_distribution/filter.rb:450-461 | lib/queries/otu/filter.rb:289-298 — These two members are one piece of code written twice and then edited apart: 10 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.
  • Edited copy of a member (10 corresponding lines) lib/queries/concerns/alternate_values.rb:20 — lib/queries/concerns/alternate_values.rb:20-29 | lib/queries/concerns/alternate_values.rb:34-43 — These two members are one piece of code written twice and then edited apart: 10 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.
  • Edited copy of a member (10 corresponding lines) lib/autoselect/asserted_environment/levels/fast.rb:27 — lib/autoselect/asserted_environment/levels/fast.rb:27-37 | lib/autoselect/taxon_name/levels/fast.rb:25-34 — These two members are one piece of code written twice and then edited apart: 10 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.
  • Edited copy of a member (10 corresponding lines) REDACTED:112 — REDACTED:112-140 | REDACTED:25-34 — These two members are one piece of code written twice and then edited apart: 10 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.
  • Edited copy of a member (10 corresponding lines) app/helpers/projects_helper.rb:133 — app/helpers/projects_helper.rb:133-142 | REDACTED:625-637 — These two members are one piece of code written twice and then edited apart: 10 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.
  • Edited copy of a member (10 corresponding lines) lib/queries/collection_object/filter.rb:862 — lib/queries/collection_object/filter.rb:862-871 | lib/queries/field_occurrence/filter.rb:371-380 — These two members are one piece of code written twice and then edited apart: 10 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.
  • Edited copy of a member (10 corresponding lines) REDACTED:293 — REDACTED:293-306 | REDACTED:147-156 — These two members are one piece of code written twice and then edited apart: 10 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.
  • Edited copy of a member (10 corresponding lines) lib/export/dwca/occurrence/predicate_exporter.rb:122 — lib/export/dwca/occurrence/predicate_exporter.rb:122-131 | lib/export/dwca/occurrence/predicate_exporter.rb:138-147 — These two members are one piece of code written twice and then edited apart: 10 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.
  • Edited copy of a member (10 corresponding lines) app/helpers/workbench/navigation_helper.rb:156 — app/helpers/workbench/navigation_helper.rb:156-165 | app/helpers/workbench/navigation_helper.rb:242-251 — These two members are one piece of code written twice and then edited apart: 10 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.
  • Edited copy of a member (10 corresponding lines) REDACTED:147 — REDACTED:147-156 | REDACTED:120-129 — These two members are one piece of code written twice and then edited apart: 10 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.
  • Edited copy of a member (10 corresponding lines) app/jobs/download_project_sql_job.rb:13 — app/jobs/download_project_sql_job.rb:13-22 | app/jobs/download_project_tsv_job.rb:13-22 — These two members are one piece of code written twice and then edited apart: 10 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.
  • Edited copy of a member (10 corresponding lines) lib/queries/gazetteer/filter.rb:50 — lib/queries/gazetteer/filter.rb:50-59 | lib/queries/geographic_area/filter.rb:63-72 — These two members are one piece of code written twice and then edited apart: 10 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 · Edited copy of a member (3 corresponding lines) · ×14
  • Edited copy of a member (3 corresponding lines) app/models/nomenclatural_rank/icn/family_group/family.rb:8 — app/models/nomenclatural_rank/icn/family_group/family.rb:8-10 | app/models/nomenclatural_rank/icnp/family_group/family.rb:8-10 — These two members are one piece of code written twice and then edited apart: 3 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.
  • Edited copy of a member (3 corresponding lines) app/controllers/tasks/images/images_packager_controller.rb:33 — app/controllers/tasks/images/images_packager_controller.rb:33-35 | app/controllers/tasks/sources/documents_packager_controller.rb:32-34 — These two members are one piece of code written twice and then edited apart: 3 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.
  • Edited copy of a member (3 corresponding lines) REDACTED:438 — REDACTED:438-440 | app/models/collection_object.rb:591-593 — These two members are one piece of code written twice and then edited apart: 3 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.
  • Edited copy of a member (3 corresponding lines) app/models/concerns/shared/dwc/taxon_determination_extensions.rb:45 — app/models/concerns/shared/dwc/taxon_determination_extensions.rb:45-47 | app/models/field_occurrence/dwc_extensions.rb:152-154 — These two members are one piece of code written twice and then edited apart: 3 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.
  • Edited copy of a member (3 corresponding lines) REDACTED:641 — REDACTED:641-643 | REDACTED:447-454 — These two members are one piece of code written twice and then edited apart: 3 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.
  • Edited copy of a member (3 corresponding lines) app/models/nomenclatural_rank/icn/family_group/subfamily.rb:8 — app/models/nomenclatural_rank/icn/family_group/subfamily.rb:8-10 | app/models/nomenclatural_rank/icnp/family_group/subfamily.rb:8-10 — These two members are one piece of code written twice and then edited apart: 3 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.
  • Edited copy of a member (3 corresponding lines) app/models/nomenclatural_rank/iczn/family_group/subfamily.rb:8 — app/models/nomenclatural_rank/iczn/family_group/subfamily.rb:8-10 | app/models/nomenclatural_rank/iczn/family_group/supersubfamily.rb:8-10 — These two members are one piece of code written twice and then edited apart: 3 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.
  • Edited copy of a member (3 corresponding lines) config/initializers/constants/model/taxon_name_classifications.rb:164 — config/initializers/constants/model/taxon_name_classifications.rb:164-166 | config/initializers/constants/model/taxon_name_relationships.rb:24-28 — These two members are one piece of code written twice and then edited apart: 3 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.
  • Edited copy of a member (3 corresponding lines) app/models/nomenclatural_rank/icn/higher_classification_group/kingdom.rb:8 — app/models/nomenclatural_rank/icn/higher_classification_group/kingdom.rb:8-10 | app/models/nomenclatural_rank/iczn/higher_classification_group/kingdom.rb:8-10 — These two members are one piece of code written twice and then edited apart: 3 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.
  • Edited copy of a member (3 corresponding lines) app/models/taxon_name_classification/iczn/available/valid/nomen_dubium.rb:6 — app/models/taxon_name_classification/iczn/available/valid/nomen_dubium.rb:6-8 | app/models/taxon_name_classification/iczn/available/valid/nomen_inquirendum.rb:6-8 — These two members are one piece of code written twice and then edited apart: 3 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.
  • Edited copy of a member (3 corresponding lines) app/models/taxon_name_classification/icn/effectively_published/validly_published/illegitimate.rb:6 — app/models/taxon_name_classification/icn/effectively_published/validly_published/illegitimate.rb:6-8 | app/models/taxon_name_classification/icn/effectively_published/validly_published/legitimate.rb:6-8 — These two members are one piece of code written twice and then edited apart: 3 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.
  • Edited copy of a member (3 corresponding lines) app/models/taxon_name_classification/icnp/effectively_published/validly_published/illegitimate.rb:6 — app/models/taxon_name_classification/icnp/effectively_published/validly_published/illegitimate.rb:6-8 | app/models/taxon_name_classification/icnp/effectively_published/validly_published/legitimate.rb:6-8 — These two members are one piece of code written twice and then edited apart: 3 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.
  • Edited copy of a member (3 corresponding lines) app/models/taxon_name_classification/latinized/gender.rb:12 — app/models/taxon_name_classification/latinized/gender.rb:12-14 | app/models/taxon_name_classification/latinized/part_of_speech.rb:25-27 — These two members are one piece of code written twice and then edited apart: 3 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.
  • Edited copy of a member (3 corresponding lines) lib/project_unification/migrator.rb:241 — lib/project_unification/migrator.rb:241-243 | lib/project_unification/special_handlers.rb:504-506 — These two members are one piece of code written twice and then edited apart: 3 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 (5 lines × 2) · ×14
  • Duplicated block (5 lines × 2) app/models/collection_object/biological_collection_object.rb:98 — app/models/collection_object/biological_collection_object.rb:98-102 | app/models/field_occurrence/biological_field_occurrence.rb:73-78 — `app/models/collection_object/biological_collection_object.rb` and `app/models/field_occurrence/biological_field_occurrence.rb` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 2 separate duplicated blocks between them, totalling at least 23 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (5 lines × 2) REDACTED:510 — REDACTED:510-517 | app/models/protonym/format.rb:189-193 — 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 `REDACTED:510` 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) REDACTED:209 — REDACTED:209-213 | app/models/taxon_name_classification/latinized/gender.rb:41-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 (5 lines × 2) lib/tools/image_matrix.rb:429 — lib/tools/image_matrix.rb:429-433 | lib/tools/interactive_key.rb:340-344 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (5 lines × 2) REDACTED:38 — REDACTED:38-42 | app/controllers/tasks/containers/collection_visualization_controller.rb:9-13 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (5 lines × 2) app/models/taxon_name_relationship/icn/unaccepting/homonym.rb:6 — app/models/taxon_name_relationship/icn/unaccepting/homonym.rb:6-10 | app/models/taxon_name_relationship/icn/unaccepting/synonym.rb:15-19 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (5 lines × 2) app/models/taxon_name_relationship/icn/unaccepting/synonym/heterotypic.rb:30 — app/models/taxon_name_relationship/icn/unaccepting/synonym/heterotypic.rb:30-34 | app/models/taxon_name_relationship/iczn/invalidating/synonym/subjective.rb:30-34 — 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) REDACTED:407 — REDACTED:407-411 | REDACTED:89-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.
  • Duplicated block (5 lines × 2) REDACTED:17 — REDACTED:17-21 | REDACTED:157-161 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (5 lines × 2) app/controllers/tasks/collection_objects/dwc_media_extension_preview_controller.rb:5 — app/controllers/tasks/collection_objects/dwc_media_extension_preview_controller.rb:5-9 | app/controllers/tasks/field_occurrences/dwc_media_extension_preview_controller.rb:5-9 — 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) app/helpers/confidences_helper.rb:51 — app/helpers/confidences_helper.rb:51-55 | app/helpers/tags_helper.rb:81-85 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (5 lines × 2) REDACTED:391 — REDACTED:391-395 | app/models/protonym/format.rb:256-260 — 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) lib/queries/collection_object/filter.rb:484 — lib/queries/collection_object/filter.rb:484-488 | lib/queries/field_occurrence/filter.rb:245-249 — `lib/queries/collection_object/filter.rb` and `lib/queries/field_occurrence/filter.rb` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 5 separate duplicated blocks between them, totalling at least 49 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (5 lines × 2) lib/queries/source/filter.rb:554 — lib/queries/source/filter.rb:554-558 | lib/queries/source/filter.rb:580-584 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Edited copy of a member (8 corresponding lines) · ×12
  • Edited copy of a member (8 corresponding lines) REDACTED:356 — REDACTED:356-363 | REDACTED:367-374 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) lib/tools/image_matrix.rb:429 — lib/tools/image_matrix.rb:429-436 | lib/tools/interactive_key.rb:340-347 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) REDACTED:184 — REDACTED:184-192 | REDACTED:198-205 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) lib/queries/collection_object/autocomplete.rb:28 — lib/queries/collection_object/autocomplete.rb:28-35 | lib/queries/field_occurrence/autocomplete.rb:23-30 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) app/helpers/tasks/collecting_events/parse/stepwise/dates_helper.rb:116 — app/helpers/tasks/collecting_events/parse/stepwise/dates_helper.rb:116-123 | app/helpers/tasks/collecting_events/parse/stepwise/lat_long_helper.rb:122-132 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) app/models/taxon_name_relationship.rb:585 — app/models/taxon_name_relationship.rb:585-592 | app/models/taxon_name_relationship.rb:596-603 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) lib/queries/dwc_occurrence/filter.rb:241 — lib/queries/dwc_occurrence/filter.rb:241-248 | lib/queries/dwc_occurrence/filter.rb:252-260 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) app/helpers/composition_items_helper.rb:4 — app/helpers/composition_items_helper.rb:4-14 | app/helpers/composition_items_helper.rb:18-25 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) app/helpers/tasks/collecting_events/parse/stepwise/dates_helper.rb:127 — app/helpers/tasks/collecting_events/parse/stepwise/dates_helper.rb:127-134 | app/helpers/tasks/collecting_events/parse/stepwise/lat_long_helper.rb:136-143 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) REDACTED:282 — REDACTED:282-289 | REDACTED:136-143 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) REDACTED:93 — REDACTED:93-100 | REDACTED:157-164 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) REDACTED:9 — REDACTED:9-17 | REDACTED:9-16 — These two members are one piece of code written twice and then edited apart: 8 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 (6 lines × 2) · ×12
  • Duplicated block (6 lines × 2) REDACTED:52 — REDACTED:52-57 | REDACTED:57-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) REDACTED:50 — REDACTED:50-55 | REDACTED:53-59 — 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) app/helpers/observation_matrices/export/nexml_helper.rb:220 — app/helpers/observation_matrices/export/nexml_helper.rb:220-225 | app/helpers/observation_matrices/export/otu_contents_helper.rb:190-195 — 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) REDACTED:628 — REDACTED:628-633 | REDACTED:501-506 — 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) app/models/protonym/soft_validation_extensions.rb:1444 — app/models/protonym/soft_validation_extensions.rb:1444-1449 | app/models/protonym/soft_validation_extensions.rb:1452-1457 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) lib/autoselect/otu/autoselect.rb:42 — lib/autoselect/otu/autoselect.rb:42-47 | lib/autoselect/taxon_name/autoselect.rb:32-37 — 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) lib/batch_load/import/collection_objects.rb:87 — lib/batch_load/import/collection_objects.rb:87-93 | lib/batch_load/import/collection_objects.rb:251-256 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) REDACTED:19 — REDACTED:19-24 | REDACTED:19-24 — before extracting anything, compare `REDACTED` and `REDACTED` as WHOLE FILES: 84% 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 2 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.
  • Duplicated block (6 lines × 2) lib/queries/anatomical_part/filter.rb:117 — lib/queries/anatomical_part/filter.rb:117-122 | lib/queries/sound/filter.rb:141-146 — 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 (6 lines × 2) app/models/image/dwc_media_extensions.rb:21 — app/models/image/dwc_media_extensions.rb:21-26 | app/models/sound/dwc_media_extensions.rb:19-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 (6 lines × 2) lib/queries/collection_object/autocomplete.rb:39 — lib/queries/collection_object/autocomplete.rb:39-44 | lib/queries/field_occurrence/autocomplete.rb:34-39 — `lib/queries/collection_object/autocomplete.rb` and `lib/queries/field_occurrence/autocomplete.rb` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 1 separate duplicated blocks between them, totalling at least 6 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (6 lines × 2) app/models/confidence_level.rb:14 — app/models/confidence_level.rb:14-19 | app/models/keyword.rb:33-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 both call sites, so a change lands once.
X3 · Exception handling · Swallowed exception (empty catch) · ×12
  • Swallowed exception (empty catch) lib/batch_load/import/otus/identifiers_interpreter.rb:42 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) lib/batch_load/import/collecting_events/gpx_interpreter.rb:57 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) REDACTED:728 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) REDACTED:1911 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) app/models/taxon_name_relationship.rb:655 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) app/models/taxon_name_relationship.rb:704 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) app/models/taxon_name_relationship.rb:720 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) app/models/taxon_name_relationship.rb:743 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) app/models/taxon_name_relationship/iczn/invalidating/homonym.rb:149 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) app/models/taxon_name_relationship/icnp/unaccepting/synonym.rb:79 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) app/models/taxon_name_relationship/icn/unaccepting/synonym.rb:81 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) app/models/protonym/soft_validation_extensions.rb:1725 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
AC4 · Keyboard semantics · Anchor without href · ×11
  • Anchor without href app/assets/javascripts/views/citations/_topic_picker.js:63 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href app/assets/javascripts/views/confidences/form.js:66 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href app/assets/javascripts/views/otus/_otu_picker.js:63 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href REDACTED:86 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href app/assets/javascripts/workbench/keyboard.js:109 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href app/assets/javascripts/workbench/pinboard.js:76 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href app/javascript/vue/components/Form/FormCollectingEvent/components/parsed/GeographicArea.vue:29 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href app/javascript/vue/components/pagination.vue:10 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href app/javascript/vue/components/pagination.vue:24 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href app/javascript/vue/components/pagination.vue:77 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href app/javascript/vue/components/pagination.vue:87 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
D4 · Code Duplication · Edited copy of a member (12 corresponding lines) · ×11
  • Edited copy of a member (12 corresponding lines) lib/export/packagers/documents.rb:51 — lib/export/packagers/documents.rb:51-62 | lib/export/packagers/images.rb:49-60 — These two members are one piece of code written twice and then edited apart: 12 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.
  • Edited copy of a member (12 corresponding lines) lib/queries/source/autocomplete.rb:147 — lib/queries/source/autocomplete.rb:147-158 | lib/queries/source/autocomplete.rb:173-184 — These two members are one piece of code written twice and then edited apart: 12 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.
  • Edited copy of a member (12 corresponding lines) app/controllers/annotations_controller.rb:18 — app/controllers/annotations_controller.rb:18-33 | app/controllers/annotations_controller.rb:37-48 — These two members are one piece of code written twice and then edited apart: 12 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.
  • Edited copy of a member (12 corresponding lines) REDACTED:39 — REDACTED:39-50 | app/controllers/georeferences/geo_locates_controller.rb:7-35 — These two members are one piece of code written twice and then edited apart: 12 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.
  • Edited copy of a member (12 corresponding lines) REDACTED:10 — REDACTED:10-21 | REDACTED:9-20 — These two members are one piece of code written twice and then edited apart: 12 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.
  • Edited copy of a member (12 corresponding lines) REDACTED:102 — REDACTED:102-115 | REDACTED:119-130 — These two members are one piece of code written twice and then edited apart: 12 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.
  • Edited copy of a member (12 corresponding lines) REDACTED:227 — REDACTED:227-238 | REDACTED:325-336 — These two members are one piece of code written twice and then edited apart: 12 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.
  • Edited copy of a member (12 corresponding lines) REDACTED:116 — REDACTED:116-127 | REDACTED:142-153 — These two members are one piece of code written twice and then edited apart: 12 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.
  • Edited copy of a member (12 corresponding lines) lib/queries/otu/filter.rb:599 — lib/queries/otu/filter.rb:599-610 | lib/queries/otu/filter.rb:680-691 — These two members are one piece of code written twice and then edited apart: 12 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.
  • Edited copy of a member (12 corresponding lines) app/models/biological_association.rb:202 — app/models/biological_association.rb:202-213 | app/models/source/bibtex.rb:398-409 — These two members are one piece of code written twice and then edited apart: 12 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.
  • Edited copy of a member (12 corresponding lines) lib/queries/asserted_distribution/filter.rb:372 — lib/queries/asserted_distribution/filter.rb:372-383 | lib/queries/collecting_event/filter.rb:273-284 — These two members are one piece of code written twice and then edited apart: 12 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 (9 lines × 2) · ×11
  • Duplicated block (9 lines × 2) REDACTED:28 — REDACTED:28-36 | REDACTED:47-55 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (9 lines × 2) app/models/attribution.rb:151 — app/models/attribution.rb:151-159 | app/models/attribution.rb:189-197 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) app/models/protonym/soft_validation_extensions.rb:1374 — app/models/protonym/soft_validation_extensions.rb:1374-1382 | app/models/protonym/soft_validation_extensions.rb:1460-1468 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) REDACTED:245 — REDACTED:245-253 | REDACTED:308-316 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (9 lines × 2) lib/queries/taxon_name/tabular.rb:278 — lib/queries/taxon_name/tabular.rb:278-286 | lib/queries/taxon_name/tabular.rb:302-310 — both copies are in the same file, so extract the 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 `lib/queries/taxon_name/tabular.rb:278` 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) REDACTED:248 — REDACTED:248-256 | REDACTED:263-271 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) REDACTED:250 — REDACTED:250-258 | REDACTED:281-289 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:250` 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) app/models/collection_object.rb:678 — app/models/collection_object.rb:678-686 | app/models/extract.rb:94-102 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (9 lines × 2) lib/queries/container/autocomplete.rb:29 — lib/queries/container/autocomplete.rb:29-37 | lib/queries/extract/autocomplete.rb:102-111 — 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) lib/queries/collection_object/filter.rb:876 — lib/queries/collection_object/filter.rb:876-884 | lib/queries/field_occurrence/filter.rb:385-393 — `lib/queries/collection_object/filter.rb` and `lib/queries/field_occurrence/filter.rb` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 5 separate duplicated blocks between them, totalling at least 49 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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) lib/queries/concerns/conveyances.rb:71 — lib/queries/concerns/conveyances.rb:71-79 | lib/queries/concerns/depictions.rb:88-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. 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.
AC6 · Visual & motion safety · Animation without a prefers-reduced-motion guard · ×9
  • Animation without a prefers-reduced-motion guard app/javascript/vue/tasks/sources/verbatim_author_year_source/components/AuthorYearTable.vue:250 — `.progress-fill` moves (`transition: width 0.2s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard app/javascript/vue/tasks/sources/new_source/components/Autosave.vue:73 — `.meter-animation-enter-active` moves (`animation: progressBar 3s linear`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard app/javascript/vue/tasks/otus/match_by_taxon_name/components/SummaryBar.vue:121 — `.progress-matched` moves (`transition: width 0.3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard app/javascript/vue/tasks/otus/match_by_taxon_name/components/SummaryBar.vue:126 — `.progress-unmatched` moves (`transition: width 0.3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard app/javascript/vue/tasks/otus/assign_taxon_name/components/StatusBar.vue:143 — `.progress-matched` moves (`transition: width 0.3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard app/javascript/vue/tasks/otus/assign_taxon_name/components/StatusBar.vue:148 — `.progress-unmatched` moves (`transition: width 0.3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard app/javascript/vue/tasks/observation_matrices/matrix_row_coder/MatrixRowCoder/SaveCountdown/SaveCountdown.scss:19 — `.save-countdown__duration-bar-animation-enter-active` moves (`animation: countdown 3333ms linear`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard app/javascript/vue/tasks/nomenclature/new_taxon_name/components/autosave.vue:99 — `.meter-animation-enter-active` moves (`animation: progressBar 3s linear`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard app/javascript/vue/tasks/news/NotificationBell/components/NotificationPulse.vue:25 — `.pulse-dot::after` moves (`animation: pulse 1.5s infinite ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×9
  • Edited copy of a member (11 corresponding lines) app/helpers/collecting_events_helper.rb:184 — app/helpers/collecting_events_helper.rb:184-194 | app/helpers/collecting_events_helper.rb:200-210 — These two members are one piece of code written twice and then edited apart: 11 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.
  • Edited copy of a member (11 corresponding lines) app/helpers/labels_helper.rb:53 — app/helpers/labels_helper.rb:53-63 | app/helpers/labels_helper.rb:68-80 — These two members are one piece of code written twice and then edited apart: 11 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.
  • Edited copy of a member (11 corresponding lines) REDACTED:56 — REDACTED:56-66 | REDACTED:57-70 — These two members are one piece of code written twice and then edited apart: 11 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.
  • Edited copy of a member (11 corresponding lines) REDACTED:63 — REDACTED:63-74 | REDACTED:64-74 — These two members are one piece of code written twice and then edited apart: 11 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.
  • Edited copy of a member (11 corresponding lines) REDACTED:38 — REDACTED:38-49 | REDACTED:42-52 — These two members are one piece of code written twice and then edited apart: 11 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.
  • Edited copy of a member (11 corresponding lines) lib/autoselect/base.rb:187 — lib/autoselect/base.rb:187-197 | lib/autoselect/taxon_name/autoselect.rb:30-40 — These two members are one piece of code written twice and then edited apart: 11 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.
  • Edited copy of a member (11 corresponding lines) REDACTED:710 — REDACTED:710-720 | REDACTED:729-746 — These two members are one piece of code written twice and then edited apart: 11 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.
  • Edited copy of a member (11 corresponding lines) REDACTED:252 — REDACTED:252-262 | REDACTED:268-278 — These two members are one piece of code written twice and then edited apart: 11 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.
  • Edited copy of a member (11 corresponding lines) app/controllers/tasks/biological_associations/filter_controller.rb:5 — app/controllers/tasks/biological_associations/filter_controller.rb:5-19 | app/controllers/tasks/contents/filter_controller.rb:5-15 — These two members are one piece of code written twice and then edited apart: 11 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 (10 lines × 2) · ×9
  • Duplicated block (10 lines × 2) REDACTED:179 — REDACTED:179-188 | REDACTED:197-206 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:179` 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) REDACTED:40 — REDACTED:40-49 | REDACTED:43-52 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (10 lines × 2) app/helpers/labels_helper.rb:53 — app/helpers/labels_helper.rb:53-62 | app/helpers/labels_helper.rb:68-77 — both copies are in the same file, so extract the 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 `app/helpers/labels_helper.rb:53` 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) app/models/collection_object/dwc_extensions.rb:275 — app/models/collection_object/dwc_extensions.rb:275-284 | app/models/concerns/shared/dwc/collecting_event_extensions.rb:245-254 — 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) app/models/source/bibtex.rb:634 — app/models/source/bibtex.rb:634-643 | app/models/source/bibtex.rb:655-664 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2) lib/queries/source/autocomplete.rb:147 — lib/queries/source/autocomplete.rb:147-156 | lib/queries/source/autocomplete.rb:173-182 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (10 lines × 2) app/helpers/taxon_names/catalog_helper.rb:101 — app/helpers/taxon_names/catalog_helper.rb:101-110 | app/helpers/taxon_names/paper_catalog_helper.rb:235-244 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (10 lines × 2) lib/catalog/nomenclature/entry_item.rb:37 — lib/catalog/nomenclature/entry_item.rb:37-46 | lib/nomenclature_catalog/entry_item.rb:76-85 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `lib/catalog/nomenclature/entry_item.rb: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 (10 lines × 2) REDACTED:8 — REDACTED:8-17 | REDACTED:9-18 — 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.
D29 · Static Analysis (SAST) · REDACTED · ×8
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×8
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (15 corresponding lines) · ×8
  • Edited copy of a member (15 corresponding lines) app/helpers/tasks/collecting_events/parse/stepwise/dates_helper.rb:31 — app/helpers/tasks/collecting_events/parse/stepwise/dates_helper.rb:31-49 | app/helpers/tasks/collecting_events/parse/stepwise/lat_long_helper.rb:31-45 — These two members are one piece of code written twice and then edited apart: 15 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.
  • Edited copy of a member (15 corresponding lines) app/models/confidence_level.rb:10 — app/models/confidence_level.rb:10-26 | app/models/serial.rb:159-173 — These two members are one piece of code written twice and then edited apart: 15 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.
  • Edited copy of a member (15 corresponding lines) db/migrate/20160224151209_create_common_names.rb:3 — db/migrate/20160224151209_create_common_names.rb:3-19 | db/migrate/20161221193429_create_character_states.rb:3-17 — These two members are one piece of code written twice and then edited apart: 15 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.
  • Edited copy of a member (15 corresponding lines) REDACTED:179 — REDACTED:179-193 | REDACTED:197-211 — These two members are one piece of code written twice and then edited apart: 15 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.
  • Edited copy of a member (15 corresponding lines) lib/export/csv/biological_associations/extended.rb:27 — lib/export/csv/biological_associations/extended.rb:27-41 | lib/export/csv/biological_associations/simple.rb:19-33 — These two members are one piece of code written twice and then edited apart: 15 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.
  • Edited copy of a member (15 corresponding lines) db/migrate/20200325105300_create_import_datasets.rb:3 — db/migrate/20200325105300_create_import_datasets.rb:3-17 | db/migrate/20200403142131_create_dataset_records.rb:3-18 — These two members are one piece of code written twice and then edited apart: 15 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.
  • Edited copy of a member (15 corresponding lines) REDACTED:457 — REDACTED:457-471 | REDACTED:487-503 — These two members are one piece of code written twice and then edited apart: 15 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.
  • Edited copy of a member (15 corresponding lines) REDACTED:170 — REDACTED:170-185 | REDACTED:118-132 — These two members are one piece of code written twice and then edited apart: 15 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.
P7 · Outbound HTTP resilience · Outbound HTTP without resilience · ×8
  • Outbound HTTP without resilience app/models/concerns/shared/purl_deprecation.rb:73 — `Net::HTTP.start` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience app/models/concerns/shared/purl_deprecation.rb:89 — `Net::HTTP.start` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience REDACTED:366 — `Net::HTTP.get` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience lib/export/coldp/files/species_interaction.rb:40 — `Net::HTTP.get_response` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience lib/nexml.rb:127 — `Net::HTTP.get_response` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience lib/taxonworks_net.rb:13 — `Net::HTTP.get` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience lib/utilities/net.rb:16 — `Net::HTTP.start` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience lib/utilities/net.rb:36 — `Net::HTTP.start` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×7
  • Duplicated block (8 lines × 2) lib/batch_load/import/collection_objects.rb:64 — lib/batch_load/import/collection_objects.rb:64-71 | lib/batch_load/import/otus.rb:37-44 — 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) lib/batch_load/import/descriptors/modify_gene_descriptor_interpreter.rb:34 — lib/batch_load/import/descriptors/modify_gene_descriptor_interpreter.rb:34-41 | lib/batch_load/import/sequence_relationships/primers_interpreter.rb:45-52 — 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) lib/tools/interactive_key.rb:374 — lib/tools/interactive_key.rb:374-381 | lib/tools/interactive_key.rb:383-390 — both copies are in the same file, so extract the 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) app/helpers/biological_associations_helper.rb:79 — app/helpers/biological_associations_helper.rb:79-86 | app/helpers/biological_associations_helper.rb:109-116 — both copies are in the same file, so extract the 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 `app/helpers/biological_associations_helper.rb:79` 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 × 2) lib/export/packagers/documents.rb:171 — lib/export/packagers/documents.rb:171-178 | lib/export/packagers/images.rb:128-135 — 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) REDACTED:37 — REDACTED:37-44 | REDACTED:38-45 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (8 lines × 2) lib/queries/image/autocomplete.rb:101 — lib/queries/image/autocomplete.rb:101-108 | lib/queries/sound/autocomplete.rb:48-55 — 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.
D29 · Static Analysis (SAST) · REDACTED · ×6
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (20 corresponding lines) · ×6
  • Edited copy of a member (20 corresponding lines) app/helpers/biological_associations_helper.rb:67 — app/helpers/biological_associations_helper.rb:67-86 | app/helpers/biological_associations_helper.rb:90-116 — These two members are one piece of code written twice and then edited apart: 20 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.
  • Edited copy of a member (20 corresponding lines) lib/catalog/nomenclature/entry.rb:201 — lib/catalog/nomenclature/entry.rb:201-220 | lib/catalog/nomenclature/entry.rb:225-245 — These two members are one piece of code written twice and then edited apart: 20 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.
  • Edited copy of a member (20 corresponding lines) app/models/taxon_name_relationship/icn/unaccepting/synonym.rb:66 — app/models/taxon_name_relationship/icn/unaccepting/synonym.rb:66-85 | app/models/taxon_name_relationship/icnp/unaccepting/synonym.rb:64-83 — These two members are one piece of code written twice and then edited apart: 20 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.
  • Edited copy of a member (20 corresponding lines) app/helpers/leads_helper.rb:66 — app/helpers/leads_helper.rb:66-89 | app/helpers/leads_helper.rb:93-112 — These two members are one piece of code written twice and then edited apart: 20 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.
  • Edited copy of a member (20 corresponding lines) lib/gis/geo_json.rb:7 — lib/gis/geo_json.rb:7-26 | lib/gis/geo_json.rb:32-51 — These two members are one piece of code written twice and then edited apart: 20 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.
  • Edited copy of a member (20 corresponding lines) app/models/observation_matrix_column_item.rb:197 — app/models/observation_matrix_column_item.rb:197-216 | app/models/observation_matrix_column_item.rb:221-240 — These two members are one piece of code written twice and then edited apart: 20 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 · Edited copy of a member (13 corresponding lines) · ×6
  • Edited copy of a member (13 corresponding lines) lib/tools/interactive_key.rb:446 — lib/tools/interactive_key.rb:446-458 | lib/tools/interactive_key.rb:462-475 — These two members are one piece of code written twice and then edited apart: 13 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.
  • Edited copy of a member (13 corresponding lines) app/models/collection_object.rb:407 — app/models/collection_object.rb:407-419 | app/models/collection_object.rb:467-479 — These two members are one piece of code written twice and then edited apart: 13 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.
  • Edited copy of a member (13 corresponding lines) REDACTED:619 — REDACTED:619-633 | REDACTED:494-506 — These two members are one piece of code written twice and then edited apart: 13 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.
  • Edited copy of a member (13 corresponding lines) app/controllers/confidence_levels_controller.rb:20 — app/controllers/confidence_levels_controller.rb:20-32 | app/controllers/predicates_controller.rb:5-17 — These two members are one piece of code written twice and then edited apart: 13 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.
  • Edited copy of a member (13 corresponding lines) REDACTED:10 — REDACTED:10-26 | REDACTED:18-30 — These two members are one piece of code written twice and then edited apart: 13 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.
  • Edited copy of a member (13 corresponding lines) lib/queries/depiction/filter.rb:161 — lib/queries/depiction/filter.rb:161-175 | lib/queries/image/filter.rb:751-763 — These two members are one piece of code written twice and then edited apart: 13 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 · Edited copy of a member (21 corresponding lines) · ×6
  • Edited copy of a member (21 corresponding lines) lib/queries/taxon_name/tabular.rb:266 — lib/queries/taxon_name/tabular.rb:266-286 | lib/queries/taxon_name/tabular.rb:290-310 — These two members are one piece of code written twice and then edited apart: 21 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.
  • Edited copy of a member (21 corresponding lines) lib/project_unification/special_handlers.rb:119 — lib/project_unification/special_handlers.rb:119-139 | lib/project_unification/special_handlers.rb:166-186 — These two members are one piece of code written twice and then edited apart: 21 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.
  • Edited copy of a member (21 corresponding lines) app/helpers/observation_matrices/export/otu_contents_helper.rb:233 — app/helpers/observation_matrices/export/otu_contents_helper.rb:233-253 | app/helpers/taxon_names/paper_catalog_helper.rb:113-134 — These two members are one piece of code written twice and then edited apart: 21 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.
  • Edited copy of a member (21 corresponding lines) lib/queries/asserted_distribution/filter.rb:345 — lib/queries/asserted_distribution/filter.rb:345-368 | lib/queries/otu/filter.rb:520-540 — These two members are one piece of code written twice and then edited apart: 21 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.
  • Edited copy of a member (21 corresponding lines) lib/queries/conveyance/autocomplete.rb:19 — lib/queries/conveyance/autocomplete.rb:19-39 | lib/queries/depiction/autocomplete.rb:19-39 — These two members are one piece of code written twice and then edited apart: 21 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.
  • Edited copy of a member (21 corresponding lines) app/models/project.rb:169 — app/models/project.rb:169-189 | app/models/project.rb:196-217 — These two members are one piece of code written twice and then edited apart: 21 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 · Edited copy of a member (14 corresponding lines) · ×6
  • Edited copy of a member (14 corresponding lines) db/migrate/20160804141206_create_matrix_rows.rb:3 — db/migrate/20160804141206_create_matrix_rows.rb:3-16 | db/migrate/20160804214121_create_matrix_row_items.rb:3-17 — These two members are one piece of code written twice and then edited apart: 14 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.
  • Edited copy of a member (14 corresponding lines) app/models/protonym/soft_validation_extensions.rb:1369 — app/models/protonym/soft_validation_extensions.rb:1369-1382 | app/models/protonym/soft_validation_extensions.rb:1410-1423 — These two members are one piece of code written twice and then edited apart: 14 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.
  • Edited copy of a member (14 corresponding lines) lib/queries/concerns/date_ranges.rb:228 — lib/queries/concerns/date_ranges.rb:228-241 | lib/queries/concerns/date_ranges.rb:245-258 — These two members are one piece of code written twice and then edited apart: 14 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.
  • Edited copy of a member (14 corresponding lines) app/jobs/inaturalist_import_job.rb:126 — app/jobs/inaturalist_import_job.rb:126-139 | app/jobs/inaturalist_import_job.rb:143-156 — These two members are one piece of code written twice and then edited apart: 14 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.
  • Edited copy of a member (14 corresponding lines) REDACTED:57 — REDACTED:57-73 | REDACTED:79-92 — These two members are one piece of code written twice and then edited apart: 14 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.
  • Edited copy of a member (14 corresponding lines) app/helpers/loans_helper.rb:244 — app/helpers/loans_helper.rb:244-257 | app/helpers/loans_helper.rb:285-298 — These two members are one piece of code written twice and then edited apart: 14 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.
R11 · Import Boundaries · Boundary violation [package · ×6
  • Boundary violation [package:third-party-deep-import] app/javascript/vue/components/audio/AudioPlayer.vue:8 — app/javascript/vue/components/audio/AudioPlayer.vue:8 imports wavesurfer.js/dist/plugins/spectrogram.esm.js, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead.
  • Boundary violation [package:third-party-deep-import] app/javascript/vue/components/audio/AudioPlayer.vue:9 — app/javascript/vue/components/audio/AudioPlayer.vue:9 imports wavesurfer.js/dist/plugins/timeline.esm.js, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead.
  • Boundary violation [package:third-party-deep-import] app/javascript/vue/components/audio/AudioPlayer.vue:10 — app/javascript/vue/components/audio/AudioPlayer.vue:10 imports wavesurfer.js/dist/plugins/regions.esm.js, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead.
  • Boundary violation [package:third-party-deep-import] app/javascript/vue/components/markdown-editor.vue:15 — app/javascript/vue/components/markdown-editor.vue:15 imports easymde/dist/easymde.min.js, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead.
  • Boundary violation [package:third-party-deep-import] app/javascript/vue/components/ui/VMap/VMap.vue:22 — app/javascript/vue/components/ui/VMap/VMap.vue:22 imports leaflet.markercluster/dist/leaflet.markercluster, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead.
  • Boundary violation [package:third-party-deep-import] app/javascript/vue/tasks/otus/browse/components/Panel/PanelBiologicalAssociations/PanelBiologicalAssociationsNetwork.vue:44 — app/javascript/vue/tasks/otus/browse/components/Panel/PanelBiologicalAssociations/PanelBiologicalAssociationsNetwork.vue:44 imports v-network-graph/lib/force-layout, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead.
X25 · Inert configuration knob · Option is kept and never read · ×6
  • Option is kept and never read app/javascript/vue/tasks/observation_matrices/new/store/actions/loadColumnDynamicItems.js:4 — `default export` accepts `state` from the caller and keeps it in `state` on line 4, where only it can read the value — but nothing ever reads `state`. Setting `state` therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read `state` where the behaviour it configures is decided — or, if the behaviour genuinely is fixed, remove `state` from the accepted options so callers stop setting a knob that does nothing.
  • Option is kept and never read app/javascript/vue/tasks/observation_matrices/new/store/actions/loadRowDynamicItems.js:4 — `default export` accepts `state` from the caller and keeps it in `state` on line 4, where only it can read the value — but nothing ever reads `state`. Setting `state` therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read `state` where the behaviour it configures is decided — or, if the behaviour genuinely is fixed, remove `state` from the accepted options so callers stop setting a knob that does nothing.
  • Option is kept and never read app/javascript/vue/tasks/observation_matrices/image/store/actions/createObservation.js:3 — `default export` accepts `commit` from the caller and keeps it in `commit` on line 3, where only it can read the value — but nothing ever reads `commit`. Setting `commit` therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read `commit` where the behaviour it configures is decided — or, if the behaviour genuinely is fixed, remove `commit` from the accepted options so callers stop setting a knob that does nothing.
  • Option is kept and never read app/javascript/vue/tasks/nomenclature/new_taxon_name/store/actions/loadRelationships.js:4 — `default export` accepts `state` from the caller and keeps it in `state` on line 4, where only it can read the value — but nothing ever reads `state`. Setting `state` therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read `state` where the behaviour it configures is decided — or, if the behaviour genuinely is fixed, remove `state` from the accepted options so callers stop setting a knob that does nothing.
  • Option is kept and never read app/javascript/vue/tasks/nomenclature/new_taxon_name/store/actions/removeTaxonStatus.js:4 — `default export` accepts `state` from the caller and keeps it in `state` on line 4, where only it can read the value — but nothing ever reads `state`. Setting `state` therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read `state` where the behaviour it configures is decided — or, if the behaviour genuinely is fixed, remove `state` from the accepted options so callers stop setting a knob that does nothing.
  • Option is kept and never read app/javascript/vue/tasks/images/browse/composables/useViewerTransform.js:1 — `useViewerTransform` accepts `pan` from the caller and keeps it in `pan` on line 1, where only it can read the value — but nothing ever reads `pan`. Setting `pan` therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read `pan` where the behaviour it configures is decided — or, if the behaviour genuinely is fixed, remove `pan` from the accepted options so callers stop setting a knob that does nothing.
D17 · Explicit Debt · HackComment · ×5
  • HackComment spec/models/concerns/shared/maps_spec.rb:182 — # Hack the total — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
  • HackComment REDACTED:344 — # Hack. If TDWG Gazetteer data are eliminated this needs to be removed. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
  • HackComment app/models/geographic_item.rb:1293 — # # hack, not the best way to unpack result — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
  • HackComment app/models/otu/maps.rb:90 — # # hack, not the best way to unpack result — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
  • HackComment REDACTED:14 — # TEMPORARY HACK! To be resolved with proper filter params at some points — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
D3 · God Classes · FunctionTooLong · ×5
  • FunctionTooLong: useLightTable.useLightTable app/javascript/vue/components/LightTable/composables/useLightTable.js:94 — FunctionTooLong — useLightTable runs 398 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 298 over it, 3.98× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: useFieldSync.useFieldSync app/javascript/vue/tasks/data_attributes/field_synchronize/composables/useFieldSync.js:29 — FunctionTooLong — useFieldSync runs 308 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 208 over it, 3.08× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: useBiologicalAssociationAnatomicalParts.useBiologicalAssociationAnatomicalParts app/javascript/vue/components/radials/object/components/biological_relationships/composables/useBiologicalAssociationAnatomicalParts.js:13 — FunctionTooLong — useBiologicalAssociationAnatomicalParts runs 283 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 183 over it, 2.83× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: useGraph.useGraph app/javascript/vue/tasks/biological_associations/biological_associations_graph/composition/useGraph.js:73 — FunctionTooLong — useGraph runs 258 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 158 over it, 2.58× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: _topic_picker.initialize_citation_topic_picker app/assets/javascripts/views/citations/_topic_picker.js:1 — FunctionTooLong — initialize_citation_topic_picker runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D4 · Code Duplication · Edited copy of a member (18 corresponding lines) · ×5
  • Edited copy of a member (18 corresponding lines) REDACTED:241 — REDACTED:241-258 | REDACTED:1851-1872 — These two members are one piece of code written twice and then edited apart: 18 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.
  • Edited copy of a member (18 corresponding lines) app/models/collection_object.rb:654 — app/models/collection_object.rb:654-671 | app/models/field_occurrence.rb:302-328 — These two members are one piece of code written twice and then edited apart: 18 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.
  • Edited copy of a member (18 corresponding lines) app/models/observation_matrix_row_item.rb:168 — app/models/observation_matrix_row_item.rb:168-185 | app/models/observation_matrix_row_item.rb:192-213 — These two members are one piece of code written twice and then edited apart: 18 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.
  • Edited copy of a member (18 corresponding lines) REDACTED:353 — REDACTED:353-370 | REDACTED:374-396 — These two members are one piece of code written twice and then edited apart: 18 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.
  • Edited copy of a member (18 corresponding lines) app/controllers/tasks/field_occurrences/inaturalist_import_controller.rb:14 — app/controllers/tasks/field_occurrences/inaturalist_import_controller.rb:14-31 | app/controllers/tasks/field_occurrences/inaturalist_import_controller.rb:36-55 — These two members are one piece of code written twice and then edited apart: 18 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 · Edited copies of one member (3 members, 4+ corresponding lines) · ×5
  • Edited copies of one member (3 members, 4+ corresponding lines) app/models/taxon_name_classification/icn/effectively_published/validly_published/illegitimate/homonym.rb:6 — app/models/taxon_name_classification/icn/effectively_published/validly_published/illegitimate/homonym.rb:6-9 | app/models/taxon_name_classification/icn/effectively_published/validly_published/illegitimate/incorrect_original_spelling.rb:6-9 | app/models/taxon_name_classification/icn/effectively_published/validly_published/illegitimate/superfluous.rb:6-9 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 4+ corresponding lines) app/models/taxon_name_classification/icnp/effectively_published/validly_published/illegitimate/homonym.rb:6 — app/models/taxon_name_classification/icnp/effectively_published/validly_published/illegitimate/homonym.rb:6-9 | app/models/taxon_name_classification/icnp/effectively_published/validly_published/illegitimate/not_in_official_list.rb:6-9 | app/models/taxon_name_classification/icnp/effectively_published/validly_published/illegitimate/rejected.rb:6-9 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 4+ corresponding lines) app/models/taxon_name_relationship/iczn/invalidating/synonym/suppression/conditional.rb:6 — app/models/taxon_name_relationship/iczn/invalidating/synonym/suppression/conditional.rb:6-9 | app/models/taxon_name_relationship/iczn/invalidating/synonym/suppression/partial.rb:6-9 | app/models/taxon_name_relationship/iczn/invalidating/synonym/suppression/total.rb:6-10 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 4+ corresponding lines) app/models/taxon_name_relationship/typification/genus/subsequent/ruling_by_commission.rb:4 — app/models/taxon_name_relationship/typification/genus/subsequent/ruling_by_commission.rb:4-7 | app/models/taxon_name_relationship/typification/genus/subsequent/subsequent_designation.rb:6-9 | app/models/taxon_name_relationship/typification/genus/subsequent/subsequent_monotypy.rb:6-9 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 4+ corresponding lines) app/models/taxon_name_classification/latinized/part_of_speech/adjective.rb:6 — app/models/taxon_name_classification/latinized/part_of_speech/adjective.rb:6-9 | app/models/taxon_name_classification/latinized/part_of_speech/noun_in_genitive_case.rb:6-9 | app/models/taxon_name_classification/latinized/part_of_speech/participle.rb:6-9 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (2 corresponding lines) · ×5
  • Edited copy of a member (2 corresponding lines) lib/queries/collecting_event_dates_extractor_query.rb:60 — lib/queries/collecting_event_dates_extractor_query.rb:60-61 | lib/queries/collecting_event_lat_long_extractor_query.rb:93-94 — These two members are one piece of code written twice and then edited apart: 2 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.
  • Edited copy of a member (2 corresponding lines) lib/queries/collecting_event_dates_extractor_query.rb:71 — lib/queries/collecting_event_dates_extractor_query.rb:71-72 | lib/queries/collecting_event_lat_long_extractor_query.rb:105-106 — These two members are one piece of code written twice and then edited apart: 2 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.
  • Edited copy of a member (2 corresponding lines) lib/queries/concerns/polymorphic.rb:40 — lib/queries/concerns/polymorphic.rb:40-41 | lib/queries/origin_relationship/filter.rb:117-118 — These two members are one piece of code written twice and then edited apart: 2 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.
  • Edited copy of a member (2 corresponding lines) lib/queries/collecting_event_dates_extractor_query.rb:78 — lib/queries/collecting_event_dates_extractor_query.rb:78-79 | lib/queries/collecting_event_lat_long_extractor_query.rb:112-113 — These two members are one piece of code written twice and then edited apart: 2 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.
  • Edited copy of a member (2 corresponding lines) app/models/observation_matrix_column_item.rb:148 — app/models/observation_matrix_column_item.rb:148-149 | app/models/observation_matrix_row_item.rb:253-254 — These two members are one piece of code written twice and then edited apart: 2 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 (18 lines × 2) · ×5
  • Duplicated block (18 lines × 2) app/controllers/administration_controller.rb:64 — app/controllers/administration_controller.rb:64-81 | REDACTED:33-50 — 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 (18 lines × 2) lib/queries/biological_association/filter.rb:365 — lib/queries/biological_association/filter.rb:365-382 | lib/queries/observation/filter.rb:213-230 — 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 (18 lines × 2) lib/queries/data_attribute/autocomplete.rb:73 — lib/queries/data_attribute/autocomplete.rb:73-90 | lib/queries/note/autocomplete.rb:56-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 `lib/queries/data_attribute/autocomplete.rb:73` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (18 lines × 2) app/models/anatomical_part.rb:194 — app/models/anatomical_part.rb:194-211 | app/models/extract.rb:178-195 — 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 (18 lines × 2) REDACTED:82 — REDACTED:82-99 | REDACTED:129-146 — 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.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×5
  • Duplicated block (12 lines × 2) app/helpers/taxon_names/catalog_helper.rb:154 — app/helpers/taxon_names/catalog_helper.rb:154-165 | app/helpers/taxon_names/paper_catalog_helper.rb:252-263 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (12 lines × 2) app/models/taxon_name_classification/latinized/part_of_speech/adjective.rb:22 — app/models/taxon_name_classification/latinized/part_of_speech/adjective.rb:22-33 | app/models/taxon_name_classification/latinized/part_of_speech/participle.rb:22-33 — before extracting anything, compare `app/models/taxon_name_classification/latinized/part_of_speech/adjective.rb` and `app/models/taxon_name_classification/latinized/part_of_speech/participle.rb` as WHOLE FILES: 86% 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.
  • Duplicated block (12 lines × 2) lib/export/coldp/files/name.rb:708 — lib/export/coldp/files/name.rb:708-719 | lib/export/coldp/files/name.rb:754-765 — both copies are in the same file, so extract the 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 `lib/export/coldp/files/name.rb:708` 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) lib/tools/interactive_key.rb:569 — lib/tools/interactive_key.rb:569-580 | lib/tools/interactive_key.rb:629-640 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `lib/tools/interactive_key.rb:581` calls `order`, `pluck` and `lib/tools/interactive_key.rb:641` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (12 lines × 2) REDACTED:527 — REDACTED:527-538 | REDACTED:584-595 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
S1 · Web-Security Posture · Weak hash algorithm · ×5
  • Weak hash algorithm REDACTED:75 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`Digest::SHA256` or `OpenSSL::Digest.new("SHA256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm REDACTED:270 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`Digest::SHA256` or `OpenSSL::Digest.new("SHA256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm REDACTED:19 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`Digest::SHA256` or `OpenSSL::Digest.new("SHA256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm REDACTED:10 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`Digest::SHA256` or `OpenSSL::Digest.new("SHA256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm REDACTED:77 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`Digest::SHA256` or `OpenSSL::Digest.new("SHA256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
X18 · Disposal-pattern correctness · Disposable created and abandoned in the function that made it · ×5
  • Disposable created and abandoned in the function that made it lib/generators/taxon_works/batch_load/batch_load_generator.rb:22 — `File.open` is called here without a block, so it hands back an open descriptor the caller must close — and its first and only use reads `.read` through it and drops it. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`File.open(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`).
  • Disposable created and abandoned in the function that made it lib/generators/taxon_works/batch_load/batch_load_generator.rb:30 — `File.open` is called here without a block, so it hands back an open descriptor the caller must close — and its first and only use reads `.read` through it and drops it. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`File.open(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`).
  • Disposable created and abandoned in the function that made it lib/generators/taxon_works/batch_load/batch_load_generator.rb:42 — `File.open` is called here without a block, so it hands back an open descriptor the caller must close — and its first and only use reads `.read` through it and drops it. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`File.open(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`).
  • Disposable created and abandoned in the function that made it app/models/otu.rb:262 — `File.open` is called here without a block, so it hands back an open descriptor the caller must close — and its first and only use reads `.each` through it and drops it. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`File.open(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`).
  • Disposable created and abandoned in the function that made it REDACTED:225 — `Tempfile.new` is called here without a block, so it hands back an open descriptor the caller must close — and it is held in `tempfile`, and every later use of `tempfile` in `ocr` reads a member through it — it is never closed, returned, passed, yielded or stored. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for `IO.popen`), `Errno::EMFILE` under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (`Tempfile.new(…) { |io| … }`), or the one-call reader/writer (`File.read`, `File.write`, `File.foreach`).
AC3 · Page structure · Heading level jumps from h1 to h3 · ×4
  • Heading level jumps from h1 to h3 app/javascript/vue/tasks/nomenclature/new_combination/app.vue:35 — Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
  • Heading level jumps from h1 to h3 app/javascript/vue/tasks/observation_matrices/dashboard/app.vue:55 — Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
  • Heading level jumps from h1 to h3 app/javascript/vue/tasks/observation_matrices/image/app.vue:85 — Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
  • Heading level jumps from h1 to h3 app/views/controlled_vocabulary_terms/tagged_objects.html.erb:9 — Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
D29 · Static Analysis (SAST) · REDACTED · ×4
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D35 · Change Coupling · Change-coupling hub · ×4
  • Change-coupling hub: data.rb → AnatomicalPart.js, Lead.js, Otu.js, TaxonName.js config/routes/data.rb — `config/routes/data.rb` changes together with 4 other files — `app/javascript/vue/routes/endpoints/AnatomicalPart.js`, `app/javascript/vue/routes/endpoints/Lead.js`, `app/javascript/vue/routes/endpoints/Otu.js`, `app/javascript/vue/routes/endpoints/TaxonName.js` — none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 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 4.
  • Change-coupling hub: inaturalist_import_controller.rb → ImportForm.vue, RecentImports.vue, SummaryTable.vue app/controllers/tasks/field_occurrences/inaturalist_import_controller.rb — `app/controllers/tasks/field_occurrences/inaturalist_import_controller.rb` changes together with 3 other files — `app/javascript/vue/tasks/field_occurrences/inaturalist_import/components/ImportForm.vue`, `app/javascript/vue/tasks/field_occurrences/inaturalist_import/components/RecentImports.vue`, `app/javascript/vue/tasks/field_occurrences/inaturalist_import/components/SummaryTable.vue` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
  • Change-coupling hub: dwcChecklistDownload.vue → dashboard_controller.rb, dwca.rb, data.rb app/javascript/vue/tasks/otu/filter/components/dwcChecklistDownload.vue — `app/javascript/vue/tasks/otu/filter/components/dwcChecklistDownload.vue` changes together with 3 other files — `app/controllers/tasks/dwc/dashboard_controller.rb`, `lib/export/dwca.rb`, `lib/export/dwca/checklist/data.rb` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
  • Change-coupling hub: ColConfirmModal.vue → catalogue_of_life.rb, catalogue_of_life_creator.rb, col_match.rb app/javascript/vue/components/ui/AutoselectField/ColConfirmModal.vue — `app/javascript/vue/components/ui/AutoselectField/ColConfirmModal.vue` changes together with 3 other files — `lib/autoselect/otu/levels/catalogue_of_life.rb`, `lib/autoselect/taxon_name/catalogue_of_life_creator.rb`, `lib/autoselect/taxon_name/col_match.rb` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
D4 · Code Duplication · Edited copy of a member (7 corresponding lines) · ×4
  • Edited copy of a member (7 corresponding lines) app/helpers/loans_helper.rb:4 — app/helpers/loans_helper.rb:4-10 | app/helpers/loans_helper.rb:25-34 — These two members are one piece of code written twice and then edited apart: 7 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.
  • Edited copy of a member (7 corresponding lines) app/helpers/workbench/navigation_helper.rb:222 — app/helpers/workbench/navigation_helper.rb:222-228 | app/helpers/workbench/navigation_helper.rb:232-238 — These two members are one piece of code written twice and then edited apart: 7 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.
  • Edited copy of a member (7 corresponding lines) lib/queries/collection_object/filter.rb:782 — lib/queries/collection_object/filter.rb:782-788 | lib/queries/field_occurrence/filter.rb:397-403 — These two members are one piece of code written twice and then edited apart: 7 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.
  • Edited copy of a member (7 corresponding lines) lib/queries/extract/filter.rb:266 — lib/queries/extract/filter.rb:266-272 | lib/queries/sound/filter.rb:253-259 — These two members are one piece of code written twice and then edited apart: 7 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 · Edited copy of a member (5 corresponding lines) · ×4
  • Edited copy of a member (5 corresponding lines) config/initializers/constants/model/matrix_column_items.rb:3 — config/initializers/constants/model/matrix_column_items.rb:3-7 | config/initializers/constants/model/matrix_row_items.rb:3-7 — These two members are one piece of code written twice and then edited apart: 5 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.
  • Edited copy of a member (5 corresponding lines) app/models/taxon_name_classification/iczn/unavailable/excluded.rb:11 — app/models/taxon_name_classification/iczn/unavailable/excluded.rb:11-15 | app/models/taxon_name_classification/iczn/unavailable/nomen_nudum.rb:15-19 — These two members are one piece of code written twice and then edited apart: 5 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.
  • Edited copy of a member (5 corresponding lines) lib/tools/description/from_observation_matrix.rb:207 — lib/tools/description/from_observation_matrix.rb:207-211 | lib/tools/interactive_key.rb:245-249 — These two members are one piece of code written twice and then edited apart: 5 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.
  • Edited copy of a member (5 corresponding lines) REDACTED:610 — REDACTED:610-614 | REDACTED:483-487 — These two members are one piece of code written twice and then edited apart: 5 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 · Edited copy of a member (6 corresponding lines) · ×4
  • Edited copy of a member (6 corresponding lines) REDACTED:156 — REDACTED:156-161 | lib/tools/image_matrix.rb:416-423 — These two members are one piece of code written twice and then edited apart: 6 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.
  • Edited copy of a member (6 corresponding lines) lib/queries/conveyance/filter.rb:121 — lib/queries/conveyance/filter.rb:121-127 | lib/queries/depiction/filter.rb:183-188 — These two members are one piece of code written twice and then edited apart: 6 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.
  • Edited copy of a member (6 corresponding lines) lib/queries/conveyance/filter.rb:131 — lib/queries/conveyance/filter.rb:131-136 | lib/queries/depiction/filter.rb:192-197 — These two members are one piece of code written twice and then edited apart: 6 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.
  • Edited copy of a member (6 corresponding lines) REDACTED:62 — REDACTED:62-68 | REDACTED:17-22 — These two members are one piece of code written twice and then edited apart: 6 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 (17 lines × 2) · ×4
  • Duplicated block (17 lines × 2) app/jobs/dwca_create_checklist_download_job.rb:20 — app/jobs/dwca_create_checklist_download_job.rb:20-36 | app/jobs/dwca_create_download_job.rb:48-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 (17 lines × 2) app/models/collection_object/biological_collection_object.rb:60 — app/models/collection_object/biological_collection_object.rb:60-76 | app/models/field_occurrence/biological_field_occurrence.rb:41-57 — `app/models/collection_object/biological_collection_object.rb` and `app/models/field_occurrence/biological_field_occurrence.rb` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 2 separate duplicated blocks between them, totalling at least 23 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (17 lines × 2) REDACTED:378 — REDACTED:378-394 | REDACTED:603-619 — 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 (17 lines × 2) lib/gis/geo_json.rb:7 — lib/gis/geo_json.rb:7-23 | lib/gis/geo_json.rb:32-48 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×4
  • Duplicated block (13 lines × 2) app/helpers/graph_helper.rb:299 — app/helpers/graph_helper.rb:299-311 | app/helpers/graph_helper.rb:386-398 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (13 lines × 2) app/helpers/pinboard_items_helper.rb:69 — app/helpers/pinboard_items_helper.rb:69-81 | app/helpers/pinboard_items_helper.rb:85-97 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (13 lines × 2) lib/export/csv/biological_associations/extended.rb:29 — lib/export/csv/biological_associations/extended.rb:29-41 | lib/export/csv/biological_associations/simple.rb:21-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 (13 lines × 2) lib/queries/collection_object/filter.rb:306 — lib/queries/collection_object/filter.rb:306-318 | lib/queries/field_occurrence/filter.rb:142-154 — `lib/queries/collection_object/filter.rb` and `lib/queries/field_occurrence/filter.rb` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 5 separate duplicated blocks between them, totalling at least 49 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×4
  • Duplicated block (11 lines × 2) app/controllers/confidence_levels_controller.rb:22 — app/controllers/confidence_levels_controller.rb:22-32 | app/controllers/predicates_controller.rb:7-17 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (11 lines × 2) REDACTED:577 — REDACTED:577-587 | REDACTED:592-602 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:577` 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) lib/queries/anatomical_part/autocomplete.rb:70 — lib/queries/anatomical_part/autocomplete.rb:70-80 | lib/queries/gazetteer/autocomplete.rb:48-58 — 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 (11 lines × 2) lib/queries/biological_relationship/autocomplete.rb:13 — lib/queries/biological_relationship/autocomplete.rb:13-23 | lib/queries/user/autocomplete.rb:12-22 — 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 (5 lines × 3) · ×4
  • Duplicated block (5 lines × 3) app/models/collection_object.rb:622 — app/models/collection_object.rb:622-626 | app/models/field_occurrence.rb:269-273 | app/models/otu.rb:377-381 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `app/models/collection_object.rb:622` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `app/models/field_occurrence.rb:276` calls `where`, `eq` and `app/models/otu.rb:383` 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 (5 lines × 3) REDACTED:249 — REDACTED:249-253 | REDACTED:280-284 | REDACTED:312-316 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (5 lines × 3) app/models/asserted_distribution/dwc_extensions.rb:39 — app/models/asserted_distribution/dwc_extensions.rb:39-43 | app/models/collection_object/dwc_extensions.rb:249-253 | app/models/field_occurrence/dwc_extensions.rb:219-223 — 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 (5 lines × 3) app/models/taxon_name_relationship/icn/unaccepting/synonym/homotypic.rb:30 — app/models/taxon_name_relationship/icn/unaccepting/synonym/homotypic.rb:30-34 | app/models/taxon_name_relationship/icnp/unaccepting/synonym/homotypic.rb:30-34 | app/models/taxon_name_relationship/iczn/invalidating/synonym/objective.rb:31-35 — 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.
AC4 · Keyboard semantics · Link used as a button (placeholder href) · ×3
  • Link used as a button (placeholder href) app/assets/javascripts/views/citations/_topic_picker.js:144 — An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
  • Link used as a button (placeholder href) app/assets/javascripts/views/confidences/form.js:114 — An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
  • Link used as a button (placeholder href) app/javascript/vue/components/radials/navigation/components/recent.vue:16 — An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
D15 · Churn × Complexity Hotspots · Hotspot · ×3
  • Hotspot: app/javascript/vue/components/ui/AutoselectField.vue app/javascript/vue/components/ui/AutoselectField.vue:537 — app/javascript/vue/components/ui/AutoselectField.vue changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in onInput at line 537. 1 of those changes was a fix/bug commit, and the other 29 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 09:49:51 -06:00' --until='2026-11-16 09:49:51 -06:00' --full-history --no-merges -- app/javascript/vue/components/ui/AutoselectField.vue`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: REDACTED REDACTED:320 — REDACTED changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in TaxonNameClassification.process_batch_by_filter_scope at line 320. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 09:49:51 -06:00' --until='2026-11-16 09:49:51 -06:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: app/models/dataset_record/darwin_core/occurrence.rb app/models/dataset_record/darwin_core/occurrence.rb:311 — app/models/dataset_record/darwin_core/occurrence.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in Occurrence.import at line 311. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 09:49:51 -06:00' --until='2026-11-16 09:49:51 -06:00' --full-history --no-merges -- app/models/dataset_record/darwin_core/occurrence.rb`: 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.
D29 · Static Analysis (SAST) · REDACTED · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Medium CVE · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (25 corresponding lines) · ×3
  • Edited copy of a member (25 corresponding lines) app/helpers/graph_helper.rb:44 — app/helpers/graph_helper.rb:44-74 | app/helpers/graph_helper.rb:78-102 — These two members are one piece of code written twice and then edited apart: 25 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.
  • Edited copy of a member (25 corresponding lines) lib/export/coldp/files/name.rb:169 — lib/export/coldp/files/name.rb:169-193 | lib/export/coldp/files/name.rb:197-228 — These two members are one piece of code written twice and then edited apart: 25 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.
  • Edited copy of a member (25 corresponding lines) app/jobs/dwca_create_checklist_download_job.rb:12 — app/jobs/dwca_create_checklist_download_job.rb:12-36 | app/jobs/dwca_create_download_job.rb:37-64 — These two members are one piece of code written twice and then edited apart: 25 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 · Edited copies of one member (4 members, 9+ corresponding lines) · ×3
  • Edited copies of one member (4 members, 9+ corresponding lines) lib/queries/source/filter.rb:550 — lib/queries/source/filter.rb:550-558 | lib/queries/source/filter.rb:562-570 | lib/queries/source/filter.rb:574-584 | lib/queries/source/filter.rb:588-598 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
  • Edited copies of one member (4 members, 9+ corresponding lines) REDACTED:75 — REDACTED:75-83 | REDACTED:229-238 | REDACTED:59-67 | REDACTED:65-73 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
  • Edited copies of one member (4 members, 9+ corresponding lines) db/migrate/20160811201819_create_sequence_relationships.rb:3 — db/migrate/20160811201819_create_sequence_relationships.rb:3-12 | db/migrate/20160817002127_create_confidences.rb:3-11 | db/migrate/20160817212253_create_protocols.rb:3-12 | db/migrate/20160818170209_create_protocol_relationships.rb:3-12 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (22 corresponding lines) · ×3
  • Edited copy of a member (22 corresponding lines) lib/queries/concerns/data_attributes.rb:367 — lib/queries/concerns/data_attributes.rb:367-388 | lib/queries/concerns/data_attributes.rb:392-413 — These two members are one piece of code written twice and then edited apart: 22 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.
  • Edited copy of a member (22 corresponding lines) app/models/concerns/shared/is_indexed_biological_association.rb:195 — app/models/concerns/shared/is_indexed_biological_association.rb:195-216 | app/models/concerns/shared/is_indexed_biological_association.rb:220-241 — These two members are one piece of code written twice and then edited apart: 22 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.
  • Edited copy of a member (22 corresponding lines) lib/queries/asserted_distribution/autocomplete.rb:118 — lib/queries/asserted_distribution/autocomplete.rb:118-143 | lib/queries/asserted_environment/autocomplete.rb:56-77 — These two members are one piece of code written twice and then edited apart: 22 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 · Edited copies of one member (4 members, 11+ corresponding lines) · ×3
  • Edited copies of one member (4 members, 11+ corresponding lines) REDACTED:213 — REDACTED:213-223 | REDACTED:75-85 | REDACTED:44-54 | REDACTED:41-52 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
  • Edited copies of one member (4 members, 11+ corresponding lines) lib/queries/concerns/data_attributes.rb:417 — lib/queries/concerns/data_attributes.rb:417-427 | lib/queries/concerns/data_attributes.rb:431-441 | lib/queries/concerns/data_attributes.rb:445-455 | lib/queries/concerns/data_attributes.rb:459-469 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
  • Edited copies of one member (4 members, 11+ corresponding lines) REDACTED:9 — REDACTED:9-23 | REDACTED:10-20 | REDACTED:10-22 | REDACTED:10-20 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 15+ corresponding lines) · ×3
  • Edited copies of one member (3 members, 15+ corresponding lines) app/models/dataset_record/darwin_core/occurrence.rb:1860 — app/models/dataset_record/darwin_core/occurrence.rb:1860-1877 | app/models/dataset_record/darwin_core/occurrence.rb:1881-1899 | app/models/dataset_record/darwin_core/occurrence.rb:1962-1976 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 15+ corresponding lines) lib/export/coldp/files/synonym.rb:52 — lib/export/coldp/files/synonym.rb:52-75 | lib/export/coldp/files/synonym.rb:80-98 | lib/export/coldp/files/synonym.rb:102-116 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 15+ corresponding lines) lib/queries/image/filter.rb:878 — lib/queries/image/filter.rb:878-892 | lib/queries/sound/filter.rb:275-289 | lib/queries/source/filter.rb:494-508 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 7+ corresponding lines) · ×3
  • Edited copies of one member (4 members, 7+ corresponding lines) app/helpers/conveyances_helper.rb:50 — app/helpers/conveyances_helper.rb:50-57 | app/helpers/depictions_helper.rb:75-82 | app/helpers/observations_helper.rb:133-140 | app/helpers/record_navigation_helper.rb:18-24 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
  • Edited copies of one member (4 members, 7+ corresponding lines) app/helpers/conveyances_helper.rb:63 — app/helpers/conveyances_helper.rb:63-70 | app/helpers/depictions_helper.rb:89-96 | app/helpers/observations_helper.rb:146-153 | app/helpers/record_navigation_helper.rb:29-35 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
  • Edited copies of one member (4 members, 7+ corresponding lines) lib/queries/anatomical_part/filter.rb:237 — lib/queries/anatomical_part/filter.rb:237-243 | lib/queries/collection_object/filter.rb:826-832 | lib/queries/field_occurrence/filter.rb:444-450 | lib/queries/otu/filter.rb:711-717 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Duplicated block (23 lines × 2) · ×3
  • Duplicated block (23 lines × 2) REDACTED:455 — REDACTED:455-477 | REDACTED:137-159 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:455` 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 (23 lines × 2) app/models/character_state.rb:54 — app/models/character_state.rb:54-76 | app/models/descriptor.rb:98-120 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (23 lines × 2) lib/queries/depiction/filter.rb:115 — lib/queries/depiction/filter.rb:115-137 | lib/queries/image/filter.rb:516-538 — 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.
D4 · Code Duplication · Duplicated block (11 lines × 3) · ×3
  • Duplicated block (11 lines × 3) app/models/collection_object.rb:631 — app/models/collection_object.rb:631-641 | app/models/extract.rb:154-164 | app/models/field_occurrence.rb:278-288 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `app/models/collection_object.rb:631` 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, `app/models/collection_object.rb:629` calls `where`, `eq` and `app/models/extract.rb:152` 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 (11 lines × 3) lib/queries/biological_association/filter.rb:345 — lib/queries/biological_association/filter.rb:345-355 | lib/queries/biological_associations_graph/filter.rb:95-105 | lib/queries/observation/filter.rb:194-204 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (11 lines × 3) lib/queries/biological_association/filter.rb:386 — lib/queries/biological_association/filter.rb:386-396 | lib/queries/biological_associations_graph/filter.rb:135-145 | lib/queries/observation/filter.rb:234-244 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/queries/biological_association/filter.rb:386` 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.
R10 · Code Duplication · Duplicated block (47 lines × 2 locations) · ×3
  • Duplicated block (47 lines × 2 locations) app/javascript/vue/components/Filter/Facets/shared/FacetByAttributeRow/ByAttributeRowFacet.vue:60 — app/javascript/vue/components/Filter/Facets/shared/FacetByAttributeRow/ByAttributeRowFacet.vue:60 · app/javascript/vue/components/Filter/Facets/shared/FacetDataAttribute/FacetDataAttribute.vue:54 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (47 lines × 2 locations) app/javascript/vue/tasks/observation_matrices/matrix_column_coder/MatrixColumnCoder/ContinuousDescriptor/ContinuousDescriptorObservation.vue:44 — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/MatrixColumnCoder/ContinuousDescriptor/ContinuousDescriptorObservation.vue:44 · app/javascript/vue/tasks/observation_matrices/matrix_row_coder/MatrixRowCoder/ContinuousDescriptor/ContinuousDescriptorObservation.vue:44 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (47 lines × 2 locations) app/javascript/vue/tasks/otus/browse/components/Panel/PanelAssertedEnvironments/PanelAssertedEnvironments.vue:39 — app/javascript/vue/tasks/otus/browse/components/Panel/PanelAssertedEnvironments/PanelAssertedEnvironments.vue:39 · app/javascript/vue/tasks/otus/browse/components/Panel/PanelCommonNames/PanelCommonNames.vue:48 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication · Duplicated block (45 lines × 2 locations) · ×3
  • Duplicated block (45 lines × 2 locations) app/javascript/vue/components/Filter/Facets/Source/FacetAuthors.vue:56 — app/javascript/vue/components/Filter/Facets/Source/FacetAuthors.vue:56 · app/javascript/vue/components/Filter/Facets/Source/FacetEditors.vue:56 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
  • Duplicated block (45 lines × 2 locations) app/javascript/vue/tasks/dwc/compact/components/ChartLifeStageCounts.vue:14 — app/javascript/vue/tasks/dwc/compact/components/ChartLifeStageCounts.vue:14 · app/javascript/vue/tasks/dwc/compact/components/ChartSexCounts.vue:14 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
  • Duplicated block (45 lines × 2 locations) app/javascript/vue/tasks/observation_matrices/matrix_row_coder/MatrixRowCoder/ContinuousDescriptor/ContinuousDescriptor.vue:38 — app/javascript/vue/tasks/observation_matrices/matrix_row_coder/MatrixRowCoder/ContinuousDescriptor/ContinuousDescriptor.vue:38 · app/javascript/vue/tasks/observation_matrices/matrix_row_coder/MatrixRowCoder/SampleDescriptor/SampleDescriptor.vue:43 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
AC1 · Text alternatives · <canvas> without a text alternative · ×2
  • <canvas> without a text alternative app/views/tasks/accessions/breakdown/buffered_data/index.html.erb:32 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
  • <canvas> without a text alternative app/views/tasks/accessions/breakdown/sqed_depiction/_metadata.html.erb:31 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
D1 · Cyclomatic Complexity · (anonymous) (cyclomatic 16) · ×2
  • (anonymous) (cyclomatic 16) app/javascript/vue/tasks/dwca_import/store/actions/loadDataSetRecords.js:8 — (anonymous) has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 5 function items inside it that branch (a function literal at line 9, a function literal at line 46, (anonymous)::serialize, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
  • (anonymous) (cyclomatic 16) app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/removeObservation.js:5 — (anonymous) has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 13 function items inside it that branch (getFindCallback, removeObservation, getObservationListByType, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · Filter.otu_scope_facet (cognitive 20) · ×2
  • Filter.otu_scope_facet (cognitive 20) lib/queries/depiction/filter.rb:114 — Filter.otu_scope_facet has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Filter.otu_scope_facet (cognitive 20) lib/queries/image/filter.rb:515 — Filter.otu_scope_facet has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (19 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 · setObservation.default (cognitive 16) · ×2
  • setObservation.default (cognitive 16) app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setObservation.js:3 — setObservation.default has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3 (nesting depth added 2). Of this number, 9 points are the body's own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
  • setObservation.default (cognitive 16) app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/mutations/setObservation.js:3 — setObservation.default has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (nesting depth added 2). Of this number, 10 points are the body's own statements and 6 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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 · (anonymous) (cognitive 16) · ×2
  • (anonymous) (cognitive 16) app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/mutations/setObservation.js:3 — (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (nesting depth added 2). Of this number, 10 points are the body's own statements and 6 belong to 7 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
  • (anonymous) (cognitive 16) app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setObservation.js:3 — (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3 (nesting depth added 2). Of this number, 9 points are the body's own statements and 7 belong to 6 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D4 · Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) · ×2
  • Members sharing a duplicated core (7 members, 50+ identical tokens) app/models/document.rb:154 — app/models/document.rb:154-175 | REDACTED:378-395 | REDACTED:571-621 | REDACTED:393-409 | app/models/organization.rb:98-113 | app/models/person.rb:512-527 | app/models/sound.rb:77-93 — These 7 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 7 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 7 times.
  • Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:492 — REDACTED:492-512 | lib/queries/collecting_event/filter.rb:308-332 | lib/queries/collection_object/filter.rb:465-496 | lib/queries/field_occurrence/filter.rb:226-253 | lib/queries/source/filter.rb:308-332 | lib/queries/source/filter.rb:336-360 | lib/queries/taxon_name/filter.rb:727-751 — These 7 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 7 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 7 times.
D4 · Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) · ×2
  • Members sharing a duplicated core (6 members, 50+ identical tokens) app/models/biological_association.rb:255 — app/models/biological_association.rb:255-284 | app/models/biological_associations_graph.rb:34-63 | app/models/conveyance.rb:52-81 | app/models/depiction.rb:134-163 | app/models/extract.rb:128-172 | app/models/observation.rb:347-376 — These 6 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 6 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 6 times.
  • Members sharing a duplicated core (6 members, 50+ identical tokens) app/models/biological_relationship.rb:55 — app/models/biological_relationship.rb:55-70 | app/models/predicate.rb:11-27 | app/models/preparation_type.rb:36-53 | app/models/protocol.rb:49-64 | app/models/repository.rb:71-86 | app/models/topic.rb:33-62 — These 6 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 6 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 6 times.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×2
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:9 — REDACTED:9-19 | REDACTED:25-34 | REDACTED:9-19 | REDACTED:9-19 — 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) app/models/collection_object.rb:600 — app/models/collection_object.rb:600-648 | app/models/extract.rb:128-172 | app/models/field_occurrence.rb:247-296 | app/models/otu.rb:340-400 — 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 · Edited copy of a member (43 corresponding lines) · ×2
  • Edited copy of a member (43 corresponding lines) app/helpers/tasks/collecting_events/parse/stepwise/dates_helper.rb:60 — app/helpers/tasks/collecting_events/parse/stepwise/dates_helper.rb:60-102 | app/helpers/tasks/collecting_events/parse/stepwise/lat_long_helper.rb:51-100 — These two members are one piece of code written twice and then edited apart: 43 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.
  • Edited copy of a member (43 corresponding lines) lib/queries/biological_association/filter.rb:819 — lib/queries/biological_association/filter.rb:819-861 | lib/queries/biological_association/filter.rb:924-976 — These two members are one piece of code written twice and then edited apart: 43 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 · Edited copy of a member (28 corresponding lines) · ×2
  • Edited copy of a member (28 corresponding lines) REDACTED:527 — REDACTED:527-554 | REDACTED:584-621 — These two members are one piece of code written twice and then edited apart: 28 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.
  • Edited copy of a member (28 corresponding lines) app/helpers/observation_matrices/export/nexml_helper.rb:96 — app/helpers/observation_matrices/export/nexml_helper.rb:96-147 | app/helpers/observation_matrices/export/nexml_helper.rb:151-178 — These two members are one piece of code written twice and then edited apart: 28 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 · Edited copy of a member (30 corresponding lines) · ×2
  • Edited copy of a member (30 corresponding lines) REDACTED:449 — REDACTED:449-485 | REDACTED:133-162 — 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.
  • Edited copy of a member (30 corresponding lines) lib/export/dwca/checklist/occurrence_normalizer.rb:371 — lib/export/dwca/checklist/occurrence_normalizer.rb:371-403 | lib/export/dwca/checklist/occurrence_normalizer.rb:873-902 — 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 · Edited copies of one member (4 members, 13+ corresponding lines) · ×2
  • Edited copies of one member (4 members, 13+ corresponding lines) db/migrate/20160804142825_create_descriptors.rb:3 — db/migrate/20160804142825_create_descriptors.rb:3-15 | db/migrate/20160804185715_create_matrix_columns.rb:3-15 | db/migrate/20160804214036_create_matrix_column_items.rb:3-16 | db/migrate/20231217014025_create_field_occurrences.rb:3-17 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
  • Edited copies of one member (4 members, 13+ corresponding lines) app/models/collector.rb:7 — app/models/collector.rb:7-21 | app/models/determiner.rb:12-26 | app/models/identifier/local/field_number.rb:12-24 | app/models/taxon_determination.rb:144-158 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (19 corresponding lines) · ×2
  • Edited copy of a member (19 corresponding lines) app/helpers/otus/catalog_helper.rb:23 — app/helpers/otus/catalog_helper.rb:23-41 | app/helpers/taxon_names/catalog_helper.rb:56-74 — These two members are one piece of code written twice and then edited apart: 19 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.
  • Edited copy of a member (19 corresponding lines) app/models/observation_matrix_column_item.rb:272 — app/models/observation_matrix_column_item.rb:272-291 | app/models/observation_matrix_column_item.rb:297-315 — These two members are one piece of code written twice and then edited apart: 19 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 · Edited copies of one member (7 members, 11+ corresponding lines) · ×2
  • Edited copies of one member (7 members, 11+ corresponding lines) REDACTED:59 — REDACTED:59-69 | REDACTED:38-48 | REDACTED:24-34 | REDACTED:25-37 | REDACTED:71-81 | REDACTED:46-56 | REDACTED:50-60 — These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 11 lines, 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 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. Left alone, the next edit has to be made 7 times and the copies will drift further apart.
  • Edited copies of one member (7 members, 11+ corresponding lines) REDACTED:10 — REDACTED:10-25 | REDACTED:10-20 | REDACTED:11-24 | REDACTED:12-24 | REDACTED:13-24 | REDACTED:9-20 | REDACTED:10-20 — These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 11 lines, 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 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. Left alone, the next edit has to be made 7 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (7 members, 9+ corresponding lines) · ×2
  • Edited copies of one member (7 members, 9+ corresponding lines) REDACTED:46 — REDACTED:46-54 | REDACTED:55-64 | REDACTED:79-88 | REDACTED:52-61 | REDACTED:130-141 | REDACTED:58-68 | REDACTED:57-69 — These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 9 lines, 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 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. Left alone, the next edit has to be made 7 times and the copies will drift further apart.
  • Edited copies of one member (7 members, 9+ corresponding lines) REDACTED:74 — REDACTED:74-82 | REDACTED:53-61 | REDACTED:39-47 | REDACTED:42-50 | REDACTED:86-94 | REDACTED:61-69 | REDACTED:65-73 — These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 9 lines, 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 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. Left alone, the next edit has to be made 7 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 12+ corresponding lines) · ×2
  • Edited copies of one member (3 members, 12+ corresponding lines) REDACTED:9 — REDACTED:9-20 | REDACTED:11-22 | REDACTED:9-20 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 12+ corresponding lines) REDACTED:93 — REDACTED:93-104 | REDACTED:112-124 | REDACTED:77-88 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 13+ corresponding lines) · ×2
  • Edited copies of one member (3 members, 13+ corresponding lines) REDACTED:168 — REDACTED:168-181 | REDACTED:148-163 | REDACTED:104-116 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 13+ corresponding lines) db/migrate/20220211181531_data_migrate_observation_to_polymorphic.rb:4 — db/migrate/20220211181531_data_migrate_observation_to_polymorphic.rb:4-16 | db/migrate/20220211182901_data_migrate_observation_matrix_row_item_to_polymorphic.rb:11-23 | db/migrate/20220211183408_data_migrate_observation_matrix_row_to_polymorphic.rb:4-16 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 5+ corresponding lines) · ×2
  • Edited copies of one member (4 members, 5+ corresponding lines) app/models/taxon_name_relationship/icn/unaccepting/synonym/homotypic/alternative_name.rb:6 — app/models/taxon_name_relationship/icn/unaccepting/synonym/homotypic/alternative_name.rb:6-10 | app/models/taxon_name_relationship/icn/unaccepting/synonym/homotypic/basionym.rb:8-12 | app/models/taxon_name_relationship/icn/unaccepting/synonym/homotypic/isonym.rb:6-10 | app/models/taxon_name_relationship/icn/unaccepting/synonym/homotypic/orthographic_variant.rb:6-10 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
  • Edited copies of one member (4 members, 5+ corresponding lines) app/models/taxon_name_relationship/iczn/invalidating/synonym/objective/replaced_homonym.rb:6 — app/models/taxon_name_relationship/iczn/invalidating/synonym/objective/replaced_homonym.rb:6-11 | app/models/taxon_name_relationship/iczn/invalidating/synonym/objective/synonymic_homonym.rb:6-10 | app/models/taxon_name_relationship/iczn/invalidating/synonym/objective/unjustified_emendation.rb:14-18 | app/models/taxon_name_relationship/iczn/invalidating/synonym/objective/unnecessary_replacement_name.rb:6-10 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 11+ corresponding lines) · ×2
  • Edited copies of one member (3 members, 11+ corresponding lines) REDACTED:140 — REDACTED:140-150 | REDACTED:78-88 | REDACTED:147-157 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 11+ corresponding lines) lib/queries/controlled_vocabulary_term/autocomplete.rb:20 — lib/queries/controlled_vocabulary_term/autocomplete.rb:20-31 | lib/queries/identifier/autocomplete.rb:15-25 | lib/queries/taxon_name/autocomplete.rb:70-83 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 4+ corresponding lines) · ×2
  • Edited copies of one member (4 members, 4+ corresponding lines) REDACTED:114 — REDACTED:114-117 | REDACTED:61-64 | REDACTED:85-88 | REDACTED:102-105 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
  • Edited copies of one member (4 members, 4+ corresponding lines) REDACTED:51 — REDACTED:51-55 | REDACTED:44-47 | REDACTED:293-300 | REDACTED:25-28 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Duplicated block (24–26 lines × 2) · ×2
  • Duplicated block (24–26 lines × 2) lib/export/coldp/files/name.rb:332 — lib/export/coldp/files/name.rb:332-357 | lib/export/coldp/files/name.rb:420-443 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (24–26 lines × 2) lib/export/coldp/files/name.rb:485 — lib/export/coldp/files/name.rb:485-508 | lib/export/coldp/files/name.rb:521-546 — both copies are in the same file, so extract the 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 `lib/export/coldp/files/name.rb:485` 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 (25 lines × 2) · ×2
  • Duplicated block (25 lines × 2) REDACTED:220 — REDACTED:220-244 | REDACTED:270-294 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (25 lines × 2) REDACTED:415 — REDACTED:415-439 | app/models/sound.rb:99-123 — 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.
D4 · Code Duplication · Duplicated block (21 lines × 2) · ×2
  • Duplicated block (21 lines × 2) app/helpers/graph_helper.rb:44 — app/helpers/graph_helper.rb:44-64 | app/helpers/graph_helper.rb:78-98 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (21 lines × 2) lib/export/csv/dwc/extension/checklist/reference.rb:41 — lib/export/csv/dwc/extension/checklist/reference.rb:41-61 | lib/export/csv/dwc/extension/checklist/types_and_specimen.rb:48-68 — 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.
D4 · Code Duplication · Duplicated block (20 lines × 2) · ×2
  • Duplicated block (20 lines × 2) app/models/attribution.rb:74 — app/models/attribution.rb:74-93 | app/models/attribution.rb:129-148 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (20 lines × 2) lib/export/coldp/files/name.rb:389 — lib/export/coldp/files/name.rb:389-408 | lib/export/coldp/files/name.rb:461-480 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `lib/export/coldp/files/name.rb:389` 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, `lib/export/coldp/files/name.rb:459` calls `gsub` and `lib/export/coldp/files/name.rb:387` 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.
D4 · Code Duplication · Duplicated block (17–18 lines × 2) · ×2
  • Duplicated block (17–18 lines × 2) app/models/collection_object.rb:630 — app/models/collection_object.rb:630-646 | app/models/field_occurrence.rb:277-294 — 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 `app/models/collection_object.rb:630` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (17–18 lines × 2) lib/export/dwca/checklist/data.rb:465 — lib/export/dwca/checklist/data.rb:465-481 | lib/export/dwca/occurrence/data.rb:506-523 — 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 `lib/export/dwca/checklist/data.rb:465` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×2
  • Duplicated block (16 lines × 2) REDACTED:372 — REDACTED:372-387 | REDACTED:391-406 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (16 lines × 2) lib/project_unification/special_handlers.rb:124 — lib/project_unification/special_handlers.rb:124-139 | lib/project_unification/special_handlers.rb:171-186 — both copies are in the same file, so extract the 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 `lib/project_unification/special_handlers.rb:124` 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.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×2
  • Duplicated block (14 lines × 2) app/helpers/otus/gis_helper.rb:292 — app/helpers/otus/gis_helper.rb:292-305 | app/helpers/otus/gis_helper.rb:314-327 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (14 lines × 2) app/models/taxon_name_relationship/icn/unaccepting/synonym.rb:72 — app/models/taxon_name_relationship/icn/unaccepting/synonym.rb:72-85 | app/models/taxon_name_relationship/icnp/unaccepting/synonym.rb:70-83 — before extracting anything, compare `app/models/taxon_name_relationship/icn/unaccepting/synonym.rb` and `app/models/taxon_name_relationship/icnp/unaccepting/synonym.rb` as WHOLE FILES: this scan already matched 3 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. 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 (9–10 lines × 2) · ×2
  • Duplicated block (9–10 lines × 2) REDACTED:215 — REDACTED:215-223 | REDACTED:43-52 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (9–10 lines × 2) app/helpers/observation_matrices/export/otu_contents_helper.rb:114 — app/helpers/observation_matrices/export/otu_contents_helper.rb:114-122 | app/helpers/observation_matrices/export/otu_contents_helper.rb:128-137 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (9 lines × 4) · ×2
  • Duplicated block (9 lines × 4) REDACTED:11 — REDACTED:11-19 | REDACTED:26-34 | REDACTED:11-19 | REDACTED:11-19 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 4 call sites, so a change lands once.
  • Duplicated block (9 lines × 4) app/models/taxon_name_relationship/icn/unaccepting/synonym.rb:45 — app/models/taxon_name_relationship/icn/unaccepting/synonym.rb:45-53 | app/models/taxon_name_relationship/icnp/unaccepting/synonym.rb:43-51 | app/models/taxon_name_relationship/iczn/invalidating/synonym.rb:52-60 | app/models/taxon_name_relationship/typification/genus/subsequent.rb:29-37 — before extracting anything, compare `app/models/taxon_name_relationship/icn/unaccepting/synonym.rb` and `app/models/taxon_name_relationship/icnp/unaccepting/synonym.rb` as WHOLE FILES: this scan already matched 3 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.
D4 · Code Duplication · Duplicated block (9 lines × 3) · ×2
  • Duplicated block (9 lines × 3) REDACTED:61 — REDACTED:61-69 | REDACTED:29-37 | REDACTED:52-60 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
  • Duplicated block (9 lines × 3) app/models/document.rb:165 — app/models/document.rb:165-173 | REDACTED:399-407 | app/models/sound.rb:83-91 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `app/models/document.rb:165` 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.
D4 · Code Duplication · Duplicated block (7 lines × 7) · ×2
  • Duplicated block (7 lines × 7) REDACTED:495 — REDACTED:495-501 | lib/queries/collecting_event/filter.rb:312-318 | lib/queries/collection_object/filter.rb:471-477 | lib/queries/field_occurrence/filter.rb:232-238 | lib/queries/source/filter.rb:312-318 | lib/queries/source/filter.rb:340-346 | lib/queries/taxon_name/filter.rb:731-737 — there are 7 copies across 6 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 7 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:495` 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, `lib/queries/collecting_event/filter.rb:320` calls `eq` and `REDACTED:503` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (7 lines × 7) lib/queries/collecting_event/filter.rb:480 — lib/queries/collecting_event/filter.rb:480-487 | lib/queries/collecting_event/filter.rb:491-498 | lib/queries/collection_object/filter.rb:792-798 | lib/queries/collection_object/filter.rb:888-896 | lib/queries/collection_object/filter.rb:900-908 | lib/queries/otu/filter.rb:614-621 | lib/queries/otu/filter.rb:636-643 — there are 7 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
R10 · Code Duplication · Duplicated block with local edits (86 matched lines × 2 locations) · ×2
  • Duplicated block with local edits (86 matched lines × 2 locations) app/assets/javascripts/views/tasks/collecting_events/parse/dates/index.js:1 — app/assets/javascripts/views/tasks/collecting_events/parse/dates/index.js:1 · app/assets/javascripts/views/tasks/collecting_events/parse/lat_long/index.js:1 — the two spans are one implementation copied and then locally edited — 804 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (86 matched lines × 2 locations) app/javascript/vue/tasks/asserted_distributions/new_asserted_distribution/store/store.js:26 — app/javascript/vue/tasks/asserted_distributions/new_asserted_distribution/store/store.js:26 · app/javascript/vue/tasks/biological_associations/new/store/store.js:72 — the two spans are one implementation copied and then locally edited — 391 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R7 · Dead Code · Dead file (~86 LoC) · ×2
  • Dead file (~86 LoC) app/javascript/vue/tasks/dwc/dashboard/components/ProgressBar.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (app/javascript/vue/tasks/dwc/dashboard/components/Reindex/ReindexPanel.vue) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
  • Dead file (~86 LoC) app/javascript/vue/tasks/otu/browse_asserted_distributions/components/list.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~76 LoC) · ×2
  • Dead file (~76 LoC) app/javascript/vue/tasks/collection_objects/filter/components/tagAll.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~76 LoC) app/javascript/vue/tasks/dwc/dashboard/components/Graph/GraphIndex.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (app/javascript/vue/tasks/dwc/dashboard/components/Graph/GraphPanel.vue) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~75 LoC) · ×2
  • Dead file (~75 LoC) app/javascript/vue/components/radials/annotator/components/annotatorExtend.js — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~75 LoC) app/javascript/vue/tasks/dwc/dashboard/components/Graph/GraphCollectionObjects.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (app/javascript/vue/tasks/dwc/dashboard/components/Graph/GraphPanel.vue) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~74 LoC) · ×2
  • Dead file (~74 LoC) app/javascript/vue/components/radials/mixins/shortcuts.js — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~74 LoC) app/javascript/vue/tasks/dwca_import/components/VirtualPagination.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~70 LoC) · ×2
  • Dead file (~70 LoC) app/javascript/vue/tasks/digitize/components/shared/sortComponenets.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~70 LoC) app/javascript/vue/tasks/unify/objects/components/PreviewMergeTable.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~65 LoC) · ×2
  • Dead file (~65 LoC) app/javascript/vue/components/Filter/Facets/CollectingEvent/FacetCollectingEvent/AttributeForm.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~65 LoC) app/javascript/vue/tasks/images/browse/components/Viewer/ViewerViewpointScalebar.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~53 LoC) · ×2
  • Dead file (~53 LoC) app/javascript/vue/components/radials/annotator/components/shared/switch.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~53 LoC) app/javascript/vue/tasks/dwc/dashboard/components/Collector/CollectorTable.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~47 LoC) · ×2
  • Dead file (~47 LoC) app/javascript/vue/components/autosave.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~47 LoC) app/javascript/vue/components/list/VListItemControl.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
AC3 · Page structure · Empty <h2> heading · ×1
  • Empty <h2> heading app/javascript/vue/tasks/unify/people/components/CompareTable.vue:5 — An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it's decorative.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (1.0 · ×1
  • Low contrast colour pair in CSS (1.0:1) app/javascript/vue/tasks/nomenclature/new_combination/components/newCombination.vue:313 — `hr` sets color: #f5f5f5 on background-color: #f5f5f5 — 1.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Focus outline removed in CSS without a · ×1
  • Focus outline removed in CSS without a :focus replacement app/javascript/vue/tasks/otus/browse/components/Panel/PanelDescendants/PanelDescendantsExpand.vue:73 — `.button-expand` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
D1 · Cyclomatic Complexity · Taxon.import (cyclomatic 105) · ×1
  • Taxon.import (cyclomatic 105) app/models/dataset_record/darwin_core/taxon.rb:49 — Taxon.import has cyclomatic complexity 105 (threshold 15). To reduce it, separate the cases: extract each independent 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 · Occurrence.import (cyclomatic 67) · ×1
  • Occurrence.import (cyclomatic 67) app/models/dataset_record/darwin_core/occurrence.rb:311 — Occurrence.import has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent 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 · FromObservationMatrix.get_descriptor_hash (cyclomatic 62) · ×1
  • FromObservationMatrix.get_descriptor_hash (cyclomatic 62) lib/tools/description/from_observation_matrix.rb:241 — FromObservationMatrix.get_descriptor_hash has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · InteractiveKey.useful_descriptors (cyclomatic 60) · ×1
  • InteractiveKey.useful_descriptors (cyclomatic 60) lib/tools/interactive_key.rb:478 — InteractiveKey.useful_descriptors has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent 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 · Person.merge_with (cyclomatic 56) · ×1
  • Person.merge_with (cyclomatic 56) app/models/person.rb:203 — Person.merge_with has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Dates.date_regex_from_verbatim_label (cyclomatic 51) · ×1
  • Dates.date_regex_from_verbatim_label (cyclomatic 51) REDACTED:755 — Dates.date_regex_from_verbatim_label has cyclomatic complexity 51 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Checklist.perform_staging (cyclomatic 44) · ×1
  • Checklist.perform_staging (cyclomatic 44) app/models/import_dataset/darwin_core/checklist.rb:38 — Checklist.perform_staging has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Geo.coordinates_regex_from_verbatim_label (cyclomatic 41) · ×1
  • Geo.coordinates_regex_from_verbatim_label (cyclomatic 41) lib/utilities/geo.rb:634 — Geo.coordinates_regex_from_verbatim_label has cyclomatic complexity 41 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Occurrence.parse_taxon_class (cyclomatic 37) · ×1
  • Occurrence.parse_taxon_class (cyclomatic 37) app/models/dataset_record/darwin_core/occurrence.rb:1520 — Occurrence.parse_taxon_class has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Occurrence.parse_typestatus (cyclomatic 36) · ×1
  • Occurrence.parse_typestatus (cyclomatic 36) app/models/dataset_record/darwin_core/occurrence.rb:1299 — Occurrence.parse_typestatus has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · InteractiveKey.remaining_taxa (cyclomatic 36) · ×1
  • InteractiveKey.remaining_taxa (cyclomatic 36) lib/tools/interactive_key.rb:353 — InteractiveKey.remaining_taxa has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · TaxonNameClassification.process_batch_by_filter_scope (cyclomatic 35) · ×1
  • TaxonNameClassification.process_batch_by_filter_scope (cyclomatic 35) REDACTED:320 — TaxonNameClassification.process_batch_by_filter_scope has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Occurrence.parse_event_class (cyclomatic 32) · ×1
  • Occurrence.parse_event_class (cyclomatic 32) app/models/dataset_record/darwin_core/occurrence.rb:1050 — Occurrence.parse_event_class has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Dates.extract_dates (cyclomatic 32) · ×1
  • Dates.extract_dates (cyclomatic 32) REDACTED:569 — Dates.extract_dates has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · make_role_list_sortable (cyclomatic 32) · ×1
  • make_role_list_sortable (cyclomatic 32) REDACTED:280 — make_role_list_sortable has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 3 of the 32 points are its own statements and the rest belongs to 9 function items inside it that branch (onDragOver, onDrop, a function literal at line 393, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · GisHelper.add_distribution_geo_json (cyclomatic 31) · ×1
  • GisHelper.add_distribution_geo_json (cyclomatic 31) app/helpers/otus/gis_helper.rb:254 — GisHelper.add_distribution_geo_json has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Attribution.process_batch_by_filter_scope (cyclomatic 31) · ×1
  • Attribution.process_batch_by_filter_scope (cyclomatic 31) app/models/attribution.rb:61 — Attribution.process_batch_by_filter_scope has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · MaterialExamined.render_group (cyclomatic 30) · ×1
  • MaterialExamined.render_group (cyclomatic 30) lib/utilities/material_examined.rb:187 — MaterialExamined.render_group has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Occurrence.parse_record_level_class (cyclomatic 28) · ×1
  • Occurrence.parse_record_level_class (cyclomatic 28) app/models/dataset_record/darwin_core/occurrence.rb:814 — Occurrence.parse_record_level_class has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Dates.date_sql_from_params (cyclomatic 28) · ×1
  • Dates.date_sql_from_params (cyclomatic 28) REDACTED:245 — Dates.date_sql_from_params has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · AssertedDistribution.records_include_citation (cyclomatic 27) · ×1
  • AssertedDistribution.records_include_citation (cyclomatic 27) REDACTED:418 — AssertedDistribution.records_include_citation has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · FromObservationMatrix.get_diagnosis (cyclomatic 27) · ×1
  • FromObservationMatrix.get_diagnosis (cyclomatic 27) lib/tools/description/from_observation_matrix.rb:418 — FromObservationMatrix.get_diagnosis has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ImportProtonym.get_protonym (cyclomatic 26) · ×1
  • ImportProtonym.get_protonym (cyclomatic 26) app/models/dataset_record/darwin_core/occurrence.rb:133 — ImportProtonym.get_protonym has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FieldOccurrence.records_include_taxon_determination (cyclomatic 26) · ×1
  • FieldOccurrence.records_include_taxon_determination (cyclomatic 26) app/models/field_occurrence.rb:173 — FieldOccurrence.records_include_taxon_determination has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · Otu.taxa_by_geographic_area (cyclomatic 26) · ×1
  • Otu.taxa_by_geographic_area (cyclomatic 26) app/models/otu.rb:574 — Otu.taxa_by_geographic_area has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Annotation.annotations_hash (cyclomatic 25) · ×1
  • Annotation.annotations_hash (cyclomatic 25) app/models/concerns/shared/is_data/annotation.rb:152 — Annotation.annotations_hash has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · ImageMatrix.row_hash_initiate (cyclomatic 24) · ×1
  • ImageMatrix.row_hash_initiate (cyclomatic 24) lib/tools/image_matrix.rb:302 — ImageMatrix.row_hash_initiate has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · TaxonName.iczn_author_and_year (cyclomatic 23) · ×1
  • TaxonName.iczn_author_and_year (cyclomatic 23) REDACTED:1470 — TaxonName.iczn_author_and_year has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Data.cleanup (cyclomatic 23) · ×1
  • Data.cleanup (cyclomatic 23) lib/export/dwca/occurrence/data.rb:605 — Data.cleanup has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · Material.create_quick_verbatim (cyclomatic 23) · ×1
  • Material.create_quick_verbatim (cyclomatic 23) lib/material.rb:9 — Material.create_quick_verbatim has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · removeObservation.default (cyclomatic 23) · ×1
  • removeObservation.default (cyclomatic 23) app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/removeObservation.js:6 — removeObservation.default has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 10 function items inside it that branch (getFindCallback, removeObservation, a function literal at line 46, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · (anonymous) (cyclomatic 23) · ×1
  • (anonymous) (cyclomatic 23) app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/removeObservation.js:6 — (anonymous) has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 12 function items inside it that branch (getFindCallback, removeObservation, a function literal at line 46, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · Unify.unify (cyclomatic 22) · ×1
  • Unify.unify (cyclomatic 22) app/models/concerns/shared/unify.rb:114 — Unify.unify has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LoanItem.process_batch_by_filter_scope (cyclomatic 22) · ×1
  • LoanItem.process_batch_by_filter_scope (cyclomatic 22) REDACTED:170 — LoanItem.process_batch_by_filter_scope has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · initialize_citation_topic_picker (cyclomatic 22) · ×1
  • initialize_citation_topic_picker (cyclomatic 22) app/assets/javascripts/views/citations/_topic_picker.js:1 — initialize_citation_topic_picker has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 25 function items inside it that branch (a function literal at line 70, bind_remove_citation_topic_links, a function literal at line 171, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · GeographicArea.categorize (cyclomatic 21) · ×1
  • GeographicArea.categorize (cyclomatic 21) REDACTED:322 — GeographicArea.categorize has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Instance.sv_validate_name (cyclomatic 21) · ×1
  • Instance.sv_validate_name (cyclomatic 21) app/models/protonym/soft_validation_extensions.rb:407 — Instance.sv_validate_name has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · Format.full_name_hash (cyclomatic 20) · ×1
  • Format.full_name_hash (cyclomatic 20) app/models/protonym/format.rb:215 — Format.full_name_hash 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 · TaxonName.sv_missing_original_publication (cyclomatic 20) · ×1
  • TaxonName.sv_missing_original_publication (cyclomatic 20) REDACTED:1850 — TaxonName.sv_missing_original_publication 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 · FromObservationMatrix.get_description (cyclomatic 19) · ×1
  • FromObservationMatrix.get_description (cyclomatic 19) lib/tools/description/from_observation_matrix.rb:370 — FromObservationMatrix.get_description has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Container.scaffold (cyclomatic 18) · ×1
  • Container.scaffold (cyclomatic 18) REDACTED:216 — Container.scaffold 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 · Isbn.using_isbn_class (cyclomatic 18) · ×1
  • Isbn.using_isbn_class (cyclomatic 18) app/models/identifier/global/isbn.rb:33 — Isbn.using_isbn_class 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 · Protonym.name_with_alternative_spelling (cyclomatic 18) · ×1
  • Protonym.name_with_alternative_spelling (cyclomatic 18) REDACTED:593 — Protonym.name_with_alternative_spelling 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 · Protonym.sv_cached_names (cyclomatic 18) · ×1
  • Protonym.sv_cached_names (cyclomatic 18) REDACTED:960 — Protonym.sv_cached_names has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · Instance.sv_potential_species_homonyms (cyclomatic 18) · ×1
  • Instance.sv_potential_species_homonyms (cyclomatic 18) app/models/protonym/soft_validation_extensions.rb:1426 — Instance.sv_potential_species_homonyms 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 · Filter.included_annotator_facets (cyclomatic 18) · ×1
  • Filter.included_annotator_facets (cyclomatic 18) REDACTED:446 — Filter.included_annotator_facets 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 · Vocabulary.words (cyclomatic 18) · ×1
  • Vocabulary.words (cyclomatic 18) lib/vocabulary.rb:5 — Vocabulary.words 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 · useFieldSync (cyclomatic 18) · ×1
  • useFieldSync (cyclomatic 18) app/javascript/vue/tasks/data_attributes/field_synchronize/composables/useFieldSync.js:29 — useFieldSync has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 15 function items inside it that branch (a function literal at line 61, a function literal at line 83, a function literal at line 94, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · Attribution.apply_replace_attribution (cyclomatic 17) · ×1
  • Attribution.apply_replace_attribution (cyclomatic 17) app/models/attribution.rb:348 — Attribution.apply_replace_attribution has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Citation.sv_page_range (cyclomatic 17) · ×1
  • Citation.sv_page_range (cyclomatic 17) REDACTED:240 — Citation.sv_page_range has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Identifier.process_batch_by_filter_scope (cyclomatic 17) · ×1
  • Identifier.process_batch_by_filter_scope (cyclomatic 17) REDACTED:139 — Identifier.process_batch_by_filter_scope has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Protonym.predicted_child_rank (cyclomatic 17) · ×1
  • Protonym.predicted_child_rank (cyclomatic 17) REDACTED:380 — Protonym.predicted_child_rank has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Instance.sv_species_gender_agreement (cyclomatic 17) · ×1
  • Instance.sv_species_gender_agreement (cyclomatic 17) app/models/protonym/soft_validation_extensions.rb:504 — Instance.sv_species_gender_agreement has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · DataAttributesInterpreter.build_da_for_otus (cyclomatic 17) · ×1
  • DataAttributesInterpreter.build_da_for_otus (cyclomatic 17) lib/batch_load/import/otus/data_attributes_interpreter.rb:34 — DataAttributesInterpreter.build_da_for_otus has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Migrator.migrate_all (cyclomatic 17) · ×1
  • Migrator.migrate_all (cyclomatic 17) lib/project_unification/migrator.rb:39 — Migrator.migrate_all has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Attributes.attribute_facet (cyclomatic 17) · ×1
  • Attributes.attribute_facet (cyclomatic 17) lib/queries/concerns/attributes.rb:253 — Attributes.attribute_facet has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · ImageMatrix.descriptors_hash_initiate (cyclomatic 17) · ×1
  • ImageMatrix.descriptors_hash_initiate (cyclomatic 17) lib/tools/image_matrix.rb:368 — ImageMatrix.descriptors_hash_initiate has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · makeItem (cyclomatic 17) · ×1
  • makeItem (cyclomatic 17) app/javascript/vue/components/LightTable/composables/useLightTable.js:56 — makeItem has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · useZoomStack (cyclomatic 17) · ×1
  • useZoomStack (cyclomatic 17) app/javascript/vue/tasks/containers/collection_layout/composables/useZoomStack.js:15 — useZoomStack has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 17 function items inside it that branch (a function literal at line 40, drillInto, navigateTo, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · AnnotationsHelper.annotations_exist (cyclomatic 16) · ×1
  • AnnotationsHelper.annotations_exist (cyclomatic 16) app/helpers/annotations_helper.rb:60 — AnnotationsHelper.annotations_exist has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · OtuContentsHelper.get_otu_contents (cyclomatic 16) · ×1
  • OtuContentsHelper.get_otu_contents (cyclomatic 16) app/helpers/observation_matrices/export/otu_contents_helper.rb:5 — OtuContentsHelper.get_otu_contents 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 · CollectionObjects.build_collection_objects (cyclomatic 16) · ×1
  • CollectionObjects.build_collection_objects (cyclomatic 16) lib/batch_load/import/collection_objects.rb:24 — CollectionObjects.build_collection_objects has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · NomenInterpreter.build_taxon_names (cyclomatic 16) · ×1
  • NomenInterpreter.build_taxon_names (cyclomatic 16) lib/batch_load/import/taxon_names/nomen_interpreter.rb:54 — NomenInterpreter.build_taxon_names 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 · ControlledVocabularyTermHandler.migrate (cyclomatic 16) · ×1
  • ControlledVocabularyTermHandler.migrate (cyclomatic 16) lib/project_unification/special_handlers.rb:423 — ControlledVocabularyTermHandler.migrate 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 · BiologicalAssociation.subject_object_scope (cyclomatic 16) · ×1
  • BiologicalAssociation.subject_object_scope (cyclomatic 16) lib/queries/biological_association/filter.rb:1082 — BiologicalAssociation.subject_object_scope has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · DataAttributes.data_attribute_row_facet (cyclomatic 16) · ×1
  • DataAttributes.data_attribute_row_facet (cyclomatic 16) lib/queries/concerns/data_attributes.rb:276 — DataAttributes.data_attribute_row_facet 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 · loadDataSetRecords.default (cyclomatic 16) · ×1
  • loadDataSetRecords.default (cyclomatic 16) app/javascript/vue/tasks/dwca_import/store/actions/loadDataSetRecords.js:8 — loadDataSetRecords.default has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 9, 46). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · removeObservation.default (cyclomatic 16) · ×1
  • removeObservation.default (cyclomatic 16) app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/removeObservation.js:5 — removeObservation.default has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 9 function items inside it that branch (getFindCallback, removeObservation, getObservationListByType, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D15 · Churn × Complexity Hotspots · Repeated repair · ×1
  • Repeated repair: app/models/import_dataset/darwin_core.rb app/models/import_dataset/darwin_core.rb:134 — app/models/import_dataset/darwin_core.rb changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is DarwinCore.import at line 134), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “Fix JSON key collisions in Darwin Core importers”; “Fix DwC import string delimiter handling”; “Fix model-specific Darwin Core predicate imports”. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 09:49:51 -06:00' --until='2026-11-16 09:49:51 -06:00' --full-history --no-merges -- app/models/import_dataset/darwin_core.rb`: 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 · TodoComment repeated across 11 files · ×1
  • TodoComment repeated across 11 files spec/lib/export/coldp_spec.rb:18 — The identical TodoComment appears in 11 files (12 occurrences) — almost certainly one boilerplate line from a single migration or decision, not 12 independent debts. Fix the systemic cause once rather than file-by-file. Text: "# TODO:". Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)
D2 · Cognitive Complexity · Taxon.import (cognitive 215) · ×1
  • Taxon.import (cognitive 215) app/models/dataset_record/darwin_core/taxon.rb:49 — Taxon.import has cognitive complexity 215 (threshold 15). Drivers by points: if/else 71 (172 pts), boolean chains 19, ternaries 6 (14 pts), error handling 3 (6 pts), loops 1 (4 pts) (nesting depth added 115). 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 · Person.merge_with (cognitive 137) · ×1
  • Person.merge_with (cognitive 137) app/models/person.rb:203 — Person.merge_with has cognitive complexity 137 (threshold 15). Drivers by points: if/else 41 (117 pts), boolean chains 15, match/switch 1 (3 pts), error handling 1 (2 pts) (nesting depth added 79). 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 · InteractiveKey.useful_descriptors (cognitive 115) · ×1
  • InteractiveKey.useful_descriptors (cognitive 115) lib/tools/interactive_key.rb:478 — InteractiveKey.useful_descriptors has cognitive complexity 115 (threshold 15). Drivers by points: if/else 44 (97 pts), boolean chains 10, ternaries 4 (6 pts), match/switch 2 (nesting depth added 55). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Occurrence.import (cognitive 110) · ×1
  • Occurrence.import (cognitive 110) app/models/dataset_record/darwin_core/occurrence.rb:311 — Occurrence.import has cognitive complexity 110 (threshold 15). Drivers by points: if/else 38 (73 pts), boolean chains 22, error handling 3 (6 pts), ternaries 4 (6 pts), loops 1 (3 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FromObservationMatrix.get_descriptor_hash (cognitive 79) · ×1
  • FromObservationMatrix.get_descriptor_hash (cognitive 79) lib/tools/description/from_observation_matrix.rb:241 — FromObservationMatrix.get_descriptor_hash has cognitive complexity 79 (threshold 15). Drivers by points: if/else 32 (49 pts), boolean chains 30 (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 · Instance.sv_potential_species_homonyms (cognitive 77) · ×1
  • Instance.sv_potential_species_homonyms (cognitive 77) app/models/protonym/soft_validation_extensions.rb:1426 — Instance.sv_potential_species_homonyms has cognitive complexity 77 (threshold 15). Drivers by points: ternaries 8 (44 pts), if/else 10 (31 pts), boolean chains 2 (nesting depth added 57). 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 · Attribution.process_batch_by_filter_scope (cognitive 62) · ×1
  • Attribution.process_batch_by_filter_scope (cognitive 62) app/models/attribution.rb:61 — Attribution.process_batch_by_filter_scope has cognitive complexity 62 (threshold 15). Drivers by points: if/else 26 (52 pts), boolean chains 9, match/switch 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Dates.date_regex_from_verbatim_label (cognitive 59) · ×1
  • Dates.date_regex_from_verbatim_label (cognitive 59) REDACTED:755 — Dates.date_regex_from_verbatim_label has cognitive complexity 59 (threshold 15). Drivers by points: if/else 38 (42 pts), boolean chains 17 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · TaxonNameClassification.process_batch_by_filter_scope (cognitive 58) · ×1
  • TaxonNameClassification.process_batch_by_filter_scope (cognitive 58) REDACTED:320 — TaxonNameClassification.process_batch_by_filter_scope has cognitive complexity 58 (threshold 15). Drivers by points: if/else 25 (47 pts), boolean chains 10, match/switch 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 · InteractiveKey.remaining_taxa (cognitive 58) · ×1
  • InteractiveKey.remaining_taxa (cognitive 58) lib/tools/interactive_key.rb:353 — InteractiveKey.remaining_taxa has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 12, ternaries 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Checklist.perform_staging (cognitive 57) · ×1
  • Checklist.perform_staging (cognitive 57) app/models/import_dataset/darwin_core/checklist.rb:38 — Checklist.perform_staging has cognitive complexity 57 (threshold 15). Drivers by points: if/else 26 (47 pts), boolean chains 9, ternaries 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Occurrence.parse_record_level_class (cognitive 53) · ×1
  • Occurrence.parse_record_level_class (cognitive 53) app/models/dataset_record/darwin_core/occurrence.rb:814 — Occurrence.parse_record_level_class has cognitive complexity 53 (threshold 15). Drivers by points: if/else 29 (49 pts), boolean chains 4 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Instance.sv_species_gender_agreement (cognitive 53) · ×1
  • Instance.sv_species_gender_agreement (cognitive 53) app/models/protonym/soft_validation_extensions.rb:504 — Instance.sv_species_gender_agreement has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (47 pts), boolean chains 6 (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Geo.coordinates_regex_from_verbatim_label (cognitive 50) · ×1
  • Geo.coordinates_regex_from_verbatim_label (cognitive 50) lib/utilities/geo.rb:634 — Geo.coordinates_regex_from_verbatim_label has cognitive complexity 50 (threshold 15). Drivers by points: if/else 39 (45 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · LoanItem.process_batch_by_filter_scope (cognitive 48) · ×1
  • LoanItem.process_batch_by_filter_scope (cognitive 48) REDACTED:170 — LoanItem.process_batch_by_filter_scope has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (44 pts), boolean chains 3, match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Occurrence.parse_typestatus (cognitive 47) · ×1
  • Occurrence.parse_typestatus (cognitive 47) app/models/dataset_record/darwin_core/occurrence.rb:1299 — Occurrence.parse_typestatus has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (38 pts), boolean chains 8, error handling 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TaxonName.sv_missing_original_publication (cognitive 47) · ×1
  • TaxonName.sv_missing_original_publication (cognitive 47) REDACTED:1850 — TaxonName.sv_missing_original_publication has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (22 pts), ternaries 4 (18 pts), boolean chains 7 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · MaterialExamined.render_group (cognitive 46) · ×1
  • MaterialExamined.render_group (cognitive 46) lib/utilities/material_examined.rb:187 — MaterialExamined.render_group has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 9 (21 pts), if/else 15 (19 pts), boolean chains 6 (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 · ImportProtonym.get_protonym (cognitive 43) · ×1
  • ImportProtonym.get_protonym (cognitive 43) app/models/dataset_record/darwin_core/occurrence.rb:133 — ImportProtonym.get_protonym has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (38 pts), boolean chains 5 (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 · make_role_list_sortable (cognitive 40) · ×1
  • make_role_list_sortable (cognitive 40) REDACTED:280 — make_role_list_sortable has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (31 pts), boolean chains 6, error handling 1, loops 1, ternaries 1 (nesting depth added 9). Most of this is not in the body itself: 2 of the 40 points are its own statements and the rest belongs to 9 function items inside it that branch (onDragOver, onDrop, a function literal at line 393, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · PapertrailHelper.get_diffs (cognitive 37) · ×1
  • PapertrailHelper.get_diffs (cognitive 37) app/helpers/plugins/papertrail_helper.rb:42 — PapertrailHelper.get_diffs has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 22). 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 · TaxonName.iczn_author_and_year (cognitive 37) · ×1
  • TaxonName.iczn_author_and_year (cognitive 37) REDACTED:1470 — TaxonName.iczn_author_and_year has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 7, ternaries 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Dates.date_sql_from_params (cognitive 37) · ×1
  • Dates.date_sql_from_params (cognitive 37) REDACTED:245 — Dates.date_sql_from_params has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 18 (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 · Citation.sv_page_range (cognitive 35) · ×1
  • Citation.sv_page_range (cognitive 35) REDACTED:240 — Citation.sv_page_range has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 4 (14 pts), boolean chains 6 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Identifier.process_batch_by_filter_scope (cognitive 35) · ×1
  • Identifier.process_batch_by_filter_scope (cognitive 35) REDACTED:139 — Identifier.process_batch_by_filter_scope has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 4, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Filter.included_annotator_facets (cognitive 34) · ×1
  • Filter.included_annotator_facets (cognitive 34) REDACTED:446 — Filter.included_annotator_facets has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (34 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 · FromObservationMatrix.get_diagnosis (cognitive 34) · ×1
  • FromObservationMatrix.get_diagnosis (cognitive 34) lib/tools/description/from_observation_matrix.rb:418 — FromObservationMatrix.get_diagnosis has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 9, loops 2 (3 pts), match/switch 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.
D2 · Cognitive Complexity · Occurrence.parse_event_class (cognitive 32) · ×1
  • Occurrence.parse_event_class (cognitive 32) app/models/dataset_record/darwin_core/occurrence.rb:1050 — Occurrence.parse_event_class has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 15, if/else 9 (13 pts), error handling 2 (4 pts) (nesting depth added 6). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · Occurrence.parse_taxon_class (cognitive 32) · ×1
  • Occurrence.parse_taxon_class (cognitive 32) app/models/dataset_record/darwin_core/occurrence.rb:1520 — Occurrence.parse_taxon_class has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (20 pts), ternaries 3 (7 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · Isbn.using_isbn_class (cognitive 32) · ×1
  • Isbn.using_isbn_class (cognitive 32) app/models/identifier/global/isbn.rb:33 — Isbn.using_isbn_class has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 7 (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 · Geo.significant_digits (cognitive 32) · ×1
  • Geo.significant_digits (cognitive 32) lib/utilities/geo.rb:505 — Geo.significant_digits has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (32 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Lccn.using_iccn_class (cognitive 31) · ×1
  • Lccn.using_iccn_class (cognitive 31) app/models/identifier/global/lccn.rb:25 — Lccn.using_iccn_class has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Protonym.name_with_alternative_spelling (cognitive 31) · ×1
  • Protonym.name_with_alternative_spelling (cognitive 31) REDACTED:593 — Protonym.name_with_alternative_spelling has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (29 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 · Protonym.list_of_coordinated_names (cognitive 30) · ×1
  • Protonym.list_of_coordinated_names (cognitive 30) REDACTED:254 — Protonym.list_of_coordinated_names has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (23 pts), ternaries 1 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Gazetteer.process_shape_file (cognitive 29) · ×1
  • Gazetteer.process_shape_file (cognitive 29) REDACTED:474 — Gazetteer.process_shape_file has cognitive complexity 29 (threshold 15). Drivers by points: error handling 5 (15 pts), if/else 5 (7 pts), ternaries 3 (6 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Geo.conform_significant (cognitive 29) · ×1
  • Geo.conform_significant (cognitive 29) lib/utilities/geo.rb:569 — Geo.conform_significant has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (7 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Unify.unify (cognitive 28) · ×1
  • Unify.unify (cognitive 28) app/models/concerns/shared/unify.rb:114 — Unify.unify has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), error handling 2 (5 pts), boolean chains 3, match/switch 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 · Format.full_name_hash (cognitive 28) · ×1
  • Format.full_name_hash (cognitive 28) app/models/protonym/format.rb:215 — Format.full_name_hash has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 8 (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 · Vocabulary.words (cognitive 28) · ×1
  • Vocabulary.words (cognitive 28) lib/vocabulary.rb:5 — Vocabulary.words has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · applyOtu.classifyApplyOtu (cognitive 28) · ×1
  • applyOtu.classifyApplyOtu (cognitive 28) app/javascript/vue/tasks/images/light_table/adapters/applyOtu.js:30 — applyOtu.classifyApplyOtu has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 1 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). Of this number, 25 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CollectionObject.co_attributes (cognitive 27) · ×1
  • CollectionObject.co_attributes (cognitive 27) app/models/collection_object.rb:486 — CollectionObject.co_attributes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (27 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · TaxonNameRelationship.validate_subject_and_object_ranks (cognitive 27) · ×1
  • TaxonNameRelationship.validate_subject_and_object_ranks (cognitive 27) app/models/taxon_name_relationship.rb:416 — TaxonNameRelationship.validate_subject_and_object_ranks has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 5 (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 · Occurrence.parse_identification_class (cognitive 26) · ×1
  • Occurrence.parse_identification_class (cognitive 26) app/models/dataset_record/darwin_core/occurrence.rb:1448 — Occurrence.parse_identification_class has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (23 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Instance.sv_validate_name (cognitive 26) · ×1
  • Instance.sv_validate_name (cognitive 26) app/models/protonym/soft_validation_extensions.rb:407 — Instance.sv_validate_name has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 15, if/else 4 (8 pts), ternaries 1 (3 pts) (nesting depth added 6). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · Import.create (cognitive 26) · ×1
  • Import.create (cognitive 26) lib/batch_load/import.rb:188 — Import.create has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (23 pts), error handling 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pasteValue (cognitive 26) · ×1
  • pasteValue (cognitive 26) app/javascript/vue/tasks/data_attributes/multi_update/store/store.js:65 — pasteValue has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (19 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 15). Of this number, 25 points are the body's own statements and 1 belongs to 3 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · AssertedDistribution.records_include_citation (cognitive 25) · ×1
  • AssertedDistribution.records_include_citation (cognitive 25) REDACTED:418 — AssertedDistribution.records_include_citation has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 22, if/else 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · FieldOccurrence.records_include_taxon_determination (cognitive 25) · ×1
  • FieldOccurrence.records_include_taxon_determination (cognitive 25) app/models/field_occurrence.rb:173 — FieldOccurrence.records_include_taxon_determination has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 22, if/else 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · Protonym.predicted_child_rank (cognitive 25) · ×1
  • Protonym.predicted_child_rank (cognitive 25) REDACTED:380 — Protonym.predicted_child_rank has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Instance.sv_potential_genus_homonyms (cognitive 25) · ×1
  • Instance.sv_potential_genus_homonyms (cognitive 25) app/models/protonym/soft_validation_extensions.rb:1409 — Instance.sv_potential_genus_homonyms has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (15 pts), ternaries 2 (8 pts), boolean chains 2 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · NomenInterpreter.build_taxon_names (cognitive 25) · ×1
  • NomenInterpreter.build_taxon_names (cognitive 25) lib/batch_load/import/taxon_names/nomen_interpreter.rb:54 — NomenInterpreter.build_taxon_names has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (20 pts), error handling 2 (4 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 · DataAttributes.data_attribute_row_facet (cognitive 25) · ×1
  • DataAttributes.data_attribute_row_facet (cognitive 25) lib/queries/concerns/data_attributes.rb:276 — DataAttributes.data_attribute_row_facet has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 2 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · OtuContentsHelper.get_otu_contents (cognitive 24) · ×1
  • OtuContentsHelper.get_otu_contents (cognitive 24) app/helpers/observation_matrices/export/otu_contents_helper.rb:5 — OtuContentsHelper.get_otu_contents has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (24 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 · Annotation.annotations_hash (cognitive 24) · ×1
  • Annotation.annotations_hash (cognitive 24) app/models/concerns/shared/is_data/annotation.rb:152 — Annotation.annotations_hash has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 12, if/else 12. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · ColumnResolver.shape (cognitive 24) · ×1
  • ColumnResolver.shape (cognitive 24) lib/batch_load/column_resolver.rb:142 — ColumnResolver.shape has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), error handling 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · useBiologicalAssociationAnatomicalParts.useBiologicalAssociationAnatomicalParts.mapAnatomicalPartAttributesToAssociationSides (cognitive 24) · ×1
  • useBiologicalAssociationAnatomicalParts.useBiologicalAssociationAnatomicalParts.mapAnatomicalPartAttributesToAssociationSides (cognitive 24) app/javascript/vue/components/radials/object/components/biological_relationships/composables/useBiologicalAssociationAnatomicalParts.js:308 — useBiologicalAssociationAnatomicalParts.useBiologicalAssociationAnatomicalParts.mapAnatomicalPartAttributesToAssociationSides has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · useBiologicalAssociationAnatomicalParts.mapAnatomicalPartAttributesToAssociationSides (cognitive 24) · ×1
  • useBiologicalAssociationAnatomicalParts.mapAnatomicalPartAttributesToAssociationSides (cognitive 24) app/javascript/vue/components/radials/object/components/biological_relationships/composables/useBiologicalAssociationAnatomicalParts.js:308 — useBiologicalAssociationAnatomicalParts.mapAnatomicalPartAttributesToAssociationSides has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · useFieldSync (cognitive 24) · ×1
  • useFieldSync (cognitive 24) app/javascript/vue/tasks/data_attributes/field_synchronize/composables/useFieldSync.js:29 — useFieldSync has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, ternaries 4 (6 pts) (nesting depth added 6). None of this is in the body itself: all 24 points belong to 15 function items inside it that branch (a function literal at line 61, a function literal at line 83, a function literal at line 418, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · initialize_citation_topic_picker (cognitive 24) · ×1
  • initialize_citation_topic_picker (cognitive 24) app/assets/javascripts/views/citations/_topic_picker.js:1 — initialize_citation_topic_picker has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 2, ternaries 2, error handling 1 (nesting depth added 3). None of this is in the body itself: all 24 points belong to 25 function items inside it that branch (a function literal at line 171, a function literal at line 70, bind_remove_citation_topic_links, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · GisHelper.add_distribution_geo_json (cognitive 23) · ×1
  • GisHelper.add_distribution_geo_json (cognitive 23) app/helpers/otus/gis_helper.rb:254 — GisHelper.add_distribution_geo_json has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 8 (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 · Instance.sv_single_sub_taxon (cognitive 23) · ×1
  • Instance.sv_single_sub_taxon (cognitive 23) app/models/protonym/soft_validation_extensions.rb:1262 — Instance.sv_single_sub_taxon has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, ternaries 1 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ColumnResolver.otu (cognitive 23) · ×1
  • ColumnResolver.otu (cognitive 23) lib/batch_load/column_resolver.rb:37 — ColumnResolver.otu has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Attribution.apply_remove_attribution (cognitive 22) · ×1
  • Attribution.apply_remove_attribution (cognitive 22) app/models/attribution.rb:473 — Attribution.apply_remove_attribution has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4, ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Occurrence.attach_occurrence_identifiers (cognitive 22) · ×1
  • Occurrence.attach_occurrence_identifiers (cognitive 22) app/models/dataset_record/darwin_core/occurrence.rb:615 — Occurrence.attach_occurrence_identifiers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Data.cleanup (cognitive 22) · ×1
  • Data.cleanup (cognitive 22) lib/export/dwca/occurrence/data.rb:605 — Data.cleanup has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 13, if/else 9. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · Material.create_quick_verbatim (cognitive 22) · ×1
  • Material.create_quick_verbatim (cognitive 22) lib/material.rb:9 — Material.create_quick_verbatim has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · computeChanges (cognitive 22) · ×1
  • computeChanges (cognitive 22) app/javascript/vue/tasks/images/light_table/adapters/changes.js:11 — computeChanges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4, ternaries 2 (4 pts), other 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CollectingEvent.sv_missing_georeference (cognitive 21) · ×1
  • CollectingEvent.sv_missing_georeference (cognitive 21) REDACTED:1219 — CollectingEvent.sv_missing_georeference has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 2 (nesting depth added 11). 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 · ControlledVocabularyTermHandler.migrate (cognitive 21) · ×1
  • ControlledVocabularyTermHandler.migrate (cognitive 21) lib/project_unification/special_handlers.rb:423 — ControlledVocabularyTermHandler.migrate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, match/switch 1 (3 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FromObservationMatrix.get_description (cognitive 21) · ×1
  • FromObservationMatrix.get_description (cognitive 21) lib/tools/description/from_observation_matrix.rb:370 — FromObservationMatrix.get_description has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, match/switch 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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 · Dates.extract_dates (cognitive 21) · ×1
  • Dates.extract_dates (cognitive 21) REDACTED:569 — Dates.extract_dates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 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 · applyDepictions.default (cognitive 21) · ×1
  • applyDepictions.default (cognitive 21) app/javascript/vue/tasks/images/new_image/store/actions/applyDepictions.js:10 — applyDepictions.default has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 4 (8 pts), boolean chains 4 (nesting depth added 7). Most of this is not in the body itself: 2 of the 21 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 75, a function literal at line 37, createNewCOForStage, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · (anonymous) (cognitive 21) · ×1
  • (anonymous) (cognitive 21) app/javascript/vue/tasks/images/new_image/store/actions/applyDepictions.js:10 — (anonymous) has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 4 (8 pts), boolean chains 4 (nesting depth added 7). Most of this is not in the body itself: 2 of the 21 points are its own statements and the rest belongs to 13 function items inside it that branch (a function literal at line 75, a function literal at line 37, createNewCOForStage, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · UsersController.create (cognitive 20) · ×1
  • UsersController.create (cognitive 20) REDACTED:30 — UsersController.create has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Confidence.process_batch_by_filter_scope (cognitive 20) · ×1
  • Confidence.process_batch_by_filter_scope (cognitive 20) app/models/confidence.rb:48 — Confidence.process_batch_by_filter_scope has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, match/switch 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 · ProtocolRelationship.process_batch_by_filter_scope (cognitive 20) · ×1
  • ProtocolRelationship.process_batch_by_filter_scope (cognitive 20) app/models/protocol_relationship.rb:16 — ProtocolRelationship.process_batch_by_filter_scope has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, match/switch 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 · Instance.sv_potential_family_homonyms (cognitive 20) · ×1
  • Instance.sv_potential_family_homonyms (cognitive 20) app/models/protonym/soft_validation_extensions.rb:1368 — Instance.sv_potential_family_homonyms has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (8 pts), boolean chains 2 (nesting depth added 12). 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 · DataAttributesInterpreter.build_da_for_otus (cognitive 20) · ×1
  • DataAttributesInterpreter.build_da_for_otus (cognitive 20) lib/batch_load/import/otus/data_attributes_interpreter.rb:34 — DataAttributesInterpreter.build_da_for_otus has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (19 pts), error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · Attributes.attribute_facet (cognitive 20) · ×1
  • Attributes.attribute_facet (cognitive 20) lib/queries/concerns/attributes.rb:253 — Attributes.attribute_facet has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, ternaries 1 (2 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · removeObservation.default (cognitive 20) · ×1
  • removeObservation.default (cognitive 20) app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/removeObservation.js:6 — removeObservation.default has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 8 (nesting depth added 1). None of this is in the body itself: all 20 points belong to 10 function items inside it that branch (removeObservation, getFindCallback, getObservationListByRow, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · (anonymous) (cognitive 20) · ×1
  • (anonymous) (cognitive 20) app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/removeObservation.js:6 — (anonymous) has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 8 (nesting depth added 1). None of this is in the body itself: all 20 points belong to 12 function items inside it that branch (removeObservation, getFindCallback, getObservationListByRow, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · CollectionObjects.build_collection_objects (cognitive 19) · ×1
  • CollectionObjects.build_collection_objects (cognitive 19) lib/batch_load/import/collection_objects.rb:24 — CollectionObjects.build_collection_objects has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, match/switch 2 (3 pts), ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · MediaExporter.populate_temp_image_links_table (cognitive 19) · ×1
  • MediaExporter.populate_temp_image_links_table (cognitive 19) lib/export/dwca/occurrence/media_exporter.rb:332 — MediaExporter.populate_temp_image_links_table has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 1, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · Identifiers.match_identifier_order_by (cognitive 19) · ×1
  • Identifiers.match_identifier_order_by (cognitive 19) REDACTED:445 — Identifiers.match_identifier_order_by has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (4 pts) (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · TaxonDetermination.taxon_name_id_facet (cognitive 19) · ×1
  • TaxonDetermination.taxon_name_id_facet (cognitive 19) lib/queries/concerns/taxon_determination.rb:113 — TaxonDetermination.taxon_name_id_facet has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (19 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · ImageMatrix.row_hash_initiate (cognitive 19) · ×1
  • ImageMatrix.row_hash_initiate (cognitive 19) lib/tools/image_matrix.rb:302 — ImageMatrix.row_hash_initiate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7, match/switch 3 (5 pts), boolean chains 4, ternaries 3 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · ImageMatrix.descriptors_hash_initiate (cognitive 19) · ×1
  • ImageMatrix.descriptors_hash_initiate (cognitive 19) lib/tools/image_matrix.rb:368 — ImageMatrix.descriptors_hash_initiate has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (9 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · MaterialExamined.render_month_group (cognitive 19) · ×1
  • MaterialExamined.render_month_group (cognitive 19) lib/utilities/material_examined.rb:321 — MaterialExamined.render_month_group has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · removeObservation.default (cognitive 19) · ×1
  • removeObservation.default (cognitive 19) app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/removeObservation.js:5 — removeObservation.default has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7 (nesting depth added 1). None of this is in the body itself: all 19 points belong to 9 function items inside it that branch (removeObservation, getFindCallback, getObservationListByType, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · (anonymous) (cognitive 19) · ×1
  • (anonymous) (cognitive 19) app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/removeObservation.js:5 — (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7 (nesting depth added 1). None of this is in the body itself: all 19 points belong to 13 function items inside it that branch (removeObservation, getFindCallback, getObservationListByType, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · Instance.sv_parent_priority (cognitive 18) · ×1
  • Instance.sv_parent_priority (cognitive 18) app/models/protonym/soft_validation_extensions.rb:1322 — Instance.sv_parent_priority has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 3 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · TaxonName.name_from_biodiversity_result (cognitive 18) · ×1
  • TaxonName.name_from_biodiversity_result (cognitive 18) REDACTED:1741 — TaxonName.name_from_biodiversity_result has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 3 (5 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CatalogHelper.otu_descendants_and_synonyms (cognitive 17) · ×1
  • CatalogHelper.otu_descendants_and_synonyms (cognitive 17) app/helpers/otus/catalog_helper.rb:62 — CatalogHelper.otu_descendants_and_synonyms has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · OtusHelper.otu_tag (cognitive 17) · ×1
  • OtusHelper.otu_tag (cognitive 17) app/helpers/otus_helper.rb:27 — OtusHelper.otu_tag has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Attribution.apply_replace_attribution (cognitive 17) · ×1
  • Attribution.apply_replace_attribution (cognitive 17) app/models/attribution.rb:348 — Attribution.apply_replace_attribution has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · Otu.taxa_by_geographic_area (cognitive 17) · ×1
  • Otu.taxa_by_geographic_area (cognitive 17) app/models/otu.rb:574 — Otu.taxa_by_geographic_area has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Protonym.sv_cached_names (cognitive 17) · ×1
  • Protonym.sv_cached_names (cognitive 17) REDACTED:960 — Protonym.sv_cached_names has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 13, if/else 4. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · Instance.sv_species_gender_agreement_not_required (cognitive 17) · ×1
  • Instance.sv_species_gender_agreement_not_required (cognitive 17) app/models/protonym/soft_validation_extensions.rb:542 — Instance.sv_species_gender_agreement_not_required has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 5 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Instance.sv_homotypic_synonyms (cognitive 17) · ×1
  • Instance.sv_homotypic_synonyms (cognitive 17) app/models/protonym/soft_validation_extensions.rb:1341 — Instance.sv_homotypic_synonyms has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1 (nesting depth added 9). 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 · Invalidating.similar_homonym_string (cognitive 17) · ×1
  • Invalidating.similar_homonym_string (cognitive 17) app/models/taxon_name_relationship/iczn/invalidating.rb:68 — Invalidating.similar_homonym_string has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · InteractiveKey.descriptors_hash_initiate (cognitive 17) · ×1
  • InteractiveKey.descriptors_hash_initiate (cognitive 17) lib/tools/interactive_key.rb:296 — InteractiveKey.descriptors_hash_initiate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · new.initialize (cognitive 17) · ×1
  • new.initialize (cognitive 17) app/javascript/vanilla/views/project_members/new.js:1 — new.initialize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (2 pts) (nesting depth added 6). None of this is in the body itself: all 17 points belong to 3 function items inside it that branch (a function literal at line 25, a function literal at line 9, handleKeydown). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · useLightTable.useLightTable.placeUnpositioned (cognitive 17) · ×1
  • useLightTable.useLightTable.placeUnpositioned (cognitive 17) app/javascript/vue/components/LightTable/composables/useLightTable.js:169 — useLightTable.useLightTable.placeUnpositioned has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2, ternaries 2 (nesting depth added 4). Of this number, 15 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · useLightTable.placeUnpositioned (cognitive 17) · ×1
  • useLightTable.placeUnpositioned (cognitive 17) app/javascript/vue/components/LightTable/composables/useLightTable.js:169 — useLightTable.placeUnpositioned has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2, ternaries 2 (nesting depth added 4). Of this number, 15 points are the body's own statements and 2 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · saveBiologicalAssociation (cognitive 17) · ×1
  • saveBiologicalAssociation (cognitive 17) app/javascript/vue/tasks/biological_associations/new_ba/store/store.js:234 — saveBiologicalAssociation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 2, boolean chains 1, ternaries 1 (nesting depth added 3). Of this number, 15 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: 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 · saveDataAttributes (cognitive 17) · ×1
  • saveDataAttributes (cognitive 17) app/javascript/vue/tasks/data_attributes/multi_update/store/store.js:113 — saveDataAttributes has cognitive complexity 17 (threshold 15). Drivers by points: error handling 2 (7 pts), if/else 3 (6 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 10). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 125, 115, 132, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · saveDataAttributesFor (cognitive 17) · ×1
  • saveDataAttributesFor (cognitive 17) app/javascript/vue/tasks/data_attributes/multi_update/store/store.js:194 — saveDataAttributesFor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 2 (5 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 7). None of this is in the body itself: all 17 points belong to 8 function literals inside it that branch (lines 206, 225, 196, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · LatLongController.save_selected (cognitive 16) · ×1
  • LatLongController.save_selected (cognitive 16) REDACTED:30 — LatLongController.save_selected has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CollectingEvent.sv_fix_missing_georeference (cognitive 16) · ×1
  • CollectingEvent.sv_fix_missing_georeference (cognitive 16) REDACTED:1252 — CollectingEvent.sv_fix_missing_georeference has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 5, error handling 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Occurrence.parse_occurrence_class (cognitive 16) · ×1
  • Occurrence.parse_occurrence_class (cognitive 16) app/models/dataset_record/darwin_core/occurrence.rb:948 — Occurrence.parse_occurrence_class has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FieldOccurrence.transmute_collection_object (cognitive 16) · ×1
  • FieldOccurrence.transmute_collection_object (cognitive 16) app/models/field_occurrence.rb:103 — FieldOccurrence.transmute_collection_object has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, error handling 3 (6 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · VerbatimData.initialize (cognitive 16) · ×1
  • VerbatimData.initialize (cognitive 16) app/models/georeference/verbatim_data.rb:14 — VerbatimData.initialize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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 · Instance.sv_fix_add_nominotypical_sub (cognitive 16) · ×1
  • Instance.sv_fix_add_nominotypical_sub (cognitive 16) app/models/protonym/soft_validation_extensions.rb:1288 — Instance.sv_fix_add_nominotypical_sub has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (5 pts), match/switch 1 (3 pts), error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TaxonName.nomenclature_date (cognitive 16) · ×1
  • TaxonName.nomenclature_date (cognitive 16) REDACTED:826 — TaxonName.nomenclature_date has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 3 (7 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 · TypeMaterial.sv_type_source (cognitive 16) · ×1
  • TypeMaterial.sv_type_source (cognitive 16) app/models/type_material.rb:138 — TypeMaterial.sv_type_source has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BiologicalAssociation.subject_object_scope (cognitive 16) · ×1
  • BiologicalAssociation.subject_object_scope (cognitive 16) lib/queries/biological_association/filter.rb:1082 — BiologicalAssociation.subject_object_scope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · Filter.all (cognitive 16) · ×1
  • Filter.all (cognitive 16) REDACTED:934 — Filter.all has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · Geo.hunt_lat_long (cognitive 16) · ×1
  • Geo.hunt_lat_long (cognitive 16) lib/utilities/geo.rb:253 — Geo.hunt_lat_long has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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 · useLightTable.useLightTable.packRegion (cognitive 16) · ×1
  • useLightTable.useLightTable.packRegion (cognitive 16) app/javascript/vue/components/LightTable/composables/useLightTable.js:456 — useLightTable.useLightTable.packRegion has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 3 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). Of this number, 12 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · makeItem (cognitive 16) · ×1
  • makeItem (cognitive 16) app/javascript/vue/components/LightTable/composables/useLightTable.js:56 — makeItem has cognitive complexity 16 (threshold 15). Drivers by points: other 13, ternaries 2, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · useLightTable.packRegion (cognitive 16) · ×1
  • useLightTable.packRegion (cognitive 16) app/javascript/vue/components/LightTable/composables/useLightTable.js:456 — useLightTable.packRegion has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 3 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). Of this number, 12 points are the body's own statements and 4 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · useZoomStack (cognitive 16) · ×1
  • useZoomStack (cognitive 16) app/javascript/vue/tasks/containers/collection_layout/composables/useZoomStack.js:15 — useZoomStack has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 4, ternaries 4. None of this is in the body itself: all 16 points belong to 17 function items inside it that branch (a function literal at line 40, drillInto, navigateTo, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · usePackager (cognitive 16) · ×1
  • usePackager (cognitive 16) app/javascript/vue/components/packager/usePackager.js:9 — usePackager has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, error handling 1 (nesting depth added 3). None of this is in the body itself: all 16 points belong to 8 function items inside it that branch (initializeFromParams, a function literal at line 35, loadPreview, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D35 · Change Coupling · Change coupling clique · ×1
  • Change coupling clique: App.vue, ModalEdge.vue, ModalObject.vue, useGraph.js app/javascript/vue/tasks/biological_associations/biological_associations_graph/App.vue — 4 files — `app/javascript/vue/tasks/biological_associations/biological_associations_graph/App.vue`, `app/javascript/vue/tasks/biological_associations/biological_associations_graph/components/ModalEdge.vue`, `app/javascript/vue/tasks/biological_associations/biological_associations_graph/components/ModalObject.vue`, `app/javascript/vue/tasks/biological_associations/biological_associations_graph/composition/useGraph.js` — all change together with no explicit dependency: a fully-connected co-change clique, not 6 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique's coupling clears at once — you do not need to break each pair individually.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Members sharing a duplicated core (20 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (20 members, 50+ identical tokens) REDACTED:44 — REDACTED:44-54 | REDACTED:44-54 | REDACTED:47-57 | REDACTED:62-72 | REDACTED:30-40 | REDACTED:31-42 | REDACTED:34-44 | REDACTED:44-54 | REDACTED:29-39 | REDACTED:72-81 | REDACTED:45-55 | REDACTED:34-44 | REDACTED:43-53 | REDACTED:49-59 | REDACTED:37-47 | REDACTED:44-54 | REDACTED:49-59 | REDACTED:41-51 | REDACTED:30-40 | REDACTED:39-49 — These 20 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 20 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 20 times.
D4 · Code Duplication · Members sharing a duplicated core (18 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (18 members, 50+ identical tokens) REDACTED:74 — REDACTED:74-85 | REDACTED:87-96 | REDACTED:89-98 | REDACTED:84-93 | REDACTED:68-77 | REDACTED:64-73 | REDACTED:89-98 | REDACTED:39-48 | REDACTED:66-76 | REDACTED:131-140 | REDACTED:94-103 | REDACTED:105-114 | REDACTED:72-81 | REDACTED:67-76 | REDACTED:92-101 | REDACTED:93-102 | REDACTED:94-103 | REDACTED:74-83 — These 18 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 18 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 18 times.
D4 · Code Duplication · Members sharing a duplicated core (9 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (9 members, 50+ identical tokens) REDACTED:41 — REDACTED:41-50 | REDACTED:43-53 | REDACTED:30-42 | REDACTED:19-29 | REDACTED:43-53 | REDACTED:36-46 | REDACTED:31-41 | REDACTED:45-55 | REDACTED:63-73 — These 9 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 9 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 9 times.
D4 · Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (5 members, 50+ identical tokens) lib/export/coldp/files/name.rb:484 — lib/export/coldp/files/name.rb:484-514 | lib/export/coldp/files/name.rb:519-552 | lib/export/coldp/files/name.rb:627-680 | lib/export/coldp/files/name.rb:685-722 | lib/export/coldp/files/name.rb:726-768 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication · Edited copy of a member (71 corresponding lines) · ×1
  • Edited copy of a member (71 corresponding lines) app/models/confidence.rb:56 — app/models/confidence.rb:56-128 | app/models/protocol_relationship.rb:24-94 — These two members are one piece of code written twice and then edited apart: 71 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 · Edited copy of a member (62 corresponding lines) · ×1
  • Edited copy of a member (62 corresponding lines) lib/export/coldp/files/name.rb:331 — lib/export/coldp/files/name.rb:331-408 | lib/export/coldp/files/name.rb:419-480 — These two members are one piece of code written twice and then edited apart: 62 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 · Edited copies of one member (5 members, 26+ corresponding lines) · ×1
  • Edited copies of one member (5 members, 26+ corresponding lines) REDACTED:248 — REDACTED:248-273 | REDACTED:292-320 | REDACTED:50-75 | REDACTED:97-125 | app/models/source/human.rb:54-79 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 26 lines, 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 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. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (39 corresponding lines) · ×1
  • Edited copy of a member (39 corresponding lines) app/models/geographic_item.rb:766 — app/models/geographic_item.rb:766-809 | app/models/geographic_item.rb:824-862 — These two members are one piece of code written twice and then edited apart: 39 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 · Edited copy of a member (44 corresponding lines) · ×1
  • Edited copy of a member (44 corresponding lines) REDACTED:427 — REDACTED:427-470 | app/models/field_occurrence.rb:183-227 — These two members are one piece of code written twice and then edited apart: 44 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 · Edited copy of a member (31 corresponding lines) · ×1
  • Edited copy of a member (31 corresponding lines) lib/queries/depiction/filter.rb:115 — lib/queries/depiction/filter.rb:115-145 | lib/queries/image/filter.rb:516-549 — These two members are one piece of code written twice and then edited apart: 31 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 · Edited copy of a member (49 corresponding lines) · ×1
  • Edited copy of a member (49 corresponding lines) lib/export/csv/dwc/extension/checklist/reference.rb:33 — lib/export/csv/dwc/extension/checklist/reference.rb:33-81 | lib/export/csv/dwc/extension/checklist/types_and_specimen.rb:41-98 — These two members are one piece of code written twice and then edited apart: 49 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 · Edited copies of one member (5 members, 16+ corresponding lines) · ×1
  • Edited copies of one member (5 members, 16+ corresponding lines) app/models/biological_association.rb:288 — app/models/biological_association.rb:288-303 | app/models/biological_associations_graph.rb:67-82 | app/models/conveyance.rb:85-100 | app/models/depiction.rb:167-182 | app/models/observation.rb:380-395 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 16 lines, 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 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. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 28+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 28+ corresponding lines) REDACTED:245 — REDACTED:245-272 | REDACTED:276-303 | REDACTED:308-335 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 29+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 29+ corresponding lines) lib/project_unification/special_handlers.rb:218 — lib/project_unification/special_handlers.rb:218-246 | lib/project_unification/special_handlers.rb:281-316 | lib/project_unification/special_handlers.rb:346-381 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 17+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 17+ corresponding lines) REDACTED:627 — REDACTED:627-647 | app/models/organization.rb:119-135 | app/models/person.rb:533-549 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (32 corresponding lines) · ×1
  • Edited copy of a member (32 corresponding lines) lib/export/dwca/occurrence/media_exporter.rb:94 — lib/export/dwca/occurrence/media_exporter.rb:94-132 | lib/export/dwca/occurrence/media_exporter.rb:138-169 — These two members are one piece of code written twice and then edited apart: 32 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 · Edited copies of one member (7 members, 16+ corresponding lines) · ×1
  • Edited copies of one member (7 members, 16+ corresponding lines) app/models/biological_relationship.rb:75 — app/models/biological_relationship.rb:75-91 | app/models/confidence_level.rb:39-54 | REDACTED:414-430 | app/models/keyword.rb:50-65 | app/models/preparation_type.rb:59-77 | app/models/protocol.rb:68-83 | app/models/topic.rb:70-87 — These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 16 lines, 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 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. Left alone, the next edit has to be made 7 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (34 corresponding lines) · ×1
  • Edited copy of a member (34 corresponding lines) app/models/collection_object.rb:427 — app/models/collection_object.rb:427-460 | app/models/collection_object.rb:487-522 — These two members are one piece of code written twice and then edited apart: 34 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 · Edited copy of a member (27 corresponding lines) · ×1
  • Edited copy of a member (27 corresponding lines) REDACTED:418 — REDACTED:418-445 | app/models/protonym/format.rb:146-172 — These two members are one piece of code written twice and then edited apart: 27 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 · Edited copy of a member (17 corresponding lines) · ×1
  • Edited copy of a member (17 corresponding lines) REDACTED:434 — REDACTED:434-450 | REDACTED:455-472 — These two members are one piece of code written twice and then edited apart: 17 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 · Edited copy of a member (16 corresponding lines) · ×1
  • Edited copy of a member (16 corresponding lines) REDACTED:499 — REDACTED:499-517 | app/models/protonym/format.rb:178-193 — These two members are one piece of code written twice and then edited apart: 16 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 · Edited copies of one member (3 members, 24+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 24+ corresponding lines) lib/queries/data_attribute/autocomplete.rb:66 — lib/queries/data_attribute/autocomplete.rb:66-90 | lib/queries/identifier/autocomplete.rb:29-52 | lib/queries/note/autocomplete.rb:49-73 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 17+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 17+ corresponding lines) app/controllers/dwc_occurrences_controller.rb:18 — app/controllers/dwc_occurrences_controller.rb:18-34 | REDACTED:273-289 | REDACTED:134-150 | REDACTED:300-316 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (8 members, 9+ corresponding lines) · ×1
  • Edited copies of one member (8 members, 9+ corresponding lines) REDACTED:42 — REDACTED:42-50 | REDACTED:25-33 | REDACTED:40-48 | REDACTED:70-78 | REDACTED:61-69 | REDACTED:25-33 | REDACTED:25-33 | REDACTED:59-74 — These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 9 lines, 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 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. Left alone, the next edit has to be made 8 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (24 corresponding lines) · ×1
  • Edited copy of a member (24 corresponding lines) lib/queries/collection_object/filter.rb:727 — lib/queries/collection_object/filter.rb:727-750 | lib/queries/field_occurrence/filter.rb:300-323 — These two members are one piece of code written twice and then edited apart: 24 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 · Edited copies of one member (3 members, 18+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 18+ corresponding lines) REDACTED:242 — REDACTED:242-259 | app/helpers/field_occurrences_helper.rb:53-70 | app/helpers/type_materials_helper.rb:25-43 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (5 members, 10+ corresponding lines) · ×1
  • Edited copies of one member (5 members, 10+ corresponding lines) REDACTED:12 — REDACTED:12-27 | REDACTED:11-20 | REDACTED:25-34 | REDACTED:9-18 | REDACTED:10-19 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, 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 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. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 23+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 23+ corresponding lines) lib/queries/biological_association/filter.rb:360 — lib/queries/biological_association/filter.rb:360-382 | lib/queries/biological_associations_graph/filter.rb:109-131 | lib/queries/collecting_event/filter.rb:245-269 | lib/queries/observation/filter.rb:208-230 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 23 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (6 members, 10+ corresponding lines) · ×1
  • Edited copies of one member (6 members, 10+ corresponding lines) REDACTED:48 — REDACTED:48-57 | REDACTED:53-64 | REDACTED:52-62 | REDACTED:62-73 | REDACTED:37-53 | REDACTED:41-51 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 10 lines, 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 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. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 10+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 10+ corresponding lines) REDACTED:31 — REDACTED:31-40 | REDACTED:48-58 | REDACTED:44-54 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 12+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 12+ corresponding lines) REDACTED:85 — REDACTED:85-96 | REDACTED:70-84 | REDACTED:98-109 | REDACTED:91-102 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (7 members, 3+ corresponding lines) · ×1
  • Edited copies of one member (7 members, 3+ corresponding lines) app/models/nomenclatural_rank/icvcn/class_rank.rb:23 — app/models/nomenclatural_rank/icvcn/class_rank.rb:23-25 | app/models/nomenclatural_rank/icvcn/family.rb:23-25 | app/models/nomenclatural_rank/icvcn/genus.rb:8-10 | app/models/nomenclatural_rank/icvcn/order.rb:23-25 | app/models/nomenclatural_rank/icvcn/phylum.rb:23-25 | app/models/nomenclatural_rank/icvcn/species.rb:8-10 | app/models/nomenclatural_rank/icvcn/subfamily.rb:8-10 — These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 3 lines, 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 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. Left alone, the next edit has to be made 7 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 8+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 8+ corresponding lines) lib/tools/description/from_observation_matrix.rb:166 — lib/tools/description/from_observation_matrix.rb:166-173 | lib/tools/image_matrix.rb:239-247 | lib/tools/interactive_key.rb:220-227 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 9+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 9+ corresponding lines) REDACTED:64 — REDACTED:64-73 | REDACTED:38-48 | REDACTED:54-62 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (6 members, 12+ corresponding lines) · ×1
  • Edited copies of one member (6 members, 12+ corresponding lines) db/migrate/20160303175620_create_taxon_name_hierarchies.rb:3 — db/migrate/20160303175620_create_taxon_name_hierarchies.rb:3-14 | db/migrate/20160303210130_create_container_hierarchies.rb:3-14 | db/migrate/20160303210725_create_geographic_area_hierarchies.rb:3-14 | db/migrate/20160727183621_create_container_item_hierarchies.rb:3-14 | db/migrate/20240128202909_create_lead_hierarchies.rb:3-14 | db/migrate/20240609040400_create_gazetteer_hierarchies.rb:3-14 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 12 lines, 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 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. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 20+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 20+ corresponding lines) lib/queries/biological_associations_graph/autocomplete.rb:14 — lib/queries/biological_associations_graph/autocomplete.rb:14-35 | lib/queries/collection_object/autocomplete.rb:60-81 | lib/queries/container/autocomplete.rb:6-25 | lib/queries/field_occurrence/autocomplete.rb:43-62 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (6 members, 4+ corresponding lines) · ×1
  • Edited copies of one member (6 members, 4+ corresponding lines) app/models/nomenclatural_rank/icn/family_group/subtribe.rb:8 — app/models/nomenclatural_rank/icn/family_group/subtribe.rb:8-11 | app/models/nomenclatural_rank/icn/family_group/tribe.rb:8-11 | app/models/nomenclatural_rank/icn/higher_classification_group/order.rb:8-11 | app/models/nomenclatural_rank/icn/higher_classification_group/subclass.rb:8-11 | app/models/nomenclatural_rank/icn/higher_classification_group/suborder.rb:8-11 | app/models/nomenclatural_rank/icn/higher_classification_group/superorder.rb:8-11 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 4 lines, 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 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. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (5 members, 6+ corresponding lines) · ×1
  • Edited copies of one member (5 members, 6+ corresponding lines) app/models/taxon_name_classification/iczn/unavailable/suppressed/not_in_official_list_of_available_names_in_zoology.rb:6 — app/models/taxon_name_classification/iczn/unavailable/suppressed/not_in_official_list_of_available_names_in_zoology.rb:6-11 | app/models/taxon_name_classification/iczn/unavailable/suppressed/official_index_of_rejected_and_invalid_works_in_zoology.rb:6-11 | app/models/taxon_name_classification/iczn/unavailable/suppressed/official_index_of_rejected_family_group_names_in_zoology.rb:10-15 | app/models/taxon_name_classification/iczn/unavailable/suppressed/official_index_of_rejected_generic_names_in_zoology.rb:10-15 | app/models/taxon_name_classification/iczn/unavailable/suppressed/official_index_of_rejected_specific_names_in_zoology.rb:10-15 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 6 lines, 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 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. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 21+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 21+ corresponding lines) lib/queries/anatomical_part/autocomplete.rb:43 — lib/queries/anatomical_part/autocomplete.rb:43-65 | lib/queries/extract/autocomplete.rb:75-96 | lib/queries/sound/autocomplete.rb:10-30 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (7 members, 10+ corresponding lines) · ×1
  • Edited copies of one member (7 members, 10+ corresponding lines) REDACTED:122 — REDACTED:122-131 | REDACTED:142-153 | REDACTED:229-238 | REDACTED:416-426 | REDACTED:258-267 | REDACTED:183-193 | REDACTED:286-295 — These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 10 lines, 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 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. Left alone, the next edit has to be made 7 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 5+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 5+ corresponding lines) app/models/taxon_name_classification/iczn/available/invalid/homonymy_of_type_genus.rb:14 — app/models/taxon_name_classification/iczn/available/invalid/homonymy_of_type_genus.rb:14-18 | app/models/taxon_name_classification/iczn/available/invalid/suppression_of_type_genus.rb:14-18 | app/models/taxon_name_classification/iczn/available/invalid/synonymy_of_type_genus_before1961.rb:14-18 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (5 members, 2+ corresponding lines) · ×1
  • Edited copies of one member (5 members, 2+ corresponding lines) app/models/nomenclatural_rank/icnp/higher_classification_group.rb:4 — app/models/nomenclatural_rank/icnp/higher_classification_group.rb:4-5 | app/models/nomenclatural_rank/icvcn.rb:11-12 | app/models/nomenclatural_rank/iczn/family_group.rb:4-5 | app/models/nomenclatural_rank/iczn/genus_group.rb:4-5 | app/models/nomenclatural_rank/iczn/higher_classification_group.rb:4-5 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 2 lines, 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 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. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 7+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 7+ corresponding lines) REDACTED:101 — REDACTED:101-107 | REDACTED:509-515 | REDACTED:411-417 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 2+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 2+ corresponding lines) app/models/collection_object.rb:839 — app/models/collection_object.rb:839-840 | app/models/field_occurrence.rb:79-80 | app/models/otu.rb:647-648 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 2+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 2+ corresponding lines) app/controllers/tasks/biological_associations/dwc_extension_preview_controller.rb:5 — app/controllers/tasks/biological_associations/dwc_extension_preview_controller.rb:5-6 | app/controllers/tasks/biological_associations/globi_preview_controller.rb:5-7 | app/controllers/tasks/biological_associations/graph_controller.rb:8-12 | app/controllers/tasks/biological_associations/simple_table_controller.rb:5-7 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (1 corresponding lines) · ×1
  • Edited copy of a member (1 corresponding lines) app/models/collection_object/dwc_extensions.rb:148 — app/models/collection_object/dwc_extensions.rb:148-148 | app/models/field_occurrence/dwc_extensions.rb:137-137 — These two members are one piece of code written twice and then edited apart: 1 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 · Edited copies of one member (6 members, 3+ corresponding lines) · ×1
  • Edited copies of one member (6 members, 3+ corresponding lines) app/models/taxon_name_classification/icn/effectively_published/validly_published/legitimate/adopted_by_persoon.rb:6 — app/models/taxon_name_classification/icn/effectively_published/validly_published/legitimate/adopted_by_persoon.rb:6-8 | app/models/taxon_name_classification/icn/effectively_published/validly_published/legitimate/conserved.rb:6-8 | app/models/taxon_name_classification/icn/effectively_published/validly_published/legitimate/correct.rb:6-8 | app/models/taxon_name_classification/icn/effectively_published/validly_published/legitimate/incorrect.rb:6-8 | app/models/taxon_name_classification/icn/effectively_published/validly_published/legitimate/official_list.rb:6-8 | app/models/taxon_name_classification/icn/effectively_published/validly_published/legitimate/sanctioned.rb:6-8 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 3 lines, 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 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. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 3+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 3+ corresponding lines) app/models/taxon_name_classification/icnp/effectively_published/validly_published/legitimate/candidatus.rb:6 — app/models/taxon_name_classification/icnp/effectively_published/validly_published/legitimate/candidatus.rb:6-8 | app/models/taxon_name_classification/icnp/effectively_published/validly_published/legitimate/correct.rb:6-8 | app/models/taxon_name_classification/icnp/effectively_published/validly_published/legitimate/incorrect.rb:6-8 | app/models/taxon_name_classification/icnp/effectively_published/validly_published/legitimate/official_list.rb:6-8 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 10+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 10+ corresponding lines) lib/queries/controlled_vocabulary_term/autocomplete.rb:35 — lib/queries/controlled_vocabulary_term/autocomplete.rb:35-48 | lib/queries/descriptor/autocomplete.rb:11-21 | lib/queries/document/autocomplete.rb:12-21 | lib/queries/namespace/autocomplete.rb:11-21 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 1+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 1+ corresponding lines) REDACTED:667 — REDACTED:667-675 | REDACTED:131-132 | REDACTED:198-198 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Duplicated block (31–33 lines × 2) · ×1
  • Duplicated block (31–33 lines × 2) lib/tools/description/from_observation_matrix.rb:380 — lib/tools/description/from_observation_matrix.rb:380-412 | lib/tools/description/from_observation_matrix.rb:454-484 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (22 lines × 2) · ×1
  • Duplicated block (22 lines × 2) lib/export/coldp/files/synonym.rb:121 — lib/export/coldp/files/synonym.rb:121-142 | lib/export/coldp/files/synonym.rb:148-169 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×1
  • Duplicated block (19 lines × 2) lib/export/dwca/checklist/occurrence_normalizer.rb:373 — lib/export/dwca/checklist/occurrence_normalizer.rb:373-391 | lib/export/dwca/checklist/occurrence_normalizer.rb:873-891 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (17 lines × 5) · ×1
  • Duplicated block (17 lines × 5) app/models/biological_association.rb:260 — app/models/biological_association.rb:260-276 | app/models/biological_associations_graph.rb:39-55 | app/models/conveyance.rb:57-73 | app/models/depiction.rb:139-155 | app/models/observation.rb:352-368 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 5 call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (17 lines × 3) · ×1
  • Duplicated block (17 lines × 3) app/models/collection_object/dwc_extensions.rb:178 — app/models/collection_object/dwc_extensions.rb:178-194 | app/models/concerns/shared/dwc/collecting_event_extensions.rb:121-137 | app/models/field_occurrence/dwc_extensions.rb:159-175 — 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. 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 (15 lines × 6) · ×1
  • Duplicated block (15 lines × 6) lib/queries/collecting_event/filter.rb:310 — lib/queries/collecting_event/filter.rb:310-324 | lib/queries/collection_object/filter.rb:469-483 | lib/queries/field_occurrence/filter.rb:230-244 | lib/queries/source/filter.rb:310-324 | lib/queries/source/filter.rb:338-352 | lib/queries/taxon_name/filter.rb:729-743 — there are 6 copies across 5 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 6 sites; resolving a subset leaves the remainder to drift apart.
D4 · Code Duplication · Duplicated block (13–15 lines × 3) · ×1
  • Duplicated block (13–15 lines × 3) REDACTED:148 — REDACTED:148-162 | REDACTED:274-286 | REDACTED:301-313 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:148` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (14 lines × 3) · ×1
  • Duplicated block (14 lines × 3) lib/export/coldp/files/name.rb:388 — lib/export/coldp/files/name.rb:388-401 | lib/export/coldp/files/name.rb:460-473 | lib/export/coldp/files/name.rb:596-609 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lib/export/coldp/files/name.rb:459` calls `gsub` and `lib/export/coldp/files/name.rb:387` 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.
D4 · Code Duplication · Duplicated block (13–14 lines × 2) · ×1
  • Duplicated block (13–14 lines × 2) app/models/dataset_record/darwin_core/occurrence.rb:576 — app/models/dataset_record/darwin_core/occurrence.rb:576-588 | app/models/dataset_record/darwin_core/taxon.rb:562-575 — 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 `app/models/dataset_record/darwin_core/occurrence.rb:576` 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 lines × 3) · ×1
  • Duplicated block (12 lines × 3) lib/export/coldp/files/name.rb:500 — lib/export/coldp/files/name.rb:500-511 | lib/export/coldp/files/name.rb:538-549 | lib/export/coldp/files/name.rb:666-677 — 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 `lib/export/coldp/files/name.rb:500` 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.
D4 · Code Duplication · Duplicated block (10–12 lines × 2) · ×1
  • Duplicated block (10–12 lines × 2) app/helpers/tasks/collecting_events/parse/stepwise/dates_helper.rb:62 — app/helpers/tasks/collecting_events/parse/stepwise/dates_helper.rb:62-71 | app/helpers/tasks/collecting_events/parse/stepwise/lat_long_helper.rb:52-63 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `app/helpers/tasks/collecting_events/parse/stepwise/dates_helper.rb: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.
D4 · Code Duplication · Duplicated block (10–11 lines × 18) · ×1
  • Duplicated block (10–11 lines × 18) REDACTED:76 — REDACTED:76-85 | REDACTED:87-96 | REDACTED:89-98 | REDACTED:84-93 | REDACTED:68-77 | REDACTED:64-73 | REDACTED:89-98 | REDACTED:39-48 | REDACTED:66-76 | REDACTED:131-140 | REDACTED:94-103 | REDACTED:105-114 | REDACTED:72-81 | REDACTED:67-76 | REDACTED:92-101 | REDACTED:93-102 | REDACTED:94-103 | REDACTED:74-83 — 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 18 call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (11 lines × 6) · ×1
  • Duplicated block (11 lines × 6) app/models/biological_association.rb:263 — app/models/biological_association.rb:263-273 | app/models/biological_associations_graph.rb:42-52 | app/models/conveyance.rb:60-70 | app/models/depiction.rb:142-152 | app/models/extract.rb:140-150 | app/models/observation.rb:355-365 — 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 6 call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (6–11 lines × 2) · ×1
  • Duplicated block (6–11 lines × 2) REDACTED:73 — REDACTED:73-78 | REDACTED:64-74 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:64` 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 (10 lines × 5) · ×1
  • Duplicated block (10 lines × 5) lib/export/coldp/files/name.rb:505 — lib/export/coldp/files/name.rb:505-514 | lib/export/coldp/files/name.rb:543-552 | lib/export/coldp/files/name.rb:671-680 | lib/export/coldp/files/name.rb:713-722 | lib/export/coldp/files/name.rb:759-768 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `lib/export/coldp/files/name.rb:505` 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.
D4 · Code Duplication · Duplicated block (8–10 lines × 4) · ×1
  • Duplicated block (8–10 lines × 4) app/helpers/otus/gis_helper.rb:282 — app/helpers/otus/gis_helper.rb:282-289 | app/helpers/otus/gis_helper.rb:298-307 | app/helpers/otus/gis_helper.rb:320-329 | app/helpers/otus/gis_helper.rb:346-355 — 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 `app/helpers/otus/gis_helper.rb:298` 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.
D4 · Code Duplication · Duplicated block (9 lines × 20) · ×1
  • Duplicated block (9 lines × 20) REDACTED:46 — REDACTED:46-54 | REDACTED:46-54 | REDACTED:49-57 | REDACTED:64-72 | REDACTED:32-40 | REDACTED:33-42 | REDACTED:36-44 | REDACTED:46-54 | REDACTED:31-39 | REDACTED:73-81 | REDACTED:47-55 | REDACTED:36-44 | REDACTED:45-53 | REDACTED:51-59 | REDACTED:39-47 | REDACTED:46-54 | REDACTED:51-59 | REDACTED:43-51 | REDACTED:32-40 | REDACTED:41-49 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 20 call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (9 lines × 9) · ×1
  • Duplicated block (9 lines × 9) REDACTED:42 — REDACTED:42-50 | REDACTED:45-53 | REDACTED:34-42 | REDACTED:21-29 | REDACTED:45-53 | REDACTED:38-46 | REDACTED:33-41 | REDACTED:47-55 | REDACTED:65-73 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 9 call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (7–8 lines × 4) · ×1
  • Duplicated block (7–8 lines × 4) app/models/collection_object.rb:630 — app/models/collection_object.rb:630-637 | app/models/extract.rb:153-160 | app/models/field_occurrence.rb:277-284 | app/models/otu.rb:383-389 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `app/models/collection_object.rb:630` 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, `app/models/collection_object.rb:629` calls `where`, `eq` and `app/models/extract.rb:152` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (6–8 lines × 2) · ×1
  • Duplicated block (6–8 lines × 2) lib/utilities/geo.rb:668 — lib/utilities/geo.rb:668-673 | lib/utilities/geo.rb:676-683 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (3–7 lines × 6) · ×1
  • Duplicated block (3–7 lines × 6) app/models/biological_relationship.rb:60 — app/models/biological_relationship.rb:60-66 | app/models/predicate.rb:15-17 | app/models/preparation_type.rb:43-49 | app/models/protocol.rb:54-60 | app/models/repository.rb:76-82 | app/models/topic.rb:46-52 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 6 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `app/models/biological_relationship.rb:60` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `app/models/biological_relationship.rb:60` calls `where`, `gt` and `app/models/predicate.rb:15` 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.
D4 · Code Duplication · Duplicated block (6–7 lines × 3) · ×1
  • Duplicated block (6–7 lines × 3) REDACTED:217 — REDACTED:217-222 | REDACTED:79-85 | REDACTED:45-51 — 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 (10 lines × 3) · ×1
  • Duplicated block (10 lines × 3) app/models/taxon_name_relationship/icn/unaccepting/synonym.rb:66 — app/models/taxon_name_relationship/icn/unaccepting/synonym.rb:66-75 | app/models/taxon_name_relationship/icnp/unaccepting/synonym.rb:64-73 | app/models/taxon_name_relationship/iczn/invalidating/synonym.rb:70-79 — before extracting anything, compare `app/models/taxon_name_relationship/icn/unaccepting/synonym.rb` and `app/models/taxon_name_relationship/icnp/unaccepting/synonym.rb` as WHOLE FILES: this scan already matched 3 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.
D4 · Code Duplication · Duplicated block (6 lines × 9) · ×1
  • Duplicated block (6 lines × 9) app/models/document.rb:164 — app/models/document.rb:164-169 | REDACTED:381-387 | REDACTED:576-582 | REDACTED:591-597 | REDACTED:606-612 | REDACTED:398-403 | app/models/organization.rb:103-109 | app/models/person.rb:517-523 | app/models/sound.rb:82-87 — there are 9 copies across 7 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 9 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `app/models/document.rb:164` 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.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×1
  • Duplicated block (6 lines × 3) lib/queries/image/filter.rb:819 — lib/queries/image/filter.rb:819-824 | lib/queries/image/filter.rb:839-844 | lib/queries/image/filter.rb:859-864 — 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 `lib/queries/image/filter.rb:819` 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.
D4 · Code Duplication · Duplicated block (31 lines × 2) · ×1
  • Duplicated block (31 lines × 2) lib/queries/concerns/protocols.rb:100 — lib/queries/concerns/protocols.rb:100-130 | lib/queries/concerns/tags.rb:125-155 — 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.
D4 · Code Duplication · Duplicated block (26 lines × 2) · ×1
  • Duplicated block (26 lines × 2) app/models/identifier/local/catalog_number.rb:19 — app/models/identifier/local/catalog_number.rb:19-44 | app/models/identifier/local/record_number.rb:16-41 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `app/models/identifier/local/catalog_number.rb:19` 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 (5 lines × 14) · ×1
  • Duplicated block (5 lines × 14) app/models/taxon_name_relationship/combination.rb:80 — app/models/taxon_name_relationship/combination.rb:80-84 | app/models/taxon_name_relationship/icn/accepting/conserved_name.rb:40-44 | app/models/taxon_name_relationship/icn/accepting/sanctioned_name.rb:40-44 | app/models/taxon_name_relationship/icnp/accepting/conserved_name.rb:40-44 | app/models/taxon_name_relationship/icvcn/unaccepting/supressed.rb:49-53 | app/models/taxon_name_relationship/iczn/invalidating/homonym.rb:133-137 | app/models/taxon_name_relationship/iczn/invalidating/homonym/primary/forgotten.rb:44-48 | app/models/taxon_name_relationship/iczn/invalidating/homonym/primary/suppressed.rb:35-39 | app/models/taxon_name_relationship/iczn/invalidating/synonym/forgotten_name.rb:79-83 | app/models/taxon_name_relationship/iczn/invalidating/synonym/forgotten_name/forgotten_name19611972.rb:51-55 | app/models/taxon_name_relationship/iczn/invalidating/synonym/suppression.rb:61-65 | REDACTED:68-72 | REDACTED:68-72 | REDACTED:102-106 — before extracting anything, compare `app/models/taxon_name_relationship/icn/accepting/conserved_name.rb` and `app/models/taxon_name_relationship/icnp/accepting/conserved_name.rb` as WHOLE FILES: 88% 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 (10 lines × 4) · ×1
  • Duplicated block (10 lines × 4) lib/queries/image/autocomplete.rb:88 — lib/queries/image/autocomplete.rb:88-97 | lib/queries/observation/autocomplete.rb:39-48 | lib/queries/preparation_type/autocomplete.rb:23-32 | lib/queries/sound/autocomplete.rb:35-44 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
D4 · Code Duplication · Duplicated block (8 lines × 4) · ×1
  • Duplicated block (8 lines × 4) REDACTED:216 — REDACTED:216-223 | REDACTED:242-250 | REDACTED:314-321 | REDACTED:340-347 — there are 4 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart.
D4 · Code Duplication · Duplicated block (5 lines × 6) · ×1
  • Duplicated block (5 lines × 6) REDACTED:278 — REDACTED:278-282 | REDACTED:29-34 | REDACTED:43-48 | REDACTED:52-57 | REDACTED:26-31 | REDACTED:151-156 — there are 6 copies across 5 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 6 sites; resolving a subset leaves the remainder to drift apart. 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.
D4 · Code Duplication · Duplicated block (7 lines × 3) · ×1
  • Duplicated block (7 lines × 3) REDACTED:53 — REDACTED:53-59 | REDACTED:49-57 | REDACTED:50-58 — 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 (9 lines × 5) · ×1
  • Duplicated block (9 lines × 5) REDACTED:48 — REDACTED:48-56 | REDACTED:35-43 | REDACTED:52-60 | REDACTED:47-55 | REDACTED:61-69 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 5 call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (5 lines × 4) · ×1
  • Duplicated block (5 lines × 4) app/helpers/alternate_values_helper.rb:27 — app/helpers/alternate_values_helper.rb:27-31 | app/helpers/confidences_helper.rb:16-20 | app/helpers/data_attributes_helper.rb:33-39 | app/helpers/notes_helper.rb:14-18 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 4 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (19 lines × 3) · ×1
  • Duplicated block (19 lines × 3) lib/queries/image/autocomplete.rb:64 — lib/queries/image/autocomplete.rb:64-83 | lib/queries/lead/autocomplete.rb:46-64 | lib/queries/observation/autocomplete.rb:15-34 — 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.
R1 · Type Safety · Type Safety · ×1
  • Type Safety — 0 typed · 3455 plain JS — the untyped files are app/assets/config/manifest.js, app/assets/javascripts/application.js, app/assets/javascripts/separated/utilities/browser/browser_compatibility.js, app/assets/javascripts/separated_application.js, app/assets/javascripts/theme.js, app/assets/javascripts/tw.js (+3449 more).
R10 · Code Duplication · Duplication concentrated across 41 sibling directories (139 clone groups) · ×1
  • Duplication concentrated across 41 sibling directories (139 clone groups) app/javascript/vue/tasks/anatomical_parts/filter/components/filters/FacetTaxonNameRelationshipType.vue:90 — 139 duplicated blocks under app/javascript/vue/tasks/ have copies in at least two of the sibling directories administration, anatomical_parts, asserted_distributions, asserted_environments, biological_associations, biological_relationships (+35 more sibling(s) not listed) — 79 of them are reported below, and 60 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 139 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 139 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 139 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 6 sibling directories (79 clone groups) · ×1
  • Duplication concentrated across 6 sibling directories (79 clone groups) app/javascript/vue/components/ui/Table/VirtualScroller.vue:24 — 79 duplicated blocks under app/javascript/vue/ have copies in at least two of the sibling directories components, composables, helpers, initializers, shared, tasks — 51 of them are reported below, and 28 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 79 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 79 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 79 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 17 sibling directories (42 clone groups) · ×1
  • Duplication concentrated across 17 sibling directories (42 clone groups) app/javascript/vue/components/radials/annotator/annotator.vue:108 — 42 duplicated blocks under app/javascript/vue/components/radials/ have copies in at least two of the sibling directories BiologicalAssociation, annotator, asserted_distribution, ce, co, composables (+11 more sibling(s) not listed) — 33 of them are reported below, and 9 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 42 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 42 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 42 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 4 sibling directories (37 clone groups) · ×1
  • Duplication concentrated across 4 sibling directories (37 clone groups) app/javascript/vue/tasks/observation_matrices/matrix_column_coder/MatrixColumnCoder/SampleDescriptor/SampleDescriptorObservation.vue:91 — 37 duplicated blocks under app/javascript/vue/tasks/observation_matrices/ have copies in at least two of the sibling directories image, matrix_column_coder, matrix_row_coder, new — 21 of them are reported below, and 16 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 37 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 37 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 37 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 14 sibling directories (26 clone groups) · ×1
  • Duplication concentrated across 14 sibling directories (26 clone groups) app/javascript/vue/components/Filter/Facets/BiologicalAssociation/FacetNomenclatureRelation.vue:61 — 26 duplicated blocks under app/javascript/vue/components/Filter/Facets/ have copies in at least two of the sibling directories AnatomicalParts, AssertedDistributions, AssertedEnvironments, BiologicalAssociation, CollectingEvent, CollectionObject (+8 more sibling(s) not listed) — 19 of them are reported below, and 7 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 26 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 26 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 26 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 14 sibling directories (15 clone groups) · ×1
  • Duplication concentrated across 14 sibling directories (15 clone groups) app/javascript/vue/tasks/otus/browse/components/Panel/PanelCollectionObjects/PanelCollectionObjects.vue:90 — 15 duplicated blocks under app/javascript/vue/tasks/otus/browse/components/Panel/ have copies in at least two of the sibling directories PanelAnnotations, PanelAssertedDistribution, PanelAssertedEnvironments, PanelBiologicalAssociations, PanelCollectionObjects, PanelCommonNames (+8 more sibling(s) not listed) — 7 of them are reported below, and 8 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 15 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 15 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 15 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 6 sibling directories (10 clone groups) · ×1
  • Duplication concentrated across 6 sibling directories (10 clone groups) app/javascript/vue/components/TaxonDetermination/TaxonDeterminationForm.vue:74 — 10 duplicated blocks under app/javascript/vue/components/ have copies in at least two of the sibling directories Filter, TaxonDetermination, graph, layout, radials, ui — 8 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 10 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 10 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 10 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 14 sibling directories (10 clone groups) · ×1
  • Duplication concentrated across 14 sibling directories (10 clone groups) app/javascript/vue/initializers/Autoselect/main.js:17 — 10 duplicated blocks under app/javascript/vue/initializers/ have copies in at least two of the sibling directories Autoselect, ButtonConfidence, ButtonOtu, ButtonTag, MapShape, QuickCitation (+8 more sibling(s) not listed) — 8 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 10 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 10 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 10 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 8 sibling directories (8 clone groups) · ×1
  • Duplication concentrated across 8 sibling directories (8 clone groups) app/assets/javascripts/views/confidences/form.js:27 — 8 duplicated blocks under app/assets/javascripts/views/ have copies in at least two of the sibling directories citations, confidences, hub, otus, people, shared (+2 more sibling(s) not listed) — 7 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 8 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 8 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 8 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 2 sibling directories (6 clone groups) · ×1
  • Duplication concentrated across 2 sibling directories (6 clone groups) app/javascript/vue/tasks/biological_associations/new/store/store.js:8 — 6 duplicated blocks under app/javascript/vue/tasks/biological_associations/ have copies in at least two of the sibling directories new, new_ba — 5 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 6 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 6 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 6 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 4 sibling directories (5 clone groups) · ×1
  • Duplication concentrated across 4 sibling directories (5 clone groups) app/javascript/vue/components/radials/mass/components/Annotator/Confidence/ConfidenceMain.vue:72 — 5 duplicated blocks under app/javascript/vue/components/radials/mass/components/Annotator/ have copies in at least two of the sibling directories Attribution, Confidence, Identifier, Protocol — 4 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 5 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplicated block with local edits (160 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (160 matched lines × 2 locations) app/javascript/vue/tasks/biological_associations/new/store/store.js:8 — app/javascript/vue/tasks/biological_associations/new/store/store.js:8 · app/javascript/vue/tasks/biological_associations/new_ba/store/store.js:27 — the two spans are one implementation copied and then locally edited — 762 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (150 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (150 matched lines × 2 locations) app/javascript/vue/components/radials/annotator/annotator.vue:108 — app/javascript/vue/components/radials/annotator/annotator.vue:108 · app/javascript/vue/components/radials/object/radial.vue:111 — the two spans are one implementation copied and then locally edited — 670 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Wholesale file copy (106 identical lines × 2 files) · ×1
  • Wholesale file copy (106 identical lines × 2 files) app/javascript/vue/tasks/anatomical_parts/filter/components/filters/FacetTaxonNameRelationshipType.vue:90 — app/javascript/vue/tasks/anatomical_parts/filter/components/filters/FacetTaxonNameRelationshipType.vue:90 · app/javascript/vue/tasks/taxon_name_relationships/filter/components/filters/FacetTaxonNameRelationshipType.vue:90 — these 2 files are line-for-line copies of one another — 106 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block (82 lines × 2 locations) · ×1
  • Duplicated block (82 lines × 2 locations) app/javascript/vue/components/radials/mass/components/Annotator/Confidence/ConfidenceMain.vue:72 — app/javascript/vue/components/radials/mass/components/Annotator/Confidence/ConfidenceMain.vue:72 · app/javascript/vue/components/radials/mass/components/Annotator/Protocol/ProtocolMain.vue:66 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block with local edits (78 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (78 matched lines × 2 locations) app/javascript/vue/tasks/nomenclature/new_taxon_name/components/classification.vue:121 — app/javascript/vue/tasks/nomenclature/new_taxon_name/components/classification.vue:121 · app/javascript/vue/tasks/nomenclature/new_taxon_name/components/relationshipPicker.vue:183 — the two spans are one implementation copied and then locally edited — 393 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (76 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (76 matched lines × 2 locations) app/javascript/vue/components/ui/Button/ButtonConfidence.vue:72 — app/javascript/vue/components/ui/Button/ButtonConfidence.vue:72 · app/javascript/vue/components/ui/Button/ButtonTag.vue:73 — the two spans are one implementation copied and then locally edited — 358 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Wholesale file copy (76 identical lines × 2 files) · ×1
  • Wholesale file copy (76 identical lines × 2 files) app/javascript/vue/tasks/observation_matrices/matrix_column_coder/MatrixColumnCoder/SampleDescriptor/SampleDescriptorObservation.vue:91 — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/MatrixColumnCoder/SampleDescriptor/SampleDescriptorObservation.vue:91 · app/javascript/vue/tasks/observation_matrices/matrix_row_coder/MatrixRowCoder/SampleDescriptor/SampleDescriptorObservation.vue:93 — these 2 files are line-for-line copies of one another — 76 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block with local edits (73 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (73 matched lines × 2 locations) app/javascript/vue/tasks/collecting_events/stepwise/collectors/composables/useStore.js:24 — app/javascript/vue/tasks/collecting_events/stepwise/collectors/composables/useStore.js:24 · app/javascript/vue/tasks/collection_objects/stepwise/determinations/composables/useStore.js:24 — the two spans are one implementation copied and then locally edited — 362 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (67 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (67 matched lines × 2 locations) app/javascript/vue/tasks/collecting_events/new_collecting_event/components/ModalCollectionObjects/ModalCollectionObjects.vue:224 — app/javascript/vue/tasks/collecting_events/new_collecting_event/components/ModalCollectionObjects/ModalCollectionObjects.vue:224 · app/javascript/vue/tasks/collecting_events/new_collecting_event/components/ModalFieldOccurrences/ModalFieldOccurrences.vue:149 — the two spans are one implementation copied and then locally edited — 330 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (60 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (60 matched lines × 2 locations) app/javascript/vue/components/Filter/Facets/BiologicalAssociation/FacetNomenclatureRelation.vue:61 — app/javascript/vue/components/Filter/Facets/BiologicalAssociation/FacetNomenclatureRelation.vue:61 · app/javascript/vue/components/Filter/Facets/TaxonName/components/TaxonNameSelector.vue:72 — the two spans are one implementation copied and then locally edited — 345 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (56 lines × 2 locations) · ×1
  • Duplicated block (56 lines × 2 locations) app/javascript/vue/components/Filter/Facets/shared/FacetConfidence.vue:103 — app/javascript/vue/components/Filter/Facets/shared/FacetConfidence.vue:103 · app/javascript/vue/components/Filter/Facets/shared/FacetTags.vue:112 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Wholesale file copy (55 identical lines × 2 files) · ×1
  • Wholesale file copy (55 identical lines × 2 files) app/javascript/vue/tasks/anatomical_parts/anatomical_parts_graph/constants/networkConfig.js:1 — app/javascript/vue/tasks/anatomical_parts/anatomical_parts_graph/constants/networkConfig.js:1 · app/javascript/vue/tasks/biological_associations/biological_associations_graph/constants/networkConfig.js:1 — these 2 files are line-for-line copies of one another — 55 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Wholesale file copy (54 identical lines × 2 files) · ×1
  • Wholesale file copy (54 identical lines × 2 files) app/javascript/vue/tasks/collection_objects/filter/components/DeleteCollectionObjects.vue:22 — app/javascript/vue/tasks/collection_objects/filter/components/DeleteCollectionObjects.vue:22 · app/javascript/vue/tasks/field_occurrences/filter/components/DeleteFieldOccurrences.vue:22 — these 2 files are line-for-line copies of one another — 54 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Wholesale file copy (53 identical lines × 2 files) · ×1
  • Wholesale file copy (53 identical lines × 2 files) app/javascript/vue/components/ui/Table/VirtualScroller.vue:24 — app/javascript/vue/components/ui/Table/VirtualScroller.vue:24 · app/javascript/vue/tasks/dwca_import/components/VirtualScroller.vue:24 — these 2 files are line-for-line copies of one another — 53 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Wholesale file copy (52 identical lines × 2 files) · ×1
  • Wholesale file copy (52 identical lines × 2 files) app/javascript/vue/tasks/digitize/store/pinia/determinations.js:1 — app/javascript/vue/tasks/digitize/store/pinia/determinations.js:1 · app/javascript/vue/tasks/field_occurrences/new/store/determinations.js:1 — these 2 files are line-for-line copies of one another — 52 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block with local edits (51 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (51 matched lines × 2 locations) app/javascript/vue/tasks/administration/data/components/Reindex/ProgressBar.vue:20 — app/javascript/vue/tasks/administration/data/components/Reindex/ProgressBar.vue:20 · app/javascript/vue/tasks/dwc/dashboard/components/ProgressBar.vue:21 — the two spans are one implementation copied and then locally edited — 283 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (50 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (50 matched lines × 2 locations) app/javascript/vue/tasks/otus/browse/components/Panel/PanelCollectionObjects/PanelCollectionObjects.vue:90 — app/javascript/vue/tasks/otus/browse/components/Panel/PanelCollectionObjects/PanelCollectionObjects.vue:90 · app/javascript/vue/tasks/otus/browse/components/Panel/PanelFieldOccurrences/PanelFieldOccurrences.vue:88 — the two spans are one implementation copied and then locally edited — 279 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (48 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (48 matched lines × 2 locations) app/javascript/vue/tasks/nomenclature/filter/components/filters/FacetRelationships.vue:118 — app/javascript/vue/tasks/nomenclature/filter/components/filters/FacetRelationships.vue:118 · app/javascript/vue/tasks/nomenclature/filter/components/filters/FacetStatus.vue:93 — the two spans are one implementation copied and then locally edited — 198 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (46 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (46 matched lines × 2 locations) app/javascript/vue/tasks/gazetteers/import_gazetteers/components/DocumentSelector.vue:129 — app/javascript/vue/tasks/gazetteers/import_gazetteers/components/DocumentSelector.vue:129 · app/javascript/vue/tasks/observation_matrices/import_nexus/components/DocumentSelector.vue:98 — the two spans are one implementation copied and then locally edited — 277 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (43 lines × 2 locations) · ×1
  • Duplicated block (43 lines × 2 locations) app/javascript/vue/tasks/collection_objects/browse/components/PanelCE/PanelCEModal.vue:74 — app/javascript/vue/tasks/collection_objects/browse/components/PanelCE/PanelCEModal.vue:74 · app/javascript/vue/tasks/field_occurrences/browse/components/PanelCE/PanelCEModal.vue:71 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication · Duplicated block (41 lines × 2 locations) · ×1
  • Duplicated block (41 lines × 2 locations) app/javascript/vue/routes/endpoints/CollectionObject.js:35 — app/javascript/vue/routes/endpoints/CollectionObject.js:35 · app/javascript/vue/routes/endpoints/FieldOccurrence.js:24 — the 2 copies are spread across 2 files, and what repeats is a LIST OF ENTRIES rather than behaviour — the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator's options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents.
R2 · Cyclomatic Complexity · Complex function onInput (cyclomatic 24, cognitive 33) · ×1
  • Complex function onInput (cyclomatic 24, cognitive 33) app/javascript/vue/components/ui/AutoselectField.vue:537 — onInput has cyclomatic complexity 24 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function onWindowMouseup (cyclomatic 23, cognitive 45) · ×1
  • Complex function onWindowMouseup (cyclomatic 23, cognitive 45) app/javascript/vue/tasks/containers/collection_layout/components/SvgGrid.vue:299 — onWindowMouseup has cyclomatic complexity 23 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function makeItem (cyclomatic 17, cognitive 16) · ×1
  • Complex function makeItem (cyclomatic 17, cognitive 16) app/javascript/vue/components/LightTable/composables/useLightTable.js:56 — makeItem has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function addRooms (cyclomatic 16, cognitive 17) · ×1
  • Complex function addRooms (cyclomatic 16, cognitive 17) app/javascript/vue/tasks/containers/collection_layout/components/ScaffoldForm.vue:220 — addRooms has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function computeChanges (cyclomatic 15, cognitive 22) · ×1
  • Complex function computeChanges (cyclomatic 15, cognitive 22) app/javascript/vue/tasks/images/light_table/adapters/changes.js:11 — computeChanges has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function setSelectorParams (cyclomatic 15, cognitive 15) · ×1
  • Complex function setSelectorParams (cyclomatic 15, cognitive 15) app/javascript/vue/tasks/anatomical_parts/anatomical_parts_graph/app.vue:266 — setSelectorParams has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function doCreate (cyclomatic 14, cognitive 13) · ×1
  • Complex function doCreate (cyclomatic 14, cognitive 13) app/javascript/vue/components/ui/AutoselectField/ColConfirmModal.vue:503 — doCreate has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function compositionItemToItem (cyclomatic 14, cognitive 13) · ×1
  • Complex function compositionItemToItem (cyclomatic 14, cognitive 13) app/javascript/vue/tasks/images/light_table/adapters/compositionItem.js:36 — compositionItemToItem has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 14, cognitive 11) · ×1
  • Complex function (anonymous) (cyclomatic 14, cognitive 11) app/javascript/vue/tasks/dwca_import/store/actions/loadDataSetRecords.js:9 — (anonymous) has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function mapAnatomicalPartAttributesToAssociationSides (cyclomatic 13, cognitive 24) · ×1
  • Complex function mapAnatomicalPartAttributesToAssociationSides (cyclomatic 13, cognitive 24) app/javascript/vue/components/radials/object/components/biological_relationships/composables/useBiologicalAssociationAnatomicalParts.js:308 — mapAnatomicalPartAttributesToAssociationSides has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function onWindowMousemove (cyclomatic 13, cognitive 16) · ×1
  • Complex function onWindowMousemove (cyclomatic 13, cognitive 16) app/javascript/vue/tasks/containers/collection_layout/components/SvgGrid.vue:277 — onWindowMousemove has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function onKeyDown (cyclomatic 13, cognitive 13) · ×1
  • Complex function onKeyDown (cyclomatic 13, cognitive 13) app/javascript/vue/components/LightTable/LightTable.vue:184 — onKeyDown has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function saveAssociation (cyclomatic 13, cognitive 13) · ×1
  • Complex function saveAssociation (cyclomatic 13, cognitive 13) app/javascript/vue/components/radials/object/components/biological_relationships/biological_relationships_annotator.vue:506 — saveAssociation has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function itemAttributes (cyclomatic 13, cognitive 12) · ×1
  • Complex function itemAttributes (cyclomatic 13, cognitive 12) app/javascript/vue/tasks/images/light_table/adapters/compositionItem.js:90 — itemAttributes has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 13, cognitive 9) · ×1
  • Complex function (anonymous) (cyclomatic 13, cognitive 9) app/javascript/vue/tasks/otus/match_by_taxon_name/components/ResultTable.vue:540 — (anonymous) has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function classifyApplyOtu (cyclomatic 12, cognitive 25) · ×1
  • Complex function classifyApplyOtu (cyclomatic 12, cognitive 25) app/javascript/vue/tasks/images/light_table/adapters/applyOtu.js:30 — classifyApplyOtu has cyclomatic complexity 12 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function handleRowUpdate (cyclomatic 12, cognitive 14) · ×1
  • Complex function handleRowUpdate (cyclomatic 12, cognitive 14) app/javascript/vue/tasks/otus/match_by_taxon_name/app.vue:337 — handleRowUpdate has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 12, cognitive 11) · ×1
  • Complex function (anonymous) (cyclomatic 12, cognitive 11) app/javascript/vue/components/ui/AutoselectField.vue:673 — (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function doCreate (cyclomatic 12, cognitive 11) · ×1
  • Complex function doCreate (cyclomatic 12, cognitive 11) app/javascript/vue/components/ui/AutoselectField/OtuNewModal.vue:238 — doCreate has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function noUnsavedChanges (cyclomatic 12, cognitive 10) · ×1
  • Complex function noUnsavedChanges (cyclomatic 12, cognitive 10) app/javascript/vue/tasks/projects/dwc_export_preferences/app.vue:397 — noUnsavedChanges has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function saveBiologicalAssociation (cyclomatic 11, cognitive 15) · ×1
  • Complex function saveBiologicalAssociation (cyclomatic 11, cognitive 15) app/javascript/vue/tasks/biological_associations/new_ba/store/store.js:234 — saveBiologicalAssociation has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function sortFunction (cyclomatic 11, cognitive 13) · ×1
  • Complex function sortFunction (cyclomatic 11, cognitive 13) app/javascript/vue/helpers/arrays.js:20 — sortFunction has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files · app/javascript/vue/components/ui/AutoselectField.vue · ×1
  • app/javascript/vue/components/ui/AutoselectField.vue: 1137 lines of code app/javascript/vue/components/ui/AutoselectField.vue:1 — app/javascript/vue/components/ui/AutoselectField.vue has 1137 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/leads/cite_key/app.vue · ×1
  • app/javascript/vue/tasks/leads/cite_key/app.vue: 961 lines of code app/javascript/vue/tasks/leads/cite_key/app.vue:1 — app/javascript/vue/tasks/leads/cite_key/app.vue has 961 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/otus/match_by_taxon_name/components/ResultTable.vue · ×1
  • app/javascript/vue/tasks/otus/match_by_taxon_name/components/ResultTable.vue: 645 lines of code app/javascript/vue/tasks/otus/match_by_taxon_name/components/ResultTable.vue:1 — app/javascript/vue/tasks/otus/match_by_taxon_name/components/ResultTable.vue has 645 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/components/Filter/Table/TableResults.vue · ×1
  • app/javascript/vue/components/Filter/Table/TableResults.vue: 638 lines of code app/javascript/vue/components/Filter/Table/TableResults.vue:1 — app/javascript/vue/components/Filter/Table/TableResults.vue has 638 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/components/radials/object/components/biological_relationships/biological_relationships_annotator.vue · ×1
  • app/javascript/vue/components/radials/object/components/biological_relationships/biological_relationships_annotator.vue: 636 lines of code app/javascript/vue/components/radials/object/components/biological_relationships/biological_relationships_annotator.vue:1 — app/javascript/vue/components/radials/object/components/biological_relationships/biological_relationships_annotator.vue has 636 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/otus/match_by_taxon_name/app.vue · ×1
  • app/javascript/vue/tasks/otus/match_by_taxon_name/app.vue: 606 lines of code app/javascript/vue/tasks/otus/match_by_taxon_name/app.vue:1 — app/javascript/vue/tasks/otus/match_by_taxon_name/app.vue has 606 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/components/ui/AutoselectField/ColConfirmModal.vue · ×1
  • app/javascript/vue/components/ui/AutoselectField/ColConfirmModal.vue: 587 lines of code app/javascript/vue/components/ui/AutoselectField/ColConfirmModal.vue:1 — app/javascript/vue/components/ui/AutoselectField/ColConfirmModal.vue has 587 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/data_attributes/field_synchronize/components/Table/VTable.vue · ×1
  • app/javascript/vue/tasks/data_attributes/field_synchronize/components/Table/VTable.vue: 583 lines of code app/javascript/vue/tasks/data_attributes/field_synchronize/components/Table/VTable.vue:1 — app/javascript/vue/tasks/data_attributes/field_synchronize/components/Table/VTable.vue has 583 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/components/LightTable/composables/useLightTable.js · ×1
  • app/javascript/vue/components/LightTable/composables/useLightTable.js: 579 lines of code app/javascript/vue/components/LightTable/composables/useLightTable.js:1 — app/javascript/vue/components/LightTable/composables/useLightTable.js has 579 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/collection_objects/slide_breakdown/app.vue · ×1
  • app/javascript/vue/tasks/collection_objects/slide_breakdown/app.vue: 566 lines of code app/javascript/vue/tasks/collection_objects/slide_breakdown/app.vue:1 — app/javascript/vue/tasks/collection_objects/slide_breakdown/app.vue has 566 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/projects/dwc_export_preferences/app.vue · ×1
  • app/javascript/vue/tasks/projects/dwc_export_preferences/app.vue: 536 lines of code app/javascript/vue/tasks/projects/dwc_export_preferences/app.vue:1 — app/javascript/vue/tasks/projects/dwc_export_preferences/app.vue has 536 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/components/ui/Autocomplete.vue · ×1
  • app/javascript/vue/components/ui/Autocomplete.vue: 535 lines of code app/javascript/vue/components/ui/Autocomplete.vue:1 — app/javascript/vue/components/ui/Autocomplete.vue has 535 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/sources/new_source/components/bibtex/AuthorMatchModal.vue · ×1
  • app/javascript/vue/tasks/sources/new_source/components/bibtex/AuthorMatchModal.vue: 522 lines of code app/javascript/vue/tasks/sources/new_source/components/bibtex/AuthorMatchModal.vue:1 — app/javascript/vue/tasks/sources/new_source/components/bibtex/AuthorMatchModal.vue has 522 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/components/ui/SmartSelector.vue · ×1
  • app/javascript/vue/components/ui/SmartSelector.vue: 487 lines of code app/javascript/vue/components/ui/SmartSelector.vue:1 — app/javascript/vue/components/ui/SmartSelector.vue has 487 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/components/radials/annotator/annotator.vue · ×1
  • app/javascript/vue/components/radials/annotator/annotator.vue: 472 lines of code app/javascript/vue/components/radials/annotator/annotator.vue:1 — app/javascript/vue/components/radials/annotator/annotator.vue has 472 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/leads/new_lead/shared/Couplet.vue · ×1
  • app/javascript/vue/tasks/leads/new_lead/shared/Couplet.vue: 458 lines of code app/javascript/vue/tasks/leads/new_lead/shared/Couplet.vue:1 — app/javascript/vue/tasks/leads/new_lead/shared/Couplet.vue has 458 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/leads/new_lead/shared/Lead.vue · ×1
  • app/javascript/vue/tasks/leads/new_lead/shared/Lead.vue: 449 lines of code app/javascript/vue/tasks/leads/new_lead/shared/Lead.vue:1 — app/javascript/vue/tasks/leads/new_lead/shared/Lead.vue has 449 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/components/role_picker.vue · ×1
  • app/javascript/vue/components/role_picker.vue: 444 lines of code app/javascript/vue/components/role_picker.vue:1 — app/javascript/vue/components/role_picker.vue has 444 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/biological_associations/biological_associations_graph/components/BiologicalAssociationsGraph.vue · ×1
  • app/javascript/vue/tasks/biological_associations/biological_associations_graph/components/BiologicalAssociationsGraph.vue: 425 lines of code app/javascript/vue/tasks/biological_associations/biological_associations_graph/components/BiologicalAssociationsGraph.vue:1 — app/javascript/vue/tasks/biological_associations/biological_associations_graph/components/BiologicalAssociationsGraph.vue has 425 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/leads/new_lead/store/leadStore.js · ×1
  • app/javascript/vue/tasks/leads/new_lead/store/leadStore.js: 423 lines of code app/javascript/vue/tasks/leads/new_lead/store/leadStore.js:1 — app/javascript/vue/tasks/leads/new_lead/store/leadStore.js has 423 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/containers/collection_layout/components/SvgGrid.vue · ×1
  • app/javascript/vue/tasks/containers/collection_layout/components/SvgGrid.vue: 422 lines of code app/javascript/vue/tasks/containers/collection_layout/components/SvgGrid.vue:1 — app/javascript/vue/tasks/containers/collection_layout/components/SvgGrid.vue has 422 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/data_attributes/field_synchronize/composables/useFieldSync.js · ×1
  • app/javascript/vue/tasks/data_attributes/field_synchronize/composables/useFieldSync.js: 418 lines of code app/javascript/vue/tasks/data_attributes/field_synchronize/composables/useFieldSync.js:1 — app/javascript/vue/tasks/data_attributes/field_synchronize/composables/useFieldSync.js has 418 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/data_attributes/multi_update/components/DataAttributeTable.vue · ×1
  • app/javascript/vue/tasks/data_attributes/multi_update/components/DataAttributeTable.vue: 417 lines of code app/javascript/vue/tasks/data_attributes/multi_update/components/DataAttributeTable.vue:1 — app/javascript/vue/tasks/data_attributes/multi_update/components/DataAttributeTable.vue has 417 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/assets/javascripts/workbench/pinboard.js · ×1
  • app/assets/javascripts/workbench/pinboard.js: 416 lines of code app/assets/javascripts/workbench/pinboard.js:1 — app/assets/javascripts/workbench/pinboard.js has 416 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/nomenclature/reclassifier/components/Tree/TreeNode.vue · ×1
  • app/javascript/vue/tasks/nomenclature/reclassifier/components/Tree/TreeNode.vue: 410 lines of code app/javascript/vue/tasks/nomenclature/reclassifier/components/Tree/TreeNode.vue:1 — app/javascript/vue/tasks/nomenclature/reclassifier/components/Tree/TreeNode.vue has 410 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/components/radials/navigation/radial.vue · ×1
  • app/javascript/vue/components/radials/navigation/radial.vue: 408 lines of code app/javascript/vue/components/radials/navigation/radial.vue:1 — app/javascript/vue/components/radials/navigation/radial.vue has 408 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/components/ui/VMap/VMap.vue · ×1
  • app/javascript/vue/components/ui/VMap/VMap.vue: 401 lines of code app/javascript/vue/components/ui/VMap/VMap.vue:1 — app/javascript/vue/components/ui/VMap/VMap.vue has 401 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · app/javascript/vue/tasks/biological_associations/biological_associations_graph/composition/useGraph.js · ×1
  • app/javascript/vue/tasks/biological_associations/biological_associations_graph/composition/useGraph.js: 401 lines of code app/javascript/vue/tasks/biological_associations/biological_associations_graph/composition/useGraph.js:1 — app/javascript/vue/tasks/biological_associations/biological_associations_graph/composition/useGraph.js has 401 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R5 · Dependency Freshness · Dependency Freshness · ×1
  • Dependency Freshness — 34 outdated package(s); JS/npm CVEs scored in D30
R6 · Tooling · No test, lint or typecheck script · ×1
  • No test, lint or typecheck script — test ✗ · lint ✗ · typecheck ✗ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.
R6 · Tooling · A linter is configured here, but no build or CI step runs it · ×1
  • A linter is configured here, but no build or CI step runs it eslint.config.mjs:1 — the root package configures a linter in `eslint.config.mjs`, but no package script, bundler plugin, task runner or CI step in this repository runs a linter, so the rules it sets are enforced nowhere. Run it where it can fail: a `lint` script that CI runs, a linter plugin in the build, or a CI step.
R7 · Dead Code · Dead file (~256 LoC) · ×1
  • Dead file (~256 LoC) app/javascript/vue/tasks/anatomical_parts/filter/components/filters/FacetTaxonNameRelationshipType.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~222 LoC) · ×1
  • Dead file (~222 LoC) app/javascript/vue/tasks/extracts/filter/components/dwcDownload.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~154 LoC) · ×1
  • Dead file (~154 LoC) app/javascript/vue/components/Filter/Facets/BiologicalAssociation/FacetNomenclatureRelation.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~132 LoC) · ×1
  • Dead file (~132 LoC) app/javascript/vue/components/radials/object/components/shared/tableList.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~130 LoC) · ×1
  • Dead file (~130 LoC) app/javascript/vue/components/Filter/Facets/shared/FacetDataAttribute/AddPredicate.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~127 LoC) · ×1
  • Dead file (~127 LoC) app/javascript/vue/components/radials/object/components/shared/listItems.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~111 LoC) · ×1
  • Dead file (~111 LoC) app/javascript/vanilla/initializers/rspackProgressCompilation.js — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (app/javascript/packs/rspack.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~108 LoC) · ×1
  • Dead file (~108 LoC) app/javascript/vue/components/georeferences/list.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~106 LoC) · ×1
  • Dead file (~106 LoC) app/javascript/vue/components/radials/object/components/displayList.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~88 LoC) · ×1
  • Dead file (~88 LoC) app/javascript/vue/tasks/field_occurrences/new/store/identifier.js — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~85 LoC) · ×1
  • Dead file (~85 LoC) app/javascript/vue/components/Filter/Facets/CollectionObject/FacetImportDataset.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~81 LoC) · ×1
  • Dead file (~81 LoC) app/javascript/vue/tasks/images/filter/components/filters/collectionObjects.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~73 LoC) · ×1
  • Dead file (~73 LoC) app/javascript/vue/tasks/dwc/dashboard/components/Reindex/ReindexPanel.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~69 LoC) · ×1
  • Dead file (~69 LoC) app/javascript/vue/tasks/observation_matrices/dashboard/components/filters/with.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~68 LoC) · ×1
  • Dead file (~68 LoC) app/javascript/vue/components/georeferences/geolocateComponent.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~63 LoC) · ×1
  • Dead file (~63 LoC) app/javascript/vue/components/radials/navigation/components/radialObjectExtend.js — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (app/javascript/vue/components/radials/navigation/components/recent.vue) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~62 LoC) · ×1
  • Dead file (~62 LoC) app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/saveObservation.js — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~61 LoC) · ×1
  • Dead file (~61 LoC) app/javascript/vue/components/radials/mass/components/Annotator/Attribution/AttributionSummary.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~58 LoC) · ×1
  • Dead file (~58 LoC) app/javascript/vue/tasks/nomenclature/filter/components/filters/FacetValidity.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~55 LoC) · ×1
  • Dead file (~55 LoC) app/javascript/vue/components/radials/object/components/shared/switch.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~50 LoC) · ×1
  • Dead file (~50 LoC) app/javascript/vue/components/radials/object/components/extract/ExtractRole.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~49 LoC) · ×1
  • Dead file (~49 LoC) app/javascript/vue/tasks/namespaces/filter/components/Facet/FacetHistorialDeterminations.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~48 LoC) · ×1
  • Dead file (~48 LoC) app/javascript/vue/tasks/biological_associations/biological_associations_graph/components/Navbar.vue — no import path from any entry point (39 application, 4 tooling, 1 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R8 · Dependency Hygiene · Unused dependency 'shakapacker-rspack' · ×1
  • Unused dependency 'shakapacker-rspack' package.json:56 — Declared in the root package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'three' · ×1
  • Unused dependency 'three' package.json:32 — Declared in the root package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
S1 · Web-Security Posture · Third-party script without Subresource Integrity · ×1
  • Third-party script without Subresource Integrity app/views/tasks/containers/collection_layout/index.html.erb:1 — `https://cdn.jsdelivr.net/npm/echarts@5/dist/echarts.min.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. 6 such include(s) across the repository's markup.
X17 · Uncapped recursion over a caller-supplied document · Recursive walk over a caller-supplied document has no depth cap · ×1
  • Recursive walk over a caller-supplied document has no depth cap lib/utilities/hashes.rb:28 — `symbolize_keys` is public and takes `hash` — which it walks as a `Hash` — from its caller, and it calls itself at line 28 (`self.symbolize_keys`) with a piece of `hash` — and nowhere in `symbolize_keys` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. A walk like this one raises `SystemStackError` past about 3,800 levels on the main thread and about 1,000 on a `Thread` — where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). `JSON.parse` stops at 100 levels by default, but the other parsers a caller may use do not: `YAML.safe_load` builds 1,400 levels from 2.8 KB, `Oj.load` 100,000, REXML 200,000, and `JSON.load` on json 2.7 (Ruby 3.3's default) or `JSON.parse(…, max_nesting: false)` 58,000. `SystemStackError` is not a `StandardError`: a bare `rescue` or `rescue => e` around the call does not stop it. Thread a depth argument through `symbolize_keys` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Minor — 134 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×40
  • Duplicated predicate app/javascript/vue/components/radials/composables/useShortcuts.js:45 — `(isMac() && !e.ctrlKey) || (!isMac() && !e.altKey)` appears character-identically in 2 files — app/javascript/vue/components/radials/composables/useShortcuts.js, app/javascript/vue/components/radials/mixins/shortcuts.js. 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 app/javascript/vue/components/radials/composables/useShortcuts.js:49 — `activeElement === 'INPUT' || activeElement === 'TEXTAREA'` appears character-identically in 2 files — app/javascript/vue/components/radials/composables/useShortcuts.js, app/javascript/vue/components/radials/mixins/shortcuts.js. 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 app/javascript/vue/components/Form/FormBiologicalAssociation/store/biologicalAssociations.js:43 — `anatomicalPart?.origin_object_type === objectType && Number(anatomicalPart?.origin_object_id) === Number(objectId)` appears character-identically in 2 files — app/javascript/vue/components/Form/FormBiologicalAssociation/store/biologicalAssociations.js, app/javascript/vue/tasks/field_occurrences/browse/store/biologicalAssociations.js. 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 app/javascript/vue/tasks/biological_associations/new/store/store.js:210 — `biologicalAssociation.citations[0] || makeCitation()` appears character-identically in 2 files — app/javascript/vue/tasks/biological_associations/new/store/store.js, app/javascript/vue/tasks/biological_associations/new_ba/store/store.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_column_coder/helpers/makeEmptyObservationsFor.js:34 — `descriptor.componentName === ComponentNames.Continuous || descriptor.componentName === ComponentNames.Sample` appears character-identically in 2 files — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/helpers/makeEmptyObservationsFor.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/requestMatrixRow.js. 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 app/javascript/vue/tasks/images/new_image/store/mutations/addObjectForDepictions.js:3 — `item.id == value.id && item.base_class == value.base_class` appears character-identically in 2 files — app/javascript/vue/tasks/images/new_image/store/mutations/addObjectForDepictions.js, app/javascript/vue/tasks/images/new_image/store/mutations/removeObjectForDepictions.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/helpers/getObservationFromArgs.js:13 — `o.characterStateId === characterStateId && o.descriptorId === descriptorId` appears character-identically in 2 files — app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/helpers/getObservationFromArgs.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/mutations/observationSaved.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/mutations/setContinuousUnit.js:11 — `o.descriptorId === descriptorId && (o.id === observationId || o.internalId === observationId)` appears character-identically in 14 files — app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/mutations/setContinuousUnit.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/mutations/setContinuousValue.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/mutations/setDayFor.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/mutations/setMonthFor.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/removeObservation.js:40 — `o.descriptorId === descriptorId && o.characterStateId === characterStateId` appears character-identically in 3 files — app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/removeObservation.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/getters/getCharacterStateChecked.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/mutations/setCharacterStateChecked.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/saveObservation.js:7 — `o.descriptorId === descriptorId && o.isUnsaved` appears character-identically in 2 files — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/saveObservation.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/saveObservationsFor.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setRowObjectSavedOnce.js:6 — `o.id === rowObjectId && o.type === rowObjectType` appears character-identically in 3 files — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setRowObjectSavedOnce.js, app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setRowObjectSaving.js, app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setRowObjectUnsaved.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_column_coder/helpers/getObservationFromArgs.js:20 — `o.rowObjectId === rowObjectId && o.rowObjectType === rowObjectType` appears character-identically in 8 files — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/helpers/getObservationFromArgs.js, app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/removeObservation.js, app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/getters/getFreeTextValueFor.js, app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/getters/getObservationsFor.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setContinuousUnit.js:14 — `o.rowObjectId === rowObjectId && o.rowObjectType === rowObjectType && (o.id === observationId || o.internalId === observationId)` appears character-identically in 14 files — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setContinuousUnit.js, app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setContinuousValue.js, app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setDayFor.js, app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setMonthFor.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/removeObservation.js:47 — `o.rowObjectId === rowObjectId && o.rowObjectType === rowObjectType && o.characterStateId === characterStateId` appears character-identically in 3 files — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/removeObservation.js, app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/getters/getCharacterStateChecked.js, app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setCharacterStateChecked.js. 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 app/javascript/vue/tasks/anatomical_parts/anatomical_parts_graph/utils/isEqualNodeObject.js:2 — `obj1.id === obj2.id && obj1.objectType === obj2.objectType` appears character-identically in 2 files — app/javascript/vue/tasks/anatomical_parts/anatomical_parts_graph/utils/isEqualNodeObject.js, app/javascript/vue/tasks/biological_associations/biological_associations_graph/utils/isEqualNodeObject.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/saveObservation.js:29 — `observation.id && !observation.isChecked` appears character-identically in 3 files — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/saveObservation.js, app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/saveObservationsFor.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/saveObservationsFor.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/saveObservation.js:57 — `observation.id || observation.internalId` appears character-identically in 3 files — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/saveObservation.js, app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/actions/saveObservationsFor.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/actions/saveObservationsFor.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setObservation.js:8 — `observation.type === ObservationTypes.Qualitative && !observation.characterStateId` appears character-identically in 2 files — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setObservation.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/mutations/setObservation.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_column_coder/helpers/makeQualitativeObservation.js:6 — `observationData.characterStateId || observationData.character_state_id` appears character-identically in 2 files — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/helpers/makeQualitativeObservation.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/helpers/makeQualitativeObservation.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_column_coder/helpers/makeBaseObservation.js:5 — `observationData.descriptorId || observationData.descriptor_id` appears character-identically in 2 files — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/helpers/makeBaseObservation.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/helpers/makeBaseObservation.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_column_coder/helpers/makeSampleObservation.js:12 — `observationData.sample_standard_deviation || null` appears character-identically in 2 files — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/helpers/makeSampleObservation.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/helpers/makeSampleObservation.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_column_coder/helpers/makeSampleObservation.js:13 — `observationData.sample_standard_error || null` appears character-identically in 2 files — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/helpers/makeSampleObservation.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/helpers/makeSampleObservation.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_column_coder/helpers/makeContinuousObservation.js:11 — `observationData?.continuous_value || null` appears character-identically in 2 files — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/helpers/makeContinuousObservation.js, app/javascript/vue/tasks/observation_matrices/matrix_row_coder/store/helpers/makeContinuousObservation.js. 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 app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/countdownStartedFor.js:2 — `r.id === rowObjectId && r.type === rowObjectType` appears character-identically in 18 files — app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/countdownStartedFor.js, app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setCharacterStateChecked.js, app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setContinuousUnit.js, app/javascript/vue/tasks/observation_matrices/matrix_column_coder/store/mutations/setContinuousValue.js. 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 app/javascript/vue/tasks/biological_associations/new/store/store.js:92 — `state.object && state.subject && state.relationship` appears character-identically in 2 files — app/javascript/vue/tasks/biological_associations/new/store/store.js, app/javascript/vue/tasks/biological_associations/new_ba/store/store.js. 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.
  • + 15 more in this group — see findings.md.
X7 · Silent fallback defaults · Pending state with no failure state · ×40
  • Pending state with no failure state app/javascript/vue/tasks/unify/objects/components/ButtonMerge.vue:14 — The view draws `<VSpinner v-if="isSaving" full-screen />` under `isSaving`, but `isSaving` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/unify/objects/components/PreviewMerge.vue:10 — The view draws `(isModalVisible = false)" > Preview { onMerge() isModalVisible = false } " />` under `isModalVisible`, but `isModalVisible` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/taxon_name_relationships/filter/app.vue:52 — The view draws `<VSpinner v-if="isLoading" full-screen legend="Searching..." :logo-size="{ width: '100px', height: '100px' }" />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/sources/verbatim_author_year_source/components/PageNumbersModal.vue:10 — The view draws `<VSpinner v-if="isLoading" legend="Loading..." />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/sources/verbatim_author_year_source/components/PreviewModal.vue:10 — The view draws `<VSpinner v-if="isLoading" legend="Loading TaxonNames..." />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/sources/verbatim_author_year_source/components/SourceSelectionModal.vue:42 — The view draws `<VSpinner v-if="isLoading" legend="Loading recent sources..." />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/sources/filter/App.vue:82 — The view draws `<VSpinner v-if="isLoading" full-screen legend="Searching..." :logo-size="{ width: '100px', height: '100px' }" />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/sources/filter/components/BibliographyDownload.vue:3 — The view draws `<VSpinner full-screen v-if="isLoading" />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/sounds/filter/app.vue:42 — The view draws `<VSpinner v-if="isLoading" full-screen legend="Searching..." :logo-size="{ width: '100px', height: '100px' }" />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/sounds/browse/components/Panel/PanelAnnotations.vue:4 — The view draws `<VSpinner v-if="isLoading" />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/people/filter/app.vue:42 — The view draws `<VSpinner v-if="isLoading" full-screen legend="Searching..." :logo-size="{ width: '100px', height: '100px' }" />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/people/author_by_letter/app.vue:3 — The view draws `<VSpinner v-if="isLoading" full-screen legend="Loading..." :logo-size="{ width: '100px', height: '100px' }" />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/otus/new_otu/app.vue:3 — The view draws `<VSpinner v-if="isLoading" full-screen />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/otus/new_otu/app.vue:7 — The view draws `<VSpinner v-if="isCreating" full-screen legend="Creating OTUs..." />` under `isCreating`, but `isCreating` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/otus/material_examined/App.vue:83 — The view draws `<VSpinner v-if="isLoading" full-screen legend="Loading..." :logo-size="{ width: '100px', height: '100px' }" />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/otus/match_by_taxon_name/app.vue:3 — The view draws `<VSpinner v-if="isProcessing" full-screen legend="Matching names..." />` under `isProcessing`, but `isProcessing` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/otus/browse/components/Shared/ModalDepictions.vue:13 — The view draws `<VSpinner v-if="isLoading" full-screen />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/otus/assign_taxon_name/app.vue:3 — The view draws `<VSpinner v-if="isLoading" full-screen />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/otu/filter/App.vue:69 — The view draws `<VSpinner v-if="isLoading" full-screen legend="Searching..." :logo-size="{ width: '100px', height: '100px' }" />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/otu/browse_asserted_distributions/app.vue:3 — The view draws `<VSpinner v-if="isLoading" full-screen />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/observations/filter/App.vue:59 — The view draws `<VSpinner v-if="isLoading" full-screen legend="Searching..." :logo-size="{ width: '100px', height: '100px' }" />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/observation_matrices/new/components/rows/copyRows.vue:14 — The view draws `<VSpinner v-if="isLoading" legend="Loading..." />` under `isLoading`, but `isLoading` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/observation_matrices/new/components/rows/dynamic.vue:8 — The view draws `<VSpinner v-if="loadingTag" />` under `loadingTag`, but `loadingTag` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/observation_matrices/new/components/rows/dynamic.vue:35 — The view draws `<VSpinner v-if="loadingTaxon" />` under `loadingTaxon`, but `loadingTaxon` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • Pending state with no failure state app/javascript/vue/tasks/observation_matrices/matrix_column_coder/MatrixColumnCoder/CodeColumn/CodeColumn.vue:38 — The view draws `<VSpinner v-if="isPopulating" fullscreen legend="Populating rows..." />` under `isPopulating`, but `isPopulating` is settled by a load that can fail and the component draws no failure state, so a failed load is shown as "not yet" for ever, or as the loaded state over its initial value. Give the component a failure state and draw it.
  • + 15 more in this group — see findings.md.
D31 · IaC & Container Security · Low IaC · ×21
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D34 · Knowledge Freshness · Orphaned file · ×15
  • Orphaned file app/javascript/vue/components/radials/annotator/images/identifier.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file app/javascript/vue/components/radials/annotator/images/alternateValue.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file app/javascript/vue/components/radials/annotator/images/book.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file app/javascript/vue/tasks/collecting_events/stepwise/collectors/composables/useStore.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file lib/batch_load/import/sequences/primers_interpreter.rb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file app/javascript/vue/components/radials/annotator/images/protocol.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file app/javascript/vue/components/radials/annotator/images/data_attribute.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file lib/batch_load/import/sequence_relationships/primers_interpreter.rb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file app/javascript/vue/components/radials/annotator/images/documentation.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file app/javascript/vue/tasks/collecting_events/stepwise/collectors/app.vue:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file app/javascript/vue/tasks/collecting_events/stepwise/collectors/components/CollectingEvent/CollectingEventRow.vue:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file REDACTED:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file app/javascript/vue/tasks/collecting_events/stepwise/collectors/components/CollectingEvent/CollectingEventList.vue: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.
D16 · Bus Factor · Off-boarding risk · ×4
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 175 significant file(s) lose their only recent owner: lib/export/dwca/checklist/occurrence_normalizer.rb, lib/export/dwca/occurrence/media_exporter.rb, lib/export/dwca/checklist/data.rb, lib/match/otu/taxon_name.rb, lib/export/dwca/occurrence/data.rb, REDACTED, REDACTED, REDACTED (+167 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 149 significant file(s) lose their only recent owner: lib/utilities/geo.rb, app/javascript/vue/components/Filter/Table/TableResults.vue, app/javascript/vue/tasks/data_attributes/field_synchronize/components/Table/VTable.vue, app/assets/javascripts/workbench/pinboard.js, app/javascript/vue/tasks/data_attributes/multi_update/components/DataAttributeTable.vue, app/javascript/vue/tasks/data_attributes/field_synchronize/composables/useFieldSync.js, app/javascript/vue/tasks/biological_associations/new_ba/store/store.js, app/javascript/vue/components/radials/annotator/annotator.vue (+141 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #3 — If anonymized user #3 becomes unavailable, 15 significant file(s) lose their only recent owner: lib/utilities/material_examined.rb, app/javascript/vue/tasks/containers/collection_layout/components/SvgGrid.vue, app/models/protonym/format.rb, app/javascript/vue/tasks/otus/assign_taxon_name/app.vue, REDACTED, lib/export/coldp.rb, app/javascript/vue/tasks/otus/assign_taxon_name/components/MatchOptionsPanel.vue, lib/utilities/darwin_core/compact.rb (+7 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #4 — If anonymized user #4 becomes unavailable, 4 significant file(s) lose their only recent owner: app/models/dataset_record/darwin_core/occurrence.rb, app/models/import_dataset/darwin_core/checklist.rb, app/models/import_dataset/darwin_core.rb, app/models/dataset_record.rb. Pair on, review, or document these before any departure.
D41 · Kernel & Syscall Confinement · No seccomp profile · ×2
  • No seccomp profile REDACTED:21 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:21 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 3 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 (348 single-owned of 1227 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; 1227 of the 5688 production source files in this repository met that bar). They are anonymized user #5 (2 file(s)), anonymized user #6 (2 file(s)), anonymized user #7 (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: app/javascript/vue/tasks/leads/cite_key/app.vue, app/javascript/vue/components/QuickTagPicker.vue, config/initializers/constants/model/taxon_names.rb, app/models/taxon_name_relationship/iczn/invalidating/synonym/forgotten_name.rb, app/javascript/vue/tasks/biological_relationships/composer/components/Edit/Relationship.vue.
D19 · Documentation Quality · Documentation · ×1
  • Documentation: no build, run or usage example README.md:1 — the repository holds project manifests and neither `README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found config.ru:1 — 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/`. ADRs are expected here because `config.ru` makes this repository a deployable product (line 1).
D28 · Secrets (history) · Rotate the exposed credentials · ×1
  • REDACTED
D34 · Knowledge Freshness · Orphaned files with no living knowledge · ×1
  • Orphaned files with no living knowledge — 15 of 1261 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; 1261 of the 5688 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: app/javascript/vue/components/radials/annotator/images/identifier.js, app/javascript/vue/components/radials/annotator/images/alternateValue.js, app/javascript/vue/components/radials/annotator/images/book.js, app/javascript/vue/tasks/collecting_events/stepwise/collectors/composables/useStore.js, lib/batch_load/import/sequences/primers_interpreter.rb, app/javascript/vue/components/radials/annotator/images/protocol.js, app/javascript/vue/components/radials/annotator/images/data_attribute.js, lib/batch_load/import/sequence_relationships/primers_interpreter.rb (and 7 more). 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.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D40 · Network Egress Confinement · No network policy · ×1
  • No network policy — No Kubernetes NetworkPolicy (or Cilium policy) found. Without one, every pod can talk to every other pod and reach out to the internet by default. Add a default-deny policy and open only the flows you need.
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.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation package.json:4 — `package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
X5 · Nullable reference types · Ruby's type checker does not check nil everywhere · ×1
  • Ruby's type checker does not check nil everywhere — This repository commits no Sorbet configuration (`sorbet/config`) and no `Steepfile`, so nothing type-checks its 2235 Ruby product file(s): a nilable value reaches a method call silently and raises `NoMethodError: undefined method … for nil` the first time it is nil. A `# typed:` sigil does nothing without a `sorbet/config` beside the code; a Steep run configured only on a command line is not something this check can read.
Minor — 5 finding(s)
D12 · Dependency Hygiene · Outdated · ×5
  • Outdated: logical_query_parser — `logical_query_parser` is resolved to 0.6.0 in the committed REDACTED but 0.7.0 is the current release on rubygems.org, and Gemfile declares no version requirement for it, so nothing but the lockfile is holding it back. This build is therefore missing every fix published since, including any security fix. Run `bundle update logical_query_parser` and commit the updated REDACTED.
  • Outdated: puma — `puma` is resolved to 8.0.2 in the committed REDACTED but 8.1.1 is the current release on rubygems.org, and it already satisfies the `"~> 8.0"` requirement declared in Gemfile — so the lockfile is behind this repository's own declared range. This build is therefore missing every fix published since, including any security fix. Run `bundle update puma` and commit the updated REDACTED.
  • Outdated: rgeo — `rgeo` is resolved to 3.0.1 in the committed REDACTED but 3.1.0 is the current release on rubygems.org, and it already satisfies the `"~> 3.0"` requirement declared in Gemfile — so the lockfile is behind this repository's own declared range. This build is therefore missing every fix published since, including any security fix. Run `bundle update rgeo` and commit the updated REDACTED.
  • Outdated: rspec-rails — `rspec-rails` is resolved to 8.0.4 in the committed REDACTED but 8.1.0 is the current release on rubygems.org, and it already satisfies the `"~> 8.0"` requirement declared in Gemfile — so the lockfile is behind this repository's own declared range. This build is therefore missing every fix published since, including any security fix. Run `bundle update rspec-rails` and commit the updated REDACTED.
  • Outdated: thruster — `thruster` is resolved to 0.1.27 in the committed REDACTED but 0.1.28 is the current release on rubygems.org, and Gemfile declares no version requirement for it, so nothing but the lockfile is holding it back. This build is therefore missing every fix published since, including any security fix. Run `bundle update thruster` and commit the updated REDACTED.

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/canine-gitleaks.toml --log-opts "--full-history --all --skip=0 --max-count=200" --report-format json --report-path /tmp/watchdog-gitleaks-854a8dfb714c48caa97c29ef6e98b41b/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=200 --max-count=800" --report-format json --report-path /tmp/watchdog-gitleaks-854a8dfb714c48caa97c29ef6e98b41b/history-1.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-1.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=1000 --max-count=3200" --report-format json --report-path /tmp/watchdog-gitleaks-854a8dfb714c48caa97c29ef6e98b41b/history-2.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-2.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=4200 --max-count=12800" --report-format json --report-path /tmp/watchdog-gitleaks-854a8dfb714c48caa97c29ef6e98b41b/history-3.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-3.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=17000 --max-count=16204" --report-format json --report-path /tmp/watchdog-gitleaks-854a8dfb714c48caa97c29ef6e98b41b/history-4.json --exit-code 0 --source .8artifacts/raw/gitleaks-history-4.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-854a8dfb714c48caa97c29ef6e98b41b/tree.json --exit-code 0 --source .4artifacts/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/canine-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 --exclude app/assets/javascripts/vendor/src/jquery --exclude app/assets/javascripts/vendor/src/markdown .612artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .4artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .84artifacts/raw/trivy-config.json
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.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—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — The repository ships application workloads but no cluster-governance resources (CRDs, admission webhooks, or a committed policy engine). Runtime threat-detection (Falco/Tetragon) and admission control (Kyverno/OPA-Gatekeeper/PodSecurity) are cluster-OPERATOR controls owned by the platform, not shipped by an application repo/chart — nothing for this repo to assess.0—
D43 · Malicious Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .0artifacts/raw/trivy-fs.json

Run 01a1e588-da33-7ae4-a065-c823e8a7c58e · 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