Public report of databricks/sjsonnet, published 6 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.2). 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, 6 November 2026, 20:21 UTC · Survey ID cd_5dc85ec5534f448097d054493672f90d

databricks/sjsonnet

Measured 6 November 2026, 20:21 UTC, at code version b6bf60a

CAI score 49out of 100 Adequate
CriticalWeakAdequateStrongExemplary
Down 6 since the last survey

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

A medium codebase: 27,716 lines of product code in 3 projects, tests not counted · Estimated rebuild effort: about 0.2 person-years · Weakest lens: Accessibility, 40

Findings by how serious they are

4 critical 298 serious 37 minor

13 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
6 November 2026, 20:21 UTC

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

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

65of 65 dimensions measured by tools.
327of 339 findings point to an exact file and line, so you can open each one in the code. The other 12 concern the repository as a whole, such as missing documentation.
65dimensions across 7 lenses, read from 27,716 lines of product code in 3 projects.
Chapters

Executive summary

databricks/sjsonnet falls short of our standard for a preview release, held back most by its Accessibility lens, the interface's usability with a keyboard or assistive technology. It scores 49 out of 100 and is rated Adequate, and one of its four critical findings is a security problem in the packages it uses.

Accessibility, at 40, is the weakest lens and counts most in the score. The best first step is fixing focus, motion and contrast, worth about 7 points. Automating accessibility checks comes next, worth about 4 points. Raising Accessibility to 65 would lift the score to about 57.

One known security hole in a package the code depends on can be used by attackers. Three form fields can't be read by a screen reader. Updating the vulnerable packages and labelling the form fields would close both risks.

The product code is 27,716 lines, about €35,000 to rebuild. The check for the health of its packages couldn't finish, so that result is missing, not a clean pass.

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

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

If Accessibility rose from 40 to 65, the lowest score rated Strong, the score would rise from 49 to about 57.

Code composition: what the lines of code are
Product code 73%Tests 27%
New since the last survey: 11 findings

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

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

Rebuild cost: about €35,000 · Estimate
Cost to rebuild€12,000 to €59,000, for 195 to 618 hours of work, about 0.2 person-years for one engineer
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 49. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeMedium: 27,716 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
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.
Raises the score by about 7 points · Medium effort · Visual & motion safety
2
Enforce accessibility in the toolchain your project already uses: assert accessibility in your UI test suite with your toolkit's own matcher (Flutter `meetsGuideline`, Espresso `AccessibilityChecks`, XCTest `performAccessibilityAudit`), then gate that test in CI so a regression blocks the merge.
Raises the score by about 4 points · Medium effort · A11y enforcement
3
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 2 points · Low effort · ADR Quality

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 €35,000 to build again, about 0.2 person-years of work. Its weakest lens is Accessibility, at 40 (Weak). Accessibility is about whether the interface is built so that everyone can use it, including people who can't see the screen or can't use a mouse. Because the weakest lens counts most in the score, work on Accessibility also moves the score most.
Based on: the rebuild estimate · the Accessibility grade · how much each lens counts
What to do: Start with the Accessibility actions in Top priorities.
If you do one thing first · First action
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. Of all the actions in this report, it raises the score most for the work it takes: about 7 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.5 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 4% to 9% on every change. The history of the code shows how much it changes: about 3,069 lines over the last 90 days, which is about 12,446 lines a year. At that pace, the extra work comes to an estimated 1.2 to 7.2 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 — module dependency graph

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

arch main main sjsonnet.jvm.client client sjsonnet.jvm.server server sjsonnet.jvm.server->sjsonnet.jvm.client

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.

44 modules, with 96 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; 4 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 java.util2 sjsonnet.ScopedExprTransform3 sjsonnet.Error4 sjsonnet.Expr.Member5 sjsonnet.ImportFinder6 sjsonnet.ImportKind7 sjsonnet.Preloader8 sjsonnet.Profiler9 sjsonnet.SjsonnetMainBase10 sjsonnet.stdlib.ArrayModule11 sjsonnet.Expr12 sjsonnet.Expr.Member.Visibility13 sjsonnet.Expr.ObjBody14 sjsonnet.StaticOptimizer15 sjsonnet.Val16 sjsonnet.Evaluator17 sjsonnet.Format18 sjsonnet.Materializer19 sjsonnet20 sjsonnet.CachedImporter21 sjsonnet.CachedResolver22 sjsonnet.Expr.FieldName23 sjsonnet.ExternalVariableKind24 sjsonnet.Platform25 sjsonnet.ProfileOutputFormat26 sjsonnet.ReadWriter27 sjsonnet.TomlRenderer28 sjsonnet.Val.Obj29 sjsonnet.functions30 sjsonnet.stdlib.DeepArrayTraversal31 sjsonnet.stdlib.EncodingModule32 sjsonnet.stdlib.ManifestModule33 sjsonnet.stdlib.MathModule34 sjsonnet.stdlib.ObjectModule35 sjsonnet.stdlib.ObjectModule.ObjectHas36 sjsonnet.stdlib.ObjectModule.ObjectHasAll37 sjsonnet.stdlib.SetModule38 sjsonnet.stdlib.StringModule39 sjsonnet.stdlib.TypeModule40 sjsonnet.stdlib
1 java.util
2 sjsonnet.ScopedExprTransform
3 sjsonnet.Error2
4 sjsonnet.Expr.Member43
5 sjsonnet.ImportFinder3
6 sjsonnet.ImportKind3
7 sjsonnet.Preloader2
8 sjsonnet.Profiler3
9 sjsonnet.SjsonnetMainBase3
10 sjsonnet.stdlib.ArrayModule11871
11 sjsonnet.Expr11693
12 sjsonnet.Expr.Member.Visibility3
13 sjsonnet.Expr.ObjBody363
14 sjsonnet.StaticOptimizer1
15 sjsonnet.Val221592
16 sjsonnet.Evaluator412
17 sjsonnet.Format14
18 sjsonnet.Materializer113
19 sjsonnet13313111455223243
20 sjsonnet.CachedImporter1
21 sjsonnet.CachedResolver2
22 sjsonnet.Expr.FieldName21
23 sjsonnet.ExternalVariableKind3
24 sjsonnet.Platform2
25 sjsonnet.ProfileOutputFormat2
26 sjsonnet.ReadWriter11833
27 sjsonnet.TomlRenderer1
28 sjsonnet.Val.Obj1126
29 sjsonnet.functions132
30 sjsonnet.stdlib.DeepArrayTraversal322
31 sjsonnet.stdlib.EncodingModule14
32 sjsonnet.stdlib.ManifestModule933
33 sjsonnet.stdlib.MathModule15
34 sjsonnet.stdlib.ObjectModule21651
35 sjsonnet.stdlib.ObjectModule.ObjectHas14
36 sjsonnet.stdlib.ObjectModule.ObjectHasAll14
37 sjsonnet.stdlib.SetModule14
38 sjsonnet.stdlib.StringModule1112497
39 sjsonnet.stdlib.TypeModule1144
40 sjsonnet.stdlib11724121
Uses a module listed above itPart of a loopThe module itself
1 java.util2 sjsonnet.ScopedExprTransform3 sjsonnet.Error4 sjsonnet.Expr.Member5 sjsonnet.ImportFinder6 sjsonnet.ImportKind7 sjsonnet.Preloader8 sjsonnet.Profiler9 sjsonnet.SjsonnetMainBase10 sjsonnet.stdlib.ArrayModule11 sjsonnet.Expr12 sjsonnet.Expr.Member.Visibility13 sjsonnet.Expr.ObjBody14 sjsonnet.StaticOptimizer15 sjsonnet.Val16 sjsonnet.Evaluator17 sjsonnet.Format18 sjsonnet.Materializer19 sjsonnet20 sjsonnet.CachedImporter21 sjsonnet.CachedResolver22 sjsonnet.Expr.FieldName23 sjsonnet.ExternalVariableKind24 sjsonnet.Platform25 sjsonnet.ProfileOutputFormat26 sjsonnet.ReadWriter27 sjsonnet.TomlRenderer28 sjsonnet.Val.Obj29 sjsonnet.functions30 sjsonnet.stdlib.DeepArrayTraversal31 sjsonnet.stdlib.EncodingModule32 sjsonnet.stdlib.ManifestModule33 sjsonnet.stdlib.MathModule34 sjsonnet.stdlib.ObjectModule35 sjsonnet.stdlib.ObjectModule.ObjectHas36 sjsonnet.stdlib.ObjectModule.ObjectHasAll37 sjsonnet.stdlib.SetModule38 sjsonnet.stdlib.StringModule39 sjsonnet.stdlib.TypeModule40 sjsonnet.stdlibjava.util1sjsonnet.ScopedExprTransform2sjsonnet.Error3sjsonnet.Expr.Member4sjsonnet.ImportFinder5sjsonnet.ImportKind6sjsonnet.Preloader7sjsonnet.Profiler8sjsonnet.SjsonnetMainBase9sjsonnet.stdlib.ArrayModule10sjsonnet.Expr11sjsonnet.Expr.Member.Visibility12sjsonnet.Expr.ObjBody13sjsonnet.StaticOptimizer14sjsonnet.Val15sjsonnet.Evaluator16sjsonnet.Format17sjsonnet.Materializer18sjsonnet19sjsonnet.CachedImporter20sjsonnet.CachedResolver21sjsonnet.Expr.FieldName22sjsonnet.ExternalVariableKind23sjsonnet.Platform24sjsonnet.ProfileOutputFormat25sjsonnet.ReadWriter26sjsonnet.TomlRenderer27sjsonnet.Val.Obj28sjsonnet.functions29sjsonnet.stdlib.DeepArrayTraversal30sjsonnet.stdlib.EncodingModule31sjsonnet.stdlib.ManifestModule32sjsonnet.stdlib.MathModule33sjsonnet.stdlib.ObjectModule34sjsonnet.stdlib.ObjectModule.ObjectHas35sjsonnet.stdlib.ObjectModule.ObjectHasAll36sjsonnet.stdlib.SetModule37sjsonnet.stdlib.StringModule38sjsonnet.stdlib.TypeModule39sjsonnet.stdlib40243332331187111693336312215924121411313313111455223243122132211833111261323221493315216511414141112497114411724121+4 more modules (most-connected shown)

At a glance — Code Health · 55% · Adequate · gated by D2, X5 ·

At a glance — Architecture · 89% · Adequate · gated by D26 ·

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

At a glance — Readiness · 52% · Adequate · gated by P2 ·

At a glance — Security · 89% · Exemplary ·

At a glance — Accessibility · 40% · Weak · gated by AC6 ·

At a glance — Performance · 76% · Strong ·

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
A03:2025 — Software Supply Chain Failures1High / Critical

Roadmap

Top priorities: 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; Enforce accessibility in the toolchain your project already uses: assert accessibility in your UI test suite with your toolkit's own matcher (Flutter `meetsGuideline`, Espresso `AccessibilityChecks`, XCTest `performAccessibilityAudit`), then gate that test in CI so a regression blocks the merge; Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.

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

Do thisHelpsEffortDimension
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.+6.7 ptsMediumVisual & motion safety
Enforce accessibility in the toolchain your project already uses: assert accessibility in your UI test suite with your toolkit's own matcher (Flutter `meetsGuideline`, Espresso `AccessibilityChecks`, XCTest `performAccessibilityAudit`), then gate that test in CI so a regression blocks the merge.+4.3 ptsMediumA11y enforcement
Resolve the 1 No ADRs found finding(s) in ADR Quality.+2.1 ptsLowADR Quality
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.+3.2 ptsMediumPage structure
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.+3.0 ptsMediumForms & labels
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.+2.4 ptsMediumObservability
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.+1.7 ptsMediumArchitecture documentation
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.+1.4 ptsMediumNullable reference types

File quality

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

FileScoreBandWorst signal
sjsonnet/src/sjsonnet/BaseByteRenderer.scala5.9MixedCode Duplication: Duplicated block (14 lines × 2)
sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala6.0MixedExplicit Debt: TodoComment
sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala6.0MixedExplicit Debt: TodoComment
sjsonnet/src/sjsonnet/Materializer.scala7.0Near-cleanCyclomatic Complexity: Materializer.hasSelfRefExpr (cyclomatic 81)
sjsonnet/src/sjsonnet/Format.scala7.0Near-cleanCyclomatic Complexity: Format.format (cyclomatic 71)
sjsonnet/src/sjsonnet/Evaluator.scala7.0Near-cleanCyclomatic Complexity: Evaluator.visitBinaryOp (cyclomatic 62)
sjsonnet/src/sjsonnet/StaticOptimizer.scala7.0Near-cleanCyclomatic Complexity: StaticOptimizer.transform (cyclomatic 41)
sjsonnet/src/sjsonnet/Parser.scala7.0Near-cleanCyclomatic Complexity: Parser.expr (cyclomatic 37)
sjsonnet/src/sjsonnet/Val.scala7.0Near-cleanCyclomatic Complexity: Obj.valueRaw (cyclomatic 37)
sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala7.0Near-cleanCyclomatic Complexity: PrettyYamlRenderer.isYamlDateExact (cyclomatic 34)
sjsonnet/src-js/sjsonnet/Platform.scala7.0Near-cleanCyclomatic Complexity: Platform.nodeToJson (cyclomatic 30)
sjsonnet/src/sjsonnet/stdlib/StringModule.scala7.0Near-cleanCyclomatic Complexity: Join.evalRhs (cyclomatic 27)
sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala7.0Near-cleanCyclomatic Complexity: ArrayModule.tryStringBuilderFromBinaryOp (cyclomatic 16)
sjsonnet/src/sjsonnet/stdlib/SetModule.scala7.0Near-cleanCyclomatic Complexity: SetModule.sortArrSlow (cyclomatic 21)
sjsonnet/src-jvm/sjsonnet/Platform.scala7.0Near-cleanCyclomatic Complexity: Platform.yamlNodeToJson (cyclomatic 55)
playground/index.html7.1Near-cleanCyclomatic Complexity: index.html.jsonnetHint (cyclomatic 104)
sjsonnet/src-native/sjsonnet/Platform.scala7.1Near-cleanCyclomatic Complexity: Platform.nodeToJson (cyclomatic 33)
sjsonnet/src-js/sjsonnet/CharSWAR.scala7.2Near-cleanCode Duplication: Duplicated block (8 lines × 2)
REDACTED7.2Near-cleanDependency Vulnerabilities: High CVE: REDACTED
sjsonnet/src/sjsonnet/ExprTransform.scala7.4Near-cleanCyclomatic Complexity: ExprTransform.rec (cyclomatic 83)

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

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

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

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

Could not be resolved — 13

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 65 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, 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 — 65 dimensions across the health lenses
D1D2D3D4D5D6D9D13D15D16D17D20D26D28D29D30D34D35D43D44AC2AC3AC5AC6AC7AX10AX3AX4AX6AX8GD1IC1M1M2M3P1P10P2P3P6PF1PF2S1X1X12X13X14X15X16X17X18X19X20X21X22X23X24X25X26X27X28X29X3X30X5

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, 327 of 339 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 · trivySecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3✓ deterministic

Every finding is locatable in findings.md. Run 01a1b285-99a6-7c95-b012-3c6f3a39bcfb.

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

