Public report of evolution-gaming/kafka-journal, published 8 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 reportMeasured 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, 8 November 2026, 00:45 UTC · Survey ID cd_a50b4c003a1d44aa9494acbc7036a852
evolution-gaming/kafka-journal
Measured 8 November 2026, 00:44 UTC, at code version d55c716
Knowledge freshness is not measured: Freshness signal contradicted by repo activity.
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Down 5 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 small codebase: 18,903 lines of product code in 14 projects, tests not counted · Estimated rebuild effort: about 0.2 person-years · Weakest lens: Security and Compliance, 42
Findings by how serious they are
40 critical144 serious16 minor
14 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
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
8 November 2026, 00:44 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 ▸
59of 59 dimensions measured by tools.
188of 200 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.
59dimensions across 6 lenses, read from 18,903 lines of product code in 14 projects.
evolution-gaming/kafka-journal falls short of our standard for production, in part because it has security weaknesses in the code. It scores 52 out of 100 and is rated Adequate, and all 40 of its critical findings are security problems in its code and in the build pipeline.
Security and Compliance, at 42, is the weakest lens and counts most in the score. The best first step is fixing the security flaws the scanner found, worth about 7 points. Fixing the product with no list of the components it contains comes next, worth about 2 points. Raising Security and Compliance to 70 would lift the score to about 61.
Thirty-nine weaknesses in the code could be used by an attacker. One secret can leak from the build pipeline. Fixing the weaknesses the scanner points to and limiting the secret to its own step would close both risks.
The product code is 18,903 lines, about €32,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe 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.
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.
Fixed since the last survey: 3 findings
These 3 critical or serious findings were in the previous survey, on 21 October 2026, and are gone from this one.
€11,000 to €53,000, for 176 to 557 hours of work, about 0.2 person-years for one engineer
Difficulty of the problem
Low, 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 52. 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.
Size
Small: 18,903 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 39 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (18), REDACTED (7), REDACTED (6).
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 €32,000 to build again, about 0.2 person-years of work. Its weakest lens is Security and Compliance, at 42 (checked 3 of 9). Security and Compliance is about how well the product is protected, and how it handles personal data. Because the weakest lens counts most in the score, work on Security and Compliance also moves the score most.
Based on: the rebuild estimate · the Security and Compliance grade · how much each lens counts
What to do: Start with the Security and Compliance actions in Top priorities.
If you do one thing first · First action
Resolve the 39 REDACTED finding(s) in Static Analysis (SAST). Of all the actions in this report, it raises the score most for the work it takes: about 7 points for medium effort, because it clears the 39 Static Analysis (SAST) findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.9 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 3% to 6% on every change. The history of the code shows how much it changes: about 5,566 lines over the last 90 days, which is about 22,573 lines a year. At that pace, the extra work comes to an estimated 1.6 to 9.4 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of 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.
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.
137 modules, with 148 dependencies between them. 2 loops run through 8 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 97 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.
Journal uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break Journal, while a change to Journal can't break com.evolution.kafka.journal.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
2→6 Journals uses com.evolution.kafka.journalpart of a loop✕
Connections
4 pairs of types, where a type in Journals uses a type in com.evolution.kafka.journal.
Journals uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break Journals, while a change to Journals can't break com.evolution.kafka.journal.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
3→6 TopicCache uses com.evolution.kafka.journalpart of a loop✕
Connections
1 pair of types, where a type in TopicCache uses a type in com.evolution.kafka.journal.
TopicCache uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break TopicCache, while a change to TopicCache can't break com.evolution.kafka.journal.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
4→6 conversions uses com.evolution.kafka.journalpart of a loop✕
Connections
13 pairs of types, where a type in conversions uses a type in com.evolution.kafka.journal.
conversions uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break conversions, while a change to conversions can't break com.evolution.kafka.journal.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
5→6 eventual uses com.evolution.kafka.journalpart of a loop✕
Connections
14 pairs of types, where a type in eventual uses a type in com.evolution.kafka.journal.
eventual uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break eventual, while a change to eventual can't break com.evolution.kafka.journal.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
com.evolution.kafka.journal uses Journal, so a change to Journal can break com.evolution.kafka.journal, while a change to com.evolution.kafka.journal can't break Journal.
Position
Below the diagonal: com.evolution.kafka.journal uses a module listed above it, which is the healthy direction.
com.evolution.kafka.journal uses Journals, so a change to Journals can break com.evolution.kafka.journal, while a change to com.evolution.kafka.journal can't break Journals.
Position
Below the diagonal: com.evolution.kafka.journal uses a module listed above it, which is the healthy direction.
com.evolution.kafka.journal uses TopicCache, so a change to TopicCache can break com.evolution.kafka.journal, while a change to com.evolution.kafka.journal can't break TopicCache.
Position
Below the diagonal: com.evolution.kafka.journal uses a module listed above it, which is the healthy direction.
com.evolution.kafka.journal uses conversions, so a change to conversions can break com.evolution.kafka.journal, while a change to com.evolution.kafka.journal can't break conversions.
Position
Below the diagonal: com.evolution.kafka.journal uses a module listed above it, which is the healthy direction.
com.evolution.kafka.journal uses eventual, so a change to eventual can break com.evolution.kafka.journal, while a change to com.evolution.kafka.journal can't break eventual.
Position
Below the diagonal: com.evolution.kafka.journal uses a module listed above it, which is the healthy direction.
Action uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break Action, while a change to Action can't break com.evolution.kafka.journal.
Position
Below the diagonal: Action uses a module listed above it, which is the healthy direction.
JsonCodec uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break JsonCodec, while a change to JsonCodec can't break com.evolution.kafka.journal.
Position
Below the diagonal: JsonCodec uses a module listed above it, which is the healthy direction.
PartitionCache uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break PartitionCache, while a change to PartitionCache can't break com.evolution.kafka.journal.
Position
Below the diagonal: PartitionCache uses a module listed above it, which is the healthy direction.
PayloadAndType uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break PayloadAndType, while a change to PayloadAndType can't break com.evolution.kafka.journal.
Position
Below the diagonal: PayloadAndType uses a module listed above it, which is the healthy direction.
PayloadType uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break PayloadType, while a change to PayloadType can't break com.evolution.kafka.journal.
Position
Below the diagonal: PayloadType uses a module listed above it, which is the healthy direction.
cassandra uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break cassandra, while a change to cassandra can't break com.evolution.kafka.journal.
Position
Below the diagonal: cassandra uses a module listed above it, which is the healthy direction.
12→19 cassandra uses eventual.cassandrapart of a loop✕
Connections
1 pair of types, where a type in cassandra uses a type in eventual.cassandra.
eventual.ReplicatedKeyJournal uses eventual, so a change to eventual can break eventual.ReplicatedKeyJournal, while a change to eventual.ReplicatedKeyJournal can't break eventual.
Position
Below the diagonal: eventual.ReplicatedKeyJournal uses a module listed above it, which is the healthy direction.
eventual.ReplicatedKeyJournal uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break eventual.ReplicatedKeyJournal, while a change to eventual.ReplicatedKeyJournal can't break com.evolution.kafka.journal.
Position
Below the diagonal: eventual.ReplicatedKeyJournal uses a module listed above it, which is the healthy direction.
util uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break util, while a change to util can't break com.evolution.kafka.journal.
Position
Below the diagonal: util uses a module listed above it, which is the healthy direction.
Action.Append uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break Action.Append, while a change to Action.Append can't break com.evolution.kafka.journal.
Position
Below the diagonal: Action.Append uses a module listed above it, which is the healthy direction.
KafkaConsumer uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break KafkaConsumer, while a change to KafkaConsumer can't break com.evolution.kafka.journal.
Position
Below the diagonal: KafkaConsumer uses a module listed above it, which is the healthy direction.
PartitionCache.Result uses PartitionCache, so a change to PartitionCache can break PartitionCache.Result, while a change to PartitionCache.Result can't break PartitionCache.
Position
Below the diagonal: PartitionCache.Result uses a module listed above it, which is the healthy direction.
circe uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break circe, while a change to circe can't break com.evolution.kafka.journal.
Position
Below the diagonal: circe uses a module listed above it, which is the healthy direction.
eventual.cassandra uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break eventual.cassandra, while a change to eventual.cassandra can't break com.evolution.kafka.journal.
Position
Below the diagonal: eventual.cassandra uses a module listed above it, which is the healthy direction.
PartitionCache.Result.Now uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break PartitionCache.Result.Now, while a change to PartitionCache.Result.Now can't break com.evolution.kafka.journal.
Position
Below the diagonal: PartitionCache.Result.Now uses a module listed above it, which is the healthy direction.
PartitionCache.Result.Now uses PartitionCache, so a change to PartitionCache can break PartitionCache.Result.Now, while a change to PartitionCache.Result.Now can't break PartitionCache.
Position
Below the diagonal: PartitionCache.Result.Now uses a module listed above it, which is the healthy direction.
PartitionCache.Result.Now uses PartitionCache.Result, so a change to PartitionCache.Result can break PartitionCache.Result.Now, while a change to PartitionCache.Result.Now can't break PartitionCache.Result.
Position
Below the diagonal: PartitionCache.Result.Now uses a module listed above it, which is the healthy direction.
akka.persistence uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break akka.persistence, while a change to akka.persistence can't break com.evolution.kafka.journal.
Position
Below the diagonal: akka.persistence uses a module listed above it, which is the healthy direction.
akka.persistence uses eventual.cassandra, so a change to eventual.cassandra can break akka.persistence, while a change to akka.persistence can't break eventual.cassandra.
Position
Below the diagonal: akka.persistence uses a module listed above it, which is the healthy direction.
eventual.cassandra.EventualCassandra uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break eventual.cassandra.EventualCassandra, while a change to eventual.cassandra.EventualCassandra can't break com.evolution.kafka.journal.
Position
Below the diagonal: eventual.cassandra.EventualCassandra uses a module listed above it, which is the healthy direction.
eventual.cassandra.EventualCassandra uses eventual.cassandra, so a change to eventual.cassandra can break eventual.cassandra.EventualCassandra, while a change to eventual.cassandra.EventualCassandra can't break eventual.cassandra.
Position
Below the diagonal: eventual.cassandra.EventualCassandra uses a module listed above it, which is the healthy direction.
eventual.cassandra.ExpiryService uses eventual.cassandra, so a change to eventual.cassandra can break eventual.cassandra.ExpiryService, while a change to eventual.cassandra.ExpiryService can't break eventual.cassandra.
Position
Below the diagonal: eventual.cassandra.ExpiryService uses a module listed above it, which is the healthy direction.
eventual.cassandra.JournalStatements uses eventual, so a change to eventual can break eventual.cassandra.JournalStatements, while a change to eventual.cassandra.JournalStatements can't break eventual.
Position
Below the diagonal: eventual.cassandra.JournalStatements uses a module listed above it, which is the healthy direction.
eventual.cassandra.JournalStatements uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break eventual.cassandra.JournalStatements, while a change to eventual.cassandra.JournalStatements can't break com.evolution.kafka.journal.
Position
Below the diagonal: eventual.cassandra.JournalStatements uses a module listed above it, which is the healthy direction.
eventual.cassandra.JournalStatements uses eventual.cassandra, so a change to eventual.cassandra can break eventual.cassandra.JournalStatements, while a change to eventual.cassandra.JournalStatements can't break eventual.cassandra.
Position
Below the diagonal: eventual.cassandra.JournalStatements uses a module listed above it, which is the healthy direction.
eventual.cassandra.MetaJournalStatements uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break eventual.cassandra.MetaJournalStatements, while a change to eventual.cassandra.MetaJournalStatements can't break com.evolution.kafka.journal.
Position
Below the diagonal: eventual.cassandra.MetaJournalStatements uses a module listed above it, which is the healthy direction.
eventual.cassandra.MetaJournalStatements uses eventual.cassandra, so a change to eventual.cassandra can break eventual.cassandra.MetaJournalStatements, while a change to eventual.cassandra.MetaJournalStatements can't break eventual.cassandra.
Position
Below the diagonal: eventual.cassandra.MetaJournalStatements uses a module listed above it, which is the healthy direction.
eventual.cassandra.ReplicatedCassandra.MetaJournalStatements uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break eventual.cassandra.ReplicatedCassandra.MetaJournalStatements, while a change to eventual.cassandra.ReplicatedCassandra.MetaJournalStatements can't break com.evolution.kafka.journal.
Position
Below the diagonal: eventual.cassandra.ReplicatedCassandra.MetaJournalStatements uses a module listed above it, which is the healthy direction.
eventual.cassandra.ReplicatedCassandra.MetaJournalStatements uses eventual.cassandra, so a change to eventual.cassandra can break eventual.cassandra.ReplicatedCassandra.MetaJournalStatements, while a change to eventual.cassandra.ReplicatedCassandra.MetaJournalStatements can't break eventual.cassandra.
Position
Below the diagonal: eventual.cassandra.ReplicatedCassandra.MetaJournalStatements uses a module listed above it, which is the healthy direction.
eventual.cassandra.ReplicatedCassandra.MetaJournalStatements.ByKey uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break eventual.cassandra.ReplicatedCassandra.MetaJournalStatements.ByKey, while a change to eventual.cassandra.ReplicatedCassandra.MetaJournalStatements.ByKey can't break com.evolution.kafka.journal.
Position
Below the diagonal: eventual.cassandra.ReplicatedCassandra.MetaJournalStatements.ByKey uses a module listed above it, which is the healthy direction.
eventual.cassandra.ReplicatedCassandra.MetaJournalStatements.ByKey uses eventual.cassandra, so a change to eventual.cassandra can break eventual.cassandra.ReplicatedCassandra.MetaJournalStatements.ByKey, while a change to eventual.cassandra.ReplicatedCassandra.MetaJournalStatements.ByKey can't break eventual.cassandra.
Position
Below the diagonal: eventual.cassandra.ReplicatedCassandra.MetaJournalStatements.ByKey uses a module listed above it, which is the healthy direction.
eventual.cassandra.Segment uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break eventual.cassandra.Segment, while a change to eventual.cassandra.Segment can't break com.evolution.kafka.journal.
Position
Below the diagonal: eventual.cassandra.Segment uses a module listed above it, which is the healthy direction.
eventual.cassandra.Segment uses eventual.cassandra, so a change to eventual.cassandra can break eventual.cassandra.Segment, while a change to eventual.cassandra.Segment can't break eventual.cassandra.
Position
Below the diagonal: eventual.cassandra.Segment uses a module listed above it, which is the healthy direction.
eventual.cassandra.SegmentNr uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break eventual.cassandra.SegmentNr, while a change to eventual.cassandra.SegmentNr can't break com.evolution.kafka.journal.
Position
Below the diagonal: eventual.cassandra.SegmentNr uses a module listed above it, which is the healthy direction.
eventual.cassandra.SegmentNr uses eventual.cassandra, so a change to eventual.cassandra can break eventual.cassandra.SegmentNr, while a change to eventual.cassandra.SegmentNr can't break eventual.cassandra.
Position
Below the diagonal: eventual.cassandra.SegmentNr uses a module listed above it, which is the healthy direction.
eventual.cassandra.SegmentNr.implicits uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break eventual.cassandra.SegmentNr.implicits, while a change to eventual.cassandra.SegmentNr.implicits can't break com.evolution.kafka.journal.
Position
Below the diagonal: eventual.cassandra.SegmentNr.implicits uses a module listed above it, which is the healthy direction.
eventual.cassandra.SegmentNr.implicits uses eventual.cassandra, so a change to eventual.cassandra can break eventual.cassandra.SegmentNr.implicits, while a change to eventual.cassandra.SegmentNr.implicits can't break eventual.cassandra.
Position
Below the diagonal: eventual.cassandra.SegmentNr.implicits uses a module listed above it, which is the healthy direction.
eventual.cassandra.SegmentNrs uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break eventual.cassandra.SegmentNrs, while a change to eventual.cassandra.SegmentNrs can't break com.evolution.kafka.journal.
Position
Below the diagonal: eventual.cassandra.SegmentNrs uses a module listed above it, which is the healthy direction.
eventual.cassandra.SegmentNrs uses eventual.cassandra, so a change to eventual.cassandra can break eventual.cassandra.SegmentNrs, while a change to eventual.cassandra.SegmentNrs can't break eventual.cassandra.
Position
Below the diagonal: eventual.cassandra.SegmentNrs uses a module listed above it, which is the healthy direction.
pekko.persistence uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break pekko.persistence, while a change to pekko.persistence can't break com.evolution.kafka.journal.
Position
Below the diagonal: pekko.persistence uses a module listed above it, which is the healthy direction.
pekko.persistence uses eventual.cassandra, so a change to eventual.cassandra can break pekko.persistence, while a change to pekko.persistence can't break eventual.cassandra.
Position
Below the diagonal: pekko.persistence uses a module listed above it, which is the healthy direction.
replicator uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break replicator, while a change to replicator can't break com.evolution.kafka.journal.
Position
Below the diagonal: replicator uses a module listed above it, which is the healthy direction.
replicator uses eventual.cassandra, so a change to eventual.cassandra can break replicator, while a change to replicator can't break eventual.cassandra.
Position
Below the diagonal: replicator uses a module listed above it, which is the healthy direction.
akka.persistence.JournalAdapter uses conversions, so a change to conversions can break akka.persistence.JournalAdapter, while a change to akka.persistence.JournalAdapter can't break conversions.
Position
Below the diagonal: akka.persistence.JournalAdapter uses a module listed above it, which is the healthy direction.
akka.persistence.JournalAdapter uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break akka.persistence.JournalAdapter, while a change to akka.persistence.JournalAdapter can't break com.evolution.kafka.journal.
Position
Below the diagonal: akka.persistence.JournalAdapter uses a module listed above it, which is the healthy direction.
akka.persistence.JournalAdapter uses akka.persistence, so a change to akka.persistence can break akka.persistence.JournalAdapter, while a change to akka.persistence.JournalAdapter can't break akka.persistence.
Position
Below the diagonal: akka.persistence.JournalAdapter uses a module listed above it, which is the healthy direction.
akka.persistence.circe uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break akka.persistence.circe, while a change to akka.persistence.circe can't break com.evolution.kafka.journal.
Position
Below the diagonal: akka.persistence.circe uses a module listed above it, which is the healthy direction.
akka.persistence.circe uses akka.persistence, so a change to akka.persistence can break akka.persistence.circe, while a change to akka.persistence.circe can't break akka.persistence.
Position
Below the diagonal: akka.persistence.circe uses a module listed above it, which is the healthy direction.
eventual.cassandra.ExpiryService.Action uses eventual.cassandra, so a change to eventual.cassandra can break eventual.cassandra.ExpiryService.Action, while a change to eventual.cassandra.ExpiryService.Action can't break eventual.cassandra.
Position
Below the diagonal: eventual.cassandra.ExpiryService.Action uses a module listed above it, which is the healthy direction.
eventual.cassandra.ExpiryService.Action uses eventual.cassandra.ExpiryService, so a change to eventual.cassandra.ExpiryService can break eventual.cassandra.ExpiryService.Action, while a change to eventual.cassandra.ExpiryService.Action can't break eventual.cassandra.ExpiryService.
Position
Below the diagonal: eventual.cassandra.ExpiryService.Action uses a module listed above it, which is the healthy direction.
eventual.cassandra.ReplicatedCassandra uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break eventual.cassandra.ReplicatedCassandra, while a change to eventual.cassandra.ReplicatedCassandra can't break com.evolution.kafka.journal.
Position
Below the diagonal: eventual.cassandra.ReplicatedCassandra uses a module listed above it, which is the healthy direction.
eventual.cassandra.ReplicatedCassandra uses eventual.cassandra, so a change to eventual.cassandra can break eventual.cassandra.ReplicatedCassandra, while a change to eventual.cassandra.ReplicatedCassandra can't break eventual.cassandra.
Position
Below the diagonal: eventual.cassandra.ReplicatedCassandra uses a module listed above it, which is the healthy direction.
eventual.cassandra.ReplicatedCassandra uses eventual.cassandra.ReplicatedCassandra.MetaJournalStatements, so a change to eventual.cassandra.ReplicatedCassandra.MetaJournalStatements can break eventual.cassandra.ReplicatedCassandra, while a change to eventual.cassandra.ReplicatedCassandra can't break eventual.cassandra.ReplicatedCassandra.MetaJournalStatements.
Position
Below the diagonal: eventual.cassandra.ReplicatedCassandra uses a module listed above it, which is the healthy direction.
pekko.persistence.JournalAdapter uses conversions, so a change to conversions can break pekko.persistence.JournalAdapter, while a change to pekko.persistence.JournalAdapter can't break conversions.
Position
Below the diagonal: pekko.persistence.JournalAdapter uses a module listed above it, which is the healthy direction.
pekko.persistence.JournalAdapter uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break pekko.persistence.JournalAdapter, while a change to pekko.persistence.JournalAdapter can't break com.evolution.kafka.journal.
Position
Below the diagonal: pekko.persistence.JournalAdapter uses a module listed above it, which is the healthy direction.
pekko.persistence.JournalAdapter uses pekko.persistence, so a change to pekko.persistence can break pekko.persistence.JournalAdapter, while a change to pekko.persistence.JournalAdapter can't break pekko.persistence.
Position
Below the diagonal: pekko.persistence.JournalAdapter uses a module listed above it, which is the healthy direction.
pekko.persistence.circe uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break pekko.persistence.circe, while a change to pekko.persistence.circe can't break com.evolution.kafka.journal.
Position
Below the diagonal: pekko.persistence.circe uses a module listed above it, which is the healthy direction.
pekko.persistence.circe uses pekko.persistence, so a change to pekko.persistence can break pekko.persistence.circe, while a change to pekko.persistence.circe can't break pekko.persistence.
Position
Below the diagonal: pekko.persistence.circe uses a module listed above it, which is the healthy direction.
replicator.Batch uses com.evolution.kafka.journal, so a change to com.evolution.kafka.journal can break replicator.Batch, while a change to replicator.Batch can't break com.evolution.kafka.journal.
Position
Below the diagonal: replicator.Batch uses a module listed above it, which is the healthy direction.
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
40
High / Critical
A03:2025 — Software Supply Chain Failures
3
Medium
Roadmap
Top priorities: Resolve the 39 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (18), REDACTED (7), REDACTED (6); 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; 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.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 39 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (18), REDACTED (7), REDACTED (6).
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.
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.
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 — 40
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 — 144
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 — 16
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 14
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 59 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 — 59 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 188 of 200 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
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, 153 test files), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
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: it declares a published package (build.sbt), but 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.
D34 Knowledge Freshness — 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. File-level freshness contradicts repo activity: 68 commits in the last 90 days, yet 50 of 70 significant files carry no living knowledge. Those two readings cannot both be true, so the per-file recency signal is treated as unreliable here and freshness is not scored for this run.
D44 Platform End-of-Life — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a Dockerfile) is simply not read here yet.
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.
C3 Audit Trail — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'com.datastax' is imported (replicator/src/main/scala/com/evolution/kafka/journal/replicator/ReplicatorConfig.scala:5), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
C4 Data Retention — 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. 'com.datastax' is imported (replicator/src/main/scala/com/evolution/kafka/journal/replicator/ReplicatorConfig.scala:5), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
C5 Data-Subject Rights — 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. 'com.datastax' is imported (replicator/src/main/scala/com/evolution/kafka/journal/replicator/ReplicatorConfig.scala:5), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
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.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
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.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
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.
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.
+ 15 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 4 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with DistributeJob.apply (cyclomatic 65), ReplicatedCassandra.apply (cyclomatic 58), PartitionCache.main (cyclomatic 34). — 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 4 together lifts Cyclomatic Complexity from 6.5 to about 7.4/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 34 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 4 bodies over 120 down to 120 or less in Cognitive Complexity — start with DistributeJob.apply (cognitive 368), TopicReplicator.of (cognitive 185), ReplicatedCassandra.apply (cognitive 159). — 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 4 together lifts Cognitive Complexity from 2.0 to about 3.4/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes9.0 / 10Stronggated by 4 serious findings✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 2 MethodTooLong finding(s) in God Classes — start with Damper.scala, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 FileTooLong finding(s) in God Classes — start with REDACTED, ReplicatedCassandra.scala. — One of this dimension's main actionable groups (2 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
+ 20 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 6 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with KafkaJournal.scala (3), PersistentBinary.scala, OriginExtension.scala. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 3 Duplicated block (13 lines × 2) finding(s) in Code Duplication — start with JournalAdapter.scala (2), ReplicatedKeyJournal.scala. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 3 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with EventSerializer.scala, KafkaJournal.scala, ReplicatedKeyJournal.scala. — One of this dimension's main actionable groups (3 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling9.4 / 10Stronggated by 1 serious finding✓ 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.
14 production modules (sbt), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; a dependsOn spread (deps: _*) and a project whose directory a helper computes are not visible there; 1 module(s) off the main sequence, with abstractness counted on 13 of the 14 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).
Off the main sequence: core
What to do
Resolve the 1 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
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.
462 test methods: 462 unit, 0 integration, 0 BDD, 0 e2e. The Scala suite contributes 462 test case(s) across 101 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.
What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.
1 outdated direct sbt declarations. 3 of 4 direct declarations were graded against Maven Central (1 not published there, which is what a private Nexus or Artifactory artifact looks like, 0 declaring a version range rather than an exact version). An sbt declaration names an EXACT version, so the remedy is an edit to the build file — there is no lockfile refresh that would move it. Test-, Provided- and it-scoped declarations are excluded, because a consumer of this project never receives them. A version held in a Scala val is read only when the val is one string literal: sbt is a program rather than a manifest, and evaluating a computed version would invent the measurement rather than take it. Whether any artifact is DEPRECATED or ABANDONED is not graded and cannot be — Maven Central publishes no such marker, and release age does not stand in for one: the most widely depended-upon libraries are routinely the stalest, being finished rather than abandoned. Known CVEs in this dependency graph are D30's question.
Enforce Dependency Hygiene in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 3 declared sbt dependency artifact(s) use a banned license. Licences were resolved from the POMs Maven Central publishes, over the production coordinates this repository's 2 sbt build file(s) (build.sbt and project/*.scala) declare with a literal version, directly or through a string-literal val — `%%` resolved to the Scala binary suffix Central publishes under, test-scoped declarations excluded — the same declaration-site closure this analysis reads for dependency currency. sbt has no lockfile a checkout carries, so this is deliberately NOT the transitive closure. 46 further production coordinate(s) are declared with a version the build computes rather than writes as a literal — sbt is a program, and this pass does not run it — and are NOT graded: this verdict covers what the build pins literally or through a string-literal val, not the full graph. A further 1 coordinate(s) are not published to Maven Central — another repository (Google's Maven hosts androidx), a SNAPSHOT, or a private artifact — so their licences are not readable from here and they are outside this verdict.
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.
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.
1 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is replicator/src/main/scala/com/evolution/kafka/journal/replicator/TopicReplicatorMetrics.scala. Counted over 70 of the 232 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
✓ On the Gold path — maintain.
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
33 deducted task-comment markers across 18903 LoC (0.2/KLoC) → score 9.7. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
Resolve the 33 TodoComment finding(s) in Explicit Debt — start with ReplicatorIntSpec.scala (6), ReplicatedCassandraTest.scala (6), Journals.scala (3). — One of this dimension's main actionable groups (33 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
1 of 1 build units (sbt) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
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.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
Resolve the 39 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (18), REDACTED (7), REDACTED (6). — One of this dimension's main actionable groups (39 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (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.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 1 Change coupling finding(s) in Change Coupling — start with PlayJsonHelper.scala. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
What it measures: Whether 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.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.
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.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Other · 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.
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.
A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something. (×3) — akka/integration-tests/src/test/scala/com/evolution/kafka/journal/it/BaseJournalIntSpec.scala:193, journal/src/test/scala/com/evolution/kafka/journal/HeadCacheSpec.scala:203, pekko/integration-tests/src/test/scala/com/evolution/kafka/journal/it/BaseJournalIntSpec.scala:193
What to do
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.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.
Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.
Do you agree with this assessment?
P1 · CI/CD gates6.5 / 10Adequate✓ Tool-verified
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.
A CI pipeline exists but no build step was matched — changes may merge without the build ever running. A build step may be invoked directly as a command, or declared as a task that a runner named in the pipeline resolves.
What to do
Add an explicit build step to your CI pipeline — your stack's own build command, or, if the pipeline delegates to a task runner, a build task that runner executes in CI — so every change is built before merge.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
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.
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 782 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/ci.yml:6
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.
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
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.
A JMH/Jetpack Benchmark suite exists but nothing turns on its allocation measurement — allocations (the main way hot code pressures a garbage collector or allocator) aren't being measured. — benchmark/src/test/scala/com/evolution/kafka/journal/JournalReadBenchmark.scala
What to do
Run JMH with the GC profiler (`-prof gc`, or addProfiler(GCProfiler.class)) so allocation rate regressions are visible, not just time.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
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.
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.
Do you agree with this assessment?
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.
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.
Do you agree with this assessment?
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.
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.
Do you agree with this assessment?
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.
`circe.convertPlayToCirce` is public, takes a document from its caller (line 10) and hands it to `convert`, which calls itself at line 20 with a piece of `jsValue` (and at line 25), not as a tail call the compiler turns into a loop — and nowhere in `convert` 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 `convert` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — circe/src/main/scala/com/evolution/kafka/journal/circe/package.scala:20
`circe.convertCirceToPlay` is public, takes a document from its caller (line 31) and hands it to `convert`, which calls itself at line 42 with a piece of `json` (and at line 50), not as a tail call the compiler turns into a loop — and nowhere in `convert` 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 `convert` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — circe/src/main/scala/com/evolution/kafka/journal/circe/package.scala:42
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.
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.
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.
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.
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.
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.
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.
Do you agree with this assessment?
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.
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.
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.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — 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.
Do you agree with this assessment?
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.
Do you agree with this assessment?
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.
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.
Do you agree with this assessment?
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.
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 229 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.
Do you agree with this assessment?
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.
Not evidenced — 5 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Not assessed: this repository stores data through 'com.datastax' (replicator/src/main/scala/com/evolution/kafka/journal/replicator/ReplicatorConfig.scala:5) but declares no persisted model this check reads (Slick table columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL migrations). Personal data may be written through raw SQL or a hosted backend, so whether its changes need an audit trail could not be established, and the trail's absence is not scored.
C4 Data Retention — Not assessed: this repository stores data through 'com.datastax' (replicator/src/main/scala/com/evolution/kafka/journal/replicator/ReplicatorConfig.scala:5) but declares no persisted model this check reads (Slick table columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL migrations). Personal data may be written through raw SQL or a hosted backend, so whether a retention limit applies here could not be established, and its absence is not scored.
C5 Data-Subject Rights — Not assessed: this repository stores data through 'com.datastax' (replicator/src/main/scala/com/evolution/kafka/journal/replicator/ReplicatorConfig.scala:5) but declares no persisted model this check reads (Slick table columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL migrations). Personal data may be written through raw SQL or a hosted backend, so whether data-subject rights apply here could not be established, and their absence is not scored.
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 — 55 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — Not applicable: this repository's 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 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.
AX4 Dependency direction — not applicable to a transaction-script/CRUD architecture (the inward-dependency rule is for layered/clean styles)
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 — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D10 Test Quality — ~17649 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
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.
D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
D21 Naming Consistency — Naming consistency is measured on C# and TypeScript only; Scala 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 .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) — 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.
D34 Knowledge Freshness — knowledge concentrated in recent work — freshness signal contradicted by repo activity
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM1 Domain Modelling — applicable but not scored (1 of 2 signals for this style — below the bar we score at): 78 value object(s)
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
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'.
P2 Observability — This repository's JVM source (1 module(s), 230 file(s) read) declares no entry point and bootstraps no server, and nothing here deploys a service — it is a library, run inside whatever hosts it, so production observability (structured logging, tracing/metrics, health checks) is N/A. If it grows a binary or a service, the dimension reactivates.
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
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
S1 Web-Security Posture — No web surface: 229 Scala file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled TLS certificate validation and obsolete TLS versions, and none was found. This repository serves no HTTP of its own — no HTTP-server artifact (akka-http, pekko-http, http4s, Play, Finagle, zio-http, cask, Scalatra, a tapir server, Jetty, Undertow, …) outside test scope in its build, and no server package imported or server bound in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker. If this codebase starts serving HTTP, the dimension reactivates automatically.
X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X2 Cancellation propagation — no C# was loaded; this repository's Scala was 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
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 Scala was read, and it logs through none that an interpolated message defeats: scala-logging takes an `s"…"` message apart into SLF4J's pattern and arguments at compile time, and log4s, grizzled-slf4j, Play's Logger, Akka's LoggingAdapter, sbt's Logger and Spark's Logging take one finished message (as log4net does in C#). Calls made straight through SLF4J (`org.slf4j.Logger`) would be judged.
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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.
TodoComment replicator/src/main/scala/com/evolution/kafka/journal/replicator/Replicator.scala:36— // TODO TEST — 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 replicator/src/main/scala/com/evolution/kafka/journal/replicator/Replicator.scala:126— // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment pekko/persistence/src/test/scala/com/evolution/kafka/journal/pekko/persistence/JournalAdapterSpec.scala:163— // TODO add Instant as argument — 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 akka/persistence/src/test/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapterSpec.scala:163— // TODO add Instant as argument — 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 pekko/integration-tests/src/test/scala/com/evolution/kafka/journal/it/ReplicatorIntSpec.scala:95— // TODO expiry: implement actual expiration test — 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 akka/integration-tests/src/test/scala/com/evolution/kafka/journal/it/ReplicatorIntSpec.scala:95— // TODO expiry: implement actual expiration test — 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 pekko/integration-tests/src/test/scala/com/evolution/kafka/journal/it/ReplicatorIntSpec.scala:100— // TODO expiry: replicator should handle random message and not fail, headcache as well — 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 akka/integration-tests/src/test/scala/com/evolution/kafka/journal/it/ReplicatorIntSpec.scala:100— // TODO expiry: replicator should handle random message and not fail, headcache as well — 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 pekko/integration-tests/src/test/scala/com/evolution/kafka/journal/it/ReplicatorIntSpec.scala:112— // TODO expiry: how to verify — 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 akka/integration-tests/src/test/scala/com/evolution/kafka/journal/it/ReplicatorIntSpec.scala:112— // TODO expiry: how to verify — 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 journal/src/test/scala/com/evolution/kafka/journal/HeadCacheSpec.scala:202— // TODO headcache: how to test? — 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 journal/src/test/scala/com/evolution/kafka/journal/JournalSpec.scala:31— // TODO add test when Kafka missing it's tail comparing to eventual — 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 journal/src/test/scala/com/evolution/kafka/journal/JournalSpec.scala:683— // TODO implement via mocking EventualCassandra — 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 journal/src/test/scala/com/evolution/kafka/journal/eventual/EventualJournalSpec.scala:527— // TODO add test for custom offset — 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 journal/src/test/scala/com/evolution/kafka/journal/eventual/EventualJournalSpec.scala:552— // TODO expiry: define expireAfter and test — 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 journal/src/main/scala/com/evolution/kafka/journal/Journals.scala:220— // TODO refactor this, pass from offset, rather than from - 1 — 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 journal/src/main/scala/com/evolution/kafka/journal/Journals.scala:305— // TODO refactor, we don't need to call `eventual.pointer` without using it's offset — 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 journal/src/main/scala/com/evolution/kafka/journal/Journals.scala:325— // TODO not delete already deleted, do not accept deleteTo=2 when already deleteTo=3 — 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 journal/src/main/scala/com/evolution/kafka/journal/PayloadAndType.scala:121— // TODO not used — 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 journal/src/main/scala/com/evolution/kafka/journal/StreamActionRecords.scala:61— // TODO add range argument — 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 journal/src/main/scala/com/evolution/kafka/journal/StreamActionRecords.scala:69— // TODO compare partitions ! — 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 journal/src/main/scala/com/evolution/kafka/journal/util/SkafkaHelper.scala:10— // TODO move to skafka & scassandra — 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 eventual-cassandra/src/main/scala/com/evolution/kafka/journal/cassandra/SkafkaHelperExtension.scala:11— // TODO move to skafka & scassandra — 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 eventual-cassandra/src/test/scala/com/evolution/kafka/journal/eventual/cassandra/EventualCassandraSpec.scala:21— // TODO expiry: test purge — 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 eventual-cassandra/src/test/scala/com/evolution/kafka/journal/eventual/cassandra/ReplicatedCassandraTest.scala:1712— // TODO MR why not `400`?! — 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.
Duplicated block (8 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:351— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:351-358 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala:351-358 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 145 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/PersistentBinary.scala:17— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/PersistentBinary.scala:17-24 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/PersistentBinary.scala:17-24 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: `PersistentRepr` names `akka.persistence.PersistentRepr` in one and `org.apache.pekko.persistence.PersistentRepr` 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.
Duplicated block (8 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/OriginExtension.scala:20— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/OriginExtension.scala:20-27 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/OriginExtension.scala:20-27 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala:87— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala:87-94 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/EventSerializer.scala:87-94 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/EventSerializer.scala` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 149 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: `PersistentRepr` names `akka.persistence.PersistentRepr` in one and `org.apache.pekko.persistence.PersistentRepr` 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.
Duplicated block (8 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:167— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:167-174 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala:167-174 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 145 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:176— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:176-183 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala:176-183 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 145 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala:51— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala:51-63 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/JournalAdapter.scala:51-63 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/JournalAdapter.scala` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 185 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 (13 lines × 2) journal/src/main/scala/com/evolution/kafka/journal/eventual/ReplicatedKeyJournal.scala:133— journal/src/main/scala/com/evolution/kafka/journal/eventual/ReplicatedKeyJournal.scala:133-145 | journal/src/main/scala/com/evolution/kafka/journal/eventual/ReplicatedKeyJournal.scala:187-199 — both copies are in the same file, so extract the 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 `journal/src/main/scala/com/evolution/kafka/journal/eventual/ReplicatedKeyJournal.scala:133` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala:232— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala:232-244 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/JournalAdapter.scala:232-244 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/JournalAdapter.scala` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala:276— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala:276-285 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/EventSerializer.scala:276-285 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/EventSerializer.scala` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 149 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: `PersistentRepr` names `akka.persistence.PersistentRepr` in one and `org.apache.pekko.persistence.PersistentRepr` 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.
Duplicated block (10 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:363— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:363-372 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala:363-372 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 145 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) journal/src/main/scala/com/evolution/kafka/journal/eventual/ReplicatedKeyJournal.scala:115— journal/src/main/scala/com/evolution/kafka/journal/eventual/ReplicatedKeyJournal.scala:115-124 | journal/src/main/scala/com/evolution/kafka/journal/eventual/ReplicatedKeyJournal.scala:176-185 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `journal/src/main/scala/com/evolution/kafka/journal/eventual/ReplicatedKeyJournal.scala:115` 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) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/AppendMetadataOf.scala:16— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/AppendMetadataOf.scala:16-21 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/AppendMetadataOf.scala:16-21 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/AppendMetadataOf.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/AppendMetadataOf.scala` as WHOLE FILES: 84% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 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. Note first that the copies are not typed on the same thing: `PersistentRepr` names `akka.persistence.PersistentRepr` in one and `org.apache.pekko.persistence.PersistentRepr` 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.
Duplicated block (6 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:336— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:336-341 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala:336-341 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 145 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) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/SerializedMsgSerializer.scala:53— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/SerializedMsgSerializer.scala:53-58 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/SerializedMsgSerializer.scala:53-58 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/SerializedMsgSerializer.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/SerializedMsgSerializer.scala` as WHOLE FILES: 91% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. 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.
KafkaJournal.adapterIO (cyclomatic 19) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:195— KafkaJournal.adapterIO has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
KafkaJournal.adapterIO (cyclomatic 19) pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala:195— KafkaJournal.adapterIO has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
JournalAdapter.apply (cyclomatic 17) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala:151— JournalAdapter.apply has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
JournalAdapter.apply (cyclomatic 17) pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/JournalAdapter.scala:151— JournalAdapter.apply has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
KafkaJournal.adapterIO (cognitive 110) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:195— KafkaJournal.adapterIO has cognitive complexity 110 (threshold 15). Drivers by points: loops 16 (106 pts), match/switch 1 (4 pts) (nesting depth added 93). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
KafkaJournal.adapterIO (cognitive 110) pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala:195— KafkaJournal.adapterIO has cognitive complexity 110 (threshold 15). Drivers by points: loops 16 (106 pts), match/switch 1 (4 pts) (nesting depth added 93). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
JournalAdapter.apply (cognitive 35) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala:151— JournalAdapter.apply has cognitive complexity 35 (threshold 15). Drivers by points: loops 13 (27 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
JournalAdapter.apply (cognitive 35) pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/JournalAdapter.scala:151— JournalAdapter.apply has cognitive complexity 35 (threshold 15). Drivers by points: loops 13 (27 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
MethodTooLong: Damper.of journal/src/main/scala/com/evolution/kafka/journal/Damper.scala:82— MethodTooLong — of runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ReplicateRecords.apply REDACTED:28— MethodTooLong — apply runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FileTooLong: REDACTED REDACTED— FileTooLong — 513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13 over it, 1.03× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: cassandra/ReplicatedCassandra.scala eventual-cassandra/src/main/scala/com/evolution/kafka/journal/eventual/cassandra/ReplicatedCassandra.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.
Duplicated block (41 lines × 2) akka/persistence-circe/src/main/scala/com/evolution/kafka/journal/akka/persistence/circe/KafkaJournalCirce.scala:50— akka/persistence-circe/src/main/scala/com/evolution/kafka/journal/akka/persistence/circe/KafkaJournalCirce.scala:50-90 | pekko/persistence-circe/src/main/scala/com/evolution/kafka/journal/pekko/persistence/circe/KafkaJournalCirce.scala:50-90 — before extracting anything, compare `akka/persistence-circe/src/main/scala/com/evolution/kafka/journal/akka/persistence/circe/KafkaJournalCirce.scala` and `pekko/persistence-circe/src/main/scala/com/evolution/kafka/journal/pekko/persistence/circe/KafkaJournalCirce.scala` as WHOLE FILES: 93% 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. 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. Note first that the copies are not typed on the same thing: `PersistentRepresentation` names `com.evolution.kafka.journal.akka.persistence.EventSerializer.PersistentRepresentation` in one and `com.evolution.kafka.journal.pekko.persistence.EventSerializer.PersistentRepresentation` 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.
Duplicated block (41 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/LogFromAkka.scala:10— akka/persistence/src/main/scala/com/evolution/kafka/journal/LogFromAkka.scala:10-50 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/LogFromPekko.scala:10-50 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/LogFromAkka.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/LogFromPekko.scala` as WHOLE FILES: 88% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: `LoggingAdapter` names `_root_.akka.event.LoggingAdapter` in one and `org.apache.pekko.event.LoggingAdapter` 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.
Duplicated block (11 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/ToKey.scala:23— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/ToKey.scala:23-33 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/ToKey.scala:23-33 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/ToKey.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/ToKey.scala` as WHOLE FILES: 98% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. 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) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/Batching.scala:16— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/Batching.scala:16-26 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/Batching.scala:16-26 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/Batching.scala:16` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: `AtomicWrite` names `akka.persistence.AtomicWrite` in one and `org.apache.pekko.persistence.AtomicWrite` 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.
Duplicated block (7 lines × 2) journal/src/main/scala/com/evolution/kafka/journal/Journal.scala:145— journal/src/main/scala/com/evolution/kafka/journal/Journal.scala:145-151 | journal/src/main/scala/com/evolution/kafka/journal/Journal.scala:241-247 — both copies are in the same file, so extract the 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 `journal/src/main/scala/com/evolution/kafka/journal/Journal.scala:145` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) replicator/src/main/scala/com/evolution/kafka/journal/replicator/PurgeExpired.scala:86— replicator/src/main/scala/com/evolution/kafka/journal/replicator/PurgeExpired.scala:86-92 | replicator/src/main/scala/com/evolution/kafka/journal/replicator/PurgeExpired.scala:106-112 — both copies are in the same file, so extract the 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 `replicator/src/main/scala/com/evolution/kafka/journal/replicator/PurgeExpired.scala:86` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:278— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:278-292 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala:278-292 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 145 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 `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:278` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:310— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:310-324 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala:310-324 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 145 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 `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:310` 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.
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 circe/src/main/scala/com/evolution/kafka/journal/circe/package.scala:20— `circe.convertPlayToCirce` is public, takes a document from its caller (line 10) and hands it to `convert`, which calls itself at line 20 with a piece of `jsValue` (and at line 25), not as a tail call the compiler turns into a loop — and nowhere in `convert` 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 `convert` 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 circe/src/main/scala/com/evolution/kafka/journal/circe/package.scala:42— `circe.convertCirceToPlay` is public, takes a document from its caller (line 31) and hands it to `convert`, which calls itself at line 42 with a piece of `json` (and at line 50), not as a tail call the compiler turns into a loop — and nowhere in `convert` 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 `convert` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
DistributeJob.apply (cyclomatic 65) replicator/src/main/scala/com/evolution/kafka/journal/replicator/DistributeJob.scala:82— DistributeJob.apply has cyclomatic complexity 65 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
ReplicatedCassandra.apply (cyclomatic 58) eventual-cassandra/src/main/scala/com/evolution/kafka/journal/eventual/cassandra/ReplicatedCassandra.scala:85— ReplicatedCassandra.apply has cyclomatic complexity 58 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
PartitionCache.main (cyclomatic 34) journal/src/main/scala/com/evolution/kafka/journal/PartitionCache.scala:128— PartitionCache.main has cyclomatic complexity 34 (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.
Journals.apply (cyclomatic 32) journal/src/main/scala/com/evolution/kafka/journal/Journals.scala:111— Journals.apply has cyclomatic complexity 32 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
ReplicateRecords.apply (cyclomatic 30) REDACTED:28— ReplicateRecords.apply has cyclomatic complexity 30 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
JournalOps.withMetrics (cyclomatic 29) journal/src/main/scala/com/evolution/kafka/journal/Journal.scala:291— JournalOps.withMetrics has cyclomatic complexity 29 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
TopicReplicator.of (cyclomatic 29) replicator/src/main/scala/com/evolution/kafka/journal/replicator/TopicReplicator.scala:81— TopicReplicator.of has cyclomatic complexity 29 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
JournalOps.withLog (cyclomatic 27) journal/src/main/scala/com/evolution/kafka/journal/Journal.scala:105— JournalOps.withLog has cyclomatic complexity 27 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
State.fold (cyclomatic 27) replicator/src/main/scala/com/evolution/kafka/journal/replicator/Batch.scala:81— State.fold 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.
Damper.of (cyclomatic 26) journal/src/main/scala/com/evolution/kafka/journal/Damper.scala:82— Damper.of has cyclomatic complexity 26 (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.
Group.make (cyclomatic 25) journal/src/main/scala/com/evolution/kafka/journal/Group.scala:17— Group.make 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.
EventualCassandra.apply (cyclomatic 23) eventual-cassandra/src/main/scala/com/evolution/kafka/journal/eventual/cassandra/EventualCassandra.scala:97— EventualCassandra.apply has cyclomatic complexity 23 (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.
TopicCache.make (cyclomatic 20) journal/src/main/scala/com/evolution/kafka/journal/TopicCache.scala:78— TopicCache.make has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
TopicReplicatorMetrics.make (cyclomatic 20) replicator/src/main/scala/com/evolution/kafka/journal/replicator/TopicReplicatorMetrics.scala:72— TopicReplicatorMetrics.make has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
EventualJournalOps.withMetrics (cyclomatic 19) journal/src/main/scala/com/evolution/kafka/journal/eventual/EventualJournal.scala:285— EventualJournalOps.withMetrics has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
SettingsOps.withLog (cyclomatic 17) core/src/main/scala/com/evolution/kafka/journal/Settings.scala:33— SettingsOps.withLog has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
EventualJournalOps.withLog (cyclomatic 17) journal/src/main/scala/com/evolution/kafka/journal/eventual/EventualJournal.scala:225— EventualJournalOps.withLog has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
TopicCacheOps.withMetrics (cyclomatic 16) journal/src/main/scala/com/evolution/kafka/journal/TopicCache.scala:512— TopicCacheOps.withMetrics has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
DistributeJob.apply (cognitive 368) replicator/src/main/scala/com/evolution/kafka/journal/replicator/DistributeJob.scala:82— DistributeJob.apply has cognitive complexity 368 (threshold 15). Drivers by points: loops 27 (205 pts), match/switch 15 (124 pts), if/else 8 (39 pts) (nesting depth added 318). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
TopicReplicator.of (cognitive 185) replicator/src/main/scala/com/evolution/kafka/journal/replicator/TopicReplicator.scala:81— TopicReplicator.of has cognitive complexity 185 (threshold 15). Drivers by points: loops 27 (174 pts), if/else 2 (11 pts) (nesting depth added 156). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
ReplicatedCassandra.apply (cognitive 159) eventual-cassandra/src/main/scala/com/evolution/kafka/journal/eventual/cassandra/ReplicatedCassandra.scala:85— ReplicatedCassandra.apply has cognitive complexity 159 (threshold 15). Drivers by points: loops 31 (100 pts), if/else 19 (39 pts), match/switch 7 (20 pts) (nesting depth added 102). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
TopicReplicatorMetrics.make (cognitive 159) replicator/src/main/scala/com/evolution/kafka/journal/replicator/TopicReplicatorMetrics.scala:72— TopicReplicatorMetrics.make has cognitive complexity 159 (threshold 15). Drivers by points: loops 19 (159 pts) (nesting depth added 140). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
TopicCache.make (cognitive 94) journal/src/main/scala/com/evolution/kafka/journal/TopicCache.scala:78— TopicCache.make has cognitive complexity 94 (threshold 15). Drivers by points: loops 15 (83 pts), match/switch 2 (11 pts) (nesting depth added 77). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
Metrics.make (cognitive 74) journal/src/main/scala/com/evolution/kafka/journal/HeadCache.scala:434— Metrics.make has cognitive complexity 74 (threshold 15). Drivers by points: loops 12 (66 pts), if/else 2 (8 pts) (nesting depth added 60). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
JournalOps.withLog (cognitive 67) journal/src/main/scala/com/evolution/kafka/journal/Journal.scala:105— JournalOps.withLog has cognitive complexity 67 (threshold 15). Drivers by points: loops 24 (60 pts), if/else 4 (7 pts) (nesting depth added 39). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
ConsumerPool.make (cognitive 66) journal/src/main/scala/com/evolution/kafka/journal/ConsumerPool.scala:21— ConsumerPool.make has cognitive complexity 66 (threshold 15). Drivers by points: loops 11 (66 pts) (nesting depth added 55). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
JournalOps.withMetrics (cognitive 66) journal/src/main/scala/com/evolution/kafka/journal/Journal.scala:291— JournalOps.withMetrics has cognitive complexity 66 (threshold 15). Drivers by points: loops 28 (66 pts) (nesting depth added 38). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
PartitionCache.main (cognitive 63) journal/src/main/scala/com/evolution/kafka/journal/PartitionCache.scala:128— PartitionCache.main has cognitive complexity 63 (threshold 15). Drivers by points: match/switch 12 (30 pts), loops 6 (17 pts), if/else 11 (16 pts) (nesting depth added 34). 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.
Journals.apply (cognitive 58) journal/src/main/scala/com/evolution/kafka/journal/Journals.scala:111— Journals.apply has cognitive complexity 58 (threshold 15). Drivers by points: loops 15 (42 pts), match/switch 5 (12 pts), if/else 2 (4 pts) (nesting depth added 36). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
Metrics.make (cognitive 54) journal/src/main/scala/com/evolution/kafka/journal/eventual/ReplicatedJournal.scala:246— Metrics.make has cognitive complexity 54 (threshold 15). Drivers by points: loops 9 (45 pts), if/else 2 (9 pts) (nesting depth added 43). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
ReplicateRecords.apply (cognitive 53) REDACTED:28— ReplicateRecords.apply has cognitive complexity 53 (threshold 15). Drivers by points: loops 22 (40 pts), if/else 8 (12 pts), match/switch 1 (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
StreamActionRecords.apply (cognitive 48) journal/src/main/scala/com/evolution/kafka/journal/StreamActionRecords.scala:60— StreamActionRecords.apply has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 4 (14 pts), match/switch 1 (6 pts) (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
Damper.of (cognitive 47) journal/src/main/scala/com/evolution/kafka/journal/Damper.scala:82— Damper.of has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 7 (12 pts), loops 4 (10 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MetaJournalStatements.of (cognitive 45) eventual-cassandra/src/main/scala/com/evolution/kafka/journal/eventual/cassandra/ReplicatedCassandra.scala:523— MetaJournalStatements.of has cognitive complexity 45 (threshold 15). Drivers by points: loops 9 (45 pts) (nesting depth added 36). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Statements.of) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Statements.of (cognitive 45) eventual-cassandra/src/main/scala/com/evolution/kafka/journal/eventual/cassandra/ReplicatedCassandra.scala:667— Statements.of has cognitive complexity 45 (threshold 15). Drivers by points: loops 9 (45 pts) (nesting depth added 36). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (MetaJournalStatements.of) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
EventualJournalOps.withMetrics (cognitive 43) journal/src/main/scala/com/evolution/kafka/journal/eventual/EventualJournal.scala:285— EventualJournalOps.withMetrics has cognitive complexity 43 (threshold 15). Drivers by points: loops 18 (43 pts) (nesting depth added 25). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
SettingsOps.withLog (cognitive 40) core/src/main/scala/com/evolution/kafka/journal/Settings.scala:33— SettingsOps.withLog has cognitive complexity 40 (threshold 15). Drivers by points: loops 16 (40 pts) (nesting depth added 24). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
EventualJournalOps.withLog (cognitive 40) journal/src/main/scala/com/evolution/kafka/journal/eventual/EventualJournal.scala:225— EventualJournalOps.withLog has cognitive complexity 40 (threshold 15). Drivers by points: loops 16 (40 pts) (nesting depth added 24). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
Replicator.start (cognitive 40) replicator/src/main/scala/com/evolution/kafka/journal/replicator/Replicator.scala:152— Replicator.start has cognitive complexity 40 (threshold 15). Drivers by points: loops 11 (35 pts), if/else 2 (5 pts) (nesting depth added 27). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
Replicator.make (cognitive 35) replicator/src/main/scala/com/evolution/kafka/journal/replicator/Replicator.scala:94— Replicator.make has cognitive complexity 35 (threshold 15). Drivers by points: loops 8 (28 pts), match/switch 1 (6 pts), if/else 1 (nesting depth added 25). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
State.fold (cognitive 33) replicator/src/main/scala/com/evolution/kafka/journal/replicator/Batch.scala:81— State.fold has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 8 (19 pts), if/else 6 (14 pts) (nesting depth added 19). 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.
EventualCassandra.apply (cognitive 31) eventual-cassandra/src/main/scala/com/evolution/kafka/journal/eventual/cassandra/EventualCassandra.scala:97— EventualCassandra.apply has cognitive complexity 31 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 6 (8 pts), match/switch 4 (7 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
ReplicatedKeyJournalOps.withLog (cognitive 30) journal/src/main/scala/com/evolution/kafka/journal/eventual/ReplicatedKeyJournal.scala:104— ReplicatedKeyJournalOps.withLog has cognitive complexity 30 (threshold 15). Drivers by points: loops 12 (30 pts) (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (ReplicatedKeyJournalOps.withMetrics) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
ReplicatedKeyJournalOps.withMetrics (cognitive 30) journal/src/main/scala/com/evolution/kafka/journal/eventual/ReplicatedKeyJournal.scala:167— ReplicatedKeyJournalOps.withMetrics has cognitive complexity 30 (threshold 15). Drivers by points: loops 12 (30 pts) (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (ReplicatedKeyJournalOps.withLog) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
ReplicatedPartitionJournalOps.withLog (cognitive 30) journal/src/main/scala/com/evolution/kafka/journal/eventual/ReplicatedPartitionJournal.scala:92— ReplicatedPartitionJournalOps.withLog has cognitive complexity 30 (threshold 15). Drivers by points: loops 12 (30 pts) (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (ReplicatedPartitionJournalOps.withMetrics) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
ReplicatedPartitionJournalOps.withMetrics (cognitive 30) journal/src/main/scala/com/evolution/kafka/journal/eventual/ReplicatedPartitionJournal.scala:146— ReplicatedPartitionJournalOps.withMetrics has cognitive complexity 30 (threshold 15). Drivers by points: loops 12 (30 pts) (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (ReplicatedPartitionJournalOps.withLog) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
ReplicatedCassandra.of (cognitive 28) eventual-cassandra/src/main/scala/com/evolution/kafka/journal/eventual/cassandra/ReplicatedCassandra.scala:41— ReplicatedCassandra.of has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (28 pts) (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
HeadCacheConsumption.apply (cognitive 28) journal/src/main/scala/com/evolution/kafka/journal/HeadCacheConsumption.scala:47— HeadCacheConsumption.apply has cognitive complexity 28 (threshold 15). Drivers by points: loops 11 (28 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
JournalMetrics.make (cognitive 24) journal/src/main/scala/com/evolution/kafka/journal/JournalMetrics.scala:57— JournalMetrics.make has cognitive complexity 24 (threshold 15). Drivers by points: loops 7 (24 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
ExpiryServiceOps.withLog (cognitive 22) eventual-cassandra/src/main/scala/com/evolution/kafka/journal/eventual/cassandra/ExpiryService.scala:109— ExpiryServiceOps.withLog has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (20 pts), if/else 1, match/switch 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
ConsumeActionRecords.apply (cognitive 22) journal/src/main/scala/com/evolution/kafka/journal/ConsumeActionRecords.scala:20— ConsumeActionRecords.apply has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (22 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
CreateKeyspace.apply (cognitive 20) cassandra/src/main/scala/com/evolution/kafka/journal/cassandra/CreateKeyspace.scala:18— CreateKeyspace.apply has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 2 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
CreateTables.apply (cognitive 20) cassandra/src/main/scala/com/evolution/kafka/journal/cassandra/CreateTables.scala:32— CreateTables.apply has cognitive complexity 20 (threshold 15). Drivers by points: loops 9 (20 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
ResultSet.apply (cognitive 20) cassandra/src/main/scala/com/evolution/kafka/journal/eventual/cassandra/ResultSet.scala:26— ResultSet.apply has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
TopicCacheOps.withMetrics (cognitive 20) journal/src/main/scala/com/evolution/kafka/journal/TopicCache.scala:512— TopicCacheOps.withMetrics has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (15 pts), match/switch 2 (5 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
Change coupling: PlayJsonHelper.scala ↔ ScodecHelper.scala core/src/main/scala/com/evolution/kafka/journal/util/PlayJsonHelper.scala:1— `core/src/main/scala/com/evolution/kafka/journal/util/PlayJsonHelper.scala` and `core/src/main/scala/com/evolution/kafka/journal/util/ScodecHelper.scala` change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in 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 8 shared commits counted here, the most recent 3 are `d7e41242` Scala 3 support (#758) (at that commit the files were still `core/src/main/scala/com/evolutiongaming/kafka/journal/util/PlayJsonHelper.scala` and `core/src/main/scala/com/evolutiongaming/kafka/journal/util/ScodecHelper.scala`); `c305ee7e` Clean unused imports (at that commit the files were still `journal/src/main/scala/com/evolutiongaming/kafka/journal/util/PlayJsonHelper.scala` and `journal/src/main/scala/com/evolutiongaming/kafka/journal/util/ScodecHelper.scala`); `4df37cc6` Configurable JsonCodec in Replicator (#136) (at that commit the files were still `journal/src/main/scala/com/evolutiongaming/kafka/journal/util/PlayJsonHelper.scala` and `journal/src/main/scala/com/evolutiongaming/kafka/journal/util/ScodecHelper.scala`) — run `git show` on any of them.
Duplicated block (70 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala:159— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala:159-228 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/JournalAdapter.scala:159-228 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/JournalAdapter.scala` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 185 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 (67 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala:83— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala:83-149 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/JournalAdapter.scala:83-149 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/JournalAdapter.scala` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 185 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 (61 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:200— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:200-260 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala:200-260 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 145 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 (59 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala:214— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala:214-272 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/EventSerializer.scala:214-272 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/EventSerializer.scala` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 149 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 `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala:214` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: `PersistentRepr` names `akka.persistence.PersistentRepr` in one and `org.apache.pekko.persistence.PersistentRepr` 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.
Duplicated block (51 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala:133— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala:133-183 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/EventSerializer.scala:133-183 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/EventSerializer.scala` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 149 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 `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala:133` 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 (37 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/ToKey.scala:35— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/ToKey.scala:35-71 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/ToKey.scala:35-71 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/ToKey.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/ToKey.scala` as WHOLE FILES: 98% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (22–23 lines × 2) REDACTED:143— REDACTED:143-165 | REDACTED:184-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 `REDACTED:143` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (22 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala:250— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala:250-271 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/JournalAdapter.scala:250-271 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/JournalAdapter.scala` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 185 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 `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/JournalAdapter.scala:250` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (21 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala:184— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala:184-204 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/EventSerializer.scala:184-204 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/EventSerializer.scala` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 149 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 `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/EventSerializer.scala:184` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/GroupByWeight.scala:11— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/GroupByWeight.scala:11-26 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/GroupByWeight.scala:11-26 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/GroupByWeight.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/GroupByWeight.scala` as WHOLE FILES: 94% 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. Read the line range as the matched WINDOW rather than a finished unit: at `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/GroupByWeight.scala:11` 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 (14 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/SerializedMsgSerializer.scala:36— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/SerializedMsgSerializer.scala:36-49 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/SerializedMsgSerializer.scala:36-49 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/SerializedMsgSerializer.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/SerializedMsgSerializer.scala` as WHOLE FILES: 91% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. 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 × 3) journal/src/main/scala/com/evolution/kafka/journal/eventual/EventualJournal.scala:151— journal/src/main/scala/com/evolution/kafka/journal/eventual/EventualJournal.scala:151-162 | journal/src/main/scala/com/evolution/kafka/journal/eventual/ReplicatedJournal.scala:271-282 | replicator/src/main/scala/com/evolution/kafka/journal/replicator/TopicReplicatorMetrics.scala:85-96 — 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 `journal/src/main/scala/com/evolution/kafka/journal/eventual/EventualJournal.scala:151` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (10–12 lines × 2) REDACTED:120— REDACTED:120-131 | REDACTED:145-154 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:120` 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 × 3) core/src/main/scala/com/evolution/kafka/journal/Settings.scala:72— core/src/main/scala/com/evolution/kafka/journal/Settings.scala:72-81 | journal/src/main/scala/com/evolution/kafka/journal/eventual/EventualJournal.scala:237-246 | journal/src/main/scala/com/evolution/kafka/journal/eventual/EventualJournal.scala:260-269 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (31 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/ActorSystemRef.scala:21— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/ActorSystemRef.scala:21-51 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/ActorSystemRef.scala:21-51 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/ActorSystemRef.scala:21` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (9 lines × 2) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:132— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:132-140 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala:132-140 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 145 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) akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:326— akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala:326-330 | pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala:326-330 — before extracting anything, compare `akka/persistence/src/main/scala/com/evolution/kafka/journal/akka/persistence/KafkaJournal.scala` and `pekko/persistence/src/main/scala/com/evolution/kafka/journal/pekko/persistence/KafkaJournal.scala` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 145 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.
Off the main sequence: core — core: abstractness 0.22, instability 0.00, distance 0.78 — zone of pain — concrete and depended on by 3 project(s), so it's rigid to change.
Disabled test akka/integration-tests/src/test/scala/com/evolution/kafka/journal/it/BaseJournalIntSpec.scala:193— A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
Disabled test journal/src/test/scala/com/evolution/kafka/journal/HeadCacheSpec.scala:203— A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
Disabled test pekko/integration-tests/src/test/scala/com/evolution/kafka/journal/it/BaseJournalIntSpec.scala:193— A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: replicator/src/main/scala/com/evolution/kafka/journal/replicator/TopicReplicatorMetrics.scala. Pair on, review, or document these before any departure.
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)` (18903 LoC, 584 module-visible types across 26 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.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
M2 · Architecture documentation· No architecture diagram/doc · ×1
No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
P1 · CI/CD gates· CI build step not evidenced · ×1
CI build step not evidenced — A CI pipeline exists but no build step was matched — changes may merge without the build ever running. A build step may be invoked directly as a command, or declared as a task that a runner named in the pipeline resolves.
No SAST .github/workflows/ci.yml:6— 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 782 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.
No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
Benchmarks don't track allocations benchmark/src/test/scala/com/evolution/kafka/journal/JournalReadBenchmark.scala— A JMH/Jetpack Benchmark suite exists but nothing turns on its allocation measurement — allocations (the main way hot code pressures a garbage collector or allocator) aren't being measured.
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 229 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.
Outdated: com.datastax.cassandra:cassandra-driver-core — `com.datastax.cassandra %% cassandra-driver-core` is declared at 3.11.5 in project/Dependencies.scala, but 4.0.0 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.11.5 until the declaration is edited — there is no lockfile refresh that would move it.
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.
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
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.
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.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
Run 01a1b89d-811c-7b3d-8227-a5e85563018d · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 40 · Warnings: 144 · Recommendations: 15 · Info: 1 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 08-11-2026 @ 00:44 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.