Public report of MAIF/daikoku, published 17 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, 17 November 2026, 11:19 UTC · Survey ID cd_3b76ac05eb90441d8c41177d1d15ad56

MAIF/daikoku

Measured 17 November 2026, 11:17 UTC, at code version ca83878

First survey, so nothing to compare with yet
CAI score 44.8out of 100 At risk

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: 103,805 lines of product code in 5 projects, tests not counted · Estimated rebuild effort: about 1.1 person-years · Weakest lens: Production Readiness, 40.0

Findings by how serious they are

327 critical 1189 serious 138 minor

11 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
17 November 2026, 11:17 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.

A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.

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

85of 85 dimensions measured by tools.
1620of 1654 findings point to an exact file and line, so you can open each one in the code. The other 34 concern the repository as a whole, such as missing documentation.
85dimensions across 9 lenses, read from 103,805 lines of product code in 5 projects.
Chapters

Executive summary

MAIF/daikoku is rated At risk because critical security findings are open. Its score is held back because 17 passwords or keys sit in the current code and we found no automated security scanning of the code, its secrets or its dependencies. It scores 44.8 out of 100, which the At risk rating leaves unchanged.

Production Readiness, at 40.0, is the weakest lens and counts most in the score. The best first step for the work it takes is making the tests check their results, worth about 3.7 points. Replacing the 17 exposed passwords or keys and switching the old ones off would lift Production Readiness itself, worth about 4.1 points. Raising Production Readiness to 70 would lift the score to about 48.7.

Seventy-six weaknesses in the code could be used by an attacker. Forty-seven known security holes in the packages the code depends on can be used by attackers. Fixing the weaknesses the scanner points to and updating the vulnerable packages would close both risks. Pinning each tool to an exact version would fix the 45 pipeline tools referenced by a changeable name, and the 17 passwords or keys in the code and the ten passwords or keys in the code's history need replacing, with the old ones switched off. The 26 controls that only work with a mouse need to work with the keyboard, or to become a real button.

The product code is 103,805 lines, about €160,000 to rebuild.

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

How the score is built: what each lens counts for The lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Production Readiness 40.0 · counts for 45%Accessibility 42.5 · counts for 25%Code Health 49.4 · counts for 14%Event-Driven 51.9 · counts for 8%Architecture 58.4 · counts for 4%Security and Compliance 58.7 · counts for 2%Performance 60.0 · counts for 1%Maturity 90.1 · counts for 1%Domain Modelling 100.0 · counts for 0%

If Production Readiness rose from 40.0 to 70, the lowest score rated Strong, the score would rise from 44.8 to about 48.7.

Code composition: what the lines of code are
Product code 68%Tests 32%
Rebuild cost: about €160,000 · Estimate
Cost to rebuild€52,000 to €260,000, for 862 to 2,734 hours of work, about 1.1 person-years for 1 to 3 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 45. 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: 103,805 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 1 No assertions (empty test) finding(s) in Test Quality — start with connectedUser.spec.ts.
Raises the score by about 3.7 points · Low effort · Test Quality
2
Resolve the 5 No assertions finding(s) in Test Quality — start with otoroshi-calls.spec.ts (2), connection-oidc.spec.ts, admin_api.spec.ts.
Raises the score by about 2.1 points · Low effort · Test Quality
3
Resolve the 17 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED (17).
Raises the score by about 4.1 points · Medium effort · REDACTED Scanning

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 €160,000 to build again, about 1.1 person-years of work. Its weakest lens is Production Readiness, at 40.0 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No assertions (empty test) finding(s) in Test Quality. Of all the actions in this report, it raises the score most for the work it takes: about 3.7 points for low effort, because it clears the 1 Test Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.5 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 6% to 14% on every change. The history of the code shows how much it changes: about 68,213 lines over the last 90 days, which is about 276,642 lines a year. At that pace, the extra work comes to an estimated 42.7 to 256.1 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of 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.

178 modules, with 182 dependencies between them. 2 loops run through 17 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 138 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 daikoku.bin2 daikoku.javascript.src.components.utils.dnd.SortableList3 daikoku.javascript.src.types.team4 daikoku.logging.error5 daikoku.models.folder6 daikoku.commands.cms7 daikoku.commands.environments8 daikoku.javascript.src.components.backoffice.apis.TeamApiSubscriptions9 daikoku.javascript.src.components.utils.dnd10 daikoku.javascript.src.types.types11 fr.maif.daikoku.login12 fr.maif.daikoku.utils13 daikoku.commands.pull14 daikoku.commands.watch15 daikoku.javascript.src.types.tenant16 fr.maif.daikoku.services17 daikoku.javascript.src.types.context18 daikoku.javascript.src.types.gql19 fr.maif.daikoku.storage20 daikoku.javascript.src.types.api21 fr.maif.daikoku.env22 daikoku.javascript.src23 daikoku.javascript.src.components.backoffice.apikeys.KeyringCard24 daikoku.javascript.src.components.backoffice.apis.TeamApiTesting25 daikoku.javascript.src.components.utils26 daikoku.javascript.src.contexts27 daikoku.javascript.src.contexts.modals.types28 fr.maif.daikoku.audit29 daikoku.javascript.src.components.backoffice.apikeys30 daikoku.javascript.src.components.backoffice.apis31 fr.maif.daikoku.domain32 fr.maif.daikoku.controllers33 fr.maif.daikoku.services.catalog34 fr.maif.daikoku.storage.drivers.postgres35 fr.maif.daikoku.actions36 fr.maif.daikoku.jobs37 fr.maif.daikoku.services.catalog.RemoteCatalogEngine38 fr.maif.daikoku.services.catalog.sources39 fr.maif.daikoku.controllers.authorizations40 fr.maif.daikoku.storage.graphql.GraphQLImplicits
1 daikoku.bin
2 daikoku.javascript.src.components.utils.dnd.SortableList
3 daikoku.javascript.src.types.team
4 daikoku.logging.error
5 daikoku.models.folder
6 daikoku.commands.cms111
7 daikoku.commands.environments1
8 daikoku.javascript.src.components.backoffice.apis.TeamApiSubscriptions11
9 daikoku.javascript.src.components.utils.dnd5
10 daikoku.javascript.src.types.types11
11 fr.maif.daikoku.login5195
12 fr.maif.daikoku.utils291234
13 daikoku.commands.pull11
14 daikoku.commands.watch31
15 daikoku.javascript.src.types.tenant311
16 fr.maif.daikoku.services61265105
17 daikoku.javascript.src.types.context12
18 daikoku.javascript.src.types.gql3117
19 fr.maif.daikoku.storage1482
20 daikoku.javascript.src.types.api4111
21 fr.maif.daikoku.env39410
22 daikoku.javascript.src55219
23 daikoku.javascript.src.components.backoffice.apikeys.KeyringCard111
24 daikoku.javascript.src.components.backoffice.apis.TeamApiTesting12
25 daikoku.javascript.src.components.utils431234
26 daikoku.javascript.src.contexts1111
27 daikoku.javascript.src.contexts.modals.types221
28 fr.maif.daikoku.audit1761
29 daikoku.javascript.src.components.backoffice.apikeys11
30 daikoku.javascript.src.components.backoffice.apis111
31 fr.maif.daikoku.domain811431
32 fr.maif.daikoku.controllers59640291019
33 fr.maif.daikoku.services.catalog25
34 fr.maif.daikoku.storage.drivers.postgres3691117
35 fr.maif.daikoku.actions1151
36 fr.maif.daikoku.jobs412561
37 fr.maif.daikoku.services.catalog.RemoteCatalogEngine121
38 fr.maif.daikoku.services.catalog.sources599
39 fr.maif.daikoku.controllers.authorizations22312
40 fr.maif.daikoku.storage.graphql.GraphQLImplicits121
Uses a module listed above itPart of a loopThe module itself
1 daikoku.bin2 daikoku.javascript.src.components.utils.dnd.SortableList3 daikoku.javascript.src.types.team4 daikoku.logging.error5 daikoku.models.folder6 daikoku.commands.cms7 daikoku.commands.environments8 daikoku.javascript.src.components.backoffice.apis.TeamApiSubscriptions9 daikoku.javascript.src.components.utils.dnd10 daikoku.javascript.src.types.types11 fr.maif.daikoku.login12 fr.maif.daikoku.utils13 daikoku.commands.pull14 daikoku.commands.watch15 daikoku.javascript.src.types.tenant16 fr.maif.daikoku.services17 daikoku.javascript.src.types.context18 daikoku.javascript.src.types.gql19 fr.maif.daikoku.storage20 daikoku.javascript.src.types.api21 fr.maif.daikoku.env22 daikoku.javascript.src23 daikoku.javascript.src.components.backoffice.apikeys.KeyringCard24 daikoku.javascript.src.components.backoffice.apis.TeamApiTesting25 daikoku.javascript.src.components.utils26 daikoku.javascript.src.contexts27 daikoku.javascript.src.contexts.modals.types28 fr.maif.daikoku.audit29 daikoku.javascript.src.components.backoffice.apikeys30 daikoku.javascript.src.components.backoffice.apis31 fr.maif.daikoku.domain32 fr.maif.daikoku.controllers33 fr.maif.daikoku.services.catalog34 fr.maif.daikoku.storage.drivers.postgres35 fr.maif.daikoku.actions36 fr.maif.daikoku.jobs37 fr.maif.daikoku.services.catalog.RemoteCatalogEngine38 fr.maif.daikoku.services.catalog.sources39 fr.maif.daikoku.controllers.authorizations40 fr.maif.daikoku.storage.graphql.GraphQLImplicitsdaikoku.bin1daikoku.javascript.src.components.utils.dnd.SortableList2daikoku.javascript.src.types.team3daikoku.logging.error4daikoku.models.folder5daikoku.commands.cms6daikoku.commands.environments7daikoku.javascript.src.components.backoffice.apis.TeamApiSubscriptions8daikoku.javascript.src.components.utils.dnd9daikoku.javascript.src.types.types10fr.maif.daikoku.login11fr.maif.daikoku.utils12daikoku.commands.pull13daikoku.commands.watch14daikoku.javascript.src.types.tenant15fr.maif.daikoku.services16daikoku.javascript.src.types.context17daikoku.javascript.src.types.gql18fr.maif.daikoku.storage19daikoku.javascript.src.types.api20fr.maif.daikoku.env21daikoku.javascript.src22daikoku.javascript.src.components.backoffice.apikeys.KeyringCard23daikoku.javascript.src.components.backoffice.apis.TeamApiTesting24daikoku.javascript.src.components.utils25daikoku.javascript.src.contexts26daikoku.javascript.src.contexts.modals.types27fr.maif.daikoku.audit28daikoku.javascript.src.components.backoffice.apikeys29daikoku.javascript.src.components.backoffice.apis30fr.maif.daikoku.domain31fr.maif.daikoku.controllers32fr.maif.daikoku.services.catalog33fr.maif.daikoku.storage.drivers.postgres34fr.maif.daikoku.actions35fr.maif.daikoku.jobs36fr.maif.daikoku.services.catalog.RemoteCatalogEngine37fr.maif.daikoku.services.catalog.sources38fr.maif.daikoku.controllers.authorizations39fr.maif.daikoku.storage.graphql.GraphQLImplicits40111111511519529123411313116126510512311714824111394105521911112431234111122117611111181143159640291019253691117115141256112159922312121+138 more modules (most-connected shown)

At a glance — Code Health · 49.4 · Weak · gated by D2, X5 ·

At a glance — Architecture · 58.4 · Adequate · gated by D26, R9 ·

At a glance — Maturity · 90.1 · Exemplary ·

At a glance — Readiness · 40.0 · Weak · gated by D13, R8, P3 ·

At a glance — Security · 58.7 · Adequate · gated by D28, D29, D36 ·

At a glance — Domain Modelling · 100.0 · Exemplary ·

At a glance — Event-Driven · 51.9 · Adequate ·

At a glance — Accessibility · 42.5 · Weak · gated by AC4 ·

At a glance — Performance · 60.0 · Adequate ·

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 — Injection161High / Critical
A03:2025 — Software Supply Chain Failures111High / Critical
A07:2025 — Authentication Failures34High / Critical
A02:2025 — Security Misconfiguration26High / Critical

Roadmap

Top priorities: Resolve the 17 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED (17); Resolve the 1 No assertions (empty test) finding(s) in Test Quality — start with connectedUser.spec.ts; Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.

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

Do thisHelpsEffortDimension
Resolve the 1 No assertions (empty test) finding(s) in Test Quality — start with connectedUser.spec.ts.+3.7 ptsLowTest Quality
Resolve the 5 No assertions finding(s) in Test Quality — start with otoroshi-calls.spec.ts (2), connection-oidc.spec.ts, admin_api.spec.ts.+2.1 ptsLowTest Quality
Resolve the 17 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED (17).+4.1 ptsMediumREDACTED Scanning
Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.+3.4 ptsMediumSecurity & performance tooling
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.+3.4 ptsMediumDependency Hygiene
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.+2.5 ptsMediumKeyboard semantics
Resolve the 1 REDACTED finding(s) in REDACTED Scanning — start with REDACTED.+1.2 ptsLowREDACTED Scanning
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.+1.3 ptsMediumForms & labels

File quality

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

FileScoreBandWorst signal
REDACTED0.0SlopREDACTED Scanning: Leaked secret: REDACTED
REDACTED0.0SlopDependency Vulnerabilities: Critical CVE: REDACTED
REDACTED0.0SlopDependency Vulnerabilities: Critical CVE: REDACTED
REDACTED0.2SlopStatic Analysis (SAST): High: REDACTED
REDACTED0.4SlopDependency Vulnerabilities: Critical CVE: REDACTED
REDACTED0.5SlopStatic Analysis (SAST): High: REDACTED
REDACTED1.1SlopStatic Analysis (SAST): High: REDACTED
REDACTED1.6SlopStatic Analysis (SAST): High: REDACTED
REDACTED1.6SlopStatic Analysis (SAST): High: REDACTED
REDACTED1.6SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.2SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.3SlopIaC & Container Security: High IaC: REDACTED
REDACTED2.5SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.7SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.7SlopIaC & Container Security: High IaC: REDACTED
REDACTED3.0SlopIaC & Container Security: High IaC: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: 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 — 327

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

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

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

Could not be resolved — 11

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 85 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 — 85 dimensions across the health lenses
D1D2D3D4D5D6D7D10D12D13D14D15D16D17D19D20D24D26D28D29D30D31D34D35D36D37D40D41D43AC1AC2AC3AC4AC5AC6AX10AX2AX3AX4AX6AX8AX9DM12DM6DM9ED1GD1IC1M1M2M3M4P1P2P3P4P5P6PF3R1R10R11R2R3R4R5R6R7R8R9S1X1X12X16X18X21X23X24X25X27X28X29X3X30X5

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, 1620 of 1654 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 01a1e939-c68d-7242-add2-c9af62cf55e2.

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: the JavaScript/TypeScript half could not be measured — the JavaScript/TypeScript suite(s) run through a browser-driven runner the coverage collector does not drive — daikoku/javascript/ (@playwright/test), daikoku/javascript/tests/ (@playwright/test) — a gap in the analyzer, not something this repository is missing. Coverage is excluded from the score rather than counted as a near-zero. This is OUR limitation, 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 142 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 63 test source file(s) (.scala, .rs) 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 (.scala, .ts, .rs, .js) and this repository declares an sbt build (repository root, 49 test files), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • 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 an sbt build (build.sbt), but the licence verdict published here was taken over its crate dependencies. Nothing was read about its sbt dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
  • 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 REDACTED, but the licence verdict published here was taken over its crate 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.
  • D19 Documentation 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. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
  • D20 ADR 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 ADR lexicon (adr-lexicon-1) covers de, en, it, nl. A record identified as another language, or whose language could not be identified (fewer than 25 words of prose, or no clear winner), is never read with English rules: its missing-section, status, consequence-cost and same-question rules abstain, and only the structural rules (title, single option, dangling link, enforcement field) run.
  • 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. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
  • 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.
  • 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 — 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. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is an ADMISSION gap, not an environment fault: no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict. For npm the surface is what a published REDACTED's entry points (exports, main, module, types) export, followed through the source; an entry that names build output the tree does not commit (dist/, build/) is not followed back to source, because only a tsconfig outDir/rootDir pair states that mapping and a bundler's input lives in executable configuration this engine does not evaluate.
  • 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.
  • D27 Navigability — 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. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
  • D28 Secrets (history) — 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 newest 4004 of 4267 commits were scanned for secrets, back to commit c90c2eb2c99b; older commits were not. `gitleaks` TIMED OUT after 25.2s against a 25.2s budget, so we killed its process tree. The budget is ours; the work may simply be larger than it allows. The working tree WAS scanned in full, and every row of the scanned ranges is reported. Nothing about the unscanned commits is asserted by the absence of a result; the budget is ours to raise.
  • D32 Data Compliance (PII/GDPR) — 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. `daikoku/app/fr/maif/daikoku/login/oauth.scala`, `daikoku/app/fr/maif/daikoku/services/ApiService.scala`, `daikoku/app/fr/maif/daikoku/utils/Time.scala`, `daikoku/javascript/src/apps/DaikokuHomeApp.tsx`, `daikoku/javascript/src/components/adminbackoffice/cms/index.tsx`, … (+97 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
  • D41 Kernel & Syscall Confinement — 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. Kubernetes/helm/daikoku/templates/deployment.yaml:2, REDACTED:73, REDACTED:175, REDACTED:4, kubernetes/helm/daikoku/templates/openldap.yaml:42, REDACTED:3 did not read as a pod spec (a templated manifest such as Helm's that is not YAML until rendered, or a workload whose pod spec this check does not locate), so the seccomp/AppArmor profile in force there was not judged and no row about them can appear on this card.
  • D44 Platform End-of-Life — 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 dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a Dockerfile) is simply not read here yet.
  • 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. 75 further occurrence(s) are not listed individually; the score already reflects all 115.
  • 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. 20 further occurrence(s) are not listed individually; the score already reflects all 60.
  • AC6 Visual & motion safety — 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. 3 further occurrence(s) are not listed individually; the score already reflects all 43.
  • AX1 Captive dependencies — 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 Microsoft.Extensions.DependencyInjection registrations in C# and Spring beans in Java/Kotlin only, and this repository's container is MacWire, whose lifetimes are not modelled yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • AXR1 Runtime accessibility — not measured this run — 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. Render strategy: boot via DockerCompose (demo/docker-compose.dev.yml). compose up failed (exit 18 — an image could not be pulled) — api-dev Pulling kibana Pulling nginx Pulling otoroshi Pulling redis Pulling elastic Error Get "https://docker.elastic.co/v2/": Forbidden api-dev Error context canceled kibana Error context canceled api-prod Error context canceled redis Error context canceled otoroshi Error context canceled nginx Error context canceled Error response from daemon: Get "https://docker.elastic.co/v2/": Forbidden; the earlier `compose pull` step reported: otoroshi Pulling nginx Pulling redis Pulling kibana Pulling api-prod Pulling elastic Pulling elastic Error Get "https://docker.elastic.co/v2/": Forbidden otoroshi Error context canceled kibana Error context canceled redis Error context canceled api-prod Error context canceled nginx Error context canceled Error response from daemon: Get "https://docker.elastic.co/v2/": Forbidden; the runtime sandbox reaches registries only through the in-fence pull-through mirror, so an image the mirror does not carry cannot be fetched — this is a limit of our sandbox, not of your stack; runtime evidence skipped.
  • 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. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
  • C2 Access Controls — not measured this run — 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. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
  • DM8 Value-object opportunities — 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 finds primitive parameters that travel together through several signatures of the domain (a missing value object). Its deterministic rule has not yet shown 95 % precision on adjudicated rows, so the clumps it finds are counted here and not published as findings, and the card carries no score. That is a limit of the analyzer, not a finding about your code.
  • DM9 Scattered domain decisions — 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 frontend declares that it computes whether a construction is produced or passed, yet 97 of 1244 constructions arrived without the answer. Arm two skipped them; it did not clear them.
  • M4 Documentation accuracy — 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. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • 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. 217 further occurrence(s) are not listed individually; the score already reflects all 257.
  • R2 Cyclomatic Complexity — 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. 136 further occurrence(s) are not listed individually; the score already reflects all 176.
  • R4 Test Coverage — 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. 21 further occurrence(s) are not listed individually; the score already reflects all 61.
  • 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. 50 further occurrence(s) are not listed individually; the score already reflects all 90.
  • X27 Collection changed while being enumerated — 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 check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
  • X4 Structured logging — 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, and JavaScript/TypeScript, Java, Kotlin, Python, PHP, Dart, Ruby, Scala, Rust, Go, Swift, Erlang, F# and Visual Basic source only, and no C# was loaded, and this repository's Scala imports SLF4J but logs through a logger the reading cannot trace to it — a `log` handed down by a trait or passed in as a parameter — so its log calls cannot be judged, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

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

Limitations & what we did not check

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.
  • D7 Architectural Integrity: Layering is checked against detected/declared rules — an architecture whose boundaries live in convention or in code review, not in a rule a scanner can read, is not enforced here.
  • 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.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • 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.
  • 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.
  • AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
  • 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.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • 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 Complexity5.8 / 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 5.8 / 10 · rule-coverage 100% · ceiling Prevented

83 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was ApiPricing.ApiPricing at 104. A further 7 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 AppError.render at 56 — they are counted neither in the figure above nor in this dimension's score. 3 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: daikoku/app/fr/maif/daikoku/controllers/AppError.scala (AppError.render at 56), REDACTED (PostgresDataStore.importFromStream at 26), daikoku/javascript/src/services/customize.ts (customize.customizeFetch 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.

ApiPricing.ApiPricing (cyclomatic 104)REDACTED:913
SchemaDefinition.getSchema (cyclomatic 73)daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:147
DynamicTable.DynamicTable (cyclomatic 67)daikoku/javascript/src/components/inputs/DynamicTable.tsx:238
KeyringCard.KeyringCard (cyclomatic 60)REDACTED:207
ApiService.runSubscriptionProcess (cyclomatic 50)daikoku/app/fr/maif/daikoku/services/ApiService.scala:1348

+ 78 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 ApiPricing.ApiPricing (cyclomatic 104), SchemaDefinition.getSchema (cyclomatic 73), DynamicTable.DynamicTable (cyclomatic 67). — 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 5.8 to about 6.4/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 Complexity2.0 / 10Critical✓ 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 2.0 / 10 · rule-coverage 100% · ceiling Prevented

176 method(s) exceeded the cognitive complexity threshold of 15; the worst was AnonymousReportingJob.getData at 300.

daikoku::commands::watch::get_matching_routes (cognitive 35) · ×5cli/src/commands/watch.rs:497
AnonymousReportingJob.getData (cognitive 300)daikoku/app/fr/maif/daikoku/jobs/AnonymousReportingJob.scala:83
OtoroshiIdentityFilter.apply (cognitive 270)daikoku/app/fr/maif/daikoku/login/otoroshi.scala:79
ApiService.runSubscriptionProcess (cognitive 236)daikoku/app/fr/maif/daikoku/services/ApiService.scala:1348
DaikokuEnv.initDatastore (cognitive 143)daikoku/app/fr/maif/daikoku/env/env.scala:797

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

What to do

  1. Bring the 7 bodies over 120 down to 120 or less in Cognitive Complexity — start with AnonymousReportingJob.getData (cognitive 300), OtoroshiIdentityFilter.apply (cognitive 270), ApiService.runSubscriptionProcess (cognitive 236). — 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 7 together lifts Cognitive Complexity from 2.0 to about 3.0/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 Classes5.8 / 10Adequate✓ 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 5.8 / 10 · rule-coverage 100% · ceiling Prevented

130 god class(es) detected.

FunctionTooLong: ApiPricing.ApiPricing · ×57REDACTED:913
FileTooLong: domain/json.scala · ×40daikoku/app/fr/maif/daikoku/domain/json.scala
ClassTooLong: ApiController · ×20daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:59
MethodTooLong: OtoroshiIdentityFilter.apply · ×9daikoku/app/fr/maif/daikoku/login/otoroshi.scala:79
TooManyMethods: ApiController · ×4daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:59

What to do

  1. Resolve the 57 FunctionTooLong finding(s) in God Classes — start with REDACTED (3), SubscriptionProcessEditor.tsx (2), TeamList.tsx (2). — One of this dimension's main actionable groups (57 warning-level).
  2. Resolve the 40 FileTooLong finding(s) in God Classes — start with json.scala, SchemaDefinition.scala, ApiController.scala. — One of this dimension's main actionable groups (40 warning-level).
  3. Resolve the 20 ClassTooLong finding(s) in God Classes — start with ApiController.scala, diff_match_patch.java, REDACTED. — One of this dimension's main actionable groups (20 warning-level).

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

D4 · Code Duplication7.2 / 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 7.2 / 10 · rule-coverage 100% · ceiling Verified

164 duplicated block group(s) detected. 7.0 % of the production lines (7,300 of 103,805) are in a reported copy. A further 79 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: .tsx (28% 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 (11 lines × 2) · ×8REDACTED:375
Duplicated block (10 lines × 2) · ×8daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1470
Edited copy of a member (15 corresponding lines) · ×7daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogAdminApiController.scala:155
Duplicated block (12 lines × 2) · ×6daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3028
Duplicated block (9 lines × 2) · ×6REDACTED:220

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

What to do

  1. Resolve the 8 Duplicated block (11 lines × 2) finding(s) in Code Duplication — start with REDACTED, audit.scala, ApiController.scala. — One of this dimension's main actionable groups (8 warning-level).
  2. Resolve the 8 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with ApiController.scala (2), watch.rs (2), OtoroshiSettingsController.scala. — One of this dimension's main actionable groups (8 warning-level).
  3. Resolve the 7 Edited copy of a member (15 corresponding lines) finding(s) in Code Duplication — start with RemoteCatalogAdminApiController.scala, userEntities.scala, HomeController.scala. — One of this dimension's main actionable groups (7 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

4 production modules (Cargo+npm+sbt), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; a dependsOn spread (deps: _*) and a project whose directory a helper computes are not visible there; 0 module(s) off the main sequence, with abstractness counted on 2 of the 4 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

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

18 of 76 classes have LCOM4 above 3.

Low cohesion: ApiController (LCOM4 64) · ×18daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:59

What to do

  1. Resolve the 18 Low cohesion finding(s) in Cohesion (LCOM4) — start with AssetsController.scala (2), ApiController.scala, TeamController.scala. — One of this dimension's main actionable groups (18 warning-level).

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

D7 · Architectural Integrity6.0 / 10Adequate✓ Tool-verified

What it measures: Whether the code respects its intended layering / architecture rules.

Method: Enforcement rung (Prevented/Verified/Documented) per checkable ADR via Roslyn, plus dependency cycles via the engine shared with D5/AX3. Deterministic, exact.

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

No mechanizable ADR was identified, so enforcement is not measured. Dependency cycles not checked (no project-reference graph; where this repository's language has an import-cycle lens, cycles are reported there).

Detailed fixes: d7_recommendation.md.

D10 · Test Quality9.3 / 10Adequategated by 1 critical finding✓ Tool-verified

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

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

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

0 skipped, 6 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 142 tests. Measured on the JavaScript/TypeScript suite only — at least 63 test source file(s) (.scala, .rs) went unread, so its test quality is unmeasured and is not in these counts.

No assertions (empty test): Cascading deletiondaikoku/javascript/tests/_tests/connectedUser.spec.ts:459
No assertions: Se connecter avec un user sans role et un userRole defini · ×5daikoku/javascript/tests/specs-oidc/connection-oidc.spec.ts:37

What to do

  1. Resolve the 1 No assertions (empty test) finding(s) in Test Quality — start with connectedUser.spec.ts. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 5 No assertions finding(s) in Test Quality — start with otoroshi-calls.spec.ts (2), connection-oidc.spec.ts, admin_api.spec.ts. — One of this dimension's main actionable groups (5 warning-level).

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

D12 · Dependency Hygiene9.0 / 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.0 / 10 · rule-coverage 100% · ceiling Verified

20 outdated, 0 yanked direct Cargo dependencies. Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from REDACTED there.

Outdated: async-recursion · ×20

✓ On the Gold path — maintain.

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

D13 · REDACTED Scanning0.0 / 10Critical✓ Tool-verified

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

3 secret(s) detected. 1 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. 1 password hash(es) are listed to check and are not counted as leaked credentials.

REDACTED
REDACTED

What to do

  1. Resolve the 17 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED (17). — One of this dimension's main actionable groups (17 issue-level).
  2. Resolve the 1 REDACTED finding(s) in REDACTED Scanning — start with REDACTED. — One of this dimension's main actionable groups (1 recommendation-level).

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

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

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

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

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

0 of 324 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's REDACTED closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. This repository publishes itself under MIT OR Apache-2.0, which is its own choice and is not judged here. ★ COVERAGE OF THIS VERDICT: it grades this repository's crate dependencies and nothing else. The repository also declares an sbt build (build.sbt) and REDACTED, and the licences of those dependency graphs 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.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

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

Top hotspots: daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala (25×73=1825); REDACTED (16×104=1664); daikoku/app/fr/maif/daikoku/services/ApiService.scala (19×50=950) Repeated repair below the complexity floor: daikoku/javascript/src/components/backoffice/apikeys/TeamApiKeysForApi.tsx (14 of 20 changes were fixes); daikoku/javascript/src/components/frontend/api/ApiSubscriptions.tsx (4 of 5 changes were fixes)

Hotspot: daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala · ×21daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:147
Repeated repair: daikoku/javascript/src/components/backoffice/apikeys/TeamApiKeysForApi.tsx · ×2daikoku/javascript/src/components/backoffice/apikeys/TeamApiKeysForApi.tsx:52

What to do

  1. Resolve the 21 Hotspot finding(s) in Churn × Complexity Hotspots — start with SchemaDefinition.scala, REDACTED, ApiService.scala. — One of this dimension's main actionable groups (21 warning-level).
  2. Resolve the 2 Repeated repair finding(s) in Churn × Complexity Hotspots — start with TeamApiKeysForApi.tsx, ApiSubscriptions.tsx. — One of this dimension's main actionable groups (2 warning-level).

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

D16 · Bus Factor8.3 / 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 8.3 / 10 · rule-coverage 100% · ceiling Documented

42 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is REDACTED. Counted over 229 of the 367 production source files in this repository: 137 are under the ~2,400-byte size floor this dimension measures over, and the remaining 1 have no attributable history left to measure.

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

What to do

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

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

D17 · Explicit Debt9.7 / 10Stronggated by 141 serious findings✓ Tool-verified

What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.

Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.

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

141 deducted task-comment markers across 103805 LoC (0.1/KLoC) → score 9.7. 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 · ×98daikoku/test/fr/maif/daikoku/usages/ApiLifeCycleSpec.scala:281
FixmeComment · ×43daikoku/test/fr/maif/daikoku/controllers/ApiControllerRolesSpec.scala:755

What to do

  1. Resolve the 98 TodoComment finding(s) in Explicit Debt — start with gestion_membres.spec.ts (8), souscriptions.spec.ts (5), ApiLifeCycleSpec.scala (4). — One of this dimension's main actionable groups (98 warning-level).
  2. Resolve the 43 FixmeComment finding(s) in Explicit Debt — start with TeamApiInfo.tsx (8), connectedUser.spec.ts (4), OtoroshiStatsVizualisation.tsx (3). — One of this dimension's main actionable groups (43 warning-level).

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

D19 · Documentation Quality7.5 / 10Strong✓ 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 7.5 / 10 · rule-coverage 100% · ceiling Documented

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

Documentation: no build, run or usage example · ×2readme.md:1

What to do

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

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

D20 · ADR Quality10.0 / 10Exemplary○ Nothing flagged

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

0 of 5 evaluated ADRs have a defect readable from the log itself (a missing or empty section, no title, a single option, consequences with no cost, no status, a missing enforcement field, a status the log contradicts, a dangling link, an unlinked second decision on one question, a date that is no calendar day). How well each record argues its case is not measured.

✓ On the Gold path — maintain.

Detailed fixes: d20_recommendation.md.

D24 · Comment Value9.6 8.8 / 10Strong✓ Tool-verified

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 8.8 / 10 · rule-coverage 92% · ceiling Documented

6 of 1322 judged comments only repeat the code they sit on (0.5 %). 223 comment(s) in another language or script were not judged.

redundant comment · ×6REDACTED:479
doc comments repeat the namesdaikoku/public/viewerjs/pdf.js:1048

What to do

  1. Resolve the 6 redundant comment finding(s) in Comment Value — start with REDACTED (4), REDACTED, perf.spec.ts. — One of this dimension's main actionable groups (6 recommendation-level).

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

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

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

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

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

2 of 5 build units (Cargo, npm, sbt) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion · ×2daikoku/build.sbt:1

What to do

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

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

D28 · Secrets (history)0.0 / 10Critical✓ 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 0.0 / 10 · rule-coverage 100% · ceiling Documented

15 finding(s): 0 critical, 10 high, 0 medium, 0 low. History coverage: The newest 4004 of 4267 commits were scanned for secrets, back to commit c90c2eb2c99b; older commits were not. `gitleaks` TIMED OUT after 25.2s against a 25.2s budget, so we killed its process tree. The budget is ours; the work may simply be larger than it allows. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.

REDACTED
REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 8 High secret finding(s) in Secrets (history) — start with REDACTED (8). — One of this dimension's main actionable groups (8 issue-level).
  2. Resolve the 5 REDACTED finding(s) in Secrets (history) — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (5 recommendation-level).
  3. Resolve the 2 REDACTED finding(s) in Secrets (history) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-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

161 finding(s): 0 critical, 140 high, 19 medium, 2 low. 45 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 139 file(s) — `.github/release-notes.yml`, `cli/templates/cms/src/pages/page.html` (lines 1–3), `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala`, `daikoku/app/fr/maif/daikoku/login/oauth.scala`, `daikoku/app/fr/maif/daikoku/services/ApiService.scala`, … (+134 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 4 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

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

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

D30 · Dependency Vulnerabilities0.0 / 10Critical✓ 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 Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05. 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 0.0 / 10 · rule-coverage 100% · ceiling Documented

98 finding(s): 6 critical, 41 high, 48 medium, 3 low.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

  1. Resolve the 39 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (34), REDACTED (3), REDACTED (2). — One of this dimension's main actionable groups (39 issue-level).
  2. Resolve the 6 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (5), REDACTED. — One of this dimension's main actionable groups (6 issue-level).
  3. Resolve the 2 High vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).

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

D31 · IaC & Container Security5.7 / 10Adequate✓ Tool-verified

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

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

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

26 finding(s): 0 critical, 10 high, 7 medium, 9 low.

REDACTED
REDACTED
REDACTED

What to do

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

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

D34 · Knowledge Freshness9.8 / 10Adequategated by 1 critical finding✓ 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.8 / 10 · rule-coverage 100% · ceiling Documented

4 of 230 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is daikoku/javascript/src/services/currencies.ts. Counted over 230 of the 367 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned knowledgedaikoku/javascript/src/services/currencies.ts:1
Orphaned file · ×3daikoku/javascript/src/components/frontend/Maintenance.tsx:1
Further orphaned files (smaller)

What to do

  1. Resolve the 1 Orphaned knowledge finding(s) in Knowledge Freshness — start with currencies.ts. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 3 Orphaned file finding(s) in Knowledge Freshness — start with Maintenance.tsx, FileChecker.java, PemUtils.java. — One of this dimension's main actionable groups (3 recommendation-level).
  3. Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

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

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

What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.

Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.

Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.

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

Strongest change-coupling: TeamBilling.tsx↔TeamIncome.tsx 69%; json.scala↔SecurityForm.tsx 67%; json.scala↔MailForm.tsx 58%

Change coupling: TeamBilling.tsx ↔ TeamIncome.tsx · ×7daikoku/javascript/src/components/backoffice/billing/TeamBilling.tsx:1

What to do

  1. Resolve the 7 Change coupling finding(s) in Change Coupling — start with json.scala (2), TeamBilling.tsx, TeamApiSubscriptions.tsx. — One of this dimension's main actionable groups (7 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

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

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 — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

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

D37 · Vulnerability-disclosure Policy10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.

Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.

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

A vulnerability-disclosure policy (SECURITY.md) is published with a reporting contact.

✓ On the Gold path — maintain.

Detailed fixes: d37_recommendation.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

No workload manifest could be read as a pod spec, so no confinement was judged.

Detailed fixes: d41_recommendation.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.

Frontend & cross-cutting dimensions

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

AC1 · Text alternatives4.8 / 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. (×2) — daikoku/javascript/src/apps/DaikokuHomeApp.tsx:40, daikoku/javascript/src/components/backoffice/me/MyProfile.tsx:118
  • Video with no captions <track> offers no captions. This player's source is set at runtime, so there is no caption file to author here: give the player a way to carry captions — accept a track/captions URL alongside the media and render a <track kind="captions"> when one is supplied — and capture that asset wherever the media enters the product (upload, import or generation). — REDACTED:438
  • A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content. — REDACTED:443
  • 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. — daikoku/public/viewerjs/pdf.js:3345

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.7 / 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 no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. (×7) — daikoku/javascript/src/apps/DaikokuHomeApp.tsx:29, daikoku/javascript/src/components/adminbackoffice/loggers/LoggersList.tsx:27, daikoku/javascript/src/components/adminbackoffice/tenants/forms/CustomizationForm.tsx:45, …
  • This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label. (×7) — daikoku/javascript/src/apps/DaikokuHomeApp.tsx:297, daikoku/javascript/src/apps/DaikokuHomeApp.tsx:319, daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:261, …
  • This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id. (×8) — daikoku/javascript/src/components/adminbackoffice/anonymousreporting/AnonymousReporting.tsx:43, daikoku/javascript/src/components/adminbackoffice/importexport/ImportExport.tsx:62, daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:218, …
  • This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) — so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed. (×6) — daikoku/javascript/src/components/adminbackoffice/anonymousreporting/AnonymousReporting.tsx:44, daikoku/javascript/src/components/adminbackoffice/importexport/ImportExport.tsx:63, daikoku/javascript/src/components/adminbackoffice/remotecatalogs/ResourceLoader.tsx:179, …
  • A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one). (×7) — daikoku/javascript/src/components/adminbackoffice/cms/index.tsx:120, daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:231, daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:262, …
  • This UI-library field component is named only by a placeholder — a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed. (×2) — daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:158, daikoku/javascript/src/components/adminbackoffice/tenants/TenantAdminList.tsx:134
  • This <a> has no href, so it exposes no link role — but it carries a click handler, which makes it a control. It has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to <button type="button"> — the right fix for its keyboard operability — does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label. — daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:215
  • 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) — daikoku/javascript/src/components/backoffice/assets/AssetsList.tsx:289, daikoku/javascript/src/components/backoffice/assets/AssetsList.tsx:294

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.5 / 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.

  • The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en"). (×2) — cli/templates/cms/src/pages/404.html:1, cli/templates/session_expired.html:1
  • A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>. (×3) — cli/templates/cms/src/pages/404.html:1, cli/templates/manager.html:2, cli/templates/session_expired.html:1
  • No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. (×3) — cli/templates/cms/src/pages/404.html:1, cli/templates/manager.html:2, REDACTED:2
  • user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta. (×2) — daikoku/javascript/index.html:6, REDACTED:6
  • Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one. (×2) — daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:925, daikoku/javascript/src/components/backoffice/billing/TeamIncome.tsx:174
  • An iframe with no title (or an empty one) is announced only as "frame". Add a non-empty title describing its content, or an aria-label. — REDACTED:525

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.6 / 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 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. (×12) — daikoku/javascript/src/apps/DaikokuHomeApp.tsx:307, daikoku/javascript/src/apps/DaikokuHomeApp.tsx:335, daikoku/javascript/src/components/adminbackoffice/tenants/TenantList.tsx:63, …
  • A click handler on a plain element with no role and no tabindex: even where another element's key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a <button>, or add role + tabIndex={0}. — daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:202
  • 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. (×2) — daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:215, REDACTED:68
  • A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler. (×25) — daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:834, daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:838, daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:842, …

What to do

  • Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
AC5 · ARIA correctness10.0 / 10Exemplary○ Nothing flagged

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.

AC6 · Visual & motion safety4.8 / 10Weak✓ 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.

  • `.badge` sets color: #fff on background-color: #fa383e — 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet — editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from). (×6) — docs/assets/css/styles.111e5321.css:1, docs/assets/css/styles.58620cc5.css:1, docs/assets/css/styles.8152f05c.css:1, …
  • `.form-control:disabled, .form-control[readonly]` sets color: #e2e2e2 on background-color: grey — 3.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — daikoku/javascript/src/style/components/form.scss:13
  • `.Count` sets color: #fff on background-color: #2389ff — 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — daikoku/javascript/src/components/utils/dnd/components/TreeItem.module.scss:79
  • `body:not(.navigation-with-keyboard) :not(input):focus` 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. (×6) — docs/assets/css/styles.111e5321.css:1, docs/assets/css/styles.58620cc5.css:1, docs/assets/css/styles.8152f05c.css:1, …
  • `*:focus` 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. — daikoku/javascript/src/style/layout/style.scss:39
  • `.discussion-form .send-button` 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. — daikoku/javascript/src/style/components/discussion.scss:89
  • `.heroLogo` moves (`animation-name: jack-in-the-box`) 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. — manual/src/pages/index.module.css:166
  • `.loadingRing_RJI3 div` moves (`animation: 1.2s cubic-bezier(.5,0,.5,1) infinite a`) 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. (×6) — docs/assets/css/styles.111e5321.css:1, docs/assets/css/styles.58620cc5.css:1, docs/assets/css/styles.8152f05c.css:1, …
  • `.heroLogo_U6bI` moves (`animation-name: b`) 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. (×6) — docs/assets/css/styles.111e5321.css:1, docs/assets/css/styles.58620cc5.css:1, docs/assets/css/styles.8152f05c.css:1, …
  • `.navbar-panel` moves (`transition: width .2s ease-in-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. — daikoku/javascript/src/style/layout/navbar.scss:130
  • `.navbar-panel-background` moves (`transition: width .2s ease-in-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. — daikoku/javascript/src/style/layout/navbar.scss:164
  • `.navbar-companion` moves (`transition: width .2s ease-in-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. — daikoku/javascript/src/style/layout/navbar.scss:235
  • `.right-panel` moves (`transition: width .2s ease-in-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. — daikoku/javascript/src/style/layout/rightPanel.scss:31
  • `.right-panel-background` moves (`transition: width .2s ease-in-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. — daikoku/javascript/src/style/layout/rightPanel.scss:50
  • `.pill-cursor` moves (`transition: left 0.25s`) 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. — daikoku/javascript/src/style/layout/style.scss:379
  • `.api-subscription .api-subscription__icon .dot::before` moves (`animation: pulseBig 2s infinite`) 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. — daikoku/javascript/src/style/components/apiSubscription.scss:85
  • `.shake.active` moves (`animation: shake 200ms 2 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. — daikoku/javascript/src/style/components/btn.scss:96
  • `.--rotate` moves (`animation: rotating 2s linear infinite`) 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. — daikoku/javascript/src/style/components/btn.scss:318
  • `.tile img` moves (`transition: transform 500ms 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. — daikoku/javascript/src/style/components/modal.scss:140
  • `.modal.right.fade .modal-dialog` moves (`transition: opacity 0.3s linear, right 0.3s 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. — daikoku/javascript/src/style/components/modal.scss:183

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.2 / 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 singletons7.1 / 10Strong✓ 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.

  • `MockController` is one shared instance (Play controller: every request runs on it, concurrently, on the server's thread pool) but writes its own state outside any lock (apikeys; e.g. `apikeys` in `createFakeOtoroshiApiKey` at line 131). Two requests that interleave lose an update, and a mutable collection written concurrently can corrupt. — daikoku/app/fr/maif/daikoku/controllers/MockController.scala:15

What to do

  • Scala: keep controllers and singletons stateless — per-request data in locals, shared data in a store — or hold the state in a thread-safe type (TrieMap, AtomicInteger/AtomicReference, a cats-effect Ref) or update it under `synchronized { }`; a flag that is only ever overwritten can be a `@volatile var`.
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 segregation9.9 / 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.

  • `DataStore` declares 40 abstract members: `start`, `stop`, `isEmpty`, `tenantRepo`, `userRepo`, `teamRepo`, `apiRepo`, `apiSubscriptionRepo`, `keyringRepo`, `apiDocumentationPageRepo`, `apiPostRepo`, `apiIssueRepo`, `notificationRepo`, `userSessionRepo`, `auditTrailRepo`, `consumptionRepo`, `translationRepo`, `passwordResetRepo`, `accountCreationRepo`, `messageRepo`, `cmsRepo`, `assetRepo`, `remoteCatalogRepo`, `remoteCatalogRunRepo`, `operationRepo`, `emailVerificationRepo`, `evolutionRepo`, `subscriptionDemandRepo`, `stepValidatorRepo`, `usagePlanRepo`, `reportsInfoRepo`, `apiSubscriptionTransferRepo`, `JobInformationRepo`, `exportAsStream`, `importFromStream`, `clear`, `queryOneRaw`, `queryRaw`, `queryString`, `withTransaction`. Counted over its ABSTRACT members — a `def` with no body or a `val`/`var` with no initializer, once per signature; concrete members, private and protected members, and members of a companion `object` are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — REDACTED:2631

What to do

  • Split fat interfaces into focused role-interfaces so clients depend only on what they use.
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.

Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.

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

Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.

Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.

Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.

DM12 · Ambient inputs in the domain10.0 / 10Exemplary○ Nothing flagged

Other · Domain Modelling — Whether domain types receive the time and randomness their rules depend on, rather than reading the process clock or a global random source directly — an ambient read makes the rule it feeds untestable at the instant that matters and lets two reads inside one operation disagree.

Method: Roslyn (DDD-gated, C#/VB only): domain-layer types scanned for ambient reads — DateTime/DateTimeOffset.Now/UtcNow/Today, Random.Shared, new Random(), Stopwatch.GetTimestamp — resolved against the semantic model, with a comment/string-stripped token fallback only where resolution fails. Body reads are scored; field/property initialisers are surfaced unscored. Apply/When folds excluded (ES1 owns them). Deterministic, symbol-resolved.

DM6 · Domain ↔ infrastructure boundary10.0 / 10Exemplary✓ Tool-verified

Other · Domain Modelling — Whether the domain layer stays free of infrastructure dependencies (EF/Marten/HTTP/ASP.NET) — 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.

DM9 · Scattered domain decisions10.0 / 10Exemplary✓ Tool-verified

Other · Domain Modelling — Whether one domain rule is decided — or one measurement produced — in more than one place, rather than living on the type that owns it.

Method: Neutral body surface plus Roslyn (DDD-gated), two arms. DECISION (Roslyn only): a predicate over a domain type's members judged in two or more types, where none of those decisions live on the owning type — operands of comparisons and relational property patterns only, so a member merely passed as an argument is not judged. DERIVATION: a plain all-numeric carrier of ≥2 members, with no base type and exactly one constructor, CONSTRUCTED as the result of a method (returned or assigned, never inline as an argument) in two or more types other than its own — the same measurement produced twice, which centralising the judgement does not fix. DERIVATION runs on every language whose frontend declares the produced-or-passed fact per construction (Roslyn and the Java sidecar today); a target with only the derivation arm carries an engine gap naming the decision arm as not assessed, and a frontend that declares nothing keeps the dimension not measured rather than clean. Single-member rules, test code and generated code are out of population for both. Advisory.

ED1 · Handler temporal coupling5.2 / 10Adequate✓ Tool-verified

Other · Event-Driven — Whether event/message handlers avoid synchronous blocking waits — a blocking wait inside a handler stalls throughput and risks deadlock.

Method: Roslyn semantic scan (event-driven gated): event-handler bodies scanned for HTTP/gRPC invocations by resolved symbol type, not substring. Deterministic, semantic-resolved.

  • `assets.add` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/commands/assets.rs:136
  • `assets.remove` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::remove_file`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/commands/assets.rs:185
  • `assets.sync` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/commands/assets.rs:298
  • `cms.delete` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::remove_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/commands/cms.rs:289
  • `cms.read` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::create`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/commands/cms.rs:326
  • `cms.unzip_to_path` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. (×2) — cli/src/commands/cms.rs:378, cli/src/commands/cms.rs:392
  • `cms.unzip_to_path` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::create`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/commands/cms.rs:400
  • `cms.create_api_folder` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. (×3) — cli/src/commands/cms.rs:573, cli/src/commands/cms.rs:590, cli/src/commands/cms.rs:603
  • `cms.get_cms_page_path` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/commands/cms.rs:742
  • `cms.create_path_and_file` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/commands/cms.rs:764
  • `cms.create_path_and_file` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::write`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. (×3) — cli/src/commands/cms.rs:785, cli/src/commands/cms.rs:793, cli/src/commands/cms.rs:798
  • `cms.create_daikoku_hidden_files` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/commands/cms.rs:814
  • `cms.create_daikoku_hidden_files` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::create`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. (×3) — cli/src/commands/cms.rs:817, cli/src/commands/cms.rs:820, cli/src/commands/cms.rs:823
  • `environments.set_content_file` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::write`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/commands/environments.rs:92
  • `environments.get_daikokuignore` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read_to_string`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/commands/environments.rs:422
  • `pull.customization_synchronization` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/commands/pull.rs:99
  • `CmsFile.new` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read_to_string`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/models/folder.rs:34
  • `folder.read_sources_and_daikoku_metadata` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read_dir`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/models/folder.rs:106
  • `folder.read_apis_folder` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read_dir`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/models/folder.rs:133
  • `folder.read_file` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read_to_string`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — cli/src/models/folder.rs:229
  • `utils.absolute_path` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::canonicalize`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. (×2) — cli/src/utils.rs:14, cli/src/utils.rs:19

What to do

  • Use the awaited twin of each blocking call, or move the work off the loop with `tokio::task::spawn_blocking` — a synchronous handler cannot simply `.await` in place.
GD1 · Unfinished & placeholder code10.0 / 10Exemplary✓ Tool-verified

Other · Code Health — Unreviewed-generation residue in this repository's JavaScript/TypeScript: functions whose whole body still throws a "not implemented" error, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings and JSX of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.

Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.

  • A placeholder string ("Lorem ipsum dolor sit amet, consectetur …") is still in shipped code — typical of generated boilerplate that was never filled in. (×2) — daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:49, daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:50
  • A placeholder string ("Lorem Ipsum") is still in shipped code — typical of generated boilerplate that was never filled in. (×4) — daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:156, daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:157, REDACTED:224, …
  • A placeholder string ("Long Lorem Ipsum") is still in shipped code — typical of generated boilerplate that was never filled in. (×4) — daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:165, daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:166, REDACTED:233, …

What to do

  • Finish or delete the functions that still throw "not implemented", and replace placeholder text before shipping.
IC1 · Incompleteness & stubs7.8 / 10Strong✓ Tool-verified

Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's JavaScript/TypeScript: functions that only throw a "not implemented" error, functions that take inputs and return a constant or do nothing, async functions that never await, dead `if (false)` branches, and skeleton classes most of whose methods are holes.

Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.

  • `onSuccess` is wired to an arrow whose body is empty — the markup attaches a listener that does nothing. Implement the handler, or remove the attribute that wires it. (×2) — daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:389, daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:490
  • `onClick` is wired to an arrow whose body is empty — the markup attaches a listener that does nothing. Implement the handler, or remove the attribute that wires it. — daikoku/javascript/src/components/frontend/dashboard/ApiList.tsx:109
  • `onChange` is wired to an arrow whose body is empty — the markup attaches a listener that does nothing. Implement the handler, or remove the attribute that wires it. — daikoku/javascript/src/contexts/i18n-context.tsx:202
  • `getPreviousMessages` has an empty body — confirm it's an intentional no-op and not an unfinished method. — daikoku/javascript/src/components/backoffice/messages/context.tsx:18
  • `toggleExpertMode` has an empty body — confirm it's an intentional no-op and not an unfinished method. — daikoku/javascript/src/contexts/globalContext.tsx:76
  • `toggleTheme` has an empty body — confirm it's an intentional no-op and not an unfinished method. — daikoku/javascript/src/contexts/globalContext.tsx:79
  • `setLanguage` has an empty body — confirm it's an intentional no-op and not an unfinished method. — daikoku/javascript/src/contexts/i18n-context.tsx:14
  • `setTranslationMode` has an empty body — confirm it's an intentional no-op and not an unfinished method. — daikoku/javascript/src/contexts/i18n-context.tsx:16
  • `addMenu` has an empty body — confirm it's an intentional no-op and not an unfinished method. — daikoku/javascript/src/contexts/navUtils.ts:31
  • `setMenu` has an empty body — confirm it's an intentional no-op and not an unfinished method. — daikoku/javascript/src/contexts/navUtils.ts:32
  • `setMode` has an empty body — confirm it's an intentional no-op and not an unfinished method. — daikoku/javascript/src/contexts/navUtils.ts:34
  • `setOffice` has an empty body — confirm it's an intentional no-op and not an unfinished method. — daikoku/javascript/src/contexts/navUtils.ts:36
  • `setApi` has an empty body — confirm it's an intentional no-op and not an unfinished method. — daikoku/javascript/src/contexts/navUtils.ts:37
  • `setApiGroup` has an empty body — confirm it's an intentional no-op and not an unfinished method. — daikoku/javascript/src/contexts/navUtils.ts:38
  • `setTeam` has an empty body — confirm it's an intentional no-op and not an unfinished method. — daikoku/javascript/src/contexts/navUtils.ts:39
  • `setTenant` has an empty body — confirm it's an intentional no-op and not an unfinished method. — daikoku/javascript/src/contexts/navUtils.ts:40

What to do

  • Clear the softer debt: re-enable or delete skipped tests, decide whether each empty function is a deliberate no-op (and say so in a comment), and replace blanket `eslint-disable` / `@ts-nocheck` with targeted, justified suppressions.
M1 · Documentation (README)7.6 / 10Strong✓ 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 documentation10.0 / 10Exemplary✓ 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.

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.

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

Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.

Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.

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 · Observability8.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.

P3 · Security & performance tooling0.0 / 10Critical✓ Tool-verified

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

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

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

What to do

  • Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback10.0 / 10Exemplary✓ 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.

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.

PF3 · Async & latency hygiene6.0 / 10Adequate✓ 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.

  • `render` is async and calls Await.result — a blocking call inside async code stalls the execution-context thread, and every future or fiber scheduled on it for as long as it runs. — daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:1103

What to do

  • Scala: compose the Future or effect (map/flatMap, a for-comprehension) instead of Await.result or unsafeRunSync, and wrap unavoidable blocking calls in blocking { } (Future), IO.blocking or ZIO.attemptBlocking.
R1 · Type Safety9.3 / 10Exemplary✓ 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.

R10 · Code Duplication5.1 / 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.

  • 23 duplicated blocks under daikoku/javascript/src/components/ have copies in at least two of the sibling directories adminbackoffice, backoffice, frontend, inputs, utils — 19 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 23 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 23 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 23 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. — daikoku/javascript/src/components/adminbackoffice/users/UserEdit.tsx:38
  • 9 duplicated blocks under daikoku/javascript/src/components/adminbackoffice/ have copies in at least two of the sibling directories cms, importexport, loggers, otoroshi, remotecatalogs, sessions (+3 more sibling(s) not listed) — 6 of them are reported below, and 3 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 9 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 9 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 9 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. — daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:80
  • 5 of the duplicated blocks reported below have copies in at least two of the sibling directories apps, components under daikoku/javascript/src/. 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. — daikoku/javascript/src/apps/DaikokuHomeApp.tsx:156
  • daikoku/public/viewerjs/pdf.js:954 · REDACTED:954 — 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. — daikoku/public/viewerjs/pdf.js:954
  • daikoku/public/viewerjs/pdf.js:692 · REDACTED:692 — 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. — daikoku/public/viewerjs/pdf.js:692
  • daikoku/public/viewerjs/pdf.js:419 · REDACTED:419 — 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. — daikoku/public/viewerjs/pdf.js:419
  • daikoku/javascript/src/components/adminbackoffice/users/UserEdit.tsx:38 · daikoku/javascript/src/components/backoffice/me/MyProfile.tsx:242 — the two spans are one implementation copied and then locally edited — 782 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. — daikoku/javascript/src/components/adminbackoffice/users/UserEdit.tsx:38
  • daikoku/public/viewerjs/pdf.js:208 · REDACTED:208 — 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. — daikoku/public/viewerjs/pdf.js:208
  • daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:133 · REDACTED:201 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:133
  • daikoku/public/viewerjs/pdf.js:21 · REDACTED:21 — 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. — daikoku/public/viewerjs/pdf.js:21
  • daikoku/javascript/src/components/frontend/api/ApiRedoc.tsx:78 · daikoku/javascript/src/components/frontend/api/ApiTest.tsx:130 — the two spans are one implementation copied and then locally edited — 656 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. — daikoku/javascript/src/components/frontend/api/ApiRedoc.tsx:78
  • REDACTED:189 · REDACTED:198 — 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. — REDACTED:189
  • daikoku/javascript/src/components/frontend/Maintenance.tsx:12 · daikoku/javascript/src/components/utils/login.tsx:12 — the two spans are one implementation copied and then locally edited — 389 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. — daikoku/javascript/src/components/frontend/Maintenance.tsx:12
  • REDACTED:8685 · REDACTED:9131 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — REDACTED:8685
  • REDACTED:40 · REDACTED:55 — 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. — REDACTED:40
  • REDACTED:7303 · REDACTED:7606 — the two spans are one implementation copied and then locally edited — 326 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:7303
  • REDACTED:145 · REDACTED:154 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — REDACTED:145
  • REDACTED:35673 · REDACTED:35725 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — REDACTED:35673
  • daikoku/javascript/src/apps/DaikokuHomeApp.tsx:156 · daikoku/javascript/src/components/frontend/account/signup.tsx:21 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases. — daikoku/javascript/src/apps/DaikokuHomeApp.tsx:156
  • REDACTED:366 · REDACTED:394 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — REDACTED:366
  • REDACTED:669 · daikoku/javascript/src/components/frontend/api/ApiRedoc.tsx:173 — 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. — REDACTED:669
  • REDACTED:36091 · REDACTED:36131 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:36091
  • REDACTED:452 · REDACTED:486 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — REDACTED:452
  • daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:166 · daikoku/javascript/src/components/backoffice/teams/TeamEdit.tsx:149 — 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. — daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:166
  • REDACTED:13939 · REDACTED:13991 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — REDACTED:13939
  • REDACTED:8528 · REDACTED:8974 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — REDACTED:8528
  • REDACTED:36251 · REDACTED:36297 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — REDACTED:36251
  • daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:80 · daikoku/javascript/src/components/adminbackoffice/tenants/forms/SecurityForm.tsx:268 — 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. — daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:80
  • REDACTED:8645 · REDACTED:9091 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — REDACTED:8645
  • daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:455 · REDACTED:239 — 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. — daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:455
  • daikoku/javascript/src/components/backoffice/apis/TeamApiSwagger.tsx:42 · daikoku/javascript/src/components/backoffice/apis/TeamApiSwagger.tsx:81 — all 2 copies are in the same file, 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. — daikoku/javascript/src/components/backoffice/apis/TeamApiSwagger.tsx:42
  • REDACTED:31032 · REDACTED:31322 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:31032
  • daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx:102 · daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx:128 · daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx:154 · daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx:183 — all 4 copies are in the same file, 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. — daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx:102
  • REDACTED:33616 · REDACTED:33653 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:33616
  • daikoku/public/viewerjs/pdf.js:620 · REDACTED:620 — 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. — daikoku/public/viewerjs/pdf.js:620
  • daikoku/public/viewerjs/pdf.js:4156 · daikoku/public/viewerjs/pdf.js:7820 — all 2 copies are in the same file, 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. — daikoku/public/viewerjs/pdf.js:4156
  • REDACTED:10264 · REDACTED:10372 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:10264
  • REDACTED:310 · daikoku/javascript/src/components/backoffice/apikeys/TeamApiKeysForApi.tsx:23 — 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. — REDACTED:310
  • daikoku/javascript/src/components/frontend/api/ApiSubscriptions.tsx:45 · daikoku/javascript/src/components/frontend/api/ApiTest.tsx:250 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — daikoku/javascript/src/components/frontend/api/ApiSubscriptions.tsx:45
  • REDACTED:19447 · REDACTED:31321 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:19447

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 Boundaries7.9 / 10Strong✓ 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.

  • daikoku/javascript/tests/fixtures/redoc/index.jsx:4 reaches past another workspace package's public entry into its internals with a relative path (../../../src/components/frontend/api/ApiRedoc) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — daikoku/javascript/tests/fixtures/redoc/index.jsx:4
  • daikoku/javascript/tests/fixtures/redoc/index.jsx:5 reaches past another workspace package's public entry into its internals with a relative path (../../../src/contexts/globalContext) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — daikoku/javascript/tests/fixtures/redoc/index.jsx:5
  • daikoku/javascript/tests/specs/apis.ts:2 reaches past another workspace package's public entry into its internals with a relative path (../../src/types) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — daikoku/javascript/tests/specs/apis.ts:2
  • daikoku/javascript/tests/specs/dashboard.spec.ts:3 reaches past another workspace package's public entry into its internals with a relative path (../../src/types) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — daikoku/javascript/tests/specs/dashboard.spec.ts:3
  • daikoku/javascript/tests/specs/notifications.ts:2 reaches past another workspace package's public entry into its internals with a relative path (../../src/types) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — daikoku/javascript/tests/specs/notifications.ts:2

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 Complexity5.0 / 10Adequate✓ 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.

  • CCITTFaxStream_lookChar has cyclomatic complexity 98 and cognitive complexity 324; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:33244
  • bidi has cyclomatic complexity 83 and cognitive complexity 131; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:38859
  • Font_checkAndRepair has cyclomatic complexity 72 and cognitive complexity 110; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:17326
  • parse has cyclomatic complexity 60 and cognitive complexity 99; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:21759
  • parse has cyclomatic complexity 59 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:35041
  • sanitizeTTProgram has cyclomatic complexity 58 and cognitive complexity 124; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:17942
  • PostScriptEvaluator_execute has cyclomatic complexity 57 and cognitive complexity 36; 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. — REDACTED:5951
  • Font has cyclomatic complexity 53 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:16579
  • Type1CharString_convert has cyclomatic complexity 51 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:19077
  • next has cyclomatic complexity 51 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:11195
  • Parser_findDCTDecodeInlineStreamEnd has cyclomatic complexity 47 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. — REDACTED:30319
  • next has cyclomatic complexity 44 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:11601
  • PostScriptCompiler_compile has cyclomatic complexity 44 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:6379
  • JpxImage_parseCodestream has cyclomatic complexity 43 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:35622
  • Lexer_getObj has cyclomatic complexity 42 and cognitive complexity 28; 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. — REDACTED:31034
  • ApiHome has cyclomatic complexity 39 and cognitive complexity 29; 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. — daikoku/javascript/src/components/frontend/api/ApiHome.tsx:18
  • compileType3Glyph has cyclomatic complexity 38 and cognitive complexity 73; 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. — daikoku/public/viewerjs/pdf.js:3502
  • readCmapTable has cyclomatic complexity 37 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:17370
  • CFFParser_parseCharStrings has cyclomatic complexity 35 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:20386
  • decodeBitmap has cyclomatic complexity 35 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:37867
  • ColorSpace_parseToIR has cyclomatic complexity 35 and cognitive complexity 28; 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. — REDACTED:6758
  • Lexer_getString has cyclomatic complexity 33 and cognitive complexity 29; 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. — REDACTED:30874
  • putBinaryImageData has cyclomatic complexity 32 and cognitive complexity 97; 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. — daikoku/public/viewerjs/pdf.js:3745
  • Type1Parser_extractFontProgram has cyclomatic complexity 32 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:19487
  • PartialEvaluator_setGState has cyclomatic complexity 32 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. — REDACTED:10921
  • FlateStream_readBlock has cyclomatic complexity 31 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:31883
  • PostScriptLexer_getToken has cyclomatic complexity 30 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 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. — REDACTED:31324
  • PartialEvaluator_translateFont has cyclomatic complexity 29 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:12177
  • createOS2Table has cyclomatic complexity 29 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:17121
  • transformComponents has cyclomatic complexity 28 and cognitive complexity 115; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:36848
  • compileGlyf has cyclomatic complexity 28 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:21588
  • Font_buildToUnicode has cyclomatic complexity 28 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:18660
  • decodeTextRegion has cyclomatic complexity 27 and cognitive complexity 84; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:38160
  • processSegment has cyclomatic complexity 27 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:38417
  • cell has cyclomatic complexity 27 and cognitive complexity 19; 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. — REDACTED:1895
  • PDFImage has cyclomatic complexity 26 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:26613
  • CanvasGraphics_showText has cyclomatic complexity 25 and cognitive complexity 40; 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. — daikoku/public/viewerjs/pdf.js:4643
  • Parser_makeFilter has cyclomatic complexity 25 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:30662
  • CipherTransformFactory has cyclomatic complexity 25 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 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. — REDACTED:9645
  • PartialEvaluator_extractWidths has cyclomatic complexity 24 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:11942
R3 · Large Files6.6 / 10Adequate✓ 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.

  • daikoku/public/viewerjs/pdf.js has 7160 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — daikoku/public/viewerjs/pdf.js:1
  • daikoku/javascript/src/services/index.ts has 2584 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — daikoku/javascript/src/services/index.ts:1
  • REDACTED has 2228 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx has 1006 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:1
  • REDACTED has 963 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx has 875 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:1
  • daikoku/javascript/src/components/inputs/DynamicTable.tsx has 792 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — daikoku/javascript/src/components/inputs/DynamicTable.tsx:1
  • daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx has 690 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx:1
  • REDACTED has 652 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • daikoku/javascript/src/types/api.ts has 617 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — daikoku/javascript/src/types/api.ts:1
  • daikoku/javascript/src/components/backoffice/me/MyProfile.tsx has 574 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — daikoku/javascript/src/components/backoffice/me/MyProfile.tsx:1
  • daikoku/javascript/src/contexts/navContext.tsx has 531 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — daikoku/javascript/src/contexts/navContext.tsx:1
  • REDACTED has 526 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx has 501 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:1
  • daikoku/javascript/src/apps/DaikokuApp.tsx has 471 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — daikoku/javascript/src/apps/DaikokuApp.tsx:1
  • REDACTED has 459 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • daikoku/javascript/src/components/backoffice/assets/AssetsList.tsx has 441 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — daikoku/javascript/src/components/backoffice/assets/AssetsList.tsx:1
  • daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx has 428 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx:1
  • daikoku/javascript/src/components/adminbackoffice/tenants/forms/AutenticationForm.tsx 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. — daikoku/javascript/src/components/adminbackoffice/tenants/forms/AutenticationForm.tsx:1
  • daikoku/javascript/src/components/adminbackoffice/remotecatalogs/CatalogRuns.tsx has 412 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — daikoku/javascript/src/components/adminbackoffice/remotecatalogs/CatalogRuns.tsx:1

What to do

  • Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
R4 · Test Coverage6.9 / 10Adequate✓ Tool-verified

React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.

Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.

  • No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×40) — REDACTED:1, daikoku/public/viewerjs/pdf.js:1, daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:1, …

What to do

  • Add tests that import the unreached modules (directly or through their public entry).
R5 · Dependency Freshness9.0 / 10Exemplary✓ 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.

R6 · Tooling10.0 / 10Exemplary✓ Tool-verified

React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each REDACTED 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: REDACTED scanned for test/lint/typecheck script wiring. Deterministic presence check.

  • The package in `daikoku/javascript` declares the lint script `lint` (`oxlint src/`), but no step of this repository's CI runs it, by name, through another script, a Makefile target or a workspace runner, and no CI step runs the linter over the package itself. The rules it sets are enforced nowhere a pull request can fail. Run it in CI: a step that runs `npm run lint` in `daikoku/javascript` (or the workspace's task runner). — REDACTED:11
R7 · Dead Code7.8 / 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 49 application, 16 tooling and 39 test entry point(s) detected in this repo. Gate removals on `npm run build` — an undetected custom entry would make these reachable.
  • no import path from any entry point (49 application, 16 tooling, 39 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 (×10) — manual/src/components/DocumentationThemeHub/index.js, daikoku/javascript/src/contexts/modals/SessionModal.tsx, manual/src/components/HomepageFeatures/index.js, …
  • Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/backoffice/apis/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/backoffice/apis/index.ts in the same commit, or the barrel will import a name that no longer exists. (×2) — daikoku/javascript/src/components/backoffice/apis/TeamApiConsumption.tsx:55, daikoku/javascript/src/components/backoffice/apis/TeamPlanConsumption.tsx:17
  • Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/backoffice/messages/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/backoffice/messages/index.ts in the same commit, or the barrel will import a name that no longer exists. — daikoku/javascript/src/components/backoffice/messages/messages.tsx:9
  • Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/backoffice/widgets/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/backoffice/widgets/index.ts in the same commit, or the barrel will import a name that no longer exists. — daikoku/javascript/src/components/backoffice/widgets/revenus.tsx:9
  • Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/inputs/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/inputs/index.ts in the same commit, or the barrel will import a name that no longer exists. (×3) — daikoku/javascript/src/components/inputs/LinkDisplay.tsx:4, daikoku/javascript/src/components/inputs/TableFilters.tsx:7, daikoku/javascript/src/components/inputs/TableFilters.tsx:35
  • Nothing imports this binding — it is safe to review for removal. (×17) — daikoku/javascript/src/components/utils/FormWithChoice.tsx:61, daikoku/javascript/src/components/utils/apiUtils.tsx:73, daikoku/javascript/src/components/utils/array.ts:1, …
  • Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/utils/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/utils/index.ts in the same commit, or the barrel will import a name that no longer exists. (×5) — daikoku/javascript/src/components/utils/Placeholder.tsx:1, daikoku/javascript/src/components/utils/entities.ts:4, daikoku/javascript/src/components/utils/formatters.tsx:68, …

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 Hygiene0.0 / 10Critical✓ 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 REDACTED — installs work only by hoisting accident. (×3) — daikoku/javascript/src/components/inputs/datepicker.tsx:3, daikoku/javascript/src/components/adminbackoffice/audittrail/AuditTrailList.tsx:2, daikoku/javascript/src/apps/DaikokuApp.tsx:2
  • Imported only as a TYPE and declared in no reachable REDACTED. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it — but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning REDACTED. — manual/sidebars.js:14
  • Declared in REDACTED 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. (×13) — REDACTED:69, REDACTED:30, REDACTED:33, …
  • Declared in manual/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) — manual/package.json:29, manual/package.json:22

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.

  • daikoku/javascript/src/contexts/i18n-context.tsx → daikoku/javascript/src/contexts/globalContext.tsx → daikoku/javascript/src/services/index.ts → daikoku/javascript/src/components/utils/sidebar/panels/SearchPanel.tsx → daikoku/javascript/src/contexts/i18n-context.tsx (one verified cycle inside a mutually-dependent group of 126 files) — daikoku/javascript/src/contexts/i18n-context.tsx:9

What to do

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

Other · Security — Read from this repository's Scala source and the Java beside it: 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. This repository commits the configuration that serves its own HTTP surface, so that configuration was read in full for the security response headers it sets. This repository serves HTTP itself (daikoku/app/fr/maif/daikoku/DaikokuApplicationLoader.scala:7 — `ApplicationLoader`), so its Scala source was also read for the server controls: TLS served or HSTS set, security response headers, cookie flags and inbound validation — each credited where its Scala spelling appears in production source, not proven on every route. A Play application is credited the security headers Play's default `SecurityHeadersFilter` sends unless its build or configuration switches that filter off, and its cookies the HttpOnly flag Play sets by default.

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+ (`MessageDigest.getInstance("SHA-256")`) 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. — daikoku/app/fr/maif/daikoku/utils/string.scala:14

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.
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 branch8.0 / 10Strong✓ Tool-verified

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.

  • The match subject is `name.toLowerCase()`, so every value reaching these cases has already been lower-cased by `toLowerCase` (line 44). The pattern `"Local"` carries a letter of the opposite case, and a literal pattern compares with `==`, so it cannot equal that subject for ANY input — this case is dead and whatever it was meant to handle silently falls to a later case, or throws `MatchError` when none is left. Match the normalised spelling (`"local"`), or drop the normaliser and compare with `equalsIgnoreCase`. — daikoku/app/fr/maif/daikoku/login/api.scala:45
  • The match subject is `name.toLowerCase()`, so every value reaching these cases has already been lower-cased by `toLowerCase` (line 44). The pattern `"Otoroshi"` carries a letter of the opposite case, and a literal pattern compares with `==`, so it cannot equal that subject for ANY input — this case is dead and whatever it was meant to handle silently falls to a later case, or throws `MatchError` when none is left. Match the normalised spelling (`"otoroshi"`), or drop the normaliser and compare with `equalsIgnoreCase`. — daikoku/app/fr/maif/daikoku/login/api.scala:47
  • The match subject is `name.toLowerCase()`, so every value reaching these cases has already been lower-cased by `toLowerCase` (line 44). The pattern `"LDAP"` carries a letter of the opposite case, and a literal pattern compares with `==`, so it cannot equal that subject for ANY input — this case is dead and whatever it was meant to handle silently falls to a later case, or throws `MatchError` when none is left. Match the normalised spelling (`"ldap"`), or drop the normaliser and compare with `equalsIgnoreCase`. — daikoku/app/fr/maif/daikoku/login/api.scala:49
  • The match subject is `name.toLowerCase()`, so every value reaching these cases has already been lower-cased by `toLowerCase` (line 44). The pattern `"OAuth2"` carries a letter of the opposite case, and a literal pattern compares with `==`, so it cannot equal that subject for ANY input — this case is dead and whatever it was meant to handle silently falls to a later case, or throws `MatchError` when none is left. Match the normalised spelling (`"oauth2"`), or drop the normaliser and compare with `equalsIgnoreCase`. — daikoku/app/fr/maif/daikoku/login/api.scala:51
  • The match subject is `name.toLowerCase()`, so every value reaching these cases has already been lower-cased by `toLowerCase` (line 97). The pattern `"Local"` carries a letter of the opposite case, and a literal pattern compares with `==`, so it cannot equal that subject for ANY input — this case is dead and whatever it was meant to handle silently falls to a later case, or throws `MatchError` when none is left. Match the normalised spelling (`"local"`), or drop the normaliser and compare with `equalsIgnoreCase`. — daikoku/app/fr/maif/daikoku/env/env.scala:98
  • The match subject is `name.toLowerCase()`, so every value reaching these cases has already been lower-cased by `toLowerCase` (line 97). The pattern `"Header"` carries a letter of the opposite case, and a literal pattern compares with `==`, so it cannot equal that subject for ANY input — this case is dead and whatever it was meant to handle silently falls to a later case, or throws `MatchError` when none is left. Match the normalised spelling (`"header"`), or drop the normaliser and compare with `equalsIgnoreCase`. — daikoku/app/fr/maif/daikoku/env/env.scala:100
  • The match subject is `name.toLowerCase()`, so every value reaching these cases has already been lower-cased by `toLowerCase` (line 97). The pattern `"Hostname"` carries a letter of the opposite case, and a literal pattern compares with `==`, so it cannot equal that subject for ANY input — this case is dead and whatever it was meant to handle silently falls to a later case, or throws `MatchError` when none is left. Match the normalised spelling (`"hostname"`), or drop the normaliser and compare with `equalsIgnoreCase`. — daikoku/app/fr/maif/daikoku/env/env.scala:102

What to do

  • Each finding names the span that makes the branch dead and the span it is dead because of. Confirm from the two, then delete the dead arm or fix the predicate that was meant to be reachable.
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.

X18 · Disposal-pattern correctness10.0 / 10Exemplary○ Nothing flagged

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.

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.

X24 · Document value interpolated into markup unescaped3.2 / 10Weak✓ Tool-verified

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

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

  • `translate({key:'delete.subscription.confirm.modal.description.keyring',replacements:[`<strong>${keyring.customName??k…` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:479
  • `translate({key:'team_apikey_for_api.ask_for_make_unique.2',replacements:[`<strong>${keyring.customName??keyring.apiKe…` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:517
  • `pageRequest.data` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:46
  • `converter.makeHtml(api.description)` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:50
  • `converter.makeHtml(props.page.remoteContentEnabled?content:props.page.content)` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:480
  • `convert((props.page.remoteContentEnabled?content:props.page.content)??'')as string` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:514
  • `converter.makeHtml(api.header.replace('{{title}}',api.name).replace('{{description}}',api.smallDescription))` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:195
  • `converter.makeHtml(post.content)` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — daikoku/javascript/src/components/frontend/api/ApiPost.tsx:181
  • `formStep!.info` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:1248
  • `formStep.info` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:2193
  • `converter.makeHtml(content)` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:390
  • `translate({key:'migration.color-theme.alert.info.3',replacements:[`<a class="underline" target="_blank" href='https:/…` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — daikoku/javascript/src/components/utils/ColorThemeMigrationAlert.tsx:75
  • `converter.makeHtml(tenant.defaultMessage)` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — daikoku/javascript/src/components/utils/sidebar/panels/MessagePanel.tsx:119
  • `translate({key:'topbar.search.placeholder',replacements:['<kbd>/</kbd>']})` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — daikoku/javascript/src/components/utils/sidebar/panels/SearchPanel.tsx:214

What to do

  • Each finding names the expression, the attribute it lands in and the line. Confirm the value's origin from the read this analyzer traced, then escape it at the sink or validate it against the shape the attribute accepts before interpolating.
X25 · Inert configuration knob7.2 / 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.

  • `CmsFile.daikoku_data` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — cli/src/models/folder.rs:22

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.
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether an enhanced `for` leaves the collection it is walking alone — a body that adds to or removes from the very collection the loop is iterating invalidates the fail-fast iterator it is holding, so the next `next()` throws `ConcurrentModificationException` and the remaining elements are never seen. Whether a `for` loop leaves the `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen. Whether a `for` comprehension or `foreach` leaves the mutable collection it is walking alone — an `ArrayBuffer` or `ListBuffer` counts its changes and its iterator checks the count, an `ArrayDeque` (and `mutable.Queue`/`mutable.Stack`) is walked by index up to its starting length, and a `java.util` collection walked through `asScala` is fail-fast, so a body that adds to or removes from the very collection the loop is walking makes a later step throw `ConcurrentModificationException` (`IndexOutOfBoundsException` for a deque) and the remaining elements are never seen.

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

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

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

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

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 handling6.0 / 10Adequate✓ 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.

  • 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. (×7) — daikoku/public/viewerjs/pdf.js:5864, REDACTED:1714, REDACTED:11123, …
  • `case _: Exception` 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. — daikoku/app/fr/maif/daikoku/utils/s3.scala:523
  • `case _: Throwable` 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. — daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:1303
  • `catch (Exception)` 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. — daikoku/app/fr/maif/daikoku/domain/JsonNodeValueResolver.java:35

What to do

  • Swallowed exception (empty catch)
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 Scala's null is held to the type system and not undermined by assertions — a file compiled with `-Yexplicit-nulls` is one where `String` excludes null and `String | Null` admits it, a file under WartRemover's `Null` wart or Scalafix's `DisableSyntax.noNulls` is one whose code cannot write `null` and must say `Option`, and each `.nn`, `import scala.language.unsafeNulls` or null-lint suppression is the author overruling that.

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

  • No build over this repository's 114 Scala product file(s) passes `-Yexplicit-nulls`, enables WartRemover's `Null` wart or runs Scalafix's `DisableSyntax.noNulls`, so every reference type admits null and nothing reports a `null` written into the code or returned from a Java API — the first one to reach a method call is a `NullPointerException`. `Option` by convention is a habit no tool here holds the code to.

What to do

  • On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`. Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it.

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 Health49.4Weak — gated by D2, X5Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture58.4Adequate — gated by D26, R9Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity90.1ExemplarySolid.
Readiness40.0Weak — gated by D13, R8, P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security58.7Adequate — gated by D28, D29, D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Domain Modelling100.0ExemplaryStrongest area.
Event-Driven51.9AdequateAcceptable, with room to improve.
Accessibility42.5Weak — gated by AC4Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance60.0AdequateAcceptable, with room to improve.
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 — 14 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 3 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not included — 53 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 analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — compose up failed (exit 18 — an image could not be pulled) — api-dev Pulling kibana Pulling nginx Pulling otoroshi Pulling redis Pulling elastic Error Get "https://docker.elastic.co/v2/": Forbidden api-dev Error context canceled kibana Error context canceled api-prod Error context canceled redis Error context canceled otoroshi Error context canceled nginx Error context canceled Error response from daemon: Get "https://docker.elastic.co/v2/": Forbidden; the earlier `compose pull` step reported: otoroshi Pulling nginx Pulling redis Pulling kibana Pulling api-prod Pulling elastic Pulling elastic Error Get "https://docker.elastic.co/v2/": Forbidden otoroshi Error context canceled kibana Error context canceled redis Error context canceled api-prod Error context canceled nginx Error context canceled Error response from daemon: Get "https://docker.elastic.co/v2/": Forbidden; the runtime sandbox reaches registries only through the in-fence pull-through mirror, so an image the mirror does not carry cannot be fetched — this is a limit of our sandbox, not of your stack; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
  • C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named column (email, first_name, date_of_birth, phone_number, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, a MongoDB or Cassandra driver, JDBC) imported either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database or data-store client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, JDBC, MongoDB, Cassandra, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database or data-store client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, JDBC, MongoDB, Cassandra, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D11 Test Reliability — Test reliability not included — the .scala 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 — Naming consistency does not read html yet; not measured.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. 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 — None of 0 binding record(s) states a rule in checkable form (a backticked element with a prohibition, or an `adr-rules` block), so conformance cannot be read from the code. Write the rule as an `adr-rules` block (`forbid:` a symbol, a package or a dependency) to make it checkable.
  • D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.scala), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D32 Data Compliance (PII/GDPR) — 102 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
  • 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.
  • D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
  • D8 Code Coverage — Coverage not measured — JavaScript/TypeScript suite
  • DM1 Aggregate boundaries — no aggregates detected — aggregate-boundary check not applicable
  • DM10 One transaction, one aggregate — no repository writes detected — no operation to judge against the one-aggregate rule
  • DM11 Constructible invalid state — no entities detected — construction-time invariants not assessable
  • DM2 Strongly-typed ids — no id-bearing domain types detected — strongly-typed-id adoption not assessable
  • DM3 Integration-event coupling — no integration events detected — coupling check not applicable
  • DM4 Rich vs anemic model — no data-bearing entities detected — rich-vs-anemic model not assessable
  • DM5 Encapsulated state — no domain entities found — DM5 grades how entities protect their state, and this repository declares none
  • DM7 Repository granularity — no repository abstraction detected (e.g. uses a document session)
  • DM8 Value-object opportunities — not scored — the deterministic rule found 0 candidate clump(s); its rows are withheld until it has a measured precision of 95 % (a sample of fewer than 10 rows cannot show one)
  • ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JVM, JavaScript/TypeScript, Rust source, so there is no service whose uptime a failing dependency could take down
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — 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 tinybench, mitata, benchmark.js, benny or vitest `bench(...)` calls in files that import them (or `*.bench.*` files), or one of those in a REDACTED, 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.
  • 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
  • X17 Uncapped recursion over a caller-supplied document — 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 Scala, Java and Rust were read, and no request in it can be cancelled by a caller — a Scala request takes no token: a Future cannot be cancelled, and cats-effect, ZIO and Monix interrupt the fiber that made the request from outside the call, not through a parameter; a Java request off Android takes no token: it is cancelled through the handle it returns (Future.cancel, Call.cancel, a Disposable), ambiently (io.grpc.Context) or by interrupting its thread, not through a parameter; a Rust request takes no token: a future is cancelled by dropping it, from outside the call (select!, a timeout, an aborted task), and reqwest, hyper and tonic take none
  • X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • 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
  • 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
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • 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 — 327 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
  • + 47 more in this group — see findings.md.
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
  • + 20 more in this group — see findings.md.
D30 · Dependency Vulnerabilities · High CVE · ×39
  • 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
  • + 14 more in this group — see findings.md.
ED1 · Handler temporal coupling · Blocking call on the event loop · ×29
  • Blocking call on the event loop: assets.add calls `File::open` cli/src/commands/assets.rs:136 — `assets.add` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: assets.remove calls `std::fs::remove_file` cli/src/commands/assets.rs:185 — `assets.remove` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::remove_file`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: assets.sync calls `File::open` cli/src/commands/assets.rs:298 — `assets.sync` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.delete calls `std::fs::remove_dir_all` cli/src/commands/cms.rs:289 — `cms.delete` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::remove_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.read calls `File::create` cli/src/commands/cms.rs:326 — `cms.read` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::create`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.unzip_to_path calls `std::fs::create_dir_all` cli/src/commands/cms.rs:378 — `cms.unzip_to_path` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.unzip_to_path calls `std::fs::create_dir_all` cli/src/commands/cms.rs:392 — `cms.unzip_to_path` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.unzip_to_path calls `File::create` cli/src/commands/cms.rs:400 — `cms.unzip_to_path` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::create`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.create_api_folder calls `std::fs::create_dir_all` cli/src/commands/cms.rs:573 — `cms.create_api_folder` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.create_api_folder calls `std::fs::create_dir_all` cli/src/commands/cms.rs:590 — `cms.create_api_folder` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.create_api_folder calls `std::fs::create_dir_all` cli/src/commands/cms.rs:603 — `cms.create_api_folder` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.get_cms_page_path calls `std::fs::create_dir_all` cli/src/commands/cms.rs:742 — `cms.get_cms_page_path` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.create_path_and_file calls `std::fs::create_dir_all` cli/src/commands/cms.rs:764 — `cms.create_path_and_file` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.create_path_and_file calls `std::fs::write` cli/src/commands/cms.rs:785 — `cms.create_path_and_file` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::write`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.create_path_and_file calls `std::fs::write` cli/src/commands/cms.rs:793 — `cms.create_path_and_file` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::write`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.create_path_and_file calls `std::fs::write` cli/src/commands/cms.rs:798 — `cms.create_path_and_file` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::write`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.create_daikoku_hidden_files calls `std::fs::create_dir_all` cli/src/commands/cms.rs:814 — `cms.create_daikoku_hidden_files` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.create_daikoku_hidden_files calls `File::create` cli/src/commands/cms.rs:817 — `cms.create_daikoku_hidden_files` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::create`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.create_daikoku_hidden_files calls `File::create` cli/src/commands/cms.rs:820 — `cms.create_daikoku_hidden_files` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::create`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: cms.create_daikoku_hidden_files calls `File::create` cli/src/commands/cms.rs:823 — `cms.create_daikoku_hidden_files` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::create`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: environments.set_content_file calls `std::fs::write` cli/src/commands/environments.rs:92 — `environments.set_content_file` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::write`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: environments.get_daikokuignore calls `std::fs::read_to_string` cli/src/commands/environments.rs:422 — `environments.get_daikokuignore` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read_to_string`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: pull.customization_synchronization calls `std::fs::create_dir_all` cli/src/commands/pull.rs:99 — `pull.customization_synchronization` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: CmsFile.new calls `std::fs::read_to_string` cli/src/models/folder.rs:34 — `CmsFile.new` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read_to_string`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • Blocking call on the event loop: folder.read_sources_and_daikoku_metadata calls `std::fs::read_dir` cli/src/models/folder.rs:106 — `folder.read_sources_and_daikoku_metadata` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read_dir`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
  • + 4 more in this group — see findings.md.
AC4 · Keyboard semantics · Click handler on a non-interactive <span> · ×23
  • Click handler on a non-interactive <span> daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:834 — 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> daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:838 — 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> daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:842 — 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> daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:846 — 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> daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:850 — 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> daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:855 — 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> daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:859 — 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> REDACTED:323 — 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> REDACTED:745 — 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> daikoku/javascript/src/components/backoffice/apikeys/TeamApiKeysForApi.tsx:34 — 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> daikoku/javascript/src/components/backoffice/me/MyProfile.tsx:528 — 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> daikoku/javascript/src/components/backoffice/me/MyProfile.tsx:536 — 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> daikoku/javascript/src/components/backoffice/members/TeamMembers.tsx:221 — 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> daikoku/javascript/src/components/backoffice/members/TeamMembers.tsx:228 — 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> daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:842 — 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> daikoku/javascript/src/components/frontend/api/ApiPost.tsx:130 — 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> daikoku/javascript/src/components/frontend/api/ApiPost.tsx:140 — 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> daikoku/javascript/src/components/frontend/api/ApiPost.tsx:149 — 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> daikoku/javascript/src/components/frontend/api/ApiRedoc.tsx:101 — 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> daikoku/javascript/src/components/frontend/api/ApiRedoc.tsx:108 — 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> daikoku/javascript/src/components/frontend/api/ApiTest.tsx:164 — 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> daikoku/javascript/src/components/frontend/api/ApiTest.tsx:170 — 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> daikoku/javascript/src/components/frontend/api/ApiTest.tsx:177 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
D13 · REDACTED Scanning · Leaked secret · ×17
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
AC2 · Forms & labels · <input> without a programmatic label · ×13
  • <input> without a programmatic label daikoku/javascript/src/apps/DaikokuHomeApp.tsx:29 — This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label daikoku/javascript/src/apps/DaikokuHomeApp.tsx:297 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label daikoku/javascript/src/apps/DaikokuHomeApp.tsx:319 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:261 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:304 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label daikoku/javascript/src/components/adminbackoffice/tenants/TenantAdminList.tsx:144 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label daikoku/javascript/src/components/adminbackoffice/tenants/TenantList.tsx:71 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label daikoku/javascript/src/components/adminbackoffice/tenants/forms/CustomizationForm.tsx:45 — This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:220 — This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:247 — This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label daikoku/javascript/src/components/adminbackoffice/users/UserList.tsx:96 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:217 — This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label daikoku/javascript/src/components/backoffice/apis/TeamApiInfo.tsx:23 — This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
D29 · Static Analysis (SAST) · 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
AC2 · Forms & labels · <label> that labels no control · ×8
  • <label> that labels no control daikoku/javascript/src/components/adminbackoffice/anonymousreporting/AnonymousReporting.tsx:43 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control daikoku/javascript/src/components/adminbackoffice/importexport/ImportExport.tsx:62 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:218 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:245 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx:69 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx:83 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx:99 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:75 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
D28 · Secrets (history) · High secret · ×8
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
AC2 · Forms & labels · <button> with no accessible text · ×7
  • <button> with no accessible text daikoku/javascript/src/components/adminbackoffice/cms/index.tsx:120 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
  • <button> with no accessible text daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:231 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
  • <button> with no accessible text daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:262 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
  • <button> with no accessible text daikoku/javascript/src/components/adminbackoffice/tenants/forms/GeneralForm.tsx:66 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
  • <button> with no accessible text daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx:577 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
  • <button> with no accessible text daikoku/javascript/src/components/backoffice/assets/AssetsList.tsx:124 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
  • <button> with no accessible text daikoku/javascript/src/components/backoffice/assets/AssetsList.tsx:274 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Critical CVE · ×6
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
AC3 · Page structure · Document without a <title> · ×3
  • Document without a <title> cli/templates/cms/src/pages/404.html:1 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
  • Document without a <title> cli/templates/manager.html:2 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
  • Document without a <title> cli/templates/session_expired.html:1 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
AC4 · Keyboard semantics · Click handler on a non-interactive <div> · ×3
  • Click handler on a non-interactive <div> daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:202 — A click handler on a plain element with no role and no tabindex: even where another element's key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a <button>, or add role + tabIndex={0}.
  • Click handler on a non-interactive <div> daikoku/javascript/src/components/backoffice/billing/components.tsx:11 — 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> REDACTED:193 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
AC1 · Text alternatives · <img> without a text alternative · ×2
  • <img> without a text alternative daikoku/javascript/src/apps/DaikokuHomeApp.tsx:40 — 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 daikoku/javascript/src/components/backoffice/me/MyProfile.tsx:118 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
AC2 · Forms & labels · Link with no accessible name · ×2
  • Link with no accessible name daikoku/javascript/src/components/backoffice/assets/AssetsList.tsx:289 — 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 daikoku/javascript/src/components/backoffice/assets/AssetsList.tsx:294 — 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.
AC3 · Page structure · <html> without a lang · ×2
  • <html> without a lang cli/templates/cms/src/pages/404.html:1 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
  • <html> without a lang cli/templates/session_expired.html:1 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
AC3 · Page structure · Viewport restricts zoom · ×2
  • Viewport restricts zoom daikoku/javascript/index.html:6 — user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta.
  • Viewport restricts zoom REDACTED:6 — user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta.
D28 · Secrets (history) · REDACTED · ×2
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · High vulnerability · ×2
  • REDACTED
  • REDACTED
AC2 · Forms & labels · <select> without a programmatic label · ×1
  • <select> without a programmatic label daikoku/javascript/src/components/adminbackoffice/loggers/LoggersList.tsx:27 — This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC2 · Forms & labels · Clickable <a> with no accessible name · ×1
  • Clickable <a> with no accessible name daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:215 — This <a> has no href, so it exposes no link role — but it carries a click handler, which makes it a control. It has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to <button type="button"> — the right fix for its keyboard operability — does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label.
AC3 · Page structure · <iframe> without a title · ×1
  • <iframe> without a title REDACTED:525 — An iframe with no title (or an empty one) is announced only as "frame". Add a non-empty title describing its content, or an aria-label.
D10 · Test Quality · No assertions (empty test) · ×1
  • No assertions (empty test): Cascading deletion daikoku/javascript/tests/_tests/connectedUser.spec.ts:459 — Test method has an empty body — it asserts nothing and exercises no code.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D34 · Knowledge Freshness · Orphaned knowledge · ×1
  • Orphaned knowledge daikoku/javascript/src/services/currencies.ts:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
R8 · Dependency Hygiene · Unlisted import '@rc-component/picker' · ×1
  • Unlisted import '@rc-component/picker' daikoku/javascript/src/components/inputs/datepicker.tsx:3 — Imported but not declared in any reachable REDACTED — installs work only by hoisting accident.
R8 · Dependency Hygiene · Unlisted import 'date-fns' · ×1
  • Unlisted import 'date-fns' daikoku/javascript/src/components/adminbackoffice/audittrail/AuditTrailList.tsx:2 — Imported but not declared in any reachable REDACTED — installs work only by hoisting accident.
R8 · Dependency Hygiene · Unlisted import 'react-router' · ×1
  • Unlisted import 'react-router' daikoku/javascript/src/apps/DaikokuApp.tsx:2 — Imported but not declared in any reachable REDACTED — installs work only by hoisting accident.
R9 · Circular Imports · Import cycle (4 files) · ×1
  • Import cycle (4 files) daikoku/javascript/src/contexts/i18n-context.tsx:9 — daikoku/javascript/src/contexts/i18n-context.tsx → daikoku/javascript/src/contexts/globalContext.tsx → daikoku/javascript/src/services/index.ts → daikoku/javascript/src/components/utils/sidebar/panels/SearchPanel.tsx → daikoku/javascript/src/contexts/i18n-context.tsx (one verified cycle inside a mutually-dependent group of 126 files)
Serious — 1189 finding(s)
D17 · Explicit Debt · TodoComment · ×98
  • TodoComment daikoku/test/fr/maif/daikoku/usages/ApiLifeCycleSpec.scala:281 — // todo : check mail (test container) — 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 daikoku/test/fr/maif/daikoku/usages/ApiLifeCycleSpec.scala:283 — // TODO: écrire un test pour la gestion des versions — 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 daikoku/test/fr/maif/daikoku/usages/ApiLifeCycleSpec.scala:737 — // todo: call avec admin owner to update apiversion 1 with state blcoked — 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 daikoku/test/fr/maif/daikoku/usages/ApiLifeCycleSpec.scala:738 — // todo: call graphql to verifier que <nom api> (version 2) est bien dans la liste et que isDefault est true — 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 daikoku/test/fr/maif/daikoku/usages/DeletionServiceSpec.scala:419 — // todo: verif if subscriptions, docs, plans, demands & stepValidatores are cleans — 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 daikoku/test/fr/maif/daikoku/usages/DeletionServiceSpec.scala:1056 — // todo: verif if subscriptions, docs, plans, demands & stepValidatores are cleans — 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 daikoku/test/fr/maif/daikoku/controllers/ApiControllerTeamAdminSpec.scala:798 — // todo: verif if subscriptions, docs, plans, demands & stepValidatores are cleans — 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 daikoku/test/fr/maif/daikoku/usages/DeletionServiceSpec.scala:4154 — // todo: if user maiddemand ? — 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 daikoku/test/fr/maif/daikoku/controllers/AdminApiControllerSpec.scala:2343 — // todo: nothing validated — 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 daikoku/test/fr/maif/daikoku/controllers/AdminApiControllerSpec.scala:3397 — // todo: no deleted => no conflict — 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 daikoku/test/fr/maif/daikoku/controllers/ApiControllerTeamAdminSpec.scala:1659 — // TODO: verifier le nouveau nom de la subscription — 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 daikoku/test/fr/maif/daikoku/controllers/GraphQLControllerSpec.scala:992 — // todo: tags — 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 daikoku/test/fr/maif/daikoku/controllers/NotificationControllerSpec.scala:1465 — // TODO: save a dedicated notification — 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 daikoku/test/fr/maif/daikoku/controllers/UserControllerSpec.scala:330 — // todo: test it — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment daikoku/javascript/tests/specs/admin_dk.spec.ts:71 — //todo: clean up the teams — 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 daikoku/javascript/tests/specs/api_mgmt.spec.ts:45 — //todo: find a way to fill description by playwright — 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 daikoku/javascript/tests/specs/api_mgmt.spec.ts:75 — //todo: wait for better API lifecycle to test deprected — 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 daikoku/javascript/tests/specs/api_mgmt.spec.ts:136 — //todo: update sub pour setup date to today — 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 daikoku/javascript/tests/specs/dashboard.spec.ts:172 — //todo: display icon for group, admin & private/pwa — 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 daikoku/javascript/tests/specs/gestion_membres.spec.ts:43 — //todo: warning "Rechercher" is a bad label maybe change in the newer version — 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 daikoku/javascript/tests/specs/gestion_membres.spec.ts:73 — //todo: warning "Rechercher" is a bad label maybe change in the newer version — 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 daikoku/javascript/tests/specs/gestion_membres.spec.ts:102 — //todo: warning "Rechercher" is a bad label maybe change in the newer version — 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 daikoku/javascript/tests/specs/gestion_membres.spec.ts:50 — // todo: Why following link in mail is breaking tests — 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 daikoku/javascript/tests/specs/gestion_membres.spec.ts:80 — // todo: Why following link in mail is breaking tests — 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 daikoku/javascript/tests/specs/gestion_membres.spec.ts:109 — // todo: Why following link in mail is breaking tests — 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.
  • + 73 more in this group — see findings.md.
D3 · God Classes · FunctionTooLong · ×57
  • FunctionTooLong: ApiPricing.ApiPricing REDACTED:913 — FunctionTooLong — ApiPricing runs 1015 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 915 over it, 10.15× 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: NotificationList.NotificationList daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:167 — FunctionTooLong — NotificationList runs 714 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 614 over it, 7.14× 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: KeyringCard.KeyringCard REDACTED:207 — FunctionTooLong — KeyringCard runs 621 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 521 over it, 6.21× 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: DynamicTable.DynamicTable daikoku/javascript/src/components/inputs/DynamicTable.tsx:238 — FunctionTooLong — DynamicTable runs 464 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 364 over it, 4.64× 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: RemoteCatalogsForm.RemoteCatalogsForm daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:355 — FunctionTooLong — RemoteCatalogsForm runs 460 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 360 over it, 4.60× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: DaikokuApp.DaikokuApp daikoku/javascript/src/apps/DaikokuApp.tsx:59 — FunctionTooLong — DaikokuApp runs 326 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 226 over it, 3.26× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: SubscriptionProcessEditor.SubscriptionProcessEditor daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx:272 — FunctionTooLong — SubscriptionProcessEditor runs 317 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 217 over it, 3.17× 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: AutenticationForm.AuthenticationForm daikoku/javascript/src/components/adminbackoffice/tenants/forms/AutenticationForm.tsx:12 — FunctionTooLong — AuthenticationForm runs 316 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 216 over it, 3.16× 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: TeamApiSubscriptions.TeamApiSubscriptions daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx:75 — FunctionTooLong — TeamApiSubscriptions runs 290 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 190 over it, 2.90× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: ApiHeader.ApiHeader REDACTED:28 — FunctionTooLong — ApiHeader runs 273 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 173 over it, 2.73× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: SecurityForm.SecurityForm daikoku/javascript/src/components/adminbackoffice/tenants/forms/SecurityForm.tsx:15 — FunctionTooLong — SecurityForm runs 247 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 147 over it, 2.47× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: TeamList.TeamList daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:20 — FunctionTooLong — TeamList runs 246 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 146 over it, 2.46× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: AssetsList.AssetsList daikoku/javascript/src/components/backoffice/assets/AssetsList.tsx:147 — FunctionTooLong — AssetsList runs 245 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 145 over it, 2.45× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: AtomicDesign.AtomicDesign daikoku/javascript/src/components/frontend/AtomicDesign.tsx:5 — FunctionTooLong — AtomicDesign runs 235 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 135 over it, 2.35× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: ApiDocumentation.ApiDocumentation REDACTED:143 — FunctionTooLong — ApiDocumentation runs 235 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 135 over it, 2.35× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: TeamApiDocumentation.TeamApiDocumentation daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:111 — FunctionTooLong — TeamApiDocumentation runs 228 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 128 over it, 2.28× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: ApiList.ApiList daikoku/javascript/src/components/frontend/dashboard/ApiList.tsx:27 — FunctionTooLong — ApiList runs 212 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 112 over it, 2.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: TeamMembers.TeamMembersSimpleComponent daikoku/javascript/src/components/backoffice/members/TeamMembers.tsx:45 — FunctionTooLong — TeamMembersSimpleComponent runs 209 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 109 over it, 2.09× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: SubscriptionMetadataModal.SubscriptionMetadataModal daikoku/javascript/src/contexts/modals/SubscriptionMetadataModal.tsx:33 — FunctionTooLong — SubscriptionMetadataModal runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.06× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: SortableTree.SortableTree daikoku/javascript/src/components/utils/dnd/SortableTree.tsx:85 — FunctionTooLong — SortableTree runs 202 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 102 over it, 2.02× 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: messages.AdminMessages daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:35 — FunctionTooLong — AdminMessages runs 191 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 91 over it, 1.91× 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: ApiTimelineIssue.ApiTimelineIssue REDACTED:51 — FunctionTooLong — ApiTimelineIssue runs 189 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 89 over it, 1.89× 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: ApiPricing.OtoroshiEntitiesSelector REDACTED:104 — FunctionTooLong — OtoroshiEntitiesSelector runs 186 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 86 over it, 1.86× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: MyProfile.TwoFactorAuthentication daikoku/javascript/src/components/backoffice/me/MyProfile.tsx:19 — FunctionTooLong — TwoFactorAuthentication runs 180 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 80 over it, 1.80× 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: TenantEdit.TenantEditComponent daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx:32 — FunctionTooLong — TenantEditComponent runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 74 over it, 1.74× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • + 32 more in this group — see findings.md.
D17 · Explicit Debt · FixmeComment · ×43
  • FixmeComment daikoku/test/fr/maif/daikoku/controllers/ApiControllerRolesSpec.scala:755 — // respVerif.status mustBe 200 //FIXME 404 — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/tests/specs/notifications.ts:172 — //FIXME: entire subscription — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/tests/specs/notifications.ts:187 — //FIXME: entire api — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/tests/_tests/completeJourney.spec.ts:29 — // FIXME: find the fine selector to check user is connected — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/tests/_tests/connectedUser.spec.ts:268 — //FIXME -> wants to see locker — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/tests/_tests/connectedUser.spec.ts:318 — //FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/src/components/adminbackoffice/tenants/forms/AuditForm.tsx:31 — //FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1564 — //FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1578 — //FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/tests/_tests/connectedUser.spec.ts:320 — //FIXME: due to small viewport`` — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/tests/_tests/connectedUser.spec.ts:555 — //FIXME: verifier qu'il n'y a qu'une seul API dans la liste — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/src/components/utils/OtoroshiStatsVizualisation.tsx:42 — //FIXME: test it becaus eit's weird — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/src/components/utils/OtoroshiStatsVizualisation.tsx:143 — //@ts-ignore //FIXME: WEIRD — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/src/components/utils/OtoroshiStatsVizualisation.tsx:268 — //@ts-ignore //FIXME: weird — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/src/components/utils/permissions/Can.tsx:86 — //FIXME [#609]
  • FixmeComment REDACTED:281 — //@ts-ignore //FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/src/components/backoffice/apis/TeamApiInfo.tsx:60 — //@ts-ignore //FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/src/components/backoffice/apis/TeamApiInfo.tsx:91 — //@ts-ignore //FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/src/components/backoffice/apis/TeamApiInfo.tsx:106 — //@ts-ignore //FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/src/components/backoffice/apis/TeamApiInfo.tsx:119 — //@ts-ignore //FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/src/components/backoffice/apis/TeamApiInfo.tsx:140 — //@ts-ignore //FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/src/components/backoffice/apis/TeamApiInfo.tsx:166 — //@ts-ignore //FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/src/components/backoffice/apis/TeamApiInfo.tsx:172 — //@ts-ignore //FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/src/components/backoffice/apis/TeamApiInfo.tsx:186 — //@ts-ignore //FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:490 — //@ts-ignore //FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • + 18 more in this group — see findings.md.
D3 · God Classes · FileTooLong · ×40
  • FileTooLong: domain/json.scala daikoku/app/fr/maif/daikoku/domain/json.scala — FileTooLong — 4514 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4014 over it, 9.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: domain/SchemaDefinition.scala daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala — FileTooLong — 4024 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3524 over it, 8.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: controllers/ApiController.scala daikoku/app/fr/maif/daikoku/controllers/ApiController.scala — FileTooLong — 3143 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: ApiController (59-4177). The bar is 500 significant lines; this is 2643 over it, 6.29× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: services/index.ts daikoku/javascript/src/services/index.ts — FileTooLong — 2119 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1619 over it, 4.24× 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: env/evolutions.scala daikoku/app/fr/maif/daikoku/env/evolutions.scala — FileTooLong — 1996 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1496 over it, 3.99× 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: services/ApiService.scala daikoku/app/fr/maif/daikoku/services/ApiService.scala — FileTooLong — 1908 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1408 over it, 3.82× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 1823 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1323 over it, 3.65× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 1789 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1289 over it, 3.58× 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: domain/CommonServices.scala daikoku/app/fr/maif/daikoku/domain/CommonServices.scala — FileTooLong — 1691 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1191 over it, 3.38× 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 — 1437 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 937 over it, 2.87× 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: controllers/AdminApiController.scala daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala — FileTooLong — 1383 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 883 over it, 2.77× 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: utils/diff_match_patch.java daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java — FileTooLong — 1290 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: diff_match_patch (22-2348). The bar is 500 significant lines; this is 790 over it, 2.58× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: services/CmsRenderer.scala daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala — FileTooLong — 1231 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 731 over it, 2.46× 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: controllers/LoginController.scala daikoku/app/fr/maif/daikoku/controllers/LoginController.scala — FileTooLong — 1055 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: LoginController (47-1430). The bar is 500 significant lines; this is 555 over it, 2.11× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: controllers/authorizations.scala daikoku/app/fr/maif/daikoku/controllers/authorizations.scala — FileTooLong — 1003 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 503 over it, 2.01× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: env/env.scala daikoku/app/fr/maif/daikoku/env/env.scala — FileTooLong — 920 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 420 over it, 1.84× 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: notifications/NotificationList.tsx daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx — FileTooLong — 852 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: NotificationList (167-1038). The bar is 500 significant lines; this is 352 over it, 1.70× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 851 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: RemoteCatalogEngine (66-1213). The bar is 500 significant lines; this is 351 over it, 1.70× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: audit/audit.scala daikoku/app/fr/maif/daikoku/audit/audit.scala — FileTooLong — 812 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 312 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: REDACTED REDACTED — FileTooLong — 803 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: KeyringCard (207-996). The bar is 500 significant lines; this is 303 over it, 1.61× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: domain/apiEntities.scala daikoku/app/fr/maif/daikoku/domain/apiEntities.scala — FileTooLong — 765 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 265 over it, 1.53× 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: forms/RemoteCatalogsForm.tsx daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx — FileTooLong — 736 significant lines (blank, comment-only and punctuation-only lines excluded), about 62% of them inside a single declaration: RemoteCatalogsForm (355-950). The bar is 500 significant lines; this is 236 over it, 1.47× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: controllers/TeamController.scala daikoku/app/fr/maif/daikoku/controllers/TeamController.scala — FileTooLong — 729 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: TeamController (33-994). The bar is 500 significant lines; this is 229 over it, 1.46× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: jobs/OtoroshiSynchronizerJob.scala daikoku/app/fr/maif/daikoku/jobs/OtoroshiSynchronizerJob.scala — FileTooLong — 709 significant lines (blank, comment-only and punctuation-only lines excluded), about 63% of them inside a single declaration: OtoroshiSynchronizerJob (330-899). The bar is 500 significant lines; this is 209 over it, 1.42× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: controllers/NotificationController.scala daikoku/app/fr/maif/daikoku/controllers/NotificationController.scala — FileTooLong — 701 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: NotificationController (35-887). The bar is 500 significant lines; this is 201 over it, 1.40× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • + 15 more in this group — see findings.md.
R4 · Test Coverage · No test reaches this file · ×40
  • No test reaches this file REDACTED:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/public/viewerjs/pdf.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file REDACTED:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/apps/DaikokuApp.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/remotecatalogs/CatalogRuns.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/tenants/forms/AutenticationForm.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/public/viewerjs/text_layer_builder.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/public/viewerjs/ui_utils.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/scripts/i18n-audit.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/tenants/forms/SecurityForm.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/apps/DaikokuHomeApp.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/users/UserEdit.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/tenants/forms/MailForm.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/tenants/forms/ThirdPartyPaymentForm.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/remotecatalogs/ResourceLoader.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/tenants/forms/CustomizationForm.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/tenants/TenantAdminList.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/cms/index.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/tenants/EditFrontOfficeTranslations.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/adminbackoffice/tenants/forms/AuditForm.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file daikoku/javascript/src/components/frontend/account/signup.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • + 15 more in this group — see findings.md.
AC6 · Visual & motion safety · Animation without a prefers-reduced-motion guard · ×24
  • Animation without a prefers-reduced-motion guard manual/src/pages/index.module.css:166 — `.heroLogo` moves (`animation-name: jack-in-the-box`) 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 docs/assets/css/styles.111e5321.css:1 — `.loadingRing_RJI3 div` moves (`animation: 1.2s cubic-bezier(.5,0,.5,1) infinite a`) 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 docs/assets/css/styles.111e5321.css:1 — `.heroLogo_U6bI` moves (`animation-name: b`) 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 docs/assets/css/styles.58620cc5.css:1 — `.loadingRing_RJI3 div` moves (`animation: 1.2s cubic-bezier(.5,0,.5,1) infinite a`) 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 docs/assets/css/styles.58620cc5.css:1 — `.heroLogo_U6bI` moves (`animation-name: b`) 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 docs/assets/css/styles.8152f05c.css:1 — `.loadingRing_RJI3 div` moves (`animation: 1.2s cubic-bezier(.5,0,.5,1) infinite a`) 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 docs/assets/css/styles.8152f05c.css:1 — `.heroLogo_U6bI` moves (`animation-name: b`) 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 docs/assets/css/styles.98544a2c.css:1 — `.loadingRing_RJI3 div` moves (`animation: 1.2s cubic-bezier(.5,0,.5,1) infinite a`) 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 docs/assets/css/styles.98544a2c.css:1 — `.heroLogo_U6bI` moves (`animation-name: b`) 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 docs/assets/css/styles.996bb7bb.css:1 — `.loadingRing_RJI3 div` moves (`animation: 1.2s cubic-bezier(.5,0,.5,1) infinite a`) 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 docs/assets/css/styles.996bb7bb.css:1 — `.heroLogo_U6bI` moves (`animation-name: b`) 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 docs/assets/css/styles.ec4c36b5.css:1 — `.loadingRing_RJI3 div` moves (`animation: 1.2s cubic-bezier(.5,0,.5,1) infinite a`) 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 docs/assets/css/styles.ec4c36b5.css:1 — `.heroLogo_U6bI` moves (`animation-name: b`) 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 daikoku/javascript/src/style/layout/navbar.scss:130 — `.navbar-panel` moves (`transition: width .2s ease-in-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.
  • Animation without a prefers-reduced-motion guard daikoku/javascript/src/style/layout/navbar.scss:164 — `.navbar-panel-background` moves (`transition: width .2s ease-in-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.
  • Animation without a prefers-reduced-motion guard daikoku/javascript/src/style/layout/navbar.scss:235 — `.navbar-companion` moves (`transition: width .2s ease-in-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.
  • Animation without a prefers-reduced-motion guard daikoku/javascript/src/style/layout/rightPanel.scss:31 — `.right-panel` moves (`transition: width .2s ease-in-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.
  • Animation without a prefers-reduced-motion guard daikoku/javascript/src/style/layout/rightPanel.scss:50 — `.right-panel-background` moves (`transition: width .2s ease-in-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.
  • Animation without a prefers-reduced-motion guard daikoku/javascript/src/style/layout/style.scss:379 — `.pill-cursor` moves (`transition: left 0.25s`) 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 daikoku/javascript/src/style/components/apiSubscription.scss:85 — `.api-subscription .api-subscription__icon .dot::before` moves (`animation: pulseBig 2s infinite`) 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 daikoku/javascript/src/style/components/btn.scss:96 — `.shake.active` moves (`animation: shake 200ms 2 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 daikoku/javascript/src/style/components/btn.scss:318 — `.--rotate` moves (`animation: rotating 2s linear infinite`) 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 daikoku/javascript/src/style/components/modal.scss:140 — `.tile img` moves (`transition: transform 500ms 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 daikoku/javascript/src/style/components/modal.scss:183 — `.modal.right.fade .modal-dialog` moves (`transition: opacity 0.3s linear, right 0.3s 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.
D30 · Dependency Vulnerabilities · Medium CVE · ×23
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D15 · Churn × Complexity Hotspots · Hotspot · ×21
  • Hotspot: daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:147 — daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in SchemaDefinition.getSchema at line 147. 9 of those changes were fix/bug commits, and the other 16 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala`: 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:913 — REDACTED changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 104 in ApiPricing.ApiPricing at line 913. 11 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: daikoku/app/fr/maif/daikoku/services/ApiService.scala daikoku/app/fr/maif/daikoku/services/ApiService.scala:1348 — daikoku/app/fr/maif/daikoku/services/ApiService.scala changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in ApiService.runSubscriptionProcess at line 1348. 3 of those changes were fix/bug commits, and the other 16 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/app/fr/maif/daikoku/services/ApiService.scala`: 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: daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:167 — daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in NotificationList.NotificationList at line 167. 2 of those changes were fix/bug commits, and the other 6 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: daikoku/app/fr/maif/daikoku/controllers/ApiController.scala daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3252 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ApiController.updateIssue at line 3252. 6 of those changes were fix/bug commits, and the other 19 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/app/fr/maif/daikoku/controllers/ApiController.scala`: 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: daikoku/app/fr/maif/daikoku/domain/CommonServices.scala daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:22 — daikoku/app/fr/maif/daikoku/domain/CommonServices.scala changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in CommonServices.getApisByIds at line 22. 7 of those changes were fix/bug commits, and the other 14 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/app/fr/maif/daikoku/domain/CommonServices.scala`: 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: daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx:75 — daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in TeamApiSubscriptions.TeamApiSubscriptions at line 75. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: daikoku/javascript/src/components/frontend/api/ApiHome.tsx daikoku/javascript/src/components/frontend/api/ApiHome.tsx:18 — daikoku/javascript/src/components/frontend/api/ApiHome.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in ApiHome.ApiHome at line 18. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/javascript/src/components/frontend/api/ApiHome.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: REDACTED REDACTED:191 — REDACTED changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DeletionService.deleteSubscriptions at line 191. 1 of those changes was a fix/bug commit, and the other 16 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:355 — daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in RemoteCatalogsForm.RemoteCatalogsForm at line 355. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: REDACTED REDACTED:207 — REDACTED changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in KeyringCard.KeyringCard at line 207. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: daikoku/app/fr/maif/daikoku/login/otoroshi.scala daikoku/app/fr/maif/daikoku/login/otoroshi.scala:79 — daikoku/app/fr/maif/daikoku/login/otoroshi.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in OtoroshiIdentityFilter.apply at line 79. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/app/fr/maif/daikoku/login/otoroshi.scala`: 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: daikoku/app/fr/maif/daikoku/login/api.scala daikoku/app/fr/maif/daikoku/login/api.scala:338 — daikoku/app/fr/maif/daikoku/login/api.scala changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in LoginFilter.apply at line 338. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/app/fr/maif/daikoku/login/api.scala`: 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:188 — REDACTED changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ApiKeyStatsJob.syncConsumptionStatsForSubscription at line 188. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: daikoku/app/fr/maif/daikoku/jobs/OtoroshiSynchronizerJob.scala daikoku/app/fr/maif/daikoku/jobs/OtoroshiSynchronizerJob.scala:627 — daikoku/app/fr/maif/daikoku/jobs/OtoroshiSynchronizerJob.scala changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in OtoroshiSynchronizerJob.synchronizeApikeys at line 627. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/app/fr/maif/daikoku/jobs/OtoroshiSynchronizerJob.scala`: 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: daikoku/javascript/src/components/frontend/dashboard/ApiList.tsx daikoku/javascript/src/components/frontend/dashboard/ApiList.tsx:27 — daikoku/javascript/src/components/frontend/dashboard/ApiList.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ApiList.ApiList at line 27. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/javascript/src/components/frontend/dashboard/ApiList.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: daikoku/javascript/src/components/inputs/DynamicTable.tsx daikoku/javascript/src/components/inputs/DynamicTable.tsx:238 — daikoku/javascript/src/components/inputs/DynamicTable.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in DynamicTable.DynamicTable at line 238. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/javascript/src/components/inputs/DynamicTable.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:302 — daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in CatalogSourceGithub.fetchFromSingleRepo at line 302. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala`: 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: daikoku/app/fr/maif/daikoku/services/ApiCrudService.scala daikoku/app/fr/maif/daikoku/services/ApiCrudService.scala:85 — daikoku/app/fr/maif/daikoku/services/ApiCrudService.scala changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ApiCrudService.updateApi at line 85. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/app/fr/maif/daikoku/services/ApiCrudService.scala`: 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: daikoku/app/fr/maif/daikoku/jobs/AnonymousReportingJob.scala daikoku/app/fr/maif/daikoku/jobs/AnonymousReportingJob.scala:83 — daikoku/app/fr/maif/daikoku/jobs/AnonymousReportingJob.scala changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in AnonymousReportingJob.getData at line 83. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/app/fr/maif/daikoku/jobs/AnonymousReportingJob.scala`: 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: daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx:32 — daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in TenantEdit.TenantEditComponent at line 32. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D3 · God Classes · ClassTooLong · ×20
  • ClassTooLong: ApiController daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:59 — ClassTooLong — 3092 significant lines (blank, comment-only and punctuation-only lines excluded), 91 methods. The bar is 400 significant lines; this is 2692 over it, 7.73× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: diff_match_patch daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:22 — ClassTooLong — 1283 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 400 significant lines; this is 883 over it, 3.21× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: ApiPricing REDACTED:1 — ClassTooLong — 1015 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 615 over it, 2.54× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: LoginController daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:47 — ClassTooLong — 1013 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 613 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.
  • ClassTooLong: NotificationList daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:1 — ClassTooLong — 714 significant lines (blank, comment-only and punctuation-only lines excluded), 1 methods. The bar is 400 significant lines; this is 314 over it, 1.79× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: TeamController daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:33 — ClassTooLong — 701 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 301 over it, 1.75× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: NotificationController daikoku/app/fr/maif/daikoku/controllers/NotificationController.scala:35 — ClassTooLong — 672 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 272 over it, 1.68× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: PaymentClient daikoku/app/fr/maif/daikoku/controllers/PaymentClient.scala:22 — ClassTooLong — 668 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 268 over it, 1.67× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: DeletionService REDACTED:18 — ClassTooLong — 628 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 228 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.
  • ClassTooLong: KeyringCard REDACTED:1 — ClassTooLong — 621 significant lines (blank, comment-only and punctuation-only lines excluded), 5 methods. The bar is 400 significant lines; this is 221 over it, 1.55× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: TenantController daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:31 — ClassTooLong — 536 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 136 over it, 1.34× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: AccountCreationService daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:22 — ClassTooLong — 507 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 107 over it, 1.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.
  • ClassTooLong: PostgresDataStore REDACTED:451 — ClassTooLong — 493 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 93 over it, 1.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: DynamicTable daikoku/javascript/src/components/inputs/DynamicTable.tsx:1 — ClassTooLong — 464 significant lines (blank, comment-only and punctuation-only lines excluded), 3 methods. The bar is 400 significant lines; this is 64 over it, 1.16× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: RemoteCatalogsForm daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:1 — ClassTooLong — 460 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 60 over it, 1.15× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: OtoroshiSynchronizerJob daikoku/app/fr/maif/daikoku/jobs/OtoroshiSynchronizerJob.scala:330 — ClassTooLong — 450 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 50 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: ApiKeyStatsJob REDACTED:28 — ClassTooLong — 432 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 32 over it, 1.08× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: HomeController daikoku/app/fr/maif/daikoku/controllers/HomeController.scala:38 — ClassTooLong — 423 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 23 over it, 1.06× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: OtoroshiClient daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:47 — ClassTooLong — 417 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 17 over it, 1.04× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: AdminApiController daikoku/app/fr/maif/daikoku/utils/admin.scala:235 — ClassTooLong — 404 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 4 over it, 1.01× 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.
D6 · Cohesion (LCOM4) · Low cohesion · ×18
  • Low cohesion: ApiController (LCOM4 64) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:59 — ApiController's methods fall into 64 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 64 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: TeamController (LCOM4 19) daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:33 — TeamController's methods fall into 19 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 19 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: OtoroshiSettingsController (LCOM4 17) daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:34 — OtoroshiSettingsController's methods fall into 17 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 17 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: TenantController (LCOM4 17) daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:31 — TenantController's methods fall into 17 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 17 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: UsersController (LCOM4 15) daikoku/app/fr/maif/daikoku/controllers/UsersController.scala:38 — UsersController's methods fall into 15 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 15 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: ConsumptionController (LCOM4 12) daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:27 — ConsumptionController's methods fall into 12 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 12 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: LoginController (LCOM4 12) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:47 — LoginController's methods fall into 12 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 12 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: ApiService (LCOM4 10) daikoku/app/fr/maif/daikoku/services/ApiService.scala:39 — ApiService's methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: StateController (LCOM4 7) daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:34 — StateController's methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: HomeController (LCOM4 7) daikoku/app/fr/maif/daikoku/controllers/HomeController.scala:38 — HomeController's methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: JobsController (LCOM4 7) daikoku/app/fr/maif/daikoku/controllers/JobsController.scala:20 — JobsController's methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: RemoteCatalogController (LCOM4 7) daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogController.scala:29 — RemoteCatalogController's methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: TranslationController (LCOM4 6) daikoku/app/fr/maif/daikoku/controllers/TranslationController.scala:31 — TranslationController's methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: TenantAssetsController (LCOM4 5) daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:320 — TenantAssetsController's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: KeyringController (LCOM4 5) daikoku/app/fr/maif/daikoku/controllers/KeyringController.scala:18 — KeyringController's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: TeamAssetsController (LCOM4 4) daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:34 — TeamAssetsController's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: MockController (LCOM4 4) daikoku/app/fr/maif/daikoku/controllers/MockController.scala:15 — MockController's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: SessionController (LCOM4 4) daikoku/app/fr/maif/daikoku/controllers/SessionController.scala:16 — SessionController's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
D30 · Dependency Vulnerabilities · Medium advisory (unsound) · ×14
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
X24 · Document value interpolated into markup unescaped · Untrusted text written into markup unescaped · ×14
  • Untrusted text written into markup unescaped REDACTED:479 — `translate({key:'delete.subscription.confirm.modal.description.keyring',replacements:[`<strong>${keyring.customName??k…` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped REDACTED:517 — `translate({key:'team_apikey_for_api.ask_for_make_unique.2',replacements:[`<strong>${keyring.customName??keyring.apiKe…` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped REDACTED:46 — `pageRequest.data` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped REDACTED:50 — `converter.makeHtml(api.description)` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped REDACTED:480 — `converter.makeHtml(props.page.remoteContentEnabled?content:props.page.content)` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped REDACTED:514 — `convert((props.page.remoteContentEnabled?content:props.page.content)??'')as string` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped REDACTED:195 — `converter.makeHtml(api.header.replace('{{title}}',api.name).replace('{{description}}',api.smallDescription))` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped daikoku/javascript/src/components/frontend/api/ApiPost.tsx:181 — `converter.makeHtml(post.content)` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped REDACTED:1248 — `formStep!.info` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped REDACTED:2193 — `formStep.info` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped REDACTED:390 — `converter.makeHtml(content)` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped daikoku/javascript/src/components/utils/ColorThemeMigrationAlert.tsx:75 — `translate({key:'migration.color-theme.alert.info.3',replacements:[`<a class="underline" target="_blank" href='https:/…` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped daikoku/javascript/src/components/utils/sidebar/panels/MessagePanel.tsx:119 — `converter.makeHtml(tenant.defaultMessage)` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
  • Untrusted text written into markup unescaped daikoku/javascript/src/components/utils/sidebar/panels/SearchPanel.tsx:214 — `translate({key:'topbar.search.placeholder',replacements:['<kbd>/</kbd>']})` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
AC4 · Keyboard semantics · Link used as a button (placeholder href) · ×12
  • Link used as a button (placeholder href) daikoku/javascript/src/apps/DaikokuHomeApp.tsx:307 — 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) daikoku/javascript/src/apps/DaikokuHomeApp.tsx:335 — 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) daikoku/javascript/src/components/adminbackoffice/tenants/TenantList.tsx: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.
  • Link used as a button (placeholder href) daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:545 — 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) daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:609 — 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) daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:629 — 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) daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:647 — 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) daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:670 — 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) daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:692 — 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) daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:735 — 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) daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:821 — 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) daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:874 — 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.
D29 · Static Analysis (SAST) · REDACTED · ×9
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D3 · God Classes · MethodTooLong · ×9
  • MethodTooLong: OtoroshiIdentityFilter.apply daikoku/app/fr/maif/daikoku/login/otoroshi.scala:79 — MethodTooLong — apply runs 340 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 240 over it, 3.40× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: NotificationController.rejectNotificationOfTeam daikoku/app/fr/maif/daikoku/controllers/NotificationController.scala:248 — MethodTooLong — rejectNotificationOfTeam runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: LdapSupport.getUser daikoku/app/fr/maif/daikoku/login/ldap.scala:247 — MethodTooLong — getUser runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: OtoroshiSynchronizerJob.synchronizeApikeys daikoku/app/fr/maif/daikoku/jobs/OtoroshiSynchronizerJob.scala:627 — MethodTooLong — synchronizeApikeys runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: ApiController.createIssue daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3079 — MethodTooLong — createIssue runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: LoginFilter.apply daikoku/app/fr/maif/daikoku/login/api.scala:338 — MethodTooLong — apply runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: ApiController.getApiSubscriptionsForTeam daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1464 — MethodTooLong — getApiSubscriptionsForTeam runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: diff_match_patch.diff_cleanupMerge daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:1133 — MethodTooLong — diff_cleanupMerge runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.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.
  • MethodTooLong: DeletionService.deleteSubscriptions REDACTED:191 — MethodTooLong — deleteSubscriptions runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
AC6 · Visual & motion safety · Focus outline removed in CSS without a · ×8
  • Focus outline removed in CSS without a :focus replacement docs/assets/css/styles.111e5321.css:1 — `body:not(.navigation-with-keyboard) :not(input):focus` 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.
  • Focus outline removed in CSS without a :focus replacement docs/assets/css/styles.58620cc5.css:1 — `body:not(.navigation-with-keyboard) :not(input):focus` 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.
  • Focus outline removed in CSS without a :focus replacement docs/assets/css/styles.8152f05c.css:1 — `body:not(.navigation-with-keyboard) :not(input):focus` 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.
  • Focus outline removed in CSS without a :focus replacement docs/assets/css/styles.98544a2c.css:1 — `body:not(.navigation-with-keyboard) :not(input):focus` 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.
  • Focus outline removed in CSS without a :focus replacement docs/assets/css/styles.996bb7bb.css:1 — `body:not(.navigation-with-keyboard) :not(input):focus` 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.
  • Focus outline removed in CSS without a :focus replacement docs/assets/css/styles.ec4c36b5.css:1 — `body:not(.navigation-with-keyboard) :not(input):focus` 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.
  • Focus outline removed in CSS without a :focus replacement daikoku/javascript/src/style/layout/style.scss:39 — `*:focus` 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.
  • Focus outline removed in CSS without a :focus replacement daikoku/javascript/src/style/components/discussion.scss:89 — `.discussion-form .send-button` 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.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×8
  • Duplicated block (11 lines × 2) REDACTED:375 — REDACTED:375-385 | REDACTED:490-500 — both copies are in the same file, so extract the 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:375` 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) daikoku/app/fr/maif/daikoku/audit/audit.scala:837 — daikoku/app/fr/maif/daikoku/audit/audit.scala:837-847 | daikoku/app/fr/maif/daikoku/audit/audit.scala:851-861 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (11 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2138 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2138-2148 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2214-2224 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2138` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 2) daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogAdminApiController.scala:159 — daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogAdminApiController.scala:159-169 | daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogTokenController.scala:72-82 — 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 `daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogAdminApiController.scala:159` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 2) daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:545 — daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:545-556 | daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:709-719 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:545` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 2) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:417 — daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:417-427 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:321-331 — before extracting anything, compare `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala` and `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:334` calls `getOrElse` and `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:428` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (11 lines × 2) cli/src/commands/watch.rs:143 — cli/src/commands/watch.rs:143-153 | cli/src/commands/watch.rs:207-217 — both copies are in the same file, so extract the 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 `cli/src/commands/watch.rs:143` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 2) cli/src/commands/cms.rs:275 — cli/src/commands/cms.rs:275-285 | cli/src/commands/environments.rs:333-343 — 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.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×8
  • Duplicated block (10 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1470 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1470-1479 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1611-1620 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1470` 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) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2150 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2150-2159 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2226-2235 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2150` 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) daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:104 — daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:104-113 | daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:151-160 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:104` 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) daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:571 — daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:571-580 | daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:604-613 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:571` 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) daikoku/app/fr/maif/daikoku/services/ApiService.scala:1253 — daikoku/app/fr/maif/daikoku/services/ApiService.scala:1253-1262 | daikoku/app/fr/maif/daikoku/services/ApiService.scala:1320-1329 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/services/ApiService.scala:1253` 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) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:371 — daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:371-380 | daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:406-415 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:371` 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) cli/src/commands/watch.rs:130 — cli/src/commands/watch.rs:130-139 | cli/src/commands/watch.rs:196-205 — both copies are in the same file, so extract the 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 `cli/src/commands/watch.rs:130` 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) cli/src/commands/watch.rs:260 — cli/src/commands/watch.rs:260-269 | cli/src/utils.rs:46-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.
D30 · Dependency Vulnerabilities · Medium vulnerability · ×7
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D31 · IaC & Container Security · Medium IaC · ×7
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D35 · Change Coupling · Change coupling · ×7
  • Change coupling: TeamBilling.tsx ↔ TeamIncome.tsx daikoku/javascript/src/components/backoffice/billing/TeamBilling.tsx:1 — `daikoku/javascript/src/components/backoffice/billing/TeamBilling.tsx` and `daikoku/javascript/src/components/backoffice/billing/TeamIncome.tsx` change together 69% of the time (11 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 11 shared commits counted here, the most recent 3 are `4dd35d7f` Fix some basic issues; `d2d71b01` fix margin; `06907d9c` Everything is compiling but... — run `git show` on any of them.
  • Change coupling: json.scala ↔ SecurityForm.tsx daikoku/app/fr/maif/daikoku/domain/json.scala:1 — `daikoku/app/fr/maif/daikoku/domain/json.scala` and `daikoku/javascript/src/components/adminbackoffice/tenants/forms/SecurityForm.tsx` 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 — 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 `be86324c` FIX #919 - add new teamCreationSecurity to avoid simple users to crea… (at that commit the file was still `daikoku/app/domain/json.scala`); `058a2332` WIP #907 - admin can setup default authorized otoroshi entities for a… (at that commit the file was still `daikoku/app/domain/json.scala`); `030a7dfd` Use part of form step process to add automatically metadata in create… (at that commit the file was still `daikoku/app/domain/json.scala`) — run `git show` on any of them.
  • Change coupling: json.scala ↔ MailForm.tsx daikoku/app/fr/maif/daikoku/domain/json.scala:1 — `daikoku/app/fr/maif/daikoku/domain/json.scala` and `daikoku/javascript/src/components/adminbackoffice/tenants/forms/MailForm.tsx` change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — 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 `d90c02c8` Feat#1261/smtp modern auth (#1270); `c4466d28` fix: #1127 - handle real TLS with smtp; `176ea064` FIX #914 - Add authentication for smtp mailer (at that commit the file was still `daikoku/app/domain/json.scala`) — run `git show` on any of them.
  • Change coupling: TeamApiSubscriptions.tsx ↔ TeamPlanConsumption.tsx daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx:1 — `daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx` and `daikoku/javascript/src/components/backoffice/apis/TeamPlanConsumption.tsx` change together 56% of the time (9 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 `d2e5f6e2` Add consumption page; `06907d9c` Everything is compiling but...; `aaf33e35` add a way to delete a apisub and tests — run `git show` on any of them.
  • Change coupling: REDACTED ↔ AddPanel.tsx REDACTED:1 — `REDACTED` and `daikoku/javascript/src/components/utils/sidebar/panels/AddPanel.tsx` change together 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `9aff89a3` test: add more test front & back; `dadeb6c3` Hide some properties for user or guest; `fc406bde` Add some translations — run `git show` on any of them.
  • Change coupling: AutenticationForm.tsx ↔ MailForm.tsx daikoku/javascript/src/components/adminbackoffice/tenants/forms/AutenticationForm.tsx:1 — `daikoku/javascript/src/components/adminbackoffice/tenants/forms/AutenticationForm.tsx` and `daikoku/javascript/src/components/adminbackoffice/tenants/forms/MailForm.tsx` 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 — 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 6 shared commits counted here, the most recent 3 are `ef08c029` Feat#868/test button for email and ldap config (#878); `e808a4c6` FIX multistep - apipricing form; `7e5d3b42` Almost finish new tenant edit form — run `git show` on any of them.
  • Change coupling: function.tsx ↔ index.ts daikoku/javascript/src/components/utils/function.tsx:1 — `daikoku/javascript/src/components/utils/function.tsx` and `daikoku/javascript/src/services/index.ts` 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 — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `0ec46d09` feat(keyring): frontend keyring-centric views + residual backend fixe…; `c703c5fb` add filter in home page; `e227f54a` FIX #678 — run `git show` on any of them.
D4 · Code Duplication · Edited copy of a member (15 corresponding lines) · ×7
  • Edited copy of a member (15 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogAdminApiController.scala:155 — daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogAdminApiController.scala:155-169 | daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogTokenController.scala:68-82 — 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) daikoku/app/fr/maif/daikoku/domain/userEntities.scala:54 — daikoku/app/fr/maif/daikoku/domain/userEntities.scala:54-68 | daikoku/app/fr/maif/daikoku/domain/userEntities.scala:69-86 — 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) daikoku/app/fr/maif/daikoku/controllers/HomeController.scala:588 — daikoku/app/fr/maif/daikoku/controllers/HomeController.scala:588-602 | daikoku/app/fr/maif/daikoku/controllers/HomeController.scala:605-619 — 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) daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:518 — daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:518-533 | daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:536-550 — 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) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:971 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:971-985 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2711-2728 — 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) daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:100 — daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:100-114 | daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:504-519 — 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) cli/src/commands/cms.rs:349 — cli/src/commands/cms.rs:349-363 | cli/src/commands/environments.rs:109-123 — 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.
X12 · Unreachable branch · Switch arm can never match its case-normalised subject · ×7
  • Switch arm can never match its case-normalised subject daikoku/app/fr/maif/daikoku/login/api.scala:45 — The match subject is `name.toLowerCase()`, so every value reaching these cases has already been lower-cased by `toLowerCase` (line 44). The pattern `"Local"` carries a letter of the opposite case, and a literal pattern compares with `==`, so it cannot equal that subject for ANY input — this case is dead and whatever it was meant to handle silently falls to a later case, or throws `MatchError` when none is left. Match the normalised spelling (`"local"`), or drop the normaliser and compare with `equalsIgnoreCase`.
  • Switch arm can never match its case-normalised subject daikoku/app/fr/maif/daikoku/login/api.scala:47 — The match subject is `name.toLowerCase()`, so every value reaching these cases has already been lower-cased by `toLowerCase` (line 44). The pattern `"Otoroshi"` carries a letter of the opposite case, and a literal pattern compares with `==`, so it cannot equal that subject for ANY input — this case is dead and whatever it was meant to handle silently falls to a later case, or throws `MatchError` when none is left. Match the normalised spelling (`"otoroshi"`), or drop the normaliser and compare with `equalsIgnoreCase`.
  • Switch arm can never match its case-normalised subject daikoku/app/fr/maif/daikoku/login/api.scala:49 — The match subject is `name.toLowerCase()`, so every value reaching these cases has already been lower-cased by `toLowerCase` (line 44). The pattern `"LDAP"` carries a letter of the opposite case, and a literal pattern compares with `==`, so it cannot equal that subject for ANY input — this case is dead and whatever it was meant to handle silently falls to a later case, or throws `MatchError` when none is left. Match the normalised spelling (`"ldap"`), or drop the normaliser and compare with `equalsIgnoreCase`.
  • Switch arm can never match its case-normalised subject daikoku/app/fr/maif/daikoku/login/api.scala:51 — The match subject is `name.toLowerCase()`, so every value reaching these cases has already been lower-cased by `toLowerCase` (line 44). The pattern `"OAuth2"` carries a letter of the opposite case, and a literal pattern compares with `==`, so it cannot equal that subject for ANY input — this case is dead and whatever it was meant to handle silently falls to a later case, or throws `MatchError` when none is left. Match the normalised spelling (`"oauth2"`), or drop the normaliser and compare with `equalsIgnoreCase`.
  • Switch arm can never match its case-normalised subject daikoku/app/fr/maif/daikoku/env/env.scala:98 — The match subject is `name.toLowerCase()`, so every value reaching these cases has already been lower-cased by `toLowerCase` (line 97). The pattern `"Local"` carries a letter of the opposite case, and a literal pattern compares with `==`, so it cannot equal that subject for ANY input — this case is dead and whatever it was meant to handle silently falls to a later case, or throws `MatchError` when none is left. Match the normalised spelling (`"local"`), or drop the normaliser and compare with `equalsIgnoreCase`.
  • Switch arm can never match its case-normalised subject daikoku/app/fr/maif/daikoku/env/env.scala:100 — The match subject is `name.toLowerCase()`, so every value reaching these cases has already been lower-cased by `toLowerCase` (line 97). The pattern `"Header"` carries a letter of the opposite case, and a literal pattern compares with `==`, so it cannot equal that subject for ANY input — this case is dead and whatever it was meant to handle silently falls to a later case, or throws `MatchError` when none is left. Match the normalised spelling (`"header"`), or drop the normaliser and compare with `equalsIgnoreCase`.
  • Switch arm can never match its case-normalised subject daikoku/app/fr/maif/daikoku/env/env.scala:102 — The match subject is `name.toLowerCase()`, so every value reaching these cases has already been lower-cased by `toLowerCase` (line 97). The pattern `"Hostname"` carries a letter of the opposite case, and a literal pattern compares with `==`, so it cannot equal that subject for ANY input — this case is dead and whatever it was meant to handle silently falls to a later case, or throws `MatchError` when none is left. Match the normalised spelling (`"hostname"`), or drop the normaliser and compare with `equalsIgnoreCase`.
X3 · Exception handling · Swallowed exception (empty catch) · ×7
  • Swallowed exception (empty catch) daikoku/public/viewerjs/pdf.js:5864 — 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:1714 — 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:11123 — 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) daikoku/public/viewerjs/ui_utils.js:305 — 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) daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx:46 — 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) daikoku/javascript/scripts/i18n-audit.mjs:243 — 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) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:518 — 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.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.7 · ×6
  • Low contrast colour pair in CSS (3.7:1) docs/assets/css/styles.111e5321.css:1 — `.badge` sets color: #fff on background-color: #fa383e — 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet — editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from).
  • Low contrast colour pair in CSS (3.7:1) docs/assets/css/styles.58620cc5.css:1 — `.badge` sets color: #fff on background-color: #fa383e — 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet — editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from).
  • Low contrast colour pair in CSS (3.7:1) docs/assets/css/styles.8152f05c.css:1 — `.badge` sets color: #fff on background-color: #fa383e — 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet — editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from).
  • Low contrast colour pair in CSS (3.7:1) docs/assets/css/styles.98544a2c.css:1 — `.badge` sets color: #fff on background-color: #fa383e — 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet — editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from).
  • Low contrast colour pair in CSS (3.7:1) docs/assets/css/styles.996bb7bb.css:1 — `.badge` sets color: #fff on background-color: #fa383e — 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet — editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from).
  • Low contrast colour pair in CSS (3.7:1) docs/assets/css/styles.ec4c36b5.css:1 — `.badge` sets color: #fff on background-color: #fa383e — 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet — editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from).
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×6
  • Duplicated block (12 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3028 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3028-3039 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3378-3389 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3028` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:451 — daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:451-462 | daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:507-518 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:451` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 2) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:465 — daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:465-476 | daikoku/app/fr/maif/daikoku/domain/userEntities.scala:113-124 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:465` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 2) daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:1788 — daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:1788-1800 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:2695-2706 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:1788` 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) daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:4742 — daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:4742-4753 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:4766-4777 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:4742` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 2) daikoku/app/fr/maif/daikoku/login/otoroshi.scala:203 — daikoku/app/fr/maif/daikoku/login/otoroshi.scala:203-214 | daikoku/app/fr/maif/daikoku/login/otoroshi.scala:294-305 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/login/otoroshi.scala:203` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×6
  • Duplicated block (9 lines × 2) REDACTED:220 — REDACTED:220-228 | daikoku/app/fr/maif/daikoku/utils/admin.scala:92-100 — 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:220` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1505 — daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1505-1513 | daikoku/app/fr/maif/daikoku/utils/admin.scala:572-580 — 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 `daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1505` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:326 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:326-334 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:515-523 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:326` 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) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:487 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:487-495 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:503-511 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:487` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:213 — daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:213-221 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:169-177 — before extracting anything, compare `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala` and `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:213` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) cli/src/commands/cms.rs:584 — cli/src/commands/cms.rs:584-592 | cli/src/commands/cms.rs:597-605 — both copies are in the same file, so extract the 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 `cli/src/commands/cms.rs:584` 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.
D10 · Test Quality · No assertions · ×5
  • No assertions: Se connecter avec un user sans role et un userRole defini daikoku/javascript/tests/specs-oidc/connection-oidc.spec.ts:37 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: [ASOAPI-10396] - Se connecter en étant membre du groupe AD Managers (maif ==> M_GRG_Gateway_API_Interne) daikoku/javascript/tests/specs/admin_api.spec.ts:31 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: Voir ses notifications daikoku/javascript/tests/specs/gestion_membres.spec.ts:200 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: Daikoku API key should allow to call associated route daikoku/javascript/tests/specs/otoroshi-calls.spec.ts:86 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: Daikoku API key should prevent calling unassociated route daikoku/javascript/tests/specs/otoroshi-calls.spec.ts:99 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
D2 · Cognitive Complexity · daikoku · ×5
  • daikoku::commands::watch::get_matching_routes (cognitive 35) cli/src/commands/watch.rs:497 — daikoku::commands::watch::get_matching_routes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • daikoku::commands::watch::render_page (cognitive 23) cli/src/commands/watch.rs:323 — daikoku::commands::watch::render_page has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • daikoku::commands::watch::watcher (cognitive 22) cli/src/commands/watch.rs:107 — daikoku::commands::watch::watcher has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 3 (11 pts), if/else 6 (10 pts), boolean chains 1 (nesting depth added 12). 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.
  • daikoku::commands::watch::forward_api_call (cognitive 16) cli/src/commands/watch.rs:232 — daikoku::commands::watch::forward_api_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
  • daikoku::models::folder::read_api_folder (cognitive 16) cli/src/models/folder.rs:147 — daikoku::models::folder::read_api_folder has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 1 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D29 · Static Analysis (SAST) · REDACTED · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×5
  • Duplicated block (17 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2170 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2170-2186 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2246-2262 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2170` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (17 lines × 2) daikoku/app/fr/maif/daikoku/controllers/PaymentClient.scala:127 — daikoku/app/fr/maif/daikoku/controllers/PaymentClient.scala:127-143 | daikoku/app/fr/maif/daikoku/controllers/PaymentClient.scala:163-179 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/controllers/PaymentClient.scala:127` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `daikoku/app/fr/maif/daikoku/controllers/PaymentClient.scala:144` calls `obj` and `daikoku/app/fr/maif/daikoku/controllers/PaymentClient.scala:180` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (17 lines × 2) daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:2109 — daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:2109-2125 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:2315-2331 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:2109` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (17 lines × 2) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:121 — daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:121-137 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:187-203 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:121` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (17 lines × 2) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:395 — daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:395-411 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:299-315 — before extracting anything, compare `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala` and `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:395` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (12–13 lines × 2) · ×5
  • Duplicated block (12–13 lines × 2) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:594 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:594-606 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:998-1009 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (12–13 lines × 2) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:609 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:609-620 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1193-1205 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1193` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (12–13 lines × 2) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1087 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1087-1098 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1181-1193 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (12–13 lines × 2) daikoku/app/fr/maif/daikoku/domain/apiEntities.scala:927 — daikoku/app/fr/maif/daikoku/domain/apiEntities.scala:927-938 | daikoku/app/fr/maif/daikoku/domain/apiEntities.scala:967-979 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/domain/apiEntities.scala:927` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12–13 lines × 2) daikoku/app/fr/maif/daikoku/jobs/OtoroshiEntitiesVerifierJob.scala:98 — daikoku/app/fr/maif/daikoku/jobs/OtoroshiEntitiesVerifierJob.scala:98-109 | daikoku/app/fr/maif/daikoku/jobs/OtoroshiEntitiesVerifierJob.scala:131-143 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/jobs/OtoroshiEntitiesVerifierJob.scala:98` 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.
R11 · Import Boundaries · Boundary violation [package · ×5
  • Boundary violation [package:test-cross-package-internals] daikoku/javascript/tests/fixtures/redoc/index.jsx:4 — daikoku/javascript/tests/fixtures/redoc/index.jsx:4 reaches past another workspace package's public entry into its internals with a relative path (../../../src/components/frontend/api/ApiRedoc) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] daikoku/javascript/tests/fixtures/redoc/index.jsx:5 — daikoku/javascript/tests/fixtures/redoc/index.jsx:5 reaches past another workspace package's public entry into its internals with a relative path (../../../src/contexts/globalContext) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] daikoku/javascript/tests/specs/apis.ts:2 — daikoku/javascript/tests/specs/apis.ts:2 reaches past another workspace package's public entry into its internals with a relative path (../../src/types) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] daikoku/javascript/tests/specs/dashboard.spec.ts:3 — daikoku/javascript/tests/specs/dashboard.spec.ts:3 reaches past another workspace package's public entry into its internals with a relative path (../../src/types) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] daikoku/javascript/tests/specs/notifications.ts:2 — daikoku/javascript/tests/specs/notifications.ts:2 reaches past another workspace package's public entry into its internals with a relative path (../../src/types) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
AC2 · Forms & labels · <CodeInput> field component without a label · ×4
  • <CodeInput> field component without a label daikoku/javascript/src/components/adminbackoffice/remotecatalogs/ResourceLoader.tsx:179 — This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) — so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
  • <CodeInput> field component without a label daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx:71 — This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) — so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
  • <CodeInput> field component without a label daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx:85 — This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) — so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
  • <CodeInput> field component without a label daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx:101 — This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) — so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
D3 · God Classes · TooManyMethods · ×4
  • TooManyMethods: ApiController daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:59 — TooManyMethods — 91 methods. The bar is 30 methods; this is 61 over it, 3.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: RemoteCatalogEngine REDACTED:66 — 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: diff_match_patch daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:22 — 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: AdminApiController daikoku/app/fr/maif/daikoku/utils/admin.scala:235 — TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.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.
D30 · Dependency Vulnerabilities · Medium advisory (unmaintained) · ×4
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (13 corresponding lines) · ×4
  • Edited copy of a member (13 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:264 — daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:264-279 | daikoku/app/fr/maif/daikoku/controllers/MockController.scala:23-35 — 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) daikoku/app/fr/maif/daikoku/storage/drivers/postgres/ReactivePg.scala:58 — daikoku/app/fr/maif/daikoku/storage/drivers/postgres/ReactivePg.scala:58-70 | daikoku/app/fr/maif/daikoku/storage/drivers/postgres/ReactivePg.scala:72-84 — 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:50 — REDACTED:50-62 | REDACTED:69-81 — 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) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:314 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:314-330 | daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:905-917 — 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 · Duplicated block (21 lines × 2) · ×4
  • Duplicated block (21 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:60 — daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:60-80 | daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:135-155 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:60` 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 (21 lines × 2) REDACTED:323 — REDACTED:323-343 | REDACTED:367-387 — both copies are in the same file, so extract the 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:323` 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 (21 lines × 2) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:63 — daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:63-83 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:41-61 — before extracting anything, compare `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala` and `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:63` 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 (21 lines × 2) daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:297 — daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:297-317 | daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:324-344 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:297` 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 (15 lines × 2) · ×4
  • Duplicated block (15 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3842 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3842-3856 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3919-3933 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3842` 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 (15 lines × 2) daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogController.scala:79 — daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogController.scala:79-93 | daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogController.scala:112-126 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogController.scala: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 (15 lines × 2) daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:648 — daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:648-662 | daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:664-678 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:648` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (15 lines × 2) daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:226 — daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:226-240 | daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:276-290 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:226` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×4
  • Duplicated block (14 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:175 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:175-188 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:291-304 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:175` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (14 lines × 2) daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:766 — daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:766-779 | daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:791-804 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:766` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (14 lines × 2) REDACTED:254 — REDACTED:254-267 | REDACTED:291-304 — both copies are in the same file, so extract the 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:254` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (14 lines × 2) daikoku/app/fr/maif/daikoku/services/ApiService.scala:673 — daikoku/app/fr/maif/daikoku/services/ApiService.scala:673-686 | daikoku/app/fr/maif/daikoku/services/ApiService.scala:709-722 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/services/ApiService.scala:673` 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 (13 lines × 2) · ×4
  • Duplicated block (13 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3765 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3765-3777 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3799-3811 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3765` 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 before the matched lines, `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3798` calls `getLanguage` and `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3764` 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 (13 lines × 2) daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:305 — daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:305-317 | daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:347-359 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:305` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (13 lines × 2) daikoku/app/fr/maif/daikoku/login/ldap.scala:303 — daikoku/app/fr/maif/daikoku/login/ldap.scala:303-316 | daikoku/app/fr/maif/daikoku/login/ldap.scala:675-687 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/login/ldap.scala:303` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (13 lines × 2) daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:633 — daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:633-645 | daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:664-676 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:633` 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 (8 lines × 2) · ×4
  • Duplicated block (8 lines × 2) daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1088 — daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1088-1095 | daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1640-1647 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1088` 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) daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:415 — daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:415-422 | daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:427-434 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:415` 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) daikoku/app/fr/maif/daikoku/domain/apiEntities.scala:948 — daikoku/app/fr/maif/daikoku/domain/apiEntities.scala:948-955 | daikoku/app/fr/maif/daikoku/domain/apiEntities.scala:991-998 — both copies are in the same file, so extract the 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) cli/src/commands/environments.rs:270 — cli/src/commands/environments.rs:270-277 | cli/src/commands/environments.rs:292-299 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `cli/src/commands/environments.rs:270` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×4
  • Duplicated block (6 lines × 2) daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1186 — daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1186-1191 | daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1243-1248 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1186` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:87 — daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:87-92 | daikoku/app/fr/maif/daikoku/utils/admin.scala:65-70 — 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 `daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:87` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:76 — daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:76-82 | daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:179-184 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:76` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) daikoku/app/fr/maif/daikoku/jobs/OtoroshiSynchronizerJob.scala:358 — daikoku/app/fr/maif/daikoku/jobs/OtoroshiSynchronizerJob.scala:358-363 | daikoku/app/fr/maif/daikoku/services/ApiService.scala:70-75 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/jobs/OtoroshiSynchronizerJob.scala:358` 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.
IC1 · Incompleteness & stubs · Markup wires an event to an empty handler · ×4
  • Markup wires an event to an empty handler daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:389 — `onSuccess` is wired to an arrow whose body is empty — the markup attaches a listener that does nothing. Implement the handler, or remove the attribute that wires it.
  • Markup wires an event to an empty handler daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:490 — `onSuccess` is wired to an arrow whose body is empty — the markup attaches a listener that does nothing. Implement the handler, or remove the attribute that wires it.
  • Markup wires an event to an empty handler daikoku/javascript/src/components/frontend/dashboard/ApiList.tsx:109 — `onClick` is wired to an arrow whose body is empty — the markup attaches a listener that does nothing. Implement the handler, or remove the attribute that wires it.
  • Markup wires an event to an empty handler daikoku/javascript/src/contexts/i18n-context.tsx:202 — `onChange` is wired to an arrow whose body is empty — the markup attaches a listener that does nothing. Implement the handler, or remove the attribute that wires it.
AC3 · Page structure · Page without a main landmark · ×3
  • Page without a main landmark cli/templates/cms/src/pages/404.html:1 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark cli/templates/manager.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark REDACTED:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
D29 · Static Analysis (SAST) · REDACTED · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×3
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:265 — REDACTED:265-321 | REDACTED:335-419 | REDACTED:436-529 | daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:157-208 — 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) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1162 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1162-1193 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1196-1224 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1227-1251 | daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:978-1016 — 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) cli/src/commands/assets.rs:66 — cli/src/commands/assets.rs:66-103 | cli/src/commands/assets.rs:154-199 | cli/src/commands/assets.rs:201-258 | cli/src/helpers.rs:128-150 — 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 (39 corresponding lines) · ×3
  • Edited copy of a member (39 corresponding lines) REDACTED:290 — REDACTED:290-343 | REDACTED:349-387 — 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.
  • Edited copy of a member (39 corresponding lines) daikoku/app/fr/maif/daikoku/domain/apiEntities.scala:926 — daikoku/app/fr/maif/daikoku/domain/apiEntities.scala:926-964 | daikoku/app/fr/maif/daikoku/domain/apiEntities.scala:966-1005 — 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.
  • Edited copy of a member (39 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:150 — daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:150-195 | daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:201-239 — 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 (20 corresponding lines) · ×3
  • Edited copy of a member (20 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:52 — daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:52-75 | daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:235-254 — 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) daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:570 — daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:570-592 | daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:602-621 — 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) REDACTED:1879 — REDACTED:1879-1898 | REDACTED:1964-1987 — 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 (12 corresponding lines) · ×3
  • Edited copy of a member (12 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/KeyringController.scala:131 — daikoku/app/fr/maif/daikoku/controllers/KeyringController.scala:131-147 | daikoku/app/fr/maif/daikoku/controllers/KeyringController.scala:154-165 — 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) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:118 — daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:118-129 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:139-159 — 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) cli/src/commands/cms.rs:334 — cli/src/commands/cms.rs:334-347 | cli/src/commands/environments.rs:96-107 — 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 · Edited copy of a member (9 corresponding lines) · ×3
  • Edited copy of a member (9 corresponding lines) REDACTED:121 — REDACTED:121-129 | REDACTED:174-182 — 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) daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:574 — daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:574-582 | daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:621-638 — 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) cli/src/commands/cms.rs:261 — cli/src/commands/cms.rs:261-269 | cli/src/commands/environments.rs:401-409 — 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 · Duplicated block (22 lines × 2) · ×3
  • Duplicated block (22 lines × 2) daikoku/app/fr/maif/daikoku/audit/audit.scala:937 — daikoku/app/fr/maif/daikoku/audit/audit.scala:937-958 | daikoku/app/fr/maif/daikoku/audit/audit.scala:988-1009 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (22 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:146 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:146-167 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:246-267 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:146` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (22 lines × 2) daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:3848 — daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:3848-3869 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:3958-3979 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:3848` 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 (19 lines × 2) · ×3
  • Duplicated block (19 lines × 2) daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:56 — daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:56-74 | daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:236-254 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:236` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (19 lines × 2) daikoku/app/fr/maif/daikoku/controllers/CmsApiController.scala:225 — daikoku/app/fr/maif/daikoku/controllers/CmsApiController.scala:225-243 | daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:627-645 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (19 lines × 2) daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:208 — daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:208-226 | daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:248-266 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:208` 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 (18 lines × 2) · ×3
  • Duplicated block (18 lines × 2) daikoku/app/fr/maif/daikoku/login/otoroshi.scala:276 — daikoku/app/fr/maif/daikoku/login/otoroshi.scala:276-293 | daikoku/app/fr/maif/daikoku/login/otoroshi.scala:387-404 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/login/otoroshi.scala:276` 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, `daikoku/app/fr/maif/daikoku/login/otoroshi.scala:294` calls `save` and `daikoku/app/fr/maif/daikoku/login/otoroshi.scala:405` 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 (18 lines × 2) daikoku/app/fr/maif/daikoku/services/ApiLifeCycleService.scala:200 — daikoku/app/fr/maif/daikoku/services/ApiLifeCycleService.scala:200-217 | daikoku/app/fr/maif/daikoku/services/ApiLifeCycleService.scala:254-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. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/services/ApiLifeCycleService.scala:200` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (18 lines × 2) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:348 — daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:348-365 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:261-278 — before extracting anything, compare `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala` and `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:348` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (16–17 lines × 2) · ×3
  • Duplicated block (16–17 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3148 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3148-3163 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3220-3236 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3148` 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 (16–17 lines × 2) daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:95 — daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:95-110 | daikoku/app/fr/maif/daikoku/utils/admin.scala:78-94 — 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 `daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:95` 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 (16–17 lines × 2) daikoku/app/fr/maif/daikoku/login/api.scala:407 — daikoku/app/fr/maif/daikoku/login/api.scala:407-422 | daikoku/app/fr/maif/daikoku/login/api.scala:427-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. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/login/api.scala:407` 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 (16 lines × 2) · ×3
  • Duplicated block (16 lines × 2) daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:307 — daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:307-322 | daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:375-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. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:307` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:374` calls `Some` and `daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:306` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (16 lines × 2) daikoku/app/fr/maif/daikoku/env/evolutions.scala:575 — daikoku/app/fr/maif/daikoku/env/evolutions.scala:575-590 | daikoku/app/fr/maif/daikoku/env/evolutions.scala:662-678 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/env/evolutions.scala:575` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (16 lines × 2) daikoku/app/fr/maif/daikoku/env/evolutions.scala:1617 — daikoku/app/fr/maif/daikoku/env/evolutions.scala:1617-1632 | daikoku/app/fr/maif/daikoku/env/evolutions.scala:1633-1648 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/env/evolutions.scala:1617` 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 × 3) · ×3
  • Duplicated block (14 lines × 3) daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1025 — daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1025-1038 | daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1151-1164 | daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1889-1902 — 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 `daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1025` 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, `daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1165` calls `Some` and `daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1903` 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 (14 lines × 3) daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:119 — daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:119-132 | daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:137-150 | daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:155-168 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (14 lines × 3) daikoku/app/fr/maif/daikoku/utils/s3.scala:336 — daikoku/app/fr/maif/daikoku/utils/s3.scala:336-349 | daikoku/app/fr/maif/daikoku/utils/s3.scala:435-448 | daikoku/app/fr/maif/daikoku/utils/s3.scala:476-489 — 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 `daikoku/app/fr/maif/daikoku/utils/s3.scala:336` 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 lines × 3) · ×3
  • Duplicated block (8 lines × 3) REDACTED:186 — REDACTED:186-193 | daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:46-53 | daikoku/app/fr/maif/daikoku/utils/admin.scala:52-59 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (8 lines × 3) daikoku/app/fr/maif/daikoku/controllers/PaymentClient.scala:107 — daikoku/app/fr/maif/daikoku/controllers/PaymentClient.scala:107-114 | daikoku/app/fr/maif/daikoku/controllers/PaymentClient.scala:126-134 | daikoku/app/fr/maif/daikoku/controllers/PaymentClient.scala:163-170 — 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 `daikoku/app/fr/maif/daikoku/controllers/PaymentClient.scala:107` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 3) cli/src/commands/assets.rs:85 — cli/src/commands/assets.rs:85-92 | cli/src/commands/assets.rs:175-182 | cli/src/commands/assets.rs:220-227 — 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 `cli/src/commands/assets.rs:85` 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 × 2) · ×3
  • Duplicated block (7 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:114 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:114-120 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:212-218 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:114` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:312 — daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:312-318 | daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:395-402 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:312` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:354 — daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:354-360 | daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:418-425 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:354` 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 (5 lines × 2) · ×3
  • Duplicated block (5 lines × 2) daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1934 — daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1934-1938 | daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1949-1953 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1934` 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 (5 lines × 2) REDACTED:555 — REDACTED:555-559 | REDACTED:605-609 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:895 — daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:895-899 | daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:1238-1242 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:895` 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.
R10 · Code Duplication · Duplicated block (25 lines × 2 locations) · ×3
  • Duplicated block (25 lines × 2 locations) daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:455 — daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:455 · REDACTED:239 — 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 (25 lines × 2 locations) daikoku/javascript/src/components/backoffice/apis/TeamApiSwagger.tsx:42 — daikoku/javascript/src/components/backoffice/apis/TeamApiSwagger.tsx:42 · daikoku/javascript/src/components/backoffice/apis/TeamApiSwagger.tsx:81 — all 2 copies are in the same file, 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 (25 lines × 2 locations) REDACTED:31032 — REDACTED:31032 · REDACTED:31322 — all 2 copies are in the same file, 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 (23 lines × 2 locations) · ×3
  • Duplicated block (23 lines × 2 locations) daikoku/public/viewerjs/pdf.js:620 — daikoku/public/viewerjs/pdf.js:620 · REDACTED:620 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (23 lines × 2 locations) daikoku/public/viewerjs/pdf.js:4156 — daikoku/public/viewerjs/pdf.js:4156 · daikoku/public/viewerjs/pdf.js:7820 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (23 lines × 2 locations) REDACTED:10264 — REDACTED:10264 · REDACTED:10372 — all 2 copies are in the same file, 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.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×3
  • Swallowed exception (caught, then discarded) daikoku/app/fr/maif/daikoku/utils/s3.scala:523 — `case _: Exception` 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) daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:1303 — `case _: Throwable` 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) daikoku/app/fr/maif/daikoku/domain/JsonNodeValueResolver.java:35 — `catch (Exception)` 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.
AC2 · Forms & labels · <BooleanInput> field component without a label · ×2
  • <BooleanInput> field component without a label daikoku/javascript/src/components/adminbackoffice/anonymousreporting/AnonymousReporting.tsx:44 — This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) — so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
  • <BooleanInput> field component without a label daikoku/javascript/src/components/adminbackoffice/importexport/ImportExport.tsx:63 — This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) — so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
AC2 · Forms & labels · <Select> field component without a label · ×2
  • <Select> field component without a label daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:158 — This UI-library field component is named only by a placeholder — a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
  • <Select> field component without a label daikoku/javascript/src/components/adminbackoffice/tenants/TenantAdminList.tsx:134 — This UI-library field component is named only by a placeholder — a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
AC4 · Keyboard semantics · Anchor without href · ×2
  • Anchor without href daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:215 — 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:68 — 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.
D15 · Churn × Complexity Hotspots · Repeated repair · ×2
  • Repeated repair: daikoku/javascript/src/components/backoffice/apikeys/TeamApiKeysForApi.tsx daikoku/javascript/src/components/backoffice/apikeys/TeamApiKeysForApi.tsx:52 — daikoku/javascript/src/components/backoffice/apikeys/TeamApiKeysForApi.tsx changed 20 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 11 (its worst body is TeamApiKeysForApi.TeamApiKeysForApi at line 52), 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 #1282 - keyring now display pending subscription in subscriptions list”; “fix: error from merge”; “fix:retours”; “fix:retours P|useMutation for enabled validation”. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/javascript/src/components/backoffice/apikeys/TeamApiKeysForApi.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: daikoku/javascript/src/components/frontend/api/ApiSubscriptions.tsx daikoku/javascript/src/components/frontend/api/ApiSubscriptions.tsx:16 — daikoku/javascript/src/components/frontend/api/ApiSubscriptions.tsx changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 3 (its worst body is ApiSubscriptions.ApiSubscriptions at line 16), 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 #1282 - keyring now display pending subscription in subscriptions list”; “fix: retours PR”; “fix: ajustements PR”; “fix: redirect to correct apikey view after new subscription”. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 15:53:12 +00:00' --until='2026-11-12 15:53:12 +00:00' --full-history --no-merges -- daikoku/javascript/src/components/frontend/api/ApiSubscriptions.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D4 · Code Duplication · Edited copy of a member (33 corresponding lines) · ×2
  • Edited copy of a member (33 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:183 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:183-220 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:226-260 — These two members are one piece of code written twice and then edited apart: 33 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 (33 corresponding lines) daikoku/app/fr/maif/daikoku/utils/jwt.scala:170 — daikoku/app/fr/maif/daikoku/utils/jwt.scala:170-202 | daikoku/app/fr/maif/daikoku/utils/jwt.scala:268-300 — These two members are one piece of code written twice and then edited apart: 33 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 (43 corresponding lines) · ×2
  • Edited copy of a member (43 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1071 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1071-1114 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1117-1159 — 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) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2045 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2045-2087 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2090-2135 — 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) daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:69 — daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:69-96 | daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:172-201 — 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) daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:295 — daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:295-322 | daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:362-390 — 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 (18 corresponding lines) · ×2
  • Edited copy of a member (18 corresponding lines) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:211 — daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:211-228 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:167-184 — 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) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:518 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:518-537 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:683-700 — 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 copy of a member (21 corresponding lines) · ×2
  • Edited copy of a member (21 corresponding lines) cli/src/commands/cms.rs:186 — cli/src/commands/cms.rs:186-206 | cli/src/commands/environments.rs:208-228 — 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) cli/src/commands/environments.rs:269 — cli/src/commands/environments.rs:269-289 | cli/src/commands/environments.rs:291-311 — 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 (27 corresponding lines) · ×2
  • Edited copy of a member (27 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3792 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3792-3828 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3836-3862 — 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.
  • Edited copy of a member (27 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:507 — daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:507-535 | daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1665-1691 — 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 copies of one member (3 members, 22+ corresponding lines) · ×2
  • Edited copies of one member (3 members, 22+ corresponding lines) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:57 — daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:57-83 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:34-61 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceHttp.scala:83-104 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 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, 22+ corresponding lines) daikoku/app/fr/maif/daikoku/utils/s3.scala:323 — daikoku/app/fr/maif/daikoku/utils/s3.scala:323-349 | daikoku/app/fr/maif/daikoku/utils/s3.scala:424-448 | daikoku/app/fr/maif/daikoku/utils/s3.scala:468-489 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 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 (23 corresponding lines) · ×2
  • Edited copy of a member (23 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:148 — daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:148-173 | daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:176-198 — These two members are one piece of code written twice and then edited apart: 23 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 (23 corresponding lines) daikoku/app/fr/maif/daikoku/env/evolutions.scala:575 — daikoku/app/fr/maif/daikoku/env/evolutions.scala:575-597 | daikoku/app/fr/maif/daikoku/env/evolutions.scala:661-696 — These two members are one piece of code written twice and then edited apart: 23 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) · ×2
  • Edited copy of a member (16 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogController.scala:135 — daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogController.scala:135-150 | daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogController.scala:153-168 — 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.
  • Edited copy of a member (16 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:325 — daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:325-340 | daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:343-359 — 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 · Duplicated block (21–22 lines × 2) · ×2
  • Duplicated block (21–22 lines × 2) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:298 — daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:298-318 | daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:393-414 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:298` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (21–22 lines × 2) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:362 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:362-382 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:451-472 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:362` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (20 lines × 2) · ×2
  • Duplicated block (20 lines × 2) daikoku/app/fr/maif/daikoku/controllers/MockController.scala:155 — daikoku/app/fr/maif/daikoku/controllers/MockController.scala:155-174 | daikoku/app/fr/maif/daikoku/controllers/MockController.scala:197-216 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/MockController.scala:155` 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 (20 lines × 2) daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:3006 — daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:3006-3025 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:3053-3072 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:3006` 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 (18–19 lines × 2) · ×2
  • Duplicated block (18–19 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:125 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:125-142 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:223-241 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:125` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (18–19 lines × 2) daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:930 — daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:930-947 | daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:956-974 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:930` 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 (15–19 lines × 2) · ×2
  • Duplicated block (15–19 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:75 — daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:75-93 | daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:237-251 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:75` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (15–19 lines × 2) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:318 — daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:318-332 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:229-247 — before extracting anything, compare `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala` and `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:318` 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 (15–16 lines × 2) · ×2
  • Duplicated block (15–16 lines × 2) daikoku/app/fr/maif/daikoku/services/ApiService.scala:407 — daikoku/app/fr/maif/daikoku/services/ApiService.scala:407-422 | daikoku/app/fr/maif/daikoku/services/ApiService.scala:478-492 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/services/ApiService.scala:478` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (15–16 lines × 2) daikoku/app/fr/maif/daikoku/services/UsagePlanService.scala:346 — daikoku/app/fr/maif/daikoku/services/UsagePlanService.scala:346-360 | daikoku/app/fr/maif/daikoku/services/UsagePlanService.scala:373-388 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/services/UsagePlanService.scala:346` 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 (13–15 lines × 2) · ×2
  • Duplicated block (13–15 lines × 2) daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:159 — daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:159-173 | daikoku/app/fr/maif/daikoku/services/AssetsService.scala:224-236 — before extracting anything, compare `daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala` and `daikoku/app/fr/maif/daikoku/services/AssetsService.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 73 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:159` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (13–15 lines × 2) daikoku/app/fr/maif/daikoku/login/otoroshi.scala:260 — daikoku/app/fr/maif/daikoku/login/otoroshi.scala:260-274 | daikoku/app/fr/maif/daikoku/login/otoroshi.scala:360-372 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/login/otoroshi.scala:260` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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 (13–14 lines × 2) · ×2
  • Duplicated block (13–14 lines × 2) REDACTED:404 — REDACTED:404-417 | REDACTED:761-773 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (13–14 lines × 2) daikoku/app/fr/maif/daikoku/storage/drivers/postgres/ReactivePg.scala:230 — daikoku/app/fr/maif/daikoku/storage/drivers/postgres/ReactivePg.scala:230-243 | daikoku/app/fr/maif/daikoku/storage/drivers/postgres/ReactivePg.scala:290-302 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/storage/drivers/postgres/ReactivePg.scala:290` 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 (13 lines × 4) · ×2
  • Duplicated block (13 lines × 4) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1169 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1169-1181 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1202-1214 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1233-1245 | daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:979-991 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1169` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (13 lines × 4) daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:282 — daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:282-294 | daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:389-401 | daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:412-424 | daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:435-447 — 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 `daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:282` 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) · ×2
  • Duplicated block (12 lines × 3) daikoku/app/fr/maif/daikoku/login/api.scala:392 — daikoku/app/fr/maif/daikoku/login/api.scala:392-403 | daikoku/app/fr/maif/daikoku/login/api.scala:409-422 | daikoku/app/fr/maif/daikoku/login/api.scala:428-443 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (12 lines × 3) daikoku/app/fr/maif/daikoku/login/otoroshi.scala:182 — daikoku/app/fr/maif/daikoku/login/otoroshi.scala:182-196 | daikoku/app/fr/maif/daikoku/login/otoroshi.scala:260-274 | daikoku/app/fr/maif/daikoku/login/otoroshi.scala:360-371 — 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 `daikoku/app/fr/maif/daikoku/login/otoroshi.scala:182` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (11–12 lines × 2) · ×2
  • Duplicated block (11–12 lines × 2) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:84 — daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:84-95 | daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:574-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. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:84` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11–12 lines × 2) daikoku/app/fr/maif/daikoku/jobs/AbstractJob.scala:128 — daikoku/app/fr/maif/daikoku/jobs/AbstractJob.scala:128-139 | daikoku/app/fr/maif/daikoku/jobs/KeyringSubscriptionExpirationJob.scala:44-54 — 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 `daikoku/app/fr/maif/daikoku/jobs/AbstractJob.scala:128` 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 (8–9 lines × 2) · ×2
  • Duplicated block (8–9 lines × 2) daikoku/app/fr/maif/daikoku/controllers/GraphQLController.scala:83 — daikoku/app/fr/maif/daikoku/controllers/GraphQLController.scala:83-90 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:285-293 — 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 `daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:285` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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 (8–9 lines × 2) daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:4733 — daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:4733-4740 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:4756-4764 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:4733` 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 (7 lines × 4) · ×2
  • Duplicated block (7 lines × 4) REDACTED:266 — REDACTED:266-272 | REDACTED:336-342 | REDACTED:437-443 | daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:159-165 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:266` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 4) cli/src/commands/assets.rs:84 — cli/src/commands/assets.rs:84-90 | cli/src/commands/assets.rs:174-180 | cli/src/commands/assets.rs:219-225 | cli/src/helpers.rs:133-139 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `cli/src/commands/assets.rs:84` 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 (35 lines × 2 locations) · ×2
  • Duplicated block (35 lines × 2 locations) daikoku/javascript/src/apps/DaikokuHomeApp.tsx:156 — daikoku/javascript/src/apps/DaikokuHomeApp.tsx:156 · daikoku/javascript/src/components/frontend/account/signup.tsx:21 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases.
  • Duplicated block (35 lines × 2 locations) REDACTED:366 — REDACTED:366 · REDACTED:394 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Duplicated block (34 lines × 2 locations) · ×2
  • Duplicated block (34 lines × 2 locations) REDACTED:669 — REDACTED:669 · daikoku/javascript/src/components/frontend/api/ApiRedoc.tsx:173 — 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 (34 lines × 2 locations) REDACTED:36091 — REDACTED:36091 · REDACTED:36131 — all 2 copies are in the same file, 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 (26 lines × 2 locations) · ×2
  • Duplicated block (26 lines × 2 locations) daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:80 — daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:80 · daikoku/javascript/src/components/adminbackoffice/tenants/forms/SecurityForm.tsx:268 — 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 (26 lines × 2 locations) REDACTED:8645 — REDACTED:8645 · REDACTED:9091 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (21 lines × 2 locations) · ×2
  • Duplicated block (21 lines × 2 locations) daikoku/javascript/src/components/frontend/api/ApiSubscriptions.tsx:45 — daikoku/javascript/src/components/frontend/api/ApiSubscriptions.tsx:45 · daikoku/javascript/src/components/frontend/api/ApiTest.tsx:250 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
  • Duplicated block (21 lines × 2 locations) REDACTED:19447 — REDACTED:19447 · REDACTED:31321 — all 2 copies are in the same file, 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.
AC1 · Text alternatives · <video> without a captions track · ×1
  • <video> without a captions track REDACTED:438 — Video with no captions <track> offers no captions. This player's source is set at runtime, so there is no caption file to author here: give the player a way to carry captions — accept a track/captions URL alongside the media and render a <track kind="captions"> when one is supplied — and capture that asset wherever the media enters the product (upload, import or generation).
AC1 · Text alternatives · <object> without a text alternative · ×1
  • <object> without a text alternative REDACTED:443 — A <object> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
AC1 · Text alternatives · <canvas> without a text alternative · ×1
  • <canvas> without a text alternative daikoku/public/viewerjs/pdf.js:3345 — 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.
AC3 · Page structure · Heading level jumps from h4 to h6 · ×1
  • Heading level jumps from h4 to h6 daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:925 — Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
AC3 · Page structure · Heading level jumps from h1 to h3 · ×1
  • Heading level jumps from h1 to h3 daikoku/javascript/src/components/backoffice/billing/TeamIncome.tsx:174 — Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.0 · ×1
  • Low contrast colour pair in CSS (3.0:1) daikoku/javascript/src/style/components/form.scss:13 — `.form-control:disabled, .form-control[readonly]` sets color: #e2e2e2 on background-color: grey — 3.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.4 · ×1
  • Low contrast colour pair in CSS (3.4:1) daikoku/javascript/src/components/utils/dnd/components/TreeItem.module.scss:79 — `.Count` sets color: #fff on background-color: #2389ff — 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AX2 · Stateful singletons · Stateful singleton · ×1
  • Stateful singleton: MockController daikoku/app/fr/maif/daikoku/controllers/MockController.scala:15 — `MockController` is one shared instance (Play controller: every request runs on it, concurrently, on the server's thread pool) but writes its own state outside any lock (apikeys; e.g. `apikeys` in `createFakeOtoroshiApiKey` at line 131). Two requests that interleave lose an update, and a mutable collection written concurrently can corrupt.
D1 · Cyclomatic Complexity · ApiPricing.ApiPricing (cyclomatic 104) · ×1
  • ApiPricing.ApiPricing (cyclomatic 104) REDACTED:913 — ApiPricing.ApiPricing has cyclomatic complexity 104 (threshold 15). Most of this is not in the body itself: 3 of the 104 points are its own statements and the rest belongs to 46 function items inside it that branch (a function literal at line 1895, a function literal at line 1302, isPlanSelectable, …). 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 · SchemaDefinition.getSchema (cyclomatic 73) · ×1
  • SchemaDefinition.getSchema (cyclomatic 73) daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:147 — SchemaDefinition.getSchema has cyclomatic complexity 73 (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 · DynamicTable.DynamicTable (cyclomatic 67) · ×1
  • DynamicTable.DynamicTable (cyclomatic 67) daikoku/javascript/src/components/inputs/DynamicTable.tsx:238 — DynamicTable.DynamicTable has cyclomatic complexity 67 (threshold 15). Of this number, 16 points are the body's own statements and 51 belong to 22 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · KeyringCard.KeyringCard (cyclomatic 60) · ×1
  • KeyringCard.KeyringCard (cyclomatic 60) REDACTED:207 — KeyringCard.KeyringCard has cyclomatic complexity 60 (threshold 15). Of this number, 18 points are the body's own statements and 42 belong to 21 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · ApiService.runSubscriptionProcess (cyclomatic 50) · ×1
  • ApiService.runSubscriptionProcess (cyclomatic 50) daikoku/app/fr/maif/daikoku/services/ApiService.scala:1348 — ApiService.runSubscriptionProcess has cyclomatic complexity 50 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · ApiHome.ApiHome (cyclomatic 50) · ×1
  • ApiHome.ApiHome (cyclomatic 50) daikoku/javascript/src/components/frontend/api/ApiHome.tsx:18 — ApiHome.ApiHome has cyclomatic complexity 50 (threshold 15). Of this number, 38 points are the body's own statements and 12 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · OtoroshiIdentityFilter.apply (cyclomatic 48) · ×1
  • OtoroshiIdentityFilter.apply (cyclomatic 48) daikoku/app/fr/maif/daikoku/login/otoroshi.scala:79 — OtoroshiIdentityFilter.apply has cyclomatic complexity 48 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · TeamMembers.TeamMembersSimpleComponent (cyclomatic 41) · ×1
  • TeamMembers.TeamMembersSimpleComponent (cyclomatic 41) daikoku/javascript/src/components/backoffice/members/TeamMembers.tsx:45 — TeamMembers.TeamMembersSimpleComponent has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 14 of the 41 points are its own statements and the rest belongs to 16 function items inside it that branch (togglePermission, a function literal at line 259, removeMember, …). 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 · ApiService._createOrExtendApiKey (cyclomatic 37) · ×1
  • ApiService._createOrExtendApiKey (cyclomatic 37) daikoku/app/fr/maif/daikoku/services/ApiService.scala:1752 — ApiService._createOrExtendApiKey has cyclomatic complexity 37 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · TeamApiSubscriptions.TeamApiSubscriptions (cyclomatic 36) · ×1
  • TeamApiSubscriptions.TeamApiSubscriptions (cyclomatic 36) daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx:75 — TeamApiSubscriptions.TeamApiSubscriptions has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 4 of the 36 points are its own statements and the rest belongs to 15 function items inside it that branch (a function literal at line 171, a function literal at line 209, a function literal at line 325, …). 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 · OAuth2Support.bindUser (cyclomatic 33) · ×1
  • OAuth2Support.bindUser (cyclomatic 33) daikoku/app/fr/maif/daikoku/login/oauth.scala:244 — OAuth2Support.bindUser has cyclomatic complexity 33 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · SortableTree.SortableTree (cyclomatic 33) · ×1
  • SortableTree.SortableTree (cyclomatic 33) daikoku/javascript/src/components/utils/dnd/SortableTree.tsx:85 — SortableTree.SortableTree has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 7 of the 33 points are its own statements and the rest belongs to 7 function items inside it that branch (getMovementAnnouncement, a function literal at line 210, a function literal at line 126, …). 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 · navContext.useApiFrontOffice (cyclomatic 32) · ×1
  • navContext.useApiFrontOffice (cyclomatic 32) daikoku/javascript/src/contexts/navContext.tsx:67 — navContext.useApiFrontOffice has cyclomatic complexity 32 (threshold 15). Of this number, 17 points are the body's own statements and 15 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · NotificationController.rejectNotificationOfTeam (cyclomatic 31) · ×1
  • NotificationController.rejectNotificationOfTeam (cyclomatic 31) daikoku/app/fr/maif/daikoku/controllers/NotificationController.scala:248 — NotificationController.rejectNotificationOfTeam has cyclomatic complexity 31 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · diff_match_patch.diff_cleanupMerge (cyclomatic 31) · ×1
  • diff_match_patch.diff_cleanupMerge (cyclomatic 31) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:1133 — diff_match_patch.diff_cleanupMerge 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 · TeamBilling.TeamBilling (cyclomatic 31) · ×1
  • TeamBilling.TeamBilling (cyclomatic 31) daikoku/javascript/src/components/backoffice/billing/TeamBilling.tsx:28 — TeamBilling.TeamBilling has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 7 of the 31 points are its own statements and the rest belongs to 6 function items inside it that branch (drawApis, drawApiConsumption, BillingCartridge, …). 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 · SubscriptionMetadataModal.SubscriptionMetadataModal (cyclomatic 29) · ×1
  • SubscriptionMetadataModal.SubscriptionMetadataModal (cyclomatic 29) daikoku/javascript/src/contexts/modals/SubscriptionMetadataModal.tsx:33 — SubscriptionMetadataModal.SubscriptionMetadataModal has cyclomatic complexity 29 (threshold 15). Of this number, 23 points are the body's own statements and 6 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · RemoteCatalogsForm.RemoteCatalogsForm (cyclomatic 29) · ×1
  • RemoteCatalogsForm.RemoteCatalogsForm (cyclomatic 29) daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:355 — RemoteCatalogsForm.RemoteCatalogsForm has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 7 of the 29 points are its own statements and the rest belongs to 18 function items inside it that branch (sourceKinds, warningFor, catalogSchema, …). 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 · CmsPage.render (cyclomatic 28) · ×1
  • CmsPage.render (cyclomatic 28) daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:1103 — CmsPage.render 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 · diff_match_patch.diff_bisect (cyclomatic 28) · ×1
  • diff_match_patch.diff_bisect (cyclomatic 28) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:338 — diff_match_patch.diff_bisect 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 · keyboardCoordinates.sortableTreeKeyboardCoordinates.<returned closure> (cyclomatic 28) · ×1
  • keyboardCoordinates.sortableTreeKeyboardCoordinates.<returned closure> (cyclomatic 28) daikoku/javascript/src/components/utils/dnd/keyboardCoordinates.ts:27 — keyboardCoordinates.sortableTreeKeyboardCoordinates.<returned closure> has cyclomatic complexity 28 (threshold 15). Of this number, 21 points are the body's own statements and 7 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LoginFilter.apply (cyclomatic 27) · ×1
  • LoginFilter.apply (cyclomatic 27) daikoku/app/fr/maif/daikoku/login/api.scala:338 — LoginFilter.apply has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · ApiList.ApiList (cyclomatic 27) · ×1
  • ApiList.ApiList (cyclomatic 27) daikoku/javascript/src/components/frontend/dashboard/ApiList.tsx:27 — ApiList.ApiList has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 5 of the 27 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 181, 79, 129, …). 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 · DaikokuEnv.initDatastore (cyclomatic 26) · ×1
  • DaikokuEnv.initDatastore (cyclomatic 26) daikoku/app/fr/maif/daikoku/env/env.scala:797 — DaikokuEnv.initDatastore has cyclomatic complexity 26 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · diff_match_patch.diff_cleanupSemantic (cyclomatic 26) · ×1
  • diff_match_patch.diff_cleanupSemantic (cyclomatic 26) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:736 — diff_match_patch.diff_cleanupSemantic 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 · TeamList.OtoroshiEntitiesSelector (cyclomatic 26) · ×1
  • TeamList.OtoroshiEntitiesSelector (cyclomatic 26) daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:351 — TeamList.OtoroshiEntitiesSelector has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 5 of the 26 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 423, a function literal at line 367, a function literal at line 385, …). 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 · AnonymousReportingJob.getData (cyclomatic 25) · ×1
  • AnonymousReportingJob.getData (cyclomatic 25) daikoku/app/fr/maif/daikoku/jobs/AnonymousReportingJob.scala:83 — AnonymousReportingJob.getData has cyclomatic complexity 25 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · diff_match_patch.diff_cleanupEfficiency (cyclomatic 25) · ×1
  • diff_match_patch.diff_cleanupEfficiency (cyclomatic 25) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:1025 — diff_match_patch.diff_cleanupEfficiency has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SideBar.TopBar (cyclomatic 25) · ×1
  • SideBar.TopBar (cyclomatic 25) daikoku/javascript/src/components/utils/sidebar/SideBar.tsx:77 — SideBar.TopBar has cyclomatic complexity 25 (threshold 15). Of this number, 20 points are the body's own statements and 5 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · TeamSelectionModal.TeamSelectorModal (cyclomatic 25) · ×1
  • TeamSelectionModal.TeamSelectorModal (cyclomatic 25) daikoku/javascript/src/contexts/modals/TeamSelectionModal.tsx:10 — TeamSelectionModal.TeamSelectorModal has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 6 of the 25 points are its own statements and the rest belongs to 7 function items inside it that branch (getButton, doTeamAction, a function literal at line 120, …). 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 · ApiController.updateIssue (cyclomatic 24) · ×1
  • ApiController.updateIssue (cyclomatic 24) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3252 — ApiController.updateIssue has cyclomatic complexity 24 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · OtoroshiSynchronizerJob.synchronizeApikeys (cyclomatic 24) · ×1
  • OtoroshiSynchronizerJob.synchronizeApikeys (cyclomatic 24) daikoku/app/fr/maif/daikoku/jobs/OtoroshiSynchronizerJob.scala:627 — OtoroshiSynchronizerJob.synchronizeApikeys has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · ApiService.subscribeToApi (cyclomatic 24) · ×1
  • ApiService.subscribeToApi (cyclomatic 24) daikoku/app/fr/maif/daikoku/services/ApiService.scala:225 — ApiService.subscribeToApi has cyclomatic complexity 24 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · ApiHeader.ApiHeader (cyclomatic 24) · ×1
  • ApiHeader.ApiHeader (cyclomatic 24) REDACTED:28 — ApiHeader.ApiHeader has cyclomatic complexity 24 (threshold 15). Of this number, 12 points are the body's own statements and 12 belong to 9 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · ApiPricing.OtoroshiEntitiesSelector (cyclomatic 24) · ×1
  • ApiPricing.OtoroshiEntitiesSelector (cyclomatic 24) REDACTED:104 — ApiPricing.OtoroshiEntitiesSelector has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 5 of the 24 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 183, a function literal at line 118, a function literal at line 136, …). 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 · SearchPanel.Search (cyclomatic 24) · ×1
  • SearchPanel.Search (cyclomatic 24) daikoku/javascript/src/components/utils/sidebar/panels/SearchPanel.tsx:26 — SearchPanel.Search has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 4 of the 24 points are its own statements and the rest belongs to 4 function items inside it that branch (handleChangeSelected, handleSelect, a function literal at line 141, …). 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 · SubscriptionProcessEditor.SubscriptionProcessEditor (cyclomatic 23) · ×1
  • SubscriptionProcessEditor.SubscriptionProcessEditor (cyclomatic 23) daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx:272 — SubscriptionProcessEditor.SubscriptionProcessEditor has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 8 of the 23 points are its own statements and the rest belongs to 8 function items inside it that branch (editProcess, a function literal at line 601, deleteStep, …). 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 · NotificationList.NotificationList · ×1
  • NotificationList.NotificationList::actionFormatter (cyclomatic 23) daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:259 — NotificationList.NotificationList::actionFormatter 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. This is NOT this file's highest cyclomatic complexity: NotificationList.NotificationList::notificationFormatter (cyclomatic 25) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · ApiTimelineIssue.ApiTimelineIssue (cyclomatic 23) · ×1
  • ApiTimelineIssue.ApiTimelineIssue (cyclomatic 23) REDACTED:51 — ApiTimelineIssue.ApiTimelineIssue has cyclomatic complexity 23 (threshold 15). Of this number, 14 points are the body's own statements and 9 belong to 8 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · messages.AdminMessages (cyclomatic 23) · ×1
  • messages.AdminMessages (cyclomatic 23) daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:35 — messages.AdminMessages has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 5 of the 23 points are its own statements and the rest belongs to 9 function items inside it that branch (sendMessage, a function literal at line 200, maybeReadMessage, …). 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 · ApiKeyStatsJob.syncConsumptionStatsForSubscription (cyclomatic 22) · ×1
  • ApiKeyStatsJob.syncConsumptionStatsForSubscription (cyclomatic 22) REDACTED:188 — ApiKeyStatsJob.syncConsumptionStatsForSubscription has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · LdapSupport._bindUser (cyclomatic 22) · ×1
  • LdapSupport._bindUser (cyclomatic 22) daikoku/app/fr/maif/daikoku/login/ldap.scala:270 — LdapSupport._bindUser has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · ApiService.checkAndExtractTransferLink (cyclomatic 22) · ×1
  • ApiService.checkAndExtractTransferLink (cyclomatic 22) daikoku/app/fr/maif/daikoku/services/ApiService.scala:2218 — ApiService.checkAndExtractTransferLink has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · AssetsList.AssetsList (cyclomatic 22) · ×1
  • AssetsList.AssetsList (cyclomatic 22) daikoku/javascript/src/components/backoffice/assets/AssetsList.tsx:147 — AssetsList.AssetsList has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to 13 function items inside it that branch (a function literal at line 238, addAsset, a function literal at line 269, …). 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 · TenantHelper.withTenant (cyclomatic 21) · ×1
  • TenantHelper.withTenant (cyclomatic 21) daikoku/app/fr/maif/daikoku/login/api.scala:112 — TenantHelper.withTenant has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: LoginFilter.handleWhitelistedRoute (cyclomatic 23) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · ApiPricing.CustomMetadataInput (cyclomatic 21) · ×1
  • ApiPricing.CustomMetadataInput (cyclomatic 21) REDACTED:344 — ApiPricing.CustomMetadataInput has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 8 function items inside it that branch (addFirst, changeKey, addNext, …). 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 · ApiDocumentation.ApiDocumentation (cyclomatic 21) · ×1
  • ApiDocumentation.ApiDocumentation (cyclomatic 21) REDACTED:143 — ApiDocumentation.ApiDocumentation has cyclomatic complexity 21 (threshold 15). Of this number, 11 points are the body's own statements and 10 belong to 9 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · TenantEdit.TenantEditComponent (cyclomatic 21) · ×1
  • TenantEdit.TenantEditComponent (cyclomatic 21) daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx:32 — TenantEdit.TenantEditComponent has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · ApiController.getVisiblePlans (cyclomatic 20) · ×1
  • ApiController.getVisiblePlans (cyclomatic 20) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:604 — ApiController.getVisiblePlans has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · ApiController.createIssue (cyclomatic 20) · ×1
  • ApiController.createIssue (cyclomatic 20) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3079 — ApiController.createIssue has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · CommonServices.getApisByIds (cyclomatic 20) · ×1
  • CommonServices.getApisByIds (cyclomatic 20) daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:22 — CommonServices.getApisByIds 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 · diff_match_patch.patch_splitMax (cyclomatic 20) · ×1
  • diff_match_patch.patch_splitMax (cyclomatic 20) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:1962 — diff_match_patch.patch_splitMax 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 · FeedbackButton.FeedbackButton (cyclomatic 20) · ×1
  • FeedbackButton.FeedbackButton (cyclomatic 20) daikoku/javascript/src/components/utils/FeedbackButton.tsx:21 — FeedbackButton.FeedbackButton has cyclomatic complexity 20 (threshold 15). Of this number, 10 points are the body's own statements and 10 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · TeamApis.TeamApis (cyclomatic 20) · ×1
  • TeamApis.TeamApis (cyclomatic 20) daikoku/javascript/src/components/backoffice/apis/TeamApis.tsx:16 — TeamApis.TeamApis has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 58, 24, 37, …). 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 · ApiController.planSwagger (cyclomatic 19) · ×1
  • ApiController.planSwagger (cyclomatic 19) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:197 — ApiController.planSwagger has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · ApiController.getApi (cyclomatic 19) · ×1
  • ApiController.getApi (cyclomatic 19) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:440 — ApiController.getApi has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · Yaml.convert (cyclomatic 19) · ×1
  • Yaml.convert (cyclomatic 19) daikoku/app/fr/maif/daikoku/utils/Yaml.scala:26 — Yaml.convert has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · FileChecker.isWellSigned (cyclomatic 19) · ×1
  • FileChecker.isWellSigned (cyclomatic 19) daikoku/app/fr/maif/daikoku/utils/FileChecker.java:8 — FileChecker.isWellSigned has cyclomatic complexity 19 (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 · diff_match_patch.diff_cleanupSemanticScore (cyclomatic 19) · ×1
  • diff_match_patch.diff_cleanupSemanticScore (cyclomatic 19) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:972 — diff_match_patch.diff_cleanupSemanticScore has cyclomatic complexity 19 (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 · globalContext.GlobalContextProvider (cyclomatic 19) · ×1
  • globalContext.GlobalContextProvider (cyclomatic 19) daikoku/javascript/src/contexts/globalContext.tsx:86 — globalContext.GlobalContextProvider has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 108, getExpertMode, getTheme, …). 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 · ApiController.getApiSubscriptionsForTeam (cyclomatic 18) · ×1
  • ApiController.getApiSubscriptionsForTeam (cyclomatic 18) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1464 — ApiController.getApiSubscriptionsForTeam has cyclomatic complexity 18 (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 · LoginController.actualLogin (cyclomatic 18) · ×1
  • LoginController.actualLogin (cyclomatic 18) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:531 — LoginController.actualLogin has cyclomatic complexity 18 (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 · NotificationController.acceptNotification (cyclomatic 18) · ×1
  • NotificationController.acceptNotification (cyclomatic 18) daikoku/app/fr/maif/daikoku/controllers/NotificationController.scala:131 — NotificationController.acceptNotification has cyclomatic complexity 18 (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 · diff_match_patch.patch_make (cyclomatic 18) · ×1
  • diff_match_patch.patch_make (cyclomatic 18) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:1682 — diff_match_patch.patch_make 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 · i18n-context.I18nProvider (cyclomatic 18) · ×1
  • i18n-context.I18nProvider (cyclomatic 18) daikoku/javascript/src/contexts/i18n-context.tsx:65 — i18n-context.I18nProvider has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 7 function items inside it that branch (translateBase, a function literal at line 151, capitalize, …). 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 · TeamIncome.TeamIncome (cyclomatic 18) · ×1
  • TeamIncome.TeamIncome (cyclomatic 18) daikoku/javascript/src/components/backoffice/billing/TeamIncome.tsx:35 — TeamIncome.TeamIncome has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body's own statements and 4 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · ApiPost.ApiPost (cyclomatic 18) · ×1
  • ApiPost.ApiPost (cyclomatic 18) daikoku/javascript/src/components/frontend/api/ApiPost.tsx:23 — ApiPost.ApiPost has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body's own statements and 6 belong to 6 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · diff_match_patch.patch_apply (cyclomatic 17) · ×1
  • diff_match_patch.patch_apply (cyclomatic 17) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:1792 — diff_match_patch.patch_apply 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 · TeamEdit.TeamEdit (cyclomatic 17) · ×1
  • TeamEdit.TeamEdit (cyclomatic 17) daikoku/javascript/src/components/backoffice/teams/TeamEdit.tsx:206 — TeamEdit.TeamEdit has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body's own statements and 8 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · OtoroshiStatsVizualisation.OtoroshiStatsVizualization (cyclomatic 17) · ×1
  • OtoroshiStatsVizualisation.OtoroshiStatsVizualization (cyclomatic 17) daikoku/javascript/src/components/utils/OtoroshiStatsVizualisation.tsx:116 — OtoroshiStatsVizualisation.OtoroshiStatsVizualization has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 5 function items inside it that branch (formatValue, getMaxCall, tabs, …). 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 · Companion.Companion (cyclomatic 17) · ×1
  • Companion.Companion (cyclomatic 17) daikoku/javascript/src/components/utils/sidebar/companions/Companion.tsx:10 — Companion.Companion has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 39, 47, 79, …). 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 · ApiController.apiSwagger (cyclomatic 16) · ×1
  • ApiController.apiSwagger (cyclomatic 16) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:100 — ApiController.apiSwagger has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · ApiController.setupPayment (cyclomatic 16) · ×1
  • ApiController.setupPayment (cyclomatic 16) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3864 — ApiController.setupPayment has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · TenantController.contact (cyclomatic 16) · ×1
  • TenantController.contact (cyclomatic 16) daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:385 — TenantController.contact has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · ApiCrudService.updateApi (cyclomatic 16) · ×1
  • ApiCrudService.updateApi (cyclomatic 16) daikoku/app/fr/maif/daikoku/services/ApiCrudService.scala:85 — ApiCrudService.updateApi has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · ApiService.callHttpRequestStep (cyclomatic 16) · ×1
  • ApiService.callHttpRequestStep (cyclomatic 16) daikoku/app/fr/maif/daikoku/services/ApiService.scala:1064 — ApiService.callHttpRequestStep has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · DeletionService.deleteSubscriptions (cyclomatic 16) · ×1
  • DeletionService.deleteSubscriptions (cyclomatic 16) REDACTED:191 — DeletionService.deleteSubscriptions has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · CatalogSourceGithub.fetchFromSingleRepo (cyclomatic 16) · ×1
  • CatalogSourceGithub.fetchFromSingleRepo (cyclomatic 16) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:302 — CatalogSourceGithub.fetchFromSingleRepo 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 · diff_match_patch.patch_fromText (cyclomatic 16) · ×1
  • diff_match_patch.patch_fromText (cyclomatic 16) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:2093 — diff_match_patch.patch_fromText 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 · TeamApiDocumentation.TeamApiDocumentation (cyclomatic 16) · ×1
  • TeamApiDocumentation.TeamApiDocumentation (cyclomatic 16) daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:111 — TeamApiDocumentation.TeamApiDocumentation has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 241, a function literal at line 305, a function literal at line 145, …). 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 · SettingsPanel.SettingsPanel (cyclomatic 16) · ×1
  • SettingsPanel.SettingsPanel (cyclomatic 16) daikoku/javascript/src/components/utils/sidebar/panels/SettingsPanel.tsx:41 — SettingsPanel.SettingsPanel has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · Dashboard.Dashboard (cyclomatic 16) · ×1
  • Dashboard.Dashboard (cyclomatic 16) daikoku/javascript/src/components/frontend/dashboard/Dashboard.tsx:37 — Dashboard.Dashboard has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 3 function items inside it that branch (createApi, a function literal at line 69, a function literal at line 89). 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 · TestingApiKeyModal.TestingApiKeyModal (cyclomatic 16) · ×1
  • TestingApiKeyModal.TestingApiKeyModal (cyclomatic 16) daikoku/javascript/src/contexts/modals/TestingApiKeyModal.tsx:13 — TestingApiKeyModal.TestingApiKeyModal has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 110, generateApiKey, updateApiKey, …). 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 · AnonymousReportingJob.getData (cognitive 300) · ×1
  • AnonymousReportingJob.getData (cognitive 300) daikoku/app/fr/maif/daikoku/jobs/AnonymousReportingJob.scala:83 — AnonymousReportingJob.getData has cognitive complexity 300 (threshold 15). Drivers by points: loops 24 (300 pts) (nesting depth added 276). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · OtoroshiIdentityFilter.apply (cognitive 270) · ×1
  • OtoroshiIdentityFilter.apply (cognitive 270) daikoku/app/fr/maif/daikoku/login/otoroshi.scala:79 — OtoroshiIdentityFilter.apply has cognitive complexity 270 (threshold 15). Drivers by points: loops 25 (207 pts), if/else 9 (31 pts), match/switch 8 (30 pts), boolean chains 2 (nesting depth added 226). 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 · ApiService.runSubscriptionProcess (cognitive 236) · ×1
  • ApiService.runSubscriptionProcess (cognitive 236) daikoku/app/fr/maif/daikoku/services/ApiService.scala:1348 — ApiService.runSubscriptionProcess has cognitive complexity 236 (threshold 15). Drivers by points: loops 36 (219 pts), match/switch 4 (10 pts), if/else 5 (6 pts), boolean chains 1 (nesting depth added 190). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · DaikokuEnv.initDatastore (cognitive 143) · ×1
  • DaikokuEnv.initDatastore (cognitive 143) daikoku/app/fr/maif/daikoku/env/env.scala:797 — DaikokuEnv.initDatastore has cognitive complexity 143 (threshold 15). Drivers by points: loops 15 (108 pts), if/else 8 (22 pts), match/switch 5 (12 pts), boolean chains 1 (nesting depth added 114). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiService.checkAndExtractTransferLink (cognitive 141) · ×1
  • ApiService.checkAndExtractTransferLink (cognitive 141) daikoku/app/fr/maif/daikoku/services/ApiService.scala:2218 — ApiService.checkAndExtractTransferLink has cognitive complexity 141 (threshold 15). Drivers by points: loops 16 (136 pts), boolean chains 5 (nesting depth added 120). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiKeyStatsJob.syncConsumptionStatsForSubscription (cognitive 131) · ×1
  • ApiKeyStatsJob.syncConsumptionStatsForSubscription (cognitive 131) REDACTED:188 — ApiKeyStatsJob.syncConsumptionStatsForSubscription has cognitive complexity 131 (threshold 15). Drivers by points: loops 11 (66 pts), if/else 10 (40 pts), match/switch 3 (23 pts), boolean chains 2 (nesting depth added 105). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiController.updateIssue (cognitive 127) · ×1
  • ApiController.updateIssue (cognitive 127) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3252 — ApiController.updateIssue has cognitive complexity 127 (threshold 15). Drivers by points: loops 13 (104 pts), if/else 2 (15 pts), boolean chains 7, match/switch 1 (nesting depth added 104). 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 · ApiService._createOrExtendApiKey (cognitive 115) · ×1
  • ApiService._createOrExtendApiKey (cognitive 115) daikoku/app/fr/maif/daikoku/services/ApiService.scala:1752 — ApiService._createOrExtendApiKey has cognitive complexity 115 (threshold 15). Drivers by points: loops 16 (80 pts), match/switch 5 (19 pts), if/else 10, boolean chains 6 (nesting depth added 78). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · NotificationController.rejectNotificationOfTeam (cognitive 114) · ×1
  • NotificationController.rejectNotificationOfTeam (cognitive 114) daikoku/app/fr/maif/daikoku/controllers/NotificationController.scala:248 — NotificationController.rejectNotificationOfTeam has cognitive complexity 114 (threshold 15). Drivers by points: loops 25 (112 pts), if/else 1, match/switch 1 (nesting depth added 87). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiController.createIssue (cognitive 101) · ×1
  • ApiController.createIssue (cognitive 101) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3079 — ApiController.createIssue has cognitive complexity 101 (threshold 15). Drivers by points: loops 9 (86 pts), match/switch 5 (15 pts) (nesting depth added 87). 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 · ApiCrudService.updateApi (cognitive 97) · ×1
  • ApiCrudService.updateApi (cognitive 97) daikoku/app/fr/maif/daikoku/services/ApiCrudService.scala:85 — ApiCrudService.updateApi has cognitive complexity 97 (threshold 15). Drivers by points: loops 13 (91 pts), if/else 2 (5 pts), boolean chains 1 (nesting depth added 81). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiPricing.ApiPricing (cognitive 96) · ×1
  • ApiPricing.ApiPricing (cognitive 96) REDACTED:913 — ApiPricing.ApiPricing has cognitive complexity 96 (threshold 15). Drivers by points: boolean chains 38, if/else 32 (35 pts), ternaries 20 (22 pts), loops 1 (nesting depth added 5). Most of this is not in the body itself: 1 of the 96 points is its own statement and the rest belongs to 46 function items inside it that branch (a function literal at line 1895, a function literal at line 1302, otoroshiTargetColumn::showKeyringSelectModal::askForApikeys, …). 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 · OAuth2Support.bindUser (cognitive 90) · ×1
  • OAuth2Support.bindUser (cognitive 90) daikoku/app/fr/maif/daikoku/login/oauth.scala:244 — OAuth2Support.bindUser has cognitive complexity 90 (threshold 15). Drivers by points: loops 13 (39 pts), match/switch 7 (29 pts), if/else 13 (18 pts), boolean chains 4 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CommonServices.getApisByIds (cognitive 87) · ×1
  • CommonServices.getApisByIds (cognitive 87) daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:22 — CommonServices.getApisByIds has cognitive complexity 87 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 8 (36 pts), match/switch 1 (9 pts), boolean chains 4 (nesting depth added 61). To reduce it, split the body into named stages: move each independent 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 · ApiService.callHttpRequestStep (cognitive 75) · ×1
  • ApiService.callHttpRequestStep (cognitive 75) daikoku/app/fr/maif/daikoku/services/ApiService.scala:1064 — ApiService.callHttpRequestStep has cognitive complexity 75 (threshold 15). Drivers by points: loops 13 (61 pts), if/else 4 (14 pts) (nesting depth added 58). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · diff_match_patch.diff_cleanupMerge (cognitive 74) · ×1
  • diff_match_patch.diff_cleanupMerge (cognitive 74) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:1133 — diff_match_patch.diff_cleanupMerge has cognitive complexity 74 (threshold 15). Drivers by points: if/else 14 (41 pts), ternaries 8 (19 pts), loops 4 (10 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · KeyringService.toggleKeyringRotation (cognitive 73) · ×1
  • KeyringService.toggleKeyringRotation (cognitive 73) daikoku/app/fr/maif/daikoku/services/KeyringService.scala:133 — KeyringService.toggleKeyringRotation has cognitive complexity 73 (threshold 15). Drivers by points: loops 11 (66 pts), match/switch 1 (7 pts) (nesting depth added 61). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiService.declineSubscriptionDemand (cognitive 72) · ×1
  • ApiService.declineSubscriptionDemand (cognitive 72) daikoku/app/fr/maif/daikoku/services/ApiService.scala:2067 — ApiService.declineSubscriptionDemand has cognitive complexity 72 (threshold 15). Drivers by points: loops 13 (69 pts), if/else 2 (3 pts) (nesting depth added 57). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · AccountCreationService.finalizeAccountCreation (cognitive 68) · ×1
  • AccountCreationService.finalizeAccountCreation (cognitive 68) daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:23 — AccountCreationService.finalizeAccountCreation has cognitive complexity 68 (threshold 15). Drivers by points: loops 11 (54 pts), match/switch 3 (13 pts), if/else 1 (nesting depth added 53). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiService.notifyApiSubscription (cognitive 68) · ×1
  • ApiService.notifyApiSubscription (cognitive 68) daikoku/app/fr/maif/daikoku/services/ApiService.scala:945 — ApiService.notifyApiSubscription has cognitive complexity 68 (threshold 15). Drivers by points: loops 11 (64 pts), match/switch 1 (4 pts) (nesting depth added 56). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · diff_match_patch.diff_cleanupEfficiency (cognitive 67) · ×1
  • diff_match_patch.diff_cleanupEfficiency (cognitive 67) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:1025 — diff_match_patch.diff_cleanupEfficiency has cognitive complexity 67 (threshold 15). Drivers by points: if/else 14 (32 pts), ternaries 5 (18 pts), loops 3 (10 pts), boolean chains 7 (nesting depth added 38). 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 · DeletionService.deleteSubscriptions (cognitive 66) · ×1
  • DeletionService.deleteSubscriptions (cognitive 66) REDACTED:191 — DeletionService.deleteSubscriptions has cognitive complexity 66 (threshold 15). Drivers by points: loops 11 (59 pts), match/switch 3 (7 pts) (nesting depth added 52). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · UsagePlanService.updatePlan (cognitive 66) · ×1
  • UsagePlanService.updatePlan (cognitive 66) daikoku/app/fr/maif/daikoku/services/UsagePlanService.scala:51 — UsagePlanService.updatePlan has cognitive complexity 66 (threshold 15). Drivers by points: loops 11 (66 pts) (nesting depth added 55). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · QueueJob.deleteSubscription (cognitive 65) · ×1
  • QueueJob.deleteSubscription (cognitive 65) REDACTED:92 — QueueJob.deleteSubscription has cognitive complexity 65 (threshold 15). Drivers by points: loops 11 (64 pts), match/switch 1 (nesting depth added 53). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · DynamicTable.DynamicTable (cognitive 64) · ×1
  • DynamicTable.DynamicTable (cognitive 64) daikoku/javascript/src/components/inputs/DynamicTable.tsx:238 — DynamicTable.DynamicTable has cognitive complexity 64 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 20, ternaries 14 (19 pts) (nesting depth added 8). Most of this is not in the body itself: 12 of the 64 points are its own statements and the rest belongs to 22 function items inside it that branch (a function literal at line 451, a function literal at line 616, renderBulkRow, …). 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 · ApiController.planSwagger (cognitive 61) · ×1
  • ApiController.planSwagger (cognitive 61) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:197 — ApiController.planSwagger has cognitive complexity 61 (threshold 15). Drivers by points: loops 9 (45 pts), if/else 7 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 40). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · SchemaDefinition.getSchema (cognitive 61) · ×1
  • SchemaDefinition.getSchema (cognitive 61) daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:147 — SchemaDefinition.getSchema has cognitive complexity 61 (threshold 15). Drivers by points: match/switch 32 (34 pts), if/else 13, loops 6 (12 pts), boolean chains 2 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · diff_match_patch.diff_cleanupSemantic (cognitive 61) · ×1
  • diff_match_patch.diff_cleanupSemantic (cognitive 61) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:736 — diff_match_patch.diff_cleanupSemantic has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 5 (16 pts), ternaries 3 (7 pts), boolean chains 4 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LdapSupport._bindUser (cognitive 59) · ×1
  • LdapSupport._bindUser (cognitive 59) daikoku/app/fr/maif/daikoku/login/ldap.scala:270 — LdapSupport._bindUser has cognitive complexity 59 (threshold 15). Drivers by points: loops 6 (32 pts), if/else 10 (17 pts), match/switch 3 (10 pts) (nesting depth added 40). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · diff_match_patch.diff_bisect (cognitive 58) · ×1
  • diff_match_patch.diff_bisect (cognitive 58) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:338 — diff_match_patch.diff_bisect has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 6 (12 pts), boolean chains 8 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · keyboardCoordinates.sortableTreeKeyboardCoordinates.<returned closure> (cognitive 56) · ×1
  • keyboardCoordinates.sortableTreeKeyboardCoordinates.<returned closure> (cognitive 56) daikoku/javascript/src/components/utils/dnd/keyboardCoordinates.ts:27 — keyboardCoordinates.sortableTreeKeyboardCoordinates.<returned closure> has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (34 pts), ternaries 2 (10 pts), boolean chains 7, match/switch 2 (5 pts) (nesting depth added 32). Of this number, 43 points are the body's own statements and 13 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · ApiService.makeSubscriptionUnique (cognitive 55) · ×1
  • ApiService.makeSubscriptionUnique (cognitive 55) daikoku/app/fr/maif/daikoku/services/ApiService.scala:868 — ApiService.makeSubscriptionUnique has cognitive complexity 55 (threshold 15). Drivers by points: loops 10 (55 pts) (nesting depth added 45). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · diff_match_patch.patch_apply (cognitive 55) · ×1
  • diff_match_patch.patch_apply (cognitive 55) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:1792 — diff_match_patch.patch_apply has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (47 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · ApiService.regenerateOnBinding (cognitive 53) · ×1
  • ApiService.regenerateOnBinding (cognitive 53) daikoku/app/fr/maif/daikoku/services/ApiService.scala:743 — ApiService.regenerateOnBinding has cognitive complexity 53 (threshold 15). Drivers by points: loops 9 (52 pts), match/switch 1 (nesting depth added 43). 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 · diff_match_patch.patch_splitMax (cognitive 53) · ×1
  • diff_match_patch.patch_splitMax (cognitive 53) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:1962 — diff_match_patch.patch_splitMax has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 3 (6 pts), ternaries 3 (6 pts), boolean chains 3 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ApiService.validateProcessWithStepValidator (cognitive 52) · ×1
  • ApiService.validateProcessWithStepValidator (cognitive 52) daikoku/app/fr/maif/daikoku/services/ApiService.scala:1232 — ApiService.validateProcessWithStepValidator has cognitive complexity 52 (threshold 15). Drivers by points: loops 9 (45 pts), if/else 2 (7 pts) (nesting depth added 41). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · DeletionService.deleteUserByQueue (cognitive 51) · ×1
  • DeletionService.deleteUserByQueue (cognitive 51) REDACTED:489 — DeletionService.deleteUserByQueue has cognitive complexity 51 (threshold 15). Drivers by points: loops 9 (45 pts), if/else 2 (6 pts) (nesting depth added 40). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · KeyringCard.KeyringCard (cognitive 51) · ×1
  • KeyringCard.KeyringCard (cognitive 51) REDACTED:207 — KeyringCard.KeyringCard has cognitive complexity 51 (threshold 15). Drivers by points: ternaries 19 (20 pts), boolean chains 18, if/else 13 (nesting depth added 1). Most of this is not in the body itself: 15 of the 51 points are its own statements and the rest belongs to 21 function items inside it that branch (a function literal at line 654, a function literal at line 714, DisplayLink, …). 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 · CmsPage.render (cognitive 49) · ×1
  • CmsPage.render (cognitive 49) daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:1103 — CmsPage.render has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (25 pts), match/switch 7 (15 pts), error handling 3 (5 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ApiController.getApi (cognitive 48) · ×1
  • ApiController.getApi (cognitive 48) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:440 — ApiController.getApi has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 5 (15 pts), match/switch 2 (11 pts), boolean chains 6 (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 · DeletionService.deleteTeamByQueue (cognitive 45) · ×1
  • DeletionService.deleteTeamByQueue (cognitive 45) REDACTED:662 — DeletionService.deleteTeamByQueue has cognitive complexity 45 (threshold 15). Drivers by points: loops 9 (45 pts) (nesting depth added 36). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · TeamService.updateTeam (cognitive 45) · ×1
  • TeamService.updateTeam (cognitive 45) daikoku/app/fr/maif/daikoku/services/TeamService.scala:122 — TeamService.updateTeam has cognitive complexity 45 (threshold 15). Drivers by points: loops 8 (36 pts), if/else 4 (6 pts), boolean chains 3 (nesting depth added 30). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · TenantService.deleteTenant (cognitive 45) · ×1
  • TenantService.deleteTenant (cognitive 45) daikoku/app/fr/maif/daikoku/services/TenantService.scala:136 — TenantService.deleteTenant has cognitive complexity 45 (threshold 15). Drivers by points: loops 9 (45 pts) (nesting depth added 36). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiController.createPost (cognitive 44) · ×1
  • ApiController.createPost (cognitive 44) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2763 — ApiController.createPost has cognitive complexity 44 (threshold 15). Drivers by points: loops 12 (44 pts) (nesting depth added 32). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · TeamMembers.TeamMembersSimpleComponent (cognitive 44) · ×1
  • TeamMembers.TeamMembersSimpleComponent (cognitive 44) daikoku/javascript/src/components/backoffice/members/TeamMembers.tsx:45 — TeamMembers.TeamMembersSimpleComponent has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 14, ternaries 7 (13 pts) (nesting depth added 8). Most of this is not in the body itself: 12 of the 44 points are its own statements and the rest belongs to 16 function items inside it that branch (togglePermission, removeMember, invitUser, …). 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 · NotificationList.NotificationList (cognitive 43) · ×1
  • NotificationList.NotificationList (cognitive 43) daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:167 — NotificationList.NotificationList has cognitive complexity 43 (threshold 15). Drivers by points: boolean chains 17, if/else 8 (14 pts), ternaries 5 (8 pts), match/switch 4 (nesting depth added 9). Most of this is not in the body itself: 1 of the 43 points is its own statement and the rest belongs to 18 function items inside it that branch (actionFormatter, notificationFormatter, a function literal at line 793, …). 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 · ApiController.getVisiblePlans (cognitive 42) · ×1
  • ApiController.getVisiblePlans (cognitive 42) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:604 — ApiController.getVisiblePlans has cognitive complexity 42 (threshold 15). Drivers by points: loops 5 (15 pts), match/switch 2 (13 pts), if/else 8, boolean chains 6 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PaymentClient.checkoutSubscription (cognitive 42) · ×1
  • PaymentClient.checkoutSubscription (cognitive 42) daikoku/app/fr/maif/daikoku/controllers/PaymentClient.scala:188 — PaymentClient.checkoutSubscription has cognitive complexity 42 (threshold 15). Drivers by points: loops 8 (36 pts), if/else 2 (6 pts) (nesting depth added 32). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiAdminApiController.validateWith (cognitive 41) · ×1
  • ApiAdminApiController.validateWith (cognitive 41) daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:548 — ApiAdminApiController.validateWith has cognitive complexity 41 (threshold 15). Drivers by points: loops 7 (28 pts), match/switch 2 (13 pts) (nesting depth added 32). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · OtoroshiSynchronizerJob.synchronizeApikeys (cognitive 41) · ×1
  • OtoroshiSynchronizerJob.synchronizeApikeys (cognitive 41) daikoku/app/fr/maif/daikoku/jobs/OtoroshiSynchronizerJob.scala:627 — OtoroshiSynchronizerJob.synchronizeApikeys has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 5 (14 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ApiHome.ApiHome (cognitive 41) · ×1
  • ApiHome.ApiHome (cognitive 41) daikoku/javascript/src/components/frontend/api/ApiHome.tsx:18 — ApiHome.ApiHome has cognitive complexity 41 (threshold 15). Drivers by points: boolean chains 25, if/else 11 (14 pts), ternaries 1 (2 pts) (nesting depth added 4). Of this number, 23 points are the body's own statements and 18 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · LoginFilter.apply (cognitive 40) · ×1
  • LoginFilter.apply (cognitive 40) daikoku/app/fr/maif/daikoku/login/api.scala:338 — LoginFilter.apply has cognitive complexity 40 (threshold 15). Drivers by points: loops 3 (21 pts), match/switch 6 (17 pts), if/else 2 (nesting depth added 29). 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 · SearchPanel.Search (cognitive 40) · ×1
  • SearchPanel.Search (cognitive 40) daikoku/javascript/src/components/utils/sidebar/panels/SearchPanel.tsx:26 — SearchPanel.Search has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (25 pts), ternaries 2 (7 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 16). Most of this is not in the body itself: 4 of the 40 points are its own statements and the rest belongs to 4 function items inside it that branch (handleChangeSelected, handleSelect, a function literal at line 141, …). 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 · TeamBilling.TeamBilling (cognitive 39) · ×1
  • TeamBilling.TeamBilling (cognitive 39) daikoku/javascript/src/components/backoffice/billing/TeamBilling.tsx:28 — TeamBilling.TeamBilling has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (25 pts), boolean chains 13, ternaries 1 (nesting depth added 5). Most of this is not in the body itself: 7 of the 39 points are its own statements and the rest belongs to 6 function items inside it that branch (drawApis, drawApiConsumption, BillingCartridge, …). 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 · ApiController.apiSwagger (cognitive 37) · ×1
  • ApiController.apiSwagger (cognitive 37) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:100 — ApiController.apiSwagger has cognitive complexity 37 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 7 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · LoginController.validateAccountCreationAttempt (cognitive 37) · ×1
  • LoginController.validateAccountCreationAttempt (cognitive 37) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:915 — LoginController.validateAccountCreationAttempt has cognitive complexity 37 (threshold 15). Drivers by points: loops 6 (21 pts), match/switch 2 (14 pts), if/else 2 (nesting depth added 27). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · diff_match_patch.match_bitap (cognitive 37) · ×1
  • diff_match_patch.match_bitap (cognitive 37) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:1445 — diff_match_patch.match_bitap has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ApiController.checkTransferLink (cognitive 36) · ×1
  • ApiController.checkTransferLink (cognitive 36) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1756 — ApiController.checkTransferLink has cognitive complexity 36 (threshold 15). Drivers by points: loops 8 (36 pts) (nesting depth added 28). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiController.setupPayment (cognitive 36) · ×1
  • ApiController.setupPayment (cognitive 36) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3864 — ApiController.setupPayment has cognitive complexity 36 (threshold 15). Drivers by points: loops 6 (21 pts), match/switch 4 (12 pts), if/else 3 (nesting depth added 23). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · TeamController.sendInvitationToUser (cognitive 36) · ×1
  • TeamController.sendInvitationToUser (cognitive 36) daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:569 — TeamController.sendInvitationToUser has cognitive complexity 36 (threshold 15). Drivers by points: loops 7 (35 pts), match/switch 1 (nesting depth added 28). 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 · evolution_1892.script (cognitive 36) · ×1
  • evolution_1892.script (cognitive 36) daikoku/app/fr/maif/daikoku/env/evolutions.scala:1780 — evolution_1892.script has cognitive complexity 36 (threshold 15). Drivers by points: loops 8 (36 pts) (nesting depth added 28). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · DeletionService.deleteCompleteUserByQueue (cognitive 36) · ×1
  • DeletionService.deleteCompleteUserByQueue (cognitive 36) REDACTED:523 — DeletionService.deleteCompleteUserByQueue has cognitive complexity 36 (threshold 15). Drivers by points: loops 8 (36 pts) (nesting depth added 28). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · TeamService.createTeam (cognitive 36) · ×1
  • TeamService.createTeam (cognitive 36) daikoku/app/fr/maif/daikoku/services/TeamService.scala:28 — TeamService.createTeam has cognitive complexity 36 (threshold 15). Drivers by points: loops 9 (33 pts), match/switch 2, boolean chains 1 (nesting depth added 24). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · AccountCreationService.notifyTenantAdminteam (cognitive 35) · ×1
  • AccountCreationService.notifyTenantAdminteam (cognitive 35) daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:362 — AccountCreationService.notifyTenantAdminteam has cognitive complexity 35 (threshold 15). Drivers by points: loops 8 (34 pts), match/switch 1 (nesting depth added 26). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · DeletionService.deleteUsagePlanByQueue (cognitive 35) · ×1
  • DeletionService.deleteUsagePlanByQueue (cognitive 35) REDACTED:731 — DeletionService.deleteUsagePlanByQueue has cognitive complexity 35 (threshold 15). Drivers by points: loops 7 (28 pts), match/switch 1 (7 pts) (nesting depth added 27). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiSubscriptionAdminApiController.doUpdate (cognitive 34) · ×1
  • ApiSubscriptionAdminApiController.doUpdate (cognitive 34) daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:812 — ApiSubscriptionAdminApiController.doUpdate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 5 (15 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · HomeController.getMatchingRoutes (cognitive 34) · ×1
  • HomeController.getMatchingRoutes (cognitive 34) daikoku/app/fr/maif/daikoku/controllers/HomeController.scala:266 — HomeController.getMatchingRoutes has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 1 (5 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NotificationController.acceptApiAccess (cognitive 34) · ×1
  • NotificationController.acceptApiAccess (cognitive 34) daikoku/app/fr/maif/daikoku/controllers/NotificationController.scala:616 — NotificationController.acceptApiAccess has cognitive complexity 34 (threshold 15). Drivers by points: loops 8 (34 pts) (nesting depth added 26). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiService.applyProcessForApiSubscription (cognitive 34) · ×1
  • ApiService.applyProcessForApiSubscription (cognitive 34) daikoku/app/fr/maif/daikoku/services/ApiService.scala:1953 — ApiService.applyProcessForApiSubscription has cognitive complexity 34 (threshold 15). Drivers by points: loops 4 (14 pts), match/switch 5 (14 pts), boolean chains 3, if/else 3 (nesting depth added 19). 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 · MessageActor.maybeSendMailToRecipent (cognitive 33) · ×1
  • MessageActor.maybeSendMailToRecipent (cognitive 33) daikoku/app/fr/maif/daikoku/messages/Events.scala:63 — MessageActor.maybeSendMailToRecipent has cognitive complexity 33 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 4 (12 pts) (nesting depth added 23). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiService.subscribeToApi (cognitive 33) · ×1
  • ApiService.subscribeToApi (cognitive 33) daikoku/app/fr/maif/daikoku/services/ApiService.scala:225 — ApiService.subscribeToApi has cognitive complexity 33 (threshold 15). Drivers by points: loops 9 (21 pts), match/switch 4 (5 pts), if/else 2 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · CatalogSourceGithub.fetchFromSingleRepo (cognitive 33) · ×1
  • CatalogSourceGithub.fetchFromSingleRepo (cognitive 33) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:302 — CatalogSourceGithub.fetchFromSingleRepo has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 5 (14 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · diff_match_patch.diff_cleanupSemanticLossless (cognitive 33) · ×1
  • diff_match_patch.diff_cleanupSemanticLossless (cognitive 33) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:885 — diff_match_patch.diff_cleanupSemanticLossless has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (22 pts), ternaries 4 (5 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · UsagePlansAdminApiController.createEntity (cognitive 32) · ×1
  • UsagePlansAdminApiController.createEntity (cognitive 32) daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1503 — UsagePlansAdminApiController.createEntity has cognitive complexity 32 (threshold 15). Drivers by points: loops 5 (25 pts), match/switch 3 (7 pts) (nesting depth added 24). 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 · HomeController.healthDetailed (cognitive 32) · ×1
  • HomeController.healthDetailed (cognitive 32) daikoku/app/fr/maif/daikoku/controllers/HomeController.scala:128 — HomeController.healthDetailed has cognitive complexity 32 (threshold 15). Drivers by points: loops 3 (12 pts), match/switch 4 (12 pts), if/else 5 (8 pts) (nesting depth added 20). 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 · LoginController.actualLogin (cognitive 32) · ×1
  • LoginController.actualLogin (cognitive 32) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:531 — LoginController.actualLogin has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 7 (23 pts), if/else 4 (8 pts), boolean chains 1 (nesting depth added 20). 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 · CommonServices.getApisWithSubscriptions (cognitive 31) · ×1
  • CommonServices.getApisWithSubscriptions (cognitive 31) daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:159 — CommonServices.getApisWithSubscriptions has cognitive complexity 31 (threshold 15). Drivers by points: loops 6 (21 pts), boolean chains 7, if/else 2 (3 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · evolution_157.script (cognitive 31) · ×1
  • evolution_157.script (cognitive 31) daikoku/app/fr/maif/daikoku/env/evolutions.scala:333 — evolution_157.script has cognitive complexity 31 (threshold 15). Drivers by points: loops 5 (25 pts), match/switch 3 (5 pts), if/else 1 (nesting depth added 22). 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 · TeamSelectionModal.TeamSelectorModal (cognitive 31) · ×1
  • TeamSelectionModal.TeamSelectorModal (cognitive 31) daikoku/javascript/src/contexts/modals/TeamSelectionModal.tsx:10 — TeamSelectionModal.TeamSelectorModal has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 12 (nesting depth added 5). Most of this is not in the body itself: 3 of the 31 points are its own statements and the rest belongs to 7 function items inside it that branch (doTeamAction, getButton, a function literal at line 120, …). 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 · diff_match_patch.patch_fromText (cognitive 30) · ×1
  • diff_match_patch.patch_fromText (cognitive 30) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:2093 — diff_match_patch.patch_fromText has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (18 pts), error handling 3 (9 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SubscriptionMetadataModal.SubscriptionMetadataModal (cognitive 30) · ×1
  • SubscriptionMetadataModal.SubscriptionMetadataModal (cognitive 30) daikoku/javascript/src/contexts/modals/SubscriptionMetadataModal.tsx:33 — SubscriptionMetadataModal.SubscriptionMetadataModal has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 15, if/else 10 (11 pts), ternaries 2 (4 pts) (nesting depth added 3). Of this number, 23 points are the body's own statements and 7 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · ApiList.ApiList (cognitive 30) · ×1
  • ApiList.ApiList (cognitive 30) daikoku/javascript/src/components/frontend/dashboard/ApiList.tsx:27 — ApiList.ApiList has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 16, ternaries 5 (8 pts), if/else 5 (6 pts) (nesting depth added 4). Most of this is not in the body itself: 4 of the 30 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 181, 79, 129, …). 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 · globalContext.GlobalContextProvider (cognitive 30) · ×1
  • globalContext.GlobalContextProvider (cognitive 30) daikoku/javascript/src/contexts/globalContext.tsx:86 — globalContext.GlobalContextProvider has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 5 (nesting depth added 12). Most of this is not in the body itself: 4 of the 30 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 108, toggleTheme, getExpertMode, …). 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 · AuditActor.sendRotationEmails (cognitive 29) · ×1
  • AuditActor.sendRotationEmails (cognitive 29) daikoku/app/fr/maif/daikoku/audit/audit.scala:370 — AuditActor.sendRotationEmails has cognitive complexity 29 (threshold 15). Drivers by points: loops 7 (28 pts), match/switch 1 (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · TenantController.contact (cognitive 29) · ×1
  • TenantController.contact (cognitive 29) daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:385 — TenantController.contact has cognitive complexity 29 (threshold 15). Drivers by points: loops 6 (21 pts), match/switch 4 (8 pts) (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · SortableTree.SortableTree · ×1
  • SortableTree.SortableTree::getMovementAnnouncement (cognitive 29) daikoku/javascript/src/components/utils/dnd/SortableTree.tsx:327 — SortableTree.SortableTree::getMovementAnnouncement has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (4 pts), ternaries 2 (4 pts), boolean chains 3 (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 · TeamApiSubscriptions.TeamApiSubscriptions (cognitive 29) · ×1
  • TeamApiSubscriptions.TeamApiSubscriptions (cognitive 29) daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx:75 — TeamApiSubscriptions.TeamApiSubscriptions has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 15, if/else 8, ternaries 6. Most of this is not in the body itself: 2 of the 29 points are its own statements and the rest belongs to 15 function items inside it that branch (a function literal at line 171, fetchData, a function literal at line 209, …). 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 · RemoteCatalogsForm.RemoteCatalogsForm (cognitive 29) · ×1
  • RemoteCatalogsForm.RemoteCatalogsForm (cognitive 29) daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:355 — RemoteCatalogsForm.RemoteCatalogsForm has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 14, ternaries 9, if/else 6. Most of this is not in the body itself: 6 of the 29 points are its own statements and the rest belongs to 18 function items inside it that branch (sourceKinds, warningFor, catalogSchema, …). 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 · LoginController.maintenanceLogin (cognitive 28) · ×1
  • LoginController.maintenanceLogin (cognitive 28) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:64 — LoginController.maintenanceLogin has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 4 (10 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LoginController.passwordResetValidation (cognitive 28) · ×1
  • LoginController.passwordResetValidation (cognitive 28) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:1192 — LoginController.passwordResetValidation has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (28 pts) (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · TeamController.verifyContactEmail (cognitive 28) · ×1
  • TeamController.verifyContactEmail (cognitive 28) daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:156 — TeamController.verifyContactEmail has cognitive complexity 28 (threshold 15). Drivers by points: loops 3 (16 pts), if/else 4 (7 pts), match/switch 2 (5 pts) (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · DeletionService.deleteApiClosure (cognitive 28) · ×1
  • DeletionService.deleteApiClosure (cognitive 28) REDACTED:440 — DeletionService.deleteApiClosure has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (28 pts) (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · KeyringService.deleteKeyring (cognitive 28) · ×1
  • KeyringService.deleteKeyring (cognitive 28) daikoku/app/fr/maif/daikoku/services/KeyringService.scala:68 — KeyringService.deleteKeyring has cognitive complexity 28 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 2 (7 pts) (nesting depth added 20). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · TenantService.createTenant (cognitive 28) · ×1
  • TenantService.createTenant (cognitive 28) daikoku/app/fr/maif/daikoku/services/TenantService.scala:23 — TenantService.createTenant has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (28 pts) (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · AssetsList.AssetsList (cognitive 28) · ×1
  • AssetsList.AssetsList (cognitive 28) daikoku/javascript/src/components/backoffice/assets/AssetsList.tsx:147 — AssetsList.AssetsList has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 4, ternaries 4 (nesting depth added 2). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 13 function items inside it that branch (addAsset, a function literal at line 157, a function literal at line 238, …). 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 · navContext.useApiFrontOffice (cognitive 28) · ×1
  • navContext.useApiFrontOffice (cognitive 28) daikoku/javascript/src/contexts/navContext.tsx:67 — navContext.useApiFrontOffice has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 24, if/else 2, ternaries 2. Most of this is not in the body itself: 13 of the 28 points are its own statements and the rest belongs to 3 function items inside it that branch (schema, a function literal at line 220, a function literal at line 214). 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 · TeamList.OtoroshiEntitiesSelector (cognitive 28) · ×1
  • TeamList.OtoroshiEntitiesSelector (cognitive 28) daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:351 — TeamList.OtoroshiEntitiesSelector has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 12, match/switch 1 (2 pts) (nesting depth added 4). Most of this is not in the body itself: 4 of the 28 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 385, a function literal at line 423, a function literal at line 367, …). 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 · NotificationController.acceptTransferOwnership (cognitive 27) · ×1
  • NotificationController.acceptTransferOwnership (cognitive 27) daikoku/app/fr/maif/daikoku/controllers/NotificationController.scala:810 — NotificationController.acceptTransferOwnership has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (21 pts), match/switch 1 (5 pts), if/else 1 (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiController.askOwnerForApiAccess (cognitive 26) · ×1
  • ApiController.askOwnerForApiAccess (cognitive 26) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2320 — ApiController.askOwnerForApiAccess has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (26 pts) (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · CatalogSourceGitlab.fetchFromSingleProject (cognitive 26) · ×1
  • CatalogSourceGitlab.fetchFromSingleProject (cognitive 26) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:213 — CatalogSourceGitlab.fetchFromSingleProject has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 6 (12 pts) (nesting depth added 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. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · diff_match_patch.patch_make (cognitive 26) · ×1
  • diff_match_patch.patch_make (cognitive 26) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:1682 — diff_match_patch.patch_make has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ApiPricing.OtoroshiEntitiesSelector (cognitive 26) · ×1
  • ApiPricing.OtoroshiEntitiesSelector (cognitive 26) REDACTED:104 — ApiPricing.OtoroshiEntitiesSelector has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 10, match/switch 1 (2 pts) (nesting depth added 4). Most of this is not in the body itself: 4 of the 26 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 136, a function literal at line 183, a function literal at line 118, …). 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 · TeamApiDocumentation.TeamApiDocumentation (cognitive 25) · ×1
  • TeamApiDocumentation.TeamApiDocumentation (cognitive 25) daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:111 — TeamApiDocumentation.TeamApiDocumentation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 5). Most of this is not in the body itself: 2 of the 25 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 241, a function literal at line 305, a function literal at line 263, …). 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 · LoginController.createUserValidation (cognitive 24) · ×1
  • LoginController.createUserValidation (cognitive 24) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:1018 — LoginController.createUserValidation has cognitive complexity 24 (threshold 15). Drivers by points: loops 3 (15 pts), match/switch 3 (6 pts), if/else 2, boolean chains 1 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · OtoroshiSettingsController.updateTestingApiKey (cognitive 24) · ×1
  • OtoroshiSettingsController.updateTestingApiKey (cognitive 24) daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:554 — OtoroshiSettingsController.updateTestingApiKey has cognitive complexity 24 (threshold 15). Drivers by points: loops 7 (20 pts), if/else 3, match/switch 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · SubscriptionProcessEditor.SubscriptionProcessEditor (cognitive 24) · ×1
  • SubscriptionProcessEditor.SubscriptionProcessEditor (cognitive 24) daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx:272 — SubscriptionProcessEditor.SubscriptionProcessEditor has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 10, ternaries 1 (2 pts), match/switch 1 (nesting depth added 3). Most of this is not in the body itself: 6 of the 24 points are its own statements and the rest belongs to 8 function items inside it that branch (editProcess, a function literal at line 601, a function literal at line 319, …). 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 · LoginController.createUser (cognitive 23) · ×1
  • LoginController.createUser (cognitive 23) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:837 — LoginController.createUser has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (15 pts), match/switch 2 (6 pts), if/else 2 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · TenantService.updateTenant (cognitive 23) · ×1
  • TenantService.updateTenant (cognitive 23) daikoku/app/fr/maif/daikoku/services/TenantService.scala:98 — TenantService.updateTenant has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 1, match/switch 1 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · evolution_1630.script (cognitive 22) · ×1
  • evolution_1630.script (cognitive 22) daikoku/app/fr/maif/daikoku/env/evolutions.scala:963 — evolution_1630.script has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (21 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · TenantHelper.withTenant (cognitive 22) · ×1
  • TenantHelper.withTenant (cognitive 22) daikoku/app/fr/maif/daikoku/login/api.scala:112 — TenantHelper.withTenant has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 8 (21 pts), if/else 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · AccountCreationService.callHttpRequestStep (cognitive 22) · ×1
  • AccountCreationService.callHttpRequestStep (cognitive 22) daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:281 — AccountCreationService.callHttpRequestStep has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 4 (6 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · UsagePlanService.runDemandUpdate (cognitive 22) · ×1
  • UsagePlanService.runDemandUpdate (cognitive 22) daikoku/app/fr/maif/daikoku/services/UsagePlanService.scala:293 — UsagePlanService.runDemandUpdate has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 3, match/switch 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · TeamApis.TeamApis (cognitive 22) · ×1
  • TeamApis.TeamApis (cognitive 22) daikoku/javascript/src/components/backoffice/apis/TeamApis.tsx:16 — TeamApis.TeamApis has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 12, if/else 5 (6 pts), ternaries 3 (4 pts) (nesting depth added 2). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 58, 24, 37, …). 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 · ApiController.getSubscriptionsOfTeam (cognitive 21) · ×1
  • ApiController.getSubscriptionsOfTeam (cognitive 21) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1610 — ApiController.getSubscriptionsOfTeam has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (15 pts), match/switch 1 (6 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiController.getTransferLink (cognitive 21) · ×1
  • ApiController.getTransferLink (cognitive 21) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1786 — ApiController.getTransferLink has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (ApiController.toggleApiSubscriptionByApiOwner) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · ApiController.toggleApiSubscriptionByApiOwner (cognitive 21) · ×1
  • ApiController.toggleApiSubscriptionByApiOwner (cognitive 21) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1875 — ApiController.toggleApiSubscriptionByApiOwner has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (ApiController.getTransferLink) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · NotificationController.acceptTeamInvitation (cognitive 21) · ×1
  • NotificationController.acceptTeamInvitation (cognitive 21) daikoku/app/fr/maif/daikoku/controllers/NotificationController.scala:680 — NotificationController.acceptTeamInvitation has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · OtoroshiSettingsController.createTestingApiKey (cognitive 21) · ×1
  • OtoroshiSettingsController.createTestingApiKey (cognitive 21) daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:457 — OtoroshiSettingsController.createTestingApiKey has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (OtoroshiSettingsController.fakePlanCall) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · OtoroshiSettingsController.fakePlanCall (cognitive 21) · ×1
  • OtoroshiSettingsController.fakePlanCall (cognitive 21) daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:790 — OtoroshiSettingsController.fakePlanCall has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (OtoroshiSettingsController.createTestingApiKey) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · TeamController.sendEmailVerification (cognitive 21) · ×1
  • TeamController.sendEmailVerification (cognitive 21) daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:253 — TeamController.sendEmailVerification has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (20 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · TeamController.teamHome (cognitive 21) · ×1
  • TeamController.teamHome (cognitive 21) daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:778 — TeamController.teamHome has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · UsersController.removeInvitation (cognitive 21) · ×1
  • UsersController.removeInvitation (cognitive 21) daikoku/app/fr/maif/daikoku/controllers/UsersController.scala:492 — UsersController.removeInvitation has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · OtoroshiSynchronizerJob.mergeOtoroshiApikeys (cognitive 21) · ×1
  • OtoroshiSynchronizerJob.mergeOtoroshiApikeys (cognitive 21) daikoku/app/fr/maif/daikoku/jobs/OtoroshiSynchronizerJob.scala:433 — OtoroshiSynchronizerJob.mergeOtoroshiApikeys has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, boolean chains 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 · ApiService.updateSubscription (cognitive 21) · ×1
  • ApiService.updateSubscription (cognitive 21) daikoku/app/fr/maif/daikoku/services/ApiService.scala:540 — ApiService.updateSubscription has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 2 other methods here (ApiService.declineProcessWithStepValidator, ApiService.transferSubscription) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · ApiService.declineProcessWithStepValidator (cognitive 21) · ×1
  • ApiService.declineProcessWithStepValidator (cognitive 21) daikoku/app/fr/maif/daikoku/services/ApiService.scala:1310 — ApiService.declineProcessWithStepValidator has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 2 other methods here (ApiService.updateSubscription, ApiService.transferSubscription) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · ApiService.transferSubscription (cognitive 21) · ×1
  • ApiService.transferSubscription (cognitive 21) daikoku/app/fr/maif/daikoku/services/ApiService.scala:2325 — ApiService.transferSubscription has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 2 other methods here (ApiService.updateSubscription, ApiService.declineProcessWithStepValidator) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · UsagePlanService.createPlan (cognitive 21) · ×1
  • UsagePlanService.createPlan (cognitive 21) daikoku/app/fr/maif/daikoku/services/UsagePlanService.scala:26 — UsagePlanService.createPlan has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiHeader.ApiHeader (cognitive 21) · ×1
  • ApiHeader.ApiHeader (cognitive 21) REDACTED:28 — ApiHeader.ApiHeader has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 9, match/switch 1. Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 47, a function literal at line 70, a function literal at line 98, …). 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 · FeedbackButton.FeedbackButton (cognitive 21) · ×1
  • FeedbackButton.FeedbackButton (cognitive 21) daikoku/javascript/src/components/utils/FeedbackButton.tsx:21 — FeedbackButton.FeedbackButton has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6 (nesting depth added 5). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 75, setStyle, a function literal at line 28, …). 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 · TenantEdit.TenantEditComponent (cognitive 21) · ×1
  • TenantEdit.TenantEditComponent (cognitive 21) daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx:32 — TenantEdit.TenantEditComponent has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 17, if/else 3, ternaries 1. Of this number, 20 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · NotificationController.rejectNotificationOfMe (cognitive 20) · ×1
  • NotificationController.rejectNotificationOfMe (cognitive 20) daikoku/app/fr/maif/daikoku/controllers/NotificationController.scala:488 — NotificationController.rejectNotificationOfMe has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (13 pts), match/switch 3 (6 pts), if/else 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · NotificationController.acceptApiSubscription (cognitive 20) · ×1
  • NotificationController.acceptApiSubscription (cognitive 20) daikoku/app/fr/maif/daikoku/controllers/NotificationController.scala:734 — NotificationController.acceptApiSubscription has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 2 (5 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · AnonymousReportingJob.sendDatas (cognitive 20) · ×1
  • AnonymousReportingJob.sendDatas (cognitive 20) daikoku/app/fr/maif/daikoku/jobs/AnonymousReportingJob.scala:167 — AnonymousReportingJob.sendDatas has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (5 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · QueueJob.deleteFirstOperation (cognitive 20) · ×1
  • QueueJob.deleteFirstOperation (cognitive 20) REDACTED:404 — QueueJob.deleteFirstOperation has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (15 pts), match/switch 1 (4 pts), if/else 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiService.archiveApiKey (cognitive 20) · ×1
  • ApiService.archiveApiKey (cognitive 20) daikoku/app/fr/maif/daikoku/services/ApiService.scala:613 — ApiService.archiveApiKey has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (14 pts), if/else 4 (5 pts), match/switch 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · i18n-context.I18nProvider (cognitive 20) · ×1
  • i18n-context.I18nProvider (cognitive 20) daikoku/javascript/src/contexts/i18n-context.tsx:65 — i18n-context.I18nProvider has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, ternaries 2 (3 pts), loops 1 (nesting depth added 2). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 7 function items inside it that branch (translateBase, a function literal at line 151, Translation, …). 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 · ApiTimelineIssue.ApiTimelineIssue (cognitive 20) · ×1
  • ApiTimelineIssue.ApiTimelineIssue (cognitive 20) REDACTED:51 — ApiTimelineIssue.ApiTimelineIssue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, ternaries 3 (nesting depth added 1). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 72, 95, 137, …). 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 · Dashboard.Dashboard (cognitive 20) · ×1
  • Dashboard.Dashboard (cognitive 20) daikoku/javascript/src/components/frontend/dashboard/Dashboard.tsx:37 — Dashboard.Dashboard has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 6). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (createApi, a function literal at line 69, a function literal at line 89). 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 · SideBar.TopBar (cognitive 20) · ×1
  • SideBar.TopBar (cognitive 20) daikoku/javascript/src/components/utils/sidebar/SideBar.tsx:77 — SideBar.TopBar has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 16, if/else 3, ternaries 1. Of this number, 16 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · messages.AdminMessages (cognitive 20) · ×1
  • messages.AdminMessages (cognitive 20) daikoku/javascript/src/components/adminbackoffice/messages/messages.tsx:35 — messages.AdminMessages has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (8 pts), ternaries 2, match/switch 1 (nesting depth added 1). Most of this is not in the body itself: 3 of the 20 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 200, maybeReadMessage, sendMessage, …). 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 · CmsApiAction.invokeBlock (cognitive 19) · ×1
  • CmsApiAction.invokeBlock (cognitive 19) REDACTED:195 — CmsApiAction.invokeBlock has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 4 (nesting depth added 9). 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 · ApiController.getVisiblePlan (cognitive 19) · ×1
  • ApiController.getVisiblePlan (cognitive 19) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:547 — ApiController.getVisiblePlan has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (5 pts), boolean chains 4 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiController.getPlanDocumentationPage (cognitive 19) · ×1
  • ApiController.getPlanDocumentationPage (cognitive 19) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:776 — ApiController.getPlanDocumentationPage has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 5 (9 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · DaikokuActionOrApiKey.tryApiKeyAuth (cognitive 19) · ×1
  • DaikokuActionOrApiKey.tryApiKeyAuth (cognitive 19) daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:83 — DaikokuActionOrApiKey.tryApiKeyAuth has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 4 (nesting depth added 9). 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 · PaymentClient.createStripePrice (cognitive 19) · ×1
  • PaymentClient.createStripePrice (cognitive 19) daikoku/app/fr/maif/daikoku/controllers/PaymentClient.scala:302 — PaymentClient.createStripePrice has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (14 pts), match/switch 2 (3 pts), if/else 2 (nesting depth added 11). 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 · DaikokuApiAction.invokeBlock (cognitive 19) · ×1
  • DaikokuApiAction.invokeBlock (cognitive 19) daikoku/app/fr/maif/daikoku/utils/admin.scala:61 — DaikokuApiAction.invokeBlock has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 4 (nesting depth added 9). 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 · MyProfile.TwoFactorAuthentication (cognitive 19) · ×1
  • MyProfile.TwoFactorAuthentication (cognitive 19) daikoku/javascript/src/components/backoffice/me/MyProfile.tsx:19 — MyProfile.TwoFactorAuthentication has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (5 pts), boolean chains 3 (nesting depth added 5). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 5 function items inside it that branch (verify, a function literal at line 31, a function literal at line 68, …). 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 · ApiPost.ApiPost (cognitive 19) · ×1
  • ApiPost.ApiPost (cognitive 19) daikoku/javascript/src/components/frontend/api/ApiPost.tsx:23 — ApiPost.ApiPost has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 8, ternaries 1 (nesting depth added 1). Of this number, 10 points are the body's own statements and 9 belong to 6 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · NotificationController.acceptNotification (cognitive 18) · ×1
  • NotificationController.acceptNotification (cognitive 18) daikoku/app/fr/maif/daikoku/controllers/NotificationController.scala:131 — NotificationController.acceptNotification has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (7 pts), if/else 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LdapSupport.checkConnection (cognitive 18) · ×1
  • LdapSupport.checkConnection (cognitive 18) daikoku/app/fr/maif/daikoku/login/ldap.scala:526 — LdapSupport.checkConnection has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (7 pts), loops 3 (6 pts), if/else 3, 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 · LdapSupport.createUser (cognitive 18) · ×1
  • LdapSupport.createUser (cognitive 18) daikoku/app/fr/maif/daikoku/login/ldap.scala:651 — LdapSupport.createUser has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (4 pts), loops 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AccountCreationService.rejectStep (cognitive 18) · ×1
  • AccountCreationService.rejectStep (cognitive 18) daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:504 — AccountCreationService.rejectStep has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 2 (3 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · diff_match_patch.diff_cleanupSemanticScore (cognitive 18) · ×1
  • diff_match_patch.diff_cleanupSemanticScore (cognitive 18) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:972 — diff_match_patch.diff_cleanupSemanticScore has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, if/else 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 · ApiPricing.CustomMetadataInput (cognitive 18) · ×1
  • ApiPricing.CustomMetadataInput (cognitive 18) REDACTED:344 — ApiPricing.CustomMetadataInput has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 13, if/else 5. Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 8 function items inside it that branch (addFirst, changeKey, addNext, …). 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 · ApiDocumentation.ApiDocumentation (cognitive 18) · ×1
  • ApiDocumentation.ApiDocumentation (cognitive 18) REDACTED:143 — ApiDocumentation.ApiDocumentation has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, ternaries 4 (5 pts), if/else 3 (nesting depth added 1). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 309, flattenDoc, a function literal at line 149, …). 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 · TenantAdminList.AdminList (cognitive 18) · ×1
  • TenantAdminList.AdminList (cognitive 18) daikoku/javascript/src/components/adminbackoffice/tenants/TenantAdminList.tsx:24 — TenantAdminList.AdminList has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 8 function items inside it that branch (a function literal at line 46, a function literal at line 69, adminToSelector, …). 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 · ApiController.getDocumentationPage (cognitive 17) · ×1
  • ApiController.getDocumentationPage (cognitive 17) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:702 — ApiController.getDocumentationPage has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (5 pts), match/switch 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiController.getDocumentationPageRemoteContent (cognitive 17) · ×1
  • ApiController.getDocumentationPageRemoteContent (cognitive 17) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:840 — ApiController.getDocumentationPageRemoteContent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 9). 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 · LoginController.reset2fa (cognitive 17) · ×1
  • LoginController.reset2fa (cognitive 17) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:1373 — LoginController.reset2fa has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 3 (6 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · PaymentClient.archiveStripePrices (cognitive 17) · ×1
  • PaymentClient.archiveStripePrices (cognitive 17) daikoku/app/fr/maif/daikoku/controllers/PaymentClient.scala:100 — PaymentClient.archiveStripePrices has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (10 pts), loops 2 (5 pts), if/else 2 (nesting depth added 9). 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 · DeletionService.deletePlanClosure (cognitive 17) · ×1
  • DeletionService.deletePlanClosure (cognitive 17) REDACTED:787 — DeletionService.deletePlanClosure has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (15 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · CatalogSourceGithub.fetch (cognitive 17) · ×1
  • CatalogSourceGithub.fetch (cognitive 17) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:413 — CatalogSourceGithub.fetch has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · PostgresDataStore.checkDatabase (cognitive 17) · ×1
  • PostgresDataStore.checkDatabase (cognitive 17) REDACTED:824 — PostgresDataStore.checkDatabase has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (14 pts), match/switch 2, if/else 1 (nesting depth added 9). 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 · diff_match_patch.diff_lineMode (cognitive 17) · ×1
  • diff_match_patch.diff_lineMode (cognitive 17) daikoku/app/fr/maif/daikoku/utils/diff_match_patch.java:268 — diff_match_patch.diff_lineMode has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 1 (3 pts), match/switch 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · TestingApiKeyModal.TestingApiKeyModal (cognitive 17) · ×1
  • TestingApiKeyModal.TestingApiKeyModal (cognitive 17) daikoku/javascript/src/contexts/modals/TestingApiKeyModal.tsx:13 — TestingApiKeyModal.TestingApiKeyModal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, ternaries 5, boolean chains 3. Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 10 function items inside it that branch (apiKeyAction, generateApiKey, a function literal at line 133, …). 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 · ApiDocumentationPageAdminApiController.validateWith (cognitive 16) · ×1
  • ApiDocumentationPageAdminApiController.validateWith (cognitive 16) daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:939 — ApiDocumentationPageAdminApiController.validateWith has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (15 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiController.getTeamVisibleApis (cognitive 16) · ×1
  • ApiController.getTeamVisibleApis (cognitive 16) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:361 — ApiController.getTeamVisibleApis has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ApiController.apiSubscriptionAction (cognitive 16) · ×1
  • ApiController.apiSubscriptionAction (cognitive 16) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1944 — ApiController.apiSubscriptionAction has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (15 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · HomeController.cmsPageByPath (cognitive 16) · ×1
  • HomeController.cmsPageByPath (cognitive 16) daikoku/app/fr/maif/daikoku/controllers/HomeController.scala:392 — HomeController.cmsPageByPath has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, match/switch 2 (4 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 · UsagePlan.checkAuthorizedEntities (cognitive 16) · ×1
  • UsagePlan.checkAuthorizedEntities (cognitive 16) daikoku/app/fr/maif/daikoku/domain/apiEntities.scala:395 — UsagePlan.checkAuthorizedEntities has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (12 pts), match/switch 2 (3 pts), if/else 1 (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · CatalogSourceGitlab.fetch (cognitive 16) · ×1
  • CatalogSourceGitlab.fetch (cognitive 16) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:317 — CatalogSourceGitlab.fetch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member family (7 members, 21 shared lines) · ×1
  • Near-duplicate member family (7 members, 21 shared lines) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:571 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:571-634 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:652-731 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:737-821 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:827-888 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:893-957 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1042-1131 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1137-1224 — These 7 members are variants of one another: a block of 21 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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 · Near-duplicate member family (6 members, 24 shared lines) · ×1
  • Near-duplicate member family (6 members, 24 shared lines) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:652 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:652-731 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:737-821 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:827-888 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:893-957 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1042-1131 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1137-1224 — These 6 members are variants of one another: a block of 24 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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 · Near-duplicate member pair (61 shared lines) · ×1
  • Near-duplicate member pair (61 shared lines) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:105 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:105-195 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:203-311 — These two members are variants of one another: 61 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (50 shared lines) · ×1
  • Near-duplicate member pair (50 shared lines) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:313 — daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:313-411 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:223-315 — These two members are variants of one another: 50 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (38 shared lines) · ×1
  • Near-duplicate member pair (38 shared lines) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2138 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2138-2207 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2214-2279 — These two members are variants of one another: 38 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (6 members, 50+ identical tokens) daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:282 — daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:282-302 | daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:305-344 | daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:347-386 | daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:389-409 | daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:412-432 | daikoku/app/fr/maif/daikoku/controllers/OtoroshiSettingsController.scala:435-455 — 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 · Edited copy of a member (75 corresponding lines) · ×1
  • Edited copy of a member (75 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:111 — daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:111-211 | daikoku/app/fr/maif/daikoku/services/AssetsService.scala:199-273 — These two members are one piece of code written twice and then edited apart: 75 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 (80 corresponding lines) · ×1
  • Edited copy of a member (80 corresponding lines) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:416 — daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:416-502 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:320-399 — These two members are one piece of code written twice and then edited apart: 80 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 (61 corresponding lines) · ×1
  • Edited copy of a member (61 corresponding lines) daikoku/app/fr/maif/daikoku/jobs/KeyringSubscriptionExpirationJob.scala:95 — daikoku/app/fr/maif/daikoku/jobs/KeyringSubscriptionExpirationJob.scala:95-155 | daikoku/app/fr/maif/daikoku/jobs/OtoroshiEntitiesVerifierJob.scala:295-360 — These two members are one piece of code written twice and then edited apart: 61 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, 53+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 53+ corresponding lines) REDACTED:198 — REDACTED:198-250 | daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:86-152 | daikoku/app/fr/maif/daikoku/utils/admin.scala:64-130 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 53 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 (42 corresponding lines) · ×1
  • Edited copy of a member (42 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:256 — daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:256-317 | daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:461-502 — These two members are one piece of code written twice and then edited apart: 42 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 (40 corresponding lines) · ×1
  • Edited copy of a member (40 corresponding lines) cli/src/commands/login.rs:29 — cli/src/commands/login.rs:29-75 | cli/src/commands/watch.rs:60-99 — These two members are one piece of code written twice and then edited apart: 40 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 (46 corresponding lines) · ×1
  • Edited copy of a member (46 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:337 — daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:337-382 | daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:389-436 — These two members are one piece of code written twice and then edited apart: 46 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 (47 corresponding lines) · ×1
  • Edited copy of a member (47 corresponding lines) daikoku/app/fr/maif/daikoku/jobs/AbstractJob.scala:122 — daikoku/app/fr/maif/daikoku/jobs/AbstractJob.scala:122-169 | daikoku/app/fr/maif/daikoku/jobs/KeyringSubscriptionExpirationJob.scala:36-82 — These two members are one piece of code written twice and then edited apart: 47 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 (29 corresponding lines) · ×1
  • Edited copy of a member (29 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogController.scala:70 — daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogController.scala:70-98 | daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogController.scala:101-132 — These two members are one piece of code written twice and then edited apart: 29 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 (25 corresponding lines) · ×1
  • Edited copy of a member (25 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1084 — daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1084-1108 | daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1631-1658 — 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 copy of a member (32 corresponding lines) · ×1
  • Edited copy of a member (32 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:301 — daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:301-332 | daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:340-373 — 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 copy of a member (30 corresponding lines) · ×1
  • Edited copy of a member (30 corresponding lines) cli/src/commands/cms.rs:271 — cli/src/commands/cms.rs:271-300 | cli/src/commands/environments.rs:329-360 — 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 copy of a member (36 corresponding lines) · ×1
  • Edited copy of a member (36 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:132 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:132-167 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:388-425 — These two members are one piece of code written twice and then edited apart: 36 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) daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:124 — daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:124-154 | daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:188-222 — 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 (26 corresponding lines) · ×1
  • Edited copy of a member (26 corresponding lines) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:246 — daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:246-271 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:78-110 — These two members are one piece of code written twice and then edited apart: 26 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 (22 corresponding lines) · ×1
  • Edited copy of a member (22 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/MessageController.scala:101 — daikoku/app/fr/maif/daikoku/controllers/MessageController.scala:101-123 | daikoku/app/fr/maif/daikoku/controllers/MessageController.scala:126-147 — 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 (5 members, 17+ corresponding lines) · ×1
  • Edited copies of one member (5 members, 17+ corresponding lines) daikoku/app/fr/maif/daikoku/controllers/JobsController.scala:71 — daikoku/app/fr/maif/daikoku/controllers/JobsController.scala:71-87 | daikoku/app/fr/maif/daikoku/controllers/JobsController.scala:105-126 | daikoku/app/fr/maif/daikoku/controllers/JobsController.scala:129-145 | daikoku/app/fr/maif/daikoku/controllers/JobsController.scala:148-164 | daikoku/app/fr/maif/daikoku/controllers/JobsController.scala:167-183 — These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (19 corresponding lines) · ×1
  • Edited copy of a member (19 corresponding lines) daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:632 — daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:632-651 | daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:663-681 — 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 (3 members, 41+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 41+ corresponding lines) daikoku/app/fr/maif/daikoku/env/evolutions.scala:2275 — daikoku/app/fr/maif/daikoku/env/evolutions.scala:2275-2330 | daikoku/app/fr/maif/daikoku/env/evolutions.scala:2417-2465 | daikoku/app/fr/maif/daikoku/env/evolutions.scala:2518-2558 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 41 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, 15+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 15+ corresponding lines) REDACTED:119 — REDACTED:119-133 | REDACTED:138-156 | REDACTED:161-177 — 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, 18+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 18+ corresponding lines) daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:223 — daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:223-240 | daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:273-290 | daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:294-317 | daikoku/app/fr/maif/daikoku/utils/otoroshi.scala:321-344 — These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 19+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 19+ corresponding lines) daikoku/app/fr/maif/daikoku/utils/emails.scala:137 — daikoku/app/fr/maif/daikoku/utils/emails.scala:137-155 | daikoku/app/fr/maif/daikoku/utils/emails.scala:225-243 | daikoku/app/fr/maif/daikoku/utils/emails.scala:455-474 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 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 (14 corresponding lines) · ×1
  • Edited copy of a member (14 corresponding lines) daikoku/app/fr/maif/daikoku/utils/PemUtils.java:35 — daikoku/app/fr/maif/daikoku/utils/PemUtils.java:35-48 | daikoku/app/fr/maif/daikoku/utils/PemUtils.java:50-63 — 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.
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:185 — REDACTED:185-193 | daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:45-53 | daikoku/app/fr/maif/daikoku/utils/admin.scala:51-59 — 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 copy of a member (11 corresponding lines) · ×1
  • Edited copy of a member (11 corresponding lines) cli/src/helpers.rs:19 — cli/src/helpers.rs:19-29 | cli/src/helpers.rs:33-43 — 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 · Edited copy of a member (10 corresponding lines) · ×1
  • Edited copy of a member (10 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogController.scala:41 — daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogController.scala:41-50 | daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogController.scala:260-272 — 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 copies of one member (3 members, 12+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 12+ corresponding lines) daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:356 — daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:356-368 | daikoku/app/fr/maif/daikoku/controllers/UsersController.scala:158-172 | daikoku/app/fr/maif/daikoku/controllers/UsersController.scala:175-186 — 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, 7+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 7+ corresponding lines) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:987 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:987-995 | daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:370-376 | daikoku/app/fr/maif/daikoku/controllers/TranslationController.scala:60-71 — 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 copy of a member (4 corresponding lines) · ×1
  • Edited copy of a member (4 corresponding lines) daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1309 — daikoku/app/fr/maif/daikoku/controllers/AdminApiController.scala:1309-1312 | daikoku/app/fr/maif/daikoku/controllers/CmsApiController.scala:69-72 — 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.
D4 · Code Duplication · Duplicated block (33–47 lines × 2) · ×1
  • Duplicated block (33–47 lines × 2) daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1039 — daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1039-1085 | daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1899-1931 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1039` 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 (33–44 lines × 2) · ×1
  • Duplicated block (33–44 lines × 2) daikoku/app/fr/maif/daikoku/login/otoroshi.scala:296 — daikoku/app/fr/maif/daikoku/login/otoroshi.scala:296-339 | daikoku/app/fr/maif/daikoku/login/otoroshi.scala:405-437 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/login/otoroshi.scala:296` 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 (57–58 lines × 2) · ×1
  • Duplicated block (57–58 lines × 2) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:662 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:662-718 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:747-804 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:662` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (40 lines × 2) · ×1
  • Duplicated block (40 lines × 2) REDACTED:268 — REDACTED:268-307 | daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:161-200 — 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:268` 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 (39–40 lines × 2) · ×1
  • Duplicated block (39–40 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1071 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1071-1109 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1117-1156 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:1071` 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 (34–35 lines × 2) · ×1
  • Duplicated block (34–35 lines × 2) daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:177 — daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:177-210 | daikoku/app/fr/maif/daikoku/services/AssetsService.scala:239-273 — before extracting anything, compare `daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala` and `daikoku/app/fr/maif/daikoku/services/AssetsService.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 73 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:177` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (35 lines × 2) · ×1
  • Duplicated block (35 lines × 2) daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:785 — daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:785-819 | daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:835-869 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
D4 · Code Duplication · Duplicated block (31–32 lines × 2) · ×1
  • Duplicated block (31–32 lines × 2) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:184 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:184-215 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:227-257 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:184` 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 (24–30 lines × 5) · ×1
  • Duplicated block (24–30 lines × 5) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:521 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:521-550 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:796-820 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:933-956 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1104-1127 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1197-1220 — 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 `daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:521` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (28–29 lines × 2) · ×1
  • Duplicated block (28–29 lines × 2) daikoku/app/fr/maif/daikoku/login/ldap.scala:322 — daikoku/app/fr/maif/daikoku/login/ldap.scala:322-350 | daikoku/app/fr/maif/daikoku/login/ldap.scala:694-721 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/login/ldap.scala:694` 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 (19–27 lines × 2) · ×1
  • Duplicated block (19–27 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2341 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2341-2359 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3170-3196 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:2341` 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 (21–26 lines × 2) · ×1
  • Duplicated block (21–26 lines × 2) daikoku/app/fr/maif/daikoku/jobs/KeyringSubscriptionExpirationJob.scala:129 — daikoku/app/fr/maif/daikoku/jobs/KeyringSubscriptionExpirationJob.scala:129-154 | daikoku/app/fr/maif/daikoku/jobs/OtoroshiEntitiesVerifierJob.scala:336-356 — 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 `daikoku/app/fr/maif/daikoku/jobs/KeyringSubscriptionExpirationJob.scala:129` 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 (21–25 lines × 2) · ×1
  • Duplicated block (21–25 lines × 2) daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:291 — daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:291-315 | daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:482-502 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:291` 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 (40–41 lines × 2) · ×1
  • Duplicated block (40–41 lines × 2) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1044 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1044-1084 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1139-1178 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1044` 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 (24 lines × 2) · ×1
  • Duplicated block (24 lines × 2) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:708 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:708-731 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:865-888 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/authorizations.scala: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.
D4 · Code Duplication · Duplicated block (19–23 lines × 3) · ×1
  • Duplicated block (19–23 lines × 3) daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:282 — daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:282-304 | daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:473-493 | daikoku/app/fr/maif/daikoku/services/AssetsService.scala:411-429 — before extracting anything, compare `daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala` and `daikoku/app/fr/maif/daikoku/services/AssetsService.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 73 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/controllers/AssetsController.scala:282` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (21–23 lines × 2) · ×1
  • Duplicated block (21–23 lines × 2) daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:1825 — daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:1825-1847 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:1937-1957 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:1825` 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 (21–22 lines × 3) · ×1
  • Duplicated block (21–22 lines × 3) daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:400 — daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:400-421 | daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:443-463 | daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:542-562 — 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 `daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:400` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (17–21 lines × 3) · ×1
  • Duplicated block (17–21 lines × 3) daikoku/app/fr/maif/daikoku/login/otoroshi.scala:219 — daikoku/app/fr/maif/daikoku/login/otoroshi.scala:219-239 | daikoku/app/fr/maif/daikoku/login/otoroshi.scala:318-338 | daikoku/app/fr/maif/daikoku/login/otoroshi.scala:420-436 — 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 `daikoku/app/fr/maif/daikoku/login/otoroshi.scala:219` 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 (18–20 lines × 2) · ×1
  • Duplicated block (18–20 lines × 2) daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:110 — daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:110-127 | daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:539-558 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala:110` 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 (15–19 lines × 5) · ×1
  • Duplicated block (15–19 lines × 5) daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:1326 — daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:1326-1340 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:1383-1401 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:1455-1471 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:3344-3358 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:3516-3530 — 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 `daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:1326` 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 (16–19 lines × 2) · ×1
  • Duplicated block (16–19 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:513 — daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:513-531 | daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1672-1687 — 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 `daikoku/app/fr/maif/daikoku/controllers/ConsumptionController.scala:513` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (17–19 lines × 2) · ×1
  • Duplicated block (17–19 lines × 2) REDACTED:194 — REDACTED:194-212 | REDACTED:227-243 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:194` 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 (18 lines × 3) · ×1
  • Duplicated block (18 lines × 3) daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:2695 — daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:2695-2712 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:2725-2742 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:2756-2773 — 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 `daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:2695` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:2694` calls `Field`, `OptionType` and `daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:2724` 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 (17–18 lines × 2) · ×1
  • Duplicated block (17–18 lines × 2) daikoku/app/fr/maif/daikoku/login/ldap.scala:376 — daikoku/app/fr/maif/daikoku/login/ldap.scala:376-393 | daikoku/app/fr/maif/daikoku/login/ldap.scala:432-448 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/login/ldap.scala:376` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (16–18 lines × 2) · ×1
  • Duplicated block (16–18 lines × 2) REDACTED:1883 — REDACTED:1883-1898 | REDACTED:1970-1987 — both copies are in the same file, so extract the 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:1883` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (17 lines × 3) · ×1
  • Duplicated block (17 lines × 3) REDACTED:277 — REDACTED:277-293 | REDACTED:347-363 | daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:170-186 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:277` 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 (15–17 lines × 2) · ×1
  • Duplicated block (15–17 lines × 2) daikoku/app/fr/maif/daikoku/utils/s3.scala:174 — daikoku/app/fr/maif/daikoku/utils/s3.scala:174-190 | daikoku/app/fr/maif/daikoku/utils/s3.scala:333-347 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/utils/s3.scala:174` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (13–15 lines × 5) · ×1
  • Duplicated block (13–15 lines × 5) daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:809 — daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:809-823 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:842-854 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:871-885 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:912-924 | daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:945-959 — 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 `daikoku/app/fr/maif/daikoku/domain/SchemaDefinition.scala:809` 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–15 lines × 2) · ×1
  • Duplicated block (14–15 lines × 2) daikoku/app/fr/maif/daikoku/login/ldap.scala:355 — daikoku/app/fr/maif/daikoku/login/ldap.scala:355-368 | daikoku/app/fr/maif/daikoku/login/ldap.scala:409-423 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/login/ldap.scala:355` 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 (11–14 lines × 2) · ×1
  • Duplicated block (11–14 lines × 2) daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:319 — daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:319-332 | daikoku/app/fr/maif/daikoku/login/oauth.scala:535-545 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `daikoku/app/fr/maif/daikoku/login/oauth.scala:546` calls `orElse` and `daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:333` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (12–13 lines × 8) · ×1
  • Duplicated block (12–13 lines × 8) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:577 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:577-589 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:659-670 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:744-755 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:833-844 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:899-910 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:969-980 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1053-1064 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1148-1159 — all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (12–13 lines × 4) · ×1
  • Duplicated block (12–13 lines × 4) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:677 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:677-689 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:762-774 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:850-861 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:916-927 — 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. 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 (13–14 lines × 3) · ×1
  • Duplicated block (13–14 lines × 3) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:862 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:862-874 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:928-941 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1099-1112 — 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 `daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:928` 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 (11–13 lines × 3) · ×1
  • Duplicated block (11–13 lines × 3) daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:64 — daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:64-76 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala:42-54 | daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceHttp.scala:88-98 — before extracting anything, compare `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala` and `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGitlab.scala` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceGithub.scala:64` 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 (11–13 lines × 2) · ×1
  • Duplicated block (11–13 lines × 2) daikoku/app/fr/maif/daikoku/services/ApiService.scala:1704 — daikoku/app/fr/maif/daikoku/services/ApiService.scala:1704-1716 | daikoku/app/fr/maif/daikoku/services/ApiService.scala:2151-2161 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/services/ApiService.scala:1704` 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 (12 lines × 6) · ×1
  • Duplicated block (12 lines × 6) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:676 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:676-687 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:761-772 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:849-860 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:915-926 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1086-1097 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1180-1191 — all 6 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.
D4 · Code Duplication · Duplicated block (10–12 lines × 2) · ×1
  • Duplicated block (10–12 lines × 2) daikoku/app/fr/maif/daikoku/services/ApiService.scala:313 — daikoku/app/fr/maif/daikoku/services/ApiService.scala:313-324 | daikoku/app/fr/maif/daikoku/services/ApiService.scala:449-458 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/services/ApiService.scala:313` 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 (11 lines × 4) · ×1
  • Duplicated block (11 lines × 4) REDACTED:283 — REDACTED:283-293 | REDACTED:353-363 | REDACTED:468-478 | daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:176-186 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:283` 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–11 lines × 3) · ×1
  • Duplicated block (10–11 lines × 3) daikoku/app/fr/maif/daikoku/controllers/GraphQLController.scala:79 — daikoku/app/fr/maif/daikoku/controllers/GraphQLController.scala:79-88 | daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:462-472 | daikoku/app/fr/maif/daikoku/domain/userEntities.scala:110-120 — 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 `daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:462` 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 (9–11 lines × 2) · ×1
  • Duplicated block (9–11 lines × 2) daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:86 — daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:86-96 | daikoku/app/fr/maif/daikoku/controllers/TenantController.scala:173-181 — 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 `daikoku/app/fr/maif/daikoku/controllers/TeamController.scala:86` 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 (10 lines × 4) · ×1
  • Duplicated block (10 lines × 4) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:674 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:674-683 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:759-768 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1067-1076 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1162-1171 — 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 `daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:674` 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 × 3) · ×1
  • Duplicated block (10 lines × 3) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:309 — daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:309-318 | daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:351-361 | daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:404-414 — 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 `daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:309` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (9–10 lines × 3) · ×1
  • Duplicated block (9–10 lines × 3) daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1090 — daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1090-1099 | daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1111-1119 | daikoku/app/fr/maif/daikoku/domain/CommonServices.scala:1203-1211 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (9–10 lines × 2) · ×1
  • Duplicated block (9–10 lines × 2) daikoku/app/fr/maif/daikoku/audit/audit.scala:638 — daikoku/app/fr/maif/daikoku/audit/audit.scala:638-647 | daikoku/app/fr/maif/daikoku/audit/audit.scala:649-657 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/audit/audit.scala:638` 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 (9 lines × 19) · ×1
  • Duplicated block (9 lines × 19) daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:577 — daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:577-586 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:594-603 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:659-667 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:676-684 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:693-701 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:744-752 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:761-769 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:778-786 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:833-841 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:849-857 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:899-907 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:915-923 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:969-977 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1053-1061 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1069-1077 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1086-1094 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1148-1156 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1164-1172 | daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:1180-1188 — all 19 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 `daikoku/app/fr/maif/daikoku/controllers/authorizations.scala:577` 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 (9 lines × 5) · ×1
  • Duplicated block (9 lines × 5) daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:467 — daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:467-475 | daikoku/app/fr/maif/daikoku/domain/userEntities.scala:115-123 | daikoku/app/fr/maif/daikoku/login/otoroshi.scala:182-195 | daikoku/app/fr/maif/daikoku/login/otoroshi.scala:260-273 | daikoku/app/fr/maif/daikoku/login/otoroshi.scala:360-370 — there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/controllers/LoginController.scala:467` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (6–7 lines × 2) · ×1
  • Duplicated block (6–7 lines × 2) daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:452 — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:452-457 | daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:640-646 — both copies are in the same file, so extract the 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 `daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:452` 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 (5 lines × 3) · ×1
  • Duplicated block (5 lines × 3) daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:88 — daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:88-92 | daikoku/app/fr/maif/daikoku/utils/admin.scala:66-70 | daikoku/app/fr/maif/daikoku/utils/admin.scala:147-151 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:88` 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 before the matched lines, `daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala:87` calls `withTenant` and `daikoku/app/fr/maif/daikoku/utils/admin.scala:146` 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 (10–11 lines × 2) · ×1
  • Duplicated block (10–11 lines × 2) cli/src/models/folder.rs:260 — cli/src/models/folder.rs:260-270 | cli/src/models/folder.rs:280-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.
D4 · Code Duplication · Duplicated block (7–9 lines × 2) · ×1
  • Duplicated block (7–9 lines × 2) cli/src/commands/login.rs:59 — cli/src/commands/login.rs:59-65 | cli/src/commands/watch.rs:79-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. Read the line range as the matched WINDOW rather than a finished unit: at `cli/src/commands/login.rs:59` 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.
PF3 · Async & latency hygiene · Sync-over-async blocking · ×1
  • Sync-over-async blocking daikoku/app/fr/maif/daikoku/services/CmsRenderer.scala:1103 — `render` is async and calls Await.result — a blocking call inside async code stalls the execution-context thread, and every future or fiber scheduled on it for as long as it runs.
R10 · Code Duplication · Duplication concentrated across 5 sibling directories (23 clone groups) · ×1
  • Duplication concentrated across 5 sibling directories (23 clone groups) daikoku/javascript/src/components/adminbackoffice/users/UserEdit.tsx:38 — 23 duplicated blocks under daikoku/javascript/src/components/ have copies in at least two of the sibling directories adminbackoffice, backoffice, frontend, inputs, utils — 19 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 23 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 23 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 23 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 9 sibling directories (9 clone groups) · ×1
  • Duplication concentrated across 9 sibling directories (9 clone groups) daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:80 — 9 duplicated blocks under daikoku/javascript/src/components/adminbackoffice/ have copies in at least two of the sibling directories cms, importexport, loggers, otoroshi, remotecatalogs, sessions (+3 more sibling(s) not listed) — 6 of them are reported below, and 3 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 9 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 9 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 9 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 (5 clone groups) · ×1
  • Duplication concentrated across 2 sibling directories (5 clone groups) daikoku/javascript/src/apps/DaikokuHomeApp.tsx:156 — 5 of the duplicated blocks reported below have copies in at least two of the sibling directories apps, components under daikoku/javascript/src/. 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 (522 lines × 2 locations) · ×1
  • Duplicated block (522 lines × 2 locations) daikoku/public/viewerjs/pdf.js:954 — daikoku/public/viewerjs/pdf.js:954 · REDACTED:954 — 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 (168 lines × 2 locations) · ×1
  • Duplicated block (168 lines × 2 locations) daikoku/public/viewerjs/pdf.js:692 — daikoku/public/viewerjs/pdf.js:692 · REDACTED:692 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Duplicated block (157 lines × 2 locations) · ×1
  • Duplicated block (157 lines × 2 locations) daikoku/public/viewerjs/pdf.js:419 — daikoku/public/viewerjs/pdf.js:419 · REDACTED:419 — 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 (141 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (141 matched lines × 2 locations) daikoku/javascript/src/components/adminbackoffice/users/UserEdit.tsx:38 — daikoku/javascript/src/components/adminbackoffice/users/UserEdit.tsx:38 · daikoku/javascript/src/components/backoffice/me/MyProfile.tsx:242 — the two spans are one implementation copied and then locally edited — 782 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 (134 lines × 2 locations) · ×1
  • Duplicated block (134 lines × 2 locations) daikoku/public/viewerjs/pdf.js:208 — daikoku/public/viewerjs/pdf.js:208 · REDACTED:208 — 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 (130 lines × 2 locations) · ×1
  • Duplicated block (130 lines × 2 locations) daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:133 — daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:133 · REDACTED:201 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
R10 · Code Duplication · Duplicated block (80 lines × 2 locations) · ×1
  • Duplicated block (80 lines × 2 locations) daikoku/public/viewerjs/pdf.js:21 — daikoku/public/viewerjs/pdf.js:21 · REDACTED:21 — 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 (79 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (79 matched lines × 2 locations) daikoku/javascript/src/components/frontend/api/ApiRedoc.tsx:78 — daikoku/javascript/src/components/frontend/api/ApiRedoc.tsx:78 · daikoku/javascript/src/components/frontend/api/ApiTest.tsx:130 — the two spans are one implementation copied and then locally edited — 656 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 (76 lines × 2 locations) · ×1
  • Duplicated block (76 lines × 2 locations) REDACTED:189 — REDACTED:189 · REDACTED:198 — 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 (73 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (73 matched lines × 2 locations) daikoku/javascript/src/components/frontend/Maintenance.tsx:12 — daikoku/javascript/src/components/frontend/Maintenance.tsx:12 · daikoku/javascript/src/components/utils/login.tsx:12 — the two spans are one implementation copied and then locally edited — 389 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 (64 lines × 2 locations) · ×1
  • Duplicated block (64 lines × 2 locations) REDACTED:8685 — REDACTED:8685 · REDACTED:9131 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (60 lines × 2 locations) · ×1
  • Duplicated block (60 lines × 2 locations) REDACTED:40 — REDACTED:40 · REDACTED:55 — 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 (48 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (48 matched lines × 2 locations) REDACTED:7303 — REDACTED:7303 · REDACTED:7606 — the two spans are one implementation copied and then locally edited — 326 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (37 lines × 2 locations) · ×1
  • Duplicated block (37 lines × 2 locations) REDACTED:145 — REDACTED:145 · REDACTED:154 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
R10 · Code Duplication · Duplicated block (36 lines × 2 locations) · ×1
  • Duplicated block (36 lines × 2 locations) REDACTED:35673 — REDACTED:35673 · REDACTED:35725 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (33 lines × 2 locations) · ×1
  • Duplicated block (33 lines × 2 locations) REDACTED:452 — REDACTED:452 · REDACTED:486 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (30 lines × 2 locations) · ×1
  • Duplicated block (30 lines × 2 locations) daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:166 — daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:166 · daikoku/javascript/src/components/backoffice/teams/TeamEdit.tsx:149 — 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 (29 lines × 2 locations) · ×1
  • Duplicated block (29 lines × 2 locations) REDACTED:13939 — REDACTED:13939 · REDACTED:13991 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (28 lines × 2 locations) · ×1
  • Duplicated block (28 lines × 2 locations) REDACTED:8528 — REDACTED:8528 · REDACTED:8974 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (27 lines × 2 locations) · ×1
  • Duplicated block (27 lines × 2 locations) REDACTED:36251 — REDACTED:36251 · REDACTED:36297 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (24 lines × 4 locations) · ×1
  • Duplicated block (24 lines × 4 locations) daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx:102 — daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx:102 · daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx:128 · daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx:154 · daikoku/javascript/src/components/adminbackoffice/tenants/TenantEdit.tsx:183 — all 4 copies are in the same file, 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 (24 lines × 2 locations) · ×1
  • Duplicated block (24 lines × 2 locations) REDACTED:33616 — REDACTED:33616 · REDACTED:33653 — all 2 copies are in the same file, 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 (22 lines × 2 locations) · ×1
  • Duplicated block (22 lines × 2 locations) REDACTED:310 — REDACTED:310 · daikoku/javascript/src/components/backoffice/apikeys/TeamApiKeysForApi.tsx:23 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R2 · Cyclomatic Complexity · Complex function CCITTFaxStream_lookChar (cyclomatic 98, cognitive 324) · ×1
  • Complex function CCITTFaxStream_lookChar (cyclomatic 98, cognitive 324) REDACTED:33244 — CCITTFaxStream_lookChar has cyclomatic complexity 98 and cognitive complexity 324; 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 bidi (cyclomatic 83, cognitive 131) · ×1
  • Complex function bidi (cyclomatic 83, cognitive 131) REDACTED:38859 — bidi has cyclomatic complexity 83 and cognitive complexity 131; 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 Font_checkAndRepair (cyclomatic 72, cognitive 110) · ×1
  • Complex function Font_checkAndRepair (cyclomatic 72, cognitive 110) REDACTED:17326 — Font_checkAndRepair has cyclomatic complexity 72 and cognitive complexity 110; 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 parse (cyclomatic 60, cognitive 99) · ×1
  • Complex function parse (cyclomatic 60, cognitive 99) REDACTED:21759 — parse has cyclomatic complexity 60 and cognitive complexity 99; 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 parse (cyclomatic 59, cognitive 79) · ×1
  • Complex function parse (cyclomatic 59, cognitive 79) REDACTED:35041 — parse has cyclomatic complexity 59 and cognitive complexity 79; 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 sanitizeTTProgram (cyclomatic 58, cognitive 124) · ×1
  • Complex function sanitizeTTProgram (cyclomatic 58, cognitive 124) REDACTED:17942 — sanitizeTTProgram has cyclomatic complexity 58 and cognitive complexity 124; 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 PostScriptEvaluator_execute (cyclomatic 57, cognitive 36) · ×1
  • Complex function PostScriptEvaluator_execute (cyclomatic 57, cognitive 36) REDACTED:5951 — PostScriptEvaluator_execute has cyclomatic complexity 57 and cognitive complexity 36; 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 Font (cyclomatic 53, cognitive 81) · ×1
  • Complex function Font (cyclomatic 53, cognitive 81) REDACTED:16579 — Font has cyclomatic complexity 53 and cognitive complexity 81; 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 Type1CharString_convert (cyclomatic 51, cognitive 81) · ×1
  • Complex function Type1CharString_convert (cyclomatic 51, cognitive 81) REDACTED:19077 — Type1CharString_convert has cyclomatic complexity 51 and cognitive complexity 81; 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 next (cyclomatic 51, cognitive 54) · ×1
  • Complex function next (cyclomatic 51, cognitive 54) REDACTED:11195 — next has cyclomatic complexity 51 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function Parser_findDCTDecodeInlineStreamEnd (cyclomatic 47, cognitive 12) · ×1
  • Complex function Parser_findDCTDecodeInlineStreamEnd (cyclomatic 47, cognitive 12) REDACTED:30319 — Parser_findDCTDecodeInlineStreamEnd has cyclomatic complexity 47 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 next (cyclomatic 44, cognitive 79) · ×1
  • Complex function next (cyclomatic 44, cognitive 79) REDACTED:11601 — next has cyclomatic complexity 44 and cognitive complexity 79; 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 PostScriptCompiler_compile (cyclomatic 44, cognitive 64) · ×1
  • Complex function PostScriptCompiler_compile (cyclomatic 44, cognitive 64) REDACTED:6379 — PostScriptCompiler_compile has cyclomatic complexity 44 and cognitive complexity 64; 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 JpxImage_parseCodestream (cyclomatic 43, cognitive 80) · ×1
  • Complex function JpxImage_parseCodestream (cyclomatic 43, cognitive 80) REDACTED:35622 — JpxImage_parseCodestream has cyclomatic complexity 43 and cognitive complexity 80; 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 Lexer_getObj (cyclomatic 42, cognitive 28) · ×1
  • Complex function Lexer_getObj (cyclomatic 42, cognitive 28) REDACTED:31034 — Lexer_getObj has cyclomatic complexity 42 and cognitive complexity 28; 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 ApiHome (cyclomatic 39, cognitive 29) · ×1
  • Complex function ApiHome (cyclomatic 39, cognitive 29) daikoku/javascript/src/components/frontend/api/ApiHome.tsx:18 — ApiHome has cyclomatic complexity 39 and cognitive complexity 29; 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 compileType3Glyph (cyclomatic 38, cognitive 73) · ×1
  • Complex function compileType3Glyph (cyclomatic 38, cognitive 73) daikoku/public/viewerjs/pdf.js:3502 — compileType3Glyph has cyclomatic complexity 38 and cognitive complexity 73; 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 readCmapTable (cyclomatic 37, cognitive 64) · ×1
  • Complex function readCmapTable (cyclomatic 37, cognitive 64) REDACTED:17370 — readCmapTable has cyclomatic complexity 37 and cognitive complexity 64; 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 CFFParser_parseCharStrings (cyclomatic 35, cognitive 83) · ×1
  • Complex function CFFParser_parseCharStrings (cyclomatic 35, cognitive 83) REDACTED:20386 — CFFParser_parseCharStrings has cyclomatic complexity 35 and cognitive complexity 83; 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 decodeBitmap (cyclomatic 35, cognitive 58) · ×1
  • Complex function decodeBitmap (cyclomatic 35, cognitive 58) REDACTED:37867 — decodeBitmap has cyclomatic complexity 35 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function ColorSpace_parseToIR (cyclomatic 35, cognitive 28) · ×1
  • Complex function ColorSpace_parseToIR (cyclomatic 35, cognitive 28) REDACTED:6758 — ColorSpace_parseToIR has cyclomatic complexity 35 and cognitive complexity 28; 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 Lexer_getString (cyclomatic 33, cognitive 29) · ×1
  • Complex function Lexer_getString (cyclomatic 33, cognitive 29) REDACTED:30874 — Lexer_getString has cyclomatic complexity 33 and cognitive complexity 29; 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 putBinaryImageData (cyclomatic 32, cognitive 97) · ×1
  • Complex function putBinaryImageData (cyclomatic 32, cognitive 97) daikoku/public/viewerjs/pdf.js:3745 — putBinaryImageData has cyclomatic complexity 32 and cognitive complexity 97; 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 Type1Parser_extractFontProgram (cyclomatic 32, cognitive 35) · ×1
  • Complex function Type1Parser_extractFontProgram (cyclomatic 32, cognitive 35) REDACTED:19487 — Type1Parser_extractFontProgram has cyclomatic complexity 32 and cognitive complexity 35; 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 PartialEvaluator_setGState (cyclomatic 32, cognitive 11) · ×1
  • Complex function PartialEvaluator_setGState (cyclomatic 32, cognitive 11) REDACTED:10921 — PartialEvaluator_setGState has cyclomatic complexity 32 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 FlateStream_readBlock (cyclomatic 31, cognitive 60) · ×1
  • Complex function FlateStream_readBlock (cyclomatic 31, cognitive 60) REDACTED:31883 — FlateStream_readBlock has cyclomatic complexity 31 and cognitive complexity 60; 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 PostScriptLexer_getToken (cyclomatic 30, cognitive 17) · ×1
  • Complex function PostScriptLexer_getToken (cyclomatic 30, cognitive 17) REDACTED:31324 — PostScriptLexer_getToken has cyclomatic complexity 30 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 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 PartialEvaluator_translateFont (cyclomatic 29, cognitive 44) · ×1
  • Complex function PartialEvaluator_translateFont (cyclomatic 29, cognitive 44) REDACTED:12177 — PartialEvaluator_translateFont has cyclomatic complexity 29 and cognitive complexity 44; 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 createOS2Table (cyclomatic 29, cognitive 31) · ×1
  • Complex function createOS2Table (cyclomatic 29, cognitive 31) REDACTED:17121 — createOS2Table has cyclomatic complexity 29 and cognitive complexity 31; 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 transformComponents (cyclomatic 28, cognitive 115) · ×1
  • Complex function transformComponents (cyclomatic 28, cognitive 115) REDACTED:36848 — transformComponents has cyclomatic complexity 28 and cognitive complexity 115; 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 compileGlyf (cyclomatic 28, cognitive 58) · ×1
  • Complex function compileGlyf (cyclomatic 28, cognitive 58) REDACTED:21588 — compileGlyf has cyclomatic complexity 28 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function Font_buildToUnicode (cyclomatic 28, cognitive 52) · ×1
  • Complex function Font_buildToUnicode (cyclomatic 28, cognitive 52) REDACTED:18660 — Font_buildToUnicode has cyclomatic complexity 28 and cognitive complexity 52; 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 decodeTextRegion (cyclomatic 27, cognitive 84) · ×1
  • Complex function decodeTextRegion (cyclomatic 27, cognitive 84) REDACTED:38160 — decodeTextRegion has cyclomatic complexity 27 and cognitive complexity 84; 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 processSegment (cyclomatic 27, cognitive 36) · ×1
  • Complex function processSegment (cyclomatic 27, cognitive 36) REDACTED:38417 — processSegment has cyclomatic complexity 27 and cognitive complexity 36; 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 cell (cyclomatic 27, cognitive 19) · ×1
  • Complex function cell (cyclomatic 27, cognitive 19) REDACTED:1895 — cell has cyclomatic complexity 27 and cognitive complexity 19; 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 PDFImage (cyclomatic 26, cognitive 34) · ×1
  • Complex function PDFImage (cyclomatic 26, cognitive 34) REDACTED:26613 — PDFImage has cyclomatic complexity 26 and cognitive complexity 34; 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 CanvasGraphics_showText (cyclomatic 25, cognitive 40) · ×1
  • Complex function CanvasGraphics_showText (cyclomatic 25, cognitive 40) daikoku/public/viewerjs/pdf.js:4643 — CanvasGraphics_showText has cyclomatic complexity 25 and cognitive complexity 40; 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 Parser_makeFilter (cyclomatic 25, cognitive 29) · ×1
  • Complex function Parser_makeFilter (cyclomatic 25, cognitive 29) REDACTED:30662 — Parser_makeFilter has cyclomatic complexity 25 and cognitive complexity 29; 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 CipherTransformFactory (cyclomatic 25, cognitive 22) · ×1
  • Complex function CipherTransformFactory (cyclomatic 25, cognitive 22) REDACTED:9645 — CipherTransformFactory has cyclomatic complexity 25 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 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 PartialEvaluator_extractWidths (cyclomatic 24, cognitive 69) · ×1
  • Complex function PartialEvaluator_extractWidths (cyclomatic 24, cognitive 69) REDACTED:11942 — PartialEvaluator_extractWidths has cyclomatic complexity 24 and cognitive complexity 69; 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 · daikoku/public/viewerjs/pdf.js · ×1
  • daikoku/public/viewerjs/pdf.js: 7160 lines of code daikoku/public/viewerjs/pdf.js:1 — daikoku/public/viewerjs/pdf.js has 7160 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 · daikoku/javascript/src/services/index.ts · ×1
  • daikoku/javascript/src/services/index.ts: 2584 lines of code daikoku/javascript/src/services/index.ts:1 — daikoku/javascript/src/services/index.ts has 2584 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 · REDACTED · ×1
  • REDACTED: 2228 lines of code REDACTED:1 — REDACTED has 2228 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 · daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx · ×1
  • daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx: 1006 lines of code daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx:1 — daikoku/javascript/src/components/backoffice/notifications/NotificationList.tsx has 1006 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 · REDACTED · ×1
  • REDACTED: 963 lines of code REDACTED:1 — REDACTED has 963 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 · daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx · ×1
  • daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx: 875 lines of code daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx:1 — daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx has 875 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 · daikoku/javascript/src/components/inputs/DynamicTable.tsx · ×1
  • daikoku/javascript/src/components/inputs/DynamicTable.tsx: 792 lines of code daikoku/javascript/src/components/inputs/DynamicTable.tsx:1 — daikoku/javascript/src/components/inputs/DynamicTable.tsx has 792 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 · daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx · ×1
  • daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx: 690 lines of code daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx:1 — daikoku/javascript/src/components/backoffice/apis/SubscriptionProcessEditor.tsx has 690 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 · REDACTED · ×1
  • REDACTED: 652 lines of code REDACTED:1 — REDACTED has 652 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 · daikoku/javascript/src/types/api.ts · ×1
  • daikoku/javascript/src/types/api.ts: 617 lines of code daikoku/javascript/src/types/api.ts:1 — daikoku/javascript/src/types/api.ts has 617 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 · daikoku/javascript/src/components/backoffice/me/MyProfile.tsx · ×1
  • daikoku/javascript/src/components/backoffice/me/MyProfile.tsx: 574 lines of code daikoku/javascript/src/components/backoffice/me/MyProfile.tsx:1 — daikoku/javascript/src/components/backoffice/me/MyProfile.tsx has 574 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 · daikoku/javascript/src/contexts/navContext.tsx · ×1
  • daikoku/javascript/src/contexts/navContext.tsx: 531 lines of code daikoku/javascript/src/contexts/navContext.tsx:1 — daikoku/javascript/src/contexts/navContext.tsx has 531 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 · REDACTED · ×1
  • REDACTED: 526 lines of code REDACTED:1 — REDACTED has 526 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 · daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx · ×1
  • daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx: 501 lines of code daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx:1 — daikoku/javascript/src/components/adminbackoffice/teams/TeamList.tsx has 501 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 · daikoku/javascript/src/apps/DaikokuApp.tsx · ×1
  • daikoku/javascript/src/apps/DaikokuApp.tsx: 471 lines of code daikoku/javascript/src/apps/DaikokuApp.tsx:1 — daikoku/javascript/src/apps/DaikokuApp.tsx has 471 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 · REDACTED · ×1
  • REDACTED: 459 lines of code REDACTED:1 — REDACTED has 459 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 · daikoku/javascript/src/components/backoffice/assets/AssetsList.tsx · ×1
  • daikoku/javascript/src/components/backoffice/assets/AssetsList.tsx: 441 lines of code daikoku/javascript/src/components/backoffice/assets/AssetsList.tsx:1 — daikoku/javascript/src/components/backoffice/assets/AssetsList.tsx has 441 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 · daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx · ×1
  • daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx: 428 lines of code daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx:1 — daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx has 428 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 · daikoku/javascript/src/components/adminbackoffice/tenants/forms/AutenticationForm.tsx · ×1
  • daikoku/javascript/src/components/adminbackoffice/tenants/forms/AutenticationForm.tsx: 423 lines of code daikoku/javascript/src/components/adminbackoffice/tenants/forms/AutenticationForm.tsx:1 — daikoku/javascript/src/components/adminbackoffice/tenants/forms/AutenticationForm.tsx 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 · daikoku/javascript/src/components/adminbackoffice/remotecatalogs/CatalogRuns.tsx · ×1
  • daikoku/javascript/src/components/adminbackoffice/remotecatalogs/CatalogRuns.tsx: 412 lines of code daikoku/javascript/src/components/adminbackoffice/remotecatalogs/CatalogRuns.tsx:1 — daikoku/javascript/src/components/adminbackoffice/remotecatalogs/CatalogRuns.tsx has 412 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R6 · Tooling · This package's lint script runs in no CI job · ×1
  • This package's lint script runs in no CI job REDACTED:11 — The package in `daikoku/javascript` declares the lint script `lint` (`oxlint src/`), but no step of this repository's CI runs it, by name, through another script, a Makefile target or a workspace runner, and no CI step runs the linter over the package itself. The rules it sets are enforced nowhere a pull request can fail. Run it in CI: a step that runs `npm run lint` in `daikoku/javascript` (or the workspace's task runner).
R7 · Dead Code · Dead file (~89 LoC) · ×1
  • Dead file (~89 LoC) manual/src/components/DocumentationThemeHub/index.js — no import path from any entry point (49 application, 16 tooling, 39 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 (~71 LoC) · ×1
  • Dead file (~71 LoC) daikoku/javascript/src/contexts/modals/SessionModal.tsx — no import path from any entry point (49 application, 16 tooling, 39 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) manual/src/components/HomepageFeatures/index.js — no import path from any entry point (49 application, 16 tooling, 39 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) daikoku/javascript/src/components/adminbackoffice/tenants/MailsDescriptions/fr.ts — no import path from any entry point (49 application, 16 tooling, 39 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 (~56 LoC) · ×1
  • Dead file (~56 LoC) daikoku/javascript/src/services/customize.ts — no import path from any entry point (49 application, 16 tooling, 39 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 (~37 LoC) · ×1
  • Dead file (~37 LoC) daikoku/javascript/scripts/serve.ts — no import path from any entry point (49 application, 16 tooling, 39 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 (~29 LoC) · ×1
  • Dead file (~29 LoC) daikoku/javascript/scripts/build.ts — no import path from any entry point (49 application, 16 tooling, 39 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 (~20 LoC) · ×1
  • Dead file (~20 LoC) daikoku/javascript/src/components/utils/graphqlUtils.ts — no import path from any entry point (49 application, 16 tooling, 39 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 (~19 LoC) · ×1
  • Dead file (~19 LoC) manual/src/components/HomepageDaikokuDescription/index.js — no import path from any entry point (49 application, 16 tooling, 39 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 (~16 LoC) · ×1
  • Dead file (~16 LoC) daikoku/javascript/src/components/utils/sidebar/Breadcrumb.tsx — no import path from any entry point (49 application, 16 tooling, 39 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 · Unlisted import '@docusaurus/plugin-content-docs' · ×1
  • Unlisted import '@docusaurus/plugin-content-docs' manual/sidebars.js:14 — Imported only as a TYPE and declared in no reachable REDACTED. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it — but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning REDACTED.
R8 · Dependency Hygiene · Unused dependency '@esbuild-plugins/node-globals-polyfill' · ×1
  • Unused dependency '@esbuild-plugins/node-globals-polyfill' REDACTED:69 — Declared in REDACTED 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 'brace' · ×1
  • Unused dependency 'brace' REDACTED:30 — Declared in REDACTED 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 'es6-shim' · ×1
  • Unused dependency 'es6-shim' REDACTED:33 — Declared in REDACTED 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 'get-value' · ×1
  • Unused dependency 'get-value' REDACTED:34 — Declared in REDACTED 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 'history' · ×1
  • Unused dependency 'history' REDACTED:38 — Declared in REDACTED 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 'json5' · ×1
  • Unused dependency 'json5' REDACTED:41 — Declared in REDACTED 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 'popper.js' · ×1
  • Unused dependency 'popper.js' REDACTED:46 — Declared in REDACTED 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 'rc-util' · ×1
  • Unused dependency 'rc-util' REDACTED:47 — Declared in REDACTED 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 'react-modal' · ×1
  • Unused dependency 'react-modal' REDACTED:51 — Declared in REDACTED 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 'react-step-wizard' · ×1
  • Unused dependency 'react-step-wizard' REDACTED:56 — Declared in REDACTED 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 'set-value' · ×1
  • Unused dependency 'set-value' REDACTED:60 — Declared in REDACTED 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 'util' · ×1
  • Unused dependency 'util' REDACTED:64 — Declared in REDACTED 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 'vite-plugin-simple-html' · ×1
  • Unused dependency 'vite-plugin-simple-html' REDACTED:90 — Declared in REDACTED 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 '@docusaurus/module-type-aliases' · ×1
  • Unused dependency '@docusaurus/module-type-aliases' manual/package.json:29 — Declared in manual/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 'docusaurus-lunr-search' · ×1
  • Unused dependency 'docusaurus-lunr-search' manual/package.json:22 — Declared in manual/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 · Weak hash algorithm · ×1
  • Weak hash algorithm daikoku/app/fr/maif/daikoku/utils/string.scala:14 — 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+ (`MessageDigest.getInstance("SHA-256")`) 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.
X25 · Inert configuration knob · Configuration option is read nowhere · ×1
  • Configuration option is read nowhere cli/src/models/folder.rs:22 — `CmsFile.daikoku_data` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Minor — 117 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×14
  • Duplicated predicate daikoku/javascript/src/contexts/modals/Alert.tsx:33 — `!isString(res) && !isFunction(res) && res` appears character-identically in 2 files — daikoku/javascript/src/contexts/modals/Alert.tsx, daikoku/javascript/src/contexts/modals/Confirm.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:671 — `!selectedEnvironment && environmentsQuery.isLoading` appears character-identically in 3 files — REDACTED, daikoku/javascript/src/components/frontend/api/ApiRedoc.tsx, daikoku/javascript/src/components/frontend/api/ApiTest.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate daikoku/javascript/src/components/utils/sidebar/SideBar.tsx:117 — `connectedUser.isDaikokuAdmin || isTenantAdmin` appears character-identically in 2 files — daikoku/javascript/src/components/utils/sidebar/SideBar.tsx, daikoku/javascript/src/components/utils/sidebar/panels/SettingsPanel.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate daikoku/javascript/src/components/frontend/api/ApiRedoc.tsx:70 — `connectedUser.isGuest && tenant.apiReferenceHideForGuest` appears character-identically in 2 files — daikoku/javascript/src/components/frontend/api/ApiRedoc.tsx, daikoku/javascript/src/components/frontend/api/ApiTest.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:221 — `error && typeof error === 'object' && 'error' in error && typeof error.error === 'string'` appears character-identically in 2 files — REDACTED, daikoku/javascript/src/components/backoffice/apis/TeamApiSubscriptions.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate daikoku/javascript/src/components/utils/ColorThemeMigrationAlert.tsx:29 — `isTenantAdmin || connectedUser.isDaikokuAdmin` appears character-identically in 2 files — daikoku/javascript/src/components/utils/ColorThemeMigrationAlert.tsx, daikoku/javascript/src/components/utils/sidebar/panels/SettingsPanel.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate daikoku/javascript/src/components/backoffice/billing/TeamBilling.tsx:148 — `mostRecentConsumption && formatDate(mostRecentConsumption.to, translate('date.locale'), translate('date.format'))` appears character-identically in 2 files — daikoku/javascript/src/components/backoffice/billing/TeamBilling.tsx, daikoku/javascript/src/components/backoffice/billing/TeamIncome.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate daikoku/javascript/src/components/frontend/dashboard/ApiList.tsx:55 — `myTeamsRequest.data && !isError(myTeamsRequest.data)` appears character-identically in 4 files — daikoku/javascript/src/components/frontend/dashboard/ApiList.tsx, daikoku/javascript/src/components/frontend/dashboard/Dashboard.tsx, daikoku/javascript/src/components/utils/sidebar/panels/SearchPanel.tsx, daikoku/javascript/src/components/utils/sidebar/panels/TeamPanel.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:45 — `pageRequest.data && !isError(pageRequest.data)` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate daikoku/javascript/src/contexts/modals/Confirm.tsx:40 — `props.cancelLabel || translate('Cancel')` appears character-identically in 2 files — daikoku/javascript/src/contexts/modals/Confirm.tsx, daikoku/javascript/src/contexts/modals/Prompt.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate daikoku/javascript/src/components/adminbackoffice/teams/TeamMembers.tsx:22 — `queryTeam.data && !isError(queryTeam.data)` appears character-identically in 2 files — daikoku/javascript/src/components/adminbackoffice/teams/TeamMembers.tsx, daikoku/javascript/src/contexts/navContext.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:673 — `selectedEnvironment && environmentsQuery.data` appears character-identically in 3 files — REDACTED, daikoku/javascript/src/components/frontend/api/ApiRedoc.tsx, daikoku/javascript/src/components/frontend/api/ApiTest.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate daikoku/javascript/src/components/utils/function.tsx:132 — `value && typeof value.then === 'function'` appears character-identically in 3 files — daikoku/javascript/src/components/utils/function.tsx, daikoku/public/viewerjs/pdf.js, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate daikoku/app/fr/maif/daikoku/controllers/ApiController.scala:3703 — `api.authorizedTeams .contains(team.id) || api.team == team.id` appears character-identically in 2 files — daikoku/app/fr/maif/daikoku/controllers/ApiController.scala, daikoku/app/fr/maif/daikoku/domain/CommonServices.scala. 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.
IC1 · Incompleteness & stubs · Empty method body · ×13
  • Empty method body daikoku/javascript/src/components/backoffice/messages/context.tsx:18 — `getPreviousMessages` has an empty body — confirm it's an intentional no-op and not an unfinished method.
  • Empty method body daikoku/javascript/src/contexts/globalContext.tsx:76 — `toggleExpertMode` has an empty body — confirm it's an intentional no-op and not an unfinished method.
  • Empty method body daikoku/javascript/src/contexts/globalContext.tsx:79 — `toggleTheme` has an empty body — confirm it's an intentional no-op and not an unfinished method.
  • Empty method body daikoku/javascript/src/contexts/i18n-context.tsx:14 — `setLanguage` has an empty body — confirm it's an intentional no-op and not an unfinished method.
  • Empty method body daikoku/javascript/src/contexts/i18n-context.tsx:16 — `setTranslationMode` has an empty body — confirm it's an intentional no-op and not an unfinished method.
  • Empty method body daikoku/javascript/src/contexts/navUtils.ts:31 — `addMenu` has an empty body — confirm it's an intentional no-op and not an unfinished method.
  • Empty method body daikoku/javascript/src/contexts/navUtils.ts:32 — `setMenu` has an empty body — confirm it's an intentional no-op and not an unfinished method.
  • Empty method body daikoku/javascript/src/contexts/navUtils.ts:34 — `setMode` has an empty body — confirm it's an intentional no-op and not an unfinished method.
  • Empty method body daikoku/javascript/src/contexts/navUtils.ts:36 — `setOffice` has an empty body — confirm it's an intentional no-op and not an unfinished method.
  • Empty method body daikoku/javascript/src/contexts/navUtils.ts:37 — `setApi` has an empty body — confirm it's an intentional no-op and not an unfinished method.
  • Empty method body daikoku/javascript/src/contexts/navUtils.ts:38 — `setApiGroup` has an empty body — confirm it's an intentional no-op and not an unfinished method.
  • Empty method body daikoku/javascript/src/contexts/navUtils.ts:39 — `setTeam` has an empty body — confirm it's an intentional no-op and not an unfinished method.
  • Empty method body daikoku/javascript/src/contexts/navUtils.ts:40 — `setTenant` has an empty body — confirm it's an intentional no-op and not an unfinished method.
GD1 · Unfinished & placeholder code · Placeholder literal left in code · ×10
  • Placeholder literal left in code daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:49 — A placeholder string ("Lorem ipsum dolor sit amet, consectetur …") is still in shipped code — typical of generated boilerplate that was never filled in.
  • Placeholder literal left in code daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:50 — A placeholder string ("Lorem ipsum dolor sit amet, consectetur …") is still in shipped code — typical of generated boilerplate that was never filled in.
  • Placeholder literal left in code daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:156 — A placeholder string ("Lorem Ipsum") is still in shipped code — typical of generated boilerplate that was never filled in.
  • Placeholder literal left in code daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:157 — A placeholder string ("Lorem Ipsum") is still in shipped code — typical of generated boilerplate that was never filled in.
  • Placeholder literal left in code daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:165 — A placeholder string ("Long Lorem Ipsum") is still in shipped code — typical of generated boilerplate that was never filled in.
  • Placeholder literal left in code daikoku/javascript/src/components/backoffice/apis/TeamApiDocumentation.tsx:166 — A placeholder string ("Long Lorem Ipsum") is still in shipped code — typical of generated boilerplate that was never filled in.
  • Placeholder literal left in code REDACTED:224 — A placeholder string ("Lorem Ipsum") is still in shipped code — typical of generated boilerplate that was never filled in.
  • Placeholder literal left in code REDACTED:225 — A placeholder string ("Lorem Ipsum") is still in shipped code — typical of generated boilerplate that was never filled in.
  • Placeholder literal left in code REDACTED:233 — A placeholder string ("Long Lorem Ipsum") is still in shipped code — typical of generated boilerplate that was never filled in.
  • Placeholder literal left in code REDACTED:234 — A placeholder string ("Long Lorem Ipsum") is still in shipped code — typical of generated boilerplate that was never filled in.
D31 · IaC & Container Security · Low IaC · ×9
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D24 · Comment Value · redundant comment · ×6
  • redundant comment REDACTED:479 — "__html: converter.makeHtml(props.page.content || content)," repeats the code it sits on: 6 of its 6 words (html, converter, make, props, page, content) are already in `__html: converter.makeHtml(props.page.remoteContentEnabled ? content : props.page.content),`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment daikoku/javascript/tests/specs-perf/perf.spec.ts:99 — "Plans are referenced by the API via possibleUsagePlans array" repeats the code it sits on: 5 of its 6 words (plans, api, possible, usage, array) are already in `await withDb(client => client.query(`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment REDACTED:4243 — "Recursively get other XRefs 'XRefStm', if any" repeats the code it sits on: 4 of its 5 words (get, refs, ref, stm) are already in `obj = dict.get('XRefStm');`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment REDACTED:11783 — "switch" only labels the closing brace of the switch. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment REDACTED:11784 — "while" only labels the closing brace of the while. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment REDACTED:17213 — "usLastCharIndex" repeats the code it sits on: 3 of its 3 words (last, char, index) are already in `string16(lastCharIndex || properties.lastChar) +`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
D28 · Secrets (history) · REDACTED · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Low CVE · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D34 · Knowledge Freshness · Orphaned file · ×3
  • Orphaned file daikoku/javascript/src/components/frontend/Maintenance.tsx: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 daikoku/app/fr/maif/daikoku/utils/FileChecker.java: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 daikoku/app/fr/maif/daikoku/utils/PemUtils.java: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 · ×2
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 32 significant file(s) lose their only recent owner: REDACTED, daikoku/app/fr/maif/daikoku/audit/audit.scala, daikoku/javascript/src/components/inputs/DynamicTable.tsx, daikoku/app/fr/maif/daikoku/controllers/TenantController.scala, REDACTED, daikoku/app/fr/maif/daikoku/login/otoroshi.scala, daikoku/app/fr/maif/daikoku/services/AccountCreationService.scala, daikoku/app/fr/maif/daikoku/controllers/EntitiesController.scala (+24 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 9 significant file(s) lose their only recent owner: daikoku/javascript/src/components/adminbackoffice/tenants/forms/RemoteCatalogsForm.tsx, cli/src/commands/watch.rs, daikoku/javascript/src/components/adminbackoffice/remotecatalogs/CatalogRuns.tsx, daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogTokenController.scala, daikoku/app/fr/maif/daikoku/services/catalog/RemoteEntity.scala, daikoku/javascript/src/components/adminbackoffice/remotecatalogs/ResourceLoader.tsx, daikoku/app/fr/maif/daikoku/controllers/RemoteCatalogAdminApiController.scala, daikoku/app/fr/maif/daikoku/services/catalog/sources/CatalogSourceFile.scala (+1 more). Pair on, review, or document these before any departure.
D19 · Documentation Quality · Documentation · ×2
  • 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.
  • Documentation: no build, run or usage example cli/README.md:1 — `cli` is a binary crate (`[[bin]]` in `Cargo.toml`) and neither `cli/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.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×2
  • Projects may be oversized for their cohesion daikoku/build.sbt:1 — `daikoku` (65322 LoC, 888 module-visible types across 19 directories) overshoots its size bounds. 2 of 5 build unit(s) (Cargo, npm, sbt) overshoot their size bounds, lowering Project Cohesion to 2.0/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
  • Projects may be oversized for their cohesion REDACTED:1 — `daikoku/javascript` (35702 LoC, 340 module-visible types across 44 directories) overshoots its size bounds. 2 of 5 build unit(s) (Cargo, npm, sbt) overshoot their size bounds, lowering Project Cohesion to 2.0/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
X7 · Silent fallback defaults · Silent fallback default in catch · ×2
  • Silent fallback default in catch daikoku/javascript/src/components/frontend/api/ApiRedoc.tsx:64 — `ApiRedoc` swallows every exception into `return "openAPI.yaml"` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch daikoku/javascript/src/components/adminbackoffice/remotecatalogs/CatalogRuns.tsx:52 — `useRunDate.<returned closure>` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
AX6 · Interface segregation · Fat interface · ×1
  • Fat interface: DataStore (40 abstract members) REDACTED:2631 — `DataStore` declares 40 abstract members: `start`, `stop`, `isEmpty`, `tenantRepo`, `userRepo`, `teamRepo`, `apiRepo`, `apiSubscriptionRepo`, `keyringRepo`, `apiDocumentationPageRepo`, `apiPostRepo`, `apiIssueRepo`, `notificationRepo`, `userSessionRepo`, `auditTrailRepo`, `consumptionRepo`, `translationRepo`, `passwordResetRepo`, `accountCreationRepo`, `messageRepo`, `cmsRepo`, `assetRepo`, `remoteCatalogRepo`, `remoteCatalogRunRepo`, `operationRepo`, `emailVerificationRepo`, `evolutionRepo`, `subscriptionDemandRepo`, `stepValidatorRepo`, `usagePlanRepo`, `reportsInfoRepo`, `apiSubscriptionTransferRepo`, `JobInformationRepo`, `exportAsStream`, `importFromStream`, `clear`, `queryOneRaw`, `queryRaw`, `queryString`, `withTransaction`. Counted over its ABSTRACT members — a `def` with no body or a `val`/`var` with no initializer, once per signature; concrete members, private and protected members, and members of a companion `object` are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
D13 · REDACTED Scanning · REDACTED · ×1
  • REDACTED
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 1 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 (42 single-owned of 229 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; 229 of the 367 production source files in this repository met that bar). They are anonymized user #3 (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: daikoku/javascript/src/components/backoffice/apikeys/SimpleApiKeyCard.tsx.
D28 · Secrets (history) · Rotate the exposed credentials · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1
  • Further orphaned files (smaller) — 3 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: daikoku/javascript/src/components/frontend/Maintenance.tsx, daikoku/app/fr/maif/daikoku/utils/FileChecker.java, daikoku/app/fr/maif/daikoku/utils/PemUtils.java (4 orphaned of 230 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; 230 of the 367 production source files in this repository met that bar). 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
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.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:16 — No static application security testing detected. For this repository's stack, add scalafix or scapegoat (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 7 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation REDACTED:18 — `REDACTED` 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`.
R7 · Dead Code · Unused export 'TeamApiConsumption' · ×1
  • Unused export 'TeamApiConsumption' daikoku/javascript/src/components/backoffice/apis/TeamApiConsumption.tsx:55 — Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/backoffice/apis/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/backoffice/apis/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'TeamPlanConsumption' · ×1
  • Unused export 'TeamPlanConsumption' daikoku/javascript/src/components/backoffice/apis/TeamPlanConsumption.tsx:17 — Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/backoffice/apis/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/backoffice/apis/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'MessagesTopBarTools' · ×1
  • Unused export 'MessagesTopBarTools' daikoku/javascript/src/components/backoffice/messages/messages.tsx:9 — Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/backoffice/messages/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/backoffice/messages/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'Revenus' · ×1
  • Unused export 'Revenus' daikoku/javascript/src/components/backoffice/widgets/revenus.tsx:9 — Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/backoffice/widgets/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/backoffice/widgets/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'LinkDisplay' · ×1
  • Unused export 'LinkDisplay' daikoku/javascript/src/components/inputs/LinkDisplay.tsx:4 — Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/inputs/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/inputs/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'DefaultColumnFilter' · ×1
  • Unused export 'DefaultColumnFilter' daikoku/javascript/src/components/inputs/TableFilters.tsx:7 — Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/inputs/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/inputs/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'BooleanColumnFilter' · ×1
  • Unused export 'BooleanColumnFilter' daikoku/javascript/src/components/inputs/TableFilters.tsx:35 — Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/inputs/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/inputs/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'Collapse' · ×1
  • Unused export 'Collapse' daikoku/javascript/src/components/utils/FormWithChoice.tsx:61 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'Placeholder' · ×1
  • Unused export 'Placeholder' daikoku/javascript/src/components/utils/Placeholder.tsx:1 — Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/utils/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/utils/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'apiGQLToLegitApi' · ×1
  • Unused export 'apiGQLToLegitApi' daikoku/javascript/src/components/utils/apiUtils.tsx:73 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'removeArrayIndex' · ×1
  • Unused export 'removeArrayIndex' daikoku/javascript/src/components/utils/array.ts:1 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'moveArrayIndex' · ×1
  • Unused export 'moveArrayIndex' daikoku/javascript/src/components/utils/array.ts:8 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'newPossibleUsagePlan' · ×1
  • Unused export 'newPossibleUsagePlan' daikoku/javascript/src/components/utils/entities.ts:4 — Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/utils/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/utils/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'renderPlanInfo' · ×1
  • Unused export 'renderPlanInfo' daikoku/javascript/src/components/utils/formatters.tsx:68 — Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/utils/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/utils/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'FilterPreview' · ×1
  • Unused export 'FilterPreview' daikoku/javascript/src/components/utils/function.tsx:60 — Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/utils/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/utils/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'cleanHash' · ×1
  • Unused export 'cleanHash' daikoku/javascript/src/components/utils/function.tsx:130 — Nothing ultimately consumes this binding: its only referrer is the re-export in daikoku/javascript/src/components/utils/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in daikoku/javascript/src/components/utils/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'injectJS' · ×1
  • Unused export 'injectJS' daikoku/javascript/src/components/utils/tenantUtils.ts:12 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'injectFavicon' · ×1
  • Unused export 'injectFavicon' daikoku/javascript/src/components/utils/tenantUtils.ts:23 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'injectFontFamily' · ×1
  • Unused export 'injectFontFamily' daikoku/javascript/src/components/utils/tenantUtils.ts:31 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'parseAsHtml' · ×1
  • Unused export 'parseAsHtml' daikoku/javascript/src/components/utils/tenantUtils.ts:44 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'OverwriteSubscriptionData' · ×1
  • Unused export 'OverwriteSubscriptionData' daikoku/javascript/src/contexts/modals/SubscriptionMetadataModal.tsx:12 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'getVisibleApiGroup' · ×1
  • Unused export 'getVisibleApiGroup' daikoku/javascript/src/services/index.ts:97 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'myDashboard' · ×1
  • Unused export 'myDashboard' daikoku/javascript/src/services/index.ts:115 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'getDocDetails' · ×1
  • Unused export 'getDocDetails' daikoku/javascript/src/services/index.ts:156 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'getTeamSubscriptions' · ×1
  • Unused export 'getTeamSubscriptions' daikoku/javascript/src/services/index.ts:159 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'getTeamSubscriptionsWithPlan' · ×1
  • Unused export 'getTeamSubscriptionsWithPlan' daikoku/javascript/src/services/index.ts:166 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'initApiKey' · ×1
  • Unused export 'initApiKey' daikoku/javascript/src/services/index.ts:215 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'apisInit' · ×1
  • Unused export 'apisInit' daikoku/javascript/src/services/index.ts:221 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'member' · ×1
  • Unused export 'member' daikoku/javascript/src/services/index.ts:293 — Nothing imports this binding — it is safe to review for removal.
X5 · Nullable reference types · Scala's null is not held to the type system everywhere · ×1
  • Scala's null is not held to the type system everywhere — No build over this repository's 114 Scala product file(s) passes `-Yexplicit-nulls`, enables WartRemover's `Null` wart or runs Scalafix's `DisableSyntax.noNulls`, so every reference type admits null and nothing reports a `null` written into the code or returned from a Java API — the first one to reach a method call is a `NullPointerException`. `Option` by convention is a habit no tool here holds the code to.
X7 · Silent fallback defaults · Silent fallback default on Err · ×1
  • Silent fallback default on Err cli/src/commands/environments.rs:430 — `get_daikokuignore` turns every `Err` into `Ok(Vec::new())` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Minor — 21 finding(s)
D12 · Dependency Hygiene · Outdated · ×20
  • Outdated: async-recursion — `async-recursion` is locked at 1.1.1 but 1.2.0 is the current stable release on crates.io, and it already satisfies the `"1.0.5"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p async-recursion` and commit the updated REDACTED.
  • Outdated: bytes — `bytes` is locked at 1.8.0 but 1.12.1 is the current stable release on crates.io, and it already satisfies the `"1.5.0"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p bytes` and commit the updated REDACTED.
  • Outdated: chrono — `chrono` is locked at 0.4.38 but 0.4.45 is the current stable release on crates.io, and it already satisfies the `"0.4.31"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p chrono` and commit the updated REDACTED.
  • Outdated: clap — `clap` is locked at 4.5.20 but 4.6.8 is the current stable release on crates.io, and it already satisfies the `"4.4.6"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap` and commit the updated REDACTED.
  • Outdated: configparser — `configparser` is locked at 3.1.0 but 3.3.0 is the current stable release on crates.io, and it already satisfies the `"3.0.4"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p configparser` and commit the updated REDACTED.
  • Outdated: futures-channel — `futures-channel` is locked at 0.3.31 but 0.3.34 is the current stable release on crates.io, and it already satisfies the `"0.3.29"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p futures-channel` and commit the updated REDACTED.
  • Outdated: futures-util — `futures-util` is locked at 0.3.31 but 0.3.34 is the current stable release on crates.io, and it already satisfies the `"0.3.28"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p futures-util` and commit the updated REDACTED.
  • Outdated: home — `home` is locked at 0.5.9 but 0.5.12 is the current stable release on crates.io, and it already satisfies the `"0.5.5"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p home` and commit the updated REDACTED.
  • Outdated: http-body-util — `http-body-util` is locked at 0.1.2 but 0.1.5 is the current stable release on crates.io, and it already satisfies the `"0.1"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p http-body-util` and commit the updated REDACTED.
  • Outdated: hyper — `hyper` is locked at 1.5.0 but 1.12.0 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p hyper` and commit the updated REDACTED.
  • Outdated: hyper-util — `hyper-util` is locked at 0.1.10 but 0.1.21 is the current stable release on crates.io, and it already satisfies the `"0.1"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p hyper-util` and commit the updated REDACTED.
  • Outdated: lazy_static — `lazy_static` is locked at 1.5.0 but 1.5.1 is the current stable release on crates.io, and it already satisfies the `"1.4.0"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p lazy_static` and commit the updated REDACTED.
  • Outdated: once_cell — `once_cell` is locked at 1.20.2 but 1.21.4 is the current stable release on crates.io, and it already satisfies the `"1.18.0"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p once_cell` and commit the updated REDACTED.
  • Outdated: openssl — `openssl` is locked at 0.10.75 but 0.10.82 is the current stable release on crates.io, and it already satisfies the `"0.10.75"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p openssl` and commit the updated REDACTED.
  • Outdated: regex — `regex` is locked at 1.11.1 but 1.13.1 is the current stable release on crates.io, and it already satisfies the `"1.11.1"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p regex` and commit the updated REDACTED.
  • Outdated: serde — `serde` is locked at 1.0.215 but 1.0.229 is the current stable release on crates.io, and it already satisfies the `"1.0.215"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p serde` and commit the updated REDACTED.
  • Outdated: serde_json — `serde_json` is locked at 1.0.133 but 1.0.154 is the current stable release on crates.io, and it already satisfies the `"1.0.133"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p serde_json` and commit the updated REDACTED.
  • Outdated: tokio — `tokio` is locked at 1.41.0 but 1.54.1 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p tokio` and commit the updated REDACTED.
  • Outdated: uuid — `uuid` is locked at 1.11.0 but 1.29.3 is the current stable release on crates.io, and it already satisfies the `"1.7.0"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p uuid` and commit the updated REDACTED.
  • Outdated: webbrowser — `webbrowser` is locked at 1.0.2 but 1.2.7 is the current stable release on crates.io, and it already satisfies the `"1.0.2"` requirement declared in cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p webbrowser` and commit the updated REDACTED.
D24 · Comment Value · doc comments repeat the names · ×1
  • doc comments repeat the names daikoku/public/viewerjs/pdf.js:1048 — 0 of 51 documented parameters and 2 of 84 summaries in `.` only repeat the member or parameter name (e.g. "Creates a promise capability object." for `createPromiseCapability`). Delete the restating tags, or add what the name does not say.

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-687b4cb973074cd9bc681492801abccd/history.json --exit-code 0 --source .52artifacts/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-687b4cb973074cd9bc681492801abccd/history-1.json --exit-code 0 --source .183artifacts/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=1360" --report-format json --report-path /tmp/watchdog-gitleaks-687b4cb973074cd9bc681492801abccd/history-2.json --exit-code 0 --source .6artifacts/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=2360 --max-count=305" --report-format json --report-path /tmp/watchdog-gitleaks-687b4cb973074cd9bc681492801abccd/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=2665 --max-count=205" --report-format json --report-path /tmp/watchdog-gitleaks-687b4cb973074cd9bc681492801abccd/history-4.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-4.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=2870 --max-count=213" --report-format json --report-path /tmp/watchdog-gitleaks-687b4cb973074cd9bc681492801abccd/history-5.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-5.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=3083 --max-count=222" --report-format json --report-path /tmp/watchdog-gitleaks-687b4cb973074cd9bc681492801abccd/history-6.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-6.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=3305 --max-count=230" --report-format json --report-path /tmp/watchdog-gitleaks-687b4cb973074cd9bc681492801abccd/history-7.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-7.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=3535 --max-count=241" --report-format json --report-path /tmp/watchdog-gitleaks-687b4cb973074cd9bc681492801abccd/history-8.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-8.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=3776 --max-count=228" --report-format json --report-path /tmp/watchdog-gitleaks-687b4cb973074cd9bc681492801abccd/history-9.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-9.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=4004 --max-count=226" --report-format json --report-path /tmp/watchdog-gitleaks-687b4cb973074cd9bc681492801abccd/history-10.json --exit-code 0 --source .0—
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-687b4cb973074cd9bc681492801abccd/tree.json --exit-code 0 --source .64artifacts/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 daikoku/project/project .161artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .98artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .26artifacts/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. semgrep could not parse 102 file(s) — `daikoku/app/fr/maif/daikoku/login/oauth.scala`, `daikoku/app/fr/maif/daikoku/services/ApiService.scala`, `daikoku/app/fr/maif/daikoku/utils/Time.scala`, `daikoku/javascript/src/apps/DaikokuHomeApp.tsx`, `daikoku/javascript/src/components/adminbackoffice/cms/index.tsx`, … (+97 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.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 01a1e939-c68d-7242-add2-c9af62cf55e2 · 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