Run transparency — what happened this run

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

  • D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.scala) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (`addSbtPlugin("org.scoverage" % "sbt-scoverage" % "<version>")` in `project/plugins.sbt`, then `sbt clean coverage test coverageReport`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (`addSbtPlugin("org.scoverage" % "sbt-scoverage" % "<version>")` in `project/plugins.sbt`, then `sbt clean coverage test coverageReport`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
  • 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) and this repository declares an sbt build (repository root, 61 test files), but it was not re-run: the analyzer environment could not run it. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • D12 Dependency Hygiene — 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 repository's dependency manifests WERE read and their pinning discipline assessed; what went unanswered is the currency half, because repo1.maven.org — the registry that answers it — was asked and did not reply (HTTP 429 Too Many Requests from http://172.31.7.1:8790/maven/at/yawk/lz4/lz4-java/maven-metadata.xml). This is OUR side and it is an ENVIRONMENT fault, not a missing collector: the collector exists and ran. An HTTP 403 here is what this scan's egress allowlist returns for a host that is not on it, so the remedy is to add repo1.maven.org to the allowlist and re-run — not to build anything.
  • 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 deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
  • D22 Internal API Consistency — not measured this run — 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.
  • D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
  • D27 Navigability — not measured this run — 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.
  • 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. `sjsonnet/src/sjsonnet/Val.scala` 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.
  • AXB1 Runtime evidence locked — no reproducible boot — 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. Subject: 1 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. We then boot it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
  • C1 Data Protection — not measured this run — 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.
  • P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.

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.
  • D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D20 ADR Quality: ADR quality 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.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
  • AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
  • 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.
  • AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • 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.2 / 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.2 / 10 · rule-coverage 100% · ceiling Prevented

56 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was index.html.jsonnetHint at 104. A further 2 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 Evaluator.visitExprCold at 31 — they are counted neither in the figure above nor in this dimension's score.

Platform.yamlScalarPrefixStart (cyclomatic 20) · ×3sjsonnet/src-js/sjsonnet/Platform.scala:362
index.html.jsonnetHint (cyclomatic 104)playground/index.html:1190
ExprTransform.rec (cyclomatic 83)sjsonnet/src/sjsonnet/ExprTransform.scala:10
Materializer.hasSelfRefExpr (cyclomatic 81)sjsonnet/src/sjsonnet/Materializer.scala:862
Format.format (cyclomatic 71)sjsonnet/src/sjsonnet/Format.scala:627

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

What to do

  1. Bring the 5 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with index.html.jsonnetHint (cyclomatic 104), ExprTransform.rec (cyclomatic 83), Materializer.hasSelfRefExpr (cyclomatic 81). — 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 5 together lifts Cyclomatic Complexity from 5.3 to about 6.0/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
  2. Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

D2 · Cognitive 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

100 method(s) exceeded the cognitive complexity threshold of 15; the worst was Format.format at 172.

Platform.yamlScalarPrefixStart (cognitive 27) · ×3sjsonnet/src-js/sjsonnet/Platform.scala:362
Format.format (cognitive 172)sjsonnet/src/sjsonnet/Format.scala:627
index.html.jsonnetHint (cognitive 168)playground/index.html:1190
SjsonnetMainBase.main0 (cognitive 141)sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala:130
Platform.yamlNodeToJson (cognitive 121)sjsonnet/src-jvm/sjsonnet/Platform.scala:178

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

What to do

  1. Bring the 12 bodies over 60 down to 60 or less in Cognitive Complexity — start with Format.format (cognitive 172), index.html.jsonnetHint (cognitive 168), SjsonnetMainBase.main0 (cognitive 141). — 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 12 together lifts Cognitive Complexity from 2.0 to about 4.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
  2. Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

D3 · God Classes8.0 / 10Strong✓ Tool-verified

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

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

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

16 god class(es) detected.

FileTooLong: sjsonnet/Val.scala · ×9sjsonnet/src/sjsonnet/Val.scala
TooManyMethods: Parser · ×6sjsonnet/src/sjsonnet/Parser.scala:74
ClassTooLong: StaticOptimizersjsonnet/src/sjsonnet/StaticOptimizer.scala:24

What to do

  1. Resolve the 9 FileTooLong finding(s) in God Classes — start with Val.scala, Evaluator.scala, Format.scala. — One of this dimension's main actionable groups (9 warning-level).
  2. Resolve the 6 TooManyMethods finding(s) in God Classes — start with Platform.scala (3), Parser.scala, Evaluator.scala. — One of this dimension's main actionable groups (6 warning-level).
  3. Resolve the 1 ClassTooLong finding(s) in God Classes — start with StaticOptimizer.scala. — One of this dimension's main actionable groups (1 warning-level).
  4. Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

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

What it measures: Copy-pasted code that should be shared instead.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.

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

73 duplicated block group(s) detected. A further 4 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 1 of the 77 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.

Duplicated block (9 lines × 2) · ×8sjsonnet/src/sjsonnet/Materializer.scala:170
Duplicated block (6 lines × 2) · ×7sjsonnet/src-js/sjsonnet/Platform.scala:169
Duplicated block (5 lines × 2) · ×7sjsonnet/src/sjsonnet/Evaluator.scala:886
Duplicated block (8 lines × 2) · ×6sjsonnet/src-js/sjsonnet/CharSWAR.scala:17
Duplicated block (11 lines × 2) · ×5sjsonnet/src-js/sjsonnet/Platform.scala:156

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

What to do

  1. Resolve the 8 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with CharSWAR.scala (3), Materializer.scala, ArrayModule.scala. — One of this dimension's main actionable groups (8 warning-level).
  2. Resolve the 7 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with Platform.scala (3), Error.scala, Evaluator.scala. — One of this dimension's main actionable groups (7 warning-level).
  3. Resolve the 7 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with Evaluator.scala (3), ExprTransform.scala, Platform.scala. — One of this dimension's main actionable groups (7 warning-level).
  4. Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

D5 · Coupling7.3 / 10Strong✓ Tool-verified

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

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

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

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

3 production modules (sbt+Mill), 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; a Mill module a helper method defines, a moduleDeps a function computes, and a module directory computed other than as a path over super.moduleDir are not visible there; 1 module(s) off the main sequence.

Off the main sequence: sjsonnet.jvm.client

What to do

  1. Resolve the 1 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
  2. Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

D6 · Cohesion (LCOM4)9.8 / 10Stronggated by 1 serious finding✓ 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 9.8 / 10 · rule-coverage 100% · ceiling Verified

1 of 58 classes have LCOM4 above 3.

Low cohesion: TomlRenderer (LCOM4 5)sjsonnet/src/sjsonnet/TomlRenderer.scala:8

What to do

  1. Resolve the 1 Low cohesion finding(s) in Cohesion (LCOM4) — start with TomlRenderer.scala. — One of this dimension's main actionable groups (1 warning-level).
  2. Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

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

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

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

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

620 test methods: 620 unit, 0 integration, 0 BDD, 0 e2e. The Scala suite contributes 620 test case(s) across 55 file(s) in a test source set declaring at least one — every `test("…")`, `it("…")`, `property("…")` and `"…" in {…}` registration and every JUnit `@Test`, which is how munit, ScalaTest, utest, ZIO Test and specs2 declare a case; a case registered under a computed name is not counted, so this is a floor. Its tier split is INFERRED from paths and file names, except sbt's src/it source set, which the build declares.

✓ On the Gold path — maintain.

Detailed fixes: d9_recommendation.md.

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

What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.

Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.

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

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D15 · Churn × Complexity Hotspots8.8 / 10Strong✓ 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 8.8 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: sjsonnet/src/sjsonnet/Format.scala (7×71=497); sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala (3×42=126); sjsonnet/src/sjsonnet/Parser.scala (5×23=115)

Hotspot: sjsonnet/src/sjsonnet/Format.scala · ×3sjsonnet/src/sjsonnet/Format.scala:627

What to do

  1. Resolve the 3 Hotspot finding(s) in Churn × Complexity Hotspots — start with Format.scala, SjsonnetMainBase.scala, Parser.scala. — One of this dimension's main actionable groups (3 warning-level).

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

D16 · Bus Factor6.0 / 10Adequate✓ 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 6.0 / 10 · rule-coverage 100% · ceiling Documented

24 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is sjsonnet/src/sjsonnet/stdlib/StringModule.scala. Counted over 60 of the 96 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

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

What to do

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

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

D17 · Explicit Debt10.0 / 10Stronggated by 6 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 10.0 / 10 · rule-coverage 100% · ceiling Prevented

6 deducted task-comment markers across 27716 LoC (0.0/KLoC) → score 10.0. 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 · ×5sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala:630
FixmeCommentsjsonnet/test/src-jvm-native/sjsonnet/PrettyYamlRendererTests.scala:34

What to do

  1. Resolve the 5 TodoComment finding(s) in Explicit Debt — start with ManifestModule.scala (4), SjsonnetMainBase.scala. — One of this dimension's main actionable groups (5 warning-level).
  2. Resolve the 1 FixmeComment finding(s) in Explicit Debt — start with PrettyYamlRendererTests.scala. — One of this dimension's main actionable groups (1 warning-level).
  3. Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

D20 · ADR Quality0.0 / 10Critical✓ Tool-verified

What it measures: Whether architecture decisions are recorded well (context, decision, consequences).

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

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

No architecture decision records were found.

No ADRs found

What to do

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

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

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

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

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

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

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

Projects may be oversized for their cohesion

What to do

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)10.0 / 10Exemplary○ Nothing flagged

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

semgrep found no security issues. semgrep hit a parse error in 1 file(s) — `sjsonnet/src/sjsonnet/Val.scala` — so no absence of findings in them is evidence of anything, and nothing in them was analysed. 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 2 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.

✓ On the Gold path — maintain.

Detailed fixes: d29_recommendation.md.

D30 · Dependency Vulnerabilities9.4 / 10Adequategated by 1 critical finding✓ Tool-verified

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

Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no 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 9.4 / 10 · rule-coverage 100% · ceiling Documented

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

REDACTED

What to do

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

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

D34 · Knowledge Freshness9.8 / 10Exemplary✓ Tool-verified

What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.

Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.

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

1 of 60 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is sjsonnet/client/src/sjsonnet/client/Util.java. Counted over 60 of the 96 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned files with no living knowledge
Orphaned filesjsonnet/client/src/sjsonnet/client/Util.java:1

✓ On the Gold path — maintain.

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

D35 · Change Coupling9.7 / 10Stronggated by 2 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.7 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: BaseByteRenderer.scala↔BaseCharRenderer.scala 60%; Config.scala↔Settings.scala 59%

Change coupling: BaseByteRenderer.scala ↔ BaseCharRenderer.scala · ×2sjsonnet/src/sjsonnet/BaseByteRenderer.scala:1

What to do

  1. Resolve the 2 Change coupling finding(s) in Change Coupling — start with BaseByteRenderer.scala, Config.scala. — One of this dimension's main actionable groups (2 warning-level).

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

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

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.

Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AC2 · Forms & labels5.2 / 10Adequate✓ 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 for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. (×3) — playground/index.html:724, playground/index.html:737, playground/index.html:745

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

  • No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. — playground/index.html:2

What to do

  • Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
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 safety1.0 / 10Critical✓ 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.

  • `.vars-panel .panel-header .toggle-icon` moves (`transition: transform 0.2s`) 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. — playground/index.html:604
  • `.status-indicator` sets color: #6c6f85 on background-color: #ccd0da — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — playground/index.html:116
  • `.panel-header` sets color: #6c6f85 on background-color: #e6e9ef — 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — playground/index.html:153
  • `.panel-header .download-btn` sets color: #6c6f85 on background-color: #ccd0da — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — playground/index.html:182
  • `.file-item` sets color: #6c6f85 on background-color: #ccd0da — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — playground/index.html:272
  • `.file-item.active` sets color: #1e66f5 on background-color: #eff1f5 — 4.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — playground/index.html:292
  • `.toolbar-btn` sets color: #6c6f85 on background-color: #ccd0da — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — playground/index.html:361
  • `.toolbar-btn:hover` sets color: #1e66f5 on background-color: #eff1f5 — 4.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — playground/index.html:377
  • `.copy-btn` sets color: #6c6f85 on background-color: #ccd0da — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — playground/index.html:400
  • `.CodeMirror-hint-active` sets color: #1e1e2e on background-color: #1e66f5 — 3.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — playground/index.html:458
  • `.output-tab.active` sets color: #1e66f5 on background-color: #eff1f5 — 4.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — playground/index.html:545
  • `.var-section-header` sets color: #1e66f5 on background-color: #ccd0da — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — playground/index.html:636

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.
AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified

Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.

Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.

Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.

  • No accessibility enforcement found — no accessibility linting at author time and no automated accessibility check in tests or CI. Add your UI toolkit's own accessibility assertion to the test suite (Flutter `meetsGuideline`, Espresso `AccessibilityChecks`, XCTest `performAccessibilityAudit`), then gate that test in the pipeline. What was searched, so you can tell an absence from a miss: the 1 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.

What to do

  • Enforce accessibility in the toolchain your project already uses: assert accessibility in your UI test suite with your toolkit's own matcher (Flutter `meetsGuideline`, Espresso `AccessibilityChecks`, XCTest `performAccessibilityAudit`), then gate that test in CI so a regression blocks the merge.
AX10 · Code composition9.9 / 10Exemplary✓ Tool-verified

Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.

Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.

Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.

What to do

  • The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).

Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.

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

Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.

Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.

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

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

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

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.

GD1 · Unfinished & placeholder code9.9 / 10Exemplary✓ Tool-verified

Other · Code Health — Unreviewed-generation residue in this repository's Scala: methods whose whole body is still `???` or a "not implemented" throw where nothing overrides them, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings 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.

  • `transformField` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — sjsonnet/src/sjsonnet/ScopedExprTransform.scala:97

What to do

  • Finish or delete the members whose body is still `???` or a "not implemented" throw where nothing overrides them, and replace placeholder text before shipping.
IC1 · Incompleteness & stubs8.2 / 10Strong✓ Tool-verified

Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's Scala: methods whose body is `???` or only throws a "not implemented" error, methods that take inputs and return a constant or do nothing, 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.

  • `appendMemoryStats` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. (×2) — sjsonnet/src-js/sjsonnet/Platform.scala:560, sjsonnet/src-native/sjsonnet/Platform.scala:535
  • `transformField` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — sjsonnet/src/sjsonnet/ScopedExprTransform.scala:97
  • A bare `// scalastyle:off`, `// scalafix:off` or `@nowarn` (or Wartremover's `warts.All`) switches every rule or warning off — hidden debt. Suppress the specific rule on the specific line, with a justification, instead. — sjsonnet/src/sjsonnet/ScopedExprTransform.scala:56

What to do

  • Finish or delete the unfinished stubs (functions that throw "not implemented", or whose body is empty or a bare constant) — they are dead surface that looks live.
  • Clear the softer debt: re-enable or delete `ignore`d and `pending` tests, decide whether each empty method or UnsupportedOperationException is deliberate (and say so in a comment), and replace a bare `// scalastyle:off` or `@nowarn` with targeted, justified suppressions.
M1 · Documentation (README)7.3 / 10Strong✓ Tool-verified

Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.

Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.

What to do

  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
M2 · Architecture documentation2.0 / 10Weak✓ Tool-verified

Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.

Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.

  • No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

What to do

  • Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
M3 · Folder & project structure8.0 / 10Strong✓ Tool-verified

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

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

  • Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.

What to do

  • Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
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.

P10 · Library API & versioning6.0 / 10Adequate✓ Tool-verified

Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.

Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.

  • 8/10 types (80%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.

What to do

  • Keep implementation types off the public surface (Java: package-private (no modifier), or leave its package out of `module-info` exports) so internals can change without breaking consumers.
P2 · Observability0.0 / 10Critical✓ Tool-verified

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

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

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

What to do

  • Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
P3 · Security & performance tooling4.0 / 10Weak✓ Tool-verified

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

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

  • No static application security testing detected. For this repository's stack, add 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 5051 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. — .github/workflows/pr-build.yaml:4

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.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
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.

PF1 · Benchmark discipline9.5 / 10Exemplary✓ Tool-verified

Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.

Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.

PF2 · Allocation hygiene6.1 / 10Adequate✓ Tool-verified

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

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

What to do

  • Raise allocation-aware density on the hot paths — currently 4 use(s) across 29,295 production line(s) (~0.1/1k). More of the idioms below on the allocation-heavy paths climbs this toward 10.
  • Java: on hot paths, work through buffer views (ByteBuffer/LongBuffer slices, MemorySegment) instead of copies, avoid boxing with primitive collections (fastutil, Eclipse Collections, HPPC, Trove), presize collections and StringBuilders, and pool expensive buffers (Netty's pooled allocator, commons-pool).
  • Scala: on hot paths, make small wrappers value classes (extends AnyVal), @specialized generic code over primitives, use primitive collections, and presize builders.
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. Markup this repository SHIPS is scored for third-party script integrity whether or not the repository serves it itself, since a page handed to a consumer runs in that consumer’s origin. The server controls — HTTPS enforcement, HSTS, cookie flags, input validation — are read from a Scala server this repository runs itself, and its Scala source runs none: no HTTP-server artifact in its build and no server package imported or server bound in its production source. What serves its HTTP is outside the Scala source, and only what this card names about it was assessed.

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

  • `https://cdnjs.cloudflare.com/ajax/libs/codemirror/5.65.16/codemirror.min.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. 14 such include(s) across the repository's markup. — playground/index.html:777

What to do

  • Pin third-party scripts and verify them: name an exact version in the URL and add an `integrity="sha384-…"` hash alongside `crossorigin="anonymous"` (both are required — an integrity hash on a cross-origin script without `crossorigin` is not evaluated, it blocks the script). Where the vendor ships a continuously-updated loader and publishes no stable hash (tag managers, analytics, chat widgets), Subresource Integrity is not available: constrain it instead with a `Content-Security-Policy` that names the exact origins allowed to execute, and drop the script from the pages that do not need it. Where the page is shipped inside a package that others host, prefer vendoring the asset and serving it from the app’s own origin, so no consumer inherits a third-party dependency they did not choose.
X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  • `reverse` is public and takes `v: ujson.Value` from its caller, and it calls itself at line 594 with a piece of `v`, not as a tail call the compiler turns into a loop — and nowhere in `reverse` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. On the JVM's default 1 MB thread stack a walk like this one throws `StackOverflowError` from about 500–2,000 levels on a cold first call and 6,000–17,000 once warmed up (OpenJDK 21 and 25), while `ujson.read`, Jackson's `readTree` before 2.15 and circe before 0.14.16 accept any nesting (2,000,000 levels from 4 MB) and circe 0.14.16 accepts 4,096 — on a cold JVM even play-json's cap of 1,000 is past the point the walk fails. `StackOverflowError` is not `NonFatal`: `Try`, `case NonFatal(e)` and `recover` do not stop it, and in a `Future` on the global execution context it leaves the future forever incomplete. Thread a depth argument through `reverse` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — sjsonnet/src/sjsonnet/Materializer.scala:594
  • `toExpr` is public and takes `v: ujson.Value` from its caller, and it calls itself at line 621 with a piece of `v`, not as a tail call the compiler turns into a loop — and nowhere in `toExpr` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. On the JVM's default 1 MB thread stack a walk like this one throws `StackOverflowError` from about 500–2,000 levels on a cold first call and 6,000–17,000 once warmed up (OpenJDK 21 and 25), while `ujson.read`, Jackson's `readTree` before 2.15 and circe before 0.14.16 accept any nesting (2,000,000 levels from 4 MB) and circe 0.14.16 accepts 4,096 — on a cold JVM even play-json's cap of 1,000 is past the point the walk fails. `StackOverflowError` is not `NonFatal`: `Try`, `case NonFatal(e)` and `recover` do not stop it, and in a `Future` on the global execution context it leaves the future forever incomplete. Thread a depth argument through `toExpr` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — sjsonnet/src/sjsonnet/Materializer.scala:621

What to do

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

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

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

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

X20 · Mistyped argument guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether an argument guard throws the exception its own condition describes — a guard that rejects a value for being EMPTY and reports it as `NullPointerException` (Java, Kotlin, Scala), `ArgumentError.notNull` (Dart) or `ArgumentNullException` (F#'s `nullArg`) tells the caller a parameter was null when it provably was not.

Method: Roslyn syntax: `throw new ArgumentNullException(nameof(p))` statements controlled by an `if`, whose condition is read for a test that is true of a NON-null `p` — an emptiness test that dereferences it (`p.Count == 0`, `!p.Any()`) or a BCL predicate documented true of the empty value (`string.IsNullOrEmpty(p)`). Deterministic, provable per finding. Advisory.

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

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

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

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

Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back. Also whether a `finally` that gives the primitive back unconditionally can run in a state where the method does not hold it: after a timed wait whose result was discarded, after an acquire inside the `try` that can fail, after the body already released it, or never, because a `return` left between the acquire and the `try`.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Other · Code Health — Whether 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` 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 handling5.1 / 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.

  • `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. (×8) — sjsonnet/src-js/sjsonnet/SjsonnetMain.scala:51, sjsonnet/src/sjsonnet/StaticOptimizer.scala:50, sjsonnet/src/sjsonnet/StaticOptimizer.scala:79, …
  • `case NonFatal(_)` 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. — sjsonnet/src/sjsonnet/Evaluator.scala:309
  • `case NonFatal(e)` 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. — sjsonnet/server/src/sjsonnet/SjsonnetServerMain.scala:263
  • 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. (×3) — sjsonnet/client/src/sjsonnet/client/Locks.java:27, sjsonnet/client/src/sjsonnet/client/Locks.java:28, sjsonnet/client/src/sjsonnet/client/Locks.java:29
  • `catch (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. — sjsonnet/client/src/sjsonnet/client/SjsonnetClientMain.java:144

What to do

  • Swallowed exception (caught, then discarded)
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged

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

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

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

Other · Code Health — Whether 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 74 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 10 of 55 WCAG 2.2 Level A/AA success criteria (18%; ≈20% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 45 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).

DimensionWCAG 2.2 A/AA criteriaCoverage
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
AC5 · ARIA correctness4.1.2Partial signal
AC6 · Visual & motion safety1.4.3, 2.4.7Partial — literal CSS only
AC7 · A11y enforcementenforcement — no page criterionEnforcement posture (process)

Not statically assessed — these 45 Level A/AA criteria need runtime or manual evaluation (WCAG-EM): 1.1.1, 1.2.1, 1.2.2, 1.2.3, 1.2.4, 1.2.5, 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.1, 2.1.2, 2.1.4, 2.2.2, 2.3.1, 2.4.3, 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 Health55%Adequate — gated by D2, X5Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture89%Adequate — gated by D26Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity56%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness52%Adequate — gated by P2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security89%ExemplaryStrongest area.
Accessibility40%Weak — gated by AC6Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance76%StrongSolid.
Unscored — 1 check(s) recorded observations but carry no score

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

  • X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 2 control(s) we could not find positive evidence for

These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.

  • P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 51 check(s) not relevant to this codebase

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

  • AC1 Text alternatives — No image/media element found in the parsed markup — AC1 not applicable here.
  • AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
  • AX1 Captive dependencies — Not applicable: this repository's Java imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Scala imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
  • AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No class in this Java code is a Spring, JSR-330 or CDI singleton bean. No class in this Scala code is a Play controller, a Cask routes object, a Scalatra servlet, a Finatra controller, an Akka/Pekko HTTP routes holder or a JSR-330/Spring singleton, so no instance is shared between request threads.
  • 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
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • 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.
  • D10 Test Quality — ~10125 lines of test source are present (.scala) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • D11 Test Reliability — Test reliability not included — the .scala suite was found but not re-run
  • D12 Dependency Hygiene — Dependency currency not established — repo1.maven.org did not answer
  • D14 License Compliance — Not scored — this repository's 12 pinned sbt dependency coordinate(s) were read from its 1 sbt build file(s), but Maven Central could not be asked for the licence of 10 of them (HTTP 429 Too Many Requests from http://172.31.7.1:8790/maven/at/yawk/lz4/lz4-java/1.10.3/lz4-java-1.10.3.pom), and a licence verdict over part of a dependency graph is not a licence verdict. Nothing is asserted about this repository's licensing in either direction.
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D19 Documentation Quality — No runnable or published unit to look for an example in, and no multi-project root README to look for a map in; the other documentation kinds are withheld (see the gaps), so documentation quality is not applicable here.
  • D21 Naming Consistency — Naming consistency is measured on C# and TypeScript only; Java, Scala, html 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"]`.
  • D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only — this repository's production source is .java, .scala, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D25 ADR Conformance — no ADRs to check
  • D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.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.
  • D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
  • D32 Data Compliance (PII/GDPR) — 1 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
  • D36 Supply-chain Provenance & Signing — The CI pipeline builds and tests but publishes no released artifact — no package publish, container push, GitHub release or deployment step. Supply-chain provenance, signing and SBOM attest RELEASED artifacts, so there is nothing to attest here. Add them to the release pipeline when this repo starts shipping artifacts (a published package, a container image, a deployed service or a tagged release).
  • D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • D8 Code Coverage — Coverage not included — suite not readable by the collector
  • DM1 Domain Modelling — applicable but not scored (2 signals for this style, 2 needed — the count is met but a required primary signal is absent): 45 value object(s); 2 domain event(s); its domain events are published by services or handlers — no domain entity raises one
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • M4 Documentation accuracy — Not applicable: the 4 current-state document(s) make no claim of a kind M4 checks. 5 claim(s) of kinds M4 does not check were not checked (path 3, command argument 1, environment variable 1); M4 checks only links and versions and artefact counts.
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JVM source, so there is no service whose uptime a failing dependency could take down
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (`addSbtPlugin("org.scoverage" % "sbt-scoverage" % "<version>")` in `project/plugins.sbt`, then `sbt clean coverage test coverageReport`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
  • PF3 Async & latency hygiene — Not applicable: this repository declares no async functions, so there is no asynchronous code for a blocking call to stall.
  • X2 Cancellation propagation — no C# was loaded; this repository's Scala and Java 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
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Java was read, and it logs through none that an assembled message defeats: java.util.logging's level methods, log4j 1, commons-logging, JBoss Logging and Flogger take one finished message (as log4net does in C#), or it makes no call through a named logger at all. Calls made through SLF4J or log4j 2 (`org.slf4j.Logger`, `org.apache.logging.log4j.Logger`, Lombok's `@Slf4j`) would be judged.
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.

Critical — 4 finding(s)
AC2 · Forms & labels · <textarea> without a programmatic label · ×3
  • <textarea> without a programmatic label playground/index.html:724 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <textarea> without a programmatic label playground/index.html:737 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <textarea> without a programmatic label playground/index.html:745 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
D30 · Dependency Vulnerabilities · High CVE · ×1
  • REDACTED
Serious — 298 finding(s)
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×11
  • Swallowed exception (caught, then discarded) sjsonnet/src-js/sjsonnet/SjsonnetMain.scala:51 — `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) sjsonnet/src/sjsonnet/Evaluator.scala:309 — `case NonFatal(_)` 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) sjsonnet/src/sjsonnet/StaticOptimizer.scala:50 — `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) sjsonnet/src/sjsonnet/StaticOptimizer.scala:79 — `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) sjsonnet/src/sjsonnet/StaticOptimizer.scala:232 — `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) sjsonnet/src/sjsonnet/StaticOptimizer.scala:344 — `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) sjsonnet/src/sjsonnet/StaticOptimizer.scala:471 — `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) sjsonnet/src/sjsonnet/StaticOptimizer.scala:560 — `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) sjsonnet/src/sjsonnet/stdlib/StringModule.scala:1308 — `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) sjsonnet/server/src/sjsonnet/SjsonnetServerMain.scala:263 — `case NonFatal(e)` 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) sjsonnet/client/src/sjsonnet/client/SjsonnetClientMain.java:144 — `catch (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.
D3 · God Classes · FileTooLong · ×9
  • FileTooLong: sjsonnet/Val.scala sjsonnet/src/sjsonnet/Val.scala — FileTooLong — 1976 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1476 over it, 3.95× 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: sjsonnet/Evaluator.scala sjsonnet/src/sjsonnet/Evaluator.scala — FileTooLong — 1707 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: Evaluator (20-2207). The bar is 500 significant lines; this is 1207 over it, 3.41× 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: sjsonnet/Format.scala sjsonnet/src/sjsonnet/Format.scala — FileTooLong — 914 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 414 over it, 1.83× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: stdlib/ArrayModule.scala sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala — FileTooLong — 808 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 308 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: sjsonnet/Parser.scala sjsonnet/src/sjsonnet/Parser.scala — FileTooLong — 757 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 257 over it, 1.51× 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: sjsonnet/Materializer.scala sjsonnet/src/sjsonnet/Materializer.scala — FileTooLong — 754 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: Materializer (24-647). The bar is 500 significant lines; this is 254 over it, 1.51× 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: sjsonnet/SjsonnetMainBase.scala sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala — FileTooLong — 648 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 148 over it, 1.30× 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: sjsonnet/StaticOptimizer.scala sjsonnet/src/sjsonnet/StaticOptimizer.scala — FileTooLong — 546 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: StaticOptimizer (24-832). The bar is 500 significant lines; this is 46 over it, 1.09× 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: sjsonnet/Renderer.scala sjsonnet/src/sjsonnet/Renderer.scala — FileTooLong — 504 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4 over it, 1.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.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×8
  • Duplicated block (9 lines × 2) sjsonnet/src/sjsonnet/Materializer.scala:170 — sjsonnet/src/sjsonnet/Materializer.scala:170-178 | sjsonnet/src/sjsonnet/Materializer.scala:223-231 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `sjsonnet/src/sjsonnet/Materializer.scala:170` 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) sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:335 — sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:335-343 | sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:368-376 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:335` 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) sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala:129 — sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala:129-137 | sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala:207-215 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala:129` 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) sjsonnet/src/sjsonnet/stdlib/SetModule.scala:128 — sjsonnet/src/sjsonnet/stdlib/SetModule.scala:128-136 | sjsonnet/src/sjsonnet/stdlib/SetModule.scala:181-189 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/stdlib/SetModule.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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `sjsonnet/src/sjsonnet/stdlib/SetModule.scala:137` calls `out`, `a` and `sjsonnet/src/sjsonnet/stdlib/SetModule.scala:190` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (9 lines × 2) sjsonnet/src-js/sjsonnet/CharSWAR.scala:28 — sjsonnet/src-js/sjsonnet/CharSWAR.scala:28-36 | sjsonnet/src-native/sjsonnet/CharSWAR.scala:173-181 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/CharSWAR.scala` and `sjsonnet/src-native/sjsonnet/CharSWAR.scala` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 2) sjsonnet/src-js/sjsonnet/CharSWAR.scala:39 — sjsonnet/src-js/sjsonnet/CharSWAR.scala:39-47 | sjsonnet/src-native/sjsonnet/CharSWAR.scala:183-191 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/CharSWAR.scala` and `sjsonnet/src-native/sjsonnet/CharSWAR.scala` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 2) sjsonnet/src-js/sjsonnet/CharSWAR.scala:49 — sjsonnet/src-js/sjsonnet/CharSWAR.scala:49-57 | sjsonnet/src-native/sjsonnet/CharSWAR.scala:193-201 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/CharSWAR.scala` and `sjsonnet/src-native/sjsonnet/CharSWAR.scala` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 2) sjsonnet/src-jvm/sjsonnet/Platform.scala:557 — sjsonnet/src-jvm/sjsonnet/Platform.scala:557-565 | sjsonnet/src-native/sjsonnet/Platform.scala:525-533 — before extracting anything, compare `sjsonnet/src-jvm/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 84 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. Note first that the copies are not typed on the same thing: `Pattern` names `com.google.re2j.Pattern` in one and `scala.scalanative.regex.Pattern` in another — different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×7
  • Duplicated block (6 lines × 2) sjsonnet/src-js/sjsonnet/Platform.scala:169 — sjsonnet/src-js/sjsonnet/Platform.scala:169-174 | sjsonnet/src-native/sjsonnet/Platform.scala:133-138 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 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 `sjsonnet/src-js/sjsonnet/Platform.scala:169` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) sjsonnet/src/sjsonnet/Error.scala:56 — sjsonnet/src/sjsonnet/Error.scala:56-61 | sjsonnet/src/sjsonnet/Profiler.scala:99-104 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `sjsonnet/src/sjsonnet/Error.scala:56` 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 (6 lines × 2) sjsonnet/src/sjsonnet/Evaluator.scala:892 — sjsonnet/src/sjsonnet/Evaluator.scala:892-897 | sjsonnet/src/sjsonnet/Evaluator.scala:1374-1379 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/Evaluator.scala:892` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) sjsonnet/src/sjsonnet/Val.scala:1733 — sjsonnet/src/sjsonnet/Val.scala:1733-1738 | sjsonnet/src/sjsonnet/Val.scala:1752-1757 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/Val.scala:1733` 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) sjsonnet/src/sjsonnet/stdlib/StringModule.scala:1178 — sjsonnet/src/sjsonnet/stdlib/StringModule.scala:1178-1183 | sjsonnet/src/sjsonnet/stdlib/StringModule.scala:1192-1197 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/stdlib/StringModule.scala:1178` 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) sjsonnet/src-js/sjsonnet/Platform.scala:263 — sjsonnet/src-js/sjsonnet/Platform.scala:263-268 | sjsonnet/src-native/sjsonnet/Platform.scala:234-239 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (6 lines × 2) sjsonnet/src-js/sjsonnet/Platform.scala:270 — sjsonnet/src-js/sjsonnet/Platform.scala:270-275 | sjsonnet/src-native/sjsonnet/Platform.scala:241-246 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×7
  • Duplicated block (5 lines × 2) sjsonnet/src/sjsonnet/Evaluator.scala:886 — sjsonnet/src/sjsonnet/Evaluator.scala:886-890 | sjsonnet/src/sjsonnet/Evaluator.scala:1361-1366 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/Evaluator.scala:886` 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) sjsonnet/src/sjsonnet/Evaluator.scala:1125 — sjsonnet/src/sjsonnet/Evaluator.scala:1125-1129 | sjsonnet/src/sjsonnet/Evaluator.scala:1139-1146 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/Evaluator.scala:1125` 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 (5 lines × 2) sjsonnet/src/sjsonnet/ExprTransform.scala:42 — sjsonnet/src/sjsonnet/ExprTransform.scala:42-46 | sjsonnet/src/sjsonnet/ExprTransform.scala:73-77 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) sjsonnet/src-js/sjsonnet/Platform.scala:356 — sjsonnet/src-js/sjsonnet/Platform.scala:356-360 | sjsonnet/src-native/sjsonnet/Platform.scala:327-331 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) sjsonnet/src/sjsonnet/Evaluator.scala:1719 — sjsonnet/src/sjsonnet/Evaluator.scala:1719-1723 | sjsonnet/src/sjsonnet/Evaluator.scala:1728-1732 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/Evaluator.scala:1719` 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) sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:605 — sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:605-609 | sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:628-632 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:605` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (5 lines × 2) bench/src/sjsonnet/bench/MainBenchmark.scala:54 — bench/src/sjsonnet/bench/MainBenchmark.scala:54-58 | bench/src/sjsonnet/bench/RegressionBenchmark.scala:17-21 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.2 · ×6
  • Low contrast colour pair in CSS (3.2:1) playground/index.html:116 — `.status-indicator` sets color: #6c6f85 on background-color: #ccd0da — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) playground/index.html:182 — `.panel-header .download-btn` sets color: #6c6f85 on background-color: #ccd0da — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) playground/index.html:272 — `.file-item` sets color: #6c6f85 on background-color: #ccd0da — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) playground/index.html:361 — `.toolbar-btn` sets color: #6c6f85 on background-color: #ccd0da — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) playground/index.html:400 — `.copy-btn` sets color: #6c6f85 on background-color: #ccd0da — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.2:1) playground/index.html:636 — `.var-section-header` sets color: #1e66f5 on background-color: #ccd0da — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
D3 · God Classes · TooManyMethods · ×6
  • TooManyMethods: Parser sjsonnet/src/sjsonnet/Parser.scala:74 — TooManyMethods — 89 methods. The bar is 30 methods; this is 59 over it, 2.97× 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: Evaluator sjsonnet/src/sjsonnet/Evaluator.scala:20 — TooManyMethods — 78 methods. The bar is 30 methods; this is 48 over it, 2.60× 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: Platform sjsonnet/src-native/sjsonnet/Platform.scala:14 — TooManyMethods — 54 methods. The bar is 30 methods; this is 24 over it, 1.80× 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: Platform sjsonnet/src-jvm/sjsonnet/Platform.scala:21 — TooManyMethods — 50 methods. The bar is 30 methods; this is 20 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.
  • TooManyMethods: Platform sjsonnet/src-js/sjsonnet/Platform.scala:9 — TooManyMethods — 48 methods. The bar is 30 methods; this is 18 over it, 1.60× 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: Format sjsonnet/src/sjsonnet/Format.scala:16 — TooManyMethods — 44 methods. The bar is 30 methods; this is 14 over it, 1.47× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×6
  • Duplicated block (8 lines × 2) sjsonnet/src-js/sjsonnet/CharSWAR.scala:17 — sjsonnet/src-js/sjsonnet/CharSWAR.scala:17-24 | sjsonnet/src-native/sjsonnet/CharSWAR.scala:67-74 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/CharSWAR.scala` and `sjsonnet/src-native/sjsonnet/CharSWAR.scala` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (8 lines × 2) sjsonnet/src-js/sjsonnet/Platform.scala:177 — sjsonnet/src-js/sjsonnet/Platform.scala:177-184 | sjsonnet/src-native/sjsonnet/Platform.scala:141-148 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 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 `sjsonnet/src-js/sjsonnet/Platform.scala:177` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `sjsonnet/src-native/sjsonnet/Platform.scala:151` calls `Num` and `sjsonnet/src-js/sjsonnet/Platform.scala:187` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (8 lines × 2) sjsonnet/src-js/sjsonnet/Platform.scala:288 — sjsonnet/src-js/sjsonnet/Platform.scala:288-295 | sjsonnet/src-native/sjsonnet/Platform.scala:259-266 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 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 `sjsonnet/src-js/sjsonnet/Platform.scala:288` 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 (8 lines × 2) sjsonnet/src-js/sjsonnet/Platform.scala:308 — sjsonnet/src-js/sjsonnet/Platform.scala:308-315 | sjsonnet/src-native/sjsonnet/Platform.scala:279-286 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 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 `sjsonnet/src-js/sjsonnet/Platform.scala:308` 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 (8 lines × 2) sjsonnet/src-js/java/util/BitSet.scala:9 — sjsonnet/src-js/java/util/BitSet.scala:9-16 | sjsonnet/src-native/java/util/BitSet.scala:9-16 — before extracting anything, compare `sjsonnet/src-js/java/util/BitSet.scala` and `sjsonnet/src-native/java/util/BitSet.scala` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (8 lines × 2) sjsonnet/src-js/sjsonnet/Platform.scala:317 — sjsonnet/src-js/sjsonnet/Platform.scala:317-324 | sjsonnet/src-native/sjsonnet/Platform.scala:288-295 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 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.
D17 · Explicit Debt · TodoComment · ×5
  • TodoComment sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala:630 — // TODO: Get rid of the /dev/stdin special-casing (everywhere!) once we use scala-native — 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 sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala:647 — // TODO remove the `toSeq` once this is fixed in scala3 — 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 sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala:661 — // TODO remove the `toSeq` once this is fixed in scala3 — 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 sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala:692 — // TODO remove the `toSeq` once this is fixed in scala3 — 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 sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala:716 — // TODO remove the `toSeq` once this is fixed in scala3 — 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.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×5
  • Duplicated block (11 lines × 2) sjsonnet/src-js/sjsonnet/Platform.scala:156 — sjsonnet/src-js/sjsonnet/Platform.scala:156-166 | sjsonnet/src-native/sjsonnet/Platform.scala:119-129 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 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 `sjsonnet/src-js/sjsonnet/Platform.scala:156` 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) sjsonnet/src-js/sjsonnet/Platform.scala:344 — sjsonnet/src-js/sjsonnet/Platform.scala:344-354 | sjsonnet/src-native/sjsonnet/Platform.scala:315-325 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (11 lines × 2) sjsonnet/src/sjsonnet/Val.scala:1001 — sjsonnet/src/sjsonnet/Val.scala:1001-1011 | sjsonnet/src/sjsonnet/Val.scala:1327-1337 — both copies are in the same file, so extract the 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 (11 lines × 2) sjsonnet/src-jvm/sjsonnet/Platform.scala:57 — sjsonnet/src-jvm/sjsonnet/Platform.scala:57-67 | sjsonnet/src-native/sjsonnet/Platform.scala:62-72 — before extracting anything, compare `sjsonnet/src-jvm/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (11 lines × 2) sjsonnet/src/sjsonnet/BaseCharRenderer.scala:151 — sjsonnet/src/sjsonnet/BaseCharRenderer.scala:151-161 | sjsonnet/src/sjsonnet/Renderer.scala:206-216 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×4
  • Duplicated block (7 lines × 2) sjsonnet/src/sjsonnet/Materializer.scala:183 — sjsonnet/src/sjsonnet/Materializer.scala:183-189 | sjsonnet/src/sjsonnet/Materializer.scala:236-242 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/Materializer.scala:183` 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 (7 lines × 2) sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:686 — sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:686-692 | sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:710-716 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:686` 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) sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:743 — sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:743-749 | sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:755-761 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:743` 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 (7 lines × 2) sjsonnet/src/sjsonnet/Evaluator.scala:913 — sjsonnet/src/sjsonnet/Evaluator.scala:913-919 | sjsonnet/src/sjsonnet/Evaluator.scala:1424-1430 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/Evaluator.scala:913` 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.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (4.3 · ×3
  • Low contrast colour pair in CSS (4.3:1) playground/index.html:292 — `.file-item.active` sets color: #1e66f5 on background-color: #eff1f5 — 4.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (4.3:1) playground/index.html:377 — `.toolbar-btn:hover` sets color: #1e66f5 on background-color: #eff1f5 — 4.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (4.3:1) playground/index.html:545 — `.output-tab.active` sets color: #1e66f5 on background-color: #eff1f5 — 4.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
D1 · Cyclomatic Complexity · Platform.yamlScalarPrefixStart (cyclomatic 20) · ×3
  • Platform.yamlScalarPrefixStart (cyclomatic 20) sjsonnet/src-js/sjsonnet/Platform.scala:362 — Platform.yamlScalarPrefixStart 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.
  • Platform.yamlScalarPrefixStart (cyclomatic 20) sjsonnet/src-jvm/sjsonnet/Platform.scala:401 — Platform.yamlScalarPrefixStart 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.
  • Platform.yamlScalarPrefixStart (cyclomatic 20) sjsonnet/src-native/sjsonnet/Platform.scala:333 — Platform.yamlScalarPrefixStart 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.
D15 · Churn × Complexity Hotspots · Hotspot · ×3
  • Hotspot: sjsonnet/src/sjsonnet/Format.scala sjsonnet/src/sjsonnet/Format.scala:627 — sjsonnet/src/sjsonnet/Format.scala changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in Format.format at line 627. 7 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 12:31:21 -07:00' --until='2026-10-20 12:31:21 -07:00' --full-history --no-merges -- sjsonnet/src/sjsonnet/Format.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: sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala:130 — sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in SjsonnetMainBase.main0 at line 130. 1 of those changes was a fix/bug commit, and the other 2 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 12:31:21 -07:00' --until='2026-10-20 12:31:21 -07:00' --full-history --no-merges -- sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.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: sjsonnet/src/sjsonnet/Parser.scala sjsonnet/src/sjsonnet/Parser.scala:836 — sjsonnet/src/sjsonnet/Parser.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Parser.objinside at line 836. 2 of those changes were fix/bug commits, and the other 3 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 12:31:21 -07:00' --until='2026-10-20 12:31:21 -07:00' --full-history --no-merges -- sjsonnet/src/sjsonnet/Parser.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.
D2 · Cognitive Complexity · Platform.yamlScalarPrefixStart (cognitive 27) · ×3
  • Platform.yamlScalarPrefixStart (cognitive 27) sjsonnet/src-js/sjsonnet/Platform.scala:362 — Platform.yamlScalarPrefixStart has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 8, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Platform.yamlScalarPrefixStart (cognitive 27) sjsonnet/src-jvm/sjsonnet/Platform.scala:401 — Platform.yamlScalarPrefixStart has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 8, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Platform.yamlScalarPrefixStart (cognitive 27) sjsonnet/src-native/sjsonnet/Platform.scala:333 — Platform.yamlScalarPrefixStart has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 8, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×3
  • Duplicated block (14 lines × 2) sjsonnet/src/sjsonnet/BaseByteRenderer.scala:83 — sjsonnet/src/sjsonnet/BaseByteRenderer.scala:83-96 | sjsonnet/src/sjsonnet/BaseCharRenderer.scala:121-134 — 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 `sjsonnet/src/sjsonnet/BaseByteRenderer.scala:83` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (14 lines × 2) sjsonnet/src/sjsonnet/BaseByteRenderer.scala:458 — sjsonnet/src/sjsonnet/BaseByteRenderer.scala:458-471 | sjsonnet/src/sjsonnet/ByteRenderer.scala:88-101 — 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 `sjsonnet/src/sjsonnet/BaseByteRenderer.scala:458` 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) sjsonnet/src/sjsonnet/Format.scala:689 — sjsonnet/src/sjsonnet/Format.scala:689-702 | sjsonnet/src/sjsonnet/Format.scala:723-736 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `sjsonnet/src/sjsonnet/Format.scala:703` calls `withStarWidth`, `value` and `sjsonnet/src/sjsonnet/Format.scala:737` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×3
  • Duplicated block (13 lines × 2) sjsonnet/src/sjsonnet/BaseByteRenderer.scala:150 — sjsonnet/src/sjsonnet/BaseByteRenderer.scala:150-162 | sjsonnet/src/sjsonnet/BaseCharRenderer.scala:188-200 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (13 lines × 2) sjsonnet/src/sjsonnet/Evaluator.scala:329 — sjsonnet/src/sjsonnet/Evaluator.scala:329-341 | sjsonnet/src/sjsonnet/Evaluator.scala:1637-1649 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/Evaluator.scala:329` 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) sjsonnet/src/sjsonnet/stdlib/SetModule.scala:144 — sjsonnet/src/sjsonnet/stdlib/SetModule.scala:144-156 | sjsonnet/src/sjsonnet/stdlib/SetModule.scala:193-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 `sjsonnet/src/sjsonnet/stdlib/SetModule.scala:144` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `sjsonnet/src/sjsonnet/stdlib/SetModule.scala:142` calls `out`, `b` and `sjsonnet/src/sjsonnet/stdlib/SetModule.scala:192` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×3
  • Duplicated block (12 lines × 2) sjsonnet/src-js/sjsonnet/Platform.scala:250 — sjsonnet/src-js/sjsonnet/Platform.scala:250-261 | sjsonnet/src-native/sjsonnet/Platform.scala:221-232 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (12 lines × 2) sjsonnet/src-js/sjsonnet/stdlib/PlatformBase64.scala:12 — sjsonnet/src-js/sjsonnet/stdlib/PlatformBase64.scala:12-23 | sjsonnet/src-jvm/sjsonnet/stdlib/PlatformBase64.scala:12-31 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (12 lines × 2) sjsonnet/src-js/sjsonnet/Platform.scala:91 — sjsonnet/src-js/sjsonnet/Platform.scala:91-102 | sjsonnet/src-native/sjsonnet/Platform.scala:37-48 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×3
  • Duplicated block (10 lines × 2) sjsonnet/src-js/sjsonnet/Platform.scala:238 — sjsonnet/src-js/sjsonnet/Platform.scala:238-247 | sjsonnet/src-native/sjsonnet/Platform.scala:209-218 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (10 lines × 2) sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:345 — sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:345-354 | sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:379-389 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:345` 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) sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala:101 — sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala:101-110 | sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala:148-157 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala:101` 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 × 3) · ×3
  • Duplicated block (8 lines × 3) sjsonnet/src-js/sjsonnet/Platform.scala:363 — sjsonnet/src-js/sjsonnet/Platform.scala:363-370 | sjsonnet/src-jvm/sjsonnet/Platform.scala:402-409 | sjsonnet/src-native/sjsonnet/Platform.scala:334-341 — 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 `sjsonnet/src-js/sjsonnet/Platform.scala:363` 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) sjsonnet/src-js/sjsonnet/Platform.scala:381 — sjsonnet/src-js/sjsonnet/Platform.scala:381-388 | sjsonnet/src-jvm/sjsonnet/Platform.scala:420-427 | sjsonnet/src-native/sjsonnet/Platform.scala:352-359 — 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 `sjsonnet/src-js/sjsonnet/Platform.scala:381` 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 (8 lines × 3) sjsonnet/src/sjsonnet/stdlib/ObjectModule.scala:84 — sjsonnet/src/sjsonnet/stdlib/ObjectModule.scala:84-91 | sjsonnet/src/sjsonnet/stdlib/ObjectModule.scala:104-111 | sjsonnet/src/sjsonnet/stdlib/ObjectModule.scala:119-126 — 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 `sjsonnet/src/sjsonnet/stdlib/ObjectModule.scala:84` 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.
X3 · Exception handling · Swallowed exception (empty catch) · ×3
  • Swallowed exception (empty catch) sjsonnet/client/src/sjsonnet/client/Locks.java:27 — 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) sjsonnet/client/src/sjsonnet/client/Locks.java:28 — 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) sjsonnet/client/src/sjsonnet/client/Locks.java:29 — 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.
D35 · Change Coupling · Change coupling · ×2
  • Change coupling: BaseByteRenderer.scala ↔ BaseCharRenderer.scala sjsonnet/src/sjsonnet/BaseByteRenderer.scala:1 — `sjsonnet/src/sjsonnet/BaseByteRenderer.scala` and `sjsonnet/src/sjsonnet/BaseCharRenderer.scala` change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; 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 `16e868e8` perf: speed up direct long rendering (#1087); `3abe44a3` Make mutable scratch buffers a part of the Renderer (#1050); `ee9e0849` fix: escapeStringJson escapes DEL and C1 control characters (#1005) — run `git show` on any of them.
  • Change coupling: Config.scala ↔ Settings.scala sjsonnet/src-jvm-native/sjsonnet/Config.scala:1 — `sjsonnet/src-jvm-native/sjsonnet/Config.scala` and `sjsonnet/src/sjsonnet/Settings.scala` change together 59% of the time (10 of the 17 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 10 shared commits counted here, the most recent 3 are `87d30a55` Align CLI behavior with go-jsonnet (#1068); `b9aad586` perf: promote hot-path evaluator to default; remove dual-evaluator fl…; `46e11e8f` Add --max-stack / -s flag to limit stack depth (#637) — run `git show` on any of them.
D4 · Code Duplication · Duplicated block (12 lines × 3) · ×2
  • Duplicated block (12 lines × 3) sjsonnet/src-js/sjsonnet/Platform.scala:401 — sjsonnet/src-js/sjsonnet/Platform.scala:401-412 | sjsonnet/src-jvm/sjsonnet/Platform.scala:440-451 | sjsonnet/src-native/sjsonnet/Platform.scala:372-383 — 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 (12 lines × 3) sjsonnet/src-js/sjsonnet/Platform.scala:425 — sjsonnet/src-js/sjsonnet/Platform.scala:425-436 | sjsonnet/src-jvm/sjsonnet/Platform.scala:464-475 | sjsonnet/src-native/sjsonnet/Platform.scala:396-407 — 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.
D4 · Code Duplication · Duplicated block (11 lines × 3) · ×2
  • Duplicated block (11 lines × 3) sjsonnet/src/sjsonnet/Val.scala:2512 — sjsonnet/src/sjsonnet/Val.scala:2512-2522 | sjsonnet/src/sjsonnet/Val.scala:2538-2548 | sjsonnet/src/sjsonnet/Val.scala:2559-2569 — 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 (11 lines × 3) sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:1116 — sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:1116-1126 | sjsonnet/src/sjsonnet/stdlib/SetModule.scala:481-491 | sjsonnet/src/sjsonnet/stdlib/StringModule.scala:1320-1330 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. 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 (6–7 lines × 2) · ×2
  • Duplicated block (6–7 lines × 2) sjsonnet/src-js/sjsonnet/SjsonnetMain.scala:76 — sjsonnet/src-js/sjsonnet/SjsonnetMain.scala:76-82 | sjsonnet/src-js/sjsonnet/SjsonnetMain.scala:155-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 `sjsonnet/src-js/sjsonnet/SjsonnetMain.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–7 lines × 2) sjsonnet/src/sjsonnet/Evaluator.scala:1796 — sjsonnet/src/sjsonnet/Evaluator.scala:1796-1802 | sjsonnet/src/sjsonnet/Evaluator.scala:1945-1950 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×2
  • Duplicated block (6 lines × 3) sjsonnet/src/sjsonnet/FastLongRenderer.scala:110 — sjsonnet/src/sjsonnet/FastLongRenderer.scala:110-115 | sjsonnet/src/sjsonnet/FastLongRenderer.scala:122-127 | sjsonnet/src/sjsonnet/FastLongRenderer.scala:136-141 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (6 lines × 3) sjsonnet/src-js/sjsonnet/Platform.scala:135 — sjsonnet/src-js/sjsonnet/Platform.scala:135-140 | sjsonnet/src-jvm/sjsonnet/Platform.scala:153-158 | sjsonnet/src-native/sjsonnet/Platform.scala:98-103 — 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.
IC1 · Incompleteness & stubs · Empty method body · ×2
  • Empty method body — does nothing with its inputs sjsonnet/src-js/sjsonnet/Platform.scala:560 — `appendMemoryStats` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
  • Empty method body — does nothing with its inputs sjsonnet/src-native/sjsonnet/Platform.scala:535 — `appendMemoryStats` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
X17 · Uncapped recursion over a caller-supplied document · Recursive walk over a caller-supplied document has no depth cap · ×2
  • Recursive walk over a caller-supplied document has no depth cap sjsonnet/src/sjsonnet/Materializer.scala:594 — `reverse` is public and takes `v: ujson.Value` from its caller, and it calls itself at line 594 with a piece of `v`, not as a tail call the compiler turns into a loop — and nowhere in `reverse` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. On the JVM's default 1 MB thread stack a walk like this one throws `StackOverflowError` from about 500–2,000 levels on a cold first call and 6,000–17,000 once warmed up (OpenJDK 21 and 25), while `ujson.read`, Jackson's `readTree` before 2.15 and circe before 0.14.16 accept any nesting (2,000,000 levels from 4 MB) and circe 0.14.16 accepts 4,096 — on a cold JVM even play-json's cap of 1,000 is past the point the walk fails. `StackOverflowError` is not `NonFatal`: `Try`, `case NonFatal(e)` and `recover` do not stop it, and in a `Future` on the global execution context it leaves the future forever incomplete. Thread a depth argument through `reverse` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap sjsonnet/src/sjsonnet/Materializer.scala:621 — `toExpr` is public and takes `v: ujson.Value` from its caller, and it calls itself at line 621 with a piece of `v`, not as a tail call the compiler turns into a loop — and nowhere in `toExpr` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. On the JVM's default 1 MB thread stack a walk like this one throws `StackOverflowError` from about 500–2,000 levels on a cold first call and 6,000–17,000 once warmed up (OpenJDK 21 and 25), while `ujson.read`, Jackson's `readTree` before 2.15 and circe before 0.14.16 accept any nesting (2,000,000 levels from 4 MB) and circe 0.14.16 accepts 4,096 — on a cold JVM even play-json's cap of 1,000 is past the point the walk fails. `StackOverflowError` is not `NonFatal`: `Try`, `case NonFatal(e)` and `recover` do not stop it, and in a `Future` on the global execution context it leaves the future forever incomplete. Thread a depth argument through `toExpr` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
AC3 · Page structure · Page without a main landmark · ×1
  • Page without a main landmark playground/index.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
AC6 · Visual & motion safety · Animation without a prefers-reduced-motion guard · ×1
  • Animation without a prefers-reduced-motion guard playground/index.html:604 — `.vars-panel .panel-header .toggle-icon` moves (`transition: transform 0.2s`) 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.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (4.1 · ×1
  • Low contrast colour pair in CSS (4.1:1) playground/index.html:153 — `.panel-header` sets color: #6c6f85 on background-color: #e6e9ef — 4.1: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.3 · ×1
  • Low contrast colour pair in CSS (3.3:1) playground/index.html:458 — `.CodeMirror-hint-active` sets color: #1e1e2e on background-color: #1e66f5 — 3.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC7 · A11y enforcement · Accessibility enforcement below the top rung · ×1
  • Accessibility enforcement below the top rung — No accessibility enforcement found — no accessibility linting at author time and no automated accessibility check in tests or CI. Add your UI toolkit's own accessibility assertion to the test suite (Flutter `meetsGuideline`, Espresso `AccessibilityChecks`, XCTest `performAccessibilityAudit`), then gate that test in the pipeline. What was searched, so you can tell an absence from a miss: the 1 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
D1 · Cyclomatic Complexity · index.html.jsonnetHint (cyclomatic 104) · ×1
  • index.html.jsonnetHint (cyclomatic 104) playground/index.html:1190 — index.html.jsonnetHint has cyclomatic complexity 104 (threshold 15). Of this number, 100 points are the body's own statements and 4 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 · ExprTransform.rec (cyclomatic 83) · ×1
  • ExprTransform.rec (cyclomatic 83) sjsonnet/src/sjsonnet/ExprTransform.scala:10 — ExprTransform.rec has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Materializer.hasSelfRefExpr (cyclomatic 81) · ×1
  • Materializer.hasSelfRefExpr (cyclomatic 81) sjsonnet/src/sjsonnet/Materializer.scala:862 — Materializer.hasSelfRefExpr has cyclomatic complexity 81 (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 · Format.format (cyclomatic 71) · ×1
  • Format.format (cyclomatic 71) sjsonnet/src/sjsonnet/Format.scala:627 — Format.format has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent 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 · Evaluator.visitBinaryOp (cyclomatic 62) · ×1
  • Evaluator.visitBinaryOp (cyclomatic 62) sjsonnet/src/sjsonnet/Evaluator.scala:1360 — Evaluator.visitBinaryOp has cyclomatic complexity 62 (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 · Format.scanFormat (cyclomatic 57) · ×1
  • Format.scanFormat (cyclomatic 57) sjsonnet/src/sjsonnet/Format.scala:351 — Format.scanFormat has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Platform.yamlNodeToJson (cyclomatic 55) · ×1
  • Platform.yamlNodeToJson (cyclomatic 55) sjsonnet/src-jvm/sjsonnet/Platform.scala:178 — Platform.yamlNodeToJson has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SjsonnetMainBase.main0 (cyclomatic 42) · ×1
  • SjsonnetMainBase.main0 (cyclomatic 42) sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala:130 — SjsonnetMainBase.main0 has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Evaluator.tryInlineArith (cyclomatic 42) · ×1
  • Evaluator.tryInlineArith (cyclomatic 42) sjsonnet/src/sjsonnet/Evaluator.scala:254 — Evaluator.tryInlineArith has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · StaticOptimizer.transform (cyclomatic 41) · ×1
  • StaticOptimizer.transform (cyclomatic 41) sjsonnet/src/sjsonnet/StaticOptimizer.scala:36 — StaticOptimizer.transform has cyclomatic complexity 41 (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 · SjsonnetMainBase.mainConfigured (cyclomatic 39) · ×1
  • SjsonnetMainBase.mainConfigured (cyclomatic 39) sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala:613 — SjsonnetMainBase.mainConfigured has cyclomatic complexity 39 (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 · Evaluator.visitMemberList (cyclomatic 39) · ×1
  • Evaluator.visitMemberList (cyclomatic 39) sjsonnet/src/sjsonnet/Evaluator.scala:1761 — Evaluator.visitMemberList has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Parser.expr (cyclomatic 37) · ×1
  • Parser.expr (cyclomatic 37) sjsonnet/src/sjsonnet/Parser.scala:592 — Parser.expr has cyclomatic complexity 37 (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 · Obj.valueRaw (cyclomatic 37) · ×1
  • Obj.valueRaw (cyclomatic 37) sjsonnet/src/sjsonnet/Val.scala:2498 — Obj.valueRaw has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · StaticOptimizer.tryFoldBinaryOp (cyclomatic 36) · ×1
  • StaticOptimizer.tryFoldBinaryOp (cyclomatic 36) sjsonnet/src/sjsonnet/StaticOptimizer.scala:473 — StaticOptimizer.tryFoldBinaryOp has cyclomatic complexity 36 (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 · PrettyYamlRenderer.isYamlDateExact (cyclomatic 34) · ×1
  • PrettyYamlRenderer.isYamlDateExact (cyclomatic 34) sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:506 — PrettyYamlRenderer.isYamlDateExact has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Platform.nodeToJson (cyclomatic 33) · ×1
  • Platform.nodeToJson (cyclomatic 33) sjsonnet/src-native/sjsonnet/Platform.scala:115 — Platform.nodeToJson has cyclomatic complexity 33 (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 · Evaluator.visitExprWithTailCallSupport (cyclomatic 32) · ×1
  • Evaluator.visitExprWithTailCallSupport (cyclomatic 32) sjsonnet/src/sjsonnet/Evaluator.scala:1624 — Evaluator.visitExprWithTailCallSupport has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · StaticOptimizer.tryFoldAsDouble (cyclomatic 31) · ×1
  • StaticOptimizer.tryFoldAsDouble (cyclomatic 31) sjsonnet/src/sjsonnet/StaticOptimizer.scala:184 — StaticOptimizer.tryFoldAsDouble 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 · Platform.nodeToJson (cyclomatic 30) · ×1
  • Platform.nodeToJson (cyclomatic 30) sjsonnet/src-js/sjsonnet/Platform.scala:152 — Platform.nodeToJson has cyclomatic complexity 30 (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 · PrettyYamlRenderer.writeDoubleQuoted (cyclomatic 29) · ×1
  • PrettyYamlRenderer.writeDoubleQuoted (cyclomatic 29) sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:305 — PrettyYamlRenderer.writeDoubleQuoted has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · PrettyYamlRenderer.isYamlNumberExact (cyclomatic 29) · ×1
  • PrettyYamlRenderer.isYamlNumberExact (cyclomatic 29) sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:566 — PrettyYamlRenderer.isYamlNumberExact has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · index.html.detectCodeMirrorMode (cyclomatic 29) · ×1
  • index.html.detectCodeMirrorMode (cyclomatic 29) playground/index.html:1806 — index.html.detectCodeMirrorMode has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Evaluator.equal (cyclomatic 27) · ×1
  • Evaluator.equal (cyclomatic 27) sjsonnet/src/sjsonnet/Evaluator.scala:2142 — Evaluator.equal has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: Evaluator.visitExprCold (cyclomatic 31) 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 · Parser.expr2 (cyclomatic 27) · ×1
  • Parser.expr2 (cyclomatic 27) sjsonnet/src/sjsonnet/Parser.scala:787 — Parser.expr2 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 · StaticOptimizer.markTailCalls (cyclomatic 27) · ×1
  • StaticOptimizer.markTailCalls (cyclomatic 27) sjsonnet/src/sjsonnet/StaticOptimizer.scala:771 — StaticOptimizer.markTailCalls has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Join.evalRhs (cyclomatic 27) · ×1
  • Join.evalRhs (cyclomatic 27) sjsonnet/src/sjsonnet/stdlib/StringModule.scala:688 — Join.evalRhs has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Evaluator.visitBinaryOpAsDouble (cyclomatic 26) · ×1
  • Evaluator.visitBinaryOpAsDouble (cyclomatic 26) sjsonnet/src/sjsonnet/Evaluator.scala:885 — Evaluator.visitBinaryOpAsDouble 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. This is NOT this file's highest cyclomatic complexity: Evaluator.visitExprCold (cyclomatic 31) 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 · StaticOptimizer.hasNonRecursiveExit (cyclomatic 25) · ×1
  • StaticOptimizer.hasNonRecursiveExit (cyclomatic 25) sjsonnet/src/sjsonnet/StaticOptimizer.scala:673 — StaticOptimizer.hasNonRecursiveExit has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Evaluator.visitObjComp (cyclomatic 23) · ×1
  • Evaluator.visitObjComp (cyclomatic 23) sjsonnet/src/sjsonnet/Evaluator.scala:1939 — Evaluator.visitObjComp has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: Evaluator.visitExprCold (cyclomatic 31) 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 · Parser.objinside (cyclomatic 23) · ×1
  • Parser.objinside (cyclomatic 23) sjsonnet/src/sjsonnet/Parser.scala:836 — Parser.objinside has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · PrettyYamlRenderer.isYamlOctalHex (cyclomatic 23) · ×1
  • PrettyYamlRenderer.isYamlOctalHex (cyclomatic 23) sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:637 — PrettyYamlRenderer.isYamlOctalHex has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · PythonRenderer.formatPythonFloat (cyclomatic 23) · ×1
  • PythonRenderer.formatPythonFloat (cyclomatic 23) sjsonnet/src/sjsonnet/Renderer.scala:473 — PythonRenderer.formatPythonFloat has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Evaluator.isInvariantExpr (cyclomatic 21) · ×1
  • Evaluator.isInvariantExpr (cyclomatic 21) sjsonnet/src/sjsonnet/Evaluator.scala:671 — Evaluator.isInvariantExpr 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: Evaluator.visitExprCold (cyclomatic 31) 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 · SetModule.sortArrSlow (cyclomatic 21) · ×1
  • SetModule.sortArrSlow (cyclomatic 21) sjsonnet/src/sjsonnet/stdlib/SetModule.scala:370 — SetModule.sortArrSlow has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Func.apply (cyclomatic 20) · ×1
  • Func.apply (cyclomatic 20) sjsonnet/src/sjsonnet/Val.scala:2822 — Func.apply 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 · DecimalFormat.format (cyclomatic 19) · ×1
  • DecimalFormat.format (cyclomatic 19) sjsonnet/src/sjsonnet/DecimalFormat.scala:49 — DecimalFormat.format has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Evaluator.visitComp (cyclomatic 19) · ×1
  • Evaluator.visitComp (cyclomatic 19) sjsonnet/src/sjsonnet/Evaluator.scala:351 — Evaluator.visitComp has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: Evaluator.visitExprCold (cyclomatic 31) 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 · Materializer.materializeStackless (cyclomatic 19) · ×1
  • Materializer.materializeStackless (cyclomatic 19) sjsonnet/src/sjsonnet/Materializer.scala:365 — Materializer.materializeStackless has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Parser.tripleBarStringBodyBulk (cyclomatic 19) · ×1
  • Parser.tripleBarStringBodyBulk (cyclomatic 19) sjsonnet/src/sjsonnet/Parser.scala:390 — Parser.tripleBarStringBodyBulk has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Materializer.hasSelfRefInMemberList (cyclomatic 18) · ×1
  • Materializer.hasSelfRefInMemberList (cyclomatic 18) sjsonnet/src/sjsonnet/Materializer.scala:800 — Materializer.hasSelfRefInMemberList 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 · index.html.getMimeType (cyclomatic 18) · ×1
  • index.html.getMimeType (cyclomatic 18) playground/index.html:1688 — index.html.getMimeType has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · Util.slice (cyclomatic 17) · ×1
  • Util.slice (cyclomatic 17) sjsonnet/src/sjsonnet/Util.scala:37 — Util.slice has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · ByteRenderer.materializeChild (cyclomatic 16) · ×1
  • ByteRenderer.materializeChild (cyclomatic 16) sjsonnet/src/sjsonnet/ByteRenderer.scala:210 — ByteRenderer.materializeChild has cyclomatic complexity 16 (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 · Error.formatError (cyclomatic 16) · ×1
  • Error.formatError (cyclomatic 16) sjsonnet/src/sjsonnet/Error.scala:108 — Error.formatError 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 · PrettyYamlRenderer.isYamlFloatFromDot (cyclomatic 16) · ×1
  • PrettyYamlRenderer.isYamlFloatFromDot (cyclomatic 16) sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:618 — PrettyYamlRenderer.isYamlFloatFromDot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · StaticOptimizer.rebindApply (cyclomatic 16) · ×1
  • StaticOptimizer.rebindApply (cyclomatic 16) sjsonnet/src/sjsonnet/StaticOptimizer.scala:361 — StaticOptimizer.rebindApply has cyclomatic complexity 16 (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 · Obj.addSuper (cyclomatic 16) · ×1
  • Obj.addSuper (cyclomatic 16) sjsonnet/src/sjsonnet/Val.scala:2125 — Obj.addSuper 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 · ArrayModule.tryStringBuilderFromBinaryOp (cyclomatic 16) · ×1
  • ArrayModule.tryStringBuilderFromBinaryOp (cyclomatic 16) sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:667 — ArrayModule.tryStringBuilderFromBinaryOp 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 · Filter.evalRhs (cyclomatic 16) · ×1
  • Filter.evalRhs (cyclomatic 16) sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:325 — Filter.evalRhs 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 · ManifestModule.isXmlNameStartChar (cyclomatic 16) · ×1
  • ManifestModule.isXmlNameStartChar (cyclomatic 16) sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala:40 — ManifestModule.isXmlNameStartChar has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · ManifestTomlEx.renderTableInternal (cyclomatic 16) · ×1
  • ManifestTomlEx.renderTableInternal (cyclomatic 16) sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala:286 — ManifestTomlEx.renderTableInternal 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 · Clamp.apply (cyclomatic 16) · ×1
  • Clamp.apply (cyclomatic 16) sjsonnet/src/sjsonnet/stdlib/MathModule.scala:80 — Clamp.apply 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.
D17 · Explicit Debt · FixmeComment · ×1
  • FixmeComment sjsonnet/test/src-jvm-native/sjsonnet/PrettyYamlRendererTests.scala:34 — // FIXME: how to turn off the mill sandbox? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
D2 · Cognitive Complexity · Format.format (cognitive 172) · ×1
  • Format.format (cognitive 172) sjsonnet/src/sjsonnet/Format.scala:627 — Format.format has cognitive complexity 172 (threshold 15). Drivers by points: if/else 50 (139 pts), match/switch 9 (25 pts), boolean chains 7, loops 1 (nesting depth added 105). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.html.jsonnetHint (cognitive 168) · ×1
  • index.html.jsonnetHint (cognitive 168) playground/index.html:1190 — index.html.jsonnetHint has cognitive complexity 168 (threshold 15). Drivers by points: if/else 45 (97 pts), loops 15 (37 pts), boolean chains 32, ternaries 1 (2 pts) (nesting depth added 75). Of this number, 162 points are the body's own statements and 6 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 · SjsonnetMainBase.main0 (cognitive 141) · ×1
  • SjsonnetMainBase.main0 (cognitive 141) sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala:130 — SjsonnetMainBase.main0 has cognitive complexity 141 (threshold 15). Drivers by points: if/else 35 (83 pts), loops 9 (45 pts), match/switch 3 (8 pts), boolean chains 5 (nesting depth added 89). 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 · Platform.yamlNodeToJson (cognitive 121) · ×1
  • Platform.yamlNodeToJson (cognitive 121) sjsonnet/src-jvm/sjsonnet/Platform.scala:178 — Platform.yamlNodeToJson has cognitive complexity 121 (threshold 15). Drivers by points: if/else 44 (81 pts), match/switch 5 (15 pts), loops 4 (13 pts), boolean chains 12 (nesting depth added 56). 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 · ExprTransform.rec (cognitive 115) · ×1
  • ExprTransform.rec (cognitive 115) sjsonnet/src/sjsonnet/ExprTransform.scala:10 — ExprTransform.rec has cognitive complexity 115 (threshold 15). Drivers by points: if/else 63 (94 pts), boolean chains 20, match/switch 1 (nesting depth added 31). 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 · Obj.valueRaw (cognitive 112) · ×1
  • Obj.valueRaw (cognitive 112) sjsonnet/src/sjsonnet/Val.scala:2498 — Obj.valueRaw has cognitive complexity 112 (threshold 15). Drivers by points: if/else 32 (78 pts), match/switch 4 (19 pts), boolean chains 12, loops 1 (3 pts) (nesting depth added 63). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Format.scanFormat (cognitive 104) · ×1
  • Format.scanFormat (cognitive 104) sjsonnet/src/sjsonnet/Format.scala:351 — Format.scanFormat has cognitive complexity 104 (threshold 15). Drivers by points: if/else 37 (67 pts), loops 6 (18 pts), boolean chains 16, match/switch 1 (3 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SjsonnetMainBase.mainConfigured (cognitive 82) · ×1
  • SjsonnetMainBase.mainConfigured (cognitive 82) sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala:613 — SjsonnetMainBase.mainConfigured has cognitive complexity 82 (threshold 15). Drivers by points: if/else 18 (31 pts), match/switch 11 (23 pts), loops 5 (20 pts), error handling 4 (7 pts), boolean chains 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Evaluator.visitMemberList (cognitive 76) · ×1
  • Evaluator.visitMemberList (cognitive 76) sjsonnet/src/sjsonnet/Evaluator.scala:1761 — Evaluator.visitMemberList has cognitive complexity 76 (threshold 15). Drivers by points: if/else 36 (56 pts), loops 4 (7 pts), match/switch 3 (7 pts), boolean chains 6 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Evaluator.visitBinaryOp (cognitive 73) · ×1
  • Evaluator.visitBinaryOp (cognitive 73) sjsonnet/src/sjsonnet/Evaluator.scala:1360 — Evaluator.visitBinaryOp has cognitive complexity 73 (threshold 15). Drivers by points: if/else 27 (49 pts), match/switch 10 (21 pts), boolean chains 3 (nesting depth added 33). 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 · Evaluator.visitExprWithTailCallSupport (cognitive 64) · ×1
  • Evaluator.visitExprWithTailCallSupport (cognitive 64) sjsonnet/src/sjsonnet/Evaluator.scala:1624 — Evaluator.visitExprWithTailCallSupport has cognitive complexity 64 (threshold 15). Drivers by points: if/else 24 (42 pts), match/switch 8 (19 pts), loops 1 (3 pts) (nesting depth added 31). 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 · Join.evalRhs (cognitive 64) · ×1
  • Join.evalRhs (cognitive 64) sjsonnet/src/sjsonnet/stdlib/StringModule.scala:688 — Join.evalRhs has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (43 pts), match/switch 4 (11 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 37). 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 · Evaluator.visitComp (cognitive 60) · ×1
  • Evaluator.visitComp (cognitive 60) sjsonnet/src/sjsonnet/Evaluator.scala:351 — Evaluator.visitComp has cognitive complexity 60 (threshold 15). Drivers by points: if/else 17 (42 pts), match/switch 5 (16 pts), boolean chains 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Evaluator.equal (cognitive 59) · ×1
  • Evaluator.equal (cognitive 59) sjsonnet/src/sjsonnet/Evaluator.scala:2142 — Evaluator.equal has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (42 pts), match/switch 5 (9 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 34). 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 · Func.apply (cognitive 58) · ×1
  • Func.apply (cognitive 58) sjsonnet/src/sjsonnet/Val.scala:2822 — Func.apply has cognitive complexity 58 (threshold 15). Drivers by points: if/else 22 (50 pts), loops 2 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Evaluator.tryInlineArith (cognitive 56) · ×1
  • Evaluator.tryInlineArith (cognitive 56) sjsonnet/src/sjsonnet/Evaluator.scala:254 — Evaluator.tryInlineArith has cognitive complexity 56 (threshold 15). Drivers by points: if/else 29 (45 pts), boolean chains 10, match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Evaluator.visitObjComp (cognitive 54) · ×1
  • Evaluator.visitObjComp (cognitive 54) sjsonnet/src/sjsonnet/Evaluator.scala:1939 — Evaluator.visitObjComp has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (39 pts), loops 3 (10 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Parser.objinside (cognitive 54) · ×1
  • Parser.objinside (cognitive 54) sjsonnet/src/sjsonnet/Parser.scala:836 — Parser.objinside has cognitive complexity 54 (threshold 15). Drivers by points: if/else 23 (39 pts), match/switch 5 (12 pts), boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SetModule.sortArrSlow (cognitive 54) · ×1
  • SetModule.sortArrSlow (cognitive 54) sjsonnet/src/sjsonnet/stdlib/SetModule.scala:370 — SetModule.sortArrSlow has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (33 pts), loops 6 (21 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DecimalFormat.format (cognitive 52) · ×1
  • DecimalFormat.format (cognitive 52) sjsonnet/src/sjsonnet/DecimalFormat.scala:49 — DecimalFormat.format has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (38 pts), loops 3 (11 pts), boolean chains 2, match/switch 1 (nesting depth added 26). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Materializer.materializeStackless (cognitive 50) · ×1
  • Materializer.materializeStackless (cognitive 50) sjsonnet/src/sjsonnet/Materializer.scala:365 — Materializer.materializeStackless has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 4 (12 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Filter.evalRhs (cognitive 50) · ×1
  • Filter.evalRhs (cognitive 50) sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:325 — Filter.evalRhs has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 6 (20 pts), match/switch 1 (2 pts), boolean chains 1 (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 · StaticOptimizer.tryFoldBinaryOp (cognitive 46) · ×1
  • StaticOptimizer.tryFoldBinaryOp (cognitive 46) sjsonnet/src/sjsonnet/StaticOptimizer.scala:473 — StaticOptimizer.tryFoldBinaryOp has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 12 (23 pts), if/else 17 (21 pts), boolean chains 1, error handling 1 (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 · Materializer.hasSelfRefExpr (cognitive 45) · ×1
  • Materializer.hasSelfRefExpr (cognitive 45) sjsonnet/src/sjsonnet/Materializer.scala:862 — Materializer.hasSelfRefExpr has cognitive complexity 45 (threshold 15). Drivers by points: boolean chains 32, if/else 6 (8 pts), match/switch 3 (5 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · Parser.tripleBarStringBodyBulk (cognitive 45) · ×1
  • Parser.tripleBarStringBodyBulk (cognitive 45) sjsonnet/src/sjsonnet/Parser.scala:390 — Parser.tripleBarStringBodyBulk has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 3 (11 pts), boolean chains 8, match/switch 1 (nesting depth added 23). 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 · PythonRenderer.formatPythonFloat (cognitive 45) · ×1
  • PythonRenderer.formatPythonFloat (cognitive 45) sjsonnet/src/sjsonnet/Renderer.scala:473 — PythonRenderer.formatPythonFloat has cognitive complexity 45 (threshold 15). Drivers by points: if/else 28 (36 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · StaticOptimizer.tryFoldAsDouble (cognitive 43) · ×1
  • StaticOptimizer.tryFoldAsDouble (cognitive 43) sjsonnet/src/sjsonnet/StaticOptimizer.scala:184 — StaticOptimizer.tryFoldAsDouble has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (36 pts), match/switch 3 (5 pts), boolean chains 1, error handling 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArrayModule.tryStringBuilderFromBinaryOp (cognitive 42) · ×1
  • ArrayModule.tryStringBuilderFromBinaryOp (cognitive 42) sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:667 — ArrayModule.tryStringBuilderFromBinaryOp has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 4 (10 pts), loops 2 (5 pts), boolean chains 3 (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 · Platform.nodeToJson (cognitive 41) · ×1
  • Platform.nodeToJson (cognitive 41) sjsonnet/src-native/sjsonnet/Platform.scala:115 — Platform.nodeToJson has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 4 (11 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 18). 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 · PrettyYamlRenderer.writeDoubleQuoted (cognitive 40) · ×1
  • PrettyYamlRenderer.writeDoubleQuoted (cognitive 40) sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:305 — PrettyYamlRenderer.writeDoubleQuoted has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 9, match/switch 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ManifestTomlEx.renderTableInternal (cognitive 40) · ×1
  • ManifestTomlEx.renderTableInternal (cognitive 40) sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala:286 — ManifestTomlEx.renderTableInternal has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 4 (7 pts), match/switch 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PrettyYamlRenderer.isYamlNumberExact (cognitive 39) · ×1
  • PrettyYamlRenderer.isYamlNumberExact (cognitive 39) sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:566 — PrettyYamlRenderer.isYamlNumberExact has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 13, loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Materializer.hasSelfRefInMemberList (cognitive 38) · ×1
  • Materializer.hasSelfRefInMemberList (cognitive 38) sjsonnet/src/sjsonnet/Materializer.scala:800 — Materializer.hasSelfRefInMemberList has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 3 (6 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PrettyYamlRenderer.isYamlDateExact (cognitive 37) · ×1
  • PrettyYamlRenderer.isYamlDateExact (cognitive 37) sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:506 — PrettyYamlRenderer.isYamlDateExact has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 12, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · Error.formatError (cognitive 36) · ×1
  • Error.formatError (cognitive 36) sjsonnet/src/sjsonnet/Error.scala:108 — Error.formatError has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 5 (13 pts), boolean chains 3, match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Platform.nodeToJson (cognitive 35) · ×1
  • Platform.nodeToJson (cognitive 35) sjsonnet/src-js/sjsonnet/Platform.scala:152 — Platform.nodeToJson has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 3 (7 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · StaticOptimizer.transform (cognitive 35) · ×1
  • StaticOptimizer.transform (cognitive 35) sjsonnet/src/sjsonnet/StaticOptimizer.scala:36 — StaticOptimizer.transform has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 7 (13 pts), error handling 3 (7 pts), boolean chains 2 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Obj.addSuper (cognitive 34) · ×1
  • Obj.addSuper (cognitive 34) sjsonnet/src/sjsonnet/Val.scala:2125 — Obj.addSuper has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Util.sliceStr (cognitive 33) · ×1
  • Util.sliceStr (cognitive 33) sjsonnet/src/sjsonnet/Util.scala:86 — Util.sliceStr has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (6 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PrettyYamlRenderer.isYamlOctalHex (cognitive 32) · ×1
  • PrettyYamlRenderer.isYamlOctalHex (cognitive 32) sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:637 — PrettyYamlRenderer.isYamlOctalHex has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 10, loops 2 (4 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · StaticOptimizer.markTailCalls (cognitive 32) · ×1
  • StaticOptimizer.markTailCalls (cognitive 32) sjsonnet/src/sjsonnet/StaticOptimizer.scala:771 — StaticOptimizer.markTailCalls has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 7, match/switch 2 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Evaluator.visitBinaryOpAsDouble (cognitive 31) · ×1
  • Evaluator.visitBinaryOpAsDouble (cognitive 31) sjsonnet/src/sjsonnet/Evaluator.scala:885 — Evaluator.visitBinaryOpAsDouble has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 1, match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · ScopedExprTransform.nestedConsecutiveBindings (cognitive 30) · ×1
  • ScopedExprTransform.nestedConsecutiveBindings (cognitive 30) sjsonnet/src/sjsonnet/ScopedExprTransform.scala:129 — ScopedExprTransform.nestedConsecutiveBindings has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · StaticOptimizer.rebindApply (cognitive 30) · ×1
  • StaticOptimizer.rebindApply (cognitive 30) sjsonnet/src/sjsonnet/StaticOptimizer.scala:361 — StaticOptimizer.rebindApply has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (22 pts), if/else 8 (nesting depth added 14). 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 · Evaluator.visitLookup (cognitive 27) · ×1
  • Evaluator.visitLookup (cognitive 27) sjsonnet/src/sjsonnet/Evaluator.scala:1231 — Evaluator.visitLookup has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 4 (7 pts) (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Obj.value (cognitive 27) · ×1
  • Obj.value (cognitive 27) sjsonnet/src/sjsonnet/Val.scala:2440 — Obj.value has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Evaluator.visitCompFused (cognitive 26) · ×1
  • Evaluator.visitCompFused (cognitive 26) sjsonnet/src/sjsonnet/Evaluator.scala:729 — Evaluator.visitCompFused has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (8 pts), match/switch 3 (5 pts) (nesting depth added 14). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · StaticOptimizer.hasNonRecursiveExit (cognitive 26) · ×1
  • StaticOptimizer.hasNonRecursiveExit (cognitive 26) sjsonnet/src/sjsonnet/StaticOptimizer.scala:673 — StaticOptimizer.hasNonRecursiveExit has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 7 (12 pts), boolean chains 7, if/else 7 (nesting depth added 5). 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 · Clamp.apply (cognitive 26) · ×1
  • Clamp.apply (cognitive 26) sjsonnet/src/sjsonnet/stdlib/MathModule.scala:80 — Clamp.apply has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 3 (4 pts), match/switch 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 · StringModule.parseHexNat (cognitive 26) · ×1
  • StringModule.parseHexNat (cognitive 26) sjsonnet/src/sjsonnet/stdlib/StringModule.scala:1129 — StringModule.parseHexNat has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArrayModule.tryStringBuilderFromIfElse (cognitive 25) · ×1
  • ArrayModule.tryStringBuilderFromIfElse (cognitive 25) sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:727 — ArrayModule.tryStringBuilderFromIfElse has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (17 pts), if/else 6, boolean chains 2 (nesting depth added 11). 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 · StringModule.lastSplitIndex (cognitive 25) · ×1
  • StringModule.lastSplitIndex (cognitive 25) sjsonnet/src/sjsonnet/stdlib/StringModule.scala:856 — StringModule.lastSplitIndex has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Evaluator.compare (cognitive 24) · ×1
  • Evaluator.compare (cognitive 24) sjsonnet/src/sjsonnet/Evaluator.scala:2100 — Evaluator.compare has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (10 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Join.joinedRepeatedString (cognitive 24) · ×1
  • Join.joinedRepeatedString (cognitive 24) sjsonnet/src/sjsonnet/stdlib/StringModule.scala:522 — Join.joinedRepeatedString has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (8 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Format.formatGeneric (cognitive 23) · ×1
  • Format.formatGeneric (cognitive 23) sjsonnet/src/sjsonnet/Format.scala:1198 — Format.formatGeneric has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Substr.evalRhs (cognitive 23) · ×1
  • Substr.evalRhs (cognitive 23) sjsonnet/src/sjsonnet/stdlib/StringModule.scala:134 — Substr.evalRhs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.html.detectCodeMirrorMode (cognitive 23) · ×1
  • index.html.detectCodeMirrorMode (cognitive 23) playground/index.html:1806 — index.html.detectCodeMirrorMode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, boolean chains 8. 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 · index.html.importLoader (cognitive 23) · ×1
  • index.html.importLoader (cognitive 23) playground/index.html:2304 — index.html.importLoader has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Format.widen (cognitive 22) · ×1
  • Format.widen (cognitive 22) sjsonnet/src/sjsonnet/Format.scala:276 — Format.widen has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · Materializer.materializeInlineObj (cognitive 22) · ×1
  • Materializer.materializeInlineObj (cognitive 22) sjsonnet/src/sjsonnet/Materializer.scala:142 — Materializer.materializeInlineObj has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Parser.expr (cognitive 22) · ×1
  • Parser.expr (cognitive 22) sjsonnet/src/sjsonnet/Parser.scala:592 — Parser.expr has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 6 (9 pts), loops 1 (nesting depth added 11). 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 · Evaluator.visitComp (cognitive 21) · ×1
  • Evaluator.visitComp (cognitive 21) sjsonnet/src/sjsonnet/Evaluator.scala:2048 — Evaluator.visitComp has cognitive complexity 21 (threshold 15). Drivers by points: loops 3 (8 pts), match/switch 3 (7 pts), if/else 3 (6 pts) (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Materializer.quickSortInlineOrder (cognitive 21) · ×1
  • Materializer.quickSortInlineOrder (cognitive 21) sjsonnet/src/sjsonnet/Materializer.scala:711 — Materializer.quickSortInlineOrder has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (9 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Parser.number (cognitive 21) · ×1
  • Parser.number (cognitive 21) sjsonnet/src/sjsonnet/Parser.scala:165 — Parser.number has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Parser.describeWhitespace (cognitive 21) · ×1
  • Parser.describeWhitespace (cognitive 21) sjsonnet/src/sjsonnet/Parser.scala:354 — Parser.describeWhitespace has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · StaticOptimizer.rebind (cognitive 21) · ×1
  • StaticOptimizer.rebind (cognitive 21) sjsonnet/src/sjsonnet/StaticOptimizer.scala:414 — StaticOptimizer.rebind has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FastLongRenderer.writePositiveIntDigits (cognitive 20) · ×1
  • FastLongRenderer.writePositiveIntDigits (cognitive 20) sjsonnet/src/sjsonnet/FastLongRenderer.scala:89 — FastLongRenderer.writePositiveIntDigits has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (20 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LazyViewArr.asLazyArray (cognitive 20) · ×1
  • LazyViewArr.asLazyArray (cognitive 20) sjsonnet/src/sjsonnet/Val.scala:1252 — LazyViewArr.asLazyArray has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Func.computeEffectiveIdentity (cognitive 20) · ×1
  • Func.computeEffectiveIdentity (cognitive 20) sjsonnet/src/sjsonnet/Val.scala:2733 — Func.computeEffectiveIdentity has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (5 pts), loops 3 (4 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Join.joinPresizedStringArray (cognitive 20) · ×1
  • Join.joinPresizedStringArray (cognitive 20) sjsonnet/src/sjsonnet/stdlib/StringModule.scala:590 — Join.joinPresizedStringArray has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (4 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SjsonnetMainBase.parseBindings (cognitive 19) · ×1
  • SjsonnetMainBase.parseBindings (cognitive 19) sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala:553 — SjsonnetMainBase.parseBindings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Interpreter.evaluateImpl (cognitive 19) · ×1
  • Interpreter.evaluateImpl (cognitive 19) sjsonnet/src/sjsonnet/Interpreter.scala:220 — Interpreter.evaluateImpl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (7 pts), error handling 4 (6 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Foldl.evalRhs (cognitive 19) · ×1
  • Foldl.evalRhs (cognitive 19) sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:780 — Foldl.evalRhs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), match/switch 2 (3 pts) (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.
D2 · Cognitive Complexity · Join.joinDirectStringArray (cognitive 19) · ×1
  • Join.joinDirectStringArray (cognitive 19) sjsonnet/src/sjsonnet/stdlib/StringModule.scala:639 — Join.joinDirectStringArray has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Evaluator.compilePureCompBody (cognitive 18) · ×1
  • Evaluator.compilePureCompBody (cognitive 18) sjsonnet/src/sjsonnet/Evaluator.scala:575 — Evaluator.compilePureCompBody has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PrettyYamlRenderer.isYamlFloatFromDot (cognitive 18) · ×1
  • PrettyYamlRenderer.isYamlFloatFromDot (cognitive 18) sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:618 — PrettyYamlRenderer.isYamlFloatFromDot has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (7 pts), loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ScopedExprTransform.transform (cognitive 18) · ×1
  • ScopedExprTransform.transform (cognitive 18) sjsonnet/src/sjsonnet/ScopedExprTransform.scala:19 — ScopedExprTransform.transform has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, match/switch 1 (nesting depth added 4). 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 · StaticOptimizer.transformBind (cognitive 18) · ×1
  • StaticOptimizer.transformBind (cognitive 18) sjsonnet/src/sjsonnet/StaticOptimizer.scala:637 — StaticOptimizer.transformBind has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Util.slice (cognitive 18) · ×1
  • Util.slice (cognitive 18) sjsonnet/src/sjsonnet/Util.scala:37 — Util.slice has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 5, boolean chains 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SetModule.setUnionDefaultKeyF (cognitive 18) · ×1
  • SetModule.setUnionDefaultKeyF (cognitive 18) sjsonnet/src/sjsonnet/stdlib/SetModule.scala:121 — SetModule.setUnionDefaultKeyF has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 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 · SetModule.setInterDefaultKeyF (cognitive 18) · ×1
  • SetModule.setInterDefaultKeyF (cognitive 18) sjsonnet/src/sjsonnet/stdlib/SetModule.scala:172 — SetModule.setInterDefaultKeyF has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SetModule.setDiffDefaultKeyF (cognitive 18) · ×1
  • SetModule.setDiffDefaultKeyF (cognitive 18) sjsonnet/src/sjsonnet/stdlib/SetModule.scala:210 — SetModule.setDiffDefaultKeyF has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · StringModule.splitLimitRBounded (cognitive 18) · ×1
  • StringModule.splitLimitRBounded (cognitive 18) sjsonnet/src/sjsonnet/stdlib/StringModule.scala:937 — StringModule.splitLimitRBounded has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · StripUtils.stripLookup (cognitive 18) · ×1
  • StripUtils.stripLookup (cognitive 18) sjsonnet/src/sjsonnet/stdlib/StringModule.scala:322 — StripUtils.stripLookup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SjsonnetClientMain.run (cognitive 18) · ×1
  • SjsonnetClientMain.run (cognitive 18) sjsonnet/client/src/sjsonnet/client/SjsonnetClientMain.java:72 — SjsonnetClientMain.run has cognitive complexity 18 (threshold 15). Drivers by points: error handling 3 (7 pts), if/else 4 (6 pts), boolean chains 2, loops 2, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SjsonnetMain.toBytesFromJs (cognitive 17) · ×1
  • SjsonnetMain.toBytesFromJs (cognitive 17) sjsonnet/src-js/sjsonnet/SjsonnetMain.scala:21 — SjsonnetMain.toBytesFromJs has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (4 pts), error handling 1 (3 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · ByteRenderer.materializeDirectInlineObj (cognitive 17) · ×1
  • ByteRenderer.materializeDirectInlineObj (cognitive 17) sjsonnet/src/sjsonnet/ByteRenderer.scala:428 — ByteRenderer.materializeDirectInlineObj has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Evaluator.compilePureDoubleExpr (cognitive 17) · ×1
  • Evaluator.compilePureDoubleExpr (cognitive 17) sjsonnet/src/sjsonnet/Evaluator.scala:595 — Evaluator.compilePureDoubleExpr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 5). 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 · StringModule.splitLimit (cognitive 17) · ×1
  • StringModule.splitLimit (cognitive 17) sjsonnet/src/sjsonnet/stdlib/StringModule.scala:788 — StringModule.splitLimit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · StringModule.splitLimitR (cognitive 17) · ×1
  • StringModule.splitLimitR (cognitive 17) sjsonnet/src/sjsonnet/stdlib/StringModule.scala:887 — StringModule.splitLimitR has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · Format.formatSimpleNamedString (cognitive 16) · ×1
  • Format.formatSimpleNamedString (cognitive 16) sjsonnet/src/sjsonnet/Format.scala:911 — Format.formatSimpleNamedString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Materializer.materializeSortedInlineObj (cognitive 16) · ×1
  • Materializer.materializeSortedInlineObj (cognitive 16) sjsonnet/src/sjsonnet/Materializer.scala:196 — Materializer.materializeSortedInlineObj has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Parser.params (cognitive 16) · ×1
  • Parser.params (cognitive 16) sjsonnet/src/sjsonnet/Parser.scala:1065 — Parser.params has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · PrettyYamlRenderer.writeWrappedString (cognitive 16) · ×1
  • PrettyYamlRenderer.writeWrappedString (cognitive 16) sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:388 — PrettyYamlRenderer.writeWrappedString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · StaticOptimizer.tryStaticApply (cognitive 16) · ×1
  • StaticOptimizer.tryStaticApply (cognitive 16) sjsonnet/src/sjsonnet/StaticOptimizer.scala:323 — StaticOptimizer.tryStaticApply has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 2 (5 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArrayModule.linearBytePattern (cognitive 16) · ×1
  • ArrayModule.linearBytePattern (cognitive 16) sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:119 — ArrayModule.linearBytePattern has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (nesting depth added 6). 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 · SetModule.sortArr (cognitive 16) · ×1
  • SetModule.sortArr (cognitive 16) sjsonnet/src/sjsonnet/stdlib/SetModule.scala:343 — SetModule.sortArr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D3 · God Classes · ClassTooLong · ×1
  • ClassTooLong: StaticOptimizer sjsonnet/src/sjsonnet/StaticOptimizer.scala:24 — ClassTooLong — 540 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 140 over it, 1.35× 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.
D4 · Code Duplication · Near-duplicate member family (3 members, 16 shared lines) · ×1
  • Near-duplicate member family (3 members, 16 shared lines) sjsonnet/src-js/sjsonnet/Platform.scala:362 — sjsonnet/src-js/sjsonnet/Platform.scala:362-388 | sjsonnet/src-jvm/sjsonnet/Platform.scala:401-427 | sjsonnet/src-native/sjsonnet/Platform.scala:333-359 — These 3 members are variants of one another: a block of 16 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 3 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 3 times.
D4 · Code Duplication · Near-duplicate member pair (44 shared lines) · ×1
  • Near-duplicate member pair (44 shared lines) sjsonnet/src-js/sjsonnet/Platform.scala:152 — sjsonnet/src-js/sjsonnet/Platform.scala:152-213 | sjsonnet/src-native/sjsonnet/Platform.scala:115-184 — These two members are variants of one another: 44 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) sjsonnet/src-js/sjsonnet/Platform.scala:277 — sjsonnet/src-js/sjsonnet/Platform.scala:277-295 | sjsonnet/src-js/sjsonnet/Platform.scala:297-315 | sjsonnet/src-jvm/sjsonnet/Platform.scala:369-383 | sjsonnet/src-jvm/sjsonnet/Platform.scala:385-399 | sjsonnet/src-native/sjsonnet/Platform.scala:248-266 | sjsonnet/src-native/sjsonnet/Platform.scala:268-286 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (5 members, 50+ identical tokens) sjsonnet/src/sjsonnet/Evaluator.scala:976 — sjsonnet/src/sjsonnet/Evaluator.scala:976-996 | sjsonnet/src/sjsonnet/Evaluator.scala:998-1013 | sjsonnet/src/sjsonnet/Evaluator.scala:1015-1032 | sjsonnet/src/sjsonnet/Evaluator.scala:1034-1058 | sjsonnet/src/sjsonnet/Evaluator.scala:1060-1089 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication · Duplicated block (33 lines × 2) · ×1
  • Duplicated block (33 lines × 2) sjsonnet/src-js/sjsonnet/Platform.scala:483 — sjsonnet/src-js/sjsonnet/Platform.scala:483-515 | sjsonnet/src-native/sjsonnet/Platform.scala:454-486 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
D4 · Code Duplication · Duplicated block (30 lines × 2) · ×1
  • Duplicated block (30 lines × 2) sjsonnet/src-js/sjsonnet/Platform.scala:447 — sjsonnet/src-js/sjsonnet/Platform.scala:447-476 | sjsonnet/src-native/sjsonnet/Platform.scala:418-447 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×1
  • Duplicated block (19 lines × 2) sjsonnet/src-js/sjsonnet/Platform.scala:195 — sjsonnet/src-js/sjsonnet/Platform.scala:195-213 | sjsonnet/src-native/sjsonnet/Platform.scala:166-184 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 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 `sjsonnet/src-js/sjsonnet/Platform.scala:195` 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) · ×1
  • Duplicated block (18 lines × 2) sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:184 — sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:184-201 | sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:231-248 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/stdlib/ArrayModule.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.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×1
  • Duplicated block (17 lines × 2) sjsonnet/src-js/sjsonnet/Platform.scala:219 — sjsonnet/src-js/sjsonnet/Platform.scala:219-235 | sjsonnet/src-native/sjsonnet/Platform.scala:190-206 — before extracting anything, compare `sjsonnet/src-js/sjsonnet/Platform.scala` and `sjsonnet/src-native/sjsonnet/Platform.scala` as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
D4 · Code Duplication · Duplicated block (14–15 lines × 2) · ×1
  • Duplicated block (14–15 lines × 2) sjsonnet/src/sjsonnet/Format.scala:706 — sjsonnet/src/sjsonnet/Format.scala:706-719 | sjsonnet/src/sjsonnet/Format.scala:737-751 — both copies are in the same file, so extract the 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `sjsonnet/src/sjsonnet/Format.scala:703` calls `withStarWidth`, `value` and `sjsonnet/src/sjsonnet/Format.scala:736` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (11–13 lines × 2) · ×1
  • Duplicated block (11–13 lines × 2) sjsonnet/src/sjsonnet/Evaluator.scala:1036 — sjsonnet/src/sjsonnet/Evaluator.scala:1036-1046 | sjsonnet/src/sjsonnet/Evaluator.scala:1062-1074 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/Evaluator.scala:1036` 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 (9–12 lines × 5) · ×1
  • Duplicated block (9–12 lines × 5) sjsonnet/src/sjsonnet/Evaluator.scala:977 — sjsonnet/src/sjsonnet/Evaluator.scala:977-988 | sjsonnet/src/sjsonnet/Evaluator.scala:999-1007 | sjsonnet/src/sjsonnet/Evaluator.scala:1016-1024 | sjsonnet/src/sjsonnet/Evaluator.scala:1035-1044 | sjsonnet/src/sjsonnet/Evaluator.scala:1061-1070 — 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 `sjsonnet/src/sjsonnet/Evaluator.scala:977` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (10–11 lines × 2) · ×1
  • Duplicated block (10–11 lines × 2) sjsonnet/src/sjsonnet/ByteRenderer.scala:477 — sjsonnet/src/sjsonnet/ByteRenderer.scala:477-486 | sjsonnet/src/sjsonnet/Materializer.scala:201-211 — 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 `sjsonnet/src/sjsonnet/ByteRenderer.scala:477` 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 × 6) · ×1
  • Duplicated block (9 lines × 6) sjsonnet/src-js/sjsonnet/Platform.scala:278 — sjsonnet/src-js/sjsonnet/Platform.scala:278-286 | sjsonnet/src-js/sjsonnet/Platform.scala:298-306 | sjsonnet/src-jvm/sjsonnet/Platform.scala:370-378 | sjsonnet/src-jvm/sjsonnet/Platform.scala:386-394 | sjsonnet/src-native/sjsonnet/Platform.scala:249-257 | sjsonnet/src-native/sjsonnet/Platform.scala:269-277 — there are 6 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 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `sjsonnet/src-js/sjsonnet/Platform.scala:278` 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 (7–8 lines × 2) · ×1
  • Duplicated block (7–8 lines × 2) sjsonnet/src/sjsonnet/Evaluator.scala:1895 — sjsonnet/src/sjsonnet/Evaluator.scala:1895-1902 | sjsonnet/src/sjsonnet/Evaluator.scala:2020-2026 — both copies are in the same file, so extract the 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 `sjsonnet/src/sjsonnet/Evaluator.scala:1895` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (9 lines × 3) · ×1
  • Duplicated block (9 lines × 3) sjsonnet/src-js/sjsonnet/Platform.scala:390 — sjsonnet/src-js/sjsonnet/Platform.scala:390-398 | sjsonnet/src-jvm/sjsonnet/Platform.scala:429-437 | sjsonnet/src-native/sjsonnet/Platform.scala:361-369 — 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.
D4 · Code Duplication · Duplicated block (10 lines × 4) · ×1
  • Duplicated block (10 lines × 4) sjsonnet/src/sjsonnet/BaseCharRenderer.scala:140 — sjsonnet/src/sjsonnet/BaseCharRenderer.scala:140-149 | sjsonnet/src/sjsonnet/BaseCharRenderer.scala:163-172 | sjsonnet/src/sjsonnet/Renderer.scala:195-204 | sjsonnet/src/sjsonnet/Renderer.scala:218-227 — 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.
D5 · Coupling · Off the main sequence · ×1
  • Off the main sequence: sjsonnet.jvm.client — sjsonnet.jvm.client: abstractness 0.20, instability 0.00, distance 0.80 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
D6 · Cohesion (LCOM4) · Low cohesion · ×1
  • Low cohesion: TomlRenderer (LCOM4 5) sjsonnet/src/sjsonnet/TomlRenderer.scala:8 — TomlRenderer'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.
GD1 · Unfinished & placeholder code · Unfinished stub · ×1
  • Unfinished stub — body is `???` sjsonnet/src/sjsonnet/ScopedExprTransform.scala:97 — `transformField` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
IC1 · Incompleteness & stubs · Unfinished stub · ×1
  • Unfinished stub — body is ??? / NotImplementedError sjsonnet/src/sjsonnet/ScopedExprTransform.scala:97 — `transformField` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
P2 · Observability · No structured logging · ×1
  • No structured logging — No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
S1 · Web-Security Posture · Third-party script without Subresource Integrity · ×1
  • Third-party script without Subresource Integrity playground/index.html:777 — `https://cdnjs.cloudflare.com/ajax/libs/codemirror/5.65.16/codemirror.min.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. 14 such include(s) across the repository's markup.
Minor — 37 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×25
  • Duplicated predicate sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:54 — `!isDefaultKeyF(keyF) && !keyF.isInstanceOf[Val.Func]` appears character-identically in 2 files — sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala, sjsonnet/src/sjsonnet/stdlib/SetModule.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:376 — `(c == '"' || c == '\'') && isYamlScalarQuoteStart(input, start, i)` appears character-identically in 3 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/CharSWAR.scala:43 — `b < 32 || b == '"' || b == '\\' || b == 0x7f` appears character-identically in 2 files — sjsonnet/src-js/sjsonnet/CharSWAR.scala, sjsonnet/src-native/sjsonnet/CharSWAR.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/CharSWAR.scala:10 — `c < 32 || c == '"' || c == '\\' || (c >= 0x7f && c <= 0x9f)` appears character-identically in 2 files — sjsonnet/src-js/sjsonnet/CharSWAR.scala, sjsonnet/src-native/sjsonnet/CharSWAR.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/CharSWAR.scala:32 — `c < 32 || c == '"' || c == '\\' || c >= 0x7f` appears character-identically in 2 files — sjsonnet/src-js/sjsonnet/CharSWAR.scala, sjsonnet/src-native/sjsonnet/CharSWAR.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:378 — `c == '#' && (i == from || input.charAt(i - 1).isWhitespace)` appears character-identically in 3 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:380 — `c == '<' && i > from && input.charAt(i - 1) == '!'` appears character-identically in 3 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:382 — `c == '[' || c == ']' || c == '{' || c == '}' || c == ',' || c == ':'` appears character-identically in 3 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:227 — `canNormalizeResolvedFloat || canNormalizePlainCoreString` appears character-identically in 3 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:89 — `count > 0 && s.length <= Int.MaxValue / count` appears character-identically in 2 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:293 — `currentLineHasTag || previousPropertyLineHasTag` appears character-identically in 2 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src/sjsonnet/Util.scala:53 — `d.isNaN || d.isInfinite || Math.floor(d) != d` appears character-identically in 3 files — sjsonnet/src/sjsonnet/Util.scala, sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala, sjsonnet/src/sjsonnet/stdlib/StringModule.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:472 — `e.getMessage != null && e.getMessage.startsWith("There is no anchor for")` appears character-identically in 2 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:430 — `i < prefix.length && !prefix.charAt(i).isWhitespace` appears character-identically in 3 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:427 — `i < prefix.length && prefix.charAt(i).isWhitespace` appears character-identically in 3 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:407 — `i < quoteIndex && !input.charAt(i).isWhitespace` appears character-identically in 3 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:403 — `i < quoteIndex && input.charAt(i).isWhitespace` appears character-identically in 3 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:358 — `i < until && input.charAt(i).isWhitespace` appears character-identically in 2 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src/sjsonnet/BaseCharRenderer.scala:317 — `indentCache != null && depth < BaseCharRenderer.MaxCachedDepth` appears character-identically in 2 files — sjsonnet/src/sjsonnet/BaseCharRenderer.scala, sjsonnet/src/sjsonnet/Renderer.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:225 — `isCoreNonFinite && sn.tag == Tag.str && isPlainScalar(sn, input) && !hasExplicitStringTag(sn, input)` appears character-identically in 2 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:311 — `isWhitespaceOnly(input, lineStart, scanEnd) && previousPropertyLineHasExplicitFloatTag(input, lineStart)` appears character-identically in 2 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:291 — `isWhitespaceOnly(input, lineStart, scanEnd) && previousPropertyLineHasExplicitStringTag(input, lineStart)` appears character-identically in 2 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:372 — `quoted != '"' || !isEscapedDoubleQuote(input, i, from)` appears character-identically in 3 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:371 — `quoted == '\'' && i + 1 < until && input.charAt(i + 1) == '\''` appears character-identically in 3 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
  • Duplicated predicate sjsonnet/src-js/sjsonnet/Platform.scala:143 — `regexMatches(YamlNonFiniteInfPattern, value) || regexMatches(YamlNonFiniteNaNPattern, value)` appears character-identically in 3 files — sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.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.
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 23 significant file(s) lose their only recent owner: sjsonnet/src/sjsonnet/stdlib/StringModule.scala, sjsonnet/src/sjsonnet/Format.scala, sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala, sjsonnet/src/sjsonnet/Renderer.scala, sjsonnet/src/sjsonnet/stdlib/SetModule.scala, sjsonnet/src/sjsonnet/stdlib/MathModule.scala, sjsonnet/src/sjsonnet/ByteRenderer.scala, sjsonnet/src/sjsonnet/Util.scala (+15 more). Pair on, review, or document these before any departure.
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 (24 single-owned of 60 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; 60 of the 96 production source files in this repository met that bar). They are anonymized user #2 (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: sjsonnet/src/sjsonnet/DebugStats.scala.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is `(repository root)` (27716 LoC, 299 module-visible types across 17 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D34 · Knowledge Freshness · Orphaned files with no living knowledge · ×1
  • Orphaned files with no living knowledge — 1 of 60 analysed file(s) have no living knowledge left — their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 60 of the 96 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each — most significant first: sjsonnet/client/src/sjsonnet/client/Util.java. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
D34 · Knowledge Freshness · Orphaned file · ×1
  • Orphaned file sjsonnet/client/src/sjsonnet/client/Util.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.
IC1 · Incompleteness & stubs · Blanket warning suppression · ×1
  • Blanket warning suppression sjsonnet/src/sjsonnet/ScopedExprTransform.scala:56 — A bare `// scalastyle:off`, `// scalafix:off` or `@nowarn` (or Wartremover's `warts.All`) switches every rule or warning off — hidden debt. Suppress the specific rule on the specific line, with a justification, instead.
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
M3 · Folder & project structure · No src/ separation · ×1
  • No src/ separation — Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
P10 · Library API & versioning · Large public API surface · ×1
  • Large public API surface — 8/10 types (80%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST .github/workflows/pr-build.yaml:4 — 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 5051 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.
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 74 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.

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 --report-format json --report-path /tmp/watchdog-gitleaks-a118fa11973646d6a082d59f3c21c5ae/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-a118fa11973646d6a082d59f3c21c5ae/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/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 .0artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm . /tmp/codehealth-osv-sbom-1727e19f3c144a42982dbc59638a57e91artifacts/raw/osv-scanner.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 1 file(s) — `sjsonnet/src/sjsonnet/Val.scala` — so the PII/GDPR sweep did not cover them at all.0—
D36 · Supply-chain Provenance & Signingprovenance—provenance: not applicable — The CI pipeline builds and tests but publishes no released artifact — no package publish, container push, GitHub release or deployment step. Supply-chain provenance, signing and SBOM attest RELEASED artifacts, so there is nothing to attest here. Add them to the release pipeline when this repo starts shipping artifacts (a published package, a container image, a deployed service or a tagged release).0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm . /tmp/codehealth-osv-sbom-1727e19f3c144a42982dbc59638a57e90artifacts/raw/osv-scanner.json

Run 01a1b285-99a6-7c95-b012-3c6f3a39bcfb · 